Miracle-dz/UniFAR-FTUs huggingface dataset:
A Novel Time Synchronization Algorithm Based on the Synchronizer on Wireless Sensor Network with Clustering Architecture

Wireless sensor network applications often require a scalable time synchronization with the environment and communicating. Most of time synchronization algorithms are based on hierarchical structure and the precision is promoted at the expense of more complicated calculation. At the same time, the time synchronous is slower on the whole network because of the worse channel collision. This paper presents a novel time synchronization algorithm on the basis of synchronizer of clustering architecture. We adopt the improved RBS approach and introduce the synchronizer as to reducing messages’ overhead efficiently. Finally, performance of this algorithm is illustrated by a simulation experiment.
Dynamic-Epistemic reasoning on distributed systems

We propose a new logic designed for modelling and reasoning about information flow and information exchange between spatially located (but potentially mobile), interconnected agents witnessing a distributed computation. This is a major problem in the field of distributed systems, covering many different issues, with potential applications from Computer Science and Economy to Chemistry and Systems Biology. Underpinning on the dual algebraical-coalgebraical characteristics of process calculi, we design a decidable and completely axiomatizad logic that combines the processalgebraical/ equational and the modal/coequational features and is developed for process-algebraical semantics. The construction is done by mixing operators from dynamic and epistemic logics with operators from spatial logics for distributed and mobile systems. This is the preliminary version of a paper that will appear in Proceedings of the second Conference on Algebra and Coalgebra in Computer Science (CALCO2007), LNCS 4624, Springer, 2007. The original publication is available at www.springerlink. com
Lack of attribute searchability: Some thoughts

Established theory about the searchability of product attributes has advanced a tripartite classification of product attributes and, correspondingly, a three-pronged view of consumer evaluation procedures. Using this theory as a springboard, this article takes a closer look at the procedures consumers seem to utilize for evaluation of products that vary in their attribute searchability. Reflecting on current theory and practice, the consumer is construed to employ evaluation procedures different from those indicated by the product-attribute typology. This is so both because consumers view the attributes differently and because they rely on biased heuristics, as might suit their expertise and involvement. To capture these consumer assessment dynamics, propositions are advanced and empirical methods to test them are suggested. © 2004 Wiley Periodicals, Inc.
Performance of packet switched radio networks using combined parameter routing metrics

The performance of a generic packet switched radio network using a combined parameter routing metric is discussed. Building on a methodology formulated by W. Russell and R. Mankarious (1990). An approach to a multiple parameter cost functions is refined to improve throughput and delay performance for varying capacity radio links and in the presence of electronic jammers. The original cost function basis of this effort is discussed, the parametrics used in the optimization are expanded upon, the simulation results are presented. <<ETX>>
Single Nucleotide Polymorphism (K589E) of the EXO1 Gene: Association with Colorectal Cancer Susceptibility and Clinicopathological Features

Background and aim: Exonuclease1 (EXO1) is a member of the RAD2 nuclease family which is involved in mismatch repair (MMR) system and contributes to the maintenance of genomic stability, modulation of DNA recombination and cell cycle arrest mediation. K589E (rs1047840) as a potentially functional polymorphism in EXO1 gene may alter cancer risk by influencing its repair activity. Method: We designed a case-control study consisting of 319 subjects with colorectal cancer (CRC) and 310 healthy controls to investigate the effect of K589E polymorphism on CRC susceptibility and clinicopathological features in an Iranian population. Genotype determination was performed by PCR-RFLP method. Results: We provided the first evidence that there is not any significant association between EXO1 K589E alleles and genotypes and risk of CRC, even after adjustment for sex, age and smoking status (OR=1.033; 95% CI 0.814-1.312). Also analysis of clinicopathological characteristics and genotype distribution did not show any significant correlation. Conclusion: Despite the well-known role of EXO1, our results revealed that EXO1 K589E polymorphism could not be a potential predisposing risk factor in genetic susceptibility to CRC, at least in the studied population. A large scale case-control study will need to be carried out to further validate this polymorphism as a non- contributor to the risk of CRC in Iranian population.
Context-aware learning for finite mixture models

This work introduces algorithms able to exploit contextual information in order to improve maximum-likelihood (ML) parameter estimation in finite mixture models (FMM), demonstrating their benefits and properties in several scenarios. The proposed algorithms are derived in a probabilistic framework with regard to situations where the regular FMM graphs can be extended with context-related variables, respecting the standard expectation-maximization (EM) methodology and, thus, rendering explicit supervision completely redundant. We show that, by direct application of the missing information principle, the compared algorithms' learning behaviour operates between the extremities of supervised and unsupervised learning, proportionally to the information content of contextual assistance. Our simulation results demonstrate the superiority of context-aware FMM training as compared to conventional unsupervised training in terms of estimation precision, standard errors, convergence rates and classification accuracy or regression fitness in various scenarios, while also highlighting important differences among the outlined situations. Finally, the improved classification outcome of contextually enhanced FMMs is showcased in a brain-computer interface application scenario.
Reinforced adaboost face detector using support vector machine

