Miracle-dz/UniFAR-FTUs huggingface dataset:
ON THE UNBIASEDNESS PROPERTY OF AIC FOR EXACT OR APPROXIMATING MULTIVARIATE ARMA MODELS

This series contains research reports, written by or in cooperation with staff members of the Statistical Research Division, whose content may be of interest to the general statistical research community. The views reflected in these reports are not necessarily those of the Census Bureau nor do they necessarily represent Census Bureau statistical policy or practice. Inquiries may be addressed to the author(s) or the SRD Report Series Coordinator, Statistical Research Division, Bureau of the Census, Washington, D.C. 20233.
Conceptual Representation of Early Adolescents' Prosocial Behavior

亲社会行为是社会心理学领域的重要研究课题。 本研究采用系统聚类分析和探索性因素分析的方法分析了青少年对43种亲社会行为①所做的符合程度的评价,探讨青少年亲社会行为的概念表征。 结果发现:(1)青少年的亲社会行为概念是以原型表征的;(2)青少年亲社会行为的概念原型由遵规与公益性亲社会行为、特质性亲社会行为、关系性亲社会行为、利他性亲社会行为四个维度构成;(3)四个维度上的最佳实例分别是:“亲情行为”、“忠诚”、“增进友谊”和“帮助”。
Frequency-Offset Sensitivity of Resilient Microwave Links Applying the Alamouti Scheme

Space-time codes were designed for fading environments in order to improve system capacity and/or to achieve a diversity gain. In this paper, a novel possible applicationof the Alamouti space-time block code (STBC) for two transmit antennas is investigated, to provide a switchless alternative incurrent resilient microwave radio links. Resilient means that transmitter (Tx) and receiver (Rx) are each equipped with two complete, i ndependent, parallel Tx/Rx chains and particularly with two antennas. Conventionally, only one Tx/Rx chain is active, while t he other one is kept in a ‘hot-stand-by’ mode. In the proposed alternative system design based on the Alamouti STBC, both Tx antennas ar e utilized at the same time. Since the Alamouti STBC is backwar d compatible with the single transmit antenna system, one Tx c hain may fail without causing a rate loss. However, a resilient Tx /Rx structure implies that two independent local oscillators are employed for up-conversion as well as for down-conversion, i. e. , the local oscillators at each antenna may independently differ from the nominal carrier frequency. It is shown here that in this casethe orthogonality of the Alamouti STBC is lost, even if the frequency offsets are perfectly known at the receiver. Analytical expresions for the bit error probability as a function of the frequency offsets are derived, and the performance loss occurring in the case of pe rfect and non-perfect knowledge of the frequency offsets at the re ceiver is illustrated on the basis of simulation results.
Filter-wrapper approach to feature selection of GPCR protein

Protein dataset contains high dimensional feature space. These features may encompass of noise and not relatively to protein function. Therefore, we need to select the appropriate features to improve the efficiency and performance of the classifier. Feature selection is an important step in any classification tasks. Filter methods are important in order to obtain only the relevant features to the class and to avoid redundancy. While wrapper methods are applied to get optimized features and better classification accuracy. This paper proposed a feature selection strategy for hierarchical classification of G-Protein-Coupled Receptors (GPCR) based on hybridization of correlation feature selection (CFS) filter and genetic algorithm (GA) wrapper methods. The optimum features were then classified using K-nearest neighbor algorithm. These methods are capable to reduce the features and achieved comparable classification accuracy at every hierarchy level. The results also shown that the integration between CFS and GA is capable of searching the optimum features for hierarchical protein classification.
Weight-Perception-Based Novel Control of a Power-Assist Robot for the Cooperative Lifting of Light-Weight Objects

