Miracle-dz/UniFAR-FTUs huggingface dataset:
A decoupled KILO-instruction processor

Building processors with large instruction windows has been proposed as a mechanism for overcoming the memory wall, but finding a feasible and implementable design has been an elusive goal. Traditional processors are composed of structures that do not scale to large instruction windows because of timing and power constraints. However, the behavior of programs executed with large instruction windows gives rise to a natural and simple alternative to scaling. We characterize this phenomenon of execution locality and propose a microarchitecture to exploit it to achieve the benefit of a large instruction window processor with low implementation cost. Execution locality is the tendency of instructions to exhibit high or low latency based on their dependence on memory operations. In this paper we propose a decoupled microarchitecture that executes low latency instructions on a cache processor and high latency instructions on a memory processor. We demonstrate that such a design, using small structures and many in-order components, can achieve the same performance as much more aggressive proposals while minimizing design complexity.
Optimizing Off-Chip Accesses in Manycores

In a network-on-chip (NoC) based manycore architecture, an offchip data access (main memory access) needs to travel through the on-chip network, spending considerable amount of time within the chip (in addition to the memory access latency). In addition, it contends with on-chip (cache) accesses as both use the same NoC resources. In this paper, focusing on data-parallel, multithreaded applications, we propose a compiler-based off-chip data access localization strategy, which places data elements in the memory space such that an off-chip access traverses a minimum number of links (hops) to reach the memory controller that handles this access. This brings three main benefits. First, the network latency of off-chip accesses gets reduced; second, the network latency of on-chip accesses gets reduced; and finally, the memory latency of off-chip accesses improves. We present an experimental evaluation of our optimization strategy using a set of 13 multithreaded application programs under both private and shared last-level caches. The results collected emphasize the importance of optimizing the off-chip data accesses.
A longitudinal study of the effects of ecological interface design on deep knowledge

Some researchers have argued that providing operators with externalized, graphic representations can lead to a trade-off whereby deep knowledge is sacrificed for cognitive economy and performance. This article provides an initial empirical investigation of this hypothesis by presenting a longitudinal study of the effect of ecological interface design (EID), a framework for designing interfaces for complex industrial systems, on subjects' deep knowledge. The experiment continuously observed the quasi-daily performance of the subjects' over a period of six months. The research was conducted in the context of DURESS II, a real-time, interactive thermal-hydraulic process control simulation that was designed to be representative of industrial systems. The performance of two interfaces was compared, an EID interface based on physical and functional (P+F) system representations and a more traditional interface based solely on a physical (P) representation. Subjects were required to perform several control tasks, including startup, tuning, shutdown and fault management. Occasionally, a set of knowledge elicitation tests was administered to assess the evolution of subjects' deep knowledge of DURESS II. The results suggest that EID can lead to a functionally organized knowledge base as well as superior performance, but only if subjects actively reflect on the feedback they get from the interface. In contrast, if subjects adopt a surface approach to learning, then EID can lead to a shallow knowledge base and poor performance, although no worse than that observed with a traditional interface.
An Algorithm for the In-Field Calibration of a MEMS IMU

Recently, micro electro-mechanical systems (MEMS) inertial sensors have found their way in various applications. These sensors are fairly low cost and easily available but their measurements are noisy and imprecise, which poses the necessity of calibration. In this paper, we present an approach to calibrate an inertial measurement unit (IMU) comprised of a low-cost tri-axial MEMS accelerometer and a gyroscope. As opposed to existing methods, our method is truly infield as it requires no external equipment and utilizes gravity signal as a stable reference. It only requires the sensor to be placed in approximate orientations, along with the application of simple rotations. This also offers easier and quicker calibration comparatively. We analyzed the method by performing experiments on two different IMUs: an in-house built IMU and a commercially calibrated IMU. We also calibrated the in-house built IMU using an aviation grade rate table for comparison. The results validate the calibration method as a useful low-cost IMU calibration scheme.
An algorithm for implementing the differentiation of spatial topological relations between lines based on Oracle Spatial Topology Data Model

To extend the applications of Oracle Spatial Topology Data Model (OSTDM) within spatial relations, the study presents an algorithm for OSTDM to determine the nine elements of the 9-intersection matrix that can be used to differentiate the 33 kinds of spatial topological relations between the two lines described in the 9-intersection model. Three elements about the boundary of line A can be determined by using the two extreme nodes of the line A to differentiate the spatial topological relations with line B. Two elements about the boundary of line B can be determined by using the two extreme nodes of the line B to differentiate the spatial topological relations with line A. Three elements about the interior of line A and line B can be determined by using both edges of the two lines to differentiate the spatial topological relations with each other. The last one element about the exterior of line A and line B can be determined by using the infiniteness of the exterior of spatial lines. The algorithm was designed to avoid the use of Oracle Spatial functions and thus can be run faster, and was proved to be valid by practice in programming.
The Centrality Of Culture And Community To Participant Learning At And With The Math Forum

