Miracle-dz/UniFAR-FTUs huggingface dataset:
Research of predictive control based on OS-LSSVMR

The accuracy of modeling is important for control accuracy and stability in predictive control. So, SVMR (Support Vector Machines Regression), which supports by mathematics theory and has a simple structure and nonlinear modeling properties, compare with other modeling algorithm, such as neural networks, has been applied in the predictive control. Here, OS-LSSVMR, which has good online modeling properties, has been used to model the nonlinear system process based on empirical data in Model Predictive Control, which recede optimization using LM (Levenberg-Marquardt) non-linear least square optimization. The simulation shows that the control algorithm is a good stability and real-time.
A Method for Robustness Improvement of Robot Obstacle Avoidance Algorithm

The robustness of obstacle avoidance algorithm is one of the important factors to successful applications of mobile robot systems. The sonar ring is used widely for autonomous mobile robot obstacle avoidance. This paper first analyzes the robustness of the existing obstacle avoidance algorithms based on sonar ring, indicates that the certainty grid method for obstacle representation is helpful to the robustness improvement of obstacle avoidance algorithms, but its effect is limited, it also has many disadvantages. By the simulation of two typical obstacle avoidance algorithms, the damage of interfered sonar data is revealed. Then the kinematics model of obstacle avoidance is built, Kalman filter which can restrain divergence is designed for interfered sonar data. Sonar data is used by obstacle avoidance algorithm after filtering. By the simulation contrast of the two obstacle avoidance algorithms, the effect of the Kalman filter for robustness improvement of obstacle avoidance algorithms is testified. Finally, the effect of the Kalman filter for eliminating noises in sonar data and for robustness improvement of obstacle avoidance algorithms is verified by experiments in two different situation.
Early Bunyavirus-Host Cell Interactions

The Bunyaviridae is the largest family of RNA viruses, with over 350 members worldwide. Several of these viruses cause severe diseases in livestock and humans. With an increasing number and frequency of outbreaks, bunyaviruses represent a growing threat to public health and agricultural productivity globally. Yet, the receptors, cellular factors and endocytic pathways used by these emerging pathogens to infect cells remain largely uncharacterized. The focus of this review is on the early steps of bunyavirus infection, from virus binding to penetration from endosomes. We address current knowledge and advances for members from each genus in the Bunyaviridae family regarding virus receptors, uptake, intracellular trafficking and fusion.
Startling auditory stimulus as a window into speech motor planning

While speech planning has long been a topic of discussion in the literature, the specific content of speech plans has remained largely conjectural. The present dissertation brings to this problem a methodology using startling auditory stimulus (SAS) to examine the contents of prepared movement plans unaltered by feedback regulation. The startling auditory stimulus (SAS, > 120dB) has been found to elicit rapid release of prepared movements with high accuracy and largely unaltered EMG muscle activity patterns. Because the response latency of these SAS-triggered movements is too short to allow for feedback or correction processes, the executed movements have been used to reveal the contents of the movement plans with little or no feedback information influencing the prepared motor behaviours. In the present dissertation, the first experiment applied this methodology to CV syllable production to test whether English CV syllables can be elicited in the same manner as other limb movements. Results show that a SAS can trigger an early release of a well-formed prepared English CV syllable, including intact lip kinematics and vowel formants. The second experiment investigated whether the observed short latency and additional lip compression are speech-specific or generic to any oral movement. Results
INAOE_UPV-CORE: Extracting Word Associations from Document Corpora to estimate Semantic Textual Similarity

This paper presents three methods to evaluate the Semantic Textual Similarity (STS). The first two methods do not require labeled training data; instead, they automatically extract semantic knowledge in the form of word associations from a given reference corpus. Two kinds of word associations are considered: cooccurrence statistics and the similarity of word contexts. The third method was done in collaboration with groups from the Universities of Paris 13, Matanzas and Alicante. It uses several word similarity measures as features in order to construct an accurate prediction model for the STS.
Prevalence and Prescription of Antidepressants in Depression with Somatic Comorbidity in Asia: The Research on East Asian Psychotropic Prescription Patterns Study

