Binary Sort Research Articles

A New Algorithm to Exposing Image Forgeries by Detecting Ambient Illumination Consistency

Illumination consistency makes one of important roles in image authenticity, especially in splicing and copy-move rendering. This paper proposes a new method to estimate illuminant direction based on idea of binary sort tree. The algorithm calculates the least error function to structure the binary tree of illuminant direction. And it doesn’t need to expand much time to solve pathosis equation and access accuracy is improved. The experiment shows that, the algorithm can effectively calculate the light source direction of different objects and backgrounds in an image especially in infinite light source, and the detection correct rate reaches 85.4% in general situation , what’s more, 88.1% in infinite light source. Anyway, the algorithm in this paper is a great advancement of blind forensics based on consistency in lighting direction.

The origins and evolution of cement hydration models

Our ability to predict hydration behavior is becoming increasingly relevant to the concrete community as modelers begin to link material performance to the dynamics of material properties and chemistry. At early ages, the properties of concrete are changing rapidly due to chemical transformations that affect mechanical, thermal and transport responses of the composite. At later ages, the resulting, nano-, micro-, meso- and macroscopic structure generated by hydration will control the life-cycle performance of the material in the field. Ultimately, creep, shrinkage, chemical and physical durability, and all manner of mechanical response are linked to hydration. As a way to enable the modeling community to better understand hydration, a review of hydration models is presented offering insights into their mathematical origins and relationships one-to-the-other. The quest for a universal model begins in the 1920's and continues to the present, and is marked by a number of critical milestones. Unfortunately, the origins and physical interpretation of many of the most commonly used models have been lost in their overuse and the trail of citations that vaguely lead to the original manuscripts. To help restore some organization, models were sorted into four categories based primarily on their mathematical and theoretical basis: (1) mass continuity-based, (2) nucleation-based, (3) particle ensembles, and (4) complex multi-physical and simulation environments. This review provides a concise catalogue of models and in most cases enough detail to derive their mathematical form. Furthermore, classes of models are unified by linking them to their theoretical origins, thereby making their derivations and physical interpretations more transparent. Models are also used to fit experimental data so that their characteristics and ability to predict hydration calorimetry curves can be compared. A sort of evolutionary tree showing the progression of models is given along with some insights into the nature of future work yet needed to develop the next generation of cement hydration models.

Verification of multi-linked heaps

We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of relying on a relatively simple theory of linked lists in order to support abstraction computation. To facilitate the application of this encoding, we provide a program transformation that, given a program operating on a multi-linked heap without sharing, transforms it into one over a single-parent heap. It is then possible to apply shape analysis by predicate and ranking abstraction. The technique has been successfully applied on examples with lists (reversal and bubble sort) and trees with of fixed arity (balancing of, and insertion into, a binary sort tree).

Implementation and Performance Analysis of Exponential Tree Sorting

The traditional algorithm for sorting gives a bound of expected time without randomization and with randomization. Recent researches have optimized lower bound for deterministic algorithms for integer sorting [1-3]. Andersson has given the idea of Exponential tree which can be used for sorting [4]. Andersson, Hagerup, Nilson and Raman have given an algorithm which sorts n integers in expected time but uses space [4, 5]. Andersson has given improved algorithm which sort integers in expected time and linear space but uses randomization [2, 4]. Yijie Han has improved further to sort integers in expected time and linear space but passes integers in a batch i.e. all integers at a time [6]. These algorithms are very complex to implement. In this paper we discussed a way to implement the exponential tree sorting and later compare results with traditional sorting technique. General Terms Algorithms, Data Structure.

Slider-adjusted softcopy ruler for calibrated image quality assessment

ISO 20462 part 3 standardized the hardcopy quality ruler and a softcopy quality ruler based on a binary sort approach involving paired comparisons. The new softcopy ruler method described here utilizes a slider bar to match the quality of the ruler to that of the test image, which is found to substantially reduce the time required per assessment (30 to 15.5 s), with only a modest loss of precision (standard deviations of 2.5 to 2.9 just noticeable differences). In combination, these metrics implied a 20% improvement in the standard error of the mean achievable in a fixed amount of judging time. Ruler images calibrated against the standard quality scale of ISO 20462 are generated for 21 scenes, at 31 quality levels each, achieved through variation of sharpness, while other attributes are held near their preferred positions. The images are bundled with documentation and a MATLAB source code for a graphical user interface that administers softcopy ruler experiments, and these materials are donated to the International Imaging Industry Association for distribution. In conjunction with a specified large flat panel display, these materials should enable users to conduct softcopy quality ruler experiments with minimum effort, and should reduce the barriers to performing calibrated psychophysical measurements.

Dynamic queuing sharing mechanism for per-flow quality of service control

