Miracle-dz/UniFAR-FTUs huggingface dataset:
Disks, Partitions, Volumes and RAID Performance with the Linux Operating System

Block devices in computer operating systems typically correspond to disks or disk partitions, and are used to store files in a filesystem. Disks are not the only real or virtual device which adhere to the block accessible stream of bytes block device model. Files, remote devices, or even RAM may be used as a virtual disks. This article examines several common combinations of block device layers used as virtual disks in the Linux operating system: disk partitions, loopback files, software RAID, Logical Volume Manager, and Network Block Devices. It measures their relative performance using different filesystems: Ext2, Ext3, ReiserFS, JFS, XFS,NFS.
Architecture optimization of a 3-DOF translational parallel mechanism for machining applications, the orthoglide

This paper addresses the architecture optimization of a three-degree-of-freedom translational parallel mechanism designed for machining applications. The design optimization is conducted on the basis of a prescribed Cartesian workspace with prescribed kinetostatic performances. The resulting machine, the Orthoglide, features three fixed parallel linear joints which are mounted orthogonally, and a mobile platform which moves in the Cartesian x-y-z space with fixed orientation. The interesting features of the Orthoglide are a regular Cartesian workspace shape, uniform performances in all directions, and good compactness. A small-scale prototype of the Orthoglide under development is presented at the end of this paper.
Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who is as capable as the intended receiver, but has different channel parameters. We aim to provide perfect secrecy for the transmitters in this multi-access environment. Using Gaussian codebooks, an achievable secrecy region is determined and the power allocation that maximizes the achievable sum-rate is found. Numerical results showing the new rate region are presented. It is shown that the multiple-access nature of the channel may be utilized to allow users with zero single-user secrecy capacity to be able to transmit in perfect secrecy. In addition, a new collaborative scheme is shown that may increase the achievable sum-rate. In this scheme, a user who would not transmit to maximize the sum rate can help another user who (i) has positive secrecy capacity to increase its rate, or (ii) has zero secrecy capacity to achieve a positive secrecy capacity.
The Expression Analysis of Complement Component C3 during Early Developmental Stages in Olive Flounder (Paralichthys olivaceus)

Fish larvae are immediately exposed to microbes from hatching to maturation of their lymphoid organs, therefore effective innate mechanisms is very important for survival in such an environment. The key component of innate immune system, C3 is central protein of all activation pathways of the complement system, leading to inflammatory reactions, such as opsonisation, chemotaxis, and cell lysis of pathogens. Although, innate mechanisms is essential for survival in the early stage of development, little is known about defence mechanisms. In this study, the alignment analysis showed that amino acid sequence of C3 from olive flounder liver EST homologous to other known C3 sequences with 73-99% identity. Also, we examined the tissue distribution of olive flounder C3 and analyzed expression pattern from the fertilized egg until 28 days post hatching. As a result, olive flounder C3 mRNA was expressed only in the liver and the mRNA level more increased as developmental proceed during the early stage. These results may suggest that olive flounder C3 plays an important function in the early immune response of olive flounder larvae.
Part of Speech Tagging in Thai Language Using Support Vector Machine

The elastic-input neuro tagger and hybrid tagger, combined with a neural network and Brill's error-driven learning, have already been proposed for the purpose of constructing a practical tagger using as little training data as possible. When a small Thai corpus is used for training, these taggers have tagging accuracies of 94.4% and 95.5% (accounting only for the ambiguous words in terms of the part of speech), respectively. In this study, in order to construct more accurate taggers we developed new tagging methods using three machine learning methods: the decision-list, maximum entropy, and support vector machine methods. We then performed tagging experiments by using these methods. Our results showed that the support vector machine method has the best precision (96.1%), and that it is capable of improving the accuracy of tagging in the Thai language. Finally, we theoretically examined all these methods and discussed how the improvements were achived.
Rule Writing or Annotation: Cost-efficient Resource Usage for Base Noun Phrase Chunking

This paper presents a comprehensive empirical comparison between two approaches for developing a base noun phrase chunker: human rule writing and active learning using interactive real-time human annotation. Several novel variations on active learning are investigated, and underlying cost models for cross-modal machine learning comparison are presented and explored. Results show that it is more efficient and more successful by several measures to train a system using active learning annotation rather than hand-crafted rule writing at a comparable level of human labor investment.
Toward Relational Learning with Misinformation