Background: Depression is often comorbid with chronic somatic diseases. Few previous studies have investigated the prevalence of somatic diseases in depression or the prescription pattern of antidepressants in comorbidly depressed patients in Asia. This study aimed to investigate the prevalence of somatic comorbidity (SC) in depression and compared the prescriptions of antidepressants in depressed patients with and without SC. Methods: A total of 2320 patients treated with antidepressants in 8 Asian countries were examined, and a diagnosis was based on the International Classification of Disease, 10th revision. We listed 17 common chronic somatic diseases. Patients’ socio-demographic and clinical characteristics and psychotropic drug prescriptions were recorded using a standardized protocol and data collection procedure. Results: Of the patients examined, 1240 were diagnosed with depression and 30% of them (n = 375) had SC. The most common comorbid condition was diabetes (23.7%). The patients with SC were more likely to seek help at a general hospital (74.7% vs. 47.2%), and had a higher incidence of symptoms involving sadness, disturbed sleep, and poor appetite. Noradrenergic and specific serotonergic antidepressant was prescribed more for patients with SC than for those without SC (30.4% vs. 22.9%). Conclusions: SC is common in depressed Asian patients. It is important to strengthen the recognition of depression, especially in general hospitals and when patients report some somatic discomfort. It is also a matter of urgency to establish evidence-based guidelines for the use of new antidepressants in depressed patients with SC.
A qualitative evaluation of the barriers and facilitators toward implementation of the WHO surgical safety checklist across hospitals in England: lessons from the "Surgical Checklist Implementation Project".

OBJECTIVES To evaluate how the World Health Organization (WHO) surgical safety checklist was implemented across hospitals in England; to identify barriers and facilitators toward implementation; and to draw out lessons for implementing improvement initiatives in surgery/health care more generally. BACKGROUND The WHO checklist has been linked to improved surgical outcomes and teamwork, yet we know little about the factors affecting its successful uptake. METHODS A longitudinal interview study with operating room personnel was conducted across a representative sample of 10 hospitals in England between March 2010 and March 2011. Interviews were audio recorded over the phone. Interviewees were asked about their experience of how the checklist was introduced and the factors that hindered or aided this process. Transcripts were submitted to thematic analysis. RESULTS A total of 119 interviews were completed. Checklist implementation varied greatly between and within hospitals, ranging from preplanned/phased approaches to the checklist simply "appearing" in operating rooms, or staff feeling it had been imposed. Most barriers to implementation were specific to the checklist itself (eg, perceived design issues) but also included problematic integration into preexisting processes. The most common barrier was resistance from senior clinicians. The facilitators revealed some positive steps that can been taken to prevent/address these barriers, for example, modifying the checklist, providing education/training, feeding-back local data, fostering strong leadership (particularly at attending level), and instilling accountability. CONCLUSIONS We identified common themes that have aided or hindered the introduction of the WHO checklist in England and have translated these into recommendations to guide the implementation of improvement initiatives in surgery and wider health care systems.
EVS 26 Los Angeles , California , May 6-9 , 2012 Survey on fault-tolerant vehicle design

Fault-tolerant vehicle design is an emerging inter-disciplinary research domain, which is of increased importance due to the electrification of automotive systems. The goal of fault-tolerant systems is to handle occuring faults under operational condition and enable the driver to get to a safe stop. This paper presents results from an extended survey on fault-tolerant vehicle design. It aims to provide a holistic view on the fault-tolerant aspects of a vehicular system. An overview of fault-tolerant systems in general and their design premises is given as well as the specific aspects related to automotive applications. The paper highlights recent and prospective development of vehicle motion control with integrated chassis control and passive and active fault-tolerant control. Also, fault detection and diagnosis methods are briefly described. The shift on control level of vehicles will be accompanied by basic structural changes within the network architecture. Control architecture as well as communication protocols and topologies are adapted to comply with the electrified automotive systems. Finally, the role of regulations and international standardization to enable fault-tolerant vehicle design is taken into consideration.
Universal access through biometrics in mobile scenarios

The main aim of this paper is the development of a new technology for biometric recognition that allows safe and secure access to universal services such as credit card payment, ATMs, access control, border control, etc. The technology being developed is very generic and easily adaptable to the specific particularities of disabled people; a collective that represents an important proportion of current population (e.g. about the 9% of the total Spanish population).
Advanced Junction-Based Routing in Vehicular Ad-Hoc Networks

This paper presents an efficient junction-based routing protocol for vehicle-to-vehicle (V2V) vehicular ad-hoc networks (VANETs) aided by the global positioning system (GPS) and digital maps. The new protocol uses effective routing table learning and maintenance to reduce the probability of finding no suitable relay vehicles at a designated junction in packet transmission. It can find vehicles for packet relay more accurately, enhance transmission stability and decrease the cost due to unnecessary packet discarding or repeated path searching. Simulation results show that it can ensure more efficient transmission than existing protocols without additional control overhead.
Performance Analysis of Prerake DS UWB Multiple Access System Under Imperfect Channel Estimation

