Miracle-dz/UniFAR-FTUs huggingface dataset:
Equi-Width Data Swapping for Private Data Publication

Data Swapping is a popular value-invariant data perturbation technique. The quality of a data swapping method is measured by how well it preserves data privacy and data utility. As swapping data globally is computationally impractical, to guarantee its performance in these metrics appropriate, localization schemes are often conducted in advance. Equi-depth partitioning is preferred by most of the existing data perturbation techniques as it provides uniform privacy protection for each data tuple. However, this method performs ineffectively for two types of applications: one is to maintain statistics based on equi-width partitioning, such as the multivariate histogram with equal bin width, and the other is to preserve parametric statistics, such as covariance, in the context of sparse data with non-uniform distribution. As a natural solution for the above application, this paper explores the possibility of using data swapping with equi-width partitioning for private data publication, which has been little used in data perturbation due to the difficulty of preserving data privacy. With extensive theoretical analysis and experimental results, we show that, Equi-Width Swapping (EWS)can achieve a similar performance in privacy preservation to that of Equi-Depth Swapping (EDS) if the number of partitions is sufficiently large (e. g. &get;=sqrt(N), where N is the size of dataset). Our experimental results in both synthetic and real-world data validate our theoretical analysis.
Three‐Dimensional Nasolabial Displacement during Movement in Repaired Cleft Lip and Palate Patients

The objective of this study was two‐fold: (1) to explore the suitability of a novel modified Procrustes fit method to adjust data for head motion during instructed facial movements, and (2) to compare the adjusted data among repaired unilateral (n = 4) and bilateral (n = 5) cleft lip and palate patients and noncleft control subjects (n = 50). Using a video‐based tracking system, three‐dimensional displacement of 14 well‐defined nasolabial landmarks was measured during four set facial animations without controlling for head motion. The modified Procrustes fit method eliminated the contributions of head motion by matching the most stable landmarks of each video‐recorded frame of the face during function to frames at rest. Its effectiveness was found to approximate that of a previous method (i.e., use of a maxillary occlusal splint to which stable dentition‐based markers were attached). Data from both the unilateral and bilateral cleft lip and palate patients fell outside the normal range of maximum displacements and of asymmetry, and individual patients demonstrated greater right‐versus‐left asymmetry in maximum displacement than did individual noncleft subjects. It is concluded that the modified Procrustes fit method is fast, is easy to apply, and allows subjects to move the head naturally without the inconvenience of a splint while facial movement data are being collected. Results obtained using this method support the view that facial movements in cleft patients may be severely hampered and that assessment of facial animation should be strongly considered when contemplating surgical lip revisions. (Plast. Reconstr. Surg. 105: 1273, 2000.)
Short-Run Exchange-Rate Dynamics: Theory and Evidence

Recent research has revealed a wealth of information about the microeconomics of currency markets and thus the determination of exchange rates at short horizons. This information is valuable to us as scientists since, like evidence of macroeconomic regularities, it can provide critical guidance for designing exchange-rate models. This paper presents an optimizing model of short-run exchange-rate dynamics consistent with both the micro evidence and the macro evidence, the first such model of which we are aware. With respect to microeconomics, the model is consistent with the institutional structure of currency markets, it accurately reflects the constraints and objectives faced by the major participants, and it fits key stylized facts concerning returns and order flow. With respect to macroeconomics, the model is consistent with most of the major puzzles that have emerged under floating rates.
Arrangement of domains, and amino acid residues required for binding of vascular cell adhesion molecule-1 to its counter-receptor VLA-4 (alpha 4 beta 1)

