Miracle-dz/UniFAR-FTUs huggingface dataset:
Arts therapies students’ scores in profession-related variables: Quantitative results of a longitudinal study

This longitudinal study investigated arts therapies students’ (N = 51) scores in the following variables: career commitment, professional identity, need for occupational and training information, and perceived environmental and personal barriers to career decision-making. Key results suggest that students’ professional identity and career commitment significantly increased during training. Scores of dance movement therapy students, followed by art therapy students, were overall significantly higher than scores of drama therapy students. Students’ need for occupational and training information as well as perceived environmental and personal barriers to career decision-making decreased. Policy and practice implications are suggested and recommendations for further research on this topic are offered.
How do Students Organize Personal Information Spaces?

The purpose of this study is to empirically reveal strategies of students' organization of learning-related digital materials within an online personal information archive. Research population included 518 students who utilized the personal Web space allocated to them on the university servers for archiving information items, and data describing their directory hierarchies. Several variables for measuring folders size and depth were defined, and four of them were chosen as best representing different aspects of the user's archive structure. Then, as a result of cluster analysis of the students, four organization strategies emerged, refining the classical piling/filing classification: piling, one-folder filing, small-folders filing, and big-folder filing. Also, associations were found between the organization strategies and archive size, students' studies degree. A discussion of this study and further research is provided.
Algorithms for Linear Bandits on Polyhedral Sets

We study stochastic linear optimization problem with bandit feedback. The set of arms take values in an $N$-dimensional space and belong to a bounded polyhedron described by finitely many linear inequalities. We provide a lower bound for the expected regret that scales as $\Omega(N\log T)$. We then provide a nearly optimal algorithm and show that its expected regret scales as $O(N\log^{1+\epsilon}(T))$ for an arbitrary small $\epsilon >0$. The algorithm alternates between exploration and exploitation intervals sequentially where deterministic set of arms are played in the exploration intervals and greedily selected arm is played in the exploitation intervals. We also develop an algorithm that achieves the optimal regret when sub-Gaussianity parameter of the noise term is known. Our key insight is that for a polyhedron the optimal arm is robust to small perturbations in the reward function. Consequently, a greedily selected arm is guaranteed to be optimal when the estimation error falls below some suitable threshold. Our solution resolves a question posed by Rusmevichientong and Tsitsiklis (2011) that left open the possibility of efficient algorithms with asymptotic logarithmic regret bounds. We also show that the regret upper bounds hold with probability $1$. Our numerical investigations show that while theoretical results are asymptotic the performance of our algorithms compares favorably to state-of-the-art algorithms in finite time as well.
Fast and robust rotation invariant object detection with Joint Color Channel and Hierarchical Binary Pattern

In this paper, we propose a method for fast and robust rotation invariant object detection using Joint Color Channel (JCC) and Hierarchical Binary Pattern (HBP) to be used as the classifier in well-known cascade AdaBoost. The cascade structure is efficiently designed according to the attribute of the features for fast object detection. To evaluate our proposed method, we use a drum dataset collected in the real industrial environment. Drums have a variety of colors and textures depending on their type and have pose variations when they are tilted by humans. The experimental results on the real images show the applicability and high efficiency of the proposed method.
Invalidation Clues for Database Scalability Services

For their scalability needs, data-intensive Web applications can use a database scalability service (DBSS), which caches applications' query results and answers queries on their behalf. One way for applications to address their security/privacy concerns when using a DBSS is to encrypt all data that passes through the DBSS. Doing so, however, causes the DBSS to invalidate large regions of its cache when data updates occur. To invalidate more precisely, the DBSS needs help in order to know which results to invalidate; such help inevitably reveals some properties about the data. In this paper, we present invalidation clues, a general technique that enables applications to reveal little data to the DBSS, yet limit the number of unnecessary invalidations. Compared with previous approaches, invalidation clues provide applications significantly improved tradeoffs between security/privacy and scalability. Our experiments using three Web application benchmarks, on a prototype DBSS we have built, confirm that invalidation clues are indeed a low-overhead, effective, and general technique for applications to balance their privacy and scalability needs.
Lowering Error Floor of Irregular LDPC Codes by CRC and OSD Algorithm

