Miracle-dz/UniFAR-FTUs huggingface dataset:
Good Policies for Bad Governments: Behavioral Political Economy

Politicians and policymakers are prone to the same biases as private citizens. Even if politicians are rational, little suggests that they have altruistic interests. Such concerns lead us to be wary of proposals that rely on benign governments to implement interventionist policies that "protect us from ourselves. " The authors recommend paternalism that recognizes both the promise and threat of activist government. They support interventions that channel behavior without taking away consumers' ability to choose for themselves. Such "benign paternalism" can lead to very dramatic behavioral changes. But benign paternalism does not give government true authority to control our lives and does not give private agents an incentive to reject such authority through black markets and other corrosive violations of the rule of law. The authors discuss five examples of policy interventions that will generate significant welfare gains without reducing consumer liberties. They believe that all policy proposals should be viewed with healthy skepticism. No doctor would prescribe a drug that only worked in theory. Likewise, economic policies should be tested with small-scale field experiments before they are adopted.
Malleable Memories: The Role of Mindsets in Reconstructing History (Manuscript is currently being revised for second review at Journal of Marketing Research)

mindset for individuals with less prior knowledge and a concrete one for those with more. This suggests that when reconstructing memories for past events, construal mindsets might make differential types of information more readily accessible, while prior knowledge influences what information is even available and how it is structured in memory. These two interact to influence retrieval effort, and thus, judgments of temporal distance.
An Integrated Spectrophotometric Survey of Nearby Star-forming Galaxies

We present integrated optical spectrophotometry for a sample of 417 nearby galaxies. Our observations consist of spatially integrated, S/N = 10-100 spectroscopy between 3600 and 6900 Å at ~8 Å FWHM resolution. In addition, we present nuclear (2.″5 × 2.″5) spectroscopy for 153 of these objects. Our sample targets a diverse range of galaxy types, including starbursts, peculiar galaxies, interacting/merging systems, dusty, infrared-luminous galaxies, and a significant number of normal galaxies. We use population synthesis to model and subtract the stellar continuum underlying the nebular emission lines. This technique results in emission-line measurements reliably corrected for stellar absorption. Here we present the integrated and nuclear spectra, the nebular emission-line fluxes and equivalent widths, and a comprehensive compilation of ancillary data available in the literature for our sample. In a series of subsequent papers we use these data to study optical star formation rate indicators, nebular abundance diagnostics, the luminosity-metallicity relation, the dust properties of normal and starburst galaxies, and the star formation histories of infrared-luminous galaxies.
Learning Finite-State Machine Controllers From Motion Capture Data

With characters in computer games and interactive media increasingly being based on real actors, the individuality of an actor's performance should not only be reflected in the appearance and animation of the character but also in the AI that governs the character's behavior and interactions with the environment. Machine learning methods applied to motion capture data provide a way of doing this. This paper presents a method for learning the parameters of a finite-state machine (FSM) controller. The method learns both the transition probabilities of the FSM and also how to select animations based on the current state.
Species-specific effects of the hcf-1 gene on baculovirus virulence

The host cell-specific factor 1 gene (hcf-1) of the baculovirus Autographa californica nuclear polyhedrosis virus (AcMNPV) is required for the efficient replication and/or stability of reporter plasmids carrying an AcMNPV-derived origin of DNA replication in a cell-specific manner; hcf-1 is required for reporter plasmid replication or stability in TN-368 cells, a cell line derived from the cabbage looper Trichoplusia ni, but not in IPLB-SF-21 (SF-21) cells, a cell line derived from the fall armyworm Spodoptera frugiperda (A. Lu and L. K. Miller, J. Virol. 69:6265-6272, 1995). To further define the function of hcf-1, recombinant viruses with null mutations in hcf-1 were constructed in SF-21 cells and the phenotype of the mutants was determined in selected cell lines as well as in insect larvae. In S.frugiperda larvae and SF-21 cells, the phenotype of hcf-1 mutants was indistinguishable from that of wild-type AcMNPV. In T. ni larvae as well as T. ni-derived cell lines, hcf-1 mutants exhibited a mutant phenotype. In TN-368 cells, the replication of hcf-1 mutants was extremely impaired; the phenotype included a defect in viral DNA replication, late gene transcription, and virus production as well as a complete cessation of host and viral protein synthesis. In another cell line derived from T. ni, the BTI-TN5B1-4 cell line, the hcf-1 mutants exhibited a less severe phenotype. In T. ni larvae, the infectivity of the budded form of hcf-1 mutants was decreased significantly (50-fold), although no difference in the oral infectivity of the occluded form was observed. T. ni larvae infected with hcf-1 mutants by either oral or hemocoelic routes, however, died 20 to 30% more slowly than those infected with wild-type AcMNPV. These data indicate that there is a host-specific requirement for hcf-1 and that it exerts cell line-specific effects and possibly tissue-specific effects on the rate at which the virus replicates, thereby affecting the virulence of the virus in a species-specific manner.
Similarity Measurement of Web Sessions by Sequence Alignment

