Miracle-dz/UniFAR-FTUs huggingface dataset:
A Survey of Quantum Property Testing

textabstractThe area of property testing tries to design algorithms that can efficiently handle very large amounts of data: given a large object that either has a certain property or is somehow "far" from having that property, a tester should efficiently distinguish between these two cases. In this survey we describe recent results obtained for quantum property testing. This area naturally falls into three parts. First, we may consider quantum testers for properties of classical objects. We survey the main examples known where quantum testers can be much (sometimes exponentially) more efficient than classical testers. Second, we may consider classical testers of quantum objects. This is the situation that arises for instance when one is trying to determine if quantum states or operations do what they are supposed to do, based only on classical input-output behavior. Finally, we may also consider quantum testers for properties of quantum objects, such as states or operations. We survey known bounds on testing various natural properties, such as whether two states are equal, whether a state is separable, whether two operations commute, etc. We also highlight connections to other areas of quantum information theory and mention a number of open questions.
Analysis of disturbance observer based position control system

Robust control is becoming a necessity in almost all control fields. One method to achieve robust control in advanced control system is the two degree-of-freedom (2-DOF) control, in which two control loops will be assigned the performance and robustness goals separately. A Disturbance Observer (DOB), which is used in the designing of robust control systems, is a simpler and efficient tool. The applications of DOB lies mainly in motion control systems, e.g., robotic systems, automation in industries, and locomotives. This paper analyzes the robustness and stability of a robust position control system based on DOB. The Proportional Integral Derivative (PID) controller tuning for the aforementioned applications is an investigative job, because of their nonlinearities and anonymous perturbations, like friction, motor inertia which varies with time and effects of the connected load. A sensible tuning method for the robust PID controller incorporating the aid of DOB is proposed in this paper which can be used for the aforementioned applications and analysis of the design constraints of DOB parameters.
Increase in Complexity and Information through Molecular Evolution

Biological evolution progresses by essentially three different mechanisms: (I) optimization of properties through natural selection in a population of competitors; (II) development of new capabilities through cooperation of competitors caused by catalyzed reproduction; and (III) variation of genetic information through mutation or recombination. Simplified evolutionary processes combine two out of the three mechanisms: Darwinian evolution combines competition (I) and variation (III) and is represented by the quasispecies model, major transitions involve cooperation (II) of competitors (I), and the third combination, cooperation (II) and variation (III) provides new insights in the role of mutations in evolution. A minimal kinetic model based on simple molecular mechanisms for reproduction, catalyzed reproduction and mutation is introduced, cast into ordinary differential equations (ODEs), and analyzed mathematically in form of its implementation in a flow reactor. Stochastic aspects are investigated through computer simulation of trajectories of the corresponding chemical master equations. The competition-cooperation model, mechanisms (I) and (II), gives rise to selection at low levels of resources and leads to symbiontic cooperation in case the material required is abundant. Accordingly, it provides a kind of minimal system that can undergo a (major) transition. Stochastic effects leading to extinction of the population through self-enhancing oscillations destabilize symbioses of four or more partners. Mutations (III) are not only the basis of change in phenotypic properties but can also prevent extinction provided the mutation rates are sufficiently large. Threshold phenomena are observed for all three combinations: The quasispecies model leads to an error threshold, the competition-cooperation model allows for an identification of a resource-triggered bifurcation with the transition, and for the cooperation-mutation model a kind of stochastic threshold for survival through sufficiently high mutation rates is observed. The evolutionary processes in the model are accompanied by gains in information on the environment of the evolving populations. In order to provide a useful basis for comparison, two forms of information, syntactic or Shannon information and semantic information are introduced here. Both forms of information are defined for simple evolving systems at the molecular level. Selection leads primarily to an increase in semantic information in the sense that higher fitness allows for more efficient exploitation of the environment and provides the basis for more progeny whereas understanding transitions involves characteristic contributions from both Shannon information and semantic information.
Fine‐level mycorrhizal specificity in the Monotropoideae (Ericaceae): specificity for fungal species groups

