Miracle-dz/UniFAR-FTUs huggingface dataset:
Mining frequent closed itemsets using antecedent-consequent constraint and length-decreasing support constraint

At present, many frequent itemsets mining algorithms adopt a constant support threshold value strategy, which is not convenient to potential valuable long itemsets discovery. Length-decreasing support constraints can address this problem probably. Existing algorithms make improvements on classical algorithm, which result to low efficiency. Tailored to the medical data, this paper proposes a frequent closed itemsets mining algorithm called ACLCMiner, which uses the antecedent-consequent constraint and the length-decreasing support constraint. With the antecedent-consequent constraint, the algorithm greatly reduces the number of generated frequent itemsets. The experimental results show that ACLCMiner is efficient and can find more long itemsets with potential values.
Quantum-dot cellular automata adders

In this paper, a novel quantum-dot cellular automata (QCA) adder design is presented that reduces the number of QCA cells compared to previously reported designs. The proposed one-bit QCA adder structure is based on a new algorithm that requires only three majority gates and two inverters for the QCA addition. By connecting n one-bit QCA adders, we can obtain an n-bit carry look-ahead adder with the reduced hardware while retaining the simple clocking scheme and parallel structure of the original carry look-ahead approach. The proposed adder is designed and simulated using the QCA Designer tool for the four-bit adder case. The proposed design requires only about 70% of the hardware compared to previous designs with the same speed and clocking performance.
Embedded Hardware-Efficient Real-Time Classification With Cascade Support Vector Machines

Cascade support vector machines (SVMs) are optimized to efficiently handle problems, where the majority of the data belong to one of the two classes, such as image object classification, and hence can provide speedups over monolithic (single) SVM classifiers. However, SVM classification is a computationally demanding task and existing hardware architectures for SVMs only consider monolithic classifiers. This paper proposes the acceleration of cascade SVMs through a hybrid processing hardware architecture optimized for the cascade SVM classification flow, accompanied by a method to reduce the required hardware resources for its implementation, and a method to improve the classification speed utilizing cascade information to further discard data samples. The proposed SVM cascade architecture is implemented on a Spartan-6 field-programmable gate array (FPGA) platform and evaluated for object detection on 800 × 600 (Super Video Graphics Array) resolution images. The proposed architecture, boosted by a neural network that processes cascade information, achieves a real-time processing rate of 40 frames/s for the benchmark face detection application. Furthermore, the hardware-reduction method results in the utilization of 25% less FPGA custom-logic resources and 20% peak power reduction compared with a baseline implementation.
A probabilistic search algorithm for finding optimally directed solutions

"Evolutionary search techniques such as Genetic Algorithms (GA) have recently gained considerable attention. They have been used for solving a wide range of problems including function optimisation and learning. In this paper, a new global search technique, called Probabilistic Global Search (PGS), is presented. Results of benchmark tests indicate that this technique performs better than genetic algorithms on a wide range of problems. PGS is a stochastic search technique. It works by generating points in the search space according to a probability distribution function (PDF) defined over the search space. Each axis is divided into a fixed number of intervals with equal probability density. The probability densities of intervals are modified dynamically so that points are generated with higher probability in regions containing good solutions. The algorithm includes four nested cycles: 1. Sampling 2. Probability updating 3. Focusing 4. Subdomain cycle In the sampling cycle (innermost cycle) a certain number of points are generated randomly according to the current PDF. Each point is evaluated by the user defined objective function and the best point is selected. In the next cycle, probabilities of regions containing good solutions are increased and probabilities decreased in regions containing less attractive solutions. In the third cycle, search is focused on the interval containing the best solution after a number of probability updating cycles, by further subdivision of the interval. In the subdomain cycle, the search space is progressively narrowed by selecting a subdomain of smaller size centred on the best point after each focusing cycle. Each cycle serves a different purpose in the search for a global optimum. The sampling cycle permits a more uniform and exhaustive search over the entire search space than other cycles. Probability updating and focusing cycles refine search in the neighbourhood of good solutions. Convergence is achieved by means of the subdomain cycle. The algorithm was tested on highly non-linear, non-separable functions in ten to hundred variables. Results are compared with those from three versions of GAs. In most cases PGS gives better results in terms of the number of times global optima were found and the number of evaluations required to find them. The application of the technique to non-parametric optimisation problems is further illustrated using an example from conceptual structural design. "
Generalized Version Space Trees

