Miracle-dz/UniFAR-FTUs huggingface dataset:
SVFD: A Versatile Online Fault Detection Scheme via Checking of Stability Violation

In ultra-deep submicrometer technology, soft errors and device aging are two of the paramount reliability concerns. Although many studies have been done to tackle the two challenges, most take them separately so far, thereby failing to reach better performance-cost tradeoffs. To support a more efficient design tradeoff, we propose a unified fault detection scheme - stability violation-based fault detection (SVFD), by which the soft errors (both single event upset and single event transient), aging delay, and delay faults can be uniformly dealt with. SVFD grounds on a new fault model, stability violation, derived from analysis of signal behavior. SVFD has been validated by conducting a set of intensive Hspice simulations targeting the next-generation 32-nm CMOS technology. An application of SVFD to a floating-point unit (FPU) is also evaluated. Experimental results show that SVFD has more versatile fault detection capability for fault detection than several schemes recently proposed at comparable overhead in terms of area, power, and performance.
FPGA IMPLEMENTATION OF LOW POWER BIST APPROACH FOR FUNCTIONAL BROAD SIDE TEST

Functional broadside tests are two-pattern scan based tests that avoid over testing by ensuring that a circuit traverses only reachable states during the functional clock cycles of a test. In addition, the power dissipation during the fast functional clock cycles of functional broadside tests does not exceed that possible during functional operation. On-chip test generation has the added advantage that it reduces test data volume and facilitates at-speed test application. This paper shows that on chip generation of functional broadside tests can be done using a simple and fixed hardware structure, with a small number of parameters that need to be tailored to a given circuit, and can achieve high transition fault coverage for testable circuits. With the proposed on-chip test generation method, the circuit is used for generating reachable states during test application. This alleviates the need.
Vectorial Hyperbent Trace Functions From the  $\mathcal {PS}_{\rm ap}$  Class—Their Exact Number and Specification

To identify and specify trace bent functions of the form Tr(P(x)), where P(x) ∈ F(2<sup>n</sup>)[x], has been an important research topic lately. We characterize a class of vectorial (hyper)bent functions of the form F(x) = Tr<sub>k</sub><sup>n</sup> (Σ<sub>i=0(</sub>2<sup>k</sup>) a<sub>i</sub>x<sup>i(</sup>(2<sup>k</sup>)<sup>-1)</sup>), where n = 2k, in terms of finding an explicit expression for the coefficients a<sub>i</sub> so that F is vectorial hyperbent. These coefficients only depend on the choice of the interpolating polynomial used in the Lagrange interpolation of the elements of U and some prespecified outputs, where U is the cyclic group of (2<sup>n/2</sup> + 1)th roots of unity in F(2<sup>n</sup>). We show that these interpolation polynomials can be chosen in exactly (2<sup>k</sup> + 1)! 2<sup>k-1</sup> ways and this is the exact number of vectorial hyperbent functions of the form Tr<sub>k</sub><sup>n</sup> (Σ<sub>i=0</sub><sup>2k</sup> a<sub>i</sub>x<sup>i(</sup>(2<sup>k</sup>)<sup>-1)</sup>). Furthermore, a simple optimization method is proposed for selecting the interpolation polynomials that give rise to trace polynomials with a few nonzero coefficients.
Citizen typography and political brands in the 2016 US presidential election campaign

The 2016 presidential campaign between Hillary Clinton and Donald Trump saw citizen typography emerge in highly visible and highly impactful ways, particularly as the candidates made seemingly little attempt to maintain full control over their visual brand identities. But what does the surprising significance of typography in this recent campaign reveal about marketing and citizen participation in politics, about political brand management in a networked media environment and about typography’s role as a key pillar of branded political communication? This essay offers two key concepts: the networking of political brands and an emerging logic of participatory aesthetics – both of which point to a decentralization of traditional ‘brand management’ in favour of affectively driven political engagement through visual communications disseminated over communication networks.
Transparent Knowledge Interchange on the Semantic Web

In spite of a large development of semantic web technologies and a deployment of the first complex applications, the semantic web is still not being widely accepted by the web community and its current potential is not full recognised. One vision of the semantic web is to create a platform for automatic and transparent knowledge sharing. In this paper we discuss a model that uses basic semantic web technologies for knowledge interchange. The architecture of the system is designed to hide all the complexity of the semantic web, so that it can be easily adopted and used in existing web applications. The proposed model and an implemented proof-of-concept application, are suitable for knowledge interchange among web communities that share the same knowledge domain on the web.
Vx32: Lightweight User-level Sandboxing on the x86

