Miracle-dz/UniFAR-FTUs huggingface dataset:
Self-Adaptive System for Addressing Permanent Errors in On-Chip Interconnects

We present a self-contained adaptive system for detecting and bypassing permanent errors in on-chip interconnects. The proposed system reroutes data on erroneous links to a set of spare wires without interrupting the data flow. To detect permanent errors at runtime, a novel in-line test (ILT) method using spare wires and a test pattern generator is proposed. In addition, an improved syndrome storing-based detection (SSD) method is presented and compared to the ILT method. Each detection method (ILT and SSD) is integrated individually into the noninterrupting adaptive system, and a case study is performed to compare them with Hamming and Bose-Chaudhuri-Hocquenghem (BCH) code implementations. In the presence of permanent errors, the probability of correct transmission in the proposed systems is improved by up to 140% over the standalone Hamming code. Furthermore, our methods achieve up to 38% area, 64% energy, and 61% latency improvements over the BCH implementation at comparable error performance.
Enhanced Presynaptic Neurotransmitter Release in the Anterior Cingulate Cortex of Mice with Chronic Pain

The anterior cingulate cortex (ACC) is a forebrain structure known for its roles in learning and memory. Recent studies show that painful stimuli activate the prefrontal cortex and that brain chemistry is altered in this area in patients with chronic pain. Components of the CNS that are involved in pain transmission and modulation, from the spinal cord to the ACC, are very plastic and undergo rapid and long-term changes after injury. Patients suffering from chronic pain often complain of memory and concentration difficulties, but little is known about the neural circuitry underlying these deficits. To address this question, we analyzed synaptic transmission in the ACC from mice with chronic pain induced by hindpaw injection of complete Freund's adjuvant (CFA). In vitro whole-cell patch-clamp recordings revealed a significant enhancement in neurotransmitter release probability in ACC synapses from mice with chronic pain. Trace fear memory, which requires sustained attention and the activity of the ACC, was impaired in CFA-injected mice. Using knock-out mice, we found that calmodulin-stimulated adenylyl cyclases, AC1 and/or AC8, were crucial in mediating the long-lasting enhanced presynaptic transmitter release in the ACC of mice with chronic pain. Our findings provide strong evidence that presynaptic alterations caused by peripheral inflammation contribute to memory impairments after injury.
Circadian Clocks for All Meal-Times: Anticipation of 2 Daily Meals in Rats

Anticipation of a daily meal in rats has been conceptualized as a rest-activity rhythm driven by a food-entrained circadian oscillator separate from the pacemaker generating light-dark (LD) entrained rhythms. Rats can also anticipate two daily mealtimes, but whether this involves independently entrained oscillators, one ‘continuously consulted’ clock, cue-dependent non-circadian interval timing or a combination of processes, is unclear. Rats received two daily meals, beginning 3-h (meal 1) and 13-h (meal 2) after lights-on (LD 14∶10). Anticipatory wheel running began 68±8 min prior to meal 1 and 101±9 min prior to meal 2 but neither the duration nor the variability of anticipation bout lengths exhibited the scalar property, a hallmark of interval timing. Meal omission tests in LD and constant dark (DD) did not alter the timing of either bout of anticipation, and anticipation of meal 2 was not altered by a 3-h advance of meal 1. Food anticipatory running in this 2-meal protocol thus does not exhibit properties of interval timing despite the availability of external time cues in LD. Across all days, the two bouts of anticipation were uncorrelated, a result more consistent with two independently entrained oscillators than a single consulted clock. Similar results were obtained for meals scheduled 3-h and 10-h after lights-on, and for a food-bin measure of anticipation. Most rats that showed weak or no anticipation to one or both meals exhibited elevated activity at mealtime during 1 or 2 day food deprivation tests in DD, suggesting covert operation of circadian timing in the absence of anticipatory behavior. A control experiment confirmed that daytime feeding did not shift LD-entrained rhythms, ruling out displaced nocturnal activity as an explanation for daytime activity. The results favor a multiple oscillator basis for 2-meal anticipatory rhythms and provide no evidence for involvement of cue-dependent interval timing.
Preparation and fatigue property of nanoclay modified asphalt binder

Due to great temperature susceptivity, aging and inferior fatigue resistance, the serviceability of asphalt materials has been limited in same degree. The modification becomes an effective way to improve the performance of asphalt material. The modification applying nanoclay can not only improve the properties of bitumen but also lower costs to a great extent, so it becomes the research focus recently. It is well known that fatigue is considered to be one of the most significant distresses in any flexible pavement which is subjected to repeated traffic loading or stress. So it is very significant to pavement designer to investigate the fatigue characteristics of asphalt binder. The present research has chosen organic nano-montmorillonite (OMMT) to prepare the nanoclay modified bitumen using high speed shearer in laboratory. The X-Ray Diffraction (XRD) test was used to analyse the dispersion structure in the modified bitumen. And the fatigue test was carried out to evaluate the fatigue resistance property of the modified bitumen by Dynamic Shear Rheometer (DSR). The stress loading mode was applied to simulate the actual traffic loading. Finally, the fatigue equations were educed to fit the experiment results. The research results show that the modified bitumen containing nanoclay suggests excellent fatigue resistance.
Linking Speech and Gesture in Multimodal Instruction Systems

