gebhart/patrepeval huggingface dataset:
A New Biometric Modality Based on Conjunctival Vasculature (2006)

A new biometric indicator based on the patterns of conjunctival vasculature is proposed. Conjunctival vessels can be observed on the visible part of the sclera that is exposed to the outside world. These vessels demonstrate rich and specific details in visible light, and can be easily photographed using a regular digital camera. In this paper we discuss methods for conjunctival imaging, preprocessing, and feature extraction in order to derive a suitable conjunctival vascular template for biometric authentication. Commensurate classification methods along with the observed accuracy are discussed. Experimental results suggest the potential of using conjunctival vasculature as a biometric measure.
AN APPROACHTO TOPOLOGYMANAGEMENTIN DIRECTIONAL NETWORKS (2008)

Narrow-beam directional antennas can provide enorn10US gains in data rate, range, power expenditure, and spatial re-use. When ranges extend to hundreds of ldlon1eters, there can be thousands ofnodes in con1n1unications range. Since directional networks tend to incur an overhead cost per link, someprocess n1ust select the potential neighbors to which a node actuall)) links and are therefore reported as neighbors to the routing protocol. This process is 'mown as topology managelnent. rr the purpose is to reduce the number of links, the key question is ~vhat criteria are used to select them. In this paper, we propose a n1atrix n10del that allows network managers to define pair~vise standards for throughput, delay, and path redundancy. In the context of a Time Division Multiple Access systen1, ourproposedobjective is to n1eet the spec(jied standards vvith the minimum nll1nber oflinks and time slot utilization, in order to meet second­ order design objectives. rr these standards matrices are periodically (but rarely) distributed, the network can work towards a common set ofprecisely defined pel:rorn1ance objectives. We provide an example of an algorithm that can exploit this information to rapidly and scalably converge on a solution vvith lninimal additional messaging overhead.
Using PQ Structures for Genomic Rearrangement Phylogeny (2006)

Various international efforts are underway to catalog the genomic similarities and variations in the human population. Some key discoveries such as inversions and transpositions within the members of the species have also been made over the years. The task of constructing a phylogeny tree of the members of the same species, given this knowledge and data, is an important problem. In this context, a key observation is that the "distance" between two members, or member and ancestor, within the species is small. In this paper, we pose the tree reconstruction problem exploiting some of these peculiarities. The central idea of the paper is based on the notion of minimal consensus PQ tree T of sequences. We use a modified PQ structure (termed oPQ) and show that both the number and size of each T is O(1). We further show that the tree reconstruction problem is statistically well-defined (Theorem 7) and give a simple scheme to construct the phylogeny tree and the common ancestors. Our preliminary experiments with simulated data look very promising.
Bilinear spatiotemporal basis models (2012)

A variety of dynamic objects, such as faces, bodies, and cloth, are represented in computer graphics as a collection of moving spatial landmarks. Spatiotemporal data is inherent in a number of graphics applications including animation, simulation, and object and camera tracking. The principal modes of variation in the spatial geometry of objects are typically modeled using dimensionality reduction techniques, while concurrently, trajectory representations like splines and autoregressive models are widely used to exploit the temporal regularity of deformation. In this article, we present the bilinear spatiotemporal basis as a model that simultaneously exploits spatial and temporal regularity while maintaining the ability to generalize well to new sequences. This factorization allows the use of analytical, predefined functions to represent temporal variation (e.g., B-Splines or the Discrete Cosine Transform) resulting in efficient model representation and estimation. The model can be interpreted as representing the data as a linear combination of spatiotemporal sequences consisting of shape modes oscillating over time at key frequencies. We apply the bilinear model to natural spatiotemporal phenomena, including face, body, and cloth motion data, and compare it in terms of compaction, generalization ability, predictive precision, and efficiency to existing models. We demonstrate the application of the model to a number of graphics tasks including labeling, gap-filling, denoising, and motion touch-up.
AVIO (2006)

Concurrency bugs are among the most difficult to test and diagnose of all software bugs. The multicore technology trend worsens this problem. Most previous concurrency bug detection work focuses on one bug subclass, data races, and neglects many other important ones such as atomicity violations, which will soon become increasingly important due to the emerging trend of transactional memory models.This paper proposes an innovative, comprehensive, invariantbased approach called AVIO to detect atomicity violations. Our idea is based on a novel observation called access interleaving invariant, which is a good indication of programmers' assumptions about the atomicity of certain code regions. By automatically extracting such invariants and detecting violations of these invariants at run time, AVIO can detect a variety of atomicity violations.Based on this idea, we have designed and built two implementations of AVIO and evaluated the trade-offs between them. The first implementation, AVIO-S, is purely in software, while the second, AVIO-H, requires some simple extensions to the cache coherence hardware. AVIO-S is cheaper and more accurate but incurs much higher overhead and thus more run-time perturbation than AVIOH. Therefore, AVIO-S is more suitable for in-house bug detection and postmortem bug diagnosis, while AVIO-H can be used for bug detection during production runs.We evaluate both implementations of AVIO using large realworld server applications (Apache and MySQL) with six representative real atomicity violation bugs, and SPLASH-2 benchmarks. Our results show that AVIO detects more tested atomicity violations of various types and has 25 times fewer false positives than previous solutions on average.
LDPC-coded BICM-ID with Nonuniform Signaling for Ultra-High-Speed Optical Transport (2015)

