Miracle-dz/UniFAR-FTUs huggingface dataset:
Comparison Between Ultrafast and Standard Single-Photon Emission CT in Patients With Coronary Artery Disease: A Pilot Study

Background—A novel technology has been developed for ultrafast (UF) single-photon emission CT (SPECT) myocardial perfusion imaging by using a pinhole collimation design and multiple cadmium zinc telluride crystal arrays. The purpose of this study was to compare myocardial perfusion imaging obtained by UF-SPECT with standard (S) SPECT in patients with known or suspected coronary artery disease. Methods and Results—A total of 34 patients underwent single-day 99mTc-tetrofosmin stress/rest myocardial perfusion imaging. UF-SPECT was performed 10 minutes before S-SPECT. Images were qualitatively analyzed, and the summed stress score and summed rest score were calculated. The segmental tracer uptake value (percentage of maximum myocardial uptake) also was quantified for both UF- and S-SPECT. When only 29 of 34 patients with significant coronary lesions were analyzed, the summed stress score was 10.1±4.4 versus 6.4±2.9, respectively, for UF- and S-SPECT (P=0.002). Qualitative and quantitative per-patient analysis showed similar results in detection of coronary artery disease for UF- and S-SPECT. In contrast, per-vessel analysis demonstrated higher regional sensitivity of UF- versus S-SPECT. UF-SPECT showed higher sensitivity in detecting multivessel disease (P=0.003) versus S-SPECT. Conclusions—This pilot study confirms that UF-SPECT provides high-quality fast myocardial perfusion imaging and suggests that it may allow a more-accurate evaluation of both extent and severity of myocardial ischemia in patients with coronary artery disease.
Writing robust IEEE recommended functions in 100% Pure Java(TM)

In addition to specifying details of floating point formats and arithmetic operations, the IEEE 754 and IEEE 854 standards recommend conforming systems include several utility functions to aid in writing portable programs. For example, floating point constants associated with a format, such as the largest representable number, can be generated in a format-independent manner using the recommended functions and a handful of floating point literals. The functions perform useful tasks such as returning the floating point number adjacent to a given value and scaling a floating point number by a power of two. However, the descriptions of the functions are very brief and the two related standards give slightly different specifications for some of the functions. This paper describes robust implementations of the IEEE recommended functions written in "100% Pure Java. " These functions work under all the dynamic rounding and trapping modes supported by IEEE 754. Writing such functions in Java presents a challenge since Java does not include methods to set or query the IEEE 754 floating point state. Most previous software implementations of the IEEE recommended functions, such as analogous functions included in the C math library, are intended to be run under only the IEEE default modes, round to nearest with trapping disabled.
Improving motion vector prediction using linear regression

The motion vectors take a large portion of the H.264/AVC encoded bitstream. This video coding standard employs predictive coding to minimize the amount of motion vector information to be transmitted. However, the motion vectors still accounts for around 40% of the transmitted bitstream, which suggests further research in this area. This paper presents an algorithm which employs a feature selection process to select the neighboring motion vectors which are most suitable to predict the motion vectors mv being encoded. The selected motion vectors are then used to approximate mv using Linear Regression. Simulation results have indicated a reduction in Mean Squared Error (MSE) of around 22% which results in reducing the residual error of the predictive coded motion vectors. This suggests that higher compression efficiencies can be achieved using the proposed Linear Regression based motion vector predictor.
Rough Set-Based Debugging for Web Services System

Web services technology provides a flexible and cost-effective paradigm to construct highly dynamic systems through service discovery, composition, and ultra-late binding. However, its new features bring great pressure to maintain Web service-based system. Based on the massive testing results, how to locate the fault points in system is a challenging task. In the paper, a two level diagnosis framework for Web services system is proposed. In service unit level, the WSDL interface information is used to construct decision table. In service composition level, the decision information system is built by comprehensively using process specifications and interface information. Then, rule mining algorithm in rough set reasoning is adopted to reveal the input cases associated with service or system failures. How to utilize such rules to locate faults in Web services system is also discussed. In addition, two cases are introduced to validate the feasibility and effectiveness of our approach.
A Distributed Query Processing Engine