Relational learning has been proposed to cope with the interdependency among linked instances in a network, and it is a fundamental tool to categorize social network users for various tasks. However, the emerging widespread of misinformation in social networks, information that is inaccurate or false, poses novel challenges to utilizing social media data. Malicious users may actively manipulate their content and characteristics, which easily lead to a noisy dataset. Hence, it is intricate for traditional relational learning approaches to deliver an accurate predictive model in the presence of misinformation. In this work, we precisely focus on the problem by proposing a joint framework that simultaneously constructs a relational learning model and mitigates the effect of misinformation by restraining anomalous points. Empirical results on real-world social media data prove the superiority of the proposed approach, Relational Learning with Misinformation (RLM), over traditional approaches on modeling social network users.
Functional and Quantitative MRI Mapping of Somatomotor Representations of Human Supralaryngeal Vocal Tract

Abstract Speech articulation requires precise control of and coordination between the effectors of the vocal tract (e.g., lips, tongue, soft palate, and larynx). However, it is unclear how the cortex represents movements of and contact between these effectors during speech, or how these cortical responses relate to inter‐regional anatomical borders. Here, we used phase‐encoded fMRI to map somatomotor representations of speech articulations. Phonetically trained participants produced speech phones, progressing from front (bilabial) to back (glottal) place of articulation. Maps of cortical myelin proxies (R1 = 1/T1) further allowed us to situate functional maps with respect to anatomical borders of motor and somatosensory regions. Across participants, we found a consistent topological map of place of articulation, spanning the central sulcus and primary motor and somatosensory areas, that moved from lateral to inferior as place of articulation progressed from front to back. Phones produced at velar and glottal places of articulation activated the inferior aspect of the central sulcus, but with considerable across‐subject variability. R1 maps for a subset of participants revealed that articulator maps extended posteriorly into secondary somatosensory regions. These results show consistent topological organization of cortical representations of the vocal apparatus in the context of speech behavior.
A semantic fusion based Multimodal Interaction Panel for virtual city planning

Multimodal Interaction (MMI) in Virtual Environment (VE) has become a focus of both Virtual Reality (VR) and Human-Computer Interaction (HCI). In this paper, with reference to existing task-oriented integration algorithms, we propose a new hierarchical multimodal integration model based on semantics extracting with probability and time constraints, and on the background of virtual city planning Multimodal Interaction Panel (MIP) based on multiple metaphors is constructed by introducing daily operations of pen and paper into VE and combining spatial position trackers, microphone and pen-based sketches and gestures. A variety of common and application-oriented MMI techniques are designed and implemented, and part of their integration processes are analyzed in detail. Evaluation shows MIP significantly improved naturality and efficiency of MMI.
A fixed point iteration for computing the matrix logarithm

In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical method calculates successive square roots. In this article, a new algorithm is presented that relies on the computation of successive matrix exponentials. Convergence of the method is demonstrated for a large class of initial matrices and favorable choices of the initial matrix are discussed.
A Proposed Technique for Hiding Encrypted Data in Video Files

Computer technology and the Internet have made a breakthrough in the existence of data communication. Securing the data transfer over a transmission media has become of great importance. This has opened a new way of implementing steganography to ensure secure data transfer. Steganography is the fine art of hiding the information. Hiding a message in a carrier file enables the deniability of the existence of any message at all. This paper proposes a steganographic technique to hide text data in a computer video file. The proposed data hiding system’s objectives are: storage capacity, perceptual invisibility, strength against detection attacks and distortion resistance.
Observability and decentralized control of fuzzy discrete-event systems

Fuzzy discrete-event systems as a generalization of (crisp) discrete-event systems have been introduced in order that it is possible to effectively represent uncertainty, imprecision, and vagueness arising from the dynamic of systems. A fuzzy discrete-event system has been modeled by a fuzzy automaton; its behavior is described in terms of the fuzzy language generated by the automaton. In this paper, we are concerned with the supervisory control problem for fuzzy discrete-event systems with partial observation. Observability, normality, and co-observability of crisp languages are extended to fuzzy languages. It is shown that the observability, together with controllability, of the desired fuzzy language is a necessary and sufficient condition for the existence of a partially observable fuzzy supervisor. When a decentralized solution is desired, it is proved that there exist local fuzzy supervisors if and only if the fuzzy language to be synthesized is controllable and co-observable. Moreover, the infimal controllable and observable fuzzy superlanguage, and the supremal controllable and normal fuzzy sublanguage are also discussed. Simple examples are provided to illustrate the theoretical development
Mechanical Properties of DNA-Crosslinked Polyacrylamide Hydrogels with Increasing Crosslinker Density