We developed a 1-DOF power assist robot system for lifting objects by two humans cooperatively. We hypothesized that weight perception due to inertia might be different from that due to gravity when lifting an object with power-assist because the perceived weight differs from the actual weight. The system was simulated and two humans cooperatively lifted objects with it. We analyzed human features such as weight perception, load forces, motions etc. We found that the robot reduced the perceived weights to 25% of the actual weights, and the load forces were 8 times larger than the actual requirements. The excessive load forces resulted in excessive accelerations that jeopardized the performances. We then implemented a novel control based on the human features, which was such that a virtual mass exponentially declined from a large value to a small one when subjects lifted objects with the robot and the command velocity exceeded a threshold. The novel control reduced excessive load forces and accelerations and thus enhanced performances in terms of maneuverability, safety etc. The findings may be used to develop power assist robots for manipulating heavy objects in industries that may augment human's abilities and skills and may improve interactions between robots and users.
Analysis of short-circuit conditions for silicon carbide power transistors and suggestions for protection

An experimental analysis of the behavior under short-circuit conditions of three different Silicon Carbide (SiC) 1200 V power devices is presented. It is found that all devices take up a substantial voltage, which is favorable for detection of short-circuits. A suitable method for short-circuit detection without any comparator is demonstrated. A SiC JFET driver with an integrated short-circuit protection (SCP) is presented where a short-circuit detection is added to a conventional driver design in a simple way. Experimental tests of the SCP driver operating under short-circuit condition and under normal operation are performed successfully.
QUANTUM-CHANNEL CAPACITY OF VERY NOISY CHANNELS

We present a family of additive quantum error-correcting codes whose capacities exceed those of quantum random coding (hashing) for very noisy channels. These codes provide nonzero capacity in a depolarizing channel for fidelity parameters $f$ when $fg0.80944$. Random coding has nonzero capacity only for $fg0.81071$; by analogy to the classical Shannon coding limit, this value had previously been conjectured to be a lower bound. We use the method introduced by Shor and Smolin of concatenating a nonrandom repetition (cat) code within a random code to obtain good codes. The cat code with block size five is shown to be optimal for single concatenation. The best known multiple-concatenated code we found has a block size of 25. We derive a general relation between the capacity attainable by these concatenation schemes and the coherent information of the inner code states.
Customizable 3D Printed Tactile Maps as Interactive Overlays

Though tactile maps have been shown to be useful tools for visually impaired individuals, their availability has been limited by manufacturing and design costs. In this paper, we present a system that uses 3D printing to (1) make tactile maps more affordable to produce, (2) allow visually impaired individuals to independently design and customize maps, and (3) provide interactivity using widely available mobile devices. Our system consists of three parts: a web interface, a modeling algorithm, and an interactive touchscreen application. Our web interface, hosted at www.tactilemaps. net, allows visually impaired individuals to create maps of any location on the globe while specifying (1) what features to map, (2) how the features should be represented by textures, and (3) where to place markers and labels. Our modeling algorithm accommodates user specifications to create map models with (1) multiple layers of continuously varying textures and (2) markers of various geometric shapes or braille characters. Our interactive application uses a novel approach to 3D printing tactile maps using conductive filament to provide touchscreen overlays that allow users to dynamically interact with the maps on a wide range of mobile devices. This paper details the implementation of our system. We also present findings from a user study validating the usability of our mapping interface and the utility of the maps produced. Finally, we discuss the limitations of our current implementation and the plans we have to improve our system based on feedback from our user study and additional interviews.
SpeechRecorder - a Universal Platform Independent Multi-Channel Audio Recording Software

SpeechRecorder is a platform independent audio recording software for speech corpus recordings. It is implemented in Java in a clean object-oriented design and adheres to established technology standards and document interchange formats. SpeechRecorder allows Unicode text and multimedia prompts, it supports audio recordings via more than two channels, and it features multiple configurable screens. Recording sessions are defined by recording scripts written in XML. The recording scripts can be executed manually by the experimenter, or automatically for unsupervised recordings; progress through the script can be sequential or randomized. SpeechRecorder is based on URLs to access local and network resources and thus allows recordings via the WWW.
Decentralized Management of Sensors in a Multi-Attribute Environment Under Weak Network Congestion