Code sandboxing is useful for many purposes, but most sandboxing techniques require kernel modifications, do not completely isolate guest code, or incur substantial performance costs. Vx32 is a multipurpose user-level sandbox that enables any application to load and safely execute one or more guest plug-ins, confining each guest to a system call API controlled by the host application and to a restricted memory region within the host's address space. Vx32 runs guest code efficiently on several widespread operating systems without kernel extensions or special privileges; it protects the host program from both reads and writes by its guests; and it allows the host to restrict the instruction set available to guests. The key to vx32's combination of portability, flexibility, and efficiency is its use of x86 segmentation hardware to sandbox the guest's data accesses, along with a lightweight instruction translator to sandbox guest instructions. We evaluate vx32 using microbenchmarks and whole system benchmarks, and we examine four applications based on vx32: an archival storage system, an extensible public-key infrastructure, an experimental user-level operating system running atop another host OS, and a Linux system call jail. The first three applications export custom APIs independent of the host OS to their guests, making their plug-ins binary-portable across host systems. Compute-intensive workloads for the first two applications exhibit between a 30% slowdown and a 30% speedup on vx32 relative to native execution; speedups result from vx32's instruction translator improving the cache locality of guest code. The experimental user-level operating system allows the use of the guest OS's applications alongside the host's native applications and runs faster than whole-system virtual machine monitors such as VMware and QEMU. The Linux system call jail incurs up to 80% overhead but requires no kernel modifications and is delegation-based, avoiding concurrency vulnerabilities present in other interposition mechanisms.
Propagation characteristics for land mobile satellite systems from L-band to EHF-band

Several system alternatives are being considered for provision of mobile and personal satelite services in the near future. Many proposals adopt nongeostati onary satellite constellati ons, thus the channel characteristi cs are not stationary. Furthermore, multiple access techniques under consideration range from narrowband to wideband (e.g. CDMA) solutions. Finally, due to the requirement of being virtually global, a satellite system should provide service in a wide range of environmental conditions. The interesting frequency range covers L/S-band, K/Ka-band and the EHF-band.
Activation of Host Translational Control Pathways by a Viral Developmental Switch

In response to numerous signals, latent herpesvirus genomes abruptly switch their developmental program, aborting stable host–cell colonization in favor of productive viral replication that ultimately destroys the cell. To achieve a rapid gene expression transition, newly minted capped, polyadenylated viral mRNAs must engage and reprogram the cellular translational apparatus. While transcriptional responses of viral genomes undergoing lytic reactivation have been amply documented, roles for cellular translational control pathways in enabling the latent-lytic switch have not been described. Using PEL-derived B-cells naturally infected with KSHV as a model, we define efficient reactivation conditions and demonstrate that reactivation substantially changes the protein synthesis profile. New polypeptide synthesis correlates with 4E-BP1 translational repressor inactivation, nuclear PABP accumulation, eIF4F assembly, and phosphorylation of the cap-binding protein eIF4E by Mnk1. Significantly, inhibiting Mnk1 reduces accumulation of the critical viral transactivator RTA through a post-transcriptional mechanism, limiting downstream lytic protein production, and impairs reactivation efficiency. Thus, herpesvirus reactivation from latency activates the host cap-dependent translation machinery, illustrating the importance of translational regulation in implementing new developmental instructions that drastically alter cell fate.
Eurographics/ Acm Siggraph Symposium on Computer Animation (2007) Group Behavior from Video: a Data-driven Approach to Crowd Simulation

Permission to make digital or hard copies of part or all of this wor k for per sonal or classr oom use is granted without fee provided that copies are not made or distributed for commer cial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this wor k owned by other s than ACM must be honored. Abstracting with cr edit is permitted. To copy other wise, to republish, to post on ser ver s, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions Dept, ACM Abstract Crowd simulation techniques have frequently been used to animate a large group of virtual humans in computer graphics applications. We present a data-driven method of simulating a crowd of virtual humans that exhibit behaviors imitating real human crowds. To do so, we record the motion of a human crowd from an aerial view using a camcorder, extract the two-dimensional moving trajectories of each individual in the crowd, and then learn an agent model from observed trajectories. The agent model decides each agent's actions based on features of the environment and the motion of nearby agents in the crowd. Once the agent model is learned, we can simulate a virtual crowd that behaves similarly to the real crowd in the video. The versatility and flexibility of our approach is demonstrated through examples in which various characteristics of group behaviors are captured and reproduced in simulated crowds.
An Improved Pattern Matching Algorithm Based on BMHS

Pattern matching plays an important role in intrusion detection system. Based on analysis and discussions for BM, BMH and BMHS algorithms, an improved algorithm is proposed. The improved algorithm takes advantage of position information of the last character and its adjacent character in current attempt window to get bigger jump distance in each jump so to make the algorithm more efficient. Experimental results show that the number of character comparisons and windows shifts of improved algorithms is clearly reduced comparing with the BM and BMH and BMHS algorithms.
A High Capacity Scalable Routing Protocol for VoIP in Wireless Ad Hoc Networks