To achieve satisfying user experiences of diverse applications, quality of service (QoS) guaranteed mechanisms such as per-flow queuing are required in routers. However, deployment of per-flow queuing in high-speed routers is considered as a great challenge since its industrial brute-force implementation is not scalable with the increase of the number of flows. In this study, the authors propose a dynamic queue sharing (DQS) mechanism to enable scalable per-flow queuing. DQS keeps isolation of each concurrent active flow by sharing a small number of queues instead of maintaining a dedicated queue for each in-progress flow, which is novel compared to the existing methods. According to DQS, a physical queue is created and assigned to an active flow upon the arrival of its first packet, and is destroyed upon the departure of the last packet in the queue. The authors combine hash method with binary sorting tree to construct and manage the dynamic mapping between active flows and physical queues, which significantly reduces the number of required physical queues from millions to hundreds and makes per-flow queuing feasible for high-performance routers.

System Architecture of the LabPET Small Animal PET Scanner

To address modern molecular imaging requirements, a digital positron emission tomography (PET) scanner for small animals has been developed at Universite de Sherbrooke. Based on individual readout of avalanche photodiodes (APD) coupled to LYSO/LGSO phoswich detectors, the scanner supports up to 4608 channels in a 16.2 cm diameter, 11.25 cm axial field of view with an isotropic ~ 1.2 mm FWHM intrinsic spatial resolution at the center of the field of view. Custom data acquisition boards preprocess and sample APD signals at 45 MHz and compute in real time crystal identification, energy and timing information of detected events at an average sustained rate of up to 1250 raw counts per second per mm2 (10 000 cps/channel). Real time digital signal analysis also filters out events outside the pre-selected energy window with crystal granularity to eliminate Compton events and electronic noise. Retained events are then merged into a single stream through a real-time sorting tree, at which end prompt and delayed coincidences are extracted. A single Firewire link handles both control and data transfers with a host computer. The LabPET features four data recording modes, giving the user the choice to retain data for research or to minimize file size for high coincidence count rate and imaging purposes. The electronic system also supports time synchronized data insertion for flags such as vital signs used in gated image reconstruction. Aside from data acquisition, hardware can generate live energy and discrimination spectra suitable for fast, automatic channel calibration.

Enhancing Cattle Handling Safety with the Work Crew Performance Model

Kentucky farmers and University of Kentucky extension agents applied the principles of the Work Crew Performance Model (WCPM), used previously in mining and construction, to identify and prioritize critical action factors (CAFs) for safe handling of cattle. One focus group of farmers helped identify a set of 32 critical action factors in four categories: environmental conditions, animal behavior, facilities and equipment, and handling techniques. A second focus group of farmers used a Q-sort nominal group process to rate each of the factors on the basis of the cost consequences of failure to properly perform the activity. A three-stage binary sort process resulted in a five-point ordinal ranking of tasks within each of the four categories. The Q-sort procedure was performed with assumptions of both routine and emergency animal handling activities. The list and the rankings were validated and modified by extension agriculture agents and by an expert panel of animal scientists and an agricultural engineering educator. The validation process added seven CAFs to the original list. The result of the process was the development of a cattle safety handling checklist that has been used with success in Master Cattleman educational workshops conducted for approximately 1500 Kentucky farmers.

An Ultra-Low-Power Long Range Battery/Passive RFID Tag for UHF and Microwave Bands With a Current Consumption of 700 nA at 1.5 V

We present for the first time, a fully integrated battery powered RFID integrated circuit (IC) for operation at ultrahigh frequency (UHF) and microwave bands. The battery powered RFID IC can also work as a passive RFID tag without a battery or when the battery has died (i.e., voltage has dropped below 1.3 V); this novel dual passive and battery operation allays one of the major drawbacks of currently available active tags, namely that the tag cannot be used once the battery has died. When powered by a battery, the current consumption is 700 nA at 1.5 V (400 nA if internal signals are not brought out on test pads). This ultra-low-power consumption permits the use of a very small capacity battery of 100 mA-hr for lifetimes exceeding ten years; as a result a battery tag that is very close to a passive tag both in form factor and cost is made possible. The chip is built on a 1-mum digital CMOS process with dual poly layers, EEPROM and Schottky diodes. The RF threshold power at 2.45 GHz is -19 dBm which is the lowest ever reported threshold power for RFID tags and has a range exceeding 3.5 m under FCC unlicensed operation at the 2.4-GHz microwave band. The low threshold is achieved with architectural choices and low-power circuit design techniques. At 915 MHz, based on the experimentally measured tag impedance (92-j837) and the threshold spec of the tag (200 mV), the theoretical minimum range is 24 m. The tag initially is in a "low-power" mode to conserve power and when issued the appropriate command, it operates in "full-power" mode. The chip has on-chip voltage regulators, clock and data recovery circuits, EEPROM and a digital state machine that implements the ISO 18000-4 B protocol in the "full-power" mode. We provide detailed explanation of the clock recovery circuits and the implementation of the binary sort algorithm, which includes a pseudorandom number generator. Other than the antenna board and a battery, no external components are used.