This paper analyses the timing of gesture and speech acts in a corpus (MIBL) of free-flowing human-to-human instruction dialogues. From there, an algorithm is proposed to establish the pairing between speech and gesture of the instructor. It is shown that correct pairing requires timing and semantic information. Further work will explore the use of this algorithm in unconstrained free flowing multimodal instruction dialogues between human and robot. A brief overview of a robotic system is given, that is able to learn a card game from a human teacher
On some symmetry based validity indices

Identification of the correct number of clusters and the corresponding partitioning are two important considerations in clustering. In this paper, a newly developed point symmetry based distance is used to propose symmetry based versions of six cluster validity indices namely, DB-index, Dunn-index, generalized Dunn-index, PS-index, I-index and XB-index. These indices provide measures of "symmetricity" of the different partitionings of a data set. A Kd-tree-based data structure is used to reduce the complexity of computing the symmetry distance. A newly developed genetic point symmetry based clustering technique, GAPS-clustering is used as the underlying partitioning algorithm. The number of clusters are varied from 2 to radicn where n is the total number of data points present in the data set and the values of all the validity indices are noted down. The optimum value of a validity index over these radicn-1 partitions corresponds to the appropriate partitioning and the number of partitions as indicated by the validity index. Results on five artificially generated and four real-life data sets show that symmetry distance based I-index performs the best compared to all the other five indices.
Statistical Analysis of Bayes Optimal Subset Ranking

The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a formulation of the statistical ranking problem which we call subset ranking, and focus on the discounted cumulated gain (DCG) criterion that measures the quality of items near the top of the rank-list. Similar to error minimization for binary classification, direct optimization of natural ranking criteria such as DCG leads to a nonconvex optimization problems that can be NP-hard. Therefore, a computationally more tractable approach is needed. We present bounds that relate the approximate optimization of DCG to the approximate minimization of certain regression errors. These bounds justify the use of convex learning formulations for solving the subset ranking problem. The resulting estimation methods are not conventional, in that we focus on the estimation quality in the top-portion of the rank-list. We further investigate the asymptotic statistical behavior of these formulations. Under appropriate conditions, the consistency of the estimation schemes with respect to the DCG metric can be derived.
A Novel Pre-processing Technique for DCT- domain Palm-print Recognition

In this paper, a novel pre-processing algorithm is introduced to identify the principal lines from a palm-print image and a discrete cosine transform (DCT) domain feature extraction algorithm is then employed for palm-print recognition, which can efficiently capture the spatial variations in the principal lines of a palm-print image. The entire image is segmented into several small spatial modules. The task of feature extraction is carried out in local zones using two dimensional discrete cosine transform (2D-DCT). The proposed dominant DCT-domain feature selection algorithm offers an advantage of very low feature dimension and it is capable of capturing precisely the detail variations within the palm- print image. It is shown that because of the pre-processing step, the discriminating capabilities of the proposed features are enhanced, which results in a very high within-class compactness and between-class separability of the extracted features. From our extensive experimentations on different palm-print databases, it is found that the performance of the proposed method in terms of recognition accuracy and computational complexity is superior to that of some of the recent methods.
Phasic Dopaminergic Activity Exerts Fast Control of Cholinergic Interneuron Firing via Sequential NMDA, D2, and D1 Receptor Activation

Phasic increases in dopamine (DA) are involved in the detection and selection of relevant sensory stimuli. The DAergic and cholinergic system dynamically interact to gate and potentiate sensory inputs to striatum. Striatal cholinergic interneurons (CINs) respond to relevant sensory stimuli with an initial burst, a firing pause, or a late burst, or a combination of these three components. CIN responses coincide with phasic firing of DAergic neurons in vivo. In particular, the late burst of CINs codes for the anticipated reward. To examine whether DAergic midbrain afferents can evoke the different CIN responses, we recorded from adult olfactory tubercle slices in the mouse ventral striatum. Olfactory inputs to striatal projection neurons were gated by the cholinergic tone. Phasic optogenetic activation of DAergic terminals evoked combinations of initial bursts, pauses, and late bursts in subsets of CINs by distinct receptor pathways. Glutamate release from midbrain afferents evoked an NMDAR-dependent initial burst followed by an afterhyperpolarization-induced pause. Phasic release of DA itself evoked acute changes in CIN firing. In particular, in CINs without an initial burst, phasic DA release evoked a pause through D2-type DA receptor activation. Independently, phasic DA activated a slow depolarizing conductance and the late burst through a D1-type DA receptor pathway. In summary, DAergic neurons elicit transient subsecond firing responses in CINs by sequential activation of NMDA, D2-type, and D1-type receptors. This fast control of striatal cholinergic tone by phasic DA provides a novel dynamic link of two transmitter systems central to the detection and selection of relevant stimuli.
Optimal torque control of the Interior Permanent Magnet Synchronous Machine