We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space trees allow for a comfortable representation of version spaces and a natural way to efficiently process inductive queries and operations on version spaces. In particular, we focus on using generalized version space trees in the field of mining free (i.e. unrooted) trees in graph databases. Experiments with two data sets from the National Cancer Institute’s Developmental Therapeutics Program (DTP) indicate that generalized version space trees can boost inductive queries considerably while featuring moderately increased space requirements in comparison to a version space representation based on boundary sets.
Analysis of binary feature mapping rules for promoter recognition in imbalanced DNA sequence datasets using Support Vector Machine

Recognition of specific functionally-important DNA sequence fragments is considered one of the most important problems in bioinformatics. One type of such fragments are promoters, i.e., short regulatory DNA sequences located upstream of a gene. Detection of promoters in DNA sequences is important for successful gene prediction. In this paper, a machine learning method, called support vector machine (SVM), is used for classification of DNA sequences and promoter recognition. For optimal classification, 11 rules for mapping of DNA sequences into binary SVM feature space are analyzed. Classification is performed using a power series kernel function. Kernel parameters are optimized using a modification of the Nelder-Mead (downhill simplex) optimization method. The results of classification for drosophila and human sequence datasets are presented.
The Adult Netherlands Twin Register: Twenty-Five Years of Survey and Biological Data Collection

Over the past 25 years, the Adult Netherlands Twin Register (ANTR) has collected a wealth of information on physical and mental health, lifestyle, and personality in adolescents and adults. This article provides an overview of the sources of information available, the main research findings, and an outlook for the future. Between 1991 and 2012, longitudinal surveys were completed by twins, their parents, siblings, spouses, and offspring. Data are available for 33,957 participants, with most individuals having completed two or more surveys. Smaller projects provided in-depth phenotyping, including measurements of the autonomic nervous system, neurocognitive function, and brain imaging. For 46% of the ANTR participants, DNA samples are available and whole genome scans have been obtained in more than 11,000 individuals. These data have resulted in numerous studies on heritability, gene x environment interactions, and causality, as well as gene finding studies. In the future, these studies will continue with collection of additional phenotypes, such as metabolomic and telomere length data, and detailed genetic information provided by DNA and RNA sequencing. Record linkage to national registers will allow the study of morbidity and mortality, thus providing insight into the development of health, lifestyle, and behavior across the lifespan.
MMFI: An Effective Algorithm for Mining Maximal Frequent Itemsets

Existing algorithms for mining maximal frequent itemsets have to do superset checking, and some of them using FP-tree have to construct conditional frequent pattern trees recursively. We present a novel algorithm for mining maximal frequent itemsets from a transactional database. In the algorithm, the FP-Tree data structure is used and adapted, and a new strategy called ldquoNBNrdquo (Node By Node) is used for traversing the adapted FP-Tree. Neither superset checking nor constructing conditional frequent pattern trees is needed in the algorithm. We analyze the performance of the algorithm and compare our method with existing algorithms. Our technique works better for mining maximal frequent itemsets. It is also proved by experimental comparison that our algorithm is more fast and efficient.
The Communicative Construction of Safety in Wildland Firefighting

This dissertation project used a two-study mixed methods approach, examining the communicative accomplishment of safety from two perspectives: high reliability organizing (Weick, Sutcliffe, & Obstfeld 1999), and safety climate (Zohar 1980). In Study One, 27 firefighters from two functionally similar wildland firefighting crews were interviewed about their crew-level interactions for implementing safety rules and tasks. Findings revealed that the two crews differed in their communicative interactions related to three specific routines: planning, use of safety rules, and authority. The crews also differed in their general interactions with one another related to safety, groupness, and efficiency. For Study Two, 379 firefighters participated in a safety climate survey. Safety climate refers to an organization’s emphasis of production pressure over safety (Zohar & Luria 2005). Safety climate constructs assessed included: safety communication, failure learning behaviors, work safety tension, psychological safety, crew staffing patterns (dispersed, co-located), work styles (independent, task interdependent), crew prestige, and the value of after action reviews (AARs). Hypotheses tested and modeled how crew configurations and work styles combined to influence learning behaviors, member comfort with communicating safety concerns, and the value of communication and learning practices. Based on both studies, recommendations are presented for enhancing the crew-level safety communication environment. Additional
Signal Detection for EST Based Modulation in Doubly-Selective Channels

The energy spreading transform (EST) based modulation with iterative signal detection has been shown to perform very close to the matched filter bound (MFB) for time-invariant or slow time-varying channels with signal-to-noise ratio over a threshold. However, for fast time-varying channels, the original equalization alone is not adequate. In this correspondence, we extend the EST-based approach to doubly-selective channels, that is, time-varying and frequency-selective channels. Our simulation results show that the extended approach has significant performance for doubly-selective channels.
Is blood thicker than water ? Information flow among competing cardiologists

