Miracle-dz/UniFAR-FTUs huggingface dataset:
Symbolic execution for software testing in practice: preliminary assessment

We present results for the "Impact Project Focus Area" on the topic of symbolic execution as used in software testing. Symbolic execution is a program analysis technique introduced in the 70s that has received renewed interest in recent years, due to algorithmic advances and increased availability of computational power and constraint solving technology. We review classical symbolic execution and some modern extensions such as generalized symbolic execution and dynamic test generation. We also give a preliminary assessment of the use in academia, research labs, and industry.
Dynamic RWA based on the combination of mobile agents technique and genetic algorithm in WDM networks with sparse wavelength conversion

In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithm. By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously update the routing tables, the new hybrid algorithm has the ability to promptly determine the first population of routes for a new request based on the routing table of its source node without requiring the time consuming process associated with the available GA-based dynamic RWA algorithms. To achieve a good load balance in WDM networks with sparse wavelength conversion, we adopt in our hybrid algorithm a new reproduction scheme and a new fitness function that simultaneously takes into account the path length, number of free wavelengths and wavelength conversion capability in route selection. Our new algorithm has the capabilities of achieving a better load balance and resulting a significantly lower blocking probability than that of the promising fixed-alternate routing algorithm for both the optical networks with sparse and full-range wavelength converters and the optical networks with sparse and limited-range wavelength converters, as verified by an extensive simulation study upon the ns-2 network simulator. The ability to guarantee both a low blocking probability and a small setup delay makes the new hybrid dynamic RWA algorithm very attractive for both the optical circuit switching networks and future optical burst switching networks.
Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding

A hybrid evolutionary algorithm using scalable encoding method for path planning is proposed in this paper. The scalable representation is based on binary tree structure encoding. To solve the problem of hybrid genetic algorithm and particle swarm optimization, the “dummy node” is added into the binary trees to deal with the different lengths of representations. The experimental results show that the proposed hybrid method demonstrates using fewer turning points than traditional evolutionary algorithms to generate shorter collision-free paths for mobile robot navigation.
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web

We present a novel combination of disjunctive programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive programs and description logics, which guarantees the decidability of the resulting formalism without assuming syntactic restrictions. We show that the new formalism has very nice semantic properties. In particular, it faithfully extends both disjunctive programs and description logics. Furthermore, we describe algorithms for reasoning in the new formalism, and we give a precise picture of its computational complexity. We also define the well-founded semantics for the normal case, where normal programs are combined with tractable description logics, and we explore its semantic and computational properties. In particular, we show that the well-founded semantics approximates the answer set semantics. We also describe algorithms for the problems of consistency checking and literal entailment under the well-founded semantics, and we give a precise picture of their computational complexity. As a crucial property, in the normal case, consistency checking and literal entailment under the well-founded semantics are both tractable in the data complexity, and even first-order rewritable (and thus can be done in LogSpace in the data complexity) in a special case that is especially useful for representing mappings between ontologies.
A Comparative Analysis of K-Means Clustering Algorithm and Expectation-Maximation (EM) for Classification of Grain Rice

Abstrak Â Penelitian ini mengamati perbandingan klasifikasi butir beras menggunakan algoritma K- means clustering dan Expectation-Maximation . Jenis beras yang digunakan dalam penelitian ini adalah butir beras Taiwan dan butir beras Thailand. Hal ini dilakukan menggunakan pengenalan pola unsupervised dengan mengidentifikasi panjang dan lebar dari kedua jenis butir beras tersebut, yaitu beras Taiwan CNS grade 1 dan beras Thailand Thai Hom Mali g rade A. Hasil analisis menunjukkan kedua metode tersebut memberikan hasil yang hampir sama dalam pengelompokan kedua jenis beras tersebut. Â Kata kunci : pengelompokan K- means , pengenalan pola unsupervised Â Â Abstract Â This study observed the comparison of rice grain classification using K-means clustering algorithm and Expectation-Maximation Algorithm. This research us es Taiwan ese rice grain and Thai rice grain. The study was performed using the unsupervised pattern recognition by identifying the length and width of two different rice grains, which are CNS Taiwan rice Grade 1 (Taiwan ese rice) and Thai Hom Mali Rice Grade A (Thai rice). The analysis result shows these two methods have a similar result in clustering the two kinds of rice grains. Â Key words : k-means clustering, unsupervised pattern recognition.
A Measure of Landscapes