Limit distribution of distances in biased random tries

Thetrieis a sort of digital tree. Ideally, to achieve balance, the trie should grow from an unbiased source generating keys of bits with equal likelihoods. In practice, the lack of bias is not always guaranteed. We investigate the distance between randomly selected pairs of nodes among the keys in a biased trie. This research complements that of Christophi and Mahmoud (2005); however, the results and some of the methodology are strikingly different. Analytical techniques are still useful for moments calculation. Both mean and variance are of polynomial order. It is demonstrated that the standardized distance approaches a normal limiting random variable. This is proved by the contraction method, whereby the limit distribution is shown to approach the fixed-point solution of a distributional equation in the Wasserstein metric space.

Limit distribution of distances in biased random tries

The trie is a sort of digital tree. Ideally, to achieve balance, the trie should grow from an unbiased source generating keys of bits with equal likelihoods. In practice, the lack of bias is not always guaranteed. We investigate the distance between randomly selected pairs of nodes among the keys in a biased trie. This research complements that of Christophi and Mahmoud (2005); however, the results and some of the methodology are strikingly different. Analytical techniques are still useful for moments calculation. Both mean and variance are of polynomial order. It is demonstrated that the standardized distance approaches a normal limiting random variable. This is proved by the contraction method, whereby the limit distribution is shown to approach the fixed-point solution of a distributional equation in the Wasserstein metric space.

Attempts to Standardise Vibration Measurements in a Single-Grip Harvester

Forest harvesters are machines used for felling, delimbing, cross cutting, and sorting of trees in the Nordic countries. During these operations, the operators are exposed to vibration generated from the working process. This study measures the transmission of vibration from the crane to the cabin and to the driver's seat in a harvester during delimbing and felling with varying angles between the crane and machine. Moreover, this study suggests a way to conduct these measurements with a repeatable method. The vibration levels decreased in each step in the vibration chain “crane foot — cabin floor — seat”; less than 10% of the vibration reached the seat pad. The angle between the crane and machine had only minor effects on the transmission. The experimental method used for measuring the vibration seems to give a good opportunity to conduct standardised measurements for different work elements.

DynGO: a tool for visualizing and mining of Gene Ontology and its associations

BackgroundA large volume of data and information about genes and gene products has been stored in various molecular biology databases. A major challenge for knowledge discovery using these databases is to identify related genes and gene products in disparate databases. The development of Gene Ontology (GO) as a common vocabulary for annotation allows integrated queries across multiple databases and identification of semantically related genes and gene products (i.e., genes and gene products that have similar GO annotations). Meanwhile, dozens of tools have been developed for browsing, mining or editing GO terms, their hierarchical relationships, or their "associated" genes and gene products (i.e., genes and gene products annotated with GO terms). Tools that allow users to directly search and inspect relations among all GO terms and their associated genes and gene products from multiple databases are needed.ResultsWe present a standalone package called DynGO, which provides several advanced functionalities in addition to the standard browsing capability of the official GO browsing tool (AmiGO). DynGO allows users to conduct batch retrieval of GO annotations for a list of genes and gene products, and semantic retrieval of genes and gene products sharing similar GO annotations. The result are shown in an association tree organized according to GO hierarchies and supported with many dynamic display options such as sorting tree nodes or changing orientation of the tree. For GO curators and frequent GO users, DynGO provides fast and convenient access to GO annotation data. DynGO is generally applicable to any data set where the records are annotated with GO terms, as illustrated by two examples.ConclusionWe have presented a standalone package DynGO that provides functionalities to search and browse GO and its association databases as well as several additional functions such as batch retrieval and semantic retrieval. The complete documentation and software are freely available for download from the website .

Reproductive success of the spruce bark beetle Ips typographus (L.) and occurrence of associated species: a comparison between standing beetle-killed trees and cut trees

The spruce bark beetle Ips typographus is a severe insect pest on mature Norway Spruce. Under normal circumstances, the beetle reproduces in fallen trees, and also to some extent in standing living trees. Knowledge of its reproductive success in different sorts of breeding material is not only important in devising effective protective measures but also of ecological interest. Here, a direct comparison was made between standing beetle-killed trees and cut trees in a pairwise set-up. In 1998 in southern Sweden, stem sections were taken from both sorts of trees at six spruce stand edges and put in separate emergence traps to collect all emerging insects. Reproductive success, defined as number of daughters per mother beetle, was significantly higher in standing beetle-killed trees than in cut trees (on an average, 3.4 in standing trees and 1.7 in cut trees). Several possible reasons for this outcome are discussed, e.g. differences in egg gallery density, abundance of natural enemies and root contact. In addition to I. typographus, a large number of other beetles, as well as parasitic Hymenoptera and predacious flies, emerged from the stem sections. Several of these species are important enemies of I. typographus, e.g. Medetera flies which were nearly 10 times more abundant on standing than on cut trees. This study confirms that spruce trees colonised by I. typographus harbour a diverse and abundant set of species. It also appears that I. typographus in some situations can reproduce quite successfully in killed standing trees.