Abstract DNA-cross-linked polyacrylamide hydrogels (DNA gels) are dynamic mechanical substrates. The addition of DNA oligomers can either increase or decrease the crosslinker density to modulate mechanical properties. These DNA-responsive gels show promise as substrates for cell culture and tissue-engineering applications, since the gels allow time-dependent mechanical modulation. Previously, we reported that fibroblasts plated on DNA gels responded to modulation in elasticity via an increase or decrease in crosslinker density. To better characterize fibroblast mechanical signals, changes in stress and elastic modulus of DNA gels were measured over time as crosslinker density altered. In a previous study, we observed that as crosslinker density decreased, stress was generated, and elasticity changed over time; however, we had not evaluated stress and elastic modulus measurements of DNA gels as crosslinker density increased. Here, we completed this set of fibroblast studies by reporting stress and elastic modulus measurements over time as the crosslinker density increased. We found that the stress generated and the elastic modulus alterations were correlated. Hence, it seemed impossible to separate the effect of stress from the effect of modulus changes for fibroblasts plated on DNA gels. Yet, previous results and controls revealed that stress contributed to fibroblast behavior.
Adaptation of Ranaviruses from Peneda-Gerês National Park (Portugal) to Cell Cultures and their Characterization

Ranaviruses are known to produce iseases in fish, amphibians and reptiles, being involved in high mortality episodes in aquaculture farms and in the decline of amphibian populations worldwide. Mass mortality episodes were previously detected in Triturus marmoratus from two lagoons of the Peneda-Gerês National Park (PGNP) (NW Portugal). Ranavirus-like particles were identified in tissues of diseased newts T. marmoratus and T. boscai. Here we report on the molecular and ultrastructural characterization of these viruses.
An Approximation Algorithm for Shortest Descending Paths

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No ecient algorithm is known to find a shortest descending path (SDP) from s to t in a polyhedral terrain. We give a simple approximation algorithm that solves the SDP problem on general terrains. Our algorithm discretizes the terrain with O(n 2 X/†) Steiner points so that after an O ‡ n 2 X † log i nX
Subvocal speech recognition via close-talk microphone and surface electromyogram using deep learning

Speech communication is very essential for human-human communication and human machine interaction. Current Automatic Speech Recognition (ASR) may not be suitable for quiet settings like libraries and meetings or for speech handicapped and elderly people. In this study, we present an end-to-end deep learning system for subvocal speech recognition. The proposed system utilizes a single channel surface Electromyogram (sEMG) placed diagonally across the throat alongside a close-talk microphone. The system was tested on a corpus of 20 words. The system was capable of learning the mapping functions from sound and sEMG sequences to letters and then extracting the most probable word formed by these letters. We investigated different input signals and different depth levels for the deep learning model. The proposed system achieved a Word Error Rate (WER) of 9.44, 8.44 and 9.22 for speech, speech combined with single channel sEMG, and speech with two channels of sEMG respectively.
Assessing Animals’ Preferences: Concurrent Schedules of Reinforcement

Three methods of assessing animals’ preferences are outlined: free-access, two-choice (e.g., T maze), and concurrent-schedules. While all give indications of relative preference between the choices, freeaccess and discrete-trial procedures tend to give exclusive preference and so do not indicate the degree of preference. Concurrent schedules give at least ordinal measures of the degree of preference. Data from cows, hens, and brushtail possums are used to illustrate the use of concurrent schedules to assess food preferences. The use of multiple-concurrent schedules to assess preference between sounds, and of concurrent-chain schedules to assess preference between waiting with or without another hen present are illustrated by studies with hens. Concurrent schedules, while not replacing other methods, are useful in evaluating preferences.
Discrete differential geometry of proteins: a new method for encoding three-dimensional structures of proteins

In nature the three-dimensional structure of a protein is encoded in the corresponding gene. In this paper we describe a new method for encoding the three-dimensional structure of a protein into a binary sequence. The feature of the method is the correspondence between protein-folding and ``integration''. A protein is approximated by a folded tetrahedron sequence. And the binary code of a protein is obtained as the ``second derivative'' of the shape of the folded tetrahedron sequence. With this method at hand, we can extract static structural information of a protein from its gene. And we can describe the distribution of three-dimensional structures of proteins without any subjective hierarchical classification.
Objective evaluation of dysphonia: preliminary results of a device allowing simultaneous acoustic and aerodynamic measurements.

Voice quality analysis was performed in 88 normal speakers and 157 dysphonic speakers using a device that allows simultaneous study of acoustic and aerodynamic parameters during pronunciation of a sustained /a/. We compared the results with those of voice quality grading by a jury. The Mann-Whitney test showed significant differences between the grades of dysphonia for all the parameters chosen. Comparison of results (using discriminant factorial analysis) with perceptual evaluation by a jury showed concordance in 66.1%. Based on these preliminary results, the authors conclude that their protocol overlooks some relevant voice parameters like middle-term variations. Further study will be undertaken to take into account this type of variations.
Cardiosurgical intensive care : Business as usual ?