We propose a novel face detection algorithm in order to improve higher detection rate of face-detector than conventional haar - adaboost face detector. Our purposed method not only improves detection rate of a face but decreases the number of false-positive component. In order to get improved detection ability, we merged two classifiers: adaboost and support vector machine. Because SVM and Adaboost use different feature, they are complementary each other. We can get 2~4% improved performance using proposed method than previous our detector that is not applied proposed method. This method makes improved detector that shows better performance without algorithm replacement.
A Novel Approach for Compressing DNA Sequences Using Semi-Statistical Compressor

Abstract In this paper, we present an algorithm for DNA sequence compression that uses a replacement method. The replacement method introduces words and a word-based compression scheme is used for encoding. The encoder uses ranks to assign the code of words. The developed statistical compression algorithm is competent and useful for DNA chain compression. We have experimentally showed that the designed algorithm is better than existing compressors on typical DNA sequence datasets.
Dynamic discovery and path planning for a mobile robot at a cocktail party

Sensor-based discovery path planning is problematic because the path needs to be continually re-computed as new information is discovered. A process based client-server approach has been successfully deployed to solve this problem, thus permitting concurrent sensor-based map and localization-correction updates as well as concurrent path computation and execution. A potential function is created by solving Laplace's equation using an iteration kernel convolution with an occupancy-grid representation of the current free space. The path produced is optimal, i.e., minimizing the distance to the goal in addition to minimizing the hitting probability. In this paper the approach is extended to include a specification on the target approach: appropriately referred to as the serving component of the cocktail party problem. The extension is unique in that no additional computational complexity is necessary. The path is only biased when open space is detected between the current robot position and the goal.
A fast switching PLL frequency synthesizer with an on-chip passive discrete-time loop filter in 0.25-μm CMOS

A phase-locked loop (PLL) frequency synthesizer with an on-chip passive discrete-time loop filter is reported in this paper. The closed loop is robust stable, and a fast switching speed is achieved by creating a stabilization zero in the discrete-time domain. The circuit implementations and system-level analysis results of the proposed architecture are presented. Techniques and design considerations are presented to overcome several potential problems of the proposed architecture, such as finite lock-in range, translation of voltage-controlled oscillator noise into in-band phase noise, and spur degradation due to clock feedthrough of the sampling switch. A 2.4 GHz prototype frequency synthesizer for Bluetooth applications was developed in a 0.25-/spl mu/m CMOS process. The measured results agree with theoretical predictions and demonstrate its high performance.
Analysis of error propagation in an improved zonal phase-gradient model

Wavefront sensing and reconstruction finds numerous applications in the field of optical technology. Zonal estimation from the wavefront difference or slope data is an important wavefront reconstruction approach. In this reconstruction method, the wavefront is estimated at specific grid points directly from the wavefront differences by using the least-square method. One of the important sources of error in wavefront estimation process is the detector or CCD centroiding error which may propagate in a basic wavefront estimation process, thereby degrading the performance of the wavefront sensor. Hence, quantification of this error is important as this may be considered as one of the selection parameter of a particular estimation geometry. In the present work, we compute the wavefront difference based (WFDB) error propagation coefficient due to this centroiding error for an improved zonal phase-gradient model which is formally applicable for a Shack-Hartmann (S-H) type sensor and show that the improved model offers a substantial reduction of error propagation. The theoretical error propagation coefficient is shown to have a strong correlation with the experimentally obtained RMS errors for the same model.
Use of neural networks to predict lightning at Kennedy Space Center

The authors describe an effort to construct and train neural net architectures to generate spatio-temporal maps of predicted probabilities of lightning over the Cape Canaveral Air Force Station/Kennedy Space Center (KSC) complex. The goal is to improve the precision and accuracy of lightning prediction so that the launch commit criteria may be relaxed while maintaining acceptable safety margins. Comparisons are made with earlier methods based on correlation of wind divergence with the later occurrence of a lightning flash. Using KSC meteorological data for wind, electric field, and lightning strikes and the total area divergence product, a prediction skill level surpassing the prior state-of-the-art has been attained. Synthesis of different types of data is one of the strengths of the artificial neural systems approach. Network predictive power can be expected to increase when other inputs (e.g. temperature, humidity, satellite data, and radar returns) are included in the input array. Predictive power is also expected to improve when many days of data are used in training. <<ETX>>
STATIC-99 Coding Rules Revised - 2003