Interaction of the vascular cell adhesion molecule (VCAM-1) with its counter-receptor very late antigen-4 (VLA-4) (integrin alpha 4 beta 1) is important for a number of developmental pathways and inflammatory functions. We are investigating the molecular mechanism of this binding, in the interest of developing new anti-inflammatory drugs that block it. In a previous report, we showed that the predominant form of VCAM-1 on stimulated endothelial cells, seven-domain VCAM (VCAM-7D), is a functionally bivalent molecule. One binding site requires the first and the other requires the homologous immunoglobulin-like domain. Rotary shadowing and electron microscopy of recombinant soluble VCAM-7D molecules suggests that the seven Ig-like domains are extended in a slightly bent linear array, rather than compactly folded together. We have systematically mutagenized the first domain of VCAM-6D (a monovalent, alternately spliced version mission domain 4) by replacing 3-4 amino acids of the VCAM sequence with corresponding portions of the related ICAM-1 molecule. Specific amino acids, important for binding VLA-4 include aspartate 40 (D40), which corresponds to the acidic ICAM- 1 residue glutamate 34 (E34) previously reported to be essential for binding of ICAM-1 to its integrin counter-receptor LFA-1. A small region of VCAM including D40, QIDS, can be replaced by the similar ICAM- 1 sequence, GIET, without affecting function or epitopes, indicating that this region is part of a general integrin-binding structure rather than a determinant of binding specificity for a particular integrin. The VCAM-1 sequence G65NEH also appears to be involved in binding VLA-4.
Evidence for intermittency and a truncated power law from highly resolved aphid movement data

Power laws are increasingly used to describe animal movement. Despite this, the use of power laws has been criticized on both empirical and theoretical grounds, and alternative models based on extensions of conventional random walk theory (Brownian motion) have been suggested. In this paper, we analyse a large volume of data of aphid walking behaviour (65 068 data points), which provides a highly resolved dataset to investigate the pattern of movement. We show that aphid movement is intermittent—with alternations of a slow movement with frequent change of direction and a fast, relatively directed movement—and that the fast movement consists of two phases—a strongly directed phase that gradually changes into an uncorrelated random walk. By measuring the mean-squared displacement and the duration of non-stop movement episodes we found that both spatial and temporal aspects of aphid movement are best described using a truncated power law approach. We suggest that the observed spatial pattern arises from the duration of non-stop movement phases rather than from correlations in turning angles. We discuss the implications of these findings for interpreting movement data, such as distinguishing between movement and non-movement, and the effect of the range of data used in the analysis on the conclusions.
ON SECRET SHARING SCHEMES WITH EXTENDED CAPABILITIES

Secret sharing allows split control over the secret. Secret parts known as secret shares are distributed to different shareholders (locations). Secret can be recovered upon combination of sufficient number of shares. Research into theoretical foundations, development of widespread applications, as well as, new attacks resulted in great need for extra features of existing schemes. We describe extended capabilities for secret sharing schemes. List of discussed issues contains (but is not limited to): multiple and different size sets of shareholders, schemes activation, multisecret schemes, cheating detection, secret shares renewal/maintaince, missing shares recovery. Next, research results into extended capabilities for Karin-Green-Hellman scheme are presented. We concentrate on Proactive Secret Sharing (PSS) and Publicly Verifiable Secret Sharing (PVSS). Results are in the form of collections of algorithm in pseudocode, that can be easily implemented. Finally, we discuss trade-offs between secret security and extended capabilities.
Minimum-Perturbation Retiming for Delay Optimization

This paper describes a fast retiming algorithm targeting delay while minimizing the number of flip-flops moved. The algorithm can be applied before placement to minimize logic level, or after placement to minimize the critical region annotated with wire delays. Experiments on a suite of industrial benchmarks show that the algorithm improves fMAX by 9% while increasing LUT count by 1% and flip-flop count by 2%, respectively. The runtime penalty is less than 1% of the total runtime of the design flow.
Accounting for Economic Institutions: How Independent Central Banks Affect Democratic Accountability

