Bond-Propagation Algorithm for Thermodynamic Functions in General 2D Ising Models

Recently, we developed and implemented the bond propagation algorithm for calculating the partition function and correlation functions of random bond Ising models in two dimensions. The algorithm is the fastest available for calculating these quantities near the percolation threshold. In this paper, we show how to extend the bond propagation algorithm to directly calculate thermodynamic functions by applying the algorithm to derivatives of the partition function, and we derive explicit expressions for this transformation. We also discuss variations of the original bond propagation procedure within the larger context of Y-Delta-Y-reducibility and discuss the relation of this class of algorithm to other algorithms developed for Ising systems. We conclude with a discussion on the outlook for applying similar algorithms to other models.Comment: 12 pages, 10 figures; submitte

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs

A (1 + eps)-approximate distance oracle for a graph is a data structure that supports approximate point-to-point shortest-path-distance queries. The most relevant measures for a distance-oracle construction are: space, query time, and preprocessing time. There are strong distance-oracle constructions known for planar graphs (Thorup, JACM'04) and, subsequently, minor-excluded graphs (Abraham and Gavoille, PODC'06). However, these require Omega(eps^{-1} n lg n) space for n-node graphs. We argue that a very low space requirement is essential. Since modern computer architectures involve hierarchical memory (caches, primary memory, secondary memory), a high memory requirement in effect may greatly increase the actual running time. Moreover, we would like data structures that can be deployed on small mobile devices, such as handhelds, which have relatively small primary memory. In this paper, for planar graphs, bounded-genus graphs, and minor-excluded graphs we give distance-oracle constructions that require only O(n) space. The big O hides only a fixed constant, independent of \epsilon and independent of genus or size of an excluded minor. The preprocessing times for our distance oracle are also faster than those for the previously known constructions. For planar graphs, the preprocessing time is O(n lg^2 n). However, our constructions have slower query times. For planar graphs, the query time is O(eps^{-2} lg^2 n). For our linear-space results, we can in fact ensure, for any delta > 0, that the space required is only 1 + delta times the space required just to represent the graph itself

Optimality program in segment and string graphs

