On bulk singularities in the random normal matrix model

We extend the method of rescaled Ward identities of Ameur-Kang-Makarov to study the distribution of eigenvalues close to a bulk singularity, i.e. a point in the interior of the droplet where the density of the classical equilibrium measure vanishes. We prove results to the effect that a certain "dominant part" of the Taylor expansion determines the microscopic properties near a bulk singularity. A description of the distribution is given in terms of a special entire function, which depends on the nature of the singularity (a Mittag-Leffler function in the case of a rotationally symmetric singularity).Comment: This version clarifies on the proof of Theorem

Case Report: Renal Artery Aneurysm Presenting with Hematuria

Renal artery aneurysm is a relatively uncommon form of renovascular disease. Early diagnosis by appropriate imaging is essential in order to avoid emergency nephrectomy for rupture. We report a 78 year old man who presented with gross hematuria. Doppler ultrasound and CT showed aneurysm of the right renal artery. Because of hemodynamic instability, right nephrectomy was performed with a good outcome.Key Words: Renal artery, aneurysm, treatmen

Management of encrusted ureteral stents

Objectives: To present our experience in managing encrusted ureteral stents and to review the literature on the subject.Methods: A total of 22 patients with encrusted ureteral stent were treated in our department. Encrustation of the stent and associated stone burden were evaluated using plain radiography, sometimes supplemented by intravenous urography or ultrasonography. The treatment method was determined by the site of encrustation, the size of the stone burden and the availability of endourologic equipment.Results: Stents were inserted for stone disease in 17 patients, for congenital abnormality in 3 and for ureteric obstruction by malignancy in 2. Stents were left in place for a mean of 10.8 months (range 5–34 months). The site of encrustation was in the bladder in 15 (68.2%), ureter in 13 (59%) and kidney in 8 patients (36.4%); more than one site was involved in 11 (50%) cases. For upper coil encrustations, retrograde ureterorenoscopy was performed in 9 cases, percutaneous nephrolithotomy in 4 and open pyelolithotomy in 2. For lower coil encrustation, fragmentation by grasper and/or transurethral cystolithotripsy was attempted in 11 cases, and suprapubic cystolithotomy was required for failure in 7 cases. Sixteen patients (72.7%) were rendered stone-free and 5 (22.7%) had clinically insignificant residual stones (3mm or less).Conclusions: Encrustation is one of the most difficult complications of ureteral stents and its management is a complex clinical scenario for the treating surgeon. The combination of several surgical techniques is often necessary but the best treatment remains the prevention of this problem by providing patient education

On the Computational Complexity of Vertex Integrity and Component Order Connectivity

The Weighted Vertex Integrity (wVI) problem takes as input an $n$-vertex graph $G$, a weight function $w:V(G)\to\mathbb{N}$, and an integer $p$. The task is to decide if there exists a set $X\subseteq V(G)$ such that the weight of $X$ plus the weight of a heaviest component of $G-X$ is at most $p$. Among other results, we prove that: (1) wVI is NP-complete on co-comparability graphs, even if each vertex has weight $1$; (2) wVI can be solved in $O(p^{p+1}n)$ time; (3) wVI admits a kernel with at most $p^3$ vertices. Result (1) refutes a conjecture by Ray and Deogun and answers an open question by Ray et al. It also complements a result by Kratsch et al., stating that the unweighted version of the problem can be solved in polynomial time on co-comparability graphs of bounded dimension, provided that an intersection model of the input graph is given as part of the input. An instance of the Weighted Component Order Connectivity (wCOC) problem consists of an $n$-vertex graph $G$, a weight function $w:V(G)\to \mathbb{N}$, and two integers $k$ and $l$, and the task is to decide if there exists a set $X\subseteq V(G)$ such that the weight of $X$ is at most $k$ and the weight of a heaviest component of $G-X$ is at most $l$. In some sense, the wCOC problem can be seen as a refined version of the wVI problem. We prove, among other results, that: (4) wCOC can be solved in $O(\min\{k,l\}\cdot n^3)$ time on interval graphs, while the unweighted version can be solved in $O(n^2)$ time on this graph class; (5) wCOC is W[1]-hard on split graphs when parameterized by $k$ or by $l$; (6) wCOC can be solved in $2^{O(k\log l)} n$ time; (7) wCOC admits a kernel with at most $kl(k+l)+k$ vertices. We also show that result (6) is essentially tight by proving that wCOC cannot be solved in $2^{o(k \log l)}n^{O(1)}$ time, unless the ETH fails.Comment: A preliminary version of this paper already appeared in the conference proceedings of ISAAC 201