The Monotropoideae (Ericaceae) are nonphotosynthetic angiosperms that obtain fixed carbon from basidiomycete ectomycorrhizal fungi. In previous work, we showed that each plant species is associated with a single genus or a set of closely related genera of ectomycorrhizal fungi. Here we show that the level of specificity is much higher. We used a molecular phylogenetic approach to contrast specificity patterns among eight plant lineages and three fungal genera. We relied on fungal nuclear internal transcribed spacer (nrITS) sequence data obtained from 161 basidiocarps and 85 monotropoid roots representing 286 sampled plants screened using restriction length polymorphisms. From the phylogenetic placement of fungal symbionts in fungal phylograms, we found that three basal (Sarcodes, Pterospora, Pleuricospora) and one derived lineage (Allotropa) of plants target narrow clades of closely related species groups of fungi, and four derived lineages (Monotropa hypopithys species group, Pityopus) target more distant species groups. Within most plant lineages, geography and photobiont association constrain specificity. Specificity extended further in Pterospora andromedea, in which sequence haplotypes at the plastid trn L–F region of 73 plants were significantly associated with different fungal species groups even in sympatry. These results indicate that both the macro‐ and microevolution of the Monotropoideae are tightly coupled to their mycorrhizal symbionts.
Anti-message Logging based Coordinated Checkpointing Protocol for Deterministic Mobile Computing Systems

A checkpoint algorithm for mobile computing systems needs to handle many new issues like: mobility, low bandwidth of wireless channels, lack of stable storage on mobile nodes, disconnections, limited battery power and high failure rate of mobile nodes. These issues make traditional checkpointing techniques unsuitable for such environments. Minimum-process coordinated checkpointing is an attractive approach to introduce fault tolerance in mobile distributed systems transparently. This approach is domino-free, requires at most two checkpoints of a process on stable storage, and forces only a minimum number of processes to checkpoint. But, it requires extra synchronization messages, blocking of the underlying computation or taking some useless checkpoints. In this paper, we propose a minimum-process coordinated checkpointing algorithm for deterministic mobile distributed systems, where no useless checkpoints are taken, no blocking of processes takes place, and anti-messages of very few messages are logged during checkpointing. We try to reduce the loss of checkpointing effort when any process fails to take its checkpoint in coordination with others. We also address the related issues like: failures during checkpointing, disconnections, concurrent initiations of the algorithm.
Process Mining

The deployment of Workflow Management systems is a timeconsuming and error-prone task. A possible solution is process mining, which automatically extracts workflow models from event-data logs. However, the current research in process mining still has problems in mining some common constructs in workflow models. Among these constructs are short loops, which are loops of length one and two. For instance, the α-algorithm was proven to mine sound Structured Workflow nets without short loops. In this paper, we present a new algorithm (the α-algorithm) that can handle short loops, and we prove that it correctly mines all sound Structured Workflow nets. The α-algorithm is based on the α-algorithm and is implemented in the EMiT tool.
WMR navigation using local potential field corridors and narrow local occupancy grid perception

Path planning and control strategies applied to autonomous mobile robots should fulfil safety rules as well as achieve final goals. Trajectory planning applications should be fast and flexible to allow real time implementations as well as environment interactions. The methodology presented uses the on robot information as the meaningful data necessary to plan a narrow passage by using a corridor based on attraction potential fields that approaches the mobile robot to the final desired configuration. It employs local and dense occupancy grid perception to avoid collisions. The key goals of this research project are computational simplicity as well as the possibility of integrating this method with other methods reported by the research community. Another important aspect of this work consist in testing the proposed method by using a mobile robot with a perception system composed of a monocular camera and odometers placed on the two wheels of the differential driven motion system. Hence, visual data are used as a local horizon of perception in which trajectories without collisions are computed by satisfying final goal approaches and safety criteria.
GReTA-A Novel Global and Recursive Tracking Algorithm in Three Dimensions

Tracking multiple moving targets allows quantitative measure of the dynamic behavior in systems as diverse as animal groups in biology, turbulence in fluid dynamics and crowd and traffic control. In three dimensions, tracking several targets becomes increasingly hard since optical occlusions are very likely, i.e., two featureless targets frequently overlap for several frames. Occlusions are particularly frequent in biological groups such as bird flocks, fish schools, and insect swarms, a fact that has severely limited collective animal behavior field studies in the past. This paper presents a 3D tracking method that is robust in the case of severe occlusions. To ensure robustness, we adopt a global optimization approach that works on all objects and frames at once. To achieve practicality and scalability, we employ a divide and conquer formulation, thanks to which the computational complexity of the problem is reduced by orders of magnitude. We tested our algorithm with synthetic data, with experimental data of bird flocks and insect swarms and with public benchmark datasets, and show that our system yields high quality trajectories for hundreds of moving targets with severe overlap. The results obtained on very heterogeneous data show the potential applicability of our method to the most diverse experimental situations.
Cliché-based program editors