Wireless sensor networks (WSNs) are formed of tiny, highly energy-constrained sensor nodes that are equipped with wireless transceivers. They may be mobile and are usually deployed in large numbers in unfamiliar environments. The nodes communicate with one another by autonomously creating ad-hoc networks which are subsequently used to gather sensor data. WSNs also process the data within the network itself and only forward the result to the requesting node. This is referred to as in-network data aggregation and results in the substantial reduction of the amount of data that needs to be transmitted by any single node in the network. In this paper we present a framework for a distributed query processing engine (DQPE) which would allow sensor nodes to examine incoming queries and autonomously perform query optimisation using information available locally. Such qualities make a WSN the perfect tool to carryout environmental monitoring in future planetary exploration missions in a reliable and cost effective manner.
Epidemiology of dengue: past, present and future prospects

Dengue is currently regarded globally as the most important mosquito-borne viral disease. A history of symptoms compatible with dengue can be traced back to the Chin Dynasty of 265–420 AD. The virus and its vectors have now become widely distributed throughout tropical and subtropical regions of the world, particularly over the last half-century. Significant geographic expansion has been coupled with rapid increases in incident cases, epidemics, and hyperendemicity, leading to the more severe forms of dengue. Transmission of dengue is now present in every World Health Organization (WHO) region of the world and more than 125 countries are known to be dengue endemic. The true impact of dengue globally is difficult to ascertain due to factors such as inadequate disease surveillance, misdiagnosis, and low levels of reporting. Currently available data likely grossly underestimates the social, economic, and disease burden. Estimates of the global incidence of dengue infections per year have ranged between 50 million and 200 million; however, recent estimates using cartographic approaches suggest this number is closer to almost 400 million. The expansion of dengue is expected to increase due to factors such as the modern dynamics of climate change, globalization, travel, trade, socioeconomics, settlement and also viral evolution. No vaccine or specific antiviral therapy currently exists to address the growing threat of dengue. Prompt case detection and appropriate clinical management can reduce the mortality from severe dengue. Effective vector control is the mainstay of dengue prevention and control. Surveillance and improved reporting of dengue cases is also essential to gauge the true global situation as indicated in the objectives of the WHO Global Strategy for Dengue Prevention and Control, 2012–2020. More accurate data will inform the prioritization of research, health policy, and financial resources toward reducing this poorly controlled disease. The objective of this paper is to review historical and current epidemiology of dengue worldwide and, additionally, reflect on some potential reasons for expansion of dengue into the future.
Extended Statistical Landscape Features for Dynamic Texture Recognition

This paper proposes a new method for describing Dynamic Texture (DT). DT is an extension of still texture to temporal domain, which contains motion features and appearance features. An Extended Statistical Landscape Features (ESLF) method is proposed for DT description and recognition by characterizing the motion and appearance features. The proposed ESLF uses the ESLF histogram as the identifier of DT, which is concatenated by the local motion pattern (LMP) histogram derived from motion features and the SLF histogram from appearance features. Experimental results based on the DynTex database show that the proposed ESLF achieves a higher recognition performance than LBP-TOP.
The Dialectics between an Individual and His Role

Agents are intelligent entities, situated in an environment and capable of flexible and autonomous behavior. Cognitive agents make use of different cognitive elements and processes in order to choose their behavior. Examples of such cognitive elements include an agent’s beliefs, desires, goals, or his capacities of situation assessment or planning. In general, agents must interact to other agents in order to satisfy their desires. Because agents are not necessarily trustworthy, different mechanisms are used to ensure that the interaction takes place in a coherent manner. For example, an agent might use trust or reputation models to evaluate possible interaction partners (Sabater, 2004) or norms could specify the way agent interaction should be done (Boella and Lesmo, 2002).
Conceptualizations of Personality Disorders with the Five Factor Model-count and Empathy Traits