This paper introduces a statistical fitness landscape analysis, based on Weinberger's random walk method and on a time series analysis known as the Box-Jenkins approach, to measure and express the correlation structure of fitness landscapes. The analysis has some additions to and advantages over previous methods for measuring this structure. The analysis is demonstrated on fitness landscapes constructed with Kauffman's NK-model, using two operators (point mutation and a form of crossover) and a combination of the two. Furthermore, the predictive value of the method is shown.
3D Tracking in Industrial Scenarios: A Case Study at the ISMAR Tracking Competition

One of the more challenging tasks in augmented reality is to develop a tracking system for the industrial scenario. It is due the fact that this environment has characteristics that defy most of the techniques available, such as texture less objects that in some case are too large and in others are very small. This work proposes the combination of established techniques for 3D reconstruction and tracking, as well as a calibration routine, that is suitable for this type of scenario. This complete tracking system was evaluated in the ISMAR Tracking Competition, a contest that simulates industrial scenarios and is promoted to test state of the art trackers. The system presented good results in the competition and a discussion regarding its performance is lodged, aiming to introduce an analysis that could help others during the development of their own tracking system for industrial scenario.
Processing transactions over optimistic atomic broadcast protocols

Atomic broadcast primitives allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, scalable applications on top of atomic broadcast primitives. A new approach has been proposed which, based on optimistic assumptions about the communication system, reduces the average delay for message delivery. We develop this idea further and present a replicated database architecture that employs the new atomic broadcast primitive in such a way that the coordination phase of the atomic broadcast is fully overlapped with the execution of transactions, providing high performance without relaxing transaction correctness.
Sz.-Nagy–Foias theory and Lax–Phillips type semigroups in the description of quantum mechanical resonances

A quantum mechanical version of the Lax–Phillips scattering theory was recently developed. This theory is a natural framework for the description of quantum unstable systems. However, since the spectrum of the generator of evolution in this theory is unbounded from below, the existing framework does not apply to a large class of quantum mechanical scattering problems. It is shown in this work that the fundamental mathematical structure underlying the Lax–Phillips theory, i.e., the Sz. -Nagy–Foias theory of contraction operators on Hilbert space, can be used for the construction of a formalism in which models associated with a semibounded spectrum may be accomodated.
Epstein-Barr virus transformation of cryopreserved lymphocytes: prolonged experience with technique.

We wish to support Louie and King's (1991) comment, published in the March 1991 issue of the Journal, that one can successfully transform frozen lymphocytes to long-term cell lines by using Epstein-Barr virus (EBV). With slight modification, the basic method described in their letter has been used successfully in our laboratory since 1987. We have established nearly 2,900 lymphoblastoid cell lines by EBV transformation, about 600 of these from frozen lymphocytes. The success rates using freshly isolated versus previously frozen lymphocytes are similar, both approximating 97% in our hands. We feel that freezing has two advantages -it can be accomplished at sites distant from the transformation laboratory, and it allows the preservation of potentially important material with a lesser commitment of resources. However, once we are committed to a specific project, we generally prefer to go to direct transformationbecause we will always freeze aliquots at the end, and this avoids one freezing step. We have excellent success in developing cell lines from live cells that have been sent to us from as far away as Israel and that have been as long as 3 d in transit. The method we use is based on those of Miller and Lipman (1973) and Anderson and Gusella (1984) and is adapted to suit our laboratory's purposes. We can identify the following as ways in which our method differs from that described by Louie and King: (1) direct separation on a density gradient without first isolating the buffy coat, to save time; (2) washing the lymphocytes only twice and at lower speeds, to be less harsh on the cells; (3) using cyclosporin A in the transformation step, rather than PHA-P; and (4) using a controlled-rate cell freezer (Cryomed model 700A) for a more consistent and accurate rate of freezing, giving a better rate of recovery of the frozen cells.
Mechanisms determining structural changes during the extratropical transition of Typhoon Sinlaku (2008): a modelling study

The transition from a tropical cyclone into an extratropical cyclone occurs worldwide several times per year. This so-called extratropical transition is often associated with high impact weather. At the same time the complexity of the structural changes makes it difficult for models to adequately forecast the development. In September 2008, Typhoon Sinlaku moved along the coast of Japan and re-intensified as a tropical cyclone shortly before it underwent extratropical transition. The structural changes of this typhoon are analyzed based on a unique measurement dataset and simulations from a numerical weather prediction model. Besides, several meteorological tools are used to analyze the dynamical processes that caused the structural changes of Sinlaku.
A phosphatidylinositol (4,5)-bisphosphate binding site within μ2-adaptin regulates clathrin-mediated endocytosis