The economic voting literature emphasizes that complex government structures lead voters to weigh the economy less in their voting calculus. While a number of institutional factors have been considered by the literature, these have largely been institutions that voters can directly punish through electoral mechanisms. However, there are numerous institutions that affect political and economic outcomes that voters have no means of punishing for bad results but that are directly dependent upon the choices of elected officials. In this paper, I consider how economic voting is affected by the level of central bank independence. Building from recent work by Duch and Stevenson (2008), I explore how the ability of politicians to change the institutional context through which their actions affect economic outcomes and, in turn, democratic accountability.
Towards high performance packet processing for 5G

Network Functions Virtualization aims to implement networking functions in the cloud - even the ones working on the user plane. This is envisioned by decomposing today's monolithic devices into smaller functions and re-composing them real-time. This enables flexibility and independent innovation, but may come at a performance price. In this paper we investigate the performance aspects of composing user plane functions. We have developed a prototype for mobile service chaining to experiment with the function call based composition method provided by the Click modular router. The prototype allows flexible management of feature sets, including the support for relocating user chains using context transfer. We provide a thorough performance evaluation, draw conclusions and propose a versatile execution environment, which combines various composition and processing methods in order to achieve high performance packet processing for 5G networks.
Exploring key hackers and cybersecurity threats in Chinese hacker communities

Chinese hacker communities are of interest to cybersecurity researchers and investigators. When examining Chinese hacker communities, researchers and investigators face many challenges, including understanding the Chinese language, detecting variations in topic evolution, and identifying key hackers with their specialty areas. Therefore, we are motivated to develop a framework for analyzing key hackers and emerging threats in Chinese hacker communities. Specifically, we develop a set of topic models for extracting popular topics, tracking topic evolution, and identifying key hackers with their specialty topics. We applied our framework to 19 major Chinese hacker communities. As a result, we identified five major popular topics, including trading, fraud prevention & identification, calling for cooperation, casual chat, and monetizing. Moreover, we found several trends related to new communication channels, new stolen cards of interest, and new operating mechanism. Further, we also found the key hackers in each extracted area. Our work contributes to the cybersecurity literature by providing an advanced and scalable framework for analyzing Chinese hacker communities.
MMConf: an infrastructure for building shared multimedia applications

Computer teleconferencing allows individuals scattered near and far to collaborate in writing a paper, negotiate over a budget spreadsheet, or cooperate in debugging a program. Our project focuses on applications that bring subject matter into a meeting, not on applications-such as voting or brainstorming tools-that aid the meeting process itself. We attempt both to support single-user applications running in the shared environment, and to provide a base for developing inherently shared applications.
Anomaly intrusion detection based on biometrics

In this work we introduce the idea of using behavioral biometrics in intrusion detection applications. We propose a new approach to user profiling, which can be used to detect intrusion without the need for any special hardware implementation and without forcing the user to perform any special actions. The technique is based on using "keystroke dynamics" and "mouse dynamics" biometrics. The profiles computed in this case are more accurate than those obtained through the traditional statistical profiling techniques, since they are based on distinctive biological characteristics of users.
Essential Medicines Availability and Affordability ; A case study of the Top Ten Registered Diseases in Builsa District

The survey was a cross sectional descriptive study, that employed both quantitative and qualitative approaches, following the standardized World Health Organization and Health Action International (WHO/ HAI) methodology (WHO and HAI, 2008a). Price and availability data for 29 medicines were collected from 11 service delivery facilities and 4 private licensed chemical sellers' stores. Medicine prices were compared with international reference prices (IRPs) to obtain a median price ratio. The daily wage of the lowest paid unskilled government worker was used to gauge the affordability of medicines. The mean availability of 29 essential medicines was 64.1% (SD ± 24.1) for all the medicines outlets. The mean availability of 20 essential medicines for the Clinic and Health Centre levels was 85.0 % (SD ± 17) higher than the private Licensed Chemical Sellers 71.3 % (SD ± 35.6). The mean availability of 10 essential medicines for Community Health Services levels was 62.5 % (SD ± 41.1) and lower than the private Licensed Chemical Sellers 77.5 % (SD ± 32.2). Artesunate+Amodiaquine used as first line for malaria treatment was found in 80% of medicine outlets. The prices of medicines to patients were high at the public sector facilities with a comparative Median Price Ratio (MPR) of 1.84 times international reference prices, while that of the private sector was 2.05 times. The average treatment for adult disease conditions was not affordable at 1.67 days' wage, but 0.78 days' wage for a child's disease condition. The availability of essential medicines for the treatment of the top ten diseases of 2009 in the Builsa district is quite acceptable. The average cost of treatment for the common diseases was unaffordable, with the median price ratio of medicines above the acceptable range of 1.5 for public facilities.
A control-structure splitting optimization for GPGPU

