Miracle-dz/UniFAR-FTUs huggingface dataset:
Dynamics between playing activities and rest time in high-level men’s volleyball

The purpose of this study was to verify whether work-to-rest ratios in high-level sport exhibit evidence for self-regulation. Specifically, we analysed the relationship between rally length and rest times between rallies in high-level men’s volleyball. Ninety-five matches from five of the premier worldwide competitions were analysed (16,436 rallies). The average of rallies per set was 45.23±6.15 (rally length: 4.99±4.35 seconds; rest time: 29.02±19.44 seconds; work-to-rest ratio 1:5.81±.17 seconds). The distribution of rally length clusters was: short 74%, medium 14.38% and long 11.62%; and rest time clusters: short 81.71%, medium 10.83% and long 7.46%. Rest time between rallies seemed to increase when the rally was longer (τ =.214; p <.001), the set progressed (set period) (τ =.093; p <.001), the game progressed (set number) (τ =.209; p <.001), and when the intensity of the set was higher (set competitive load) (τ =.118; p <.001). Results provided original, detailed and recent evidence supporting self-regulated phenomena with respect to work-to-rest ratio in high-level sport, while also providing time-related volleyball-specific relevant information. The stochastic profile of game was established by self-regulated work-to-rest time ratios, in spite of the deterministic and cyclical characteristics of the game. Clusters of distributions of work-to-rest ratio allow for random series to be designed in order to inform specific training sessions according to the type of match, set number and set period. Moreover, it is suggested that the temporal peculiarities of volleyball promote pacing strategies when the ball is not in play.
Security games with surveillance cost and optimal timing of attack execution

Stackelberg games have been used in several deployed applications to allocate limited resources for critical infrastructure protection. These resource allocation strategies are randomized to prevent a strategic attacker from using surveillance to learn and exploit patterns in the allocation. Past work has typically assumed that the attacker has perfect knowledge of the defender's randomized strategy or can learn the defender's strategy after conducting a fixed period of surveillance. In consideration of surveillance cost, these assumptions are clearly simplistic since attackers may act with partial knowledge of the defender's strategies and may dynamically decide whether to attack or conduct more surveillance. In this paper, we propose a natural model of limited surveillance in which the attacker dynamically determine a place to stop surveillance in consideration of his updated belief based on observed actions and surveillance cost. We show an upper bound on the maximum number of observations the attacker can make and show that the attacker's optimal stopping problem can be formulated as a finite state space MDP. We give mathematical programs to compute optimal attacker and defender strategies. We compare our approaches with the best known previous solutions and experimental results show that the defender can achieve significant improvement in expected utility by taking the attacker's optimal stopping decision into account, validating the motivation of our work.
Forensic Carving of Wireless Network Information from the Android Linux Kernel

v Chapter 1 Introduction 1 1.1 Motivation 1 1.2 Android Operating System 1 1.3 Contributions 2 1.4 Organization 2 Chapter 2 Related Works 4 2.1 Network Structure Carving 4 2.2 Mobile Memory Forensics 5 2.3 Volatile Memory Forensics 7 Chapter 3 Implementation 8 3.1 Methodology 8 3.2 Design 11 3.3 wext_stream_scan plugin 13 3.4 iwe_pull and iwe_carve 15 Chapter 4 Limitations 18 iv 4.1 iw_event streams in memory 18 4.2 Volatility framework 19 4.3 Methodoloy and Testing 20 Chapter 5 Results 22 5.1 Acquiring Viable Memory Capture 22 5.2 Analysis of Memory Captures 23 4.3 Methodoloy and Testing 20 Chapter 6 Conclusion 28 5.1 Wrap-Up 28 5.2 Future Work 28 Appendix A 30 References 32
Ferromagnetic Multilayers: Magnetoresistance, Magnetic Anisotropy, and Beyond

Obtaining highly sensitive ferromagnetic, FM, and nonmagnetic, NM, multilayers with a large room-temperature magnetoresistance, MR, and strong magnetic anisotropy, MA, under a small externally applied magnetic field, H, remains a subject of scientific and technical interest. Recent advances in nanofabrication and characterization techniques have further opened up several new ways through which MR, sensitivity to H, and MA of the FM/NM multilayers could be dramatically improved in miniature devices such as smart spin-valves based biosensors, non-volatile magnetic random access memory, and spin transfer torque nano-oscillators. This review presents in detail the fabrication and characterization of a few representative FM/NM multilayered films—including the nature and origin of MR, mechanism associated with spin-dependent conductivity and artificial generation of MA. In particular, a special attention is given to the Pulsed-current deposition technique and on the potential industrial applications and future prospects. FM multilayers presented in this review are already used in real-life applications such as magnetic sensors in automobile and computer industries. These material are extremely important as they have the capability to efficiently replace presently used magnetic sensors in automobile, electronics, biophysics, and medicine, among many others.
The dual nature of mismatch repair as antimutator and mutator: for better or for worse