Irregular Low-Density Parity-Check (LDPC) codes generally achieve better performance than regular LDPC codes at low E b /N 0 values. They have, however, higher error floors than regular LDPC codes. With respect to the construction of the irregular LDPC code, it can achieve the trade-off between the performance degradation of low E b /N 0 region and lowering error floor. It is known that a decoding algorithm can achieve very good performance if it combines the Ordered Statistic Decoding (OSD) algorithm and the Log Likelihood Ratio-Belief Propagation (LLR-BP) decoding algorithm. Unfortunately, all the codewords obtained by the OSD algorithm satisfy the parity check equation of the LDPC code. While we can not use the parity check equation of the LDPC code to stop the decoding process, the wrong codeword that satisfies the parity check equation raises the error floor. Once a codeword that satisfies the parity check equation is generated by the LLR-BP decoding algorithm, we regard that codeword as the final estimate and halt decoding; the OSD algorithm is not performed. In this paper, we propose a new encoding/decoding scheme to lower the error floor created by irregular LDPC codes. The proposed encoding scheme encodes information bits by Cyclic Redundancy Check (CRC) and LDPC code. The proposed decoding scheme, which consists of the LLR-BP decoding, CRC check, and OSD decoding, detects errors in the codewords obtained by the LLR-BP decoding algorithm and the OSD decoding algorithm using the parity check equations of LDPC codes and CRC. Computer simulations show that the proposed encoding/decoding scheme can lower the error floor of irregular LDPC codes.
Design of class-E power amplifier with nonlinear components by using extended impedance method

It has been shown in the previous study that the class-E power amplifier (PA) circuit can be efficiently simulated and optimized in the frequency domain by modeling the whole circuit with the extended impedance method (EIM). This paper reports a breakthrough in the EIM based class-E PA design by taking the nonlinear components into consideration. In analysis, the effect of the two state-dependent nonlinear components in a practical MOSFET switch, i.e., the parasitic drain-to-source junction capacitance and the body diode, is turned into the time-dependent characteristics by carrying out the states-to-time mapping. Iterative computation is necessary for obtaining the steady-state waveforms in view of the nonlinear components. Yet, given the high efficiency of EIM, it is proved that the EIM based optimization runs much faster than the state-of-the-art numerical class-E PA optimization.
The Mouse Cytosine-5 RNA Methyltransferase NSun2 Is a Component of the Chromatoid Body and Required for Testis Differentiation

ABSTRACT Posttranscriptional regulatory mechanisms are crucial for protein synthesis during spermatogenesis and are often organized by the chromatoid body. Here, we identify the RNA methyltransferase NSun2 as a novel component of the chromatoid body and, further, show that NSun2 is essential for germ cell differentiation in the mouse testis. In NSun2-depleted testes, genes encoding Ddx4, Miwi, and Tudor domain-containing (Tdr) proteins are repressed, indicating that RNA-processing and posttranscriptional pathways are impaired. Loss of NSun2 specifically blocked meiotic progression of germ cells into the pachytene stage, as spermatogonial and Sertoli cells were unaffected in knockout mice. We observed the same phenotype when we simultaneously deleted NSun2 and Dnmt2, the only other cytosine-5 RNA methyltransferase characterized to date, indicating that Dnmt2 was not functionally redundant with NSun2 in spermatogonial stem cells or Sertoli cells. Specific NSun2- and Dnmt2-methylated tRNAs decreased in abundance when both methyltransferases were deleted, suggesting that RNA methylation pathways play an essential role in male germ cell differentiation.
Ebbs and flows of negative campaigning: A longitudinal study of the influence of contextual factors on Danish campaign rhetoric

This article investigates the level of negative campaigning in Danish national election campaigns from 1971 and onwards. The ambition of the article is two-fold. First, it empirically debugs the widespread myth that campaign rhetoric is becoming more and more negative over the years. Second, it theoretically advances the understanding of the determinants of negative campaigning by studying a range of contextual factors that affect the general level of negativity of campaigns. It is thus shown that campaigns get more negative as the number of running parties increases, as the ideological span in the party system widens, and as the degree of political conflict at the time of the election grows.
A generalized eigenvalue decomposition processor for multi-user MIMO precoding

Due to the growing demand of data rate and reliability in multi-user wireless applications, multiple-user multiple-input multiple-output (MU-MIMO) precoding schemes are developed to avoid the growing interferences among users. The leakage-based precoding algorithm is a key processing technique that can achieve a higher signal-to-interference noise ratio (SINR) in the MU-MIMO system. The leakage-based precoding scheme requires the generalized eigenvalue decomposition (GEVD) processing to obtain the optimal MIMO precoding matrix for each user based on various constraints. Therefore, this paper presents a GEVD processor for the leakage-based multi-user MIMO precoding. A triangular matrix inversion with block-wise multiplications (TMI-BM) algorithm was proposed to avoid the massive matrix inversions in the original GEVD. The GEVD processor was designed and implemented using a 40μm CMOS technology. The proposed GEVD processor achieves 0.46 Matrices/sec.
Hybrid technique for simulating high bandwidth delay computer networks