Control statements in a GPU program such as loops and branches pose serious challenges for the efficient usage of GPU resources because those control statements will lead to the serialization of threads and consequently ruin the occupancy of GPU, that is, the number of threads running concurrently. Unlike traditional vector processing units that are inside a general purpose processor, the GPU cannot leave the control statements to the CPU because fine-grain statement scheduling between GPU and CPU is impossible. We need an effective method to handle the control statements "just in place" on the GPUs. In this paper, we propose novel techniques to transform control statements so that they can be executed efficiently on GPUs. Our techniques smartly increase code redundancy, which might be deemed as "de-optimization" for CPU, to improve the occupancy of a program on GPU and therefore improve performance. We focus our attention on how common programming structures such as loops and branches decrease the occupancy of single kernels and how to counter that. We demonstrate our optimizations on a synthetic benchmark and a complex parallel algorithm, the Lattice Boltzmann Method (LBM). Our results show that these techniques are very efficient and can lead to an increase in occupancy and a drastic improvement in performance compared to non-split version of the programs.
Tectal neurons signal impending collision of looming objects in the pigeon

Although the optic tectum in non‐mammals and its mammalian homolog, the superior colliculus, are involved in avoidance behaviors, whether and how tectal neurons respond to an object approaching on a collision course towards the animal remain unclear. Here we show by single unit recording that there exist three classes of looming‐sensitive neurons in the pigeon tectal layer 13, which sends looming information to the nucleus rotundus or to the tectopontine system. The response onset time of tau cells is approximately constant whereas that for rho and eta cells depends on the square root of the diameter/velocity ratio of objects looming towards the animal, the cardioacceleration of which is also linearly related to the square root of this ratio. The receptive field of tectal cells is composed of an excitatory center and an inhibitory periphery, and this periphery does not inhibit responses to looming stimuli. These results suggest that three classes of tectal neurons are specified for detecting an object approaching on a collision course towards the animal, and that rho and eta cells may signal early warning of impending collision whereas tau cells initiate avoidance responses at a constant time before collision through the tectopontine system.
ASMOV : Ontology Alignment with Semantic Validation

Numerous ontology alignment algorithms have appeared in the literature in recent years, but only a few make use of the semantics enclosed within the ontologies in order to improve the accuracy. In this paper, we present ASMOV (Automated Semantic Mapping of Ontologies with Validation), a novel algorithm that expands upon the ideas presented by previous systems, while incorporating a semantic validation process. This process acts as a reasoner over the resulting alignment, ensuring that no inconsistencies have been introduced by the system, which increases the accuracy of the system. An implementation of ASMOV is compared to other systems using the benchmark tests of the Ontology Alignment Evaluation Initiative, a consensus for evaluation of ontology alignment systems.
Low-temperature plasma induced melanoma apoptosis by triggering a p53/PIGs/caspase-dependent pathway in vivo and in vitro