DNA is constantly under attack by a number of both exogenous and endogenous agents that challenge its integrity. Among the mechanisms that have evolved to counteract this deleterious action, mismatch repair (MMR) has specialized in removing DNA biosynthetic errors that occur when replicating the genome. Malfunction or inactivation of this system results in an increase in spontaneous mutability and a strong predisposition to tumor development. Besides this key corrective role, MMR proteins are involved in other pathways of DNA metabolism such as mitotic and meiotic recombination and processing of oxidative damage. Surprisingly, MMR is also required for certain mutagenic processes. The mutagenic MMR has beneficial consequences contributing to the generation of a vast repertoire of antibodies through class switch recombination and somatic hypermutation processes. However, this non-canonical mutagenic MMR also has detrimental effects; it promotes repeat expansions associated with neuromuscular and neurodegenerative diseases and may contribute to cancer/disease-related aberrant mutations and translocations. The reaction responsible for replication error correction has been the most thoroughly studied and it is the subject to numerous reviews. This review describes briefly the biochemistry of MMR and focuses primarily on the non-canonical MMR activities described in mammals as well as emerging research implicating interplay of MMR and chromatin.
An Efficient Scheme of Group Signature Based on DSA

A novel signature scheme based on DSA is proposed. When adding group member, parameters transferred between group member and group center were strengthened verified to ensure the information accurate. When deleting group member, modification to public key of group member was restricted to ensure that the deleted member was unable to sign. The parameters in the proposed scheme are less than 160bits which is more efficient than the scheme based on RSA. Analysis shows that the proposed scheme satisfies security properties of the group signature.
Pornography Acceptance and Use Among Emerging Adults

can be found at: Journal of Adolescent Research Additional services and information for http://jar.sagepub. com/cgi/alerts Email Alerts: http://jar.sagepub. com/subscriptions Subscriptions: http://www.sagepub. com/journalsReprints.nav Reprints: http://www.sagepub. com/journalsPermissions.nav Permissions: http://jar.sagepub. com/cgi/content/refs/23/1/6 SAGE Journals Online and HighWire Press platforms): (this article cites 32 articles hosted on the Citations
High-performance cross-language interoperability in a multi-language runtime

Programmers combine different programming languages because it allows them to use the most suitable language for a given problem, to gradually migrate existing projects from one language to another, or to reuse existing source code. However, existing cross-language mechanisms suffer from complex interfaces, insufficient flexibility, or poor performance. We present the TruffleVM, a multi-language runtime that allows composing different language implementations in a seamless way. It reduces the amount of required boiler-plate code to a minimum by allowing programmers to access foreign functions or objects by using the notation of the host language. We compose language implementations that translate source code to an intermediate representation (IR), which is executed on top of a shared runtime system. Language implementations use language-independent messages that the runtime resolves at their first execution by transforming them to efficient foreign-language-specific operations. The TruffleVM avoids conversion or marshaling of foreign objects at the language boundary and allows the dynamic compiler to perform its optimizations across language boundaries, which guarantees high performance. This paper presents an implementation of our ideas based on the Truffle system and its guest language implementations JavaScript, Ruby, and C.
A Bilingual Graph-Based Semantic Model for Statistical Machine Translation

Most existing bilingual embedding methods for Statistical Machine Translation (SMT) suffer from two obvious drawbacks. First, they only focus on simple context such as word count and co-occurrence in document or sliding window to build word embedding, ignoring latent useful information from selected context. Second, word sense but not word form is supposed to be the minimal semantic unit while most existing works are still for word representation. This paper presents Bilingual Graph-based Semantic Model (BGSM) to alleviate such shortcomings. By means of maximum complete sub-graph (clique) for context selection, BGSM is capable of effectively modeling word sense representation instead of the word form itself. The proposed model is applied to phrase pair translation probability estimation and generation for SMT. The empirical results show that BGSM can enhance SMT both in performance (up to +1.3 BLEU) and efficiency in comparison against existing methods.
Repeated exposure to odors induces affective habituation of perception and sniffing