An LDPC coded BICM-ID scheme with nonuniform signaling is proposed, which is designed by mapping a variable-length prefix code onto the constellation. By using the Huffman procedure, prefix code is designed to approach the optimal performance. We demonstrate that proposed nonuniform signaling scheme outperforms LDPC-coded 8-QAM by at least 0.8 dB.
The Foresighted Driver Model (2015)

The Intelligent Driver Model (IDM) is a microscopic, time continuous car following model for the simulation of freeway and urban traffic. Its popularity is grounded in its simplicity and its capacity to describe both single vehicle velocity profiles as well as collective traffic behavior. Nevertheless, it lacks a series of properties that would be desirable for more realistic agent models. In this paper, as an alternative and improvement to the IDM, we propose the Foresighted Driver Model (FDM), which assumes that a driver acts in a way that balances predictive risk (e.g. due to possible collisions along its route) with utility (e.g. the time required to travel, smoothness of ride, etc.). Based on a risk concept developed for full behavior planning, we introduce driver model equations from the assumption that a driver will mainly try to avoid risk maxima in time and space. We show how such a model can be used to simulate driving behavior similar to full behavior planning models and which generalizes and reaches beyond the IDM modeling scenarios.
Blind spreading factor detectors for DS-CDMA receivers. Part I: autocorrelation based detectors (2003)

The spreading factor (SF) in a code-division multiple-access system depends on the data rate of the user, and can therefore be unknown a priori for a communication receiver. A blind spreading factor detection problem is formulated. Suboptimal autocorrelation based SF detectors with different decision rules are analyzed and derived to find simple and robust detectors for practical communication receivers. The analysis is based on finding the statistics of the decision variable and then matching the decision rule to that.
Towards optimised size distribution in commercial microfibrillated cellulose: a fractionation approach (2018)

For the successful commercialisation of microfibrillated cellulose (MFC) it is of utmost importance to carefully characterise the constituent cellulose particles. This could for instance lead to the development of MFC grades with size distributions tailored for specific applications. Characterization of MFC is challenging due to the heterogeneous chemical and structural nature of MFC. This study describes a fractionation approach that combines two steps of physical sieving of larger particles and a final centrifugation step to separate out the smallest, colloidally stable particles, resulting in four distinctly different size fractions. The properties, such as size and charge, of each fraction were studied, as well as MFC filtration time, film formation, and film properties (mechanical and optical). It was found that virtually all surface charges, determined by polyelectrolyte adsorption, are located in the colloidally stable fraction of the MFC. In addition, the amount of available surface charges can be used as an estimate of the degree of fibrillation of the MFC. The partly fibrillated particles frequently displayed a branching, fringed morphology. Mechanical testing of films from the different fractions revealed that the removal of large particles may be more important for strength than achieving full fibrillation. Overall, this study demonstrates that by controlling the size distribution in MFC grades, property profiles including dewatering time to make films by filtration, rheology, film strength and optical transmittance could be optimised.
Photonic RF-receiver based on all-optical down-conversion in an optomechanical oscillator (2008)

We present a photonic RF down-converter based on optomechanical oscillation in a silica microtoroid. Preliminary results show that the optomechanical oscillator can simultaneously serve as mixer and local oscillator in photonic RF-receiver architectures.
T-Cell Epitope Mapping of the Three Most Abundant Extracellular Proteins of<i>Mycobacterium tuberculosis</i>in Outbred Guinea Pigs (1999)

The three most abundant extracellular proteins of Mycobacterium tuberculosis, the 30-, 32-, and 16-kDa major extracellular proteins, are particularly promising vaccine candidates. We have mapped T-cell epitopes of these three proteins in outbred guinea pigs by immunizing the animals with each protein and assaying splenic lymphocyte proliferation against a series of overlapping synthetic peptides covering the entire length of the mature proteins. The 30-kDa protein contained nine immunodominant epitopes, the 32-kDa protein contained two immunodominant epitopes, and the 16-kDa protein contained a highly immunodominant region at its N terminus. The immunodominant epitopes of the 30- and 32-kDa proteins in outbred guinea pigs were frequently identified in healthy purified-protein-derivative-positive or BCG-vaccinated individuals in previous studies. The immunodominant epitopes of these major extracellular proteins have potential utility in an epitope-based vaccine against tuberculosis.
S2E (2011)