Previous research has long advocated that emotional and behavioral disorders are related to general personality traits, such as the Five Factor Model (FFM). The addition of section III in the latest Diagnostic and Statistical Manual of Mental Disorders (DSM) recommends that extremity in personality traits together with maladaptive interpersonal functioning, such as lack of empathy, are used for identifying psychopathology and particularly personality disorders (PD). The objective of the present study was to measure dispositions for DSM categories based on normal personality continuums, and to conceptualize these with empathy traits. We used a validated FFM-count method based on the five personality factors (neuroticism, extraversion, openness, agreeableness, and conscientiousness), and related these to 4 empathy traits (emphatic concern, perspective-taking, fantasy, and personal distress). The results showed that FFM-based PD scores overall could be conceptualized using only two of the empathy traits, low emphatic concern and high personal distress. Further, specific dispositions for personality disorders were characterized with distinct empathy traits (e.g., histrionic with high fantasy, and paranoid with low perspective-taking). These findings may have both theoretical and practical implications in capturing potential for personality disorders with ease and efficiency.
Dual Band Notched Small Square Monopole UWB Antenna with Enhanced Bandwidth

This paper presents a small square monopole antenna with dual band-notched function which works for UWB applications. In this antenna there is a square radiating patch with an E-shaped slot, and a C-shaped slot at the middle of the patch and two L-shaped slot and one V-shaped strip in the ground plane which gives a wide fractional bandwidth of more than 140% (3.4-20 GHz) is consisted. The presented antenna has been successfully simulated, and shows the bandwidth for the voltage standing wave ratio 2 with two notched bands. The presented antenna has a small size of 10× 12 mm2. This antenna gives good radiation behavior within the UWB frequency band it is shown by simulated results.
Introduction 1.1. Recursion and Parallelism Adds the following Clause to the Program: 1.2. Outline of the Thesis Chapter 2 Contains Some Preliminary Material. Chapter 3 Presents Tt Arnlund's Inference System Reform. the Novel Idea With

Recursion is fundamental to logic programming. However, there is a vexatious problem with the traditional method for running recursive programs: it is sequential. As an example, consider the program for checking whether a number z is smaller than each element of a list: LessAll, z. Suppose we i n voke this program with a goal containing a list of n elements. It will take n steps to do the n comparisons, since the n recursive calls to the program must be made in sequence. Yet this problem is parallel in nature. It should, in principle, be possible to make all comparisons simultaneously since they are not interdependent. The sequentiality is imposed by o u r w ay o f c o n trolling the computation. TT arnlund 1990 has proposed a solution to this problem: the Reform inference system. The idea is to specialize the program at run-time with respect to a particular goal. For example, specialization of the recursive clause of the LessAll program with respect to the goal The program now represents a parallel algorithm and the n comparisons can be made simultaneously. Furthermore, there is an additional source of parallelism in the specialized program: uniication of the list 1.2. n. in the goal with the list x 1 . x n . y in the clause head reduces to n independent subuniications that can proceed in parallel. We shall take u p this idea and consider the question: how d o we u n c o ver the parallel algorithm at compile-time? Our solution is to change the control 1 2 CHAPTER 1 strategy of the original program so that it behaves exactly like the specialized program, in particular with respect to opportunities for parallelism. We compile recursive programs over recursive data structures integers, lists, binary trees to iterative programs over vectors. Consequently, we can exploit parallelism in the compiled programs by well-known parallelization techniques for iterative programs. These techniques were originally developed for Fortran-like programs. Reform is that it uses program transformation as computation: the recursive program is specialized at run-time with respect to a goal. The transformed program solves the goal much more eciently than the original program and is highly parallel. Chapter 4 describes diierent opportunities for parallelism in Reform computations. We identify two major sources of parallel speedup: recursion parallelism and parallel uniication of large data structures. Recursion parallelism is an interesting generalization of AND-parallelism for …
A dense clutter sparse algorithm for the random finite set filters