In this chapter, the terms culture and community are problematized, and their centrality to participant learning at and with The Math Forum (mathforum.org) is discussed.2 Culture, as it is used here, refers to the rituals and norms that come to be associated with a site and its functioning. Community describes recognition of connections to and identification with other participants. The Math Forum is an interactive and inquiry-informed digital library, or virtual resource center, for mathematics education. Previous chapters have addressed the ways in which The Math Forum has leveraged the concept of community in order to become a dynamic and resource-rich educational site (Renninger & Shumar, 2002; Shumar & Renninger, 2002). In the present chapter, this analysis is taken a step further. The culture of The Math Forum is described as providing its participants with a unique set of opportunities for learning and for making the relationship between the individual and the community one in which individual and community
Sampling of signals in energy domain

The paper introduces a new event-based criterion for discrete representations of continuous-time signals, which can be used in intelligent sensors to report the current state of the observed object. The criterion is based on the control of the sampling error energy. The analytic approximation of the mean sampling rate for a given sampling resolution is derived. The formula for the reduction of sampling rate with respect to periodic sampling is found. The analytical calculations are validated by simulation results
Analysis of deterministic routing in k-ary n-cubes with virtual channels

Adding virtual channels to wormhole-routed networks greatly improves performance because they reduce blocking by acting as "bypass" lanes for non-blocked messages. Although several analytical models have been proposed in the literature for k-ary n-cubes with deterministic routing, most of them have not included the effects of virtual channel multiplexing on network performance. This paper proposes a new and simple analytical model to compute message latency in k-ary n-cubes with an arbitrary number of virtual channels. Results from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions. The proposed model is then used to investigate the relative performance merits of two different organisations of virtual channels.
Sleeping management for scalable topology control in wireless sensor networks

Wireless sensor network (WSN) is an important instrument to realize wireless monitoring and control in various application fields. Energy conservation are crucial for WSNs to prolong the network lifetime. In this paper, we study sleeping management schemes which can efficiently control the network topology and significantly reduce the energy consumption by selectively turning off the radios of abundant sensor nodes. Based on the observation that a Matern Hard-core Process (MHP) could thin out evenly distributed nodes from a dense graph, we propose Backbone Energy Efficient Sleeping (BEES) management scheme, whose central idea is to generate and maintain the backbone by simulating MHPs. There are three attractive features of BEES: (i) the backbone size could be conveniently scaled according to the practical requirements; (ii) the backbone is energy efficient in the point of view of packet forwarding (or routing); (iii) the construction of backbone is robust to possible ranging errors, which ensures the feasibility and reliability in practice. Theoretical analysis and simulation experiments are carried out to demonstrate the correctness and effectiveness of BEES. Numerical results indicate that, compared with two existing sleeping management schemes, BEES provides about 30% wider range of scalability, consumes about 13% less routing energy, and achieves 11% ∼ 20% longer network lifetime under different traffic loads. Copyright © 2009 John Wiley & Sons, Ltd.
Draft Genome Sequence of the Mercury-Resistant Bacterium Acinetobacter idrijaensis Strain MII, Isolated from a Mine-Impacted Area, Idrija, Slovenia

ABSTRACT We report here the first draft assembly for the genome of Acinetobacter idrijaensis strain MII, isolated from the Idrija mercury mine area (Slovenia). This strain shows a strikingly high tolerance to mercury, and the genome sequence shows genes involved in the mechanisms for heavy metal tolerance pathways and multidrug efflux pumps.
Development of Human Tracking in Video Surveillance System for Activity Analysis

In current era of digital technology visual surveillance systems are persistently in pursuance of being easier to use, versatile, inexpensive and very fast. Continuous video capturing systems are the replacement for human watch, because as we know human can be easily distracted and one mistake may lead to big disaster. So video surveillance systems make this kind of work very easier for user and it provides security and control where all time watch is required. Proposed algorithm will helpful for to detect moving object and classify it as human being and keep track of moving human. This procedure is done without getting help of any additional sensing device. In this paper proposed system can classify in three steps detection, tracking and action analysis. Detection of human being is done by combination of morphological procedure and feature extraction method. Tracking of same human and occlusion handling is done in second phase. At last phase activity analysis is done and in case of any abnormal activities, an alert should be issued.
Verification Tests for MCAPI