In most cases, scoring a STATIC-99 is fairly straightforward for an experienced evaluator. If you are unfamiliar with this instrument we suggest that you turn to the back pages of this manual and find the one-page STATIC-99 Coding Form. You may want to keep a copy of this to one side as you review the manual. We strongly recommend that you read pages 3 to 21 and the section " Scoring the STATIC-99 and Computing the Risk Estimates " before you score the STATIC-99. These pages explain the nature of the STATIC-99 as a risk assessment instrument; to whom this risk assessment instrument may be applied; the role of self-report; exceptions for juvenile, developmentally delayed, and institutionalized offenders; changes from the last version of the STATIC-99 coding rules; the information required to score the STATIC-99; and important definitions such as " Index Offence " , Category " A " offences versus Category " B " offences, " Index Cluster " , and " Pseudo-recidivism ". Individual item coding instructions begin at the section entitled " Scoring the Ten Items ". For each of the ten items, the coding instructions begin with three pieces of information: The Basic Principle, Information Required to Score this Item, and The Basic Rule. In most cases, just reading these three small sections will allow you to score that item on the STATIC-99. Should you be unsure of how to score the item you may read further and consider whether any of the special circumstances or exclusions apply to your case. This manual contains much information that is related to specific uses of the STATIC-99 in unusual circumstances and many sections of this manual need only be referred to in exceptional circumstances. We also suggest that you briefly review the ten appendices as they contain valuable information on adjusting STATIC-99 predictions for time free in the community, a self-test of basic concepts, references, surgical castration, a table for converting raw STATIC-99 scores to risk estimates, the coding forms, a suggested report format for communicating STATIC-99-based risk information, a list of replication studies for the STATIC-99, information on inter-rater reliability and, how to interpret Static-99 scores greater than 6. We appreciate all feedback on the scoring and implementation of the STATIC-99. Please feel free to contact any of the authours. Should you find any errors in this publication or have questions/concerns regarding the application of this risk …
Older People with Access to Hand-Held Devices: Who Are They?

Abstract Introduction: Multiple comorbid conditions among older patients require frequent physician office and emergency room visits, at times leading to hospitalization. In recent years, mobile health (m-health) systems utilizing hand-held devices (e.g., smartphones) have been developed, which could be used for health-related interventions. This study investigates sociodemographic and clinical characteristics of individuals who have or have not accessed Internet via hand-held devices. Materials and Methods: Adults older than 65 years of age who participated in the Health Tracking survey of the Pew Internet and American Life Project in 2012 were included in the analysis. Data were analyzed for prevalence of Internet access via hand-held devices and differences in sociodemographic and clinical characteristics. Different online health information seeking behavior is also reported. Results: In the weighted sample size of 3,116 responses, 472 (15.1%) had access to Internet via hand-held devices. Those with su.
Iterative demapping and decoding for multilevel modulation

Iterative decoding algorithms for spectrally efficient modulation have become a vital field of research in digital communications. We show how iterative demapping reduces the bit error rate in conventional communication systems applying multilevel modulation combined with simple channel coding. For this the soft demapping has to be modified in order to accept a priori information. The system can be regarded as a serially concatenated iterative decoding scheme whereby the inner decoder is replaced by the soft demapping device. A design rule based on mutual information to find the 'best' mapping is proposed. Numerical results are presented for 4-PAM and 16-QAM examples.
Grayscale image preprocessing for viewpoint-independent 3D extraction of objects

The process by which images are prepared for complex vision systems is nontrivial. In this paper we describe the sequence of steps required to preprocess a grayscale picture for input to the Viewpoint Independent 3-D Extraction and Recognition of Objects (VITREO) system. VITREO is capable of accepting grayscale pictures for processing into line drawings for input to object recognition subsystems. These drawings are analyzed for edge and surface features to allow the extraction of component parts for subsequent recognition of the object containing them from stored component descriptions. This analysis demands that the line drawing extraction be robust and a combination of edge and line algorithms are employed. This process is described and examples of VITREO object extraction are shown.
Direct comparison between cerebral oximetry by INVOSTM and EQUANOXTM during cardiac surgery: a pilot study