Variations in physician practice are pervasive and costly, and may be harmful. The objective of much policy is to increase the interconnectedness of physicians, furthering the transfer of information and thus reducing variation. This study tests whether physicians are influenced by the practice of peers, or if propensity, mere context or sorting of like-minded physicians better explain similarities and differences in practice. We study cardiologists who place coronary stents into patients with blocked arteries around the heart. Organized in locally competing physician groups or as solo practitioners, they see patients in different offices, but insert stents at a shared production facility – the cath lab.
Research of Positioning of Minimally Invasive Surgery Robot Based on Monocular Vision

The system structure and operation process of the Minimally Invasive Surgery Robot based on vision location technology are expounded. The threedimensional location problem of robot’s hand-eyes vision system is lucubrated, whose core idea is directly putting the image coordinate mapped into the robot’s radical coordinate and getting the system parameter as a whole and not separately calculating every parameter of camera inner. According to the basic principal of three-dimensional vision, the there-dimensional vision model and camera calibrating model are set up and the vision location system of the Minimally Invasive Surgery Robot is designed. The experiment proves that the method has a better location effect and analyzes the reason of causing the error.
Effect of Transcatheter Embolization by Autologous Fat Particles in the Treatment of Coronary Artery Perforation During Percutaneous Coronary Intervention

Background:Coronary artery perforation (CAP) is a rare but severe complication of percutaneous coronary intervention (PCI). The aim of our study was to evaluate the effect and safety of transcatheter embolization by autologous fat particles in the treatment of CAP. Methods:Once the CAP was confirmed, a little autologous subcutaneous fatty tissue was obtained from the groin of the patient and then was made into 1 mm × 1 mm fat particles. The perforated vessel was embolized by fat particles via a micro-catheter. There were eight patients undergoing transcatheter embolization by autologous fat particles in the treatment of CAP during PCI in Peking University Third Hospital from February 2009 to June 2014, and the clinical data of these patients were collected and analyzed retrospectively. Results:The lesion morphology of the patients was classified based on the American College of Cardiology/American Heart Association Task Force classification, there were one patient with Class B2 lesion and seven patients with Class C lesions (there were five patients with chronic total occlusion lesions). According to the Ellis classification of CAP, there were six patients with Class II perforations and two patients with Class III perforations. The causes of perforation included that seven patients induced by guide wire and one patient by balloon predilation. Three patients had pericardial effusion. All of the eight patients with CAP underwent transcatheter embolization by autologous fat particles. Coronary angiography confirmed that all of them were embolized successfully. There was no severe complication after the procedure. The coronary angiography of one patient at 1 week and another patient at 2 years after the embolization showed that the embolized arteries had recanalized. The median follow-up time was 20.3 months (8.8–50.2 months), the event-free survival rate was 100%. Conclusions:Transcatheter embolization by autologous fat particles was an effective, safe, cheap, and easy way to treat the perforation of small vessels during PCI.
Human Diversity in Jordan: Polymorphic Alu Insertions in General Jordanian and Bedouin Groups

ABSTRACT Jordan, located in the Levant region, is an area crucial for the investigation of human migration between Africa and Eurasia. However, the genetic history of Jordanians has yet to be clarified, including the origin of the Bedouins today resident in Jordan. Here, we provide new genetic data on autosomal independent markers in two Jordanian population samples (Bedouins and the general population) to begin to examine the genetic diversity inside this country and to provide new information about the genetic position of these populations in the context of the Mediterranean and Middle East area. The markers analyzed were 18 Alu polymorphic insertions characterized by their identity by descent, known ancestral state (lack of insertion), and apparent selective neutrality. The results indicate significant genetic differences between Bedouins and general Jordanians (p = 0.038). Whereas Bedouins show a close genetic proximity to North Africans, general Jordanians appear genetically more similar to other Middle East populations. In general, these data are consistent with the hypothesis that Bedouins had an important role in the peopling of Jordan and constitute the original substrate of the current population. However, migration into Jordan in recent years likely has contributed to the diversity among current Jordanian population groups.
Combining intercultural dialogue and critical multiculturalism