The clathrin adaptor complex AP-2 serves to coordinate clathrin-coated pit assembly with the sorting of transmembrane cargo proteins at the plasmalemma. How precisely AP-2 assembly and cargo protein recognition at sites of endocytosis are regulated has remained unclear, but recent evidence implicates phosphoinositides, in particular phosphatidylinositol (4,5)-bisphosphate (PI[4,5]P2), in these processes. Here we have identified and functionally characterized a conserved binding site for PI(4,5)P2 within μ2-adaptin, the medium chain of the clathrin adaptor complex AP-2. Mutant μ2 lacking a cluster of conserved lysine residues fails to bind PI(4,5)P2 and to compete the recruitment of native clathrin/AP-2 to PI(4,5)P2-containing liposomes or to presynaptic membranes. Moreover, we show that expression of mutant μ2 inhibits receptor-mediated endocytosis in living cells. We suggest that PI(4,5)P2 binding to μ2-adaptin regulates clathrin-mediated endocytosis and thereby may contribute to structurally linking cargo recognition to coat formation.
The Paradyn Parallel Performance Measurement Tools

Paradyn is a performance measurement tool for parallel and distributed programs. Paradyn uses several novel technologies so that it scales to long running programs and large systems, and automates much of the search for performance bottlenecks. Paradyn is based on a dynamic notion of performance instrumentation and measurement. Application programs are placed into execution and then performance instrumentation is inserted into the running programs and modified during execution. Paradyn’s Performance Consultant module automatically directs the placement of instrumentation. The Performance Consultant has a well-defined notion of performance bottlenecks and program structure, so that it can associate bottlenecks with specific causes and specific parts of a program. Paradyn controls its instrumentation overhead by monitoring the cost of its data collection, limiting its instrumentation to a (user controllable) threshold. Paradyn’s instrumentation can easily be configured to accept new operating system, hardware, and application specific performance data. Paradyn also provides an open interface for performance visualization and a simple programming library to allow these visualizations to interface to Paradyn. Paradyn can gather and present performance data in terms of high-level parallel languages (such as data parallel Fortran) and can measure programs on massively parallel computers, workstation clusters, and heterogeneous combinations of these systems. hhhhhhhhhhhhhhhhhh † Current address: Computer Science Department, University of Maryland, College Park, MD 20742 This work is supported in part by Wright Laboratory Avionics Directorate, Air Force Material Command, USAF, under grant F33615-94-1-1525 (ARPA order no. B550), NSF Grants CCR-9100968 and CDA-9024618, Department of Energy Grant DE-FG02-93ER25176, and Office of Naval Research Grant N00014-89-J-1222. Hollingsworth was supported in part by an ARPA Graduate Fellowship in High Performance Computing. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the Wright Laboratory Avionics Directorate or the U.S. Government
Modeling XP Refactoring Using Random Graphs

This paper describes a random graph based model to represent an object oriented software system. The system is represented as a graph made of a set of nodes and a set of arcs with given crossing probabilities. The model provides also the representation of the refactoring process as a random propagation through the graph. Empirical data taken by real software projects are used for a first validation of the approach.
Statistical Methods in Psychology Journals: Guidelines and Explanations

In the light of continuing debate over the applications of significance testing in psychology journals and following the publication of Cohen's (1994) article, the Board of Scientific Affairs (BSA) of the American Psychological Association (APA) convened a committee called the Task Force on Statistical Inference (TFSI) whose charge was "to elucidate some of the controversial issues surrounding applications of statistics including significance testing and its alternatives; alternative underlying models and data transformation; and newer methods made possible by powerful computers" (BSA, personal communication, February 28, 1996). Robert Rosenthal, Robert Abelson, and Jacob Cohen (cochairs) met initially and agreed on the desirability of having several types of specialists on the task force: statisticians, teachers of statistics, journal editors, authors of statistics books, computer experts, and wise elders. Nineindividuals were subsequently invited to join and all agreed. These were Leona Aiken, Mark Appelbaum, Gwyneth Boodoo, David A. Kenny, Helena Kraemer, Donald Rubin, Bruce Thompson, Howard Wainer, and Leland Wilkinson. In addition, Lee Cronbach, Paul Meehl, Frederick Mosteller and John Tukey served as Senior Advisors to the Task Force and commented on written materials.
Action Recognition Using Three-Way Cross-Correlations Feature of Local Moton Attributes

This paper proposes a spatio-temporal feature using three-way cross-correlations of local motion attributes for action recognition. Recently, the cubic higher-order local auto-correlations (CHLAC) feature has been shown high classification performances for action recognition. In previous researches, CHLAC feature was applied to binary motion image sequences that indicates moving or static points. However, each binary motion image lost informations about the type of motion such as timing of change or motion direction. Therefore, we can improve the classification accuracy further by extending CHLAC to multivalued motion image sequences that considered several types of local motion attributes. The proposed method is also viewed as an extension of popular bag-of-features approach. Experimental results using two datasets shows proposed method outperformed CHLAC features and bag-of-features approach.
Fixed-Dose Combination Treatment After Stroke for Secondary Prevention in China: A National Community-Based Study