In this paper, the performance of Prerake DS UWB multiple access system under imperfect channel estimation is studied. The signal model of the system is derived in matrix form, which clearly shows the components of inter-chip interference, inter-symbol interference and multiple access interference. The BER formula is derived based on this signal model and validated by simulations. We highlight that the BER performance does not monotonically decrease with the growth of data rate under imperfect channel estimation. The effect of imperfect channel estimation in different cases is also discussed.
A hierarchical neural stimulation model for pain relief by variation of coil design parameters

Neural stimulation represents a powerful technique for neural disorder treatment. This paper deals with optimization of coil design parameters to be used during stimulation for modulation of neuronal firing to achieve pain relief. Pain mechanism is briefly introduced and a hierarchical stimulation model from coil stimulation to neuronal firing is proposed. Electromagnetic field distribution for circular, figure of 8 and Magnetic resonance coupling figure of 8 coils are analyzed with respect to the variation of stimulation parameters such as distance between coils, stimulation frequency, number of turns and radius of coils. MRC figure of 8 coils were responsible for inducing the maximum Electric field for same amount of driving current in coils. Variation of membrane potential, ion channel conductance and neuronal firing frequency in a pyramidal neuronal model due to magnetic and acoustic stimulation are studied. The frequency of neuronal firing for cortical neurons is higher during pain state, compared to no pain state. Lowest neuronal firing frequency 18 Hz was found for MRC figure of 8 coils, compared to 30 Hz for circular coils. Therefore, MRC figure of 8 coils are most effective for modulation of neuronal firing, thereby achieving pain relief in comparison to other coils considered in this study
A measurement study of Speex VoIP and H.264/AVC video over IEEE 802.16d and IEEE 802.11g

We evaluate the capacity of an IEEE 802.16d and IEEE 802.11g testbed to simultaneously carry emulated H.264/AVC video and Speex VoIP and present results from an extensive measurement study. First, we employ two fixed WiMAX subscriber stations and one base station and report results for packet loss and one-way delay under both line-of-sight and non-line-of-sight conditions. In addition, we put these results in perspective by repeating the experiments using an off-the-self IEEE 802.11g router. In particular, we use the IEEE 802.11g access point as an extension to the WiMAX network, a case often considered in simulation studies. Finally, we consider the IEEE 802.11g access network in isolation, and measure its capacity to carry video streams and emulated bidirectional VoIP calls simultaneously and compare it with the WiMAX access network.
Nonlocal foveated principal components

Patch foveation corresponds to a spatially variant representation where the center of the patch is sharp while the periphery is blurred. This mimics the non-uniformity of the human visual system, whose acuity is maximal at the fixation point (imaged by the fovea, i.e. the central part of the retina) and low at the periphery of the visual field. We introduce patch foveation for patch clustering in dictionary learning. In particular, we consider principal components learned from clusters of foveated patches extracted from natural images corrupted by additive noise. Experiments demonstrate that the first few foveated principal components provide a better representation of the actual (non-foveated) image than the usual principal components learned from clusters of patches or windowed patches. These new results confirm the effectiveness of patch foveation as regularization and preconditioning prior when processing natural images.
F ¨ Ur Mathematik in Den Naturwissenschaften Leipzig Black Box Low Tensor Rank Approximation Using Fibre-crosses Black Box Low Tensor Rank Approximation Using Fibre-crosses

In this article we introduce a black box type algorithm for the approximation of tensors A in high dimension d. The algorithm determines adaptively the positions of entries of the tensor that have to be computed or read, and using these (few) entries it constructs a low rank tensor approximation X that minimizes the ℓ 2-distance between A and X at the chosen positions. The full tensor A is not required, only the evaluation of A at a few positions. The minimization problem is solved by Newton's method which requires the computation and evaluation of the Hessian. For efficiency reasons the positions are located on fibre-crosses of the tensor so that the Hessian can be assembled and evaluated in a data-sparse form requiring a complexity of O(P d), where P is the number of fibre-crosses and d the order of the tensor.
Perception of blending in stereo motion panoramas

