Miracle-dz/UniFAR-FTUs huggingface dataset:
Low Cognitive Load and Reduced Arousal Impede Practice Effects on Executive Functioning, Metacognitive Confidence and Decision Making

The present study investigated the effects of low cognitive workload and the absence of arousal induced via external physical stimulation (motion) on practice-related improvements in executive (inhibitory) control, short-term memory, metacognitive monitoring and decision making. A total of 70 office workers performed low and moderately engaging passenger tasks in two successive 20-minute simulated drives and repeated a battery of decision making and inhibitory control tests three times – before, between and after these drives. For half the participants, visual simulation was synchronised with (moderately arousing) motion generated through LAnd Motion Platform, with vibration levels corresponding to a well-maintained unsealed road. The other half performed the same simulated drive without motion. Participants’ performance significantly improved over the three test blocks, which is indicative of typical practice effects. The magnitude of these improvements was the highest when both motion and moderate cognitive load were present. The same effects declined either in the absence of motion (low arousal) or following a low cognitive workload task, thus suggesting two distinct pathways through which practice-related improvements in cognitive performance may be hampered. Practice, however, degraded certain aspects of metacognitive performance, as participants became less likely to detect incorrect decisions in the decision-making test with each subsequent test block. Implications include consideration of low cognitive load and arousal as factors responsible for performance decline and targets for the development of interventions/strategies in low load/arousal conditions such as autonomous vehicle operations and highway driving.
Capturing the Attitudes of Adolescent Males’ Towards Computerised Mental Health Help‐Seeking

Objective Adolescent males are often reluctant to seek help for mental health problems. Computerised psychological treatment may be a more appealing method of psychological intervention for this population because it minimises many of the barriers to traditional treatment. However, it is not clear if current computerised mental health treatment programs both attract and engage adolescent males with anxiety disorders. A qualitative methodology was utilised to investigate adolescent males’ attitudes to computerised mental health intervention generally and more specifically, computerised anxiety treatment programs. Method The views of 29 adolescent males, both with and without experience of clinical anxiety symptoms, were elicited using semi‐structured interviews and focus groups. Verbatim transcripts were analysed using content analysis. Results The major themes identified related to computerised help‐seeking involving “risk,” “effort” and “the need for a human connection. ” Conclusion The results of the study suggest that a number of barriers exist in relation to adolescent males utilising computerised mental health interventions, such as unfamiliarity with this form of help, perceived control over decision‐making, effort involved and concerns around confidentiality. However, the findings also suggest that an increased awareness of computerised mental health help‐seeking, facilitated through schools, parents or social media, also has the potential to increase formal help‐seeking in this population.
A public-key cryptography and a entity authentication scheme based on improved hyperbolic function

Cryptography is the fundamental of secure communication. A public key cryptosystem is necessary to realize secure and efficient communication on public network. To construct a public key cryptosystem, it is essential to find a one-way trap-door function. In this paper, we propose a new one-way trap-door function, and present corresponding encryptosystem and entity authentication scheme. Meanwhile, it is proven that our algorithm and schemes are feasible, secure and efficient. Compared with recent algorithm such as RSA or ElGamal systems, our algorithm is more secure under the condition of the nearly similar efficiency.
Peripheral Sensory Neurons Expressing Melanopsin Respond to Light

The ability of light to cause pain is paradoxical. The retina detects light but is devoid of nociceptors while the trigeminal sensory ganglia (TG) contain nociceptors but not photoreceptors. Melanopsin-expressing intrinsically photosensitive retinal ganglion cells (ipRGCs) are thought to mediate light-induced pain but recent evidence raises the possibility of an alternative light responsive pathway independent of the retina and optic nerve. Here, we show that melanopsin is expressed in both human and mouse TG neurons. In mice, they represent 3% of small TG neurons that are preferentially localized in the ophthalmic branch of the trigeminal nerve and are likely nociceptive C fibers and high-threshold mechanoreceptor Aδ fibers based on a strong size-function association. These isolated neurons respond to blue light stimuli with a delayed onset and sustained firing, similar to the melanopsin-dependent intrinsic photosensitivity observed in ipRGCs. Mice with severe bilateral optic nerve crush exhibit no light-induced responses including behavioral light aversion until treated with nitroglycerin, an inducer of migraine in people and migraine-like symptoms in mice. With nitroglycerin, these same mice with optic nerve crush exhibit significant light aversion. Furthermore, this retained light aversion remains dependent on melanopsin-expressing neurons. Our results demonstrate a novel light-responsive neural function independent of the optic nerve that may originate in the peripheral nervous system to provide the first direct mechanism for an alternative light detection pathway that influences motivated behavior.
Usefulness of training using animal models for colorectal endoscopic submucosal dissection: is experience performing gastric ESD really needed?