The basic function of any type of electric machine used in automotive powertrain is to propel the automobile in motor mode or to recharge the high-voltage battery in generator mode. The torque control of electric machine in motor and generator modes, using more efficient high-voltage battery, is a goal for automotive industry. The entire control structure must be designed so as to take into account also the limitations of the computer based implementation in an Electronic Control Unit. A good choice for Hybrid Electric Vehicles (HEVs), due to many advantages, is the Interior Permanent Magnet Synchronous Machine (IPMSM). In this paper, a model for a 35 KW IPMSM used by a future HEV is presented. Starting from the developed model a dynamic simulator was implemented in MATLAB/SIMULINK and then, an optimal field oriented control strategy is applied with aims at optimum torque control both in constant torque region and in constant power region, considering the variation of machine parameters. The model was validated against the data provided by Continental Automotive Romania from the system testbench. The simulated results obtained with the proposed control strategy are compared with the ones obtained with the classical PID approach and the results show improved performances.
Fermentative arginine degradation in Halobacterium salinarium (formerly Halobacterium halobium): genes, gene products, and transcripts of the arcRACB gene cluster

Fermentative growth via the arginine deiminase pathway is mediated by the enzymes arginine deiminase, carbamate kinase, and catabolic ornithine transcarbamylase and by a membrane-bound arginine-ornithine antiporter. Recently we reported the characterization of catabolic ornithine transcarbamylase and the corresponding gene, arcB, from Halobacterium salinarium (formerly Halobacterium halobium). Upstream of the arcB gene, three additional open reading frames with halobacterial codon usage were found. They were identified as the arcC gene coding for carbamate kinase, the arcA gene coding for arginine deiminase, and a gene, tentatively termed arcR, coding for a putative regulatory protein. The identification of the arcC and arcA genes was verified, respectively, by heterologous expression of the enzyme in Haloferax volcanii and by protein isolation and N-terminal sequence determination of three peptides. The gene order arcRACB differs from the gene order arcDABC in Pseudomonas aeruginosa, the only other organism for which sequence information is available. Transcripts from H. salinarium cultures grown fermentatively or aerobically were characterized by Northern (RNA) blot and primer extension analyses. It was determined (i) that monocistronic transcripts corresponding to the four open reading frames exist and that there are three polycistronic transcripts, (ii) that the level of induction during fermentative growth differs for the various transcripts, and (iii) that upstream of the putative transcriptional start sites for the three structural genes there are sequences with similarities to the halobacterial consensus promoter. The data indicate that expression of the arc gene cluster and its regulation differ in H. salinarium and P. aeruginosa.
Chapter 8 Managing Class Evolution in Object-Oriented Systems

Software components developed with an object-oriented language undergo considerable reprogramming before they become reusable for a wide range of applications or domains. Tools and methodologies are therefore needed to cope with the complexity of designing, updating and reorganizing class collections. We present a typology of techniques for controlling change in object-oriented systems, illustrate their functionality with selected examples and discuss their advantages and limitations. 8.1 Object Design and Redesign
The Nature of GRB 980425 and the Search for Off-Axis Gamma-Ray Burst Signatures in Nearby Type Ib/c Supernova Emission

The identification of Type Ib/c supernovae (SNe Ib/c) as gamma-ray burst (GRB) progenitors is motivated by the association of GRB 980425 with SN 1998bw and of GRB 030329 with SN 2003dh. While the gamma-ray luminosity of GRB 030329 was typical to cosmological GRBs, the luminosity of the nearby (40 Mpc) GRB 980425 was ~5 orders of magnitude lower. The large luminosity difference is commonly explained by hypothesizing either that SNe Ib/c produce two different classes of GRBs or that GRB 980425 was a typical cosmological GRB jet viewed off-axis. In the latter scenario, strong radio emission, Lν ~ 1030ν ergs s-1 Hz-1, is expected at ~1 yr delay as a result of jet deceleration to subrelativistic speed, as observed from GRB 970508. The radio luminosity of SN 1998bw was 3 orders of magnitude lower than this value. We show that the low radio flux may be consistent with the off-axis jet interpretation, if the density of the wind surrounding the progenitor is lower than typically expected, ≡ (/10-5 M☉ yr-1)/(vw/103 km s-1) ≃ 0.1 instead of ≳ 1. The lower value of is consistent with the observed radio emission from the SN shock driven into the wind. This interpretation predicts transition to subrelativistic expansion at ~10 yr delay, with current ≈1 mJy 10 GHz flux and mV ≈ 23 optical flux, and with ≈10 mas angular source size. It also implies that in order to search for the signature of off-axis GRBs associated with nearby SNe Ib/c, follow-up observations should be carried out on a multiyear timescale.
Detecting steganography on a large scale