We provide a game theoretic formulation for a sensor activation problem in a multi-attribute environment. Activated sensors randomly select one of M environmental attributes, and transmit data on that attribute to an end user. The goal is to maximize the number of attributes reported while minimizing redundant reports and packet collisions, which both increase with the number of active sensors. Sensor participation is optimized according to an adaptive scheme, in which sensors activate only when their expected utility, given by the number of unique attributes reported minus an energy cost, is positive. We formulate a Nash equilibrium policy that maximizes the expected performance from the perspective of each sensor when transmission is according to a one-shot frequency hopping scheme, and compare this to the global optimum
A simple induction machine model for predicting low frequency dynamics

Conventional models of induction machine for steady-state and dynamic analysis use fixed value of the rotor resistance; whereas for representing the deep-rotor-bar effect a second rotor branch is typically required therefore increasing the model complexity and order. This paper proposes a simple but very effective modification of traditional model, wherein a single-branch rotor resistance is changed as a function of speed. The new model parameters are readily identified using standard experiments and tests. Experimental results and simulation studies demonstrate the improved accuracy and advantage of the proposed model in predicting the low-frequency transients. More importantly, the improvement is achieved without increasing the model order.
Modular Object-Oriented Dynamic Learning Environment: What Open Source Has to Offer

Open source online learning environments have emerged and developed over the past 10 years. In this paper we will analyze the underlying philosophy and features of MOODLE based on the theoretical framework developed by Hannafin and Land (2000). Psychological, pedagogical, technological, cultural, and pragmatic foundations comprise the framework and represent the major points of our analysis. This paper is intended for instructional designers, distance education specialists, K-12 and college instructors who may want to add an online component to their courses.
A Nearly-m log n Time Solver for SDD Linear Systems

We present an improved algorithm for solving symmetrically diagonally dominant linear systems. On input of an $n\times n$ symmetric diagonally dominant matrix $A$ with $m$ non-zero entries and a vector $b$ such that $A\bar{x} = b$ for some (unknown) vector $\bar{x}$, our algorithm computes a vector $x$ such that $| |{x}-\bar{x}| |_A1 in time. O tiled (m log n log (1/epsilon))^2. The solver utilizes in a standard way a 'preconditioning' chain of progressively sparser graphs. To claim the faster running time we make a two-fold improvement in the algorithm for constructing the chain. The new chain exploits previously unknown properties of the graph sparsification algorithm given in [Koutis,Miller,Peng, FOCS 2010], allowing for stronger preconditioning properties.We also present an algorithm of independent interest that constructs nearly-tight low-stretch spanning trees in time Otiled (mlog n), a factor of O (log n) faster than the algorithm in [Abraham,Bartal,Neiman, FOCS 2008]. This speedup directly reflects on the construction time of the preconditioning chain.
Composing resilience techniques: ABFT, periodic and incremental checkpointing

Algorithm Based Fault Tolerant (ABFT) approaches promise unparalleled scalability and performance in failure-prone environments. Thanks to recent advances in the understanding of the involved mechanisms, a growing number of important algorithms (including all widely used factorizations) have been proven ABFT-capable. In the context of larger applications, these algorithms provide a temporal section of the execution, where the data is protected by its own intrinsic properties, and can therefore be algorithmically recomputed without the need of checkpoints. However, while typical scientific applications spend a significant fraction of their execution time in library calls that can be ABFT-protected, they interleave sections that are difficult or even impossible to protect with ABFT. As a consequence, the only practical fault-tolerance approach for these applications is checkpoint/restart. In this paper we propose a model to investigate the efficiency of a composite protocol, that alternates between ABFT and checkpoint/restart for the effective protection of an iterative application composed of ABFT- aware and ABFT-unaware sections. We also consider an incremental checkpointing composite approach in which the algorithmic knowledge is leveraged by a novel optimal dynamic program- ming to compute checkpoint dates. We validate these models using a simulator. The model and simulator show that the composite approach drastically increases the performance delivered by an execution platform, especially at scale, by providing the means to increase the interval between checkpoints while simultaneously decreasing the volume of each checkpoint.
Data Quantization Optimized for Machine Learning Applications

