A first step to accelerating fingerprint matching based on deformable minutiae clustering

Fingerprint recognition is one of the most used biometric methods for authentication. The identification of a query fingerprint requires matching its minutiae against every minutiae of all the fingerprints of the database. The state-of-the-art matching algorithms are costly, from a computational point of view, and inefficient on large datasets. In this work, we include faster methods to accelerating DMC (the most accurate fingerprint matching algorithm based only on minutiae). In particular, we translate into C++ the functions of the algorithm which represent the most costly tasks of the code; we create a library with the new code and we link the library to the original C# code using a CLR Class Library project by means of a C++/CLI Wrapper. Our solution re-implements critical functions, e.g., the bit population count including a fast C++ PopCount library and the use of the squared Euclidean distance for calculating the minutiae neighborhood. The experimental results show a significant reduction of the execution time in the optimized functions of the matching algorithm. Finally, a novel approach to improve the matching algorithm, considering cache memory blocking and parallel data processing, is presented as future work.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

60 years of creativity in business organizations

This paper analyses the role of creativity in business organizations by examining the core ideas of an article published sixty years ago as a way to elucidate how relevant they are today in view of the research literature. The paper proposes the use of computational social simulations to support systematic reasoning about some of these longstanding issues around organizational creativity. An example of an agent-based simulation to study team ideation is presented to support systematic reasoning about the role of creativity in business organizations and to articulate future lines of inquiry

Hyperharmonic analysis for the study of high-order information-theoretic signals

Network representations often cannot fully account for the structural richness of complex systems spanning multiple levels of organisation. Recently proposed high-order information-theoretic signals are well-suited to capture synergistic phenomena that transcend pairwise interactions; however, the exponential-growth of their cardinality severely hinders their applicability. In this work, we combine methods from harmonic analysis and combinatorial topology to construct efficient representations of high-order information-theoretic signals. The core of our method is the diagonalisation of a discrete version of the Laplace–de Rham operator, that geometrically encodes structural properties of the system. We capitalise on these ideas by developing a complete workflow for the construction of hyperharmonic representations of high-order signals, which is applicable to a wide range of scenarios

MUST, SHOULD, DON'T CARE: TCP Conformance in the Wild

Standards govern the SHOULD and MUST requirements for protocol implementers for interoperability. In case of TCP that carries the bulk of the Internets' traffic, these requirements are defined in RFCs. While it is known that not all optional features are implemented and nonconformance exists, one would assume that TCP implementations at least conform to the minimum set of MUST requirements. In this paper, we use Internet-wide scans to show how Internet hosts and paths conform to these basic requirements. We uncover a non-negligible set of hosts and paths that do not adhere to even basic requirements. For example, we observe hosts that do not correctly handle checksums and cases of middlebox interference for TCP options. We identify hosts that drop packets when the urgent pointer is set or simply crash. Our publicly available results highlight that conformance to even fundamental protocol requirements should not be taken for granted but instead checked regularly

Private and Communication-Efficient Algorithms for Entropy Estimation

Modern statistical estimation is often performed in a distributed setting where each sample belongs to a single user who shares their data with a central server. Users are typically concerned with preserving the privacy of their samples, and also with minimizing the amount of data they must transmit to the server. We give improved private and communication-efficient algorithms for estimating several popular measures of the entropy of a distribution. All of our algorithms have constant communication cost and satisfy local differential privacy. For a joint distribution over many variables whose conditional independence is given by a tree, we describe algorithms for estimating Shannon entropy that require a number of samples that is linear in the number of variables, compared to the quadratic sample complexity of prior work. We also describe an algorithm for estimating Gini entropy whose sample complexity has no dependence on the support size of the distribution and can be implemented using a single round of concurrent communication between the users and the server. In contrast, the previously best-known algorithm has high communication cost and requires the server to facilitate interaction between the users. Finally, we describe an algorithm for estimating collision entropy that matches the space and sample complexity of the best known algorithm but generalizes it to the private and communication-efficient setting

Association Between Clinical Pathways Leading to Medical Management and Prognosis in Patients With NSTEACS.

: A large proportion of patients with non-ST-segment elevation acute coronary syndrome (NSTEACS) are initially selected for medical management (MM) and do not undergo coronary revascularization during or immediately after the index event. The aim of this study was to explore the clinical pathways leading to MM in NSTEACS patients and their influence on prognosis. : Patient characteristics, pathways leading to MM, and 2-year outcomes were recorded in a prospective cohort of 5591 NSTEACS patients enrolled in 555 hospitals in 20 countries across Europe and Latin America. Cox models were used to assess the impact of hospital management on postdischarge mortality. : Medical management was the selected strategy in 2306 (41.2%) patients, of whom 669 (29%) had significant coronary artery disease (CAD), 451 (19.6%) had nonsignificant disease, and 1186 (51.4%) did not undergo coronary angiography. Medically managed patients were older and had higher risk features than revascularized patients. Two-year mortality was higher in medically managed patients than in revascularized patients (11.0% vs 4.4%; P &lt; .001), with higher mortality rates in patients who did not undergo angiography (14.6%) and in those with significant CAD (9.3%). Risk-adjusted mortality was highest for patients who did not undergo angiography (HR = 1.81; 95%CI, 1.23-2.65), or were not revascularized in the presence of significant CAD (HR = 1.90; 95%CI, 1.23-2.95) compared with revascularized patients. : Medically managed NSTEACS patients represent a heterogeneous population with distinct risk profiles and outcomes. These differences should be considered when designing future studies in this population.<br/