When dense clutter appears in certain surveillance areas and once a target enters into the regions, like most tracking algorithm, the random finite set based multi-target tracking (RFS-MTT) filters tend to fail for the tracking task due to larger false alarms and this further results in the loss of all targets. Moreover, the computational cost are greatly increased and this slows down the whole computational speed. To tackle these problems, we propose a sparse algorithm for the clutter measurements under certain threshold of probability of detection. The proposed sparse algorithm is based on the hypothesis testing theory and Chebyshev inequalities for random vector. The final experiment shows that the proposed algorithm could effectively deal with the dense clutter issues for the RFS-MTT filters.
Declining Brown-Headed Cowbird (Molothrus ater) Populations Are Associated with Landscape-Specific Reductions in Brood Parasitism and Increases in Songbird Productivity

Many songbird species have experienced significant population declines, partly because of brood parasitism by the Brown-headed Cowbird (Molothrus ater), which is positively associated with increasing landscape forest cover in the midwestern United States. However, cowbirds are also experiencing long-term population declines, which should reduce parasitism pressure and thus increase productivity of host species. We used 20 years of nest monitoring data from five sites in Missouri across a gradient of landscape forest cover to assess temporal trends in the rate and intensity of brood parasitism for Acadian Flycatchers (Empidonax virescens), Indigo Buntings (Passerina cyanea), and Northern Cardinals (Cardinalis cardinalis). We evaluated whether there were concomitant changes in fledging brood size, nest survival, a combination of the two metrics (i.e., host young produced per nest attempt), and whether such changes were more substantial with decreasing landscape forest cover. Parasitism rates and intensities declined substantially during 1991–2010. Fledging brood size and nest survival rates were positively associated with landscape forest cover, confirming the fragmentation hypothesis for Midwest forest birds. Declining parasitism rates were associated with increased fledging brood sizes, with more pronounced increases as landscape forest cover decreased. Nest survival increased insubstantially across time during laying and incubation, but not during the nestling stage. The best predictor of nest survival was parasitism status, with parasitized nests surviving at lower rates than unparasitized nests. Overall, productivity increased during 1991–2010, with more pronounced increases associated with lower levels of landscape forest cover. The negative effects of cowbirds on nest survival in addition to fledging brood size in less forested landscapes suggest that cowbirds may be a primary cause of forest fragmentation effects on songbird productivity in the Midwest. Our results underscore the dynamic nature of demographic parameters, which should be accounted for in predictive models of wildlife responses to future environmental conditions.
Speeding up the Arithmetic Operations over Optimal Extension Fields in the Lagrange Representation Using DFT

In this paper, efficient algorithms of the arithmetic operations over Optimal Extension Field have been considered. An arbitrary field element is represented by the Lagrange Representation, and transformation forward and backward between the Lagrange Representation and the vector of polynomial coefficients of the field element has been speeded up by applying DFT (discrete Fourier transform) over a ring. Our contribution is of establishing modular multiplication and inversion algorithms over Optimal Extension Field in the Lagrange Representation using the discrete Fourier transform.
Shroud: ensuring private access to large-scale data in the data center

Recent events have shown online service providers the perils of possessing private information about users. Encrypting data mitigates but does not eliminate this threat: the pattern of data accesses still reveals information. Thus, we present Shroud, a general storage system that hides data access patterns from the servers running it, protecting user privacy. Shroud functions as a virtual disk with a new privacy guarantee: the user can look up a block without revealing the block's address. Such a virtual disk can be used for many purposes, including map lookup, microblog search, and social networking.Shroud aggressively targets hiding accesses among hundreds of terabytes of data. We achieve our goals by adapting oblivious RAM algorithms to enable large-scale parallelization. Specifically, we show, via new techniques such as oblivious aggregation, how to securely use many inexpensive secure coprocessors acting in parallel to improve request latency. Our evaluation combines large-scale emulation with an implementation on secure coprocessors and suggests that these adaptations bring private data access closer to practicality.
REDUCTIONS IN THE MITOCHONDRIAL DNA DIVERSITY OF CORAL REEF FISH PROVIDE EVIDENCE OF POPULATION BOTTLENECKS RESULTING FROM HOLOCENE SEA‐LEVEL CHANGE