Background and study aims: Despite the clinical advantages of colorectal endoscopic submucosal dissection (ESD), an effective training system, especially for Western endoscopists, has been challenging to establish. Herein, we propose a novel training program using ex vivo animal models and evaluate the learning curve of colorectal ESD trainees without gastric ESD experience. Patients and methods: A total of 80 colorectal lesions were prospectively collected and removed by two novice operators. Before human ESD procedures, they received ESD training using an ex vivo porcine “proximal colon” model, which simulates a lumen with many folds and flexions. To assess the validity of our training system, the self-completion and en bloc R0 resection rates, the operation time, and prevalence of complications were compared between the first and latter period. Moreover the factors associated with prolonged operation time were evaluated. Results: The overall rates of self-completion and en bloc R0 resection were 98 % (78/80) and 100 % (80/80), respectively. The operation time during the first period was significantly longer than that during the latter period (86 ± 50 minutes vs. 60 ± 36 minutes, P = 0.01). Regarding complications, only two cases of perforations and delayed hemorrhage were observed during the first period; however, all of the complications were successfully managed endoscopically. The presence of fibrosis was identified as a significant independent predictor of a prolonged operation time during the first period (coefficient, 5.90; 95 %CI, 2.36 – 9.44, P = 0.002). Conclusions: Our trainees achieved high rates of self-completion and R0 resection without severe complications even during the first 20 cases, suggesting that our training programs using ex vivo animal models are useful for trainees without gastric ESD experience. Study registration: UMIN000013566
KEAMANAN RUMAH MENGGUNAKAN SENSOR PIR DAN MODUL GSM ARDUINO

Rumah merupakan salah satu kebutuhan pokok dalam kehidupan manusia. Sebuah rumah harus menyediakan rasa aman bagi pemiliknya. Sistem keamanan rumah yang ada selama ini, masih kurang sempurna, hal itu bisa dilihat dari banyaknya tindak kejahatan kejahatan pencurian dan perampokan. Oleh karena itu, untuk, meminimalisir tindak kejahatan tersebut, ditemukan suatu sistem keamanan rumah berbasis Mikrokontroller Arduino Uno, Sensor Pir, dan komponen pendukung lainnya seperti, Modul bluetooth, buzzer, modul gsm, led, motor servo dan buzzer sebagai output, sistem tersebut akan mengeluarkan output bunyi buzzer, dan led akan menyala secara otomatis ketika terdeteksi adanya gerakan di dalam rumah, serta sistem tersebut akan dilengkapi juga layanan sms sebagai alat pemberitahuan kepada pemilik rumah.
Stochastic Determination of the Intrinsic Structure in Bayesian Factor Analysis

The study of factor analytic models often has to address two important issues: (a) the determination of the ”optimum” number of factors and (b) the derivation of a unique simple structure whose interpretation is easy and straightforward. The classical approach deals with these two tasks separately, and sometimes resorts to ad-hoc methods. This paper proposes a Bayesian approach to these two important issues, and adapts ideas from stochastic geometry and Bayesian finite mixture modelling to construct an ergodic Markov chain having the posterior distribution of the complete collection of parameters (including the number of factors) as its equilibrium distribution. The proposed method uses an Automatic Relevance Determination (ARD) prior as the device of achieving the desired simple structure. A Gibbs sampler updating scheme is then combined with the simulation of a continuous-time birth-and-death point process to produce a sampling scheme that efficiently explores the posterior distribution of interest. The MCMC sample path obtained from the simulated posterior then provides a flexible ingredient for most of the inferential tasks of interest. Illustrations on both artificial and real tasks are provided, while major difficulties and challenges are discussed, along with ideas for future improvements.
Cross-component Clustering for Template Induction

We suggest an unsupervised approach to template induction for information extraction, through detecting sub-topics and themes that cut across the documents of a topical corpus. We introduce a new method  cross component clustering  that simultaneously clusters the components forming our setting, each of which consists of the words of a single article. Our algorithm is derived from the Information Bottleneck clustering algorithm. The resulting clusters are found to be in systematic correspondence with sets of terms that are used in filling the slots of the MUC3/4 ready-made template, which was used for evaluation.
Poisson approximations for functionals of random trees

We use Poisson approximation techniques for sums of indicator random variables to derive explicit error bounds and central limit theorems for several functionals of random trees. In particular, we consider (i) the number of comparisons for successful and unsuccessful search in a binary search tree and (ii) internode distances in increasing trees. The Poisson approximation setting is shown to be a natural and fairly simple framework for deriving asymptotic results.
SimTensor: A synthetic tensor data generator