The goal of machine learning applications is to find a classification function, y(x), for a test point x ∈ χ, given a training dataset {(x , t ), 1 ≤ n ≤ N} in order to minimize some optimality criterion. In practice, the collection of data and feature extraction may not occur at the same time or in the same place as the application of the classification function. For instance, the user may want to store the collected data and perform classification later. If classification is computationally intensive, it may not be feasible to compute the classification function on the same device that was used to collect the data, so transmission of the collected data is required. In order to store or transmit data prior to classification, the data must first be quantized and then compressed. In this report, I will focus solely on the quantization process. I will assume that a classification function has been trained using unquantized data, but the testing data is quantized prior to being passed through the classifier. In other words, we test the classifier with some x̂ = q(x). As such, we seek to design a quantizer, q : χ→ χ, which preserves the performance of the classifier y. In this report, I will study several different methods of designing the quantizing function q using clustering.
Issues in the Design of an Extensible Operating System

Extensible operating systems are designed around the principle that a system can be dynamically customized to best serve application needs. However, realizing this goal in a safe and e cient manner poses a number of unique problems. In this paper, we examine the requirements for constructing robust extensible systems and discuss implementation techniques to satisfy those requirements with low overhead.
Feelings of Enlightenment: A Hermeneutic Interpretation of Latent Enlightenment Assumptions in Greenberg's Emotion-Focused Therapy

FEELINGS OF ENLIGHTENMENT: A HERMENEUTIC INTERPRETATION OF LATENT ENLIGHTENMENT ASSUMPTIONS IN GREENBERG’S EMOTION-FOCUSED THERAPY Alex Anthony Gomez Antioch University Seattle Seattle, WA The purpose of this dissertation is to explore how a mainstream theory of psychological practice might inadvertently conceal and ignore contemporary values and ideologies and their pathological consequences. Through a hermeneutic approach, I interpreted Leslie Greenberg’s Emotion-focused therapy: Coaching clients to work through their feelings (2 ed), a popular and widely used theory in psychotherapy. As a practitioner with humanistic foundations, this was also an opportunity for the author to understand his own unexamined values as a therapist. Specific EFT constructs and concepts that reflected Enlightenment assumptions and values were examined. EFT was situated within Enlightenment philosophy, particularly it’s alignment with European movements for increasing individual freedoms and resisting church and other perceived arbitrary authority. An argument of how Enlightenment perceptions were disguised within EFT’s scientific and objectivist frameworks was formed based on this contextualization. One way that Enlightenment philosophy contributed to increasing individual freedom was by relocating moral sources within the individual, which led to a configuration of the self that is reflected in theories like EFT. Broadly, the assumptions that were surfaced reflected philosophical ideas promulgated by Descartes, Locke, Kant and Rousseau, as well as essential ideas from Expressivist and Romantic philosophies in general. Several theme were identified
On Accelerating Soft-Error Detection by Targeted Pattern Generation

Soft error due to ionizing radiation is emerging as a major concern for future technologies. The measurement unit for failures due to soft errors is called failure-in-time (FIT) that represents the number of failures encountered per billion hours of device operation. FIT rate measurement is time consuming and calls for accelerated testing. There are multiple ways to accelerate soft error rate (SER) testing. Acceleration by increasing radiation and lowering supply voltage has been reported. In this paper we propose increasing the rate of failure due to soft error by intelligent pattern selection. The proposed approach is based on the fact that all circuit nodes are not equally susceptible to faults due to soft error. We propose a pattern selection technique which specifically targets the most vulnerable nodes in the circuit and construct a test set to maximize failure rate due to soft error. The solution is based on a combination of ILP and fault simulation techniques. The test set thus derived can be applied repeatedly to accelerate the soft error rate testing. Results based on ISCAS circuits show that it is possible to achieve 10times acceleration by this technique
BUILDING AUDIO CLASSIFIERS FOR BROADCAST NEWS RETRIEVAL