There are several S3-guidelines that focus on the treatment of patients after cardiac surgery published by the German Medical Association (AWMF). These high quality guidelines cover the areas of haemodynamic monitoring and postoperative cardiovascular therapy (S3), the management of analgesia, sedation and delirium in intensive care and prevention (S3), diagnoses and therapy of sepsis (S2k). All of these guidelines give goal-oriented therapy algorithms for specific clinical situations. The use of these guidelines results in a direct and specific therapy and considering the evidence-based approach, leads to an improved outcome of patients after cardiac surgery. There is an increased demand for cardiac surgery procedures and consequently for postoperative care of these patients, as there is a growing elderly population in Europe and America with decreased physiologic reserve and multiple comorbid conditions [1]. To comply with the increasing demand for postoperative care of cardiac surgery patients several goal oriented fast track cardiac surgery pathways have been developed [2]. Studies have demonstrated that postoperative therapy of cardiac surgery is not limited to the cardiac surgical intensive care unit. The implementation of goal oriented concepts in the PACU resulted in significant shorter stay in the intensive or intermediate care unit, in shorter hospital length of stay, lower risk of postoperative low cardiac output syndrome and a lower mortality [3]. The separation from the ICU patients resulted in goal orientated approach to treat the patients without any delay effectively, which resulted in fewer postoperative complications and faster extubation after surgery. These effects also result in a better utilization of the cardiac surgical intensive care unit, where the patients with a higher rate of organ failures are treated.
Generators of algebraic covariant derivative curvature tensors and Young symmetrizers

We show that the space of algebraic covariant derivative curvature tensors R' is generated by Young symmetrized tensor products W*U or U*W, where W and U are covariant tensors of order 2 and 3 whose symmetry classes are irreducible and characterized by the following pairs of partitions: {(2),(3)}, {(2),(2 1)} or {(1 1),(2 1)}. Each of the partitions (2), (3) and (1 1) describes exactly one symmetry class, whereas the partition (2 1) characterizes an infinite set S of irreducible symmetry classes. This set S contains exactly one symmetry class S_0 whose elements U can not play the role of generators of tensors R'. The tensors U of all other symmetry classes from S\{S_0} can be used as generators for tensors R'. Foundation of our investigations is a theorem of S. A. Fulling, R. C. King, B. G. Wybourne and C. J. Cummins about a Young symmetrizer that generates the symmetry class of algebraic covariant derivative curvature tensors. Furthermore we apply ideals and idempotents in group rings C[Sr], the Littlewood-Richardson rule and discrete Fourier transforms for symmetric groups Sr. For certain symbolic calculations we used the Mathematica packages Ricci and PERMS.
Random Walks in Routing Landscapes

In this paper we presenta combinatorial optimisation view on the routing problem for connectionlesspacket networks by using the metaphor of a landscape. We examine the main properties of the routing landscapesas we define them and how they can help us on the evaluation of the problem difficulty and the generation of effective algorithms. We also presentthe random walk statistical technique to evaluate the main properties of thoselandscapesand a number of examplesto demonstrate the useof the method.
Geometric Complexity Theory IV: quantum group for the Kronecker problem

A fundamental problem in representation theory is to find an explicit positive rule, akin to the Littlewood-Richardson rule, for decomposing the tensor product of two irreducible representations of the symmetric group (Kronecker problem). In this paper a generalization of the Drinfeld-Jimbo quantum group, with a compact real form, is constructed, and also an associated semisimple algebra that has conjecturally the same relationship with the generalized quantum group that the Hecke algebra has with the Drinfeld-Jimbo quantum group. In the sequel [24] it is observed that an explicit positive decomposition rule for the Kronecker problem exists assuming that the coordinate ring of the generalized quantum group has a basis analogous to the canonical basis for the coordinate ring of the Drinfeld-Jimbo quantum group, as per Kashiwara and Lusztig [12, 17], or in the dual setting–the associated algebra has a basis analogous to the Kazhdan-Lusztig basis for the Hecke algebra [13], as suggested by the experimental and theoretical results therein. In the other sequel [23], similar quantum group and algebra are constructed for the generalized plethysm problem, of which the Kronecker problem studied here is a special case. These problems play a central role in geometric complexity theory– an approach to the P vs. NP and related problems. Visiting faculty member 1