Abstract. — This study investigated the influence of reproductive strategy (benthic or pelagic eggs) and habitat preferences (lagoon or outer slope) on both diversity and genetic differentiation using a set of populations of seven coral reef fish species over different geographic scales within French Polynesia. We hypothesized that a Holocene sea‐level decrease contributed to severe reduction of population size for species inhabiting lagoons and a subsequent decrease of genetic diversity. Conversely, we proposed that species inhabiting stable environments, such as the outer slope, should demonstrate higher genetic diversity but also more structured populations because they have potentially reached a migration‐genetic drift equilibrium. Sequences of the 5 end of the mitochondrial DNA (mtDNA) control region were compared among populations sampled in five isolated islands within two archipelagos of French Polynesia. For all the species, no significant divergences among populations were found. Significant differences in mtDNA diversity between lagoonal and outer‐slope species were demonstrated both for haplotype diversity and sequence divergence but none were found between species with different egg types. Pairwise mismatch distributions suggested rapid population growth for all the seven species involved in this study, but they revealed different distributions, depending on the habitat preference of the species. Although several scenarios can explain the observed patterns, the hypothesis of population size reduction events relative to Holocene sea‐level regression and its consequence on French Polynesia coral reefs is the most parsimonious. Outer‐slope species have undergone a probable weak and/or old bottleneck (outer reefs persisted during low sea level, leading to reef area reductions), whereas lagoonal species suffered a strong and/ or recent bottleneck since Holocene sea‐level regression resulted in the drying out of all the atolls that are maximum 70 meters deep. Since present sea level was reached between 5000 and 6000 years ago, different demographic events (bottlenecks or founder events) have lead to the actual populations of lagoons in French Polynesia.
EvoDB: a database of evolutionary rate profiles, associated protein domains and phylogenetic trees for PFAM-A

The evolutionary rate at codon sites across protein-coding nucleotide sequences represents a valuable tier of information for aligning sequences, inferring homology and constructing phylogenetic profiles. However, a comprehensive resource for cataloguing the evolutionary rate at codon sites and their corresponding nucleotide and protein domain sequence alignments has not been developed. To address this gap in knowledge, EvoDB (an Evolutionary rates DataBase) was compiled. Nucleotide sequences and their corresponding protein domain data including the associated seed alignments from the PFAM-A (protein family) database were used to estimate evolutionary rate (ω = dN/dS) profiles at codon sites for each entry. EvoDB contains 98.83% of the gapped nucleotide sequence alignments and 97.1% of the evolutionary rate profiles for the corresponding information in PFAM-A. As the identification of codon sites under positive selection and their position in a sequence profile is usually the most sought after information for molecular evolutionary biologists, evolutionary rate profiles were determined under the M2a model using the CODEML algorithm in the PAML (Phylogenetic Analysis by Maximum Likelihood) suite of software. Validation of nucleotide sequences against amino acid data was implemented to ensure high data quality. EvoDB is a catalogue of the evolutionary rate profiles and provides the corresponding phylogenetic trees, PFAM-A alignments and annotated accession identifier data. In addition, the database can be explored and queried using known evolutionary rate profiles to identify domains under similar evolutionary constraints and pressures. EvoDB is a resource for evolutionary, phylogenetic studies and presents a tier of information untapped by current databases. Database URL: http://www.bioinf. wits.ac. za/software/fire/evodb