The process of building audio classifiers for high-level content descriptors, especially in large datasets, is not trivial. In this paper we describe the design and development of audio classification algorithms for broadcast news retrieval in the context of the TREC 2003 video retrieval evaluation. The main focus of this paper is the actual building process itself rather than the final results, although some representative results will be provided. It is our belief that the insights obtained and tools developed in order to work with real world large audio collections are important and frequently unmentioned in existing published work. An important and critical aspect of this process is obtaining ground truth annotations for training the classifiers. Therefore tools and techniques that assist the human annotation of news audio will be described.
Processing of the Presequence of the Schizosaccharomyces pombe Rieske Iron-Sulfur Protein Occurs in a Single Step and Can Be Converted to Two-step Processing by Mutation of a Single Proline to Serine in the Presequence*

The iron-sulfur proteins of the cytochromebc 1 complexes of Schizosaccharomyces pombe and Saccharomyces cerevisiae contain the three amino acid motif RX(↓)(F/L/I)XX(T/S/G)XXXX(↓) that is typical for proteins that are cleaved sequentially in two steps by matrix processing peptidase (MPP) and mitochondrial intermediate peptidase (MIP). Despite the presence of this recognition sequence theS. pombe iron-sulfur protein is processed only once during import into mitochondria, whereas the S. cerevisiae protein is processed in two steps. Import of S. pombe iron-sulfur protein in which the putative MIP or MPP recognition sites are eliminated by site-directed mutagenesis and import of iron-sulfur protein into mitochondria from yeast mutants that lack MIP activity indicate that one step processing of the S. pombeiron-sulfur protein is independent of those sites and of MIP activity. Sequencing of the mature protein obtained after import in vitro and of the endogenous iron-sulfur protein isolated from mitochondrial membranes by preparative 2D-electrophoresis shows that MPP recognizes a second site in the presequence and processing occurs between residues 43 and 44. If proline-20 of the S. pombe presequence is changed into a serine, a second cleavage step is induced. Conversely, if serine-24 of the S. cerevisiae presequence is changed to a proline, the first cleavage step that is normally catalyzed by MPP is blocked, causing precursor iron-sulfur protein to accumulate. Together these results indicate that a single amino acid change in the presequence is responsible for one-step processing in S. pombe versustwo-step processing in S. cerevisiae.
Efficient Uptake of Blood-Borne BK and JC Polyomavirus-Like Particles in Endothelial Cells of Liver Sinusoids and Renal Vasa Recta

Liver sinusoidal endothelial cells (LSECs) are specialized scavenger cells that mediate high-capacity clearance of soluble waste macromolecules and colloid material, including blood-borne adenovirus. To explore if LSECs function as a sink for other viruses in blood, we studied the fate of virus-like particles (VLPs) of two ubiquitous human DNA viruses, BK and JC polyomavirus, in mice. Like complete virions, VLPs specifically bind to receptors and enter cells, but unlike complete virions, they cannot replicate. 125I-labeled VLPs were used to assess blood decay, organ-, and hepatocellular distribution of ligand, and non-labeled VLPs to examine cellular uptake by immunohisto- and -cytochemistry. BK- and JC-VLPs rapidly distributed to liver, with lesser uptake in kidney and spleen. Liver uptake was predominantly in LSECs. Blood half-life (∼1 min), and tissue distribution of JC-VLPs and two JC-VLP-mutants (L55F and S269F) that lack sialic acid binding affinity, were similar, indicating involvement of non-sialic acid receptors in cellular uptake. Liver uptake was not mediated by scavenger receptors. In spleen, the VLPs localized to the red pulp marginal zone reticuloendothelium, and in kidney to the endothelial lining of vasa recta segments, and the transitional epithelium of renal pelvis. Most VLP-positive vessels in renal medulla did not express PV-1/Meca 32, suggesting location to the non-fenestrated part of vasa recta. The endothelial cells of these vessels also efficiently endocytosed a scavenger receptor ligand, formaldehyde-denatured albumin, suggesting high endocytic activity compared to other renal endothelia. We conclude that LSECs very effectively cleared a large fraction of blood-borne BK- and JC-VLPs, indicating a central role of these cells in early removal of polyomavirus from the circulation. In addition, we report the novel finding that a subpopulation of endothelial cells in kidney, the main organ of polyomavirus persistence, showed selective and rapid uptake of VLPs, suggesting a role in viremic organ tropism.