Olfactory perception, and especially hedonic evaluation of odors, is highly flexible, but some mechanisms involved in this flexibility remain to be elucidated. In the present study we aimed at better understanding how repeated exposure to odors can affect their pleasantness. We tested the hypothesis of an affective habituation to the stimuli, namely a decrease of emotional intensity over repetitions. More specifically, we tested whether this effect is subject to inter-individual variability and whether it can also be observed at the olfactomotor level. Twenty-six participants took part in the experiment during which they had to smell two odorants, anise and chocolate, presented 20 times each. On each trial, sniff duration and volume were recorded and paired with ratings of odor pleasantness and intensity. For each smell, we distinguished between “likers” and “dislikers,” namely individuals giving positive and negative initial hedonic evaluations. Results showed a significant decrease in pleasantness with time when the odor was initially pleasant (“likers”), while unpleasantness remained stable or slightly decreased when the odor was initially unpleasant (“dislikers”). This deviation toward neutrality was interpreted as affective habituation. This effect was all the more robust as it was observed for both odors and corroborated by sniffing, an objective measurement of odor pleasantness. Affective habituation to odors can be interpreted as an adaptive response to stimuli that prove over time to be devoid of positive or negative outcome on the organism. This study contributes to a better understanding of how olfactory preferences are shaped through exposure, depending on the individual's own initial perception of the odor.
Transmission characteristics analysis of IR-UWB signal

Due to the huge bandwidth of IR-UWB signal, its inherent frequency dependence characteristics makes the IR propagation undergo pulse distortions which are quite different compared with the narrowband system, especially in NLOS environment. As one of the most remarkable features, the potential easier material penetration properties of IR haven't had comprehensive studies. This paper summarizes the electrical properties of materials in 2∼11GHz which are common used in indoor environments, the IR transmission mechanism though those materials are simulated by using frequency domain method, which taken into account the frequency dependence characteristics of IR signal. The pulse distortion is analyzed under several given conditions. Based on the simulation results, the similarities between the original pulse and receive pulse are compared in correlation receiver, and its influence on the system performance are investigated.
Co-teaching in the college classroom

Abstract This paper serves as a phenomenological reflection about the meaning of a co-teaching experience at the college level for two graduate teaching assistants. When two teachers combine planning and teaching efforts it is called co-teaching. As a pedagogical method for both instructors and students, co-teaching was beneficial because it modeled a collaborative teaching style required of the students in their curricular work. Utilizing the interpretivist discourse of phenomenology, the authors dialog about the meaning each makes of the coursework, the pedagogy, the students, and the teacher effectiveness through a co-teaching model. The dialog and reflection on the phenomenon of co-teaching contributes to more productive co-teaching instruction for pre-service teacher instructors.
Congenial Web search: a conceptual framework for personalized, collaborative, and social peer-to-peer retrieval

Traditional information retrieval methods fail to address the fact that information consumption and production are social activities. Most Web search e ngines do not consider the socialcultural environment of users’ information needs and the co llab ration between users. This dissertation addresses a new search paradigm for Web inform ati n retrieval denoted as Congenial Web Search. It emphasizes personalization, collabo ration, and socialization methods in order to improve effectiveness. The client-server architecture of Web search engines only a llows the consumption of information. A peer-to-peer system architecture has been dev eloped in this research to improve information seeking. Each user is involved in an inter active process to produce metainformation. Based on a personalization strategy on each pee r, the user is supported to give explicit feedback for relevant documents. His information need is expressed by a query that is stored in a Peer Search Memory. On one hand, query-documen t associations are incorporated in a personalized ranking method for repeated informa tion needs. The performance is shown in a known-item retrieval setting. On the other hand, e xplicit feedback of each user is useful to discover collaborative information needs. A new m ethod for a controlled grouping of query terms, links, and users was developed to maintain Vi rtual Knowledge Communities. The quality of this grouping represents the effectiveness o f gr uped terms and links. Both strategies, personalization and collaboration, tackle th e problem of a missing socialization among searchers. Finally, a concept for integrated information seeking was d eveloped. This incorporates an integrated representation to improve effectiveness of infor mation retrieval and information filtering. An integrated information retrieval process explo res a virtual search network of Peer Search Memories in order to accomplish a reputation-based r anking. In addition, the community structure is considered by an integrated informatio n filtering process. Both concepts have been evaluated and shown to have a better performance th an traditional techniques. The methods presented in this dissertation offer the potent ial towards more transparency, and control of Web search.
A Memory-Level Parallelism Aware Fetch Policy for SMT Processors

A thread executing on a simultaneous multithreading (SMT) processor that experiences a long-latency load will eventually stall while holding execution resources. Existing long-latency load aware SMT fetch policies limit the amount of resources allocated by a staffed thread by identifying long-latency loads and preventing the given thread from fetching more instructions - and in some implementations, instructions beyond the long-latency load may even be flushed which frees allocated resources. This paper proposes an SMT fetch policy that hikes into account the available memory-level parallelism (MLP) in a thread. The key idea proposed in this paper is that in case of an isolated long-latency had. i.e. there is no MLP the thread should be prevented from allocating additional resources. However, in case multiple independent long-latency loads overlap, i.e., there is MLP the thread should allocate as many resources as needed in order to fully expose the available MLP. The proposed MLP-aware fetch policy achieves better performance for MLP-intensive threads on an SMT processor and achieves a better overall balance between performance and fairness than previously proposed fetch policies
On the Calculation of Image Moments