SimTensor is a multi-platform, open-source software for generating artificial tensor data (either with CP/PARAFAC or Tucker structure) for reproducible research on tensor factorization algorithms. SimTensor is a stand-alone application based on MATALB. It provides a wide range of facilities for generating tensor data with various configurations. It comes with a user-friendly graphical user interface, which enables the user to generate tensors with complicated settings in an easy way. It also has this facility to export generated data to universal formats such as CSV and HDF5, which can be imported via a wide range of programming languages (C, C++, Java, R, Fortran, MATLAB, Perl, Python, and many more). The most innovative part of SimTensor is this that can generate temporal tensors with periodic waves, seasonal effects and streaming structure. it can apply constraints such as non-negativity and different kinds of sparsity to the data. SimTensor also provides this facility to simulate different kinds of change-points and inject various types of anomalies. The source code and binary versions of SimTensor is available for download in this http URL.
A distributed approach to consistent order delivery of concurrent events in asynchronous DVEs

In large-scale asynchronous distributed virtual environments(DVEs), one of the difficult problems is to deliver the concurrent events in a consistent order at each node. Generally, the previous consistency control approaches can be classified into two categories: causal order and time stamped order. However, causal order approaches can merely preserve the cause-effect relation of events and time stamped order approaches seem intrinsically complex to be used in serverless large-scale asynchronous DVEs. In this paper, we proposed a novel distributed algorithm to identify the concurrent events and preserve the consistent order delivery of them at different nodes. Simulation studies are also carried out to compare the performance of this algorithm with that of the previous ones. The results show that the new algorithm can effectively deliver the concurrent events in consistent order at each node and is more efficient than the previous algorithms in large-scale asynchronous DVEs.
A 3.5GHz Low Power Programmable Transversal Filter RFIC Implemented in 47GHz SiGe Technology

This paper presents the design of a low power 3.5GHz analog programmable filter RFIC. The RF filter is a 7-tap transversal equalizer with cascaded Cherry-Hooper amplifiers for delay stages and Gilbert variable gain amplifier as tap weights. The delay stage using active devices greatly reduces the die area comparing to passive delay lines. The SiGe programmable filter RFIC consumes 250mW under 3.3V supply and occupies total 2.16mm2 die size
The architecture of CoralReef: an Internet traffic monitoring software suite

The volume and complexity of traffic on the Internet is increasing rapidly, making it both more difficult and more important to understand. To this end we have created the CoralReef passive traffic monitoring suite, which can be used by network users, administrators, and researchers to measure and analyze network traffic. In this paper, we will present the CoralReef design philosophy, overall architecture, and capabilities. The CoralReef architecture is organized primarily into two “stacks” of software components, as shown in Figure 1, plus a few other small utility components. The raw traffic stack deals directly with individual PDUs (packets or cells) read from a network traffic stream, and the flows stack deals with traffic data that have been aggregated into “flow intervals”. Each component of a stack builds upon the components beneath it. Any level of either stack may serve as a base upon which users may build their own software. The API provides many features to perform the most commonly needed operations, and many programming hooks to allow the programmer to customize the behavior of the library at any level. Except for the hardware-specific drivers, all of the software components are portable to most POSIX systems. The core of the the raw traffic stack is the libcoral C library. In order to allow programmers to write a single application to access many types of data sources, libcoral provides a consistent API for capturing traffic from specialized ATM and POS capture cards from multiple vendors, as well as from pcap interfaces, while hiding the details of the hardware and drivers from users who do not need or want to see them. The same API is used to read packet capture files in any Coral format (including NLANR formats), pcap, and DAG [1] ATM and POS formats. All of these data sources appear the same to the user, and can even be read simultaneously. The libcoral API can operate on ATM cells, blocks of cells, or link layer packets, one at a time or via callbacks; the application developer can use whichever is most convenient. To facilitate rapid prototyping and development, another design goal is to provide the same API in C, C++, and Perl. Because the Perl module CRL.pm directly calls the C routines, Perl scripts using CRL.pm perform well enough for many practical applica-
BTrace: Path Optimization for Debugging

We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we nd a shortest path through the program's control ow graph that touches the maximum number of these nodes. Control ow graphs over-approximate real program behavior; by adding data ow analysis to the control ow graph, we narrow down on the program's actual behavior and discard paths deemed infeasible by the data ow analysis. We derive an e cient algorithm for path optimization based on weighted pushdown systems. We present an application for path optimization by integrating it with the Cooperative Bug Isolation Project (CBI ), a dynamic debugging system. CBI mines instrumentation feedback data to nd suspect program behaviors, called bug predictors, that are strongly associated with program failure. Instantiating critical nodes as the nodes containing bug predictors, we solve for a shortest program path that touches these predictors. This path can be used by a programmer to debug his software. We present some early experience on using this hybrid static/dynamic system for debugging.
Assessing technical debt by identifying design flaws in software systems