Abstract-In this work we introduce a new routing protocol for Wireless Ad hoc Networks specifically designed for VoIP. Based on modifications to standard geographic routing protocols, our new protocol is designed to deliver two key attributes that hitherto are not simultaneously present in any other single ad hoc routing protocol. Specifically, our protocol maximizes VoIP capacity whilst remaining scalable. Prior to this work, state-of-the-art routing protocols which best address the issue of maximizing VoIP capacity in ad hoc networks can be considered to be those based on the Expected Transmission Count (ETX) metric. As such, the performance benefits of our protocol relative to protocols using ETX are detailed. In the context of VoIP, the most important performance improvement for our protocol relative to ETX protocols, is an up-to factor of two improvement in VoIP capacity for anticipated ad hoc network scenarios. Although designed primarily for wireless VoIP, our protocol can be readily adapted to any real-time application deployed over wireless architectures which contain an ad hoc component.
GPU-accelerated eXtended Classifier System

XCS - the extended Classifier System - combines an evolutionary algorithm with reinforcement learning to evolve a population of condition-action rules (classifiers). Typically, population-based approaches are slow and increasing the problem size (in terms of the number of features/samples) poses a real threat to the suitability of XCS for real-world applications. Thus, reducing the execution time without losing accuracy is highly desirable. Profiling of the execution of off-the-shelf XCS implementations suggests that the rule matching process is the most computational demanding step. A solution to this is parallelization, i.e., using parallel processing techniques to speed up the matching process (and thus the entire XCS learning process). There are many ways to achieve that, using Graphic Processing Units (GPUs) is one option. Originally, GPUs were designed to conduct a sequence of graphics operations in a massively parallel fashion. Today, GPUs can be used for all sorts of general purpose calculations that are normally handled by the CPU. In this paper, we propose a hybrid rule matching process using both CPU and GPU simultaneously for a maximum performance gain. Our experimental results indicate that this approach does speed up the XCS learning process, and that the GPU is the dominant powerful computing resource in the model.
Ordinal and Probabilistic Representations of Acceptance

An accepted belief is a proposition considered likely enough by an agent, to be inferred from as if it were true. This paper bridges the gap between probabilistic and logical representations of accepted beliefs. To this end, natural properties of relations on propositions, describing relative strength of belief are augmented with some conditions ensuring that accepted beliefs form a deductively closed set. This requirement turns out to be very restrictive. In particular, it is shown that the sets of accepted belief of an agent can always be derived from a family of possibility rankings of states. An agent accepts a proposition in a given context if this proposition is considered more possible than its negation in this context, for all possibility rankings in the family. These results are closely connected to the non-monotonic 'preferential' inference system of Kraus, Lehmann and Magidor and the so-called plausibility functions of Friedman and Halpern. The extent to which probability theory is compatible with acceptance relations is laid bare. A solution to the lottery paradox, which is considered as a major impediment to the use of non-monotonic inference is proposed using a special kind of probabilities (called lexicographic, or big-stepped). The setting of acceptance relations also proposes another way of approaching the theory of belief change after the works of Gauml;rdenfors and colleagues. Our view considers the acceptance relation as a primitive object from which belief sets are derived in various contexts.
The code for success? Using a Bernsteinian perspective on sociolinguistics to accentuate working-class students’ underachievement in the Republic of Ireland

Educational disadvantage has been a long-standing issue in Ireland, and since the 2006/07 academic year, schools recognised as serving disadvantaged areas receive DEIS (Delivering Equality of Opportunity in Schools) status and subsequent additional funding, resources, and staffing allocations. Studies on DEIS schools usually report the traditional challenges associated with the lower classes when identifying problems schools face: unemployment in the community, a lack of parental interest, involvement and support, absenteeism, behavioural and emotional difficulties, dysfunction among students’ families, etc. while the theme of sociolinguistics and the linguistic repertoire of working class students receives little to no attention. Drawing on Basil Bernstein’s theory of code, this paper outlines the discontinuities that exist between the language of working-class children and the language of the school as a formal institution, which is a salient issue in the context of the Irish education system as it is particularly focused around strong linguistic skills at the expense of other forms of intelligence. This paper therefore highlights the role sociolinguistics play in hindering the academic attainment of working-class students in Irish schools, and explains why this theme has not traditionally surfaced as a detrimental factor in Irish education.
A backbone-floyd hybrid path planning method for mobile robot transportation in multi-floor life science laboratories