Planar graphs are known to allow subexponential algorithms running in time $2^{O(\sqrt n)}$ or $2^{O(\sqrt n \log n)}$ for most of the paradigmatic problems, while the brute-force time $2^{\Theta(n)}$ is very likely to be asymptotically best on general graphs. Intrigued by an algorithm packing curves in $2^{O(n^{2/3}\log n)}$ by Fox and Pach [SODA'11], we investigate which problems have subexponential algorithms on the intersection graphs of curves (string graphs) or segments (segment intersection graphs) and which problems have no such algorithms under the ETH (Exponential Time Hypothesis). Among our results, we show that, quite surprisingly, 3-Coloring can also be solved in time $2^{O(n^{2/3}\log^{O(1)}n)}$ on string graphs while an algorithm running in time $2^{o(n)}$ for 4-Coloring even on axis-parallel segments (of unbounded length) would disprove the ETH. For 4-Coloring of unit segments, we show a weaker ETH lower bound of $2^{o(n^{2/3})}$ which exploits the celebrated Erd\H{o}s-Szekeres theorem. The subexponential running time also carries over to Min Feedback Vertex Set but not to Min Dominating Set and Min Independent Dominating Set.Comment: 19 pages, 15 figure

Large-scale exploitation of sacred chank Xancus pyrum using modified trawl net along Rameswaram Coast, Tamil Nadu

The sacred chank, Xancus pynim is a gregarious, large gastropod and its habitat forms distinct chank bed. Homell as early as 1922 described the chank beds in depths of 10 to 20 metres in the Gulf of Mannar and are considered as the most important ones in the country although there are other chank beds along the Gulf of Kutch and the southwest coast of India

Quasi free-standing epitaxial graphene fabrication on 3C-SiC/Si(111)

© 2018 IOP Publishing Ltd. Growing graphene on SiC thin films on Si is a cheaper alternative to the growth on bulk SiC, and for this reason it has been recently intensively investigated. Here we study the effect of hydrogen intercalation on epitaxial graphene obtained by high temperature annealing on 3C-SiC/Si(111) in ultra-high vacuum. By using a combination of core-level photoelectron spectroscopy, low energy electron diffraction, and near-edge x-ray absorption fine structure (NEXAFS) we find that hydrogen saturates the Si atoms at the topmost layer of the substrate, leading to free-standing graphene on 3C-SiC/Si(111). The intercalated hydrogen fully desorbs after heating the sample at 850 °C and the buffer layer appears again, similar to what has been reported for bulk SiC. However, the NEXAFS analysis sheds new light on the effect of hydrogen intercalation, showing an improvement of graphene's flatness after annealing in atomic H at 600 °C. These results provide new insight into free-standing graphene fabrication on SiC/Si thin films

IoT Device Identification Using Deep Learning

The growing use of IoT devices in organizations has increased the number of attack vectors available to attackers due to the less secure nature of the devices. The widely adopted bring your own device (BYOD) policy which allows an employee to bring any IoT device into the workplace and attach it to an organization's network also increases the risk of attacks. In order to address this threat, organizations often implement security policies in which only the connection of white-listed IoT devices is permitted. To monitor adherence to such policies and protect their networks, organizations must be able to identify the IoT devices connected to their networks and, more specifically, to identify connected IoT devices that are not on the white-list (unknown devices). In this study, we applied deep learning on network traffic to automatically identify IoT devices connected to the network. In contrast to previous work, our approach does not require that complex feature engineering be applied on the network traffic, since we represent the communication behavior of IoT devices using small images built from the IoT devices network traffic payloads. In our experiments, we trained a multiclass classifier on a publicly available dataset, successfully identifying 10 different IoT devices and the traffic of smartphones and computers, with over 99% accuracy. We also trained multiclass classifiers to detect unauthorized IoT devices connected to the network, achieving over 99% overall average detection accuracy

Endocrine Dysfunction in Diamond-Blackfan Anemia (DBA): A Report from the DBA Registry (DBAR)

BACKGROUND: Diamond-Blackfan anemia (DBA) is a rare inherited bone marrow failure syndrome. The mainstays of treatment involve chronic red cell transfusions, long-term glucocorticoid therapy, and stem cell transplantation. Systematic data concerning endocrine function in DBA are limited. We studied patients in the DBA Registry (DBAR) of North America to assess the prevalence of various endocrinopathies. PROCEDURE: In a pilot study, retrospective data were collected for 12 patients with DBA. Subsequently, patients with DBA aged 1-39 years were recruited prospectively. Combined, 57 patients were studied; 38 chronically transfused, 12 glucocorticoid-dependent, and seven in remission. Data were collected on anthropometric measurements, systematic screening of pituitary, thyroid, parathyroid, adrenal, pancreatic, and gonadal function, and ferritin levels. Descriptive statistics were tabulated and group differences were assessed. RESULTS: Fifty-three percent of patients had \u3e/=1 endocrine disorder, including adrenal insufficiency (32%), hypogonadism (29%), hypothyroidism (14%), growth hormone dysfunction (7%), diabetes mellitus (2%), and/or diabetes insipidus (2%). Ten of the 33 patients with available heights had height standard deviation less than -2. Low 25-hydroxy vitamin D (25(OH)D) levels were present in 50%. A small proportion also had osteopenia, osteoporosis, or hypercalciuria. Most with adrenal insufficiency were glucocorticoid dependent; other endocrinopathies were more common in chronically transfused patients. CONCLUSIONS: Endocrine dysfunction is common in DBA, as early as the teenage years. Although prevalence is highest in transfused patients, patients taking glucocorticoids or in remission also have endocrine dysfunction. Longitudinal studies are needed to better understand the etiology and true prevalence of these disorders