A cliche-based program editor supports the construction and modification of programs in terms of standard algorithmic fragments (cliches), as opposed to merely supporting the construction and modification of programs in terms of syntactic or textual units. Three experimental cliche-based program editors have been implemented, exploring the tradeoff between power and speed. The Knowledge-Based Editor in Emacs (KBEmacs) is the most powerful of the three editors. It supports a wide range of editing operations and can represent a wide range of cliches, because it uses an internal representation called plan diagrams, which combines features of flowcharts and data flow schemas
The Olympics and the National Health Service: a definition of health

When a 16-year old Chinese girl, Ye Shiwen, swims at a speed that even the world's best male swimmers struggle to match, and Usain Bolt and his fellow sprinters run like the wind, our minds turn to the limits of human endeavour.1 Health, as the Olympic Games have reminded us, is the purpose of medicine. The World Health Organization's age-old mantra of ‘Health for All’ often seems an abstract slogan since health is a concept we struggle harder to define than disease. Perhaps the definition of health is being in the peak of physical condition that allows an athlete to win an Olympic gold medal? Perhaps it is nothing more than happiness, despite our physical state? If the Olympic Games conjure images of finely honed athletes in our minds, the 2012 Olympic Games will be remembered by health professionals for the way the opening ceremony celebrated the National Health Service (NHS). Dancing doctors and nurses, Great Ormond Street Hospital, a pulse beat that circled the Olympic Stadium, were prominent features of a ‘Best of British’ sequence masterminded by film director Danny Boyle. This was too political a statement for some. A visceral and ideological struggle for the soul of the NHS in 2012 cannot have escaped Boyle, an astute social commentator. Did celebrating the place of the NHS in the nation's psyche support the arguments and the campaign of this year's antireformists? Possibly, but Boyle also reminded of us that along with James Bond, Mr Bean, William Shakespeare, cricket, David Beckham, the Queen and heroic failure, the NHS is a peculiarly British institution. In a planet dominated by insurance-based health systems, the NHS remains an experiment that fascinates the world and provokes fierce and passionate debate within these shores. But the Olympic Games also reminded us that flaws and failure are much more common than success. Perfection is a dream that is rarely achieved. Are humans ever more perfect than the moment of birth? Only one person or team wins a gold medal in any event. Our lives and bodies are flawed. Our organs, dreams and aspirations fail. The NHS is no different. Flaws and failures are ever present; perfection is a dream impossible to achieve. Yet the NHS strives, in its way, for ‘Health for All’ – and that human endeavour might be more fulfilling once health itself is satisfactorily defined.
Transformation of WordNet Glosses into Logic Forms

This paper presents a method and implementation resuits for the transformation of WordNet glosses into logic forms. The glosses, currently expressed in English are a rich source of world knowledge. Logic forms are useful for logic proofs, inference, and many other AI applications. We demonstrate their applicability to a Question Answering system.
Parallel Screening and Activity Profiling with HIV Protease Inhibitor Pharmacophore Models

Parallel Screening has been introduced as an in silico method to predict the potential biological activities of compounds by screening them with a multitude of pharmacophore models. This study presents an early application example employing a Pipeline Pilot-based screening platform for automatic large-scale virtual activity profiling. An extensive set of HIV protease inhibitor pharmacophore models was used to screen a selection of active and inactive compounds. Furthermore, we aimed to address the usually critically eyed point, whether it is possible in a parallel screening system to differentiate between similar molecules/molecules acting on closely related proteins, and therefore we incorporated a collection of other protease inhibitors including aspartic protease inhibitors. The results of the screening experiments show a clear trend toward most extensive retrieval of known active ligands, followed by the general protease inhibitors and lowest recovery of inactive compounds.
The Efficacy of Venlafaxine, Flunarizine, and Valproic Acid in the Prophylaxis of Vestibular Migraine