The potential antitumor application of low-temperature plasma (LTP) has attracted wide attention from researchers. The mechanism of plasma antitumor action may be related to LTP-induced reactive oxygen and nitrogen species. The aim of this study was to identify the apoptotic effects of plasma on melanoma cells (B16) in vivo and in vitro. For this purpose, a helium atmospheric-pressure plasma jet (APPJ) was used to generate the plasma-activated saline and medium (PAS and PAM). The PAS was injected subcutaneously to treat B16-tumor bearing mice in vivo and the PAM was used to treat B16 cells in vitro. Catalase (CAT) was added into the PAM to degrade H2O2 as the intervention group. The tumor nodules’ weight, cryosections, B16 cell viability, apoptosis, DNA damage, p53 pathway-related protein and the concentration of H2O2 in PAM were detected. The in vivo results showed that PAS could inhibit tumor growth and induce apoptosis. The in vitro results revealed the concentration of H2O2 in the PAM increased as LTP treatment time was longer, while the cell viability decreased as APPJ irradiation time was increased. Flow cytometry results showed that, compared with the control group, all PAM treatment groups showed a higher apoptotic rate. A single cell gel assay and an 8-OHdG assay showed that the PAM could induce DNA damage. A western blotting assay indicated that the PAM could increase the expressions of p53, p53-induced gene 8 protein, PIG3, cytoplasmic cytochrome c, cleaved-caspase-9 and -3. However, CAT could alleviate all these changes effectively. These findings suggested that plasma exerted an apoptotic effect on B16 cells mainly by activating the p53/PIGs/caspase pathway.
Data Games

We define data games as games where gameplay and/or game content is based on real-world data external to the game, and where gameplay supports the exploration of and learning from this data. This concept is discussed in relation to open data, procedural content generation and serious games, and research challenges are outlined. To illustrate the concept, we present six prototype games and content generators of our own making. We also present a tentative taxonomy of actual and potential data games, and situate the described games within this taxonomy.
Ultra-Lightweight Malware Detection of Android Using 2-Level Machine Learning

As Android becoming the most popular smart phone operating system, malicious applications running on the Android platform appears very frequently and poses the major threat to the security of Android. Considering the resources of smart phone are severely limited, a stable, simple and quick malware detection method for Android is indispensable. In this paper, we propose an ultra-lightweight malware detection method which is able to detect unknown malicious Android applications with limited resources. Firstly, a few features are extracted and divided into three sets for every application. Then, these three feature sets are embedded in the corresponding joint vector spaces and we can get apps's feature vectors. After that, feature vectors of every vector space are classified using a machine learning algorithm. Finally, the three classification results are considered as a group and embedded in a new space and classified again. We evaluate our detection with 3427 malicious samples and 1550 benign applications. Experimental results show that our detection approach has a stable performance that the detection accuracy (true-positive rate) is always higher than 98% and the detection procedure costs only 30ms per sample.
LANGUAGE STRUCTURE IN ITS HUMAN CONTEXT : NEW DIRECTIONS FOR THE LANGUAGE SCIENCES IN THE TWENTY-FIRST CENTURY

the sum of individual actions performed by separate persons; in particular, each individual involved must take into consideration the other individual’s beliefs, intentions, and actions in a way that can be described as cooperative. A shared cooperative activity between two individuals can be defi ned in terms of a set of attitudes held by the cooperating individuals and as a way of carrying out the individual action (Bratman 1992 ). Th e attitudes are as follows:
Title Iterative CZT-based frequency offset estimation for frequency-selective channels

In this paper, we present an accurate frequency offset estimation method for frequency-selective channels. Through the iterative use of the chirp z-transform (CZT) algorithm, an accurate frequency offset estimator is proposed, approaching the Cramer-Rao Bound (CRB) even at low signal-to-noise ratio (SNR). Further, the estimation can be achieved within one block of training sequence, thus avoiding the transmission of repetitive known blocks as is usually required in many conventional methods. Meanwhile, the overall complexity is acceptable. More importantly, the CZT operation can utilize the fast Fourier transform (FFT) structure that is favourable for digital signal processor (DSP) implementation. Simulation results show that two or at most three iterations of the CZT computation are sufficient for an accurate frequency offset estimation in the SNR range from 0 dB to 30 dB.