Numerous methods for eeective calculation of image moments have been presented up to now. In this paper, we present a new one which is particularly eeective when one wants to calculate moments of more than one image. The major idea is that in the new method a part of calculations does not depend on the object and thus it can be performed only once in advance. The object-dependent part is then realized very quickly. The method works for arbitrary binary 2-D shapes and can be easily extended to n-D case. The MATLAB codes accompany the description of the algorithms.
Prospective study of the airways and pulmonary parenchyma of patients at risk for a second lung cancer.

PURPOSE We conducted our study to compare the number of preneoplastic lesions in the airways and nodules in the pulmonary parenchyma of patients with resected non-small cell lung cancer with the patients whose treatment included chest radiotherapy. EXPERIMENTAL DESIGN Patients were eligible if they had successfully resected stage I and II non-small cell lung cancer or advanced stage non-small cell or small cell lung cancer treated with chest radiotherapy with or without chemotherapy and were free of cancer for >2 years. Patients underwent a history and physical examination, white light and fluorescence bronchoscopy, and computerized tomography of the chest. The airway epithelium was examined for preneoplastic histological changes, and the pulmonary parenchyma was examined for the presence of nodules. RESULTS Twenty-nine patients at risk for lung cancer were studied between 1997 and 1999. Two patients treated with chest radiotherapy had an area of moderate dysplasia (n=1) and carcinoma in situ (n=1), whereas one patient treated with surgical resection alone had an area of mild dysplasia. Six other patients had metaplasia detected in their airway epithelium. Ten of the 13 patients treated with chest radiotherapy had pulmonary nodules compared with 5 of the 13 patients treated with surgical resection alone. CONCLUSIONS Mild dysplasia, moderate dysplasia, severe dysplasia, and carcinoma in situ are unusual in patients with resected lung cancer who have stopped smoking for an extended period of time. Patients with lung cancer treated with chest irradiation may be at higher risk for preneoplastic lesions and pulmonary nodules than patients treated with surgical resection alone, but additional patients will need to be studied.
Receding horizon temporal logic control in dynamic environments

We present a receding horizon method for controlling an autonomous vehicle that must satisfy a rich mission specification over service requests occurring at the regions of a partitioned environment. The overall mission specification consists of a temporal logic statement over a set of static, a priori known requests, a regular expression over a set of dynamic requests that can be sensed only locally, and a servicing priority order over these dynamic requests. Our approach is based on two main steps. First, we construct an abstraction for the motion of the vehicle in the environment by using input–output linearization and assignment of vector fields to the regions in the partition. Second, a receding horizon controller computes local plans within the sensing range of the vehicle such that both local and global mission specifications are satisfied. We implement and evaluate our method through experiments and simulations consisting of a quadrotor performing a persistent surveillance task over a planar grid environment.
Probabilistic Estimation of Peers’ Quality and Behaviors for Subjective Trust Evaluation

The management of trust and quality in decentralized systems has been recognized as a key research area over recent years. In this paper, we propose a probabilistic computational approach to enable a peer in the system to model and estimate the quality and behaviors of the others subjectively according to its own preferences. Our solution is based on the use of graphical models to represent the dependencies among different QoS parameters of a service provided by a peer, the associated contextual factors, the innate behaviors of the reporters and their feedback on quality of the peer being evaluated. We apply the EM algorithm to learn the conditional probabilities of the introduced variables and perform necessary probabilistic inferences on the constructed model to estimate peer's quality and behaviors. Interestingly, our proposed framework can be shown as the generalization of many existing trust computational approaches in the literature with several additional advantages: first, it works well given few and sparse feedback data from the reporting peers; second, it also considers the dependencies among the QoS attributes of a peer, related contextual factors, and underlying behavioral models of reporters to produce more reliable estimations; third, the model gives outputs with well-defined semantics and useful meanings which can be used for many purposes, for example, it computes the probability that a peer is trustworthy in sharing its experiences or in providing a service with high quality level under certain environmental conditions.
Multilingual Information Retrieval Using GHSOM

The Web pages nowadays were written in various languages including English, Chinese, Spanish, etc. There are increasing needs in searching Web pages of different languages using single query. This task is called multilingual information retrieval (MLIR). However, MLIR is difficult to achieve since we need some kind of method to find the associations between linguistic elements of different languages. In this work, we provide a method based on GHSOM to discover the associations between different languages and apply this method on MLIR task. The experiments show that our method provide a promising approach to tackle MLIR task.