Over the last years, growing numbers of mobile robots have been employed for transportation tasks in indoor laboratories. In this paper, a new hybrid path planning strategy with its related systems is presented for multi-floor mobile robot transportation in life science laboratories. The presented method meets the requirements of life science laboratories, which has the innovative contents as follows: a) a Stargazer module is used as a stable and low-cost localization sensor with artificial landmarks that is easily installed to fit any size of laboratories; b) the MFS (Multi-floor System) is the core component of the RBC, which is proposed to process all the multi-floor operating issues during the mobile robot indoor transportation. In this MFS the robot indoor navigation (localization, mapping, and path planning) is focused; c) an IEEE 802.11g network is adopted to provide the wireless communicating environment for all developed software components/systems. In the network, a TCP/IP based protocol is designed to assure the reliability among dynamic transferring commands. The experimental results show that the proposed method is effective for the mobile robot multi-floor transportation in laboratory environments.
Force characterization and commutation of planar linear motors

This work examines force modeling and software-based commutation for closed-loop control of planar linear motors, motivated by the need for a robust and versatile planar robot for precision assembly. The approach taken is to make measurements of the static and dynamic force capabilities of the motor as directly as possible, and determine the applicability of simple models commonly used. Measurements of force ripple, linearity with current, force reduction with skew angle, and eddy current damping forces are presented. The high-frequency current changes required for high-speed motion are shown to make the system sensitive to both the latency and update rate of the commutator and to limit the force generation capabilities at high velocities. Although this effect is caused by multiple sources, it is shown that it is well modeled as a scalar with units of time.
A Model of Atropine‐Resistant Theta Oscillations in Rat Hippocampal Area CA1

Theta frequency oscillations are a predominant feature of rhythmic activity in the hippocampus. We demonstrate that hippocampal area CA1 generates atropine‐resistant theta population oscillations in response to metabotropic glutamate receptor activation under conditions of reduced AMPA receptor activation. This activity occurred in the absence of inputs from area CA3 and extra‐ammonic areas. Field theta oscillations were co‐expressed with pyramidal distal apical dendritic burst spiking and were temporally related to trains of IPSPs with slow kinetics. Pyramidal somatic responses showed theta oscillations consisted of compound inhibitory synaptic potentials with initial IPSPs with slow kinetics followed by trains of smaller, faster IPSPs. Pharmacological modulation of IPSPs altered the theta oscillation suggesting an inhibitory network origin. Somatic IPSPs, dendritic burst firing and stratum pyramidale interneuron activity were all temporally correlated with spiking in stratum oriens interneurons demonstrating intrinsic theta‐frequency oscillations. Disruption of spiking in these interneurons was accompanied by a loss of both field theta and theta frequency IPSP trains. We suggest that population theta oscillations can be generated as a consequence of intrinsic theta frequency spiking activity in a subset of stratum oriens interneurons controlling electrogenesis in pyramidal cell apical dendrites.
Incorporating Spatial, Temporal, and Social Context in Recommendations for Location-Based Social Networks

Location-based social networks (LBSNs) such as Foursquare, Brightkite, and Gowalla are a growing area where recommendation algorithms find a practical application. With an ever-increasing variety of venues to choose from deciding on a destination can be overwhelming. Recommenders aid their users in the decision-making process by providing a list of locations likely to be relevant to the user's needs and interests. Traditional collaborative filtering algorithms consider relationships between users and locations, finding users to be similar only if their location histories overlap. However, the availability of spatial, temporal, and social information in an LBSN offers an opportunity to improve the quality of a recommendation engine. Social network data allows us to connect users who can directly influence each other's decisions. Temporal data allows us to account for the drifting preferences of users, giving more weight to recent location visits over historical selections, and taking advantages of repetitive behaviors. Spatial information allows us to focus recommendations on locations close to the user, keeping our recommendations relevant as a user travels. We introduce a novel approach to incorporate spatial, temporal, and social context into a traditional collaborative filtering algorithm. We evaluate our method on data sets collected from three LBSNs, and demonstrate that our approach is at the least competitive with existing state-of-the-art location recommenders.
Accelerating the Cloud with Heterogeneous Computing

Heterogeneous multiprocessors that combine multiple CPUs and GPUs on a single die are posed to become commonplace in the market. As seen recently from the high performance computing community, leveraging a GPU can yield performance increases of several orders of magnitude. We propose using GPU acceleration to greatly speed up cloud management tasks in VMMs. This is only becoming possible now that the GPU is moving on-chip, since the latency across the PCIe bus was too great to make fast, informed decisions about the state of a system at any given point. We explore various examples of cloud management tasks that can greatly benefit from GPU acceleration. We also tackle tough questions of how to manage this hardware in a multi-tenant system. Finally, we present a case study that explores a common cloud operation, memory deduplication, and show that GPU acceleration can improve the performance of its hashing component by a factor of over 80.