Tough time-to-market constraints and unanticipated integration or evolution issues lead to design tradeoffs that usually cause flaws in the structure of a software system. Thus, maintenance costs grow significantly. The impact of these design decisions, which provide short-term benefits at the expense of the system's design integrity, is usually referred to as technical debt. In this paper, I propose a novel framework for assessing technical debt using a technique for detecting design flaws, i.e., specific violations of well-established design principles and rules. To make the framework comprehensive and balanced, it is built on top of a set of metrics-based detection rules for well-known design flaws that cover all of the major aspects of design such as coupling, complexity, and encapsulation. I demonstrate the effectiveness of the framework by assessing the evolution of technical debt symptoms over a total of 63 releases of two popular Eclipse® projects. The case study shows how the framework can detect debt symptoms and past refactoring actions. The experiment also reveals that in the absence of such a framework, restructuring actions are not always coherent and systematic, not even when performed by very experienced developers.
Spectral properties of neuronal pulse interval modulation

We determine the power spectrum of an ideal neuron which encodes information using a pulse interval modulation scheme in continuous time. We develop this by considering the rigorous derivation of the Digital Pulse Interval Modulation (DPIM) coding scheme spectra of L. Vangelista et al. in the limit of the coding slot size approaching zero. We show in this limit the spectrum is identical to that of a filtered renewal process frequently used to model neuroscience time series data. Using this renewal theory equivalence we then use the `Fundamental Isometry Theorem' developed by Win & Ridolfi to show that introducing firing time jitter (as a simple model for noise effects) removes non-Poisson structure and reduces the utility of spectral feature selection. Lastly we show with sufficient jittering that the Bartlett spectrum of any renewal process reduces to that of a Poisson process, with a spectral density consistent with Carson's theorem for shot noise.
Design and implementation of block cipher in hummingbird algorithm over FPGA

The Hummingbird algorithm is applied in secure systems like RFID tags, wireless sensor nodes and smart integrated circuits. Hummingbird is a lightweight algorithm which consists of block cipher of 256-bit key and encrypts a 16bit data in one operation. In this paper, a block cipher for hummingbird algorithm is designed and implemented over Spartan-2 FPGA. The encryption and decryption unit are designed separately and finally, it is observed that the decrypted result perfectly matches with main data. The proposed architecture is planned to keep compact so that rest of reconfigurable areas of FPGA can be efficiently used for other purposes. As compactness is necessary for systems embedded with cryptography part, we expect that the proposed design can show technical usefulness.
Simple Timing for Probabilistic Multiparty Dialogue Management

We present ongoing work in multi-modal, multi-user dialogue management. We have developed a dialogue manager that can handle multiple human users for a game master robot and can simultaneously perceive its environment and perform actions. In this paper, we compare two different systems with a single user, one with this baseline functionality, and a timing-proactive system that can perform actions that we consider to be important to timing when designing dialogue systems. We explain our model and the task, and evaluate the two systems using an overhearer evaluation. We found that it is not enough to have timing-sensitive behaviour if language understanding and production are not perceived as natural.
An evader-centric strategy against fast pursuer in an unknown environment with static obstacles

In this paper, we consider a pursuit-evasion game problem in a geometric setting, where a single pursuer and single evader are in motion with conflicting interests. The pursuer follows a recently introduced angular acceleration guidance law to catch the evader and the evader-centric strategy is supposed to keep the evader away from the pursuer for maximum possible time in an unknown environment having static obstacles. An evader-centric approach is proposed in the present paper that uses linear extrapolation to predict the future move of the evader and define its own strategy. The well-known tangent bug algorithm is employed to deal with static obstacles. Effectiveness of the proposed evader's strategy has been analyzed in terms of interception time and distance travelled by the players. Simulation results demonstrate effectiveness and efficiency of the proposed method.
Proximity Motion Detection Using 802.11 for Mobile Devices

The market for 802.11 based wireless LAN technology has matured greatly in recent years and it is now being used in homes, offices, cafes, airports, and even in hot spots in urban areas. Each 802.11 frame transmitted from 802.11 equipped devices contains information on signal strength and noise. By measuring the signal strength information included in frames sent from a fixed node to a mobile node, it is possible to approximate the distance between the fixed and mobile node. However, as many research papers pointed out, positioning based on received signal strength is difficult, since 802.11 is very susceptible to the effects of various factors, such as reflection or attenuation of the signals. In this paper, we take into account these behavioral characteristics of 802.11 and propose a different approach, where instead of trying to estimate the exact location of a mobile node, we only try to detect incoming movement or access within a given proximity range. Since most recent mobile devices available in the market incorporate or have the capability to add-on 802.11 technologies, mobile users can utilize motion sensing applications without relying on other technologies such as RF-tags or infrared.