Simulation based verification is the most commonly used verification technique in the industry. However, the effort of generating new tests is non-trivial especially for the newly emerging multicore applications. Automated test generation greatly reduces the cost of testing ultimately improving the quality of multicore software. We develop an automated test generation framework using static analysis techniques for embedded multicore applications. We use an emerging multicore standard for multicore applications, named Multicore Communication API (MCAPI). MCAPI is a lightweight API that targets heterogeneous multicore embedded systems. Specifically, our techniques lever- age mutation testing and model checking. We present preliminary experimental results to validate the effectiveness of our approach.
Entropy-based complexity of the cardiovascular control in Parkinson disease: Comparison between binning and k-nearest-neighbor approaches

Entropy-based approaches are frequently used to quantify complexity of short-term cardiovascular control from spontaneous beat-to-beat variability of heart period (HP) and systolic arterial pressure (SAP). Among these tools the ones optimizing a critical parameter such as the pattern length are receiving more and more attention. This study compares two entropy-based techniques for the quantification of complexity making use of completely different strategies to optimize the pattern length. Comparison was carried out over HP and SAP variability series recorded from 12 Parkinson's disease (PD) patients without orthostatic hypotension or symptoms of orthostatic intolerance and 12 age-matched healthy control (HC) subjects. Regardless of the method, complexity of cardiovascular control increased in PD group, thus suggesting the early impairment of cardiovascular function.
Comparative Activity of Tobramycin, Amikacin, and Gentamicin Alone and with Carbenicillin Against Pseudomonas aeruginosa

The effect of gentamicin against 130 clinical isolates of Pseudomonas aeruginosa was compared with that of two investigational aminoglycoside antibiotics, tobramycin and amikacin. Minimal inhibitory concentration data indicated that, on a weight basis, tobramycin was two to four times as active as gentamicin against most isolates. However, 14 of 18 organisms highly resistant to gentamicin (≥80 μg/ml) were also highly resistant to tobramycin. Amikacin was the least active aminoglycoside on a weight basis, but none of the isolates were highly resistant to this antibiotic. When therapeutically achievable concentrations were used, adding carbenicillin to gentamicin or to tobramycin enhanced inhibitory activity against those isolates susceptible (≤5 μg/ml) or moderately resistant (10 to 40 μg/ml) to the aminoglycoside. Such synergy was seldom demonstrated for isolates highly resistant to gentamicin or tobramycin. The combination of carbenicillin and amikacin enhanced inhibition against all but two of the isolates. Both tobramycin and amikacin offer in vitro advantages over gentamicin against P. aeruginosa.
What Is Your Diagnosis?

A 65-year-old-woman who complained of uncontrollable passage of gas and feces from the vagina without fever or abdominal pain was referred to the Obstetrics and Gynecology Department. She was in good health and had previously undergone total hysterectomy by laparotomy 20 years earlier for uterine leiomyomata. The symptoms began 5 months after an acute sigmoiditis and were accompanied by vulvovaginal burns and itching. She had undergone several gynecological examinations, which failed to identify the etiology. Rectosigmoidoscopy and magnetic resonance imaging (MRI) also failed to establish a diagnosis. A subsequent workup by vaginography resolved the etiological investigation (Figure 1, 2).
Modeling musicological information as trigrams in a system for simultaneous chord and local key extraction

In this paper, we discuss the introduction of a trigram musicological model in a simultaneous chord and local key extraction system. By enlarging the context of the musicological model, we hoped to achieve a higher accuracy that could justify the associated higher complexity and computational load of the search for the optimal solution. Experiments on multiple data sets have demonstrated that the trigram model has indeed a larger predictive power (a lower perplexity). This raised predictive power resulted in an improvement in the key extraction capabilities, but no improvement in chord extraction when compared to a system with a bigram musicological model.
Simulating spiking neural networks on GPU

Modern graphics cards contain hundreds of cores that can be programmed for intensive calculations. They are beginning to be used for spiking neural network simulations. The goal is to make parallel simulation of spiking neural networks available to a large audience, without the requirements of a cluster. We review the ongoing efforts towards this goal, and we outline the main difficulties.
Local Features in APICAS:Analyzing of Added Value of the Descriptors Based on MPEG-7 Vector Quantization