This paper presents S2E, a platform for analyzing the properties and behavior of software systems. We demonstrate S2E's use in developing practical tools for comprehensive performance profiling, reverse engineering of proprietary software, and bug finding for both kernel-mode and user-mode binaries. Building these tools on top of S2E took less than 770 LOC and 40 person-hours each.
Operational Space Control: A Theoretical and Empirical Comparison (2008)

Dexterous manipulation with a highly redundant movement system is one of the hallmarks of human motor skills. From numerous behavioral studies, there is strong evidence that humans employ compliant task space control, i.e. they focus control only on task variables while keeping redundant degrees-of-freedom as compliant as possible. This strategy is robust towards unknown disturbances and simultaneously safe for the operator and the environment. The theory of operational space control in robotics aims to achieve similar performance properties. However, despite various compelling theoretical lines of research, advanced operational space control is hardly found in actual robotics implementations, in particular new kinds of robots like humanoids and service robots, which would strongly profit from compliant dexterous manipulation. To analyze the pros and cons of different approaches to operational space control, this paper focuses on a theoretical and empirical evaluation of different methods that have been suggested in the literature, but also some new variants of operational space controllers. We address formulations at the velocity, acceleration, and force levels. First, we formulate all controllers in a common notational framework, including quaternion-based orientation control, and discuss some of their theoretical properties. Second, we present experimental comparisons of these approaches on a seven-degree-of-freedom anthropomorphic robot arm with several benchmark tasks. As an aside, we also introduce a novel parameter estimation algorithm for rigid body dynamics, which ensures physical consistency, as this issue was crucial for our successful robot implementations. Our extensive empirical results demonstrate that one of the simplified acceleration-based approaches can be advantageous in terms of task performance, ease of parameter tuning, and general robustness and compliance in the face of inevitable modeling errors.
Improved method for measuring tartrate-resistant acid phosphatase activity in serum (1998)

We describe an improved method for the kinetic measurement of tartrate-resistant acid phosphatase (TrACP; EC 3.1.3.2) activity in serum. Of the TrACP derived from erythrocytes, platelets, and macrophages (osteoclasts and others), that from the first two sources is also resistant to fluoride, whereas skeletal TrACP is sensitive to fluoride. Thus, osteoclast-derived TrACP can be measured specifically by exploiting its sensitivity to fluoride. We measured the activity of tartrate-resistant and fluoride-sensitive acid phosphatase (TrFsACP) by using 2,6-dichloro-4-acetylphenyl phosphate as substrate at pH 6.2. The activity of TrFsACP in serum was increased by adding hexadimethrine bromide (Polybrene) to the reaction mixture. This method was not influenced by hemolysis with hemoglobin concentrations as great as 0.9 g/L. The mean +/- SD values of TrFsACP activity by this method were 20.4 +/- 2.8 and 16.4 +/- 2.3 U/L for young (ages 20-29 years) men (n = 34) and women (n = 50), respectively. The highest mean TrFsACP activity was found among children younger than 15 years, followed by that in elderly subjects (older than 60).
Ordinal UNLOC: Target Localization with Noisy and Incomplete Distance Measures (2021)

A main challenge in target localization arises from the lack of reliable distance measures. This issue is especially pronounced in indoor settings due to the presence of walls, floors, furniture, and other dynamically changing conditions such as the movement of people and goods, varying temperature, and airflows. Here, we develop a new computational framework to estimate the location of a target without the need for reliable distance measures. The method, which we term Ordinal UNLOC, uses only ordinal data obtained from comparing the signal strength from anchor pairs at known locations to the target. Our estimation technique utilizes rank aggregation, function learning as well as proximity-based unfolding optimization. As a result, it yields accurate target localization for common transmission models with unknown parameters and noisy observations that are reminiscent of practical settings. Our results are validated by both numerical simulations and hardware experiments.
Load-balanced anycast routing in computer networks (2002)

We present a practical approach to routing and anycasting with near-optimum delays taking into account the processing loads at routers and processing elements of a computer network. To accomplish this, the minimum-delay routing problem formulated by Gallager (1977) is generalized into the problem of minimum-delay routing with load-balancing to account for processing delays in network nodes (servers and routers). Gallager's theorem for necessary and sufficient conditions for minimum-delay routing is modified to include processing delays and changes of traffic levels at network nodes. The first distributed algorithm for load-balanced anycasting and routing in computer networks is presented. This algorithm, named MIDAS, provides approximate solutions to the modified necessary and sufficient conditions for minimum-delay routing. Simulations are use to compare the performance of the new algorithm with the performance of a traditional approach to sever load balancing.
Performance of time- and frequency-domain binaural beamformers based on recorded signals from real rooms (2003)