Steganography is the science of hiding information; this is often confused with the related science of cryptography, which is similar to a virtual “padlock” that openly challenges an eavesdropper to break into a message. Unlike cryptography, steganography challenges an eavesdropper to notice the presence of a message. In practical terms, this means that steganography can be anywhere; there is potential for a hidden message wherever information lies. The earliest example of steganography references the time of the Romans. A general shaved the head of a trusted slave, tattooed a message on top of his head, and then sent the slave across the country after his hair grew back. When the slave reached his destination unopposed, he shaved his head to reveal the hidden message [5]. Other examples of classic steganography involve the usage of invisible ink and microdots in World War II [2]. In this article, I will first establish the foundations of information hiding, then describe some elementary methods used in steganography and steganalysis, and finally explain the results of a research experiment I performed in order to understand how to undertake large-scale steganalysis.
Evaluating Cache Coherence in the DSMIO System

There has been a significant amount of research on object-based database management systems (ODBMS). In contrast to traditional relational systems, ODBMS use the same data model for the clients and the server. Thus, parallel ODBMS typically adopt a data-shipping architecture, which allows data request processing to be performed at the clients. Although such a strategy can improve performance by moving data closer to clients and by alleviating the load on the server, it raises the issue of cache coherence. Our work is based on the observation that coherence maintenance techniques developed to improve softwarebased distributed shared-memory systems can be exploited to improve parallel ODBMS. In previous papers we proposed a coherence algorithm, called DSMIO, that uses the Lazy Release Consistency model and the diffing mechanism to limit the number and size of coherence messages and save cache space. These papers evaluated DSMIO in the context of a parallel object-based database system where one machine acted as a server, accessing stable storage and keeping client caches coherent. In this paper we evaluate DSMIO for a system where each machine can act both as a client and a server. We use the state-of-the-art CallBack Locking (CBL) cache coherence algorithm as a basis for comparison. Our results show that DSMIO significantly outperforms CBL for workloads with even a moderately high frequency of database updates. Keywords— Client-Server OODBMS, Parallel Database Systems, Cache Coherence, Distributed Shared Memory
Potential Games: A Framework for Vector Power Control Problems With Coupled Constraints

In this paper we propose a unified framework, based on the emergent potential games to deal with a variety of network resource allocation problems. We generalize the existing results on potential games to the cases where there exists coupling among the (possibly vector) strategies of all players. We derive sufficient conditions for the existence and uniqueness of the Nash equilibrium, and provide different distributed algorithms along their convergence properties. Using this new framework, we then show that many power control problems (standard and non-standard) with coupled constraints among the users, can be naturally formulated as potential games and, hence, efficiently solved. Finally, we point out an interesting interplay existing between potential games, classical optimization theory, and Lyapunov stability theory
Digital Cognitive Tests with Brazilian elderly

Serious games are presented as a very promising mechanism in many settings, such as education and health, however its application with the elderly is little verified. In order to reproduce in digital form the results of the elderly cognitive assessments, made and validated on paper, in this study a digital cognitive test tool, with the characteristics of a serious game, was developed using the Unified Design process. As conclusion, it is suggested that it is possible to achieve results similar to those obtained by validated and paper-based tests, from a game, adapted to the needs of the elderly, in a digital cognitive test format.
A study of hardware assisted IP over InfiniBand and its impact on enterprise data center performance

High-performance sockets implementations such as the Sockets Direct Protocol (SDP) have traditionally showed major performance advantages compared to the TCP/IP stack over InfiniBand (IPoIB). These stacks bypass the kernel-based TCP/IP and take advantage of network hardware features, providing enhanced performance. SDP has excellent performance but limited utility as only applications relying on the TCP/IP sockets API can use it and other IP stack uses (IPSec, UDP, SCTP) or TCP layer modifications (iSCSI) cannot benefit from it. Recently, newer generations of InfiniBand adapters, such as ConnectX from Mellanox, have provided hardware support for the IP stack itself, such as Large Send Offload and Large Receive Offload. As such high performance socket networks are likely to be deployed or converged with existing Ethernet networking solutions, the performance of such technologies is important to assess. In this paper we take a first look at the performance advantages provided by these offload techniques and compare them to SDP. Our micro-benchmarks and enterprise data-center experiments show that hardware assisted IPoIB can provide competitive performance with SDP and even outperform it in some cases.