Researchers evaluate and contrast new network routing, admission control, congestion control and flow control algorithms through simulation. Analytically de-rived arguments justifiably lack credibility because, in the attempt to model the underlying physical system, the analyst is forced to make compromising approximations. However, unlike analytical techniques like Jackson Queueing Networks, simulations require significant computation and a simulation's state can consume a great deal of memory.This paper describes a technique that we developed to reduce the memory consumption of communication network simulators. Reduced memory makes simulations of larger and higher bandwidth-delay networks possible, but introduces an adjustable degree of approximation in the simulation. The higher the memory savings, the less accurate the computed measures. We call our technique Flowsim. The paper motivates the need to simulate computer networks rather than model them analytically, motivates why a simulator's state can grow quickly, and explains why analytical techniques have failed to model modern communication networks.
A simple model of stress, burnout and symptomatology in medical residents: A longitudinal study

A simple model of work stressors, perceived stress, burnout, affect, general health and clinical competence was tested in 46 internal medicine and surgical residents across the course of one year of residency training. As predicted by the model, increased perceptions of stress were associated with increased levels of both job- and patient-related burnout later in the residency year. This pattern was especially pronounced in male residents. Furthermore, increased levels of patient-related burnout were associated with greater mood disturbance, as well as poorer general health, while higher levels of job-related burnout were found among those individuals with the lowest ratings of clinical competency at the end of the residency year. Despite self-reported decreases in hours worked across the year, and increases in reported sleep, depression was found to increase in this group of residents. The results of the present study suggest that interventions designed to assess and address perceived stress, health, mood and level of burnout may be most effective in alleviating the professional and personal difficulties often associated with medical residency.
Reference intervals for serum testosterone, SHBG, LH and FSH in males from the NORIP project

Abstract Reference intervals were calculated for male testosterone, SHBG, FSH and LH in serum from 599 individuals in the NORIP study. At 30 years of age, reference limits were calculated to 10.4–32.6 nmol/L testosterone, 13.5–57.4 nmol/L SHBG, 1.93–9.7 IU/L LH and 1.5–10.3 IU/L FSH, at 50 years, 9.3–31.3 nmol/L (testosterone), 18.4–75.6 nmol/L (SHBG), 2.01–10.4 IU/L (LH) and 2.04–12.4 IU/L (FSH), and at 70 years 8.6 to 30.7 nmol/L (testosterone), 27.8–101 nmol/L (SHBG), 2.22–11.2 IU/L (LH) and 2.71–14.2 IU/L (FSH). All age-+related changes were statistically significant. Reference intervals were also calculated for indices derived from testosterone, SHBG and albumin. Free androgen index, simply the ratio between testosterone and SHBG, returned results differing from the other elaborate indices, and the study thus favors use of a more elaborate index such as calculated free testosterone (CFT).
Return-Oriented Programming

Attackers able to compromise the memory of a target machine can change its behavior and usually gain complete control over it. Despite the ingenious prevention and protection mechanisms that have been implemented in modern operating systems, memory corruption attacks still account for a big share of the security breaches afflicting software systems. This article describes a growing attack trend that uses return-oriented programming (ROP) techniques to bypass the most common memory protection systems.
Changing family structures and childhood socialisation: a study of leisure consumption

Abstract How children learn to function as consumers has been extensively reviewed in the consumer and marketing literature, although early childhood (5 to 7 years of age) has received relatively limited attention to-date. This study examines this process specifically in relation to the role of socialisation agents. It questions whether parents/guardians, who have traditionally been acknowledged as the primary socialisation agents, retain this influence in an era of changing family structures. Leisure-travel provides the context for review with children aged 5–7 the research population. Findings confirm parental influence to be pivotal across different family structures, but note that, in some structures and circumstances, this influence is shared, particularly with grandparents and the leisure industry. Future research opportunities include the need to examine this shared role further, to investigate leisure industry awareness and response to their influence and to investigate further the implications of social class and ethnicity upon the findings.
Memory-efficient parallel tensor decompositions

Tensor decompositions are a powerful technique for enabling comprehensive and complete analysis of real-world data. Data analysis through tensor decompositions involves intensive computations over large-scale irregular sparse data. Optimizing the execution of such data intensive computations is key to reducing the time-to-solution (or response time) in real-world data analysis applications. As high-performance computing (HPC) systems are increasingly used for data analysis applications, it is becoming increasingly important to optimize sparse tensor computations and execute them efficiently on modern and advanced HPC systems. In addition to utilizing the large processing capability of HPC systems, it is crucial to improve memory performance (memory usage, communication, synchronization, memory reuse, and data locality) in HPC systems. In this paper, we present multiple optimizations that are targeted towards faster and memory-efficient execution of large-scale tensor analysis on HPC systems. We demonstrate that our techniques achieve reduction in memory usage and execution time of tensor decomposition methods when they are applied on multiple datasets of varied size and structure from different application domains. We achieve up to 11× reduction in memory usage and up to 7× improvement in performance. More importantly, we enable the application of large tensor decompositions on some important datasets on a multi-core system that would not have been feasible without our optimization.
Link stability and route lifetime in ad-hoc wireless networks