In the last two decades, the concept of multiculturalism has come under attack in political and academic discourses. Simultaneously, European governments have accommodated key aspects of multicultural policies, both nationally and internationally. In academic debates, it has been suggested that ‘multiculturalism’ can be replaced by ‘interculturalism’. This paper responds to those suggestions. We argue that, while liberal state multiculturalism risks essentializing minority groups, critical multiculturalism as a social movement refers to minority struggles to be recognized as equals in relation to the majority. Interculturalism as policy opens up a space for dialogue where minoritized people, individually and collectively, can find their own voices and negotiate their own identities and interests as well as the shared values of larger society. While multiculturalism is partly about legal rights and policies, it is also about possibilities for participation, opening up public spaces for dialogue and negotiations where the voices of minoritized groups and individuals are heard, providing an opportunity for living together in a diverse society marked by mutual understanding and adjustment. We conclude with the suggestion that intercultural dialogue should be combined with critical multiculturalism. In other words, the theory and practice of intercultural dialogue need to go beyond liberalism and take into account critical multiculturalism’s emphasis on the positionality of all perspectives. A theory and practice of genuine intercultural dialogue cannot ignore power relations, the empirical fact that some people speak ‘from above’ and others ‘from below’.
Intrinsic connections of the macaque monkey hippocampal formation: II. CA3 connections

We examined the topographic organization of the connections of the CA3 field of the macaque monkey hippocampus. Discrete anterograde and retrograde tracer injections were made at various positions within CA3 and CA1. The projections from CA3 to CA1 (Schaffer collaterals), which terminate in the strata radiatum, pyramidale, and oriens, are present throughout the entire transverse extent of CA1. Projections extend both rostrally and caudally from the injection site for as much as three‐fourths of the longitudinal extent of the hippocampus. The associational projections from CA3 to CA3 also travel extensively along the longitudinal axis. CA3 gives rise to more substantial projections to CA1 than to CA3. CA3 projections that originate at the level of the uncus tend to be more restricted to the rostral portions of CA1 and CA3. As in the rodent brain, projections from CA3 to CA1 are distributed along a radial gradient, depending on the transverse location of the cells of origin. CA3 cells located near the dentate gyrus generate projections that more densely terminate superficially in the terminal zone of CA1, whereas CA3 cells located closer to CA1 give rise to projections that more heavily terminate deeply in the terminal zone of CA1. The present results indicate that in the monkey, as in the rat, CA3 cells give rise to extensive projections to CA1 and CA3. Interestingly, radial, transverse, and longitudinal gradients of CA3 fiber distribution, so clear in the rat, are much more subtle in the nonhuman primate brain. J. Comp. Neurol. 515:349–377, 2009. © 2009 Wiley‐Liss, Inc.
Development and physiology of GABAergic feedback excitation in parvalbumin expressing interneurons of the mouse basolateral amygdala

We have previously shown that in the basolateral amygdala (BLA), action potentials in one type of parvalbumin (PV)‐expressing GABAergic interneuron can evoke a disynaptic feedback excitatory postsynaptic potential (fbEPSP) onto the same presynaptic interneuron. Here, using whole‐cell recordings from PV‐expressing interneurons in acute brain slices we expand on this finding to show that this response is first detectable at 2‐week postnatal, and is most prevalent in animals beyond 3 weeks of age (>P21). This circuit has a very high fidelity, and single action potential evoked fbEPSPs display few failures. Reconstruction of filled neurons, and electron microscopy show that interneurons that receive feedback excitation make symmetrical synapses on both the axon initial segments (AIS), as well as the soma and proximal dendrites of local pyramidal neurons, suggesting fbEPSP interneurons are morphologically distinct from the highly specialized chandelier neurons that selectively target the axon initial segment of pyramidal neurons. Single PV interneurons could trigger very large (~ 1 nA) feedback excitatory postsynaptic currents (fbEPSCs) suggesting that these neurons are heavily reciprocally connected to local glutamatergic principal cells. We conclude that in the BLA, a subpopulation of PV interneurons forms a distinct neural circuit in which a single action potential can recruit multiple pyramidal neurons to discharge near simultaneously and feed back onto the presynaptic interneuron.
Non-asymptotic oracle inequalities for the Lasso and Group Lasso in high dimensional logistic model

We consider the problem of estimating a function $f_{0}$ in logistic regression model. We propose to estimate this function $f_{0}$ by a sparse approximation build as a linear combination of elements of a given dictionary of $p$ functions. This sparse approximation is selected by the Lasso or Group Lasso procedure. In this context, we state non asymptotic oracle inequalities for Lasso and Group Lasso under restricted eigenvalues assumption as introduced in \cite{BRT}. Those theoretical results are illustrated through a simulation study.