Introduction Several near-infrared spectroscopy oximeters are commercially available for clinical use, with lack of standardization among them. Accordingly, cerebral oxygen saturation thresholds for hypoxia/ischemia identified in studies conducted with INVOSTM models do not necessarily apply to other devices. In this study, the measurements made with both INVOSTM and EQUANOXTM oximeters on the forehead of 10 patients during conventional cardiac surgery are directly compared, in order to evaluate the interchangeability of these two devices in clinical practice. Methods Cerebral oxygen saturation measurements were collected from both INVOSTM 5100C and EQUANOXTM 7600 before anesthetic induction (baseline), two minutes after tracheal intubation, at cardiopulmonary bypass onset/offset, at aortic cross-clamping/unclamping, at the end of surgery and whenever at least one of the two devices measured a reduction in cerebral oxygen saturation equal to or greater than 20% of the baseline value. Bland-Altman analysis was used to compare the bias and limits of agreement between the two devices. Results A total of 140 paired measurements were recorded. The mean bias between INVOSTM and EQUANOXTM was -5.1%, and limits of agreement were ±16.37%. Considering the values as percent of baseline, the mean bias was -1.43% and limits of agreement were ±16.47. A proportional bias was observed for both absolute values and changes from baseline. Conclusions INVOSTM and EQUANOXTM do not seem to be interchangeable in measuring both absolute values and dynamic changes of cerebral oxygen saturation during cardiac surgery. Large investigations, with appropriate design, are needed in order to identify any device-specific threshold.
Visual servoing-based augmented reality

The notion of Augmented Reality (AR) is to mix computer-generated, synthetic elements (3D/2D graphics, 3D audio) with real world in such a way that the synthetic elements appear to be part of the real world. There are various techniques to accomplish this, including magnetic tracking of position and orientation, and video-based tracking. This paper focuses on the video-based AR in which a camera is used to image the real world, and the image is processed to determine where the computer-generated elements are to be displayed. Video-based AR is particularly popular among AR researchers because of the accuracy that can be achieved in video image processing. The central problem in video-based Augmented Reality (AR) is the registration, or alignment of 3D graphical information with the image of a real scene. There are two ways in which an AR display could be presented to the user: a video monitor where the graphical elements are overlaid on the image seen by the camera, or a see-thru display in which only the graphics is displayed. In the case of a video monitor display, the graphical information should be positioned appropriately relative to the image of the object as seen by the camera. In the case of a see-thru display, the graphical information should be positioned on the display in such a way as to appear registered with the object being viewed through the display. In either case, if the position and orientation of the camera relative to the scene are known, the graphical rendering can be done correctly. In the
Updates on chikungunya epidemiology, clinical disease, and diagnostics.

Abstract Chikungunya virus (CHIKV) is an Aedes-borne alphavirus, historically found in Africa and Asia, where it caused sporadic outbreaks. In 2004, CHIKV reemerged in East Africa and spread globally to cause epidemics, including, for the first time, autochthonous transmission in Europe, the Middle East, and Oceania. The epidemic strains were of the East/Central/South African genotype. Strains of the Asian genotype of CHIKV continued to cause outbreaks in Asia and spread to Oceania and, in 2013, to the Americas. Acute disease, mainly comprising fever, rash, and arthralgia, was previously regarded as self-limiting; however, there is growing evidence of severe but rare manifestations, such as neurological disease. Furthermore, CHIKV appears to cause a significant burden of long-term morbidity due to persistent arthralgia. Diagnostic assays have advanced greatly in recent years, although there remains a need for simple, accurate, and affordable tests for the developing countries where CHIKV is most prevalent.
Refining rely-guarantee thinking

Reasoning about concurrent programs can be very difficult due to the possibility of interference. The fundamental insight of Rely-Guarantee thinking is that developing concurrent designs can only be made compositional if the development method offers ways to record and reason about the interference that is inherent in concurrency. The original presentation of rely-guarantee rules used keywords to mark the various predicates and even the read/write frames of operations. Subsequent papers have moved to a more general message of “rely-guarantee thinking” but retained this VDM flavour and have typically presented a development style in terms of inference rules based on Hoare-like triples, extended to quintuples to accommodate rely and guarantee conditions. Morgan’s refinement calculus presents concise rules that lend themselves to algebraic arguments. This paper reports on a complete reformulation of the key ideas of rely-guarantee reasoning in a refinement calculus style. As is shown, this indicates new useful and intuitive manipulations of rely/guarantee specifications. The approach makes use of two new commands: a guarantee command (guar g _ c) that behaves like the command c but also guarantees every atomic step satisfies the relation g, and a rely command (rely r _ c) that behaves like c provided any interference steps from the environment satisfy the relation r or stutter. Further notational developments result from the use of a more compact notation to indicate the read/write frame of a command. The new rules are justified with respect to an operational semantics presented in the Colvin style.