Many routing algorithms, proposed for ad-hoc wireless networks, are based on source routing scheme. When a route is broken in source routing, route recovery and maintenance procedures are executed. However these procedures consume many resources. To minimize route breaking, it important to find a route that endures longer time. Shortest path route has short lifetime especially in highly dense ad-hoc wireless networks, and it due to the edge effect discovered in this paper Some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper, we will focus on the link stability and the lifetime of a route, and propose link stability comparison models for previously proposed routing algorithms. We will show properties of these models and compare them with local optimal algorithm that finds longest lifetime route at a given time. Finally, we will propose an enhanced link stability estimation model to find a route with longer lifetime.
Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality

The centrality-lethality rule, which notes that high-degree nodes in a protein interaction network tend to correspond to proteins that are essential, suggests that the topological prominence of a protein in a protein interaction network may be a good predictor of its biological importance. Even though the correlation between degree and essentiality was confirmed by many independent studies, the reason for this correlation remains illusive. Several hypotheses about putative connections between essentiality of hubs and the topology of protein–protein interaction networks have been proposed, but as we demonstrate, these explanations are not supported by the properties of protein interaction networks. To identify the main topological determinant of essentiality and to provide a biological explanation for the connection between the network topology and essentiality, we performed a rigorous analysis of six variants of the genomewide protein interaction network for Saccharomyces cerevisiae obtained using different techniques. We demonstrated that the majority of hubs are essential due to their involvement in Essential Complex Biological Modules, a group of densely connected proteins with shared biological function that are enriched in essential proteins. Moreover, we rejected two previously proposed explanations for the centrality-lethality rule, one relating the essentiality of hubs to their role in the overall network connectivity and another relying on the recently published essential protein interactions model.
The Results of Sulfur Print Image Classification of Section Images

The article deals with mathematical and algorithmic support for sulfur prints image classification based on fuzzy sets and rules of accessories using peer inspections. In the study of the causes of unambiguous classification the authors have introduced codomains of membership function form: single classification, empty set, complete absorption and unambiguous classification. The article conceived the concept of equilibrium and nonequilibrium membership functions. The results showed unambiguous classification of 100% images. The research was carried out in 2011–2015. The proposed technique is applicable to the classification of static images to assess the structure of materials using combined methods.
Complete sequence and gene organization of the mitochondrial genome of Podocnemis unifilis (Pleurodira: Podocnemididae)

Abstract The mitochondrial genome of Podocnemis unifilis (Pleurodira: Podocnemididae) is 16,493 bp in length, which contains 13 protein-coding genes, 2 ribosomal RNAs, 22 transfer RNAs, and a control region. The A+T content of the overall base composition of H-strand is 61.7% (T: 27.7%, C: 25.5%, A: 34.0%, G: 12.8%). ATP6, ATP8, CO3, ND4-6 and Cyt b genes begin with ATG as start codon, ND1, ND2 and ND4L begin with ATT, CO1 starts with GTG, CO2 starts with ATA, ND3 starts with ATC. ATP6, CO2, ND4L and ND5 genes are terminated with TAA as stop codon, ND1, ND2, ND3, ND6 and CO1 end with TAG, and the other four protein-coding genes end with an incomplete stop codon (a single stop nucleotide T or TA). A long unit repeat region is found in the control region.
Validation of selecting SP-values for fault models under proposed RASP-FIT tool

SRAM-based FPGA covers nearly 60% of the applications, also susceptible to Single Event Upsets (SEUs) due to radiation. Therefore, FPGA-based systems need to be tested and verified. The testing and dependability analysis techniques are most widely used, with fault injection techniques. These approaches are developed in RASP-Fault Injection Tool. These approaches require the deliberate introduction of faults in the target system. In test approach, it is mandatory to obtain minimum test vectors which detect maximum faults. There are many fault models used for that purpose, e.g. bit-flip, stuck-at (1 & 0). In the proposed test approach, the condition of set point value (SP-value) is defined for each fault model. Therefore, the only patterns which can detect faults more than SP-value are collected and called them qualified test vectors. Furthermore, these qualified vectors are used to obtain the compact test vectors for the Automatic Test Equipment (ATE). In our previously proposed test method, we have used the concept of the SP-value method to obtain qualified test vector for FPGA-based designs. We have chosen SP-values in the range of 20% to 50% of the total injected faults in the design. However, in this paper, validation of this selection criterion for the SP-value is presented.