Background Different types of medications are currently used in vestibular migraine (VM) prophylaxis, although recommendations for use are generally based on expert opinion rather than on solid data from randomized trials. We evaluated the efficacy and safety of venlafaxine, flunarizine, and valproic acid in a randomized comparison trial for VM prophylaxis. Methods Subjects were randomly allocated to one of three groups (venlafaxine group, flunarizine group, and valproic acid group). To assess the efficacy of treatment on vertigo symptoms, the following parameters were assessed at baseline and 3 months after treatment: Dizziness Handicap Inventory (DHI) scores, number of vertiginous attacks in the previous month, and Vertigo Severity Score (VSS). Adverse events also were evaluated. Results A decrease in DHI total scores was shown following treatment with all three medications, with no obvious differences between the groups. Treatment effects differed, however, in the DHI physical, functional, and emotional domains with only venlafaxine showing a decreased effect in all of three domains. Flunarizine and valproic acid showed an effect in only one DHI domain. Venlafaxine and flunarizine showed decreased VSS scores (p = 0 and p = 0.03, respectively). Although valproic acid had no obvious effect on VSS (p = 0.27), decreased vertigo attack frequency was observed in this group (p = 0). Venlafaxine also had an effect on vertigo attack frequency (p = 0), but flunarizine had no obvious effect (p = 0.06). No serious adverse events were reported in the three groups. Conclusion Our data confirm the efficacy and safety of venlafaxine, flunarizine, and valproic acid in the prophylaxis of VM, venlafaxine had an advantage in terms of emotional domains. Venlafaxine and valproic acid also were shown to be preferable to flunarizine in decreasing the number of vertiginous attacks, but valproic acid was shown to be less effective than venlafaxine and flunarizine to decrease vertigo severity. Trial registration ChiCTR-OPC-17011266 (http://www.chictr.org.cn/).
Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks

Between 1998 and 2004, the planning community has seen vast progress in terms of the sizes of benchmark examples that domain-independent planners can tackle successfully. The key technique behind this progress is the use of heuristic functions based on relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. The unprecedented success of such methods, in many commonly used benchmark examples, calls for an understanding of what classes of domains these methods are well suited for. In the investigation at hand, we derive a formal background to such an understanding. We perform a case study covering a range of 30 commonly used STRIPS and ADL benchmark domains, including all examples used in the first four international planning competitions. We prove connections between domain structure and local search topology – heuristic cost surface properties – under an idealized version of the heuristic functions used in modern planners. The idealized heuristic function is called h + , and differs from the practically used functions in that it returns the length of an optimal relaxed plan, which is NP-hard to compute. We identify several key characteristics of the topology under h + , concerning the existence/non-existence of unrecognized dead ends, as well as the existence/non-existence of constant upper bounds on the difficulty of escaping local minima and benches. These distinctions divide the (set of all) planning domains into a taxonomy of classes of varying h + topology. As it turns out, many of the 30 investigated domains lie in classes with a relatively easy topology. Most particularly, 12 of the domains lie in classes where FF’s search algorithm, provided with h + , is a polynomial solving mechanism. We also present results relating h + to its approximation as implemented in FF. The behavior regarding dead ends is provably the same. We summarize the results of an empirical investigation showing that, in many domains, the topological qualities of h + are largely inherited by the approximation. The overall investigation gives a rare example of a successful analysis of the connections between typical-case problem structure, and search performance. The theoretical investigation also gives hints on how the topological phenomena might be automatically recognizable by domain analysis techniques. We outline some preliminary steps we made into that direction.
Initial-On ESD Protection Design with PMOS-Triggered SCR Device

A novel SCR design with "initial-on" function is proposed to achieve the lowest trigger voltage and the fastest turn-on speed of SCR device for effective on-chip ESD protection. Without using the special native device or any process modification, this initial-on design is implemented by PMOS-triggered SCR device, which can be realized in general CMOS processes. This initial-on SCR design also presents a high enough holding voltage to avoid latchup issue. The new proposed initial-on ESD protection design with PMOS-triggered SCR device has been successfully verified in a 0.25-mum CMOS process
A Highly Miniaturized, Wireless Inertial Measurement Unit for Characterizing the Dynamics of Pitched Baseballs and Softballs

Baseball and softball pitch types are distinguished by the path and speed of the ball which, in turn, are determined by the angular velocity of the ball and the velocity of the ball center at the instant of release from the pitcher's hand. While radar guns and video-based motion capture (mocap) resolve ball speed, they provide little information about how the angular velocity of the ball and the velocity of the ball center develop and change during the throwing motion. Moreover, mocap requires measurements in a controlled lab environment and by a skilled technician. This study addresses these shortcomings by introducing a highly miniaturized, wireless inertial measurement unit (IMU) that is embedded in both baseballs and softballs. The resulting “ball-embedded” sensor resolves ball dynamics right on the field of play. Experimental results from ten pitches, five thrown by one softball pitcher and five by one baseball pitcher, demonstrate that this sensor technology can deduce the magnitude and direction of the ball's velocity at release to within 4.6% of measurements made using standard mocap. Moreover, the IMU directly measures the angular velocity of the ball, which further enables the analysis of different pitch types.