Left Displacement of the Abomasum in 4 Beef Calves

Citation: Oman, R. E., Streeter, R. N., Reppert, E. J., & Chako, C. Z. (2016). Left Displacement of the Abomasum in 4 Beef Calves. Journal of Veterinary Internal Medicine, 30(4), 1376-1380. doi:10.1111/jvim.14353BackgroundLittle is known about the occurrence rate, underlying etiology or treatment of left displacement of the abomasum in beef calves. ObjectiveDescribe the clinical presentation, diagnosis and treatment of left displacement of the abomasum in 4 beef calves. AnimalsFour client-owned beef breed calves with left displaced abomasum (LDA). MethodsRetrospective case series. Hospital medical records were reviewed to identify all beef breed cattle under the age of 6 months diagnosed with LDA. ResultsFour beef calves were treated for left displacement of the abomasum. All four had a history of decreased appetite and left-sided abdominal distention. Two had recently been treated for necrotic laryngitis and one was being treated for clostridial abomasitis. Ultrasonography confirmed the abomasum to be displaced between the rumen and the left body wall in all calves. The calves were initially treated by rolling to correct the abomasal displacement. The abomasum redisplaced in 3 of 4 calves within 1 hour to 6 days; 1 calf developed a mesenteric volvulus. A right paramedian abomasopexy was performed in all cases. Three of 4 calves grew well and remained in the herd 6-18 months later; 1 calf was euthanized because of complications associated with necrotic laryngitis. Conclusions and clinical importanceLeft displacement of the abomasum should be considered as a differential diagnosis for beef calves with abdominal distention. Concurrent necrotic laryngitis can increase the risk of abomasal displacement in beef calves. Treatment should include surgical correction as rolling is not curative and might be associated with mesenteric volvulus

Exponential Random Graph Modeling for Complex Brain Networks

Exponential random graph models (ERGMs), also known as p* models, have been utilized extensively in the social science literature to study complex networks and how their global structure depends on underlying structural components. However, the literature on their use in biological networks (especially brain networks) has remained sparse. Descriptive models based on a specific feature of the graph (clustering coefficient, degree distribution, etc.) have dominated connectivity research in neuroscience. Corresponding generative models have been developed to reproduce one of these features. However, the complexity inherent in whole-brain network data necessitates the development and use of tools that allow the systematic exploration of several features simultaneously and how they interact to form the global network architecture. ERGMs provide a statistically principled approach to the assessment of how a set of interacting local brain network features gives rise to the global structure. We illustrate the utility of ERGMs for modeling, analyzing, and simulating complex whole-brain networks with network data from normal subjects. We also provide a foundation for the selection of important local features through the implementation and assessment of three selection approaches: a traditional p-value based backward selection approach, an information criterion approach (AIC), and a graphical goodness of fit (GOF) approach. The graphical GOF approach serves as the best method given the scientific interest in being able to capture and reproduce the structure of fitted brain networks

Mitochondrial and nuclear genes suggest that stony corals are monophyletic but most families of stony corals are not (Order Scleractinia, Class Anthozoa, Phylum Cnidaria)

Modern hard corals (Class Hexacorallia; Order Scleractinia) are widely studied because of their fundamental role in reef building and their superb fossil record extending back to the Triassic. Nevertheless, interpretations of their evolutionary relationships have been in flux for over a decade. Recent analyses undermine the legitimacy of traditional suborders, families and genera, and suggest that a non-skeletal sister clade (Order Corallimorpharia) might be imbedded within the stony corals. However, these studies either sampled a relatively limited array of taxa or assembled trees from heterogeneous data sets. Here we provide a more comprehensive analysis of Scleractinia (127 species, 75 genera, 17 families) and various outgroups, based on two mitochondrial genes (cytochrome oxidase I, cytochrome b), with analyses of nuclear genes (ßtubulin, ribosomal DNA) of a subset of taxa to test unexpected relationships. Eleven of 16 families were found to be polyphyletic. Strikingly, over one third of all families as conventionally defined contain representatives from the highly divergent "robust" and "complex" clades. However, the recent suggestion that corallimorpharians are true corals that have lost their skeletons was not upheld. Relationships were supported not only by mitochondrial and nuclear genes, but also often by morphological characters which had been ignored or never noted previously. The concordance of molecular characters and more carefully examined morphological characters suggests a future of greater taxonomic stability, as well as the potential to trace the evolutionary history of this ecologically important group using fossils