Sentiment analysis tools should take account of the number of exclamation marks!!!

There are various factors that affect the sentiment level expressed in textual comments. Capitalization of letters tends to mark something for attention and repeating of letters tends to strengthen the emotion. Emoticons are used to help visualize facial expressions which can affect understanding of text. In this paper, we show the effect of the number of exclamation marks used, via testing with twelve online sentiment tools. We present opinions gathered from 500 respondents towards “like” and “dislike” values, with a varying number of exclamation marks. Results show that only 20% of the online sentiment tools tested considered the number of exclamation marks in their returned scores. However, results from our human raters show that the more exclamation marks used for positive comments, the more they have higher “like” values than the same comments with fewer exclamations marks. Similarly, adding more exclamation marks for negative comments, results in a higher “dislike”

Practical Use of Formal Concept Analysis in Service-Oriented Computing

International audiencePervasive applications are encountered in a number of settings, including smart houses, intelligent buildings or connected plants. Service-Oriented Computing is today the technology of choice for implementing and exposing resources in such environments. The selection of appropriate services at the right moment in order to compose meaningful applications is however a real issue. In this paper, we propose a FCA-based solution to this problem.We have integrated FCA algorithms in our pervasive gateways and adapted them in order to allow efficient runtime selection of heterogeneous and dynamic services. This work has been applied to realistic use cases in the scope of a European project

A general wavelet-based profile decomposition in the critical embedding of function spaces

We characterize the lack of compactness in the critical embedding of functions spaces $X\subset Y$ having similar scaling properties in the following terms : a sequence $(u_n)_{n\geq 0}$ bounded in $X$ has a subsequence that can be expressed as a finite sum of translations and dilations of functions $(\phi_l)_{l>0}$ such that the remainder converges to zero in $Y$ as the number of functions in the sum and $n$ tend to $+\infty$. Such a decomposition was established by G\'erard for the embedding of the homogeneous Sobolev space $X=\dot H^s$ into the $Y=L^p$ in $d$ dimensions with $0<s=d/2-d/p$, and then generalized by Jaffard to the case where $X$ is a Riesz potential space, using wavelet expansions. In this paper, we revisit the wavelet-based profile decomposition, in order to treat a larger range of examples of critical embedding in a hopefully simplified way. In particular we identify two generic properties on the spaces $X$ and $Y$ that are of key use in building the profile decomposition. These properties may then easily be checked for typical choices of $X$ and $Y$ satisfying critical embedding properties. These includes Sobolev, Besov, Triebel-Lizorkin, Lorentz, H\"older and BMO spaces.Comment: 24 page

Synchronous Primary Tumors of the Kidney and Pancreas: Case Report

The simultaneous presence of primary carcinomas in the same patient is uncommon and synchronous primary tumors involving the kidney and pancreas are extremely rare. There are a few reports in the English literature of synchronous primary malignancies of the kidney and pancreas. We present a 62-year-old man who had weight loss of 9 kg and epigastric pain. Findings showed a Furhman grade II renal papillary carcinoma confined to the kidney and a synchronous well differentiated pancreatic ductal adenocarcinoma.Key Words: Synchronous double cancer, renal cell carcinoma, pancreatic carcinom