A high speed Sorting Processor ASIC for the RPC Trigger system of the CMS experiment

Abstract The design of a high speed Sorting Processor ASIC is presented. It was designed in BiCMOS 0.8 μm technology and its aim is to reorder and provide the four highest words among eight input words, in decreasing order. This chip is the main component of the sorting tree of the Trigger Muon System of the CMS experiment.

A FAST TREE SORTING ALGORITHM

This paper presents a new tree sorting algorithm whose average time complexity is much better than the sorting methods using AVL-Tree or other balanced trees. The experiment shows that our algorithm is much faster than the sorting methods using AVL-Tree or other balanced trees.

A Priority Buffer Insertion Ring Protocol For Local Area Networks

This paper presents a new buffer insertion ring protocol with message-based priorities. A new arrangement of buffers and processes combined with a binary sort algorithm allows for priority- based queuing of messages without sorting delay. A model showing performance of the new system is presented. A new variable, the load factor, is defined and used in the performance model and for simplification of computer simulation. Data generated from computer simulation show that delay-throughput characteristics of high-priority messages are superior to those of non-message-priori ty system. Data provide comparisons of number of priority levels, performance of each priority level, effect of operating modes on performance, and the dual impact of implementation of priority sorting and high network load.

Categorization and Reasoning among Tree Experts: Do All Roads Lead to Rome?

To what degree do conceptual systems reflect universal patterns of featural covariation in the world (similarity) or universal organizing principles of mind, and to what degree do they reflect specific goals, theories, and beliefs of the categorizer? This question was addressed in experiments concerned with categorization and reasoning among different types of tree experts (e.g., taxonomists, landscape workers, parks maintenance personnel). The results show an intriguing pattern of similarities and differences. Differences in sorting between taxonomists and maintenance workers reflect differences in weighting of morphological features. Landscape workers, in contrast, sort trees into goal-derived categories based on utilitarian concerns. These sorting patterns carry over into category-based reasoning for the taxonomists and maintenance personnel but not the landscape workers. These generalizations interact with taxonomic rank and suggest that the genus (or folk generic) level is relatively and in some cases absolutely privileged. Implications of these findings for theories of categorization are discussed.

Performance modelling of three parallel sorting algorithms on a pipelined transputer network

The implementation of three parallel sorting algorithms, namely binary sort, odd-even transposition sort and bitonic sort, on a network of transputers is analysed in the paper. The variation in the performance of these algorithms as the number of processors and sort size are changed is investigated. Experimental results show that when up to eight transputers are used, connected as a linear pipeline configuration, all three algorithms can achieve reasonable speedup ratios. The bitonic sort, binary sort odd-even transposition sort achieve speedup ratios of 5, 4.4 and 4, respectively, when eight processors are used to sort 100,000 integers. Analytical models are derived which can be used to predict the performance of the three algorithms when a linear pipeline configuration is used. The predicted performance of the algorithms is compared with the experimental performance in order to validate the model. When the models are used to predict the performance using 16 transputers, it is found that the speedup does not significantly improve compared to the performance achieved with eight transputers. This shows that interprocessor communication has a significant effect on the algorithmic performance when a larger number of processors are used. The conclusions reinforce the fact that the binary and bitonic sorting algorithms are not well-suited to a linear pipeline configuration and that they may perform better if a different topology were used, for example a mesh or a cube connection scheme. Further, the analytical technique used for performance modelling as elaborated in the paper can be employed profitably for other multiprocessor systems as well.

A rational reconstruction of the domain of feature structures

Feature structures are employed in various forms in many areas of linguistics. Informally, one can picture a feature structure as a sort of tree decorated with information about constraints requiring that specific subtrees be identical (isomorphic). Here I show that this informal picture of feature structures can be used to characterize exactly the class of feature structures under their usual subsumption ordering. Furthermore, once a precise definition of tree is fixed, this characterization makes use only of standard domain-theoretic notions regarding the information borne by elements in a domain, thus removing (or better, explaining) all apparentlyad hoc choices in the original definition of feature structures. In addition, I show how this characterization can be parameterized in order to yield similar characterizations of various different notions of feature structure, including acyclic structures, structures with appropriateness conditions and structures with apartness conditions (used to model path inequations). The generalizations to other notions of feature structure also emphasize that the construction given here is in fact independent of the application to feature structures.