An approach for extracting higher-level visual features for art painting classification based on MPEG-7 descriptors was implemented in the system “Art Painting Image Colour Aesthetics and Semantics” (APICAS). The approach consists of the following steps: (1) tiling images into non-overlapping rectangles in order to capture more detailed local information; (2) the tiles of the images are clustered for each MPEG-7 descriptor; (3) vector quantization is used to assign a unique value to each tile, which corresponds to the number of the cluster where the tile belongs, in order to reduce the dimensionality of the data. The distribution of significance of the attributes, the importance of the underlying MPEG-7 descriptors as well as analysis of spatial granularity for class prediction in this domain are analyzed. KeywordsContent-Based Image Retrieval (CBIR); Multimedia Semantics; MPEG-7 Descriptors; Vector Quantization; Categorization
CONTEXTUAL INTERFERENCE: IS IT SUPPORTED ACROSS STUDIES?

This meta-analysis examined the influence of the task, environment and learners characteristics during motor skill learning situations for varying organizations of task presentations (Contextual Interference). Types of tasks (open and closed skills) were evaluated based upon settings (laboratory and real world) with diverse populations (gender, age groups, and level of expertise). The strength of the CI effect was investigated based on whether the skill variation was a variation of the same or different Generalized Motor Program (GMP). Effect sizes were calculated subtracting low (blocked) from high (random/serial) contextual interference schedules of practice during acquisition, retention and transfer phases. Seventy-five published studies were found in the literature search. A total of 309 effect sizes were computed from 51 studies. The overall treatment effect supported contextual interference for blocked and random comparisons but not for blocked and serial comparisons. Another important finding was that contextual interference is most strongly supported for variation in GMP than for variation in parameter when comparing blocked and random schedules of practice. Furthermore, similar effect sizes were demonstrated for ecologically valid and non-ecologically valid settings, reinforcing the applicability of contextual interference theory in teaching motor skills in real world situations. Effect size differences among varied levels of amounts of practice, internal validity, and knowledge of results were not significantly different but pointed to directions that are worth of discussion.
Purification and characterization of the Streptomyces lividans initiator protein DnaA

The Streptomyces lividans DnaA protein (73 kDa) consists, like the Escherichia coli DnaA protein (52 kDa), of four domains. The larger size of the S. lividans protein is due to an additional stretch of 120 predominantly acidic amino acids within domain II. The S. lividans protein was overproduced as a His-tagged fusion protein. The purified protein (isoelectric point, 5.7) has a weak ATPase activity. By DNase I footprinting studies, each of the 17 DnaA boxes (consensus sequence, TTGTCCACA) in the S. lividans oriC region was found to be protected by the DnaA fusion protein. Purified mutant proteins carrying a deletion of the C-terminally located helix-loop-helix (HLH) motif or with amino acid substitutions in helix A (L577G) or helix B (R595A) no longer interact with DnaA boxes. A substitution of basic amino acids in the loop of the HLH motif (R587A or R589A) entailed the formation of S. lividans mutant DnaA proteins with little or no capacity for binding to DnaA boxes. Thus, like in E. coli, the C-terminally located domain IV is absolutely necessary for the specific binding of DnaA. A mutant protein lacking a stretch of acidic amino acids corresponding to domain II is not affected in its DNA binding capacity. Whether the acidic domain II interacts with accessory proteins remains to be elucidated.
Priority-Based Conflict Resolution for Hardware Transactional Memory

Lock-based thread synchronization techniques have been commonly used in parallel programming on multi-core processors. However, lock can cause deadlocks and poor scalabilites, and Transactional Memory (TM) has been proposed and studied for lock-free synchronization. On TMs, transactions are executed speculatively as long as there is no conflict on shared variables. On HTMs, which are the hardware implementations of TM, if a speculative execution of a transaction fails, the re-execution of the transaction should wait a period prescribed by a back off algorithm to avoid further conflicts. However, the performance of HTM may be decreased drastically by wastefully long back off periods. To address this problem, in this paper, we propose a new algorithm to set a value called Priority on each transaction, and the transaction which should be aborted is selected according to Priority instead of the initiated time of transactions. The result of the experiment shows that the execution time of HTM is reduced 59.9% in maximum, and 11.2% in average with 16 threads.
Meshfree methods in option pricing

A meshfree approximation scheme based on the radial basis function (RBF) methods is presented for the numerical solution of the options pricing model. This work deals with the valuation of the European, Asian and American options. The option prices are modeled by the Black-Scholes equation. The θ-method is used to discretize the equation with respect to time. Next, the option price is approximated in space with RBF. In case of American options a penalty method is used, i.e. the free boundary is removed by adding a small and continuous penalty term to the Black-Scholes equation. Finally, we present a comparison of analytical and finite difference solutions and numerical results.