Background and Purpose— There is evidence and international consensus on the advantages and potential of a polypill for established cardiovascular disease patients to improve adherence in the secondary prevention of cardiovascular disease. This study aimed to estimate the numbers of stroke patients who would be eligible for the polypill strategy in China, and the suitable composition of a polypill, based on data of the China National Stroke Prevention Project. Methods— A total of 717 620 residents aged ≥40 years from 6 Chinese representative provinces were screened for prevalent stroke from 2011 to 2012 with an 84.4% response rate. Participants with a history of stroke received further investigation of risk factors and treatments. The potential need for treatment was classified according to the guidelines. Rates were standardized using the population composition of the Sixth National Population Census of China. Results— The standardized prevalence rate of stroke was 1.9%. Up to 93.1% of stroke patients were eligible for a polypill containing at least 2 types of medications, with 75.3% eligible for a statin and antiplatelet agent and 70.6% for antihypertensive and antiplatelet medications. Considering 3 therapies, 54% were eligible for antihypertensive, statin, and antiplatelet medications. The current treatment rate with all required combinations of separate pills was only 6.9%. Conclusions— A huge number of stroke patients in China require preventive therapy and would be eligible for a polypill. This study indicates that it would be reasonable to consider and assess the value of a polypill strategy to improve secondary prevention of stroke in China.
Optimal control for whole-body motion generation using center-of-mass dynamics for predefined multi-contact configurations

Multi-contact motion generation is an important problem in humanoid robotics because it generalizes bipedal locomotion and thus expands the functional range of humanoid robots. In this paper, we propose a complete solution to compute a fully-dynamic multi-contact motion of a humanoid robot. We decompose the motion generation by computing first a dynamically-consistent trajectory of the center of mass of the robot and finding then the whole-body movement following this trajectory. A simplified dynamic model of the humanoid is used to find optimal contact forces as well as a kinematic feasible center-of-mass trajectory from a predefined series of contacts. We demonstrate the capabilities of the approach by making the real humanoid robot platform HRP-2 climb stairs with the use of a handrail. The experimental study also shows that utilization of the handrail lowers the power consumption of the robot by 25% compared to a motion, where only the feet are used.
Discrimination prevention in data mining for intrusion and crime detection

Automated data collection has fostered the use of data mining for intrusion and crime detection. Indeed, banks, large corporations, insurance companies, casinos, etc. are increasingly mining data about their customers or employees in view of detecting potential intrusion, fraud or even crime. Mining algorithms are trained from datasets which may be biased in what regards gender, race, religion or other attributes. Furthermore, mining is often outsourced or carried out in cooperation by several entities. For those reasons, discrimination concerns arise. Potential intrusion, fraud or crime should be inferred from objective misbehavior, rather than from sensitive attributes like gender, race or religion. This paper discusses how to clean training datasets and outsourced datasets in such a way that legitimate classification rules can still be extracted but discriminating rules based on sensitive attributes cannot.
Occludin: a novel integral membrane protein localizing at tight junctions

Recently, we found that ZO-1, a tight junction-associated protein, was concentrated in the so called isolated adherens junction fraction from the liver (Itoh, M., A. Nagafuchi, S. Yonemura, T. Kitani-Yasuda, Sa. Tsukita, and Sh. Tsukita. 1993. J. Cell Biol. 121:491-502). Using this fraction derived from chick liver as an antigen, we obtained three monoclonal antibodies specific for a approximately 65-kD protein in rats. This antigen was not extractable from plasma membranes without detergent, suggesting that it is an integral membrane protein. Immunofluorescence and immunoelectron microscopy with these mAbs showed that this approximately 65-kD membrane protein was exclusively localized at tight junctions of both epithelial and endothelial cells: at the electron microscopic level, the labels were detected directly over the points of membrane contact in tight junctions. To further clarify the nature and structure of this membrane protein, we cloned and sequenced its cDNA. We found that the cDNA encoded a 504-amino acid polypeptide with 55.9 kDa. A search of the data base identified no proteins with significant homology to this membrane protein. A most striking feature of its primary structure was revealed by a hydrophilicity plot: four putative membrane-spanning segments were included in the NH2-terminal half. This hydrophilicity plot was very similar to that of connexin, an integral membrane protein in gap junctions. These findings revealed that an integral membrane protein localizing at tight junctions is now identified, which we designated as "occludin. "