The task of clustering Web sessions is to group Web sessions based on similarity and consists of maximizing the intra-group similarity while minimizing the inter-group similarity. The first and foremost question needed to be considered in clustering Web sessions is how to measure the similarity between Web sessions. However, there are many shortcomings in traditional measurements. This paper analyses the shortcomings of traditional methods and introduces a new method to measure similarities between Web pages, which considers not only the URL but also the viewing time of the visited Web page. Then we propose a new method to measure the similarity of Web sessions using sequence alignment and the similarity of Web page access. Finally, we conclude this paper and propose the future research directions.
Development of Germline-Humanized Antibodies Neutralizing Botulinum Neurotoxin A and B

Botulinum neurotoxins (BoNTs) are counted among the most toxic substances known and are responsible for human botulism, a life-threatening disease characterized by flaccid muscle paralysis that occurs naturally by food poisoning or colonization of the gastrointestinal tract by BoNT-producing clostridia. To date, 7 serologically distinct serotypes of BoNT (serotype A-G) are known. Due to the high toxicity of BoNTs the Centers for Disease Control and Prevention (CDC) have classified BoNTs as category A agent, including the six biological agents with the highest potential risk of use as bioweapons. Well tolerated antibodies neutralizing BoNTs are required to deal with the potential risk. In a previous work, we described the development of scFv and scFv-Fc (Yumab) from macaque origin (Macaca fascicularis) neutralizing BoNT/A and B by targeting the heavy and light chain of each serotype. In the present study, we humanized the macaque antibodies SEM120-IIIC1 (anti-BoNT/A light chain), A1HC38 (anti-BoNT/A heavy chain), BLC3 (anti-BoNT/B light chain) and B2-7 (anti-BoNT/B heavy chain) by germline-humanization to obtain a better potential immunotolerance in humans. We increased the Germinality Index (GI) of SEM120-IIIC1 to 94.5%, for A1HC38, to 95% for BLC3 and to 94.4% for B2-7. Furthermore, the neutralization efficacies of the germline-humanized antibodies were analyzed in lethal and non-lethal in vivo mouse assays as full IgG. The germline-humanized IgGs hu8SEM120-IIIC1, hu8A1HC38, hu8BLC3 and hu8B2-7 were protective in vivo, when anti-heavy and anti-light chain antibodies were combined. The synergistic effect and high humanness of the selected IgGs makes them promising lead candidates for further clinical development.
Preliminary Examination II VCG Redistribution Mechanisms

Mechanism design, originally a subfield of microeconomics that concerns implementing systemic good solutions to problems that involve multiple self-interested agents so as to align their incentives with the objectives of the system designer, is now becoming a standard tool in computer science as more and more computer-related systems and phenomena are understood as interactions between self-interested agents and examined through the lens of economics. A classic result in mechanism design is the well-know VCG mechanism that is efficient, strategyproof, individual rational and runs no deficit. While the VCG mechanism generates high revenue in many settings and is thus highly desired because of it, there are other scenarios where it is desirable to minimize such revenue so as to maximizes the agents’ collective welfare. Although strict budget-balance (i.e. zero VCG revenue) is shown to be impossible to achieve if the other desirable properties of the VCG mechanism are to be maintained [16, 8, 18]. Recent advances, notably a majority of which are from the computer science community [1, 19, 7, 20, 6, 3, 10, 17, 11, 12, 13, 14], demonstrate that a significant fraction of the VCG revenue can be redistributed back to the agents in various settings. In this report, we review three such mechanisms, i.e. the Bailey-Cavallo mechanism [1, 3], the Guo-Conitzer-Moulin mechanism [10, 17], and the optimal-in-expectation linear (OEL) mechanism [12] in a setting called multi-unit single-demand auction, where a set of n agents are interested in allocating m < n identical items among themselves in a way that maximizes their collective welfare. To put things in context, we also give a review of the basic concepts of mechanism design and the VCG mechanism.
A mechanistic model of the S-shaped population growth

The main idea of this note is to show the most basic and purely mechanistic model of population growth, which has been used by us to create models of interspecific competition for verification of the competitive exclusion principle (1, 2). Our logical deterministic individual-based cellular automata model demonstrates a spatio-temporal mechanism of the S-shaped population growth.
Mise en Scene: Converting Scenarios to CSP Traces in Support of Requirements-Based Programming