Extraction of a target sound source amidst multiple interfering sound sources is difficult when there are fewer sensors than sources, as is the case for human listeners in the classic cocktail-party situation. This study compares the signal extraction performance of five algorithms using recordings of speech sources made with three different two-microphone arrays in three rooms of varying reverberation time. Test signals, consisting of two to five speech sources, were constructed for each room and array. The signals were processed with each algorithm, and the signal extraction performance was quantified by calculating the signal-to-noise ratio of the output. A frequency-domain minimum-variance distortionless-response beamformer outperformed the time-domain based Frost beamformer and generalized sidelobe canceler for all tests with two or more interfering sound sources, and performed comparably or better than the time-domain algorithms for tests with one interfering sound source. The frequency-domain minimum-variance algorithm offered performance comparable to that of the Peissig-Kollmeier binaural frequency-domain algorithm, but with much less distortion of the target signal. Comparisons were also made to a simple beamformer. In addition, computer simulations illustrate that, when processing speech signals, the chosen implementation of the frequency-domain minimum-variance technique adapts more quickly and accurately than time-domain techniques.
Boron Nitride Nanotube–Reinforced Titanium Composite with Controlled Interfacial Reactions by Spark Plasma Sintering (2020)

Herein, boron nitride nanotube (BNNT)–reinforced Ti alloy composites with 1 wt% BNNT (3 vol%) are successfully fabricated by spark plasma sintering (SPS). This study addresses two challenges affecting the performance of BNNT–metal matrix composites: i) the dispersion of high‐surface‐energy BNNTs by an ultrasonic‐assisted technique and ii) the control of reactions at the metal/nanotube interface. High‐energy ultrasonic vibrations were effective in the dispersion of entangled BNNTs, and sintering at low (750 °C and 555 MPa) and high (950 °C and 60 MPa) temperature regimes resulted in relative densities of 97% and 99%. Reducing sintering temperatures by up to 35% compared to those used in conventional sintering is effective in minimizing brittle interfacial products. Also, the composites sintered at high‐temperatures/low‐pressure benefit from the rapid densification (10 min) achieved in the SPS process limiting the extent of reactions (TiB 2 , TiB). Compressive properties show composites sintered at low and high temperatures exhibit increases of 46% and 50% in yield strength, respectively, as compared to the Ti alloy. Strain hardening exponents of 0.8 and 0.5 characterize the capabilities of the composites to arrest plasticity in the presence of BNNTs, reaction phases, and twin boundaries pinning dislocations. This study unravels the potential of a low‐temperature/high‐pressure processing window for Ti‐BNNT composites.
Motion-correlated spiral CT scanning of the lung and mediastinal vessels with cone correction (2004)

In thoracic spiral CT-imaging of pericardial lung areas high spatial resolution is a prerequisite for efficient diagnosis. However, due to cardiac motion pulsation artefacts arising from the beating heart might affect images of pericardial lung areas and mediastinal vessels. We developed a gated thoracic imaging technique to avoid these pulsation artefacts. The temporal correlation to the stream of projection data can be provided either by the ECG of the patient or by the Cardiac Motion Function which can be computed directly from CT raw data. Due to multi-slice detector technology the conical shape of projection data has to be taken into account. This is achieved using stacks (booklets) of double-oblique reconstruction planes (pages) at different positions of the spiral path. The slope of the pages is adapted to the spiral geometry and optimized for utilization of almost all of the detector data. Only those booklets are contributing to final image slices that are related to the diastolic phase of the beating heart. Volume coverage of half the detector height per rotation can be achieved. Using the leading-edge 16-slice detector technology with 0.4s gantry rotation the entire thorax can be scanned with 0.75mm sampling within less than 25s. It will be shown, that the Cardiac Motion Function can be used as an adequate substitute for the ECG of the patient. In addition it is shown, that pericardial lung areas are depicted much sharper using gated reconstruction and that motion artefacts in mediastinal vessels are effectively suppressed.
Cross-sectional study of serum antibodies against Sarcocystis neurona in cats tested for antibodies against Toxoplasma gondii (2002)

Domestic cats are not likely to play a substantial role as intermediate hosts in the natural life cycle of S. neurona. Results indicate that natural infection of domestic cats may occur, and small animal practitioners should be aware of this fact when evaluating cats with neurologic disease. The S. neurona IFA test had lower specificity than western blot analysis.