Most methods for synthesizing panoramas assume that the scene is static. A few methods have been proposed for synthesizing stereo or motion panoramas, but there has been little attempt to synthesize panoramas that have both stereo and motion. One faces several challenges in synthesizing stereo motion panoramas, for example, to ensure temporal synchronization between left and right views in each frame, to avoid spatial distortion of moving objects, and to continuously loop the video in time. We have recently developed a stereo motion panorama method that tries to address some of these challenges. The method blends space-time regions of a video XYT volume, such that the blending regions are distinct and translate over time. This article presents a perception experiment that evaluates certain aspects of the method, namely how well observers can detect such blending regions. We measure detection time thresholds for different blending widths and for different scenes, and for monoscopic versus stereoscopic videos. Our results suggest that blending may be more effective in image regions that do not contain coherent moving objects that can be tracked over time. For example, we found moving water and partly transparent smoke were more effectively blended than swaying branches. We also found that performance in the task was roughly the same for mono versus stereo videos.
An Ultra Low-Power High-Speed Rail-to-Rail Buffer Amplifier for LCD Source Drivers

An ultra low-power high-speed rail-to-rail buffer amplifier with improved current summing circuit is proposed for LCD source drivers. By placing two complementary differential pairs in parallel, it is possible to obtain a rail-to-rail input stage. Then, a current summing circuit with two embedded comparators is proposed. With the proposed current summing circuit, the output stages will be turned off at static state to reduce quiescent current, while keeping large driving capacity when they are turned on at dynamic state. In addition, the proposed buffer amplifier will not increase the chip size so that the buffer amplifier can be made compact. Simulation with a 0.35 μm CMOS technology demonstrates that the buffer has a quiescent current of 2.0 μA and a maximum tracking error of 0.16 LSB with 100% rail-to-rail input swing. Settling time of 1.5 μs and 2.1 μs for the rising and falling edge is measured for rail-to-rail voltage swing with 600 pF capacitance load, which is sufficient for driving large LCD panels.
Optimization of Protein Therapies by Polymer-Conjugation as an Effective DDS

Due to recent advances in disease proteomics, many disease-related proteins have been found. It is expected that there will be therapeutically useful proteins among them. However, it is clinically difficult to use most proteins as effective and safe drugs because of their very low stability and pleiotropic actions in vivo. To promote disease proteomic based drug development for protein therapies, we have attempted to develop an optimal polymer-conjugation system for improving the therapeutic potency of proteins. In this review, we introduce this innovative protein-drug system.
SINGLE-CARRIER TRANSMISSION USING QRM-MLD WITH ANTENNA DIVERSITY

The frequency-domain received single-carrier (SC) signal can be expressed using the matrix representation similar to the multiple-input multiple-output (MIMO) multiplexing. The signal detection schemes developed for MIMO multiplexing can be applied to the SC transmissions. In this paper, we apply maximum likelihood detection employing QR decomposition and M-algorithm (QRM-MLD) to the SC signal detection with antenna diversity reception. We show that by using antenna diversity reception, the number of surviving symbol candidates can be reduced. We evaluate, by the computer simulation, the bit error rate (BER) performance achievable by QRM-MLD and compare it with that achievable by the Vertical-Bell Laboratories Layered spacetime architecture (V-BLAST) detection.
Online Bipartite Matching in Offline Time

This paper investigates the problem of maintaining maximum size matchings in incremental bipartite graphs. In this problem a bipartite graph G between n clients and n servers is revealed online. The clients arrive in an arbitrary order and request to be matched to a subset of servers. In our model we allow the clients to switch between servers and want to maximize the matching size between them, i.e., after a client arrives we find an augmenting path from a client to a free server. Our goals in this model are twofold. First, we want to minimize the number of times clients are reallocated between the servers. Second, we want to give fast algorithms that recompute such reallocation. As for the number of changes, we propose a greedy algorithm that chooses an augmenting path π that minimizes the maximum number of times each server in π was used by augmenting paths so far. We show that in this algorithm each server has its client reassigned O(√n) times. This gives an O(n3/2) bound on the total number of changes, what gives a progress towards the main open question risen by Chaudhuri et al. (INFOCOM'09) who asked to prove O(n log n) upper bound. Next, we argue that the same bound holds in the decremental case. Moreover, we show incremental and decremental algorithms that maintain (1 - ε)-approximate matching with total of O(ε-1n) reallocations, for any ε > 0. Finally, we address the question of how to efficiently compute paths given by this greedy algorithm. We show that by introducing proper amortization we can obtain an incremental algorithm that maintains the maximum size matching in total O(√nm) time. This matches the running time of one of the fastest static maximum matching algorithms that was given by Hopcroft and Karp (SIAM J. Comput '73). We extend our result to decremental case where we give the same total bound on the running time. Additionally, we show O(ε-1m) time incremental and decremental algorithms that maintain (1 - ε)-approximate matching for any ε > 0. Observe that this bound matches the running time of the fastest approximate static solution as well.