The "Requirements to Design to Code" (R2D2C) project of NASA's Software Engineering Laboratory is based on inferring a formal specification, currently using Communicating Sequential Processes (CSP), from system requirements supplied in the form of scenarios, a user-friendly medium often used to describe the behavior of computer systems under development. The scenarios are first converted into an intermediate form, CSP traces, from which are derived CSP specifications. This work, called Mise en Scene, defines a new scenario medium (Scenario Notation Language, SNL) suitable for control-dominated systems, coupled with a two-stage process for automatic translation of scenarios to a new trace medium (Trace Notation Language, TNL) which encompasses CSP traces. A survey of the "scenario" concept and a small case study are also presented.
A novel scheme to reduce among-peer-delay for peer-to-peer live streaming

Peer-to-Peer (P2P) live streaming technology has been proved to be one of most successful way to provide live video services over the Internet. Although such approach is very attractive, current provided services could not satisfy all users' Quality of Experience (QoE). Suppose in a small group, when users all watching a live TV program, such as a live soccer game, some peers might saw a goal minutes after other peers. Longer latency among peers would reduce users' interests and causes their dissatisfactions. In this paper, we first introduce our motivation to this problem. Then we formulate this problem and conclude an objective function. After that, a novel centralized algorithm is proposed, but this algorithm needs complete knowledge of the overlay network which cannot be satisfied in reality. So, with the same guiding principles, we proposed a distributed scheme. Preliminary simulation results have shown our distributed scheme performs close to the centralized one, and outperforms other approach.
Efficient near-ML detection for MIMO channels: the sphere-projection algorithm

It is well known that suboptimal detection schemes for MIMO spatial multiplexing systems (equalization-based as well as nulling-and-cancelling detectors) cannot exploit all of the available diversity. We show that this inferior performance is primarily caused by poorly conditioned channel realizations. We then present the novel sphere-projection algorithm (SPA) that is robust to poorly conditioned channels. The SPA is a computationally efficient add-on to standard suboptimal detectors. Simulation results show that the SPA is able to achieve near-ML performance and significantly increased diversity gains. The SPA's computational complexity is comparable to that of nulling-and-cancelling detectors and only a fraction of that of the Fincke-Phost sphere-decoding algorithm for ML detection (Fincke, U. and Phost, M., Math. of Comp., vol.44, p.463-71, 1985).
Residual force based optimization of 8 DOF haptic master device

This paper discusses optimization of the 4 links of an 8 DOF haptic master device in order to minimize dynamics effects of the device on human hand during minimally invasive surgical operation. In minimally invasive surgery, because of limited information from surgical scene, sensation of feedback force and manipulability of device are important factors to be accounted. Therefore, optimization of the device is required for improved efficiency of surgical procedures. To achieve this purpose, physical meaning of a new global performance index is introduced. That index is responsible to minimize the residual force on human hand after implementing the dynamics compensation of the device by a controller.
Kernel Quadratic Discriminant Analysis for Positive Definite and Indefinite Kernels

Kernel methods are well established and successful algorithms for pattern analysis thanks to their mathematical elegance and efficient solutions they provide. Numerous non li ear extensions of pattern recognition techniques have been pro p sed based on the so-called kernel trick. The objective of this paper is twofold. First, we derive an additional kernel tool, namely kernel quadratic discriminant (KQD). We discuss different formulations of KQD based on the regularized kernel Mahalanobis distance in both full and cl assrelated subspaces. Secondly, we propose suitable extensioof kernel linear and quadratic discriminants to indefinite kernels. We provide classifiers that are applicable to kernels definedby any symmetric similarity measure. This is important in practice because problem-suited proximity measures often disobey t he requirement of positive definiteness. As in the traditionalcase, KQD can be advantageous for data with unequal class spreads i n the kernel-induced spaces, which cannot be well separated b y a linear discriminant. We illustrate this on artificial and re al data for both positive definite and indefinite kernels.
Framework for supporting multi-service edge packet processing on network processors

Network edge packet-processing systems, as are commonly implemented on network processor platforms, are increasingly required to support a rich set of services. These multi-service systems are also subjected to widely varying and unpredictable traffic. Current network processor systems do not simultaneously deal well with a variety of services and fluctuating workloads. For example, current methods of worst-case, static provisioning can meet performance requirements for any workload, but provisioning each service for its worst case reduces the total number of services that can be supported. Alternately, profile-driven automatic-partitioning compilers create efficient binaries for multi-service applications for specific workloads but they are sensitive to workload fluctuations. Run-time adaptation is a potential solution to this problem. With run-time adaptation, the mapping of services to system resources can be dynamically adjusted based on the workload. We have implemented an adaptive system that automatically changes the mapping of services to processors, and handles migration of services between different processor core types to match the current workload. In this paper we explain our adaptive system built on the Intelreg IXP2400 network processor. We demonstrate that it outperforms multiple different profile-driven compiled solutions for most workloads and performs within 20% of the optimal compiled solution for the remaining workloads.
How to Model Planning and Scheduling Problems using Timelines

The CNT framework (Constraint Network on Timelines (Verfaillie, Pralet, and Lemaître 2008)) has been designed to model discrete event dynamic systems and the properties one knows, one wants to verify, or one wants to enforce on them. In this paper, after a reminder about the CNT framework, we show its modeling power, first on two generic problems (the planning problem in the STRIPS framework and the resourceconstrained project scheduling problem), then on two specific problems coming from the aerospace domain (the mission management problems for a team of unmanned air vehicles and for an Earth watching and observing satellite).
Designing sensory-substitution devices: Principles, pitfalls and potential1

An exciting possibility for compensating for loss of sensory function is to augment deficient senses by conveying missing information through an intact sense. Here we present an overview of techniques that have been developed for sensory substitution (SS) for the blind, through both touch and audition, with special emphasis on the importance of training for the use of such devices, while highlighting potential pitfalls in their design. One example of a pitfall is how conveying extra information about the environment risks sensory overload. Related to this, the limits of attentional capacity make it important to focus on key information and avoid redundancies. Also, differences in processing characteristics and bandwidth between sensory systems severely constrain the information that can be conveyed. Furthermore, perception is a continuous process and does not involve a snapshot of the environment. Design of sensory substitution devices therefore requires assessment of the nature of spatiotemporal continuity for the different senses. Basic psychophysical and neuroscientific research into representations of the environment and the most effective ways of conveying information should lead to better design of sensory substitution systems. Sensory substitution devices should emphasize usability, and should not interfere with other inter- or intramodal perceptual function. Devices should be task-focused since in many cases it may be impractical to convey too many aspects of the environment. Evidence for multisensory integration in the representation of the environment suggests that researchers should not limit themselves to a single modality in their design. Finally, we recommend active training on devices, especially since it allows for externalization, where proximal sensory stimulation is attributed to a distinct exterior object.
Ensuring data storage security through a novel third party auditor scheme in cloud computing

Cloud computing technology has been looked upon as the next-generation architecture of IT solution. It enables the users to move their data and application software to the network which is different from traditional solutions. Due to this IT services are not under logical, physical and users' controls, it brings many new different security challenges. Ensuring data storage security is one more urgent of them. The representative network architecture for cloud data storage includes a third party auditor which affords trustful authentication for user to operate their data security in cloud. In this paper, we study the problem of data storage security in cloud computing. A novel third party auditor scheme is proposed. The obvious advantage of our scheme is the cloud service provider can offer the functions which were provided by the traditional third party auditor and make it trustful. So it indeed reduces the constitution's complexity in Cloud Computing.
Supporting Information S5 Text. Expanded Overview of the Transition Path Generating Algorithms Used in This Study. Transition Path Methods Details

Here we provide a short review—for reader convenience—of the transition path generating algorithms used in the comparison of sampling methods. We summarize the key aspects of each of the physical models and path generating algorithms to help lay the groundwork for connecting algorithmic/model differences to differences between the respective transition paths that were produced. Overview The sampling methods used to generate paths were selected primarily among those available on publicly accessible servers. DIMS-MD [1, 2] and FRODA [3] trajectories were generated in-house to produce large AdK and DT path ensembles, which was not feasible for the other methods through their web server interfaces. Table 1 summarizes the primary references and web server locations for each method. We urge the reader interested in greater detail to refer to the original articles published on each method for complete descriptions and explanations. DIMS, MDdMD, and GOdMD are all non-deterministic dynamical algorithms that implement importance sampling in the form of a soft-ratcheting Metropolis condition, although MDdMD and GOdMD are hybrid methods that also incorporate additional biasing based on normal mode information derived from coarse-grained potentials. The FRODA algorithm is dynamical and deterministic, but can be made stochastic by turning on a random motion setting that performs a random displacement/rotation of each rigid subunit prior to each step. The five ENM-based methods (counting MENM-SD and MENM-SP separately) are all based on double-well anisotropic network models, but use different approaches to generating a single (mixed) potential, and how they generate a minimum energy path. MAP is unique in that it solves for the path that minimizes the Onsager-Machlup action subject to Brownian dynamics boundary conditions, whereas the other ENMs find steepest descent or saddle point paths. DIMS MD [1, 2] employs an informational criterion to bias a transition toward a target structure. Here we use DIMS MD with the soft ratcheting algorithm together with Langevin dynamics and the Analytical Continuum Electrostatics (ACE) model to generate stochastic MD steps in an implicit solvent bath, as described previously [12]. A 1 fs time step was used with a collision frequency (damping coefficient) of 25 p −1 s. Steps toward the target (measured using heavy-atom rmsd-to-target as the progress variable) are always accepted, while steps increasingly farther away from the target are accepted with decreasing probability according to a Boltzmann distribution of the square of