Sorting and selection in posets

DEFF Research Database (Denmark)

Daskalakis, Constantinos; Karp, Richard M.; Mossel, Elchanan

2011-01-01

from two decades ago by Faigle and Turán. In particular, we present the first algorithm that sorts a width-$w$ poset of size $n$ with query complexity $O(n(w+\\log n))$ and prove that this query complexity is asymptotically optimal. We also describe a variant of Mergesort with query complexity $O......(wn\\log\\frac{n}{w})$ and total complexity $O(w^{2}n\\log\\frac{n}{w})$; an algorithm with the same query complexity was given by Faigle and Turán, but no efficient implementation of that algorithm is known. Both our sorting algorithms can be applied with negligible overhead to the more general problem of reconstructing transitive......Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study these problems in the context of partially ordered sets, in which some pairs of objects are incomparable. This generalization is interesting from a combinatorial...

Binar Sort: A Linear Generalized Sorting Algorithm

OpenAIRE

Gilreath, William F.

2008-01-01

Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic or O(N lg N). The linearithmic lower bound in performance stems from the fact that the sorting algorithms use the ordering property of the data. The sorting algorithm uses comparison by the ordering property to arrange the data elements from an initial perm...

LazySorted: A Lazily, Partially Sorted Python List

Directory of Open Access Journals (Sweden)

Naftali Harris

2015-06-01

Full Text Available LazySorted is a Python C extension implementing a partially and lazily sorted list data structure. It solves a common problem faced by programmers, in which they need just part of a sorted list, like its middle element (the median, but sort the entire list to get it. LazySorted presents them with the abstraction that they are working with a fully sorted list, while actually only sorting the list partially with quicksort partitions to return the requested sub-elements. This enables programmers to use naive "sort first" algorithms but nonetheless attain linear run-times when possible. LazySorted may serve as a drop-in replacement for the built-in sorted function in most cases, and can sometimes achieve run-times more than 7 times faster.

SearchResultFinder: federated search made easy

NARCIS (Netherlands)

Trieschnigg, Rudolf Berend; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd

Building a federated search engine based on a large number existing web search engines is a challenge: implementing the programming interface (API) for each search engine is an exacting and time-consuming job. In this demonstration we present SearchResultFinder, a browser plugin which speeds up

An Empirical Model of Wage Dispersion with Sorting

DEFF Research Database (Denmark)

Bagger, Jesper; Lentz, Rasmus

(submodular). The model is estimated on Danish matched employer-employee data. We find evidence of positive assortative matching. In the estimated equilibrium match distribution, the correlation between worker skill and firm productivity is 0.12. The assortative matching has a substantial impact on wage......This paper studies wage dispersion in an equilibrium on-the-job-search model with endogenous search intensity. Workers differ in their permanent skill level and firms differ with respect to productivity. Positive (negative) sorting results if the match production function is supermodular...... to mismatch by asking how much greater output would be if the estimated population of matches were perfectly positively assorted. In this case, output would increase by 7.7%....

Sorting Out Sorts

OpenAIRE

Jonathan B. Berk

1998-01-01

In this paper we analyze the theoretical implications of sorting data into groups and then running asset pricing tests within each group. We show that the way this procedure is implemented introduces a severe bias in favor of rejecting the model under consideration. By simply picking enough groups to sort into even the true asset pricing model can be shown to have no explanatory power within each group.

Verification of counting sort and radix sort

NARCIS (Netherlands)

C.P.T. de Gouw (Stijn); F.S. de Boer (Frank); J.C. Rot (Jurriaan)

2016-01-01

textabstractSorting is an important algorithmic task used in many applications. Two main aspects of sorting algorithms which have been studied extensively are complexity and correctness. [Foley and Hoare, 1971] published the first formal correctness proof of a sorting algorithm (Quicksort). While

An Evaluation of the Critical Factors Affecting the Efficiency of Some Sorting Techniques

OpenAIRE

Olabiyisi S.O.; Adetunji A.B.; Oyeyinka F.I.

2013-01-01

Sorting allows information or data to be put into a meaningful order. As efficiency is a major concern of computing, data are sorted in order to gain the efficiency in retrieving or searching tasks. The factors affecting the efficiency of shell, Heap, Bubble, Quick and Merge sorting techniques in terms of running time, memory usage and the number of exchanges were investigated. Experiment was conducted for the decision variables generated from algorithms implemented in Java programming and fa...

Card sorting to evaluate the robustness of the information architecture of a protocol website.

Science.gov (United States)

Wentzel, J; Müller, F; Beerlage-de Jong, N; van Gemert-Pijnen, J

2016-02-01

A website on Methicillin-Resistant Staphylococcus Aureus, MRSA-net, was developed for Health Care Workers (HCWs) and the general public, in German and in Dutch. The website's content was based on existing protocols and its structure was based on a card sort study. A Human Centered Design approach was applied to ensure a match between user and technology. In the current study we assess whether the website's structure still matches user needs, again via a card sort study. An open card sort study was conducted. Randomly drawn samples of 100 on-site search queries as they were entered on the MRSA-net website (during one year of use) were used as card input. In individual sessions, the cards were sorted by each participant (18 German and 10 Dutch HCWs, and 10 German and 10 Dutch members of the general public) into piles that were meaningful to them. Each participant provided a label for every pile of cards they created. Cluster analysis was performed on the resulting sorts, creating an overview of clusters of items placed together in one pile most frequently. In addition, pile labels were qualitatively analyzed to identify the participants' mental models. Cluster analysis confirmed existing categories and revealed new themes emerging from the search query samples, such as financial issues and consequences for the patient. Even though MRSA-net addresses these topics, they are not prominently covered in the menu structure. The label analysis shows that 7 of a total of 44 MRSA-net categories were not reproduced by the participants. Additional themes such as information on other pathogens and categories such as legal issues emerged. This study shows that the card sort performed to create MRSA-net resulted in overall long-lasting structure and categories. New categories were identified, indicating that additional information needs emerged. Therefore, evaluating website structure should be a recurrent activity. Card sorting with ecological data as input for the cards is

IAP-Based Cell Sorting Results in Homogeneous Transplantable Dopaminergic Precursor Cells Derived from Human Pluripotent Stem Cells

Directory of Open Access Journals (Sweden)

Daniela Lehnen

2017-10-01

Full Text Available Human pluripotent stem cell (hPSC-derived mesencephalic dopaminergic (mesDA neurons can relieve motor deficits in animal models of Parkinson's disease (PD. Clinical translation of differentiation protocols requires standardization of production procedures, and surface-marker-based cell sorting is considered instrumental for reproducible generation of defined cell products. Here, we demonstrate that integrin-associated protein (IAP is a cell surface marker suitable for enrichment of hPSC-derived mesDA progenitor cells. Immunomagnetically sorted IAP+ mesDA progenitors showed increased expression of ventral midbrain floor plate markers, lacked expression of pluripotency markers, and differentiated into mature dopaminergic (DA neurons in vitro. Intrastriatal transplantation of IAP+ cells sorted at day 16 of differentiation in a rat model of PD resulted in functional recovery. Grafts from sorted IAP+ mesDA progenitors were more homogeneous in size and DA neuron density. Thus, we suggest IAP-based sorting for reproducible prospective enrichment of mesDA progenitor cells in clinical cell replacement strategies.

IAP-Based Cell Sorting Results in Homogeneous Transplantable Dopaminergic Precursor Cells Derived from Human Pluripotent Stem Cells.

Science.gov (United States)

Lehnen, Daniela; Barral, Serena; Cardoso, Tiago; Grealish, Shane; Heuer, Andreas; Smiyakin, Andrej; Kirkeby, Agnete; Kollet, Jutta; Cremer, Harold; Parmar, Malin; Bosio, Andreas; Knöbel, Sebastian

2017-10-10

Human pluripotent stem cell (hPSC)-derived mesencephalic dopaminergic (mesDA) neurons can relieve motor deficits in animal models of Parkinson's disease (PD). Clinical translation of differentiation protocols requires standardization of production procedures, and surface-marker-based cell sorting is considered instrumental for reproducible generation of defined cell products. Here, we demonstrate that integrin-associated protein (IAP) is a cell surface marker suitable for enrichment of hPSC-derived mesDA progenitor cells. Immunomagnetically sorted IAP + mesDA progenitors showed increased expression of ventral midbrain floor plate markers, lacked expression of pluripotency markers, and differentiated into mature dopaminergic (DA) neurons in vitro. Intrastriatal transplantation of IAP + cells sorted at day 16 of differentiation in a rat model of PD resulted in functional recovery. Grafts from sorted IAP + mesDA progenitors were more homogeneous in size and DA neuron density. Thus, we suggest IAP-based sorting for reproducible prospective enrichment of mesDA progenitor cells in clinical cell replacement strategies. Copyright © 2017 Miltenyi Biotec GmbH. Published by Elsevier Inc. All rights reserved.

Search Results | Page 67 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 661 - 670 of 875 ... Strengthening Capacity to Respond to Computer Security Incidents in Latin America and the Caribbean. The Internet has become a crucial tool for companies and individuals to conduct all sorts of social and economic transactions. Project.

Design and realization of sort manipulator of crystal-angle sort machine

Science.gov (United States)

Wang, Ming-shun; Chen, Shu-ping; Guan, Shou-ping; Zhang, Yao-wei

2005-12-01

It is a current tendency of development in automation technology to replace manpower with manipulators in working places where dangerous, harmful, heavy or repetitive work is involved. The sort manipulator is installed in a crystal-angle sort machine to take the place of manpower, and engaged in unloading and sorting work. It is the outcome of combing together mechanism, electric transmission, and pneumatic element and micro-controller control. The step motor makes the sort manipulator operate precisely. The pneumatic elements make the sort manipulator be cleverer. Micro-controller's software bestows some simple artificial intelligence on the sort manipulator, so that it can precisely repeat its unloading and sorting work. The combination of manipulator's zero position and step motor counting control puts an end to accumulating error in long time operation. A sort manipulator's design in the practice engineering has been proved to be correct and reliable.

Algorithm Sorts Groups Of Data

Science.gov (United States)

Evans, J. D.

1987-01-01

For efficient sorting, algorithm finds set containing minimum or maximum most significant data. Sets of data sorted as desired. Sorting process simplified by reduction of each multielement set of data to single representative number. First, each set of data expressed as polynomial with suitably chosen base, using elements of set as coefficients. Most significant element placed in term containing largest exponent. Base selected by examining range in value of data elements. Resulting series summed to yield single representative number. Numbers easily sorted, and each such number converted back to original set of data by successive division. Program written in BASIC.

Stochastic Model of Vesicular Sorting in Cellular Organelles

Science.gov (United States)

Vagne, Quentin; Sens, Pierre

2018-02-01

The proper sorting of membrane components by regulated exchange between cellular organelles is crucial to intracellular organization. This process relies on the budding and fusion of transport vesicles, and should be strongly influenced by stochastic fluctuations, considering the relatively small size of many organelles. We identify the perfect sorting of two membrane components initially mixed in a single compartment as a first passage process, and we show that the mean sorting time exhibits two distinct regimes as a function of the ratio of vesicle fusion to budding rates. Low ratio values lead to fast sorting but result in a broad size distribution of sorted compartments dominated by small entities. High ratio values result in two well-defined sorted compartments but sorting is exponentially slow. Our results suggest an optimal balance between vesicle budding and fusion for the rapid and efficient sorting of membrane components and highlight the importance of stochastic effects for the steady-state organization of intracellular compartments.

Parallel sorting algorithms

CERN Document Server

Akl, Selim G

1985-01-01

Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the

A Comparison of Card-sorting Analysis Methods

DEFF Research Database (Denmark)

Nawaz, Ather

2012-01-01

This study investigates how the choice of analysis method for card sorting studies affects the suggested information structure for websites. In the card sorting technique, a variety of methods are used to analyse the resulting data. The analysis of card sorting data helps user experience (UX......) designers to discover the patterns in how users make classifications and thus to develop an optimal, user-centred website structure. During analysis, the recurrence of patterns of classification between users influences the resulting website structure. However, the algorithm used in the analysis influences...... the recurrent patterns found and thus has consequences for the resulting website design. This paper draws an attention to the choice of card sorting analysis and techniques and shows how it impacts the results. The research focuses on how the same data for card sorting can lead to different website structures...

An Unsupervised Online Spike-Sorting Framework.

Science.gov (United States)

Knieling, Simeon; Sridharan, Kousik S; Belardinelli, Paolo; Naros, Georgios; Weiss, Daniel; Mormann, Florian; Gharabaghi, Alireza

2016-08-01

Extracellular neuronal microelectrode recordings can include action potentials from multiple neurons. To separate spikes from different neurons, they can be sorted according to their shape, a procedure referred to as spike-sorting. Several algorithms have been reported to solve this task. However, when clustering outcomes are unsatisfactory, most of them are difficult to adjust to achieve the desired results. We present an online spike-sorting framework that uses feature normalization and weighting to maximize the distinctiveness between different spike shapes. Furthermore, multiple criteria are applied to either facilitate or prevent cluster fusion, thereby enabling experimenters to fine-tune the sorting process. We compare our method to established unsupervised offline (Wave_Clus (WC)) and online (OSort (OS)) algorithms by examining their performance in sorting various test datasets using two different scoring systems (AMI and the Adamos metric). Furthermore, we evaluate sorting capabilities on intra-operative recordings using established quality metrics. Compared to WC and OS, our algorithm achieved comparable or higher scores on average and produced more convincing sorting results for intra-operative datasets. Thus, the presented framework is suitable for both online and offline analysis and could substantially improve the quality of microelectrode-based data evaluation for research and clinical application.

Parallel approach on sorting of genes in search of optimal solution.

Science.gov (United States)

Kumar, Pranav; Sahoo, G

2018-05-01

An important tool for comparing genome analysis is the rearrangement event that can transform one given genome into other. For finding minimum sequence of fission and fusion, we have proposed here an algorithm and have shown a transformation example for converting the source genome into the target genome. The proposed algorithm comprises of circular sequence i.e. "cycle graph" in place of mapping. The main concept of algorithm is based on optimal result of permutation. These sorting processes are performed in constant running time by showing permutation in the form of cycle. In biological instances it has been observed that transposition occurs half of the frequency as that of reversal. In this paper we are not dealing with reversal instead commencing with the rearrangement of fission, fusion as well as transposition. Copyright © 2017 Elsevier Inc. All rights reserved.

I-SG : Interactive Search Grouping - Search result grouping using Independent Component Analysis

DEFF Research Database (Denmark)

Lauritsen, Thomas; Kolenda, Thomas

2002-01-01

We present a computational simple and efficient approach to unsupervised grouping the search result from any search engine. Along with each group a set of keywords are found to annotate the contents. This approach leads to an interactive search trough a hierarchial structure that is build online....... It is the users task to improve the search, trough expanding the search query using the topic keywords representing the desired groups. In doing so the search engine limits the space of possible search results, virtually moving down in the search hierarchy, and so refines the search....

PcapDB: Search Optimized Packet Capture, Version 0.1.0.0

Energy Technology Data Exchange (ETDEWEB)

2016-11-04

PcapDB is a packet capture system designed to optimize the captured data for fast search in the typical (network incident response) use case. The technology involved in this software has been submitted via the IDEAS system and has been filed as a provisional patent. It includes the following primary components: capture: The capture component utilizes existing capture libraries to retrieve packets from network interfaces. Once retrieved the packets are passed to additional threads for sorting into flows and indexing. The sorted flows and indexes are passed to other threads so that they can be written to disk. These components are written in the C programming language. search: The search components provide a means to find relevant flows and the associated packets. A search query is parsed and represented as a search tree. Various search commands, written in C, are then used resolve this tree into a set of search results. The tree generation and search execution management components are written in python. interface: The PcapDB web interface is written in Python on the Django framework. It provides a series of pages, API's, and asynchronous tasks that allow the user to manage the capture system, perform searches, and retrieve results. Web page components are written in HTML,CSS and Javascript.

Automatic spike sorting using tuning information.

Science.gov (United States)

Ventura, Valérie

2009-09-01

Current spike sorting methods focus on clustering neurons' characteristic spike waveforms. The resulting spike-sorted data are typically used to estimate how covariates of interest modulate the firing rates of neurons. However, when these covariates do modulate the firing rates, they provide information about spikes' identities, which thus far have been ignored for the purpose of spike sorting. This letter describes a novel approach to spike sorting, which incorporates both waveform information and tuning information obtained from the modulation of firing rates. Because it efficiently uses all the available information, this spike sorter yields lower spike misclassification rates than traditional automatic spike sorters. This theoretical result is verified empirically on several examples. The proposed method does not require additional assumptions; only its implementation is different. It essentially consists of performing spike sorting and tuning estimation simultaneously rather than sequentially, as is currently done. We used an expectation-maximization maximum likelihood algorithm to implement the new spike sorter. We present the general form of this algorithm and provide a detailed implementable version under the assumptions that neurons are independent and spike according to Poisson processes. Finally, we uncover a systematic flaw of spike sorting based on waveform information only.

What is a Sorting Function?

DEFF Research Database (Denmark)

Henglein, Fritz

2009-01-01

What is a sorting function—not a sorting function for a given ordering relation, but a sorting function with nothing given? Formulating four basic properties of sorting algorithms as defining requirements, we arrive at intrinsic notions of sorting and stable sorting: A function is a sorting...... are derivable without compromising data abstraction. Finally we point out that stable sorting functions as default representations of ordering relations have the advantage of permitting linear-time sorting algorithms; inequality tests forfeit this possibility....... function if and only it is an intrinsically parametric permutation function. It is a stable sorting function if and only if it is an intrinsically stable permutation function. We show that ordering relations can be represented isomorphically as inequality tests, comparators and stable sorting functions...

Data Sorting Using Graphics Processing Units

Directory of Open Access Journals (Sweden)

M. J. Mišić

2012-06-01

Full Text Available Graphics processing units (GPUs have been increasingly used for general-purpose computation in recent years. The GPU accelerated applications are found in both scientific and commercial domains. Sorting is considered as one of the very important operations in many applications, so its efficient implementation is essential for the overall application performance. This paper represents an effort to analyze and evaluate the implementations of the representative sorting algorithms on the graphics processing units. Three sorting algorithms (Quicksort, Merge sort, and Radix sort were evaluated on the Compute Unified Device Architecture (CUDA platform that is used to execute applications on NVIDIA graphics processing units. Algorithms were tested and evaluated using an automated test environment with input datasets of different characteristics. Finally, the results of this analysis are briefly discussed.

Big Five Measurement via Q-Sort

Directory of Open Access Journals (Sweden)

Chris D. Fluckinger

2014-08-01

Full Text Available Socially desirable responding presents a difficult challenge in measuring personality. I tested whether a partially ipsative measure—a normatively scored Q-sort containing traditional Big Five items—would produce personality scores indicative of less socially desirable responding compared with Likert-based measures. Across both instructions to respond honestly and in the context of applying for a job, the Q-sort produced lower mean scores, lower intercorrelations between dimensions, and similar validity in predicting supervisor performance ratings to Likert. In addition, the Q-sort produced a more orthogonal structure (but not fully orthogonal when modeled at the latent level. These results indicate that the Q-sort method did constrain socially desirable responding. Researchers and practitioners should consider Big Five measurement via Q-sort for contexts in which high socially desirable responding is expected.

Incomplete lineage sorting patterns among human, chimpanzee and orangutan suggest recent orangutan speciation and widespread selection

DEFF Research Database (Denmark)

Hobolth, Asger; Dutheil, Julien; Hawks, John

2011-01-01

We search the complete orangutan genome for regions where humans are more closely related to orangutans than to chimpanzees due to incomplete lineage sorting (ILS) in the ancestor of human and chimpanzees. The search uses our recently developed coalescent HMM framework. We find ILS present in ~1%...

Sex-sorting sperm using flow cytometry/cell sorting.

Science.gov (United States)

Garner, Duane L; Evans, K Michael; Seidel, George E

2013-01-01

The sex of mammalian offspring can be predetermined by flow sorting relatively pure living populations of X- and Y-chromosome-bearing sperm. This method is based on precise staining of the DNA of sperm with the nucleic acid-specific fluorophore, Hoechst 33342, to differentiate between the subpopulations of X- and Y-sperm. The fluorescently stained sperm are then sex-sorted using a specialized high speed sorter, MoFlo(®) SX XDP, and collected into biologically supportive media prior to reconcentration and cryopreservation in numbers adequate for use with artificial insemination for some species or for in vitro fertilization. Sperm sorting can provide subpopulations of X- or Y-bearing bovine sperm at rates in the 8,000 sperm/s range while maintaining; a purity of 90% such that it has been applied to cattle on a commercial basis. The sex of offspring has been predetermined in a wide variety of mammalian species including cattle, swine, horses, sheep, goats, dogs, cats, deer, elk, dolphins, water buffalo as well as in humans using flow cytometric sorting of X- and Y-sperm.

Sorting waves and associated eigenvalues

Science.gov (United States)

Carbonari, Costanza; Colombini, Marco; Solari, Luca

2017-04-01

The presence of mixed sediment always characterizes gravel bed rivers. Sorting processes take place during bed load transport of heterogeneous sediment mixtures. The two main elements necessary to the occurrence of sorting are the heterogeneous character of sediments and the presence of an active sediment transport. When these two key ingredients are simultaneously present, the segregation of bed material is consistently detected both in the field [7] and in laboratory [3] observations. In heterogeneous sediment transport, bed altimetric variations and sorting always coexist and both mechanisms are independently capable of driving the formation of morphological patterns. Indeed, consistent patterns of longitudinal and transverse sorting are identified almost ubiquitously. In some cases, such as bar formation [2] and channel bends [5], sorting acts as a stabilizing effect and therefore the dominant mechanism driving pattern formation is associated with bed altimetric variations. In other cases, such as longitudinal streaks, sorting enhances system instability and can therefore be considered the prevailing mechanism. Bedload sheets, first observed by Khunle and Southard [1], represent another classic example of a morphological pattern essentially triggered by sorting, as theoretical [4] and experimental [3] results suggested. These sorting waves cause strong spatial and temporal fluctuations of bedload transport rate typical observed in gravel bed rivers. The problem of bed load transport of a sediment mixture is formulated in the framework of a 1D linear stability analysis. The base state consists of a uniform flow in an infinitely wide channel with active bed load transport. The behaviour of the eigenvalues associated with fluid motion, bed evolution and sorting processes in the space of the significant flow and sediment parameters is analysed. A comparison is attempted with the results of the theoretical analysis of Seminara Colombini and Parker [4] and Stecca

Recent results on SUSY searches from CMS

CERN Multimedia

CERN. Geneva

2013-01-01

The latest results on searches for Supersymmetry from CMS are reviewed. We present searches for direct stop production, searches in final states with four W bosons and multiple b-quarks, and searches for R-Parity violating SUSY. The results use up to 20/fb of data from the 8 TeV LHC run of 2012.

Parallel integer sorting with medium and fine-scale parallelism

Science.gov (United States)

Dagum, Leonardo

1993-01-01

Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.

Ready, steady, SORT!

CERN Document Server

Laëtitia Pedroso

2010-01-01

The selective or ecological sorting of waste is already second nature to many of us and concerns us all. As the GS Department's new awareness-raising campaign reminds us, everything we do to sort waste contributes to preserving the environment.    Placemats printed on recycled paper using vegetable-based ink will soon be distributed in Restaurant No.1.   Environmental protection is never far from the headlines, and CERN has a responsibility to ensure that the 3000 tonnes and more of waste it produces every year are correctly and selectively sorted. Materials can be given a second life through recycling and re-use, thereby avoiding pollution from landfill sites and incineration plants and saving on processing costs. The GS Department is launching a new poster campaign designed to raise awareness of the importance of waste sorting and recycling. "After conducting a survey to find out whether members of the personnel were prepared to make an effort to sort a...

Application of radix sorting in high energy physics experiment

International Nuclear Information System (INIS)

Chen Xuan; Gu Minhao; Zhu Kejun

2012-01-01

In the high energy physics experiments, there are always requirements to sort the large scale of experiment data. To meet the demand, this paper introduces one radix sorting algorithms, whose sub-sort is counting sorting and time complex is O (n), based on the characteristic of high energy physics experiment data that is marked by time stamp. This paper gives the description, analysis, implementation and experimental result of the sorting algorithms. (authors)

How to improve your PubMed/MEDLINE searches: 2. display settings, complex search queries and topic searching.

Science.gov (United States)

Fatehi, Farhad; Gray, Leonard C; Wootton, Richard

2014-01-01

The way that PubMed results are displayed can be changed using the Display Settings drop-down menu in the result screen. There are three groups of options: Format, Items per page and Sort by, which allow a good deal of control. The results from several searches can be temporarily stored on the Clipboard. Records of interest can be selected on the results page using check boxes and can then be combined, for example to form a reference list. The Related Citations is a valuable feature of PubMed that can provide a set of similar articles when you have identified a record of interest among the results. You can easily search for RCTs or reviews using the appropriate filters or field tags. If you are interested in clinical articles, rather than basic science or health service research, then the Clinical Queries tool on the PubMed home page can be used to retrieve them.

Particle Transport and Size Sorting in Bubble Microstreaming Flow

Science.gov (United States)

Thameem, Raqeeb; Rallabandi, Bhargav; Wang, Cheng; Hilgenfeldt, Sascha

2014-11-01

Ultrasonic driving of sessile semicylindrical bubbles results in powerful steady streaming flows that are robust over a wide range of driving frequencies. In a microchannel, this flow field pattern can be fine-tuned to achieve size-sensitive sorting and trapping of particles at scales much smaller than the bubble itself; the sorting mechanism has been successfully described based on simple geometrical considerations. We investigate the sorting process in more detail, both experimentally (using new parameter variations that allow greater control over the sorting) and theoretically (incorporating the device geometry as well as the superimposed channel flow into an asymptotic theory). This results in optimized criteria for size sorting and a theoretical description that closely matches the particle behavior close to the bubble, the crucial region for size sorting.

Online sorting of recovered wood waste by automated XRF-technology: part II. Sorting efficiencies.

Science.gov (United States)

Hasan, A Rasem; Solo-Gabriele, Helena; Townsend, Timothy

2011-04-01

Sorting of waste wood is an important process practiced at recycling facilities in order to detect and divert contaminants from recycled wood products. Contaminants of concern include arsenic, chromium and copper found in chemically preserved wood. The objective of this research was to evaluate the sorting efficiencies of both treated and untreated parts of the wood waste stream, and metal (As, Cr and Cu) mass recoveries by the use of automated X-ray fluorescence (XRF) systems. A full-scale system was used for experimentation. This unit consisted of an XRF-detection chamber mounted on the top of a conveyor and a pneumatic slide-way diverter which sorted wood into presumed treated and presumed untreated piles. A randomized block design was used to evaluate the operational conveyance parameters of the system, including wood feed rate and conveyor belt speed. Results indicated that online sorting efficiencies of waste wood by XRF technology were high based on number and weight of pieces (70-87% and 75-92% for treated wood and 66-97% and 68-96% for untreated wood, respectively). These sorting efficiencies achieved mass recovery for metals of 81-99% for As, 75-95% for Cu and 82-99% of Cr. The incorrect sorting of wood was attributed almost equally to deficiencies in the detection and conveyance/diversion systems. Even with its deficiencies, the system was capable of producing a recyclable portion that met residential soil quality levels established for Florida, for an infeed that contained 5% of treated wood. Copyright © 2010 Elsevier Ltd. All rights reserved.

Sorting a distribution theory

CERN Document Server

Mahmoud, Hosam M

2011-01-01

A cutting-edge look at the emerging distributional theory of sorting Research on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment of the

Replication Improves Sorting-Task Results Analyzed by DISTATIS in a Consumer Study of American Bourbon and Rye Whiskeys.

Science.gov (United States)

Lahne, Jacob; Collins, Thomas S; Heymann, Hildegarde

2016-05-01

In consumer food-sensory studies, sorting and closely related methods (for example, projective mapping) have often been applied to large product sets which are complex and fatiguing for panelists. Analysis of sorting by Multi-Dimensional Scaling (MDS) is common, but this method discards relevant individual decisions; analysis by DISTATIS, which accounts for individual differences, is gaining acceptance. This research posits that replication can improve DISTATIS analysis by stabilizing consumer sensory maps, which are often extremely unstable. As a case study a fatiguing product set was sorted: 10 American whiskeys-5 bourbons and 5 ryes-were sorted into groups by 21 consumers over 2 replications. These products were chosen because American whiskeys are some of the most important distilled beverages in today's market; in particular, "bourbon" (mashbill more than 50% corn) and "rye" (more than 50% rye) whiskeys are important and assumed to be products with distinct sensory attributes. However, there is almost no scientific information about their sensory properties. Data were analyzed using standard and aggregated DISTATIS and MDS. No significant relationship between mashbill and consumer categorization in whiskeys was found; instead, there was evidence of producer and aging effects. aggregated DISTATIS was found to provide more stable results than without replication, and DISTATIS results provided a number of benefits over MDS, including bootstrapped confidence intervals for product separation. In addition, this is the first published evidence that mashbill does not determine sensory properties of American whiskey: bourbons and ryes, while legally distinct, were not separated by consumers. © 2016 Institute of Food Technologists®

Non-SUSY Searches at the Tevatron

International Nuclear Information System (INIS)

Strologas, John

2011-01-01

We present recent results from searches for new physics beyond supersymmetry performed at the Tevatron accelerator at Fermilab. The CDF and D0 analyses presented here utilized data of integrated luminosity up to 6 fb -1 . We cover leptonic and bosonic resonances interpreted in the Randall-Sundrum graviton and new-boson models, rare final states, and the search for vector-like quarks. The search for new phenomena beyond the weak-scale supersymmetry is a vital part of the Fermilab program. Both CDF and D0 experiments at the Tevatron collider actively look for signals not expected by the standard model (SM) or minimal supersymmetric models. The searches can be sorted in three categories: (a) searches for generic resonances that can be interpreted in several new-physics models; (b) searches for exotic combinations of final-state objects or abnormal kinematics (not necessarily predicted by current theories); and (c) model-dependent searches that test a particular theory. We present here latest results from all these categories: searches for new dilepton and diboson resonances (interpreted as gravitons and new gauge bosons), searches for anomalous γ + E T + X production, and searches for vector-like quarks.

Search for intervalmodels

DEFF Research Database (Denmark)

Høskuldsson, Agnar

1996-01-01

Methods are presented that carry out sorting of data according to some criteria, and investigate the possibilities of finding intervals that give separate models relative to the given data. The methods presented are more reliable than related clustering methods, because the search is carried out...

Wage Sorting Trends

DEFF Research Database (Denmark)

Bagger, Jesper; Vejlin, Rune Majlund; Sørensen, Kenneth Lykke

Using a population-wide Danish Matched Employer-Employee panel from 1980-2006, we document a strong trend towards more positive assortative wage sorting. The correlation between worker and firm fixed effects estimated from a log wage regression increases from -0.07 in 1981 to .14 in 2001. The non......Using a population-wide Danish Matched Employer-Employee panel from 1980-2006, we document a strong trend towards more positive assortative wage sorting. The correlation between worker and firm fixed effects estimated from a log wage regression increases from -0.07 in 1981 to .14 in 2001....... The nonstationary wage sorting pattern is not due to compositional changes in the labor market, primarily occurs among high wage workers, and comprises 41 percent of the increase in the standard deviation of log real wages between 1980 and 2006. We show that the wage sorting trend is associated with worker...

Flow sorting in aquatic ecology

Directory of Open Access Journals (Sweden)

Marcus Reckermann

2000-06-01

Full Text Available Flow sorting can be a very helpful tool in revealing phytoplankton and bacterial community structure and elaborating specific physiological parameters of isolated species. Droplet sorting has been the most common technique. Despite the high optical and hydro-dynamic stress for the cells to be sorted, many species grow in culture subsequent to sorting. To date, flow sorting has been applied to post-incubation separation in natural water samples to account for group-specific physiological parameters (radiotracer-uptake rates, to the production of clonal or non-clonal cultures from mixtures, to the isolaton of cell groups from natural assemblages for molecular analyses, and for taxonomic identification of sorted cells by microscopy. The application of cell sorting from natural water samples from the Wadden Sea, including different cryptophytes, cyanobacteria and diatoms, is shown, as well as the establishment of laboratory cultures from field samples. The optional use of a red laser to account for phycocyanine-rich cells is also discussed.

Ore sorting

International Nuclear Information System (INIS)

Hawkins, A.P.; Richards, A.W.

1982-01-01

In an ore sorting apparatus, ore particles are bombarded with neutrons in a chamber and sorted by detecting radiation emitted by isotopes of elements, such as gold, forming or contained in the particles, using detectors and selectively controlling fluid jets. The isotopes can be selectively recognised by their radiation characteristics. In an alternative embodiment, shorter life isotopes are formed by neutron bombardment and detection of radiation takes place immediately adjacent the region of bombardment

External parallel sorting with multiprocessor computers

International Nuclear Information System (INIS)

Comanceau, S.I.

1984-01-01

This article describes methods of external sorting in which the entire main computer memory is used for the internal sorting of entries, forming out of them sorted segments of the greatest possible size, and outputting them to external memories. The obtained segments are merged into larger segments until all entries form one ordered segment. The described methods are suitable for sequential files stored on magnetic tape. The needs of the sorting algorithm can be met by using the relatively slow peripheral storage devices (e.g., tapes, disks, drums). The efficiency of the external sorting methods is determined by calculating the total sorting time as a function of the number of entries to be sorted and the number of parallel processors participating in the sorting process

Magnethophoretic sorting of fluid catalytic cracking particles

NARCIS (Netherlands)

Solsona, Miguel; Nieuwelink, A. E.; Odijk, Mathieu; Meirer, Florian; Abelmann, Leon; Olthuis, Wouter; Weckhuysen, Bert M.; van den Berg, Albert; Lee, Abraham; DeVoe, Don

2017-01-01

We demonstrate an on-chip particle activity sorter, focused on iron concentration and based on magnetophoresis. This device was used for fast sorting of stepwise homogenously distributed [Fe]s. The preliminary results are very encouraging. We show that we can sort particles on magnetic moment, with

A Hybrid Model Ranking Search Result for Research Paper Searching on Social Bookmarking

Directory of Open Access Journals (Sweden)

pijitra jomsri

2015-11-01

Full Text Available Social bookmarking and publication sharing systems are essential tools for web resource discovery. The performance and capabilities of search results from research paper bookmarking system are vital. Many researchers use social bookmarking for searching papers related to their topics of interest. This paper proposes a combination of similarity based indexing “tag title and abstract” and static ranking to improve search results. In this particular study, the year of the published paper and type of research paper publication are combined with similarity ranking called (HybridRank. Different weighting scores are employed. The retrieval performance of these weighted combination rankings are evaluated using mean values of NDCG. The results suggest that HybridRank and similarity rank with weight 75:25 has the highest NDCG scores. From the preliminary result of experiment, the combination ranking technique provide more relevant research paper search results. Furthermore the chosen heuristic ranking can improve the efficiency of research paper searching on social bookmarking websites.

The Q sort theory and technique.

Science.gov (United States)

Nyatanga, L

1989-10-01

This paper is based on the author's experience of using the Q sort technique with BA Social Sciences (BASS) students, and the community psychiatric nursing (CPN, ENB No 811 course). The paper focuses on two main issues: 1. The theoretical assumptions underpinning the Q Sort technique. Carl Rogers' self theory and some of the values of humanistic psychology are summarised. 2. The actual technique procedure and meaning of results are highlighted. As the Q Sort technique is potentially useful in a variety of sittings some of which are listed in this paper, the emphasis has deliberately been placed in understanding the theoretical underpinning and the operationalisation (sensitive interpretation) of the theory to practice.

The role of color sorting machine in reducing food safety risks

Directory of Open Access Journals (Sweden)

Eleonora Kecskes-Nagy

2016-07-01

Full Text Available It is the very difficult problem how we can decrease food safety risks in the product, which was polluted in process of cropping. According to professional literature almost the prevention is considered as an exclusive method to keep below safe level the content of DON toxin. The source of food safety in food chain is that the primary products suit the food safety requirements. It is a very difficult or sometimes it is not possible to correct food safety risk factors - which got into the products during cultivation - in the course of processing. Such factor is fusariotoxin in fodder and bread wheat. DON toxin is the most frequent toxin in cereals. The objective of the searching was to investigate, if it is possible to decrease DON toxin content of durum wheat and to minimize the food safety risk by application milling technology with good production practice and technological conditions. The samples were taken in the first phase of milling technology just before and after color sorting. According to measuring results Sortex Z+ optical sorting decreased DON toxin content of wheat. This mean that the food safety risks can be reduced by Sortex Z+ optical sorting machine. Our experiments proved if there is color sorting in the cleaning process preceding the milling of wheat then a part of the grain of wheat infected by Fusarium sp. can be selected. This improves the food safety parameters of given lot of wheat and decrease the toxin content. The flour made from contaminated grains of wheat can be a serious food safety risk. We would like to support scientifically the technical development of milling technology with our experimental data. Normal 0 21 false false false HU X-NONE X-NONE MicrosoftInternetExplorer4

Optimal Taxation with On-the-Job Search

DEFF Research Database (Denmark)

Bagger, Jesper; Moen, Espen R.; Vejlin, Rune Majlund

We study the optimal taxation of labor income in the presence of search frictions. Heterogeneous workers undertake costly search off- and on-the-job in order to locate more productive jobs that pay higher wages. More productive workers search harder, resulting in equilibrium sorting where low......-type workers are overrepresented in low-wage jobs while high-type workers are overrepresented in high-wage jobs. Absent taxes, worker search effort is efficient, because the social and private gains from search coincide. The optimal tax system balance efficiency and equity concerns at the margin. Equity...... concerns make it desirable to levy low taxes on (or indeed, subsidize) low-wage jobs including unemployment, and levy high taxes on high-wage jobs. Efficiency concerns limit how much taxes an optimal tax system levy on high-paid jobs, as high taxes distort the workers' incentives to search. The model...

A Simple Deep Learning Method for Neuronal Spike Sorting

Science.gov (United States)

Yang, Kai; Wu, Haifeng; Zeng, Yu

2017-10-01

Spike sorting is one of key technique to understand brain activity. With the development of modern electrophysiology technology, some recent multi-electrode technologies have been able to record the activity of thousands of neuronal spikes simultaneously. The spike sorting in this case will increase the computational complexity of conventional sorting algorithms. In this paper, we will focus spike sorting on how to reduce the complexity, and introduce a deep learning algorithm, principal component analysis network (PCANet) to spike sorting. The introduced method starts from a conventional model and establish a Toeplitz matrix. Through the column vectors in the matrix, we trains a PCANet, where some eigenvalue vectors of spikes could be extracted. Finally, support vector machine (SVM) is used to sort spikes. In experiments, we choose two groups of simulated data from public databases availably and compare this introduced method with conventional methods. The results indicate that the introduced method indeed has lower complexity with the same sorting errors as the conventional methods.

The effect of query complexity on Web searching results

Directory of Open Access Journals (Sweden)

B.J. Jansen

2000-01-01

Full Text Available This paper presents findings from a study of the effects of query structure on retrieval by Web search services. Fifteen queries were selected from the transaction log of a major Web search service in simple query form with no advanced operators (e.g., Boolean operators, phrase operators, etc. and submitted to 5 major search engines - Alta Vista, Excite, FAST Search, Infoseek, and Northern Light. The results from these queries became the baseline data. The original 15 queries were then modified using the various search operators supported by each of the 5 search engines for a total of 210 queries. Each of these 210 queries was also submitted to the applicable search service. The results obtained were then compared to the baseline results. A total of 2,768 search results were returned by the set of all queries. In general, increasing the complexity of the queries had little effect on the results with a greater than 70% overlap in results, on average. Implications for the design of Web search services and directions for future research are discussed.

Short-term Internet search using makes people rely on search engines when facing unknown issues.

Science.gov (United States)

Wang, Yifan; Wu, Lingdan; Luo, Liang; Zhang, Yifen; Dong, Guangheng

2017-01-01

The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

Short-term Internet search using makes people rely on search engines when facing unknown issues.

Directory of Open Access Journals (Sweden)

Yifan Wang

Full Text Available The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

Simple sorting algorithm test based on CUDA

OpenAIRE

Meng, Hongyu; Guo, Fangjin

2015-01-01

With the development of computing technology, CUDA has become a very important tool. In computer programming, sorting algorithm is widely used. There are many simple sorting algorithms such as enumeration sort, bubble sort and merge sort. In this paper, we test some simple sorting algorithm based on CUDA and draw some useful conclusions.

A Quality Sorting of Fruit Using a New Automatic Image Processing Method

Science.gov (United States)

Amenomori, Michihiro; Yokomizu, Nobuyuki

This paper presents an innovative approach for quality sorting of objects such as apples sorting in an agricultural factory, using an image processing algorithm. The objective of our approach are; firstly to sort the objects by their colors precisely; secondly to detect any irregularity of the colors surrounding the apples efficiently. An experiment has been conducted and the results have been obtained and compared with that has been preformed by human sorting process and by color sensor sorting devices. The results demonstrate that our approach is capable to sort the objects rapidly and the percentage of classification valid rate was 100 %.

Layers in sorting practices: Sorting out patients with potential cancer

DEFF Research Database (Denmark)

Møller, Naja Holten; Bjørn, Pernille

2011-01-01

for a particular patient. Due to the limited resources within the Danish healthcare system, initiating cancer pathways for all patients with a remote suspicion of cancer would crash the system, as it would be impossible for healthcare professionals to commit to the prescribed schedules and times defined...... they show that sorting patients before initiating a standardized cancer pathway is not a simple process of deciding on a predefined category that will stipulate particular dates and times. Instead, these informal sorting mechanisms show that the process of sorting patients prior to diagnosis......In the last couple of years, widespread use of standardized cancer pathways has been seen across a range of countries, including Denmark, to improve prognosis of cancer patients. In Denmark, standardized cancer pathways take the form of guidelines prescribing well-defined sequences where steps...

Automatic Color Sorting of Hardwood Edge-Glued Panel Parts

Science.gov (United States)

D. Earl Kline; Richard Conners; Qiang Lu; Philip A. Araman

1997-01-01

This paper describes an automatic color sorting system for red oak edge-glued panel parts. The color sorting system simultaneously examines both faces of a panel part and then determines which face has the "best" color, and sorts the part into one of a number of color classes at plant production speeds. Initial test results show that the system generated over...

A general search for new phenomena with the ATLAS detector in pp collisions at sort(s)=7 TeV.

CERN Document Server

The ATLAS collaboration

2012-01-01

This note presents a model-independent general search for new physics in proton proton collisions at a centre-of-mass energy of 7 TeV with the ATLAS detector at the LHC. The data set, recorded by the ATLAS experiment during 2011, correspond to a total integrated luminosity of 4.7 fb-1. Event topologies involving isolated electrons, photons, muons, jets, b-jets and missing transverse momentum are investigated. The events are subdivided according to their final states into 655 exclusive analysis channels. For each channel, a search algorithm tests the compatibility of the effective mass distribution in data against the distribution in the Monte Carlo simulated background. Although this search approach is less sensitive than optimized searches for specific models it provides a more comprehensive in- vestigation for new physics signals. No significant deviations between data and the Standard Model expectations have been observed.

Semantic interpretation of search engine resultant

Science.gov (United States)

Nasution, M. K. M.

2018-01-01

In semantic, logical language can be interpreted in various forms, but the certainty of meaning is included in the uncertainty, which directly always influences the role of technology. One results of this uncertainty applies to search engines as user interfaces with information spaces such as the Web. Therefore, the behaviour of search engine results should be interpreted with certainty through semantic formulation as interpretation. Behaviour formulation shows there are various interpretations that can be done semantically either temporary, inclusion, or repeat.

Denni Algorithm An Enhanced Of SMS (Scan, Move and Sort) Algorithm

Science.gov (United States)

Aprilsyah Lubis, Denni; Salim Sitompul, Opim; Marwan; Tulus; Andri Budiman, M.

2017-12-01

Sorting has been a profound area for the algorithmic researchers, and many resources are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly. Sorting has been considered as a fundamental problem in the study of algorithms that due to many reasons namely, the necessary to sort information is inherent in many applications, algorithms often use sorting as a key subroutine, in algorithm design there are many essential techniques represented in the body of sorting algorithms, and many engineering issues come to the fore when implementing sorting algorithms., Many algorithms are very well known for sorting the unordered lists, and one of the well-known algorithms that make the process of sorting to be more economical and efficient is SMS (Scan, Move and Sort) algorithm, an enhancement of Quicksort invented Rami Mansi in 2010. This paper presents a new sorting algorithm called Denni-algorithm. The Denni algorithm is considered as an enhancement on the SMS algorithm in average, and worst cases. The Denni algorithm is compared with the SMS algorithm and the results were promising.

Chip-based droplet sorting

Energy Technology Data Exchange (ETDEWEB)

Beer, Neil Reginald; Lee, Abraham; Hatch, Andrew

2017-11-21

A non-contact system for sorting monodisperse water-in-oil emulsion droplets in a microfluidic device based on the droplet's contents and their interaction with an applied electromagnetic field or by identification and sorting.

Recent results on new particle searches at PETRA

International Nuclear Information System (INIS)

Kuster, H.

1986-01-01

Recent searches for new particles at PETRA are reviewed. Results on heavy lepton searches (charged and neutral), supersymmetry searches (SUSY partners of the electron, the photon, the W and Z gauge bosons, and the Higgs), and on searches for compositeness (excited leptons and leptoquarks) are presented. 25 figs.; 42 refs

Search Results | Page 141 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Strengthening Capacity to Respond to Computer Security Incidents in Latin America and the Caribbean. The Internet has become a crucial tool for companies and individuals to conduct all sorts of social and economic transactions. Project ...

The solution space of sorting by DCJ.

Science.gov (United States)

Braga, Marília D V; Stoye, Jens

2010-09-01

In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al. in 2005, allows one to represent most rearrangement events that could happen in multichromosomal genomes, such as inversions, translocations, fusions, and fissions. No restriction on the genome structure considering linear and circular chromosomes is imposed. An advantage of this general model is that it leads to considerable algorithmic simplifications compared to other genome rearrangement models. Recently, several works concerning the DCJ operation have been published, and in particular, an algorithm was proposed to find an optimal DCJ sequence for sorting one genome into another one. Here we study the solution space of this problem and give an easy-to-compute formula that corresponds to the exact number of optimal DCJ sorting sequences for a particular subset of instances of the problem. We also give an algorithm to count the number of optimal sorting sequences for any instance of the problem. Another interesting result is the demonstration of the possibility of obtaining one optimal sorting sequence by properly replacing any pair of consecutive operations in another optimal sequence. As a consequence, any optimal sorting sequence can be obtained from one other by applying such replacements successively, but the problem of finding the shortest number of replacements between two sorting sequences is still open.

The Container Problem in Bubble-Sort Graphs

Science.gov (United States)

Suzuki, Yasuto; Kaneko, Keiichi

Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between two arbitrary nodes in time bounded by a polynomial in n, the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of the path lengths after proving the correctness of the algorithm. In addition, we report the results of computer experiments evaluating the average performance of the algorithm.

Sorting on STAR. [CDC computer algorithm timing comparison

Science.gov (United States)

Stone, H. S.

1978-01-01

Timing comparisons are given for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's (1962) Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's (1968) sorting algorithm, which makes especially good use of vector operations but has a complexity of N(log N)-squared as compared with a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.

Combining results of multiple search engines in proteomics.

Science.gov (United States)

Shteynberg, David; Nesvizhskii, Alexey I; Moritz, Robert L; Deutsch, Eric W

2013-09-01

A crucial component of the analysis of shotgun proteomics datasets is the search engine, an algorithm that attempts to identify the peptide sequence from the parent molecular ion that produced each fragment ion spectrum in the dataset. There are many different search engines, both commercial and open source, each employing a somewhat different technique for spectrum identification. The set of high-scoring peptide-spectrum matches for a defined set of input spectra differs markedly among the various search engine results; individual engines each provide unique correct identifications among a core set of correlative identifications. This has led to the approach of combining the results from multiple search engines to achieve improved analysis of each dataset. Here we review the techniques and available software for combining the results of multiple search engines and briefly compare the relative performance of these techniques.

Combining Results of Multiple Search Engines in Proteomics*

Science.gov (United States)

Shteynberg, David; Nesvizhskii, Alexey I.; Moritz, Robert L.; Deutsch, Eric W.

2013-01-01

A crucial component of the analysis of shotgun proteomics datasets is the search engine, an algorithm that attempts to identify the peptide sequence from the parent molecular ion that produced each fragment ion spectrum in the dataset. There are many different search engines, both commercial and open source, each employing a somewhat different technique for spectrum identification. The set of high-scoring peptide-spectrum matches for a defined set of input spectra differs markedly among the various search engine results; individual engines each provide unique correct identifications among a core set of correlative identifications. This has led to the approach of combining the results from multiple search engines to achieve improved analysis of each dataset. Here we review the techniques and available software for combining the results of multiple search engines and briefly compare the relative performance of these techniques. PMID:23720762

T2-weighted four dimensional magnetic resonance imaging with result-driven phase sorting

International Nuclear Information System (INIS)

Liu, Yilin; Yin, Fang-Fang; Cai, Jing; Czito, Brian G.; Bashir, Mustafa R.

2015-01-01

Purpose: T2-weighted MRI provides excellent tumor-to-tissue contrast for target volume delineation in radiation therapy treatment planning. This study aims at developing a novel T2-weighted retrospective four dimensional magnetic resonance imaging (4D-MRI) phase sorting technique for imaging organ/tumor respiratory motion. Methods: A 2D fast T2-weighted half-Fourier acquisition single-shot turbo spin-echo MR sequence was used for image acquisition of 4D-MRI, with a frame rate of 2–3 frames/s. Respiratory motion was measured using an external breathing monitoring device. A phase sorting method was developed to sort the images by their corresponding respiratory phases. Besides, a result-driven strategy was applied to effectively utilize redundant images in the case when multiple images were allocated to a bin. This strategy, selecting the image with minimal amplitude error, will generate the most representative 4D-MRI. Since we are using a different image acquisition mode for 4D imaging (the sequential image acquisition scheme) with the conventionally used cine or helical image acquisition scheme, the 4D dataset sufficient condition was not obviously and directly predictable. An important challenge of the proposed technique was to determine the number of repeated scans (N_R) required to obtain sufficient phase information at each slice position. To tackle this challenge, the authors first conducted computer simulations using real-time position management respiratory signals of the 29 cancer patients under an IRB-approved retrospective study to derive the relationships between N_R and the following factors: number of slices (N_S), number of 4D-MRI respiratory bins (N_B), and starting phase at image acquisition (P_0). To validate the authors’ technique, 4D-MRI acquisition and reconstruction were simulated on a 4D digital extended cardiac-torso (XCAT) human phantom using simulation derived parameters. Twelve healthy volunteers were involved in an IRB-approved study

Playing with curricular milestones in the educational sandbox: Q-sort results from an internal medicine educational collaborative.

Science.gov (United States)

Meade, Lauren B; Caverzagie, Kelly J; Swing, Susan R; Jones, Ron R; O'Malley, Cheryl W; Yamazaki, Kenji; Zaas, Aimee K

2013-08-01

In competency-based medical education, the focus of assessment is on learner demonstration of predefined outcomes or competencies. One strategy being used in internal medicine (IM) is applying curricular milestones to assessment and reporting milestones to competence determination. The authors report a practical method for identifying sets of curricular milestones for assessment of a landmark, or a point where a resident can be entrusted with increased responsibility. Thirteen IM residency programs joined in an educational collaborative to apply curricular milestones to training. The authors developed a game using Q-sort methodology to identify high-priority milestones for the landmark "Ready for indirect supervision in essential ambulatory care" (EsAMB). During May to December 2010, the programs'ambulatory faculty participated in the Q-sort game to prioritize 22 milestones for EsAMB. The authors analyzed the data to identify the top 8 milestones. In total, 149 faculty units (1-4 faculty each) participated. There was strong agreement on the top eight milestones; six had more than 92% agreement across programs, and five had 75% agreement across all faculty units. During the Q-sort game, faculty engaged in dynamic discussion about milestones and expressed interest in applying the game to other milestones and educational settings. The Q-sort game enabled diverse programs to prioritize curricular milestones with interprogram and interparticipant consistency. A Q-sort exercise is an engaging and playful way to address milestones in medical education and may provide a practical first step toward using milestones in the real-world educational setting.

ScanSort{sup SM} at Whiteshell Laboratories for sorting of experimental cesium pond soil

Energy Technology Data Exchange (ETDEWEB)

Downey, H., E-mail: heath.downey@amecfw.com [Amec Foster Wheeler, Portland, ME (United States)

2015-07-01

The ScanSort{sup SM} soil sorting system is a unique and efficient radiological instrument used for measuring and sorting bulk soils and volumetric materials. The system performs automatic radioassay and segregation of preconditioned material using a gamma spectroscopy system mounted above a conveyor belt. It was deployed to the Whiteshell Laboratories site to process the excavated soils generated during the decommissioning of the former Experimental Cesium Pond. The ScanSort{sup SM} system was utilized to segregate material with Cs-137 concentrations above the established site unrestricted release and restricted site reuse levels as well as demonstrated the ability to accurately determine the radioactivity concentrations of the radiologically-impacted material and to confidently segregate volumes of that material for appropriate final disposition. (author)

Passive sorting of capsules by deformability

Science.gov (United States)

Haener, Edgar; Juel, Anne

We study passive sorting according to deformability of liquid-filled ovalbumin-alginate capsules. We present results for two sorting geometries: a straight channel with a half-cylindrical obstruction and a pinched flow fractioning device (PFF) adapted for use with capsules. In the half-cylinder device, the capsules deform as they encounter the obstruction, and travel around the half-cylinder. The distance from the capsule's centre of mass to the surface of the half-cylinder depends on deformability, and separation between capsules of different deformability is amplified by diverging streamlines in the channel expansion downstream of the obstruction. We show experimentally that capsules can be sorted according to deformability with their downstream position depending on capillary number only, and we establish the sensitivity of the device to experimental variability. In the PFF device, particles are compressed against a wall using a strong pinching flow. We show that capsule deformation increases with the intensity of the pinching flow, but that the downstream capsule position is not set by deformation in the device. However, when using the PFF device like a T-Junction, we achieve improved sorting resolution compared to the half-cylinder device.

PhySortR: a fast, flexible tool for sorting phylogenetic trees in R.

Science.gov (United States)

Stephens, Timothy G; Bhattacharya, Debashish; Ragan, Mark A; Chan, Cheong Xin

2016-01-01

A frequent bottleneck in interpreting phylogenomic output is the need to screen often thousands of trees for features of interest, particularly robust clades of specific taxa, as evidence of monophyletic relationship and/or reticulated evolution. Here we present PhySortR, a fast, flexible R package for classifying phylogenetic trees. Unlike existing utilities, PhySortR allows for identification of both exclusive and non-exclusive clades uniting the target taxa based on tip labels (i.e., leaves) on a tree, with customisable options to assess clades within the context of the whole tree. Using simulated and empirical datasets, we demonstrate the potential and scalability of PhySortR in analysis of thousands of phylogenetic trees without a priori assumption of tree-rooting, and in yielding readily interpretable trees that unambiguously satisfy the query. PhySortR is a command-line tool that is freely available and easily automatable.

Sorting out Downside Beta

NARCIS (Netherlands)

G.T. Post (Thierry); P. van Vliet (Pim); S.D. Lansdorp (Simon)

2009-01-01

textabstractDownside risk, when properly defined and estimated, helps to explain the cross-section of US stock returns. Sorting stocks by a proper estimate of downside market beta leads to a substantially larger cross-sectional spread in average returns than sorting on regular market beta. This

A QR code identification technology in package auto-sorting system

Science.gov (United States)

di, Yi-Juan; Shi, Jian-Ping; Mao, Guo-Yong

2017-07-01

Traditional manual sorting operation is not suitable for the development of Chinese logistics. For better sorting packages, a QR code recognition technology is proposed to identify the QR code label on the packages in package auto-sorting system. The experimental results compared with other algorithms in literatures demonstrate that the proposed method is valid and its performance is superior to other algorithms.

Three Sorts of Naturalism

DEFF Research Database (Denmark)

Fink, Hans

2006-01-01

In "Two sorts of Naturalism" John McDowell is sketching his own sort of naturalism in ethics as an alternative to "bald naturalism". In this paper I distinguish materialist, idealist and absolute conceptions of nature and of naturalism in order to provide a framework for a clearer understanding...

Enhancement of Selection, Bubble and Insertion Sorting Algorithm

OpenAIRE

Muhammad Farooq Umar; Ehsan Ullah Munir; Shafqat Ali Shad; Muhammad Wasif Nisar

2014-01-01

In everyday life there is a large amount of data to arrange because sorting removes any ambiguities and make the data analysis and data processing very easy, efficient and provides with cost less effort. In this study a set of improved sorting algorithms are proposed which gives better performance and design idea. In this study five new sorting algorithms (Bi-directional Selection Sort, Bi-directional bubble sort, MIDBiDirectional Selection Sort, MIDBidirectional bubble sort and linear insert...

Neuronal spike sorting based on radial basis function neural networks

Directory of Open Access Journals (Sweden)

Taghavi Kani M

2011-02-01

Full Text Available "nBackground: Studying the behavior of a society of neurons, extracting the communication mechanisms of brain with other tissues, finding treatment for some nervous system diseases and designing neuroprosthetic devices, require an algorithm to sort neuralspikes automatically. However, sorting neural spikes is a challenging task because of the low signal to noise ratio (SNR of the spikes. The main purpose of this study was to design an automatic algorithm for classifying neuronal spikes that are emitted from a specific region of the nervous system."n "nMethods: The spike sorting process usually consists of three stages: detection, feature extraction and sorting. We initially used signal statistics to detect neural spikes. Then, we chose a limited number of typical spikes as features and finally used them to train a radial basis function (RBF neural network to sort the spikes. In most spike sorting devices, these signals are not linearly discriminative. In order to solve this problem, the aforesaid RBF neural network was used."n "nResults: After the learning process, our proposed algorithm classified any arbitrary spike. The obtained results showed that even though the proposed Radial Basis Spike Sorter (RBSS reached to the same error as the previous methods, however, the computational costs were much lower compared to other algorithms. Moreover, the competitive points of the proposed algorithm were its good speed and low computational complexity."n "nConclusion: Regarding the results of this study, the proposed algorithm seems to serve the purpose of procedures that require real-time processing and spike sorting.

Annotating images by mining image search results.

Science.gov (United States)

Wang, Xin-Jing; Zhang, Lei; Li, Xirong; Ma, Wei-Ying

2008-11-01

Although it has been studied for years by the computer vision and machine learning communities, image annotation is still far from practical. In this paper, we propose a novel attempt at model-free image annotation, which is a data-driven approach that annotates images by mining their search results. Some 2.4 million images with their surrounding text are collected from a few photo forums to support this approach. The entire process is formulated in a divide-and-conquer framework where a query keyword is provided along with the uncaptioned image to improve both the effectiveness and efficiency. This is helpful when the collected data set is not dense everywhere. In this sense, our approach contains three steps: 1) the search process to discover visually and semantically similar search results, 2) the mining process to identify salient terms from textual descriptions of the search results, and 3) the annotation rejection process to filter out noisy terms yielded by Step 2. To ensure real-time annotation, two key techniques are leveraged-one is to map the high-dimensional image visual features into hash codes, the other is to implement it as a distributed system, of which the search and mining processes are provided as Web services. As a typical result, the entire process finishes in less than 1 second. Since no training data set is required, our approach enables annotating with unlimited vocabulary and is highly scalable and robust to outliers. Experimental results on both real Web images and a benchmark image data set show the effectiveness and efficiency of the proposed algorithm. It is also worth noting that, although the entire approach is illustrated within the divide-and conquer framework, a query keyword is not crucial to our current implementation. We provide experimental results to prove this.

CellSort: a support vector machine tool for optimizing fluorescence-activated cell sorting and reducing experimental effort.

Science.gov (United States)

Yu, Jessica S; Pertusi, Dante A; Adeniran, Adebola V; Tyo, Keith E J

2017-03-15

High throughput screening by fluorescence activated cell sorting (FACS) is a common task in protein engineering and directed evolution. It can also be a rate-limiting step if high false positive or negative rates necessitate multiple rounds of enrichment. Current FACS software requires the user to define sorting gates by intuition and is practically limited to two dimensions. In cases when multiple rounds of enrichment are required, the software cannot forecast the enrichment effort required. We have developed CellSort, a support vector machine (SVM) algorithm that identifies optimal sorting gates based on machine learning using positive and negative control populations. CellSort can take advantage of more than two dimensions to enhance the ability to distinguish between populations. We also present a Bayesian approach to predict the number of sorting rounds required to enrich a population from a given library size. This Bayesian approach allowed us to determine strategies for biasing the sorting gates in order to reduce the required number of enrichment rounds. This algorithm should be generally useful for improve sorting outcomes and reducing effort when using FACS. Source code available at http://tyolab.northwestern.edu/tools/ . k-tyo@northwestern.edu. Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

An empirical study on SAJQ (Sorting Algorithm for Join Queries

Directory of Open Access Journals (Sweden)

Hassan I. Mathkour

2010-06-01

Full Text Available Most queries that applied on database management systems (DBMS depend heavily on the performance of the used sorting algorithm. In addition to have an efficient sorting algorithm, as a primary feature, stability of such algorithms is a major feature that is needed in performing DBMS queries. In this paper, we study a new Sorting Algorithm for Join Queries (SAJQ that has both advantages of being efficient and stable. The proposed algorithm takes the advantage of using the m-way-merge algorithm in enhancing its time complexity. SAJQ performs the sorting operation in a time complexity of O(nlogm, where n is the length of the input array and m is number of sub-arrays used in sorting. An unsorted input array of length n is arranged into m sorted sub-arrays. The m-way-merge algorithm merges the sorted m sub-arrays into the final output sorted array. The proposed algorithm keeps the stability of the keys intact. An analytical proof has been conducted to prove that, in the worst case, the proposed algorithm has a complexity of O(nlogm. Also, a set of experiments has been performed to investigate the performance of the proposed algorithm. The experimental results have shown that the proposed algorithm outperforms other Stable–Sorting algorithms that are designed for join-based queries.

Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm

Science.gov (United States)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is considered to be more complex due to the multiple business criteria that must be satisfied. To solve the problem more efficiently and to obtain a set of non-dominated solutions, a meta-heuristic based non-dominated sorting genetic algorithm is presented. In addition, task based representation is used for solution encoding, and tournament selection that is based on rank and crowding distance is applied for offspring selection. Swapping and insertion mutations are employed to increase diversity of population and to perform intensive search. To evaluate the modified non-dominated sorting genetic algorithm, a set of modified benchmarking job shop problems obtained from the OR-Library is used, and the results are considered based on the number of non-dominated solutions and quality of schedules obtained by the algorithm.

Surface acoustic wave actuated cell sorting (SAWACS).

Science.gov (United States)

Franke, T; Braunmüller, S; Schmid, L; Wixforth, A; Weitz, D A

2010-03-21

We describe a novel microfluidic cell sorter which operates in continuous flow at high sorting rates. The device is based on a surface acoustic wave cell-sorting scheme and combines many advantages of fluorescence activated cell sorting (FACS) and fluorescence activated droplet sorting (FADS) in microfluidic channels. It is fully integrated on a PDMS device, and allows fast electronic control of cell diversion. We direct cells by acoustic streaming excited by a surface acoustic wave which deflects the fluid independently of the contrast in material properties of deflected objects and the continuous phase; thus the device underlying principle works without additional enhancement of the sorting by prior labelling of the cells with responsive markers such as magnetic or polarizable beads. Single cells are sorted directly from bulk media at rates as fast as several kHz without prior encapsulation into liquid droplet compartments as in traditional FACS. We have successfully directed HaCaT cells (human keratinocytes), fibroblasts from mice and MV3 melanoma cells. The low shear forces of this sorting method ensure that cells survive after sorting.

Cache-Aware and Cache-Oblivious Adaptive Sorting

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf; Moruz, Gabriel

2005-01-01

Two new adaptive sorting algorithms are introduced which perform an optimal number of comparisons with respect to the number of inversions in the input. The first algorithm is based on a new linear time reduction to (non-adaptive) sorting. The second algorithm is based on a new division protocol...... for the GenericSort algorithm by Estivill-Castro and Wood. From both algorithms we derive I/O-optimal cache-aware and cache-oblivious adaptive sorting algorithms. These are the first I/O-optimal adaptive sorting algorithms....

Queue and stack sorting algorithm optimization and performance analysis

Science.gov (United States)

Qian, Mingzhu; Wang, Xiaobao

2018-04-01

Sorting algorithm is one of the basic operation of a variety of software development, in data structures course specializes in all kinds of sort algorithm. The performance of the sorting algorithm is directly related to the efficiency of the software. A lot of excellent scientific research queue is constantly optimizing algorithm, algorithm efficiency better as far as possible, the author here further research queue combined with stacks of sorting algorithms, the algorithm is mainly used for alternating operation queue and stack storage properties, Thus avoiding the need for a large number of exchange or mobile operations in the traditional sort. Before the existing basis to continue research, improvement and optimization, the focus on the optimization of the time complexity of the proposed optimization and improvement, The experimental results show that the improved effectively, at the same time and the time complexity and space complexity of the algorithm, the stability study corresponding research. The improvement and optimization algorithm, improves the practicability.

Pengembangan Algoritma Pengurutan SMS (Scan, Move, And Sort)

OpenAIRE

Lubis, Denni Aprilsyah

2015-01-01

Sorting has been a profound area for the algorithmic researchers. And many resources are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly. sorting has been considered as a fundamental problem in the study of algorithms that due to many reas...

Word Sorts for General Music Classes

Science.gov (United States)

Cardany, Audrey Berger

2015-01-01

Word sorts are standard practice for aiding children in acquiring skills in English language arts. When included in the general music classroom, word sorts may aid students in acquiring a working knowledge of music vocabulary. The author shares a word sort activity drawn from vocabulary in John Lithgow's children's book "Never Play…

A Sequence of Sorting Strategies.

Science.gov (United States)

Duncan, David R.; Litwiller, Bonnie H.

1984-01-01

Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

Coalescent-based species tree inference from gene tree topologies under incomplete lineage sorting by maximum likelihood.

Science.gov (United States)

Wu, Yufeng

2012-03-01

Incomplete lineage sorting can cause incongruence between the phylogenetic history of genes (the gene tree) and that of the species (the species tree), which can complicate the inference of phylogenies. In this article, I present a new coalescent-based algorithm for species tree inference with maximum likelihood. I first describe an improved method for computing the probability of a gene tree topology given a species tree, which is much faster than an existing algorithm by Degnan and Salter (2005). Based on this method, I develop a practical algorithm that takes a set of gene tree topologies and infers species trees with maximum likelihood. This algorithm searches for the best species tree by starting from initial species trees and performing heuristic search to obtain better trees with higher likelihood. This algorithm, called STELLS (which stands for Species Tree InfErence with Likelihood for Lineage Sorting), has been implemented in a program that is downloadable from the author's web page. The simulation results show that the STELLS algorithm is more accurate than an existing maximum likelihood method for many datasets, especially when there is noise in gene trees. I also show that the STELLS algorithm is efficient and can be applied to real biological datasets. © 2011 The Author. Evolution© 2011 The Society for the Study of Evolution.

Sorting out river channel patterns

NARCIS (Netherlands)

Kleinhans, M.G.

2010-01-01

Rivers self-organize their pattern/planform through feedbacks between bars, channels, floodplain and vegetation, which emerge as a result of the basic spatial sorting process of wash load sediment and bed sediment. The balance between floodplain formation and destruction determines the width and

Unsupervised spike sorting based on discriminative subspace learning.

Science.gov (United States)

Keshtkaran, Mohammad Reza; Yang, Zhi

2014-01-01

Spike sorting is a fundamental preprocessing step for many neuroscience studies which rely on the analysis of spike trains. In this paper, we present two unsupervised spike sorting algorithms based on discriminative subspace learning. The first algorithm simultaneously learns the discriminative feature subspace and performs clustering. It uses histogram of features in the most discriminative projection to detect the number of neurons. The second algorithm performs hierarchical divisive clustering that learns a discriminative 1-dimensional subspace for clustering in each level of the hierarchy until achieving almost unimodal distribution in the subspace. The algorithms are tested on synthetic and in-vivo data, and are compared against two widely used spike sorting methods. The comparative results demonstrate that our spike sorting methods can achieve substantially higher accuracy in lower dimensional feature space, and they are highly robust to noise. Moreover, they provide significantly better cluster separability in the learned subspace than in the subspace obtained by principal component analysis or wavelet transform.

Technology to sort lumber by color and grain for furniture parts

Science.gov (United States)

D. Earl Kline; Richard Conners; Philip A. Araman

2000-01-01

This paper describes an automatic color and grain sorting system for wood edge-glued panel parts. The color sorting system simultaneously examines both faces of a panel part and then determines which face has the "best" color, and sorts the part into one of a number of color classes at plant production speeds. In-plant test results show that the system...

Fixing the Sorting Algorithm for Android, Java and Python

NARCIS (Netherlands)

C.P.T. de Gouw (Stijn); F.S. de Boer (Frank)

2015-01-01

htmlabstractTim Peters developed the Timsort hybrid sorting algorithm in 2002. TimSort was first developed for Python, a popular programming language, but later ported to Java (where it appears as java.util.Collections.sort and java.util.Arrays.sort). TimSort is today used as the default sorting

IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA

Directory of Open Access Journals (Sweden)

Dwi Marhaendro Jati Purnomo

2016-06-01

Full Text Available Sorting is common process in computational world. Its utilization are on many fields from research to industry. There are many sorting algorithm in nowadays. One of the simplest yet powerful is bubble sort. In this study, bubble sort is implemented on FPGA. The implementation was taken on serial and parallel approach. Serial and parallel bubble sort then compared by means of its memory, execution time, and utility which comprises slices and LUTs. The experiments show that serial bubble sort required smaller memory as well as utility compared to parallel bubble sort. Meanwhile, parallel bubble sort performed faster than serial bubble sort

Results on SUSY and Higgs searches at CMS

CERN Multimedia

CERN. Geneva

2011-01-01

We present the results of searches for Supersymmetry and the Higgs boson performed using data collected in 2010 by the CMS experiment at the LHC in pp-collisions at a centre-of-mass energy of 7 TeV. Searches for Supersymmetry are performed in all-hadronic final states with jets and missing transverse energy and in final states including one or more isolated leptons or photons. No evidence for new physics is observed and limits are set on the predictions of a range of Supersymmetric scenarios. The results of searches for the Higgs boson are presented and limits set.

Using Design Sketch to Teach Bubble Sort in High School

OpenAIRE

Liu, Chih-Hao; Jiu, Yi-Wen; Chen, Jason Jen-Yen

2009-01-01

Bubble Sort is simple. Yet, it seems a bit difficult for high school students. This paper presents a pedagogical methodology: Using Design Sketch to visualize the concepts in Bubble Sort, and to evaluate how this approach assists students to understand the pseudo code of Bubble Sort. An experiment is conducted in Wu-Ling Senior High School with 250 students taking part. The statistical analysis of experimental results shows that, for relatively high abstraction concepts, such as iteration num...

Model design and simulation of automatic sorting machine using proximity sensor

Directory of Open Access Journals (Sweden)

Bankole I. Oladapo

2016-09-01

Full Text Available The automatic sorting system has been reported to be complex and a global problem. This is because of the inability of sorting machines to incorporate flexibility in their design concept. This research therefore designed and developed an automated sorting object of a conveyor belt. The developed automated sorting machine is able to incorporate flexibility and separate species of non-ferrous metal objects and at the same time move objects automatically to the basket as defined by the regulation of the Programmable Logic Controllers (PLC with a capacitive proximity sensor to detect a value range of objects. The result obtained shows that plastic, wood, and steel were sorted into their respective and correct position with an average, sorting, time of 9.903 s, 14.072 s and 18.648 s respectively. The proposed developed model of this research could be adopted at any institution or industries, whose practices are based on mechatronics engineering systems. This is to guide the industrial sector in sorting of object and teaching aid to institutions and hence produce the list of classified materials according to the enabled sorting program commands.

Sorting signed permutations by inversions in O(nlogn) time.

Science.gov (United States)

Swenson, Krister M; Rajan, Vaibhav; Lin, Yu; Moret, Bernard M E

2010-03-01

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inversions, improved algorithms have been designed, culminating with an optimal linear-time algorithm for computing the inversion distance and a subquadratic algorithm for providing a shortest sequence of inversions--also known as sorting by inversions. Remaining open was the question of whether sorting by inversions could be done in O(nlogn) time. In this article, we present a qualified answer to this question, by providing two new sorting algorithms, a simple and fast randomized algorithm and a deterministic refinement. The deterministic algorithm runs in time O(nlogn + kn), where k is a data-dependent parameter. We provide the results of extensive experiments showing that both the average and the standard deviation for k are small constants, independent of the size of the permutation. We conclude (but do not prove) that almost all signed permutations can be sorted by inversions in O(nlogn) time.

Improved Multiobjective Harmony Search Algorithm with Application to Placement and Sizing of Distributed Generation

Directory of Open Access Journals (Sweden)

Wanxing Sheng

2014-01-01

Full Text Available To solve the comprehensive multiobjective optimization problem, this study proposes an improved metaheuristic searching algorithm with combination of harmony search and the fast nondominated sorting approach. This is a kind of the novel intelligent optimization algorithm for multiobjective harmony search (MOHS. The detailed description and the algorithm formulating are discussed. Taking the optimal placement and sizing issue of distributed generation (DG in distributed power system as one example, the solving procedure of the proposed method is given. Simulation result on modified IEEE 33-bus test system and comparison with NSGA-II algorithm has proved that the proposed MOHS can get promising results for engineering application.

A Preliminary Study of MSD-First Radix-Sorting Methed

OpenAIRE

小田, 哲久

1984-01-01

Many kinds of sorting algorithms have been developed from the age of Punched Card System. Nowadays, any sorting algorithm can be called either (1) internal sorting methed or (2) external sorting method. Internal sorting method is used only when the number of records to be sorted (N) is not so large for the internal memory of the computer system. Larger memory space has become available with the aid of semiconductor technology. Therefore, it might be desired to develop a new internal sorting m...

Data parallel sorting for particle simulation

Science.gov (United States)

Dagum, Leonardo

1992-01-01

Sorting on a parallel architecture is a communications intensive event which can incur a high penalty in applications where it is required. In the case of particle simulation, only integer sorting is necessary, and sequential implementations easily attain the minimum performance bound of O (N) for N particles. Parallel implementations, however, have to cope with the parallel sorting problem which, in addition to incurring a heavy communications cost, can make the minimun performance bound difficult to attain. This paper demonstrates how the sorting problem in a particle simulation can be reduced to a merging problem, and describes an efficient data parallel algorithm to solve this merging problem in a particle simulation. The new algorithm is shown to be optimal under conditions usual for particle simulation, and its fieldwise implementation on the Connection Machine is analyzed in detail. The new algorithm is about four times faster than a fieldwise implementation of radix sort on the Connection Machine.

Application of visible spectroscopy in waste sorting

Science.gov (United States)

Spiga, Philippe; Bourely, Antoine

2011-10-01

Today, waste recycling, (bottles, papers...), is a mechanical operation: the waste are crushed, fused and agglomerated in order to obtain new manufactured products (e.g. new bottles, clothes ...). The plastics recycling is the main application in the color sorting process. The colorless plastics recovered are more valuable than the colored plastics. Other emergent applications are in the paper sorting, where the main goal is to sort dyed paper from white papers. Up to now, Pellenc Selective Technologies has manufactured color sorting machines based on RGB cameras. Three dimensions (red, green and blue) are no longer sufficient to detect low quantities of dye in the considered waste. In order to increase the efficiency of the color detection, a new sorting machine, based on visible spectroscopy, has been developed. This paper presents the principles of the two approaches and their difference in terms of sorting performance, making visible spectroscopy a clear winner.

The use of radiometric ore sorting on South African gold mines

International Nuclear Information System (INIS)

Boehme, R.C.; Freer, J.S.

1982-01-01

This paper refers to the radiometric sorting tests reported during the 7th CMMI Congress, and then describes the photometric and radiometric sorter installations in operation and under construction in South Africa at present. As radiometric sorting of gold ores uses the radiation from the uranium content as a tracer, it is essential that the sortability of the ore should be reliably determined before sorting is adopted. The method of obtaining the important ore characteristics is described, with examples. The possible increase in gold production from a hypothetical plant as a result of sorting is shown

ALGORITHM FOR SORTING GROUPED DATA

Science.gov (United States)

Evans, J. D.

1994-01-01

It is often desirable to sort data sets in ascending or descending order. This becomes more difficult for grouped data, i.e., multiple sets of data, where each set of data involves several measurements or related elements. The sort becomes increasingly cumbersome when more than a few elements exist for each data set. In order to achieve an efficient sorting process, an algorithm has been devised in which the maximum most significant element is found, and then compared to each element in succession. The program was written to handle the daily temperature readings of the Voyager spacecraft, particularly those related to the special tracking requirements of Voyager 2. By reducing each data set to a single representative number, the sorting process becomes very easy. The first step in the process is to reduce the data set of width 'n' to a data set of width '1'. This is done by representing each data set by a polynomial of length 'n' based on the differences of the maximum and minimum elements. These single numbers are then sorted and converted back to obtain the original data sets. Required input data are the name of the data file to read and sort, and the starting and ending record numbers. The package includes a sample data file, containing 500 sets of data with 5 elements in each set. This program will perform a sort of the 500 data sets in 3 - 5 seconds on an IBM PC-AT with a hard disk; on a similarly equipped IBM PC-XT the time is under 10 seconds. This program is written in BASIC (specifically the Microsoft QuickBasic compiler) for interactive execution and has been implemented on the IBM PC computer series operating under PC-DOS with a central memory requirement of approximately 40K of 8 bit bytes. A hard disk is desirable for speed considerations, but is not required. This program was developed in 1986.

Optimization of magnet sorting in a storage ring using genetic algorithms

International Nuclear Information System (INIS)

Chen Jia; Wang Lin; Li Weimin; Gao Weiwei

2013-01-01

In this paper, the genetic algorithms are applied to the optimization problem of magnet sorting in an electron storage ring, according to which the objectives are set so that the closed orbit distortion and beta beating can be minimized and the dynamic aperture maximized. The sorting of dipole, quadrupole and sextupole magnets is optimized while the optimization results show the power of the application of genetic algorithms in magnet sorting. (authors)

Sorting signed permutations by short operations.

Science.gov (United States)

Galvão, Gustavo Rodrigues; Lee, Orlando; Dias, Zanoni

2015-01-01

During evolution, global mutations may alter the order and the orientation of the genes in a genome. Such mutations are referred to as rearrangement events, or simply operations. In unichromosomal genomes, the most common operations are reversals, which are responsible for reversing the order and orientation of a sequence of genes, and transpositions, which are responsible for switching the location of two contiguous portions of a genome. The problem of computing the minimum sequence of operations that transforms one genome into another - which is equivalent to the problem of sorting a permutation into the identity permutation - is a well-studied problem that finds application in comparative genomics. There are a number of works concerning this problem in the literature, but they generally do not take into account the length of the operations (i.e. the number of genes affected by the operations). Since it has been observed that short operations are prevalent in the evolution of some species, algorithms that efficiently solve this problem in the special case of short operations are of interest. In this paper, we investigate the problem of sorting a signed permutation by short operations. More precisely, we study four flavors of this problem: (i) the problem of sorting a signed permutation by reversals of length at most 2; (ii) the problem of sorting a signed permutation by reversals of length at most 3; (iii) the problem of sorting a signed permutation by reversals and transpositions of length at most 2; and (iv) the problem of sorting a signed permutation by reversals and transpositions of length at most 3. We present polynomial-time solutions for problems (i) and (iii), a 5-approximation for problem (ii), and a 3-approximation for problem (iv). Moreover, we show that the expected approximation ratio of the 5-approximation algorithm is not greater than 3 for random signed permutations with more than 12 elements. Finally, we present experimental results that show

UCSD SORT Test (U-SORT): Examination of a newly developed organizational skills assessment tool for severely mentally ill adults.

Science.gov (United States)

Tiznado, Denisse; Mausbach, Brent T; Cardenas, Veronica; Jeste, Dilip V; Patterson, Thomas L

2010-12-01

The present investigation examined the validity of a new cognitive test intended to assess organizational skills. Participants were 180 middle-aged or older participants with a Diagnostic and Statistical Manual of Mental Disorders, Fourth Edition diagnosis of schizophrenia or schizoaffective disorder. Participants' organizational skills were measured using our newly developed University of California, San Diego Sorting Test (U-SORT), a performance-based test of organizational ability in which subjects sort objects (e.g., battery, pens) from a "junk drawer" into "keep" versus "trash" piles. Significant correlations between U-SORT scores and theoretically similar constructs (i.e. functional capacity, cognitive functioning, and clinical symptoms) were acceptable (mean r = 0.34), and weak correlations were found between U-SORT scores and theoretically dissimilar constructs (e.g., health symptoms, social support, gender; mean r = 0.06 ). The correlation between assessment scores provides preliminary support for the U-SORT test as a brief, easily transportable, reliable, and valid measure of functioning for this population.

Categorizing Variations of Student-Implemented Sorting Algorithms

Science.gov (United States)

Taherkhani, Ahmad; Korhonen, Ari; Malmi, Lauri

2012-01-01

In this study, we examined freshmen students' sorting algorithm implementations in data structures and algorithms' course in two phases: at the beginning of the course before the students received any instruction on sorting algorithms, and after taking a lecture on sorting algorithms. The analysis revealed that many students have insufficient…

Search Results | Page 88 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Search Results. Showing 871 - 880 of 8491 results. Studies ... Strengthening Nurses' Capacity in HIV Policy Development in Sub-Saharan Africa and the Caribbean ... Novel Epidemiological Method: Using Newspapers To Provide Insight Into ...

Search Results | Page 538 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Search Results. Showing 5371 - 5380 of 9604 results. Reports ... Business training for microfinance clients : how it matters and for whom? ... building a regional platform for political engagement and strategic action; final technical report.

GeoSearcher: Location-Based Ranking of Search Engine Results.

Science.gov (United States)

Watters, Carolyn; Amoudi, Ghada

2003-01-01

Discussion of Web queries with geospatial dimensions focuses on an algorithm that assigns location coordinates dynamically to Web sites based on the URL. Describes a prototype search system that uses the algorithm to re-rank search engine results for queries with a geospatial dimension, thus providing an alternative ranking order for search engine…

Sorting live stem cells based on Sox2 mRNA expression.

Directory of Open Access Journals (Sweden)

Hans M Larsson

Full Text Available While cell sorting usually relies on cell-surface protein markers, molecular beacons (MBs offer the potential to sort cells based on the presence of any expressed mRNA and in principle could be extremely useful to sort rare cell populations from primary isolates. We show here how stem cells can be purified from mixed cell populations by sorting based on MBs. Specifically, we designed molecular beacons targeting Sox2, a well-known stem cell marker for murine embryonic (mES and neural stem cells (NSC. One of our designed molecular beacons displayed an increase in fluorescence compared to a nonspecific molecular beacon both in vitro and in vivo when tested in mES and NSCs. We sorted Sox2-MB(+SSEA1(+ cells from a mixed population of 4-day retinoic acid-treated mES cells and effectively isolated live undifferentiated stem cells. Additionally, Sox2-MB(+ cells isolated from primary mouse brains were sorted and generated neurospheres with higher efficiency than Sox2-MB(- cells. These results demonstrate the utility of MBs for stem cell sorting in an mRNA-specific manner.

On the Construction of Sorted Reactive Systems

DEFF Research Database (Denmark)

Birkedal, Lars; Debois, Søren; Hildebrandt, Thomas

2008-01-01

We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand...... bigraphs. Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more...

A Sort-Last Rendering System over an Optical Backplane

Directory of Open Access Journals (Sweden)

Yasuhiro Kirihata

2005-06-01

Full Text Available Sort-Last is a computer graphics technique for rendering extremely large data sets on clusters of computers. Sort-Last works by dividing the data set into even-sized chunks for parallel rendering and then composing the images to form the final result. Since sort-last rendering requires the movement of large amounts of image data among cluster nodes, the network interconnecting the nodes becomes a major bottleneck. In this paper, we describe a sort-last rendering system implemented on a cluster of computers whose nodes are connected by an all-optical switch. The rendering system introduces the notion of the Photonic Computing Engine, a computing system built dynamically by using the optical switch to create dedicated network connections among cluster nodes. The sort-last volume rendering algorithm was implemented on the Photonic Computing Engine, and its performance is evaluated. Prelimi- nary experiments show that performance is affected by the image composition time and average payload size. In an attempt to stabilize the performance of the system, we have designed a flow control mechanism that uses feedback messages to dynamically adjust the data flow rate within the computing engine.

Search Results | Page 797 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Search Results. Showing 7961 - 7970 of 8491 results. Story. Health Natural Resources Mining ECOHEALTH ... CASE STUDY: Latin America — An engine for rural development in Latin America. Research in Action. Biodiversity Gender Crops ...

Parallel sort with a ranged, partitioned key-value store in a high perfomance computing environment

Science.gov (United States)

Bent, John M.; Faibish, Sorin; Grider, Gary; Torres, Aaron; Poole, Stephen W.

2016-01-26

Improved sorting techniques are provided that perform a parallel sort using a ranged, partitioned key-value store in a high performance computing (HPC) environment. A plurality of input data files comprising unsorted key-value data in a partitioned key-value store are sorted. The partitioned key-value store comprises a range server for each of a plurality of ranges. Each input data file has an associated reader thread. Each reader thread reads the unsorted key-value data in the corresponding input data file and performs a local sort of the unsorted key-value data to generate sorted key-value data. A plurality of sorted, ranged subsets of each of the sorted key-value data are generated based on the plurality of ranges. Each sorted, ranged subset corresponds to a given one of the ranges and is provided to one of the range servers corresponding to the range of the sorted, ranged subset. Each range server sorts the received sorted, ranged subsets and provides a sorted range. A plurality of the sorted ranges are concatenated to obtain a globally sorted result.

Search Results | Page 763 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Search Results. Showing 7621 - 7630 of 8490 results. Books ... and practice in natural resource management are often depicted as a cyclical and rational process. ... to provide quality education, improve health care, allow open government, ...

Implementation of Serial and Parallel Bubble Sort on Fpga

OpenAIRE

Purnomo, Dwi Marhaendro Jati; Arinaldi, Ahmad; Priyantini, Dwi Teguh; Wibisono, Ari; Febrian, Andreas

2016-01-01

Sorting is common process in computational world. Its utilization are on many fields from research to industry. There are many sorting algorithm in nowadays. One of the simplest yet powerful is bubble sort. In this study, bubble sort is implemented on FPGA. The implementation was taken on serial and parallel approach. Serial and parallel bubble sort then compared by means of its memory, execution time, and utility which comprises slices and LUTs. The experiments show that serial bubble sort r...

A cargo-sorting DNA robot.

Science.gov (United States)

Thubagere, Anupama J; Li, Wei; Johnson, Robert F; Chen, Zibo; Doroudi, Shayan; Lee, Yae Lim; Izatt, Gregory; Wittman, Sarah; Srinivas, Niranjan; Woods, Damien; Winfree, Erik; Qian, Lulu

2017-09-15

Two critical challenges in the design and synthesis of molecular robots are modularity and algorithm simplicity. We demonstrate three modular building blocks for a DNA robot that performs cargo sorting at the molecular level. A simple algorithm encoding recognition between cargos and their destinations allows for a simple robot design: a single-stranded DNA with one leg and two foot domains for walking, and one arm and one hand domain for picking up and dropping off cargos. The robot explores a two-dimensional testing ground on the surface of DNA origami, picks up multiple cargos of two types that are initially at unordered locations, and delivers them to specified destinations until all molecules are sorted into two distinct piles. The robot is designed to perform a random walk without any energy supply. Exploiting this feature, a single robot can repeatedly sort multiple cargos. Localization on DNA origami allows for distinct cargo-sorting tasks to take place simultaneously in one test tube or for multiple robots to collectively perform the same task. Copyright © 2017, American Association for the Advancement of Science.

New age radiometric ore sorting - the elegant solution

International Nuclear Information System (INIS)

Gordon, H.P.; Heuer, T.

2000-01-01

Radiometric ore sorting technology and application are described in two parts. Part I reviews the history of radiometric sorting in the minerals industry and describes the latest developments in radiometric sorting technology. Part II describes the history, feasibility study and approach used in the application of the new technology at Rossing Uranium Limited. There has been little progress in the field of radiometric sorting since the late 1970s. This has changed with the development of a high capacity radiometric sorter designed to operate on low-grade ore in the +75mm / -300mm size fraction. This has been designed specifically for an application at Rossing. Rossing has a long history in radiometric sorting dating back to 1968 when initial tests were conducted on the Rossing prospect. Past feasibility studies concluded that radiometric sorting would not conclusively reduce the unit cost of production unless sorting was used to increase production levels. The current feasibility study shows that the application of new radiometric sorter technology makes sorting viable without increasing production, and significantly more attractive with increased production. A pilot approach to confirm sorter performance is described. (author)

Card-Sorting Usability Tests of the WMU Libraries' Web Site

Science.gov (United States)

Whang, Michael

2008-01-01

This article describes the card-sorting techniques used by several academic libraries, reports and discusses the results of card-sorting usability tests of the Western Michigan University Libraries' Web site, and reveals how the WMU libraries incorporated the findings into a new Web site redesign, setting the design direction early on. The article…

Search Results | Page 642 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Search Results. Showing 6411 - 6420 of 9601 results. Project ... STI for Development in Asia : a Platform for Information Sharing and Learning. This project is based on the premise that science, technology and innovation (STI) are critical ...

Automated spike sorting algorithm based on Laplacian eigenmaps and k-means clustering.

Science.gov (United States)

Chah, E; Hok, V; Della-Chiesa, A; Miller, J J H; O'Mara, S M; Reilly, R B

2011-02-01

This study presents a new automatic spike sorting method based on feature extraction by Laplacian eigenmaps combined with k-means clustering. The performance of the proposed method was compared against previously reported algorithms such as principal component analysis (PCA) and amplitude-based feature extraction. Two types of classifier (namely k-means and classification expectation-maximization) were incorporated within the spike sorting algorithms, in order to find a suitable classifier for the feature sets. Simulated data sets and in-vivo tetrode multichannel recordings were employed to assess the performance of the spike sorting algorithms. The results show that the proposed algorithm yields significantly improved performance with mean sorting accuracy of 73% and sorting error of 10% compared to PCA which combined with k-means had a sorting accuracy of 58% and sorting error of 10%.A correction was made to this article on 22 February 2011. The spacing of the title was amended on the abstract page. No changes were made to the article PDF and the print version was unaffected.

An O([Formula: see text]) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges.

Science.gov (United States)

Yu, Shuzhi; Hao, Fanchang; Leong, Hon Wai

2016-02-01

We consider the problem of sorting signed permutations by reversals, transpositions, transreversals, and block-interchanges. The problem arises in the study of species evolution via large-scale genome rearrangement operations. Recently, Hao et al. gave a 2-approximation scheme called genome sorting by bridges (GSB) for solving this problem. Their result extended and unified the results of (i) He and Chen - a 2-approximation algorithm allowing reversals, transpositions, and block-interchanges (by also allowing transversals) and (ii) Hartman and Sharan - a 1.5-approximation algorithm allowing reversals, transpositions, and transversals (by also allowing block-interchanges). The GSB result is based on introduction of three bridge structures in the breakpoint graph, the L-bridge, T-bridge, and X-bridge that models goodreversal, transposition/transreversal, and block-interchange, respectively. However, the paper by Hao et al. focused on proving the 2-approximation GSB scheme and only mention a straightforward [Formula: see text] algorithm. In this paper, we give an [Formula: see text] algorithm for implementing the GSB scheme. The key idea behind our faster GSB algorithm is to represent cycles in the breakpoint graph by their canonical sequences, which greatly simplifies the search for these bridge structures. We also give some comparison results (running time and computed distances) against the original GSB implementation.

Three Sorts of Naturalism

OpenAIRE

Fink, Hans

2006-01-01

In "Two sorts of Naturalism" John McDowell is sketching his own sort of naturalism in ethics as an alternative to "bald naturalism". In this paper I distinguish materialist, idealist and absolute conceptions of nature and of naturalism in order to provide a framework for a clearer understanding of what McDowell's own naturalism amounts to. I argue that nothing short of an absolute naturalism will do for a number of McDowell's own purposes, but that it is far from obvious that this is his posi...

Design of mechanical arm for an automatic sorting system of recyclable cans

Science.gov (United States)

Resti, Y.; Mohruni, A. S.; Burlian, F.; Yani, I.; Amran, A.

2018-04-01

The use of a mechanical arm for an automatic sorting system of used cans should be designed carefully. The right design will result in a high precision sorting rate and a short sorting time. The design includes first; design manipulator,second; determine link and joint specifications, and third; build mechanical systems and control systems. This study aims to design the mechanical arm as a hardware system for automatic cans sorting system. The material used for the manipulator is the aluminum plate. The manipulator is designed using 6 links and 6 join where the 6th link is the end effectorand the 6th join is the gripper. As a driving motor used servo motor, while as a microcontroller used Arduino Uno which is connected with Matlab programming language. Based on testing, a mechanical arm designed for this recyclable canned recycling system has a precision sorting rate at 93%, where the average total time required for sorting is 10.82 seconds.

Categorization and Searching of Color Images Using Mean Shift Algorithm

Directory of Open Access Journals (Sweden)

Prakash PANDEY

2009-07-01

Full Text Available Now a day’s Image Searching is still a challenging problem in content based image retrieval (CBIR system. Most CBIR system operates on all images without pre-sorting the images. The image search result contains many unrelated image. The aim of this research is to propose a new object based indexing system Based on extracting salient region representative from the image, categorizing the image into different types and search images that are similar to given query images.In our approach, the color features are extracted using the mean shift algorithm, a robust clustering technique, Dominant objects are obtained by performing region grouping of segmented thumbnails. The category for an image is generated automatically by analyzing the image for the presence of a dominant object. The images in the database are clustered based on region feature similarity using Euclidian distance. Placing an image into a category can help the user to navigate retrieval results more effectively. Extensive experimental results illustrate excellent performance.

Engineering a Cache-Oblivious Sorting Algorithm

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf; Vinther, Kristoffer

2007-01-01

This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by empirical methods a number of implementation issues and parameter choices for the cache-oblivious sorting algorithm Lazy Funnelsort, and compare the final algorithm with Quicksort, the established standard...

NIH Toolbox Cognition Battery (NIHTB-CB): list sorting test to measure working memory.

Science.gov (United States)

Tulsky, David S; Carlozzi, Noelle; Chiaravalloti, Nancy D; Beaumont, Jennifer L; Kisala, Pamela A; Mungas, Dan; Conway, Kevin; Gershon, Richard

2014-07-01

The List Sorting Working Memory Test was designed to assess working memory (WM) as part of the NIH Toolbox Cognition Battery. List Sorting is a sequencing task requiring children and adults to sort and sequence stimuli that are presented visually and auditorily. Validation data are presented for 268 participants ages 20 to 85 years. A subset of participants (N=89) was retested 7 to 21 days later. As expected, the List Sorting Test had moderately high correlations with other measures of working memory and executive functioning (convergent validity) but a low correlation with a test of receptive vocabulary (discriminant validity). Furthermore, List Sorting demonstrates expected changes over the age span and has excellent test-retest reliability. Collectively, these results provide initial support for the construct validity of the List Sorting Working Memory Measure as a measure of working memory. However, the relationship between the List Sorting Test and general executive function has yet to be determined.

Data Collision Prevention with Overflow Hashing Technique in Closed Hash Searching Process

Science.gov (United States)

Rahim, Robbi; Nurjamiyah; Rafika Dewi, Arie

2017-12-01

Hash search is a method that can be used for various search processes such as search engines, sorting, machine learning, neural network and so on, in the search process the possibility of collision data can happen and to prevent the occurrence of collision can be done in several ways one of them is to use Overflow technique, the use of this technique perform with varying length of data and this technique can prevent the occurrence of data collisions.

Latest results on searches for Supersymmetry from CMS

CERN Multimedia

CERN. Geneva

2013-01-01

Most recent results on CMS SUSY searches with the full 8TeV dataset are presented, including searches for weakly as well as strongly interacting supersymmetric particles. Strict limits are set on gluino, stop, sbottom, chargino, and neutralino production, with final states ranging from zero to four leptons, as well as Higgs bosons produced in cascades of stop or neutralino decays.

The rate and effectiveness of carburization to the sort of carburizer

Directory of Open Access Journals (Sweden)

K. Janerka

2007-12-01

Full Text Available The obtaining of demanded carbon contents during melting the cast iron with bounded pig iron’s portion is important problem for many foundries. There are searched the effective methods and carburizers, which would ensure obtaining of big carbon increases with great repeatability as quick as possible. The aim of presented researches was definition of influence of essential factors characterized the carburization and the sort of carburizer on the rate and effectiveness of process. The cast iron melts are presented only on the basis of steel scrap with the portion of graphitoidal, coke and anthracite carburizers. Two methods of carburization are taken into consideration during the experiments were carried out: the addition of carburizer to charge in solid in the initial period of melting and addition of carburizer on surface of liquid metal . The obtained researches results and their analyze allow to choose the corresponding method and the sort of carburizer. One can state, that the best carburizer is synthetic graphite, if the rate and effectiveness of process is considerate and the best method of carburization in the electric inductive furnace is addition of carburizer to charge in solid. In the subsequent part of researches the analyze of influence of carburizer on the structure of grey cast iron and ductile cast iron. The initial researches has showed the differences in obtained structures of synthetic cast iron melted only on the basis of steel scrap and defined kind of carburizer.

Can electronic search engines optimize screening of search results in systematic reviews: an empirical study.

Science.gov (United States)

Sampson, Margaret; Barrowman, Nicholas J; Moher, David; Clifford, Tammy J; Platt, Robert W; Morrison, Andra; Klassen, Terry P; Zhang, Li

2006-02-24

Most electronic search efforts directed at identifying primary studies for inclusion in systematic reviews rely on the optimal Boolean search features of search interfaces such as DIALOG and Ovid. Our objective is to test the ability of an Ultraseek search engine to rank MEDLINE records of the included studies of Cochrane reviews within the top half of all the records retrieved by the Boolean MEDLINE search used by the reviewers. Collections were created using the MEDLINE bibliographic records of included and excluded studies listed in the review and all records retrieved by the MEDLINE search. Records were converted to individual HTML files. Collections of records were indexed and searched through a statistical search engine, Ultraseek, using review-specific search terms. Our data sources, systematic reviews published in the Cochrane library, were included if they reported using at least one phase of the Cochrane Highly Sensitive Search Strategy (HSSS), provided citations for both included and excluded studies and conducted a meta-analysis using a binary outcome measure. Reviews were selected if they yielded between 1000-6000 records when the MEDLINE search strategy was replicated. Nine Cochrane reviews were included. Included studies within the Cochrane reviews were found within the first 500 retrieved studies more often than would be expected by chance. Across all reviews, recall of included studies into the top 500 was 0.70. There was no statistically significant difference in ranking when comparing included studies with just the subset of excluded studies listed as excluded in the published review. The relevance ranking provided by the search engine was better than expected by chance and shows promise for the preliminary evaluation of large results from Boolean searches. A statistical search engine does not appear to be able to make fine discriminations concerning the relevance of bibliographic records that have been pre-screened by systematic reviewers.

Differential regulation of amyloid precursor protein sorting with pathological mutations results in a distinct effect on amyloid-β production.

Science.gov (United States)

Lin, Yen-Chen; Wang, Jia-Yi; Wang, Kai-Chen; Liao, Jhih-Ying; Cheng, Irene H

2014-11-01

The deposition of amyloid-β (Aβ) peptide, which is generated from amyloid precursor protein (APP), is the pathological hallmark of Alzheimer's disease (AD). Three APP familial AD mutations (D678H, D678N, and H677R) located at the sixth and seventh amino acid of Aβ have distinct effect on Aβ aggregation, but their influence on the physiological and pathological roles of APP remain unclear. We found that the D678H mutation strongly enhances amyloidogenic cleavage of APP, thus increasing the production of Aβ. This enhancement of amyloidogenic cleavage is likely because of the acceleration of APPD678H sorting into the endosomal-lysosomal pathway. In contrast, the APPD678N and APPH677R mutants do not cause the same effects. Therefore, this study indicates a regulatory role of D678H in APP sorting and processing, and provides genetic evidence for the importance of APP sorting in AD pathogenesis. The internalization of amyloid precursor protein (APP) increases its opportunity to be processed by β-secretase and to produce Amyloid-β (Aβ) that causes Alzheimer's disease (AD). We report a pathogenic APPD678H mutant that enhances APP internalization into the endosomal-lysosomal pathway and thus promotes the β-secretase cleavage and Aβ production. This study provides genetic evidence for the importance of APP sorting in AD pathogenesis. © 2014 International Society for Neurochemistry.

Performance evaluation of firefly algorithm with variation in sorting for non-linear benchmark problems

Science.gov (United States)

Umbarkar, A. J.; Balande, U. T.; Seth, P. D.

2017-06-01

The field of nature inspired computing and optimization techniques have evolved to solve difficult optimization problems in diverse fields of engineering, science and technology. The firefly attraction process is mimicked in the algorithm for solving optimization problems. In Firefly Algorithm (FA) sorting of fireflies is done by using sorting algorithm. The original FA is proposed with bubble sort for ranking the fireflies. In this paper, the quick sort replaces bubble sort to decrease the time complexity of FA. The dataset used is unconstrained benchmark functions from CEC 2005 [22]. The comparison of FA using bubble sort and FA using quick sort is performed with respect to best, worst, mean, standard deviation, number of comparisons and execution time. The experimental result shows that FA using quick sort requires less number of comparisons but requires more execution time. The increased number of fireflies helps to converge into optimal solution whereas by varying dimension for algorithm performed better at a lower dimension than higher dimension.

Supersymmetry searches with ATLAS: overview and latest results

CERN Multimedia

CERN. Geneva

2013-01-01

Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. The ATLAS experiment searches for signs of supersymmetry in a large variety of signatures involving events with abnormal production of missing transverse momentum, jets, leptons, photons, third generation fermions, gauge bosons or massive long-lived particles. The talk presents the latest results obtained in these searches.

On the Directly and Subdirectly Irreducible Many-Sorted Algebras

Directory of Open Access Journals (Sweden)

Climent Vidal J.

2015-03-01

Full Text Available A theorem of single-sorted universal algebra asserts that every finite algebra can be represented as a product of a finite family of finite directly irreducible algebras. In this article, we show that the many-sorted counterpart of the above theorem is also true, but under the condition of requiring, in the definition of directly reducible many-sorted algebra, that the supports of the factors should be included in the support of the many-sorted algebra. Moreover, we show that the theorem of Birkhoff, according to which every single-sorted algebra is isomorphic to a subdirect product of subdirectly irreducible algebras, is also true in the field of many-sorted algebras.

General vs health specialized search engine: a blind comparative evaluation of top search results.

Science.gov (United States)

Pletneva, Natalia; Ruiz de Castaneda, Rafael; Baroz, Frederic; Boyer, Celia

2014-01-01

This paper presents the results of a blind comparison of top ten search results retrieved by Google.ch (French) and Khresmoi for everyone, a health specialized search engine. Participants--students of the Faculty of Medicine of the University of Geneva had to complete three tasks and select their preferred results. The majority of the participants have largely preferred Google results while Khresmoi results showed potential to compete in specific topics. The coverage of the results seems to be one of the reasons. The second being that participants do not know how to select quality and transparent health web pages. More awareness, tools and education about the matter is required for the students of Medicine to be able to efficiently distinguish trustworthy online health information.

Order-sorted Algebraic Specifications with Higher-order Functions

DEFF Research Database (Denmark)

Haxthausen, Anne Elisabeth

1995-01-01

This paper gives a proposal for how order-sorted algebraic specification languages can be extended with higher-order functions. The approach taken is a generalisation to the order-sorted case of an approach given by Mller, Tarlecki and Wirsing for the many-sorted case. The main idea in the proposal...

Sorting and sustaining cooperation

DEFF Research Database (Denmark)

Vikander, Nick

2013-01-01

This paper looks at cooperation in teams where some people are selfish and others are conditional cooperators, and where lay-offs will occur at a fixed future date. I show that the best way to sustain cooperation prior to the lay-offs is often in a sorting equilibrium, where conditional cooperators...... can identify and then work with one another. Changes to parameters that would seem to make cooperation more attractive, such as an increase in the discount factor or the fraction of conditional cooperators, can reduce equilibrium cooperation if they decrease a selfish player's incentive to sort....

Reducing 4D CT artifacts using optimized sorting based on anatomic similarity.

Science.gov (United States)

Johnston, Eric; Diehn, Maximilian; Murphy, James D; Loo, Billy W; Maxim, Peter G

2011-05-01

Four-dimensional (4D) computed tomography (CT) has been widely used as a tool to characterize respiratory motion in radiotherapy. The two most commonly used 4D CT algorithms sort images by the associated respiratory phase or displacement into a predefined number of bins, and are prone to image artifacts at transitions between bed positions. The purpose of this work is to demonstrate a method of reducing motion artifacts in 4D CT by incorporating anatomic similarity into phase or displacement based sorting protocols. Ten patient datasets were retrospectively sorted using both the displacement and phase based sorting algorithms. Conventional sorting methods allow selection of only the nearest-neighbor image in time or displacement within each bin. In our method, for each bed position either the displacement or the phase defines the center of a bin range about which several candidate images are selected. The two dimensional correlation coefficients between slices bordering the interface between adjacent couch positions are then calculated for all candidate pairings. Two slices have a high correlation if they are anatomically similar. Candidates from each bin are then selected to maximize the slice correlation over the entire data set using the Dijkstra's shortest path algorithm. To assess the reduction of artifacts, two thoracic radiation oncologists independently compared the resorted 4D datasets pairwise with conventionally sorted datasets, blinded to the sorting method, to choose which had the least motion artifacts. Agreement between reviewers was evaluated using the weighted kappa score. Anatomically based image selection resulted in 4D CT datasets with significantly reduced motion artifacts with both displacement (P = 0.0063) and phase sorting (P = 0.00022). There was good agreement between the two reviewers, with complete agreement 34 times and complete disagreement 6 times. Optimized sorting using anatomic similarity significantly reduces 4D CT motion

Application of a fast sorting algorithm to the assignment of mass spectrometric cross-linking data.

Science.gov (United States)

Petrotchenko, Evgeniy V; Borchers, Christoph H

2014-09-01

Cross-linking combined with MS involves enzymatic digestion of cross-linked proteins and identifying cross-linked peptides. Assignment of cross-linked peptide masses requires a search of all possible binary combinations of peptides from the cross-linked proteins' sequences, which becomes impractical with increasing complexity of the protein system and/or if digestion enzyme specificity is relaxed. Here, we describe the application of a fast sorting algorithm to search large sequence databases for cross-linked peptide assignments based on mass. This same algorithm has been used previously for assigning disulfide-bridged peptides (Choi et al., ), but has not previously been applied to cross-linking studies. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Adaptive differential correspondence imaging based on sorting technique

Directory of Open Access Journals (Sweden)

Heng Wu

2017-04-01

Full Text Available We develop an adaptive differential correspondence imaging (CI method using a sorting technique. Different from the conventional CI schemes, the bucket detector signals (BDS are first processed by a differential technique, and then sorted in a descending (or ascending order. Subsequently, according to the front and last several frames of the sorted BDS, the positive and negative subsets (PNS are created by selecting the relative frames from the reference detector signals. Finally, the object image is recovered from the PNS. Besides, an adaptive method based on two-step iteration is designed to select the optimum number of frames. To verify the proposed method, a single-detector computational ghost imaging (GI setup is constructed. We experimentally and numerically compare the performance of the proposed method with different GI algorithms. The results show that our method can improve the reconstruction quality and reduce the computation cost by using fewer measurement data.

Comparison Of Hybrid Sorting Algorithms Implemented On Different Parallel Hardware Platforms

Directory of Open Access Journals (Sweden)

Dominik Zurek

2013-01-01

Full Text Available Sorting is a common problem in computer science. There are lot of well-known sorting algorithms created for sequential execution on a single processor. Recently, hardware platforms enable to create wide parallel algorithms. We have standard processors consist of multiple cores and hardware accelerators like GPU. The graphic cards with their parallel architecture give new possibility to speed up many algorithms. In this paper we describe results of implementation of a few different sorting algorithms on GPU cards and multicore processors. Then hybrid algorithm will be presented which consists of parts executed on both platforms, standard CPU and GPU.

Search Results | Page 776 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 7751 - 7760 of 9175 ... Enhancing food production in semi arid coastal lowlands Kenya through ... nonlocal search trajectories, and ties with service intermediaries ... the role of social networks is identified as one of the research frontiers ...

Pareto Optimization of a Half Car Passive Suspension Model Using a Novel Multiobjective Heat Transfer Search Algorithm

OpenAIRE

Savsani, Vimal; Patel, Vivek; Gadhvi, Bhargav; Tawhid, Mohamed

2017-01-01

Most of the modern multiobjective optimization algorithms are based on the search technique of genetic algorithms; however the search techniques of other recently developed metaheuristics are emerging topics among researchers. This paper proposes a novel multiobjective optimization algorithm named multiobjective heat transfer search (MOHTS) algorithm, which is based on the search technique of heat transfer search (HTS) algorithm. MOHTS employs the elitist nondominated sorting and crowding dis...

Spike sorting for polytrodes: a divide and conquer approach

Directory of Open Access Journals (Sweden)

Nicholas V. Swindale

2014-02-01

Full Text Available In order to determine patterns of neural activity, spike signals recorded by extracellular electrodes have to be clustered (sorted with the aim of ensuring that each cluster represents all the spikes generated by an individual neuron. Many methods for spike sorting have been proposed but few are easily applicable to recordings from polytrodes which may have 16 or more recording sites. As with tetrodes, these are spaced sufficiently closely that signals from single neurons will usually be recorded on several adjacent sites. Although this offers a better chance of distinguishing neurons with similarly shaped spikes, sorting is difficult in such cases because of the high dimensionality of the space in which the signals must be classified. This report details a method for spike sorting based on a divide and conquer approach. Clusters are initially formed by assigning each event to the channel on which it is largest. Each channel-based cluster is then sub-divided into as many distinct clusters as possible. These are then recombined on the basis of pairwise tests into a final set of clusters. Pairwise tests are also performed to establish how distinct each cluster is from the others. A modified gradient ascent clustering (GAC algorithm is used to do the clustering. The method can sort spikes with minimal user input in times comparable to real time for recordings lasting up to 45 minutes. Our results illustrate some of the difficulties inherent in spike sorting, including changes in spike shape over time. We show that some physiologically distinct units may have very similar spike shapes. We show that RMS measures of spike shape similarity are not sensitive enough to discriminate clusters that can otherwise be separated by principal components analysis. Hence spike sorting based on least-squares matching to templates may be unreliable. Our methods should be applicable to tetrodes and scaleable to larger multi-electrode arrays (MEAs.

Free Sorting and Association Task: A Variant of the Free Sorting Method Applied to Study the Impact of Dried Sourdough as an Ingredienton the Related Bread Odor.

Science.gov (United States)

Pétel, Cécile; Courcoux, Philippe; Génovesi, Noémie; Rouillé, Jocelyn; Onno, Bernard; Prost, Carole

2017-04-01

This paper presents a new variant of the free sorting method developed to analyze the relationship between dried sourdough (DSD) and corresponding DSD-bread (bread) odors. The comparison of DSD and bread sensory characteristics is complicated due to their specific features (for example, acidity for DSD and a characteristic "baked bread" aroma for breads). To analyze them at the same time, this study introduces a new variant of the free sorting method, which adds an association task between DSD and bread after those of free sorting and verbalization. This separation makes it possible to change the product between tasks. It was applied to study the impact of 6 European commercial DSDs on their related DSD-bread. According to our results, this methodology enabled an association between different kinds of products and thus underlined the relationship between them. Moreover, as this methodology contains a verbalization task, it provides product descriptions. Compared with the standard free sorting method, free sorting with an association task gives the distance (i) between DSDs, (ii) between breads, and (iii) between DSDs and breads. The separation of product assessment through sorting and association avoids the separation of products according to their category (DSD or bread). © 2017 Institute of Food Technologists®.

Event shape sorting

International Nuclear Information System (INIS)

Kopecna, Renata; Tomasik, Boris

2016-01-01

We propose a novel method for sorting events of multiparticle production according to the azimuthal anisotropy of their momentum distribution. Although the method is quite general, we advocate its use in analysis of ultra-relativistic heavy-ion collisions where a large number of hadrons is produced. The advantage of our method is that it can automatically sort out samples of events with histograms that indicate similar distributions of hadrons. It takes into account the whole measured histograms with all orders of anisotropy instead of a specific observable (e.g., v 2 , v 3 , q 2 ). It can be used for more exclusive experimental studies of flow anisotropies which are then more easily compared to theoretical calculations. It may also be useful in the construction of mixed-events background for correlation studies as it allows to select events with similar momentum distribution. (orig.)

Neural spike sorting using iterative ICA and a deflation-based approach.

Science.gov (United States)

Tiganj, Z; Mboup, M

2012-12-01

We propose a spike sorting method for multi-channel recordings. When applied in neural recordings, the performance of the independent component analysis (ICA) algorithm is known to be limited, since the number of recording sites is much lower than the number of neurons. The proposed method uses an iterative application of ICA and a deflation technique in two nested loops. In each iteration of the external loop, the spiking activity of one neuron is singled out and then deflated from the recordings. The internal loop implements a sequence of ICA and sorting for removing the noise and all the spikes that are not fired by the targeted neuron. Then a final step is appended to the two nested loops in order to separate simultaneously fired spikes. We solve this problem by taking all possible pairs of the sorted neurons and apply ICA only on the segments of the signal during which at least one of the neurons in a given pair was active. We validate the performance of the proposed method on simulated recordings, but also on a specific type of real recordings: simultaneous extracellular-intracellular. We quantify the sorting results on the extracellular recordings for the spikes that come from the neurons recorded intracellularly. The results suggest that the proposed solution significantly improves the performance of ICA in spike sorting.

Search Results | Page 11 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 101 - 110 of 8530 ... ... searching for ways of building international climate agreements between ... Supporting indigenous women in science, technology, engineering and mathematics careers in Mexico and Central America ... and international organizations to address challenges faced by indigenous ... Knowledge.

Search Results | Page 918 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 9171 - 9180 of 9601 ... ... for public policies advocacy work and to build a more equitable society. ... mark for organic smallholders- representing family agriculture, ... the attention on the search for a balance to protect plant breeder''s and ...

Energy efficient data sorting using standard sorting algorithms

KAUST Repository

Bunse, Christian; Hö pfner, Hagen; Roychoudhury, Suman; Mansour, Essam

2011-01-01

Protecting the environment by saving energy and thus reducing carbon dioxide emissions is one of todays hottest and most challenging topics. Although the perspective for reducing energy consumption, from ecological and business perspectives is clear, from a technological point of view, the realization especially for mobile systems still falls behind expectations. Novel strategies that allow (software) systems to dynamically adapt themselves at runtime can be effectively used to reduce energy consumption. This paper presents a case study that examines the impact of using an energy management component that dynamically selects and applies the "optimal" sorting algorithm, from an energy perspective, during multi-party mobile communication. Interestingly, the results indicate that algorithmic performance is not key and that dynamically switching algorithms at runtime does have a significant impact on energy consumption. © Springer-Verlag Berlin Heidelberg 2011.

Search Results | Page 11 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 101 - 110 of 8531 ... ... climate policy, negotiations and implementation in Latin America ... body searching for ways of building international climate agreements ... women in science, technology, engineering and mathematics careers in ... and international organizations to address challenges faced by ... Knowledge.

Search Results | Page 10 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 91 - 100 of 8523 ... ... to inform climate policy, negotiations and implementation in Latin America ... body searching for ways of building international climate agreements ... in science, technology, engineering and mathematics careers in ... and international organizations to address challenges faced by ... Knowledge.

Development of sorting system control using LABVIEW

International Nuclear Information System (INIS)

Azraf Azman; Mohd Arif Hamzah; Noriah Mod Ali; John Konsoh; Mohd Idris Taib; Maslina Mohd Ibrahim; Nor Arymaswati Abdullah; Abu Bakar Mhd Ghazali

2005-01-01

The development of the Personnel Dosimeter Sorting System, proposed by the Secondary Standard Dosimetry Laboratory (SSDL) is to enhance the system or work flow in preparing the personnel dosimeter. The main objective of the system is to reduce stamping error, time and cost. The Personnel Dosimeter Sorting System is a semi-automatic system with an interfacing method using the Advantec 32 bit PCI interface card of 64 digital input and output. The system is integrated with the Labview version 7.1 programming language to control the sorting system and operation. (Author)

Personalized search result diversification via structured learning

NARCIS (Netherlands)

Liang, S.; Ren, Z.; de Rijke, M.

2014-01-01

This paper is concerned with the problem of personalized diversification of search results, with the goal of enhancing the performance of both plain diversification and plain personalization algorithms. In previous work, the problem has mainly been tackled by means of unsupervised learning. To

Recent Results on SUSY and Exotica Searches at the LHC

CERN Document Server

Grout, Zara Jane; The ATLAS collaboration

2015-01-01

A review is presented of searches for Beyond the Standard Model (BSM) physics at the ATLAS and CMS experiments at the Large Hadron Collider (LHC) with emphasis on most recent results. This includes a summary of Supersymmetry searches covering strong, electroweak, and R-parity violating scenarios, and a range of exotica searches including heavy boson searches, extra dimensions, and long-lived particles. The status of BSM physics after the first data-taking period (Run 1) of the LHC and the prospects for the second data-taking period (Run 2), beginning in 2015, are discussed.

Magnet sorting algorithms for insertion devices for the Advanced Light Source

International Nuclear Information System (INIS)

Humphries, D.; Hoyer, E.; Kincaid, B.; Marks, S.; Schlueter, R.

1994-01-01

Insertion devices for the Advanced Light Source (ALS) incorporate up to 3,000 magnet blocks each for pole energization. In order to minimize field errors, these magnets must be measured, sorted and assigned appropriate locations and orientation in the magnetic structures. Sorting must address multiple objectives, including pole excitation and minimization of integrated multipole fields from minor field components in the magnets. This is equivalent to a combinatorial minimization problem with a large configuration space. Multi-stage sorting algorithms use ordering and pairing schemes in conjunction with other combinatorial methods to solve the minimization problem. This paper discusses objective functions, solution algorithms and results of application to magnet block measurement data

Forest, Trees, Dynamics: Results from a novel Wisconsin Card Sorting Test variant Protocol for Studying Global-Local Attention and Complex Cognitive Processes

Directory of Open Access Journals (Sweden)

Benjamin eCowley

2016-02-01

Full Text Available BackgroundRecognition of objects and their context relies heavily on the integrated functioning of global and local visual processing. In a realistic setting such as work, this processing becomes a sustained activity, implying a consequent interaction with executive functions.MotivationThere have been many studies of either global-local attention or executive functions; however it is relatively novel to combine these processes to study a more ecological form of attention. We aim to explore the phenomenon of global-local processing during a task requiring sustained attention and working memory.MethodsWe develop and test a novel protocol for global-local dissociation, with task structure including phases of divided ('rule search' and selective ('rule found' attention, based on the Wisconsin Card Sorting Task.We test it in a laboratory study with 25 participants, and report on behaviour measures (physiological data was also gathered, but not reported here. We develop novel stimuli with more naturalistic levels of information and noise, based primarily on face photographs, with consequently more ecological validity.ResultsWe report behavioural results indicating that sustained difficulty when participants test their hypotheses impacts matching-task performance, and diminishes the global precedence effect. Results also show a dissociation between subjectively experienced difficulty and objective dimension of performance, and establish the internal validity of the protocol.ContributionWe contribute an advance in the state of the art for testing global-local attention processes in concert with complex cognition. With three results we establish a connection between global-local dissociation and aspects of complex cognition. Our protocol also improves ecological validity and opens options for testing additional interactions in future work.

MODELING WORK OF SORTING STATION USING UML

Directory of Open Access Journals (Sweden)

O. V. Gorbova

2014-12-01

Full Text Available Purpose. The purpose of this paper is the construction of methods and models for the graphical representation process of sorting station, using the unified modeling language (UML. Methodology. Methods of graph theory, finite automata and the representation theory of queuing systems were used as the methods of investigation. A graphical representation of the process was implemented with using the Unified Modeling Language UML. The sorting station process representation is implemented as a state diagram and actions through a set of IBM Rational Rose. Graphs can show parallel operation of sorting station, the parallel existence and influence of objects process and the transition from one state to another. The IBM Rational Rose complex allows developing a diagram of work sequence of varying degrees of detailing. Findings. The study has developed a graphical representation method of the process of sorting station of different kind of complexity. All graphical representations are made using the UML. They are represented as a directed graph with the states. It is clear enough in the study of the subject area. Applying the methodology of the representation process, it allows becoming friendly with the work of any automation object very fast, and exploring the process during algorithms construction of sorting stations and other railway facilities. This model is implemented with using the Unified Modeling Language (UML using a combination of IBM Rational Rose. Originality. The representation process of sorting station was developed by means of the Unified Modeling Language (UML use. Methodology of representation process allows creating the directed graphs based on the order of execution of the works chain, objects and performers of these works. The UML allows visualizing, specifying, constructing and documenting, formalizing the representation process of sorting station and developing sequence diagrams of works of varying degrees of detail. Practical

Cloning of Plasmodium falciparum by single-cell sorting.

Science.gov (United States)

Miao, Jun; Li, Xiaolian; Cui, Liwang

2010-10-01

Malaria parasite cloning is traditionally carried out mainly by using the limiting dilution method, which is laborious, imprecise, and unable to distinguish multiply-infected RBCs. In this study, we used a parasite engineered to express green fluorescent protein (GFP) to evaluate a single-cell sorting method for rapidly cloning Plasmodium falciparum. By dividing a two-dimensional scattergram from a cell sorter into 17 gates, we determined the parameters for isolating singly-infected erythrocytes and sorted them into individual cultures. Pre-gating of the engineered parasites for GFP allowed the isolation of almost 100% GFP-positive clones. Compared with the limiting dilution method, the number of parasite clones obtained by single-cell sorting was much higher. Molecular analyses showed that parasite isolates obtained by single-cell sorting were highly homogenous. This highly efficient single-cell sorting method should prove very useful for cloning both P. falciparum laboratory populations from genetic manipulation experiments and clinical samples. Copyright 2010 Elsevier Inc. All rights reserved.

Cloning of Plasmodium falciparum by single-cell sorting

Science.gov (United States)

Miao, Jun; Li, Xiaolian; Cui, Liwang

2010-01-01

Malaria parasite cloning is traditionally carried out mainly by using the limiting dilution method, which is laborious, imprecise, and unable to distinguish multiply-infected RBCs. In this study, we used a parasite engineered to express green fluorescent protein (GFP) to evaluate a single-cell sorting method for rapidly cloning Plasmodium falciparum. By dividing a two dimensional scattergram from a cell sorter into 17 gates, we determined the parameters for isolating singly-infected erythrocytes and sorted them into individual cultures. Pre-gating of the engineered parasites for GFP allowed the isolation of almost 100% GFP-positive clones. Compared with the limiting dilution method, the number of parasite clones obtained by single-cell sorting was much higher. Molecular analyses showed that parasite isolates obtained by single-cell sorting were highly homogenous. This highly efficient single-cell sorting method should prove very useful for cloning both P. falciparum laboratory populations from genetic manipulation experiments and clinical samples. PMID:20435038

Faster magnet sorting with a threshold acceptance algorithm

International Nuclear Information System (INIS)

Lidia, S.; Carr, R.

1995-01-01

We introduce here a new technique for sorting magnets to minimize the field errors in permanent magnet insertion devices. Simulated annealing has been used in this role, but we find the technique of threshold acceptance produces results of equal quality in less computer time. Threshold accepting would be of special value in designing very long insertion devices, such as long free electron lasers (FELs). Our application of threshold acceptance to magnet sorting showed that it converged to equivalently low values of the cost function, but that it converged significantly faster. We present typical cases showing time to convergence for various error tolerances, magnet numbers, and temperature schedules

Faster magnet sorting with a threshold acceptance algorithm

International Nuclear Information System (INIS)

Lidia, S.

1994-08-01

The authors introduce here a new technique for sorting magnets to minimize the field errors in permanent magnet insertion devices. Simulated annealing has been used in this role, but they find the technique of threshold acceptance produces results of equal quality in less computer time. Threshold accepting would be of special value in designing very long insertion devices, such as long FEL's. Their application of threshold acceptance to magnet sorting showed that it converged to equivalently low values of the cost function, but that it converged significantly faster. They present typical cases showing time to convergence for various error tolerances, magnet numbers, and temperature schedules

Search Results | Page 24 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

2007-01-01

Results 231 - 240 of 1368 ... Search. Home; South Asia .... Critical linkages between land use transition and human health in the Himalayan region. Published date. January 1, 2007. Papers. Civil society ISLAMIC CULTURE RADICALISM DEMOCRATIZATION ... Why studying attitudes and perceptions towards GMOs in India is ...

Search Results | Page 843 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 8421 - 8430 of 8489 ... IDRC permits reading, downloading, copying, redistributing, printing, linking and searching, for non-commercial or academic purposes, of any of its content, provided that credit and reference is given to IDRC and the original source page and, in the. Webpage.

Search Results | Page 818 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 8171 - 8180 of 9601 ... Does immigration promote innovation in developing countries? ... Corporate political activities and firm growth in emerging economies (part of annex 18 of ... Managerial interpretation of environment dynamism, nonlocal search ... Business model of a public intermediary : a case study of China ...

On Sorting Genomes with DCJ and Indels

Science.gov (United States)

Braga, Marília D. V.

A previous work of Braga, Willing and Stoye compared two genomes with unequal content, but without duplications, and presented a new linear time algorithm to compute the genomic distance, considering double cut and join (DCJ) operations, insertions and deletions. Here we derive from this approach an algorithm to sort one genome into another one also using DCJ, insertions and deletions. The optimal sorting scenarios can have different compositions and we compare two types of sorting scenarios: one that maximizes and one that minimizes the number of DCJ operations with respect to the number of insertions and deletions.

Gender Differences in Sorting

DEFF Research Database (Denmark)

Merlino, Luca Paolo; Parrotta, Pierpaolo; Pozzoli, Dario

and causing the most productive female workers to seek better jobs in more female-friendly firms in which they can pursue small career advancements. Nonetheless, gender differences in promotion persist and are found to be similar in all firms when we focus on large career advancements. These results provide......In this paper, we investigate the sorting of workers in firms to understand gender gaps in labor market outcomes. Using Danish employer-employee matched data, we fiend strong evidence of glass ceilings in certain firms, especially after motherhood, preventing women from climbing the career ladder...

Coupling Bacterial Activity Measurements with Cell Sorting by Flow Cytometry.

Science.gov (United States)

Servais; Courties; Lebaron; Troussellier

1999-08-01

> Abstract A new procedure to investigate the relationship between bacterial cell size and activity at the cellular level has been developed; it is based on the coupling of radioactive labeling of bacterial cells and cell sorting by flow cytometry after SYTO 13 staining. Before sorting, bacterial cells were incubated in the presence of tritiated leucine using a procedure similar to that used for measuring bacterial production by leucine incorporation and then stained with SYTO 13. Subpopulations of bacterial cells were sorted according to their average right-angle light scatter (RALS) and fluorescence. Average RALS was shown to be significantly related to the average biovolume. Experiments were performed on samples collected at different times in a Mediterranean seawater mesocosm enriched with nitrogen and phosphorus. At four sampling times, bacteria were sorted in two subpopulations (cells smaller and larger than 0.25 µm(3)). The results indicate that, at each sampling time, the growth rate of larger cells was higher than that of smaller cells. In order to confirm this tendency, cell sorting was performed on six subpopulations differing in average biovolume during the mesocosm follow-up. A clear increase of the bacterial growth rates was observed with increasing cell size for the conditions met in this enriched mesocosm.http://link.springer-ny.com/link/service/journals/00248/bibs/38n2p180.html

Search Results | Page 30 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 291 - 300 of 8491 ... ... Policies in Francophone Africa. Africa's persistent job crisis calls for more effective employment policies, including training programs and support for job searches. ... Violence Prevention, Access to Justice, and Economic Empowerment of Women in Latin America. This project will identify and ...

Search Results | Page 846 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 8451 - 8460 of 8518 ... Agriculture and Food Security ... IDRC permits reading, downloading, copying, redistributing, printing, linking and searching, for non-commercial or academic purposes, of any of its content, provided that credit and reference is given ... IDRC funds many research projects that raise ethical issues.

Recent Results on SUSY and Exotica Searches at the LHC

Directory of Open Access Journals (Sweden)

Grout Zara

2015-01-01

Full Text Available A review is presented of searches for Beyond the Standard Model (BSM physics at the ATLAS and CMS experiments at the Large Hadron Collider (LHC with emphasis on most recent results. This includes a summary of Supersymmetry searches covering strong, electroweak, and R-parity violating scenarios, and a range of exotica searches including heavy boson searches, extra dimensions, and long-lived particles. The status of BSM physics after the first data-taking period (Run 1 of the LHC and the prospects for the second data-taking period (Run 2, beginning in 2015, are discussed.

Algorithm 426 : Merge sort algorithm [M1

NARCIS (Netherlands)

Bron, C.

1972-01-01

Sorting by means of a two-way merge has a reputation of requiring a clerically complicated and cumbersome program. This ALGOL 60 procedure demonstrates that, using recursion, an elegant and efficient algorithm can be designed, the correctness of which is easily proved [2]. Sorting n objects gives

Sorting Tubules Regulate Blood-Brain Barrier Transcytosis

Directory of Open Access Journals (Sweden)

Roberto Villaseñor

2017-12-01

Full Text Available Transcytosis across the blood-brain barrier (BBB regulates key processes of the brain, but the intracellular sorting mechanisms that determine successful receptor-mediated transcytosis in brain endothelial cells (BECs remain unidentified. Here, we used Transferrin receptor-based Brain Shuttle constructs to investigate intracellular transport in BECs, and we uncovered a pathway for the regulation of receptor-mediated transcytosis. By combining live-cell imaging and mathematical modeling in vitro with super-resolution microscopy of the BBB, we show that intracellular tubules promote transcytosis across the BBB. A monovalent construct (sFab sorted for transcytosis was localized to intracellular tubules, whereas a bivalent construct (dFab sorted for degradation formed clusters with impaired transport along tubules. Manipulating tubule biogenesis by overexpressing the small GTPase Rab17 increased dFab transport into tubules and induced its transcytosis in BECs. We propose that sorting tubules regulate transcytosis in BECs and may be a general mechanism for receptor-mediated transport across the BBB.

New results on the Search for Gravitational Waves

CERN Multimedia

CERN. Geneva

2016-01-01

The webcast of simultaneous press conferences of the LIGO (https://www.youtube.com/user/VideosatNSF/live) and VIRGO (http://www.virgo-gw.eu/index_live.html) Collaborations from Washington and Cascina on the search for gravitational waves will be transmitted on Thursday 11 February 2016 at 16:30 in the Main Auditorium (500/1-001): It will be followed by a seminar on "New results on the Search for Gravitational Waves“ by Barry Barish (LIGO) Representatives of the LIGO, VIRGO and GEO experiments will be available for questions after the seminar.

A many-sorted calculus based on resolution and paramodulation

CERN Document Server

Walther, Christoph

1987-01-01

A Many-Sorted Calculus Based on Resolution and Paramodulation emphasizes the utilization of advantages and concepts of many-sorted logic for resolution and paramodulation based automated theorem proving.This book considers some first-order calculus that defines how theorems from given hypotheses by pure syntactic reasoning are obtained, shifting all the semantic and implicit argumentation to the syntactic and explicit level of formal first-order reasoning. This text discusses the efficiency of many-sorted reasoning, formal preliminaries for the RP- and ?RP-calculus, and many-sorted term rewrit

Real-time implementation of a color sorting system

Science.gov (United States)

Srikanteswara, Srikathyanyani; Lu, Qiang O.; King, William; Drayer, Thomas H.; Conners, Richard W.; Kline, D. Earl; Araman, Philip A.

1997-09-01

Wood edge glued panels are used extensively in the furniture and cabinetry industries. They are used to make doors, tops, and sides of solid wood furniture and cabinets. Since lightly stained furniture and cabinets are gaining in popularity, there is an increasing demand to color sort the parts used to make these edge glued panels. The goal of the sorting processing is to create panels that are uniform in both color and intensity across their visible surface. If performed manually, the color sorting of edge-glued panel parts is very labor intensive and prone to error. This paper describes a complete machine vision system for performing this sort. This system uses two color line scan cameras for image input and a specially designed custom computing machine to allow real-time implementation. Users define the number of color classes that are to be used. An 'out' class is provided to handle unusually colored parts. The system removes areas of character mark, e.g., knots, mineral streak, etc., from consideration when assigning a color class to a part. The system also includes a better face algorithm for determining which part face would be the better to put on the side of the panel that will show. The throughput is two linear feet per second. Only a four inch between part spacing is required. This system has undergone extensive in plant testing and will be commercially available in the very near future. The results of this testing will be presented.

Assessors' Search Result Satisfaction Associated with Relevance in a Scientific Domain

DEFF Research Database (Denmark)

Ingwersen, Peter; Lykke, Marianne; Bogers, Toine

2010-01-01

genuine information tasks. Ease of assessment and search satisfaction are cross tabulated with retrieval performance measured by Normalized Discounted Cumulated Gain. Results show that when assessors find small numbers of relevant documents they tend to regard the search results with dissatisfaction and...

Science and technology of kernels and TRISO coated particle sorting

International Nuclear Information System (INIS)

Nothnagel, G.

2006-09-01

The ~1mm diameter TRISO coated particles, which form the elemental units of PBMR nuclear fuel, has to be close to spherical in order to best survive damage during sphere pressing. Spherical silicon carbide layers further provide the strongest miniature pressure vessels for fission product retention. To make sure that the final product contains particles of acceptable shape, 100% of kernels and coated particles have to be sorted on a surface-ground sorting table. Broken particles, twins, irregular (odd) shapes and extreme ellipsoids have to be separated from the final kernel and coated particle batches. Proper sorting of particles is an extremely important step in quality fuel production as the final failure fraction depends sensitively on the quality of sorting. After sorting a statistically significant sample of the sorted product is analysed for sphericity, which is defined as the ratio of maximum to minimum diameter, as part of a standard QC test to ensure conformance to German specifications. In addition a burn-leach test is done on coated particles (before pressing) and fuel spheres (after pressing) to ensure adherence to failure specifications. Because of the extreme importance of particle sorting for assurance of fuel quality it is essential to have an in-depth understanding of the capabilities and limitations of particle sorting. In this report a systematic scientific rationale is developed, from fundamental principles, to provide a basis for understanding the relationship between product quality and sorting parameters. The principles and concepts, developed in this report, will be of importance when future sorting tables (or equivalents) are to be designed. A number of new concepts and methodologies are developed to assist with equivalence validation of any two sorting tables. This is aimed in particular towards quantitative assessment of equivalence between current QC tables (closely based on the original NUKEM parameters, except for the driving mechanism

Heuristic framework for parallel sorting computations | Nwanze ...

African Journals Online (AJOL)

Parallel sorting techniques have become of practical interest with the advent of new multiprocessor architectures. The decreasing cost of these processors will probably in the future, make the solutions that are derived thereof to be more appealing. Efficient algorithms for sorting scheme that are encountered in a number of ...

A semantics-based method for clustering of Chinese web search results

Science.gov (United States)

Zhang, Hui; Wang, Deqing; Wang, Li; Bi, Zhuming; Chen, Yong

2014-01-01

Information explosion is a critical challenge to the development of modern information systems. In particular, when the application of an information system is over the Internet, the amount of information over the web has been increasing exponentially and rapidly. Search engines, such as Google and Baidu, are essential tools for people to find the information from the Internet. Valuable information, however, is still likely submerged in the ocean of search results from those tools. By clustering the results into different groups based on subjects automatically, a search engine with the clustering feature allows users to select most relevant results quickly. In this paper, we propose an online semantics-based method to cluster Chinese web search results. First, we employ the generalised suffix tree to extract the longest common substrings (LCSs) from search snippets. Second, we use the HowNet to calculate the similarities of the words derived from the LCSs, and extract the most representative features by constructing the vocabulary chain. Third, we construct a vector of text features and calculate snippets' semantic similarities. Finally, we improve the Chameleon algorithm to cluster snippets. Extensive experimental results have shown that the proposed algorithm has outperformed over the suffix tree clustering method and other traditional clustering methods.

Fruit Sorting Using Fuzzy Logic Techniques

Science.gov (United States)

Elamvazuthi, Irraivan; Sinnadurai, Rajendran; Aftab Ahmed Khan, Mohamed Khan; Vasant, Pandian

2009-08-01

Fruit and vegetables market is getting highly selective, requiring their suppliers to distribute the goods according to very strict standards of quality and presentation. In the last years, a number of fruit sorting and grading systems have appeared to fulfill the needs of the fruit processing industry. However, most of them are overly complex and too costly for the small and medium scale industry (SMIs) in Malaysia. In order to address these shortcomings, a prototype machine was developed by integrating the fruit sorting, labeling and packing processes. To realise the prototype, many design issues were dealt with. Special attention is paid to the electronic weighing sub-system for measuring weight, and the opto-electronic sub-system for determining the height and width of the fruits. Specifically, this paper discusses the application of fuzzy logic techniques in the sorting process.

Assessing Incorrect Household Waste Sorting in a Medium-Sized Swedish City

Directory of Open Access Journals (Sweden)

Kamran Rousta

2013-10-01

Full Text Available Source separation is a common method for dealing with the increasing problem of Municipal Solid Waste (MSW in society. The citizens are then responsible for separating waste fractions produced in their home. If the consumers fail to sort the waste according to the source separation scheme, it will lead to an ineffective system. The purpose of this paper is to analyze the environmental, economic and social aspects of incorrect waste sorting in a medium sized Swedish city that has established a source separation system. In order to determine the extent to which citizens correctly sort their waste, food waste (black bags and combustible fraction (white bags, were collected randomly from a residential area and categorized in different waste fractions. The results show that approximately 68 wt% of the waste in the white and 29 wt% in the black bags were not sorted correctly. This incorrect sorting accrues over 13 million SEK per year cost for this community. In order to improve the inhabitants’ participation in the waste management system, it is necessary to change different factors such as convenience and easy access to the recycling stations in the local MSW management systems as well as to review current regulation and policy.

Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Moruz, Gabriel

2005-01-01

Branch mispredictions is an important factor affecting the running time in practice. In this paper we consider tradeoffs between the number of branch mispredictions and the number of comparisons for sorting algorithms in the comparison model. We prove that a sorting algorithm using O(dnlog n......) comparisons performs Omega(nlogd n) branch mispredictions. We show that Multiway MergeSort achieves this tradeoff by adopting a multiway merger with a low number of branch mispredictions. For adaptive sorting algorithms we similarly obtain that an algorithm performing O(dn(1+log (1+Inv/n))) comparisons must...... perform Omega(nlogd (1+Inv/n)) branch mispredictions, where Inv is the number of inversions in the input. This tradeoff can be achieved by GenericSort by Estivill-Castro and Wood by adopting a multiway division protocol and a multiway merging algorithm with a low number of branch mispredictions....

Recent progress in multi-electrode spike sorting methods.

Science.gov (United States)

Lefebvre, Baptiste; Yger, Pierre; Marre, Olivier

2016-11-01

In recent years, arrays of extracellular electrodes have been developed and manufactured to record simultaneously from hundreds of electrodes packed with a high density. These recordings should allow neuroscientists to reconstruct the individual activity of the neurons spiking in the vicinity of these electrodes, with the help of signal processing algorithms. Algorithms need to solve a source separation problem, also known as spike sorting. However, these new devices challenge the classical way to do spike sorting. Here we review different methods that have been developed to sort spikes from these large-scale recordings. We describe the common properties of these algorithms, as well as their main differences. Finally, we outline the issues that remain to be solved by future spike sorting algorithms. Copyright © 2017 Elsevier Ltd. All rights reserved.

Acoustic bubble sorting for ultrasound contrast agent enrichment.

Science.gov (United States)

Segers, Tim; Versluis, Michel

2014-05-21

An ultrasound contrast agent (UCA) suspension contains encapsulated microbubbles with a wide size distribution, with radii ranging from 1 to 10 μm. Medical transducers typically operate at a single frequency, therefore only a small selection of bubbles will resonate to the driving ultrasound pulse. Thus, the sensitivity can be improved by narrowing down the size distribution. Here, we present a simple lab-on-a-chip method to sort the population of microbubbles on-chip using a traveling ultrasound wave. First, we explore the physical parameter space of acoustic bubble sorting using well-defined bubble sizes formed in a flow-focusing device, then we demonstrate successful acoustic sorting of a commercial UCA. This novel sorting strategy may lead to an overall improvement of the sensitivity of contrast ultrasound by more than 10 dB.

UNIFICATION OF PROCESSES OF SORTING OUT OF DESTROYED CONSTRUCTION OBJECTS

Directory of Open Access Journals (Sweden)

SHATOV S. V.

2015-09-01

Full Text Available Summary. Problem statement. Technogenic catastrophes, failures or natural calamities, result in destruction of build objects. Under the obstructions of destructions can be victims. The most widespread technogenic failure is explosions of gas. The structure of obstructions changes and depends on parameters and direction of explosion, firstly its size and location of wreckages. Sorting out of obstructions is carried out with machines and mechanisms which do not meet the requirements of these works, that predetermines of carrying out of rescue or restoration works on imperfect scheme , especially on the initial stages, and it increases terms and labour intensiveness of their conduct. Development technological solution is needed for the effective sorting out of destructions of construction objects. Purpose. Development of unification solution on the improvement of technological processes of sorting out of destructions of buildings and constructions. Conclusion. The analysis of experience of works shows on sorting out of the destroyed construction objects, show that they are carried out on imperfect scheme, which do not take into account character of destruction of objects and are based on the use of construction machines which do not meet the requirements of these processes, and lead to considerable resource losses. Developed unified scheme of sorting out of the destroyed construction objects depending on character of their destruction and possibility of line of works, and also with the use of build machines with a multipurpose equipment, provide the increase of efficiency of carrying out of rescue and construction works.

Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting

DEFF Research Database (Denmark)

Pagh, Rasmus; Pagter, Jacob Illeborg

2002-01-01

We study the problem of sorting n integers of w bits on a unit-cost RAM with word size w, and in particular consider the time-space trade-off (product of time and space in bits) for this problem. For comparison-based algorithms, the time-space complexity is known to be Θ(n2). A result of Beame...... shows that the lower bound also holds for non-comparison-based algorithms, but no algorithm has met this for time below the comparison-based Ω(nlgn) lower bound.We show that if sorting within some time bound &Ttilde; is possible, then time T = O(&Ttilde; + nlg* n) can be achieved with high probability...... using space S = O(n2/T + w), which is optimal. Given a deterministic priority queue using amortized time t(n) per operation and space nO(1), we provide a deterministic algorithm sorting in time T = O(n(t(n) + lg* n)) with S = O(n2/T + w). Both results require that w ≤ n1-Ω(1). Using existing priority...

Results from searches for exotic phenomena

CERN Document Server

Martyniuk, Alex; The ATLAS collaboration

2017-01-01

This talk will review the current state of experimental searches for "exotic" physics beyond the standard model of particle physics. The talk will cover a wide range of searches from ATLAS and CMS, in a (hopefully) jargon free pedagogical fashion, showing the big picture of the field at this time.

Automorphism group of the modified bubble-sort graph

OpenAIRE

Ganesan, Ashwin

2014-01-01

The modified bubble-sort graph of dimension $n$ is the Cayley graph of $S_n$ generated by $n$ cyclically adjacent transpositions. In the present paper, it is shown that the automorphism group of the modified bubble sort graph of dimension $n$ is $S_n \\times D_{2n}$, for all $n \\ge 5$. Thus, a complete structural description of the automorphism group of the modified bubble-sort graph is obtained. A similar direct product decomposition is seen to hold for arbitrary normal Cayley graphs generate...

Development of the Biology Card Sorting Task to Measure Conceptual Expertise in Biology

Science.gov (United States)

Smith, Julia I.; Combs, Elijah D.; Nagami, Paul H.; Alto, Valerie M.; Goh, Henry G.; Gourdet, Muryam A. A.; Hough, Christina M.; Nickell, Ashley E.; Peer, Adrian G.; Coley, John D.; Tanner, Kimberly D.

2013-01-01

There are widespread aspirations to focus undergraduate biology education on teaching students to think conceptually like biologists; however, there is a dearth of assessment tools designed to measure progress from novice to expert biological conceptual thinking. We present the development of a novel assessment tool, the Biology Card Sorting Task, designed to probe how individuals organize their conceptual knowledge of biology. While modeled on tasks from cognitive psychology, this task is unique in its design to test two hypothesized conceptual frameworks for the organization of biological knowledge: 1) a surface feature organization focused on organism type and 2) a deep feature organization focused on fundamental biological concepts. In this initial investigation of the Biology Card Sorting Task, each of six analytical measures showed statistically significant differences when used to compare the card sorting results of putative biological experts (biology faculty) and novices (non–biology major undergraduates). Consistently, biology faculty appeared to sort based on hypothesized deep features, while non–biology majors appeared to sort based on either surface features or nonhypothesized organizational frameworks. Results suggest that this novel task is robust in distinguishing populations of biology experts and biology novices and may be an adaptable tool for tracking emerging biology conceptual expertise. PMID:24297290

Real-World Sorting of RHIC Superconducting Magnets

International Nuclear Information System (INIS)

Wei, J.; Gupta, R.; Harrison, M.; Jain, A.; Peggs, S.; Thompson, P.; Trbojevic, D.; Wanderer, P.

1999-01-01

During the seven-year construction of the Relativistic Heavy Ion Collider (RHIC), more than 1700 superconducting dipoles, quadrupoles, sextupoles, and multi-layer correctors have been constructed and installed. These magnets have been sorted at several production stages to optimize their performance and reliability. For arc magnets, priorities have bene put first on quench performance and operational risk minimization, second on field transfer function and other first-order quantities, and finally on nonlinear field errors which were painstakingly optimized at design. For Interaction-Region (IR) magnets, sorting is applied to select the best possible combination of magnets for the low-β interaction points (IP). This paper summarizes the history of this real-world sorting process

Support for designing waste sorting systems: A mini review.

Science.gov (United States)

Rousta, Kamran; Ordoñez, Isabel; Bolton, Kim; Dahlén, Lisa

2017-11-01

This article presents a mini review of research aimed at understanding material recovery from municipal solid waste. It focuses on two areas, waste sorting behaviour and collection systems, so that research on the link between these areas could be identified and evaluated. The main results presented and the methods used in the articles are categorised and appraised. The mini review reveals that most of the work that offered design guidelines for waste management systems was based on optimising technical aspects only. In contrast, most of the work that focused on user involvement did not consider developing the technical aspects of the system, but was limited to studies of user behaviour. The only clear consensus among the articles that link user involvement with the technical system is that convenient waste collection infrastructure is crucial for supporting source separation. This mini review reveals that even though the connection between sorting behaviour and technical infrastructure has been explored and described in some articles, there is still a gap when using this knowledge to design waste sorting systems. Future research in this field would benefit from being multidisciplinary and from using complementary methods, so that holistic solutions for material recirculation can be identified. It would be beneficial to actively involve users when developing sorting infrastructures, to be sure to provide a waste management system that will be properly used by them.

Sorting Out Seasonal Allergies

Science.gov (United States)

... Close ‹ Back to Healthy Living Sorting Out Seasonal Allergies Sneezing, runny nose, nasal congestion. Symptoms of the ... How do I know if I have seasonal allergies? According to Dr. Georgeson, the best way to ...

Development of a reactor thermalhydraulic experiment databank(SORTED1)

International Nuclear Information System (INIS)

Bang, Young Seck; Kim, Eun Kyoung; Kim, Hho Jung; Lee, Sang Yong

1994-01-01

The recent trend in thermalhydraulic safety analysis of nuclear power plant shows the best-estimate and probabilistic approaches, therefore, the verification of the best-estimate code based on the applicable experiment data has been required. The present study focused on developing a simple databank, SORTED1, to be effectively used for code verification. The development of SORTED1 includes a data collection from the various sources including ENCOUNTER, which is the reactor safety data bank of U.S. Nuclear Regulatory Commission, a reorganization of collected resources suitable for requirements of SORTED1 database management system (DBMS), and a development of a simple DBMS. The SORTED1 is designed in Unix environment with graphic user interface to improve a user convenience and has a capability to provide the test related information. The currently registered data in SORTED1 cover 759 thermalhydraulic tests including LOFT, Semiscale, etc

Automatic online spike sorting with singular value decomposition and fuzzy C-mean clustering

Directory of Open Access Journals (Sweden)

Oliynyk Andriy

2012-08-01

Full Text Available Abstract Background Understanding how neurons contribute to perception, motor functions and cognition requires the reliable detection of spiking activity of individual neurons during a number of different experimental conditions. An important problem in computational neuroscience is thus to develop algorithms to automatically detect and sort the spiking activity of individual neurons from extracellular recordings. While many algorithms for spike sorting exist, the problem of accurate and fast online sorting still remains a challenging issue. Results Here we present a novel software tool, called FSPS (Fuzzy SPike Sorting, which is designed to optimize: (i fast and accurate detection, (ii offline sorting and (iii online classification of neuronal spikes with very limited or null human intervention. The method is based on a combination of Singular Value Decomposition for fast and highly accurate pre-processing of spike shapes, unsupervised Fuzzy C-mean, high-resolution alignment of extracted spike waveforms, optimal selection of the number of features to retain, automatic identification the number of clusters, and quantitative quality assessment of resulting clusters independent on their size. After being trained on a short testing data stream, the method can reliably perform supervised online classification and monitoring of single neuron activity. The generalized procedure has been implemented in our FSPS spike sorting software (available free for non-commercial academic applications at the address: http://www.spikesorting.com using LabVIEW (National Instruments, USA. We evaluated the performance of our algorithm both on benchmark simulated datasets with different levels of background noise and on real extracellular recordings from premotor cortex of Macaque monkeys. The results of these tests showed an excellent accuracy in discriminating low-amplitude and overlapping spikes under strong background noise. The performance of our method is

A visual ergonomics intervention in mail sorting facilities: effects on eyes, muscles and productivity.

Science.gov (United States)

Hemphälä, Hillevi; Eklund, Jörgen

2012-01-01

Visual requirements are high when sorting mail. The purpose of this visual ergonomics intervention study was to evaluate the visual environment in mail sorting facilities and to explore opportunities for improving the work situation by reducing visual strain, improving the visual work environment and reducing mail sorting time. Twenty-seven postmen/women participated in a pre-intervention study, which included questionnaires on their experiences of light, visual ergonomics, health, and musculoskeletal symptoms. Measurements of lighting conditions and productivity were also performed along with eye examinations of the postmen/women. The results from the pre-intervention study showed that the postmen/women who suffered from eyestrain had a higher prevalence of musculoskeletal disorders (MSD) and sorted slower, than those without eyestrain. Illuminance and illuminance uniformity improved as a result of the intervention. The two post-intervention follow-ups showed a higher prevalence of MSD among the postmen/women with eyestrain than among those without. The previous differences in sorting time for employees with and without eyestrain disappeared. After the intervention, the postmen/women felt better in general, experienced less work induced stress, and considered that the total general lighting had improved. The most pronounced decreases in eyestrain, MSD, and mail sorting time were seen among the younger participants of the group. Copyright © 2011 Elsevier Ltd and The Ergonomics Society. All rights reserved.

Search Results | Page 811 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 8101 - 8110 of 8531 ... Informational life of the marginalized : a study of digital access in three Mexican towns. The weight of family networks plays a crucial role in learning about ICTs. ... policies advocacy work and to build a more equitable society. ... attention on the search for a balance to protect plant breeder''s and ...

A real-time spike sorting method based on the embedded GPU.

Science.gov (United States)

Zelan Yang; Kedi Xu; Xiang Tian; Shaomin Zhang; Xiaoxiang Zheng

2017-07-01

Microelectrode arrays with hundreds of channels have been widely used to acquire neuron population signals in neuroscience studies. Online spike sorting is becoming one of the most important challenges for high-throughput neural signal acquisition systems. Graphic processing unit (GPU) with high parallel computing capability might provide an alternative solution for increasing real-time computational demands on spike sorting. This study reported a method of real-time spike sorting through computing unified device architecture (CUDA) which was implemented on an embedded GPU (NVIDIA JETSON Tegra K1, TK1). The sorting approach is based on the principal component analysis (PCA) and K-means. By analyzing the parallelism of each process, the method was further optimized in the thread memory model of GPU. Our results showed that the GPU-based classifier on TK1 is 37.92 times faster than the MATLAB-based classifier on PC while their accuracies were the same with each other. The high-performance computing features of embedded GPU demonstrated in our studies suggested that the embedded GPU provide a promising platform for the real-time neural signal processing.

Long term estimates for sorting strategies of the LHC dipoles

CERN Document Server

Scandale, Walter; Giovannozzi, Massimo; Todesco, Ezio

1998-01-01

Sorting strategies are investigated in view of improving the dynamic aperture of the CERN-LHC. Local and quasi-local compensation of the random field shape imperfections are discussed and applied to simplified model of the LHC lattice. The most promising strategies are further investigated on a realistic LHC model with particular emphasis on the analysis of the robustness of the dynamic aperture improvements including long term effects. First results on the application of the recently developed extrapolation law for the prediction of the dynamic aperture to the sorting problem are presented.

Optimization of Particle Search Algorithm for CFD-DEM Simulations

Directory of Open Access Journals (Sweden)

G. Baryshev

2013-09-01

Full Text Available Discrete element method has numerous applications in particle physics. However, simulating particles as discrete entities can become costly for large systems. In time-driven DEM simulation most computation time is taken by contact search stage. We propose an efficient collision detection method which is based on sorting particles by their coordinates. Using multiple sorting criteria allows minimizing number of potential neighbours and defines fitness of this approach for simulation of massive systems in 3D. This method is compared to a common approach that consists of placing particles onto a grid of cells. Advantage of the new approach is independence of simulation parameters upon particle radius and domain size.

NeatSort - A practical adaptive algorithm

OpenAIRE

La Rocca, Marcello; Cantone, Domenico

2014-01-01

We present a new adaptive sorting algorithm which is optimal for most disorder metrics and, more important, has a simple and quick implementation. On input $X$, our algorithm has a theoretical $\\Omega (|X|)$ lower bound and a $\\mathcal{O}(|X|\\log|X|)$ upper bound, exhibiting amazing adaptive properties which makes it run closer to its lower bound as disorder (computed on different metrics) diminishes. From a practical point of view, \\textit{NeatSort} has proven itself competitive with (and of...

PACMan to Help Sort Hubble Proposals

Science.gov (United States)

Kohler, Susanna

2017-04-01

Every year, astronomers submit over a thousand proposals requesting time on the Hubble Space Telescope (HST). Currently, humans must sort through each of these proposals by hand before sending them off for review. Could this burden be shifted to computers?A Problem of VolumeAstronomer Molly Peeples gathered stats on the HST submissions sent in last week for the upcoming HST Cycle 25 (the deadline was Friday night), relative to previous years. This years proposal round broke the record, with over 1200 proposals submitted in total for Cycle 25. [Molly Peeples]Each proposal cycle for HST time attracts on the order of 1100 proposals accounting for far more HST time than is available. The proposals are therefore carefully reviewed by around 150 international members of the astronomy community during a six-month process to select those with the highest scientific merit.Ideally, each proposal will be read by reviewers that have scientific expertise relevant to the proposal topic: if a proposal requests HST time to study star formation, for instance, then the reviewers assigned to it should have research expertise in star formation.How does this matching of proposals to reviewers occur? The current method relies on self-reported categorization of the submitted proposals. This is unreliable, however; proposals are often mis-categorized by submitters due to misunderstanding or ambiguous cases.As a result, the Science Policies Group at the Space Telescope Science Institute (STScI) which oversees the review of HST proposals must go through each of the proposals by hand and re-categorize them. The proposals are then matched to reviewers with self-declared expertise in the same category.With the number of HST proposals on the rise and the expectation that the upcoming James Webb Space Telescope (JWST) will elicit even more proposals for time than Hubble scientists at STScI and NASA are now asking: could the human hours necessary for this task be spared? Could a computer program

Sorting cells of the microalga Chlorococcum littorale with increased triacylglycerol productivity.

Science.gov (United States)

Cabanelas, Iago Teles Dominguez; van der Zwart, Mathijs; Kleinegris, Dorinde M M; Wijffels, René H; Barbosa, Maria J

2016-01-01

Despite extensive research in the last decades, microalgae are still only economically feasible for high valued markets. Strain improvement is a strategy to increase productivities, hence reducing costs. In this work, we focus on microalgae selection: taking advantage of the natural biological variability of species to select variations based on desired characteristics. We focused on triacylglycerol (TAG), which have applications ranging from biodiesel to high-value omega-3 fatty-acids. Hence, we demonstrated a strategy to sort microalgae cells with increased TAG productivity. 1. We successfully identified sub-populations of cells with increased TAG productivity using Fluorescence assisted cell sorting (FACS). 2. We sequentially sorted cells after repeated cycles of N-starvation, resulting in five sorted populations (S1-S5). 3. The comparison between sorted and original populations showed that S5 had the highest TAG productivity [0.34 against 0.18 g l(-1) day(-1) (original), continuous light]. 4. Original and S5 were compared in lab-scale reactors under simulated summer conditions confirming the increased TAG productivity of S5 (0.4 against 0.2 g l(-1) day(-1)). Biomass composition analyses showed that S5 produced more biomass under N-starvation because of an increase only in TAG content and, flow cytometry showed that our selection removed cells with lower efficiency in producing TAGs. All combined, our results present a successful strategy to improve the TAG productivity of Chlorococcum littorale, without resourcing to genetic manipulation or random mutagenesis. Additionally, the improved TAG productivity of S5 was confirmed under simulated summer conditions, highlighting the industrial potential of S5 for microalgal TAG production.

Transcriptional profiling of cells sorted by RNA abundance

NARCIS (Netherlands)

Klemm, Sandy; Semrau, Stefan; Wiebrands, Kay; Mooijman, Dylan; Faddah, Dina A; Jaenisch, Rudolf; van Oudenaarden, Alexander

We have developed a quantitative technique for sorting cells on the basis of endogenous RNA abundance, with a molecular resolution of 10-20 transcripts. We demonstrate efficient and unbiased RNA extraction from transcriptionally sorted cells and report a high-fidelity transcriptome measurement of

PIR search result - KOME | LSDB Archive [Life Science Database Archive metadata

Lifescience Database Archive (English)

Full Text Available e filtered with Expect values lower than 1e-10. Number of data entries 1,549,409 ...he searches. Data analysis method Performed blastx searches against the PIR protein database. The results ar

A probability-based multi-cycle sorting method for 4D-MRI: A simulation study.

Science.gov (United States)

Liang, Xiao; Yin, Fang-Fang; Liu, Yilin; Cai, Jing

2016-12-01

To develop a novel probability-based sorting method capable of generating multiple breathing cycles of 4D-MRI images and to evaluate performance of this new method by comparing with conventional phase-based methods in terms of image quality and tumor motion measurement. Based on previous findings that breathing motion probability density function (PDF) of a single breathing cycle is dramatically different from true stabilized PDF that resulted from many breathing cycles, it is expected that a probability-based sorting method capable of generating multiple breathing cycles of 4D images may capture breathing variation information missing from conventional single-cycle sorting methods. The overall idea is to identify a few main breathing cycles (and their corresponding weightings) that can best represent the main breathing patterns of the patient and then reconstruct a set of 4D images for each of the identified main breathing cycles. This method is implemented in three steps: (1) The breathing signal is decomposed into individual breathing cycles, characterized by amplitude, and period; (2) individual breathing cycles are grouped based on amplitude and period to determine the main breathing cycles. If a group contains more than 10% of all breathing cycles in a breathing signal, it is determined as a main breathing pattern group and is represented by the average of individual breathing cycles in the group; (3) for each main breathing cycle, a set of 4D images is reconstructed using a result-driven sorting method adapted from our previous study. The probability-based sorting method was first tested on 26 patients' breathing signals to evaluate its feasibility of improving target motion PDF. The new method was subsequently tested for a sequential image acquisition scheme on the 4D digital extended cardiac torso (XCAT) phantom. Performance of the probability-based and conventional sorting methods was evaluated in terms of target volume precision and accuracy as measured

Two-sorted Point-Interval Temporal Logics

DEFF Research Database (Denmark)

Balbiani, Philippe; Goranko, Valentin; Sciavicco, Guido

2011-01-01

There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as particular, duration-less intervals. Here we develop explicitly two-sorted point-interval temporal logical framework...... whereby time instants (points) and time periods (intervals) are considered on a par, and the perspective can shift between them within the formal discourse. We focus on fragments involving only modal operators that correspond to the inter-sort relations between points and intervals. We analyze...

Unsupervised neural spike sorting for high-density microelectrode arrays with convolutive independent component analysis.

Science.gov (United States)

Leibig, Christian; Wachtler, Thomas; Zeck, Günther

2016-09-15

Unsupervised identification of action potentials in multi-channel extracellular recordings, in particular from high-density microelectrode arrays with thousands of sensors, is an unresolved problem. While independent component analysis (ICA) achieves rapid unsupervised sorting, it ignores the convolutive structure of extracellular data, thus limiting the unmixing to a subset of neurons. Here we present a spike sorting algorithm based on convolutive ICA (cICA) to retrieve a larger number of accurately sorted neurons than with instantaneous ICA while accounting for signal overlaps. Spike sorting was applied to datasets with varying signal-to-noise ratios (SNR: 3-12) and 27% spike overlaps, sampled at either 11.5 or 23kHz on 4365 electrodes. We demonstrate how the instantaneity assumption in ICA-based algorithms has to be relaxed in order to improve the spike sorting performance for high-density microelectrode array recordings. Reformulating the convolutive mixture as an instantaneous mixture by modeling several delayed samples jointly is necessary to increase signal-to-noise ratio. Our results emphasize that different cICA algorithms are not equivalent. Spike sorting performance was assessed with ground-truth data generated from experimentally derived templates. The presented spike sorter was able to extract ≈90% of the true spike trains with an error rate below 2%. It was superior to two alternative (c)ICA methods (≈80% accurately sorted neurons) and comparable to a supervised sorting. Our new algorithm represents a fast solution to overcome the current bottleneck in spike sorting of large datasets generated by simultaneous recording with thousands of electrodes. Copyright © 2016 Elsevier B.V. All rights reserved.

Google chemtrails: a methodology to analyze topic representation in search engine results

OpenAIRE

Ballatore, Andrea

2015-01-01

Search engine results influence the visibility of different viewpoints in political, cultural, and scientific debates. Treating search engines as editorial products with intrinsic biases can help understand the structure of information flows in new media. This paper outlines an empirical methodology to analyze the representation of topics in search engines, reducing the spatial and temporal biases in the results. As a case study, the methodology is applied to 15 popular conspiracy theories, e...

Buoyancy-activated cell sorting using targeted biotinylated albumin microbubbles.

Directory of Open Access Journals (Sweden)

Yu-Ren Liou

Full Text Available Cell analysis often requires the isolation of certain cell types. Various isolation methods have been applied to cell sorting, including fluorescence-activated cell sorting and magnetic-activated cell sorting. However, these conventional approaches involve exerting mechanical forces on the cells, thus risking cell damage. In this study we applied a novel isolation method called buoyancy-activated cell sorting, which involves using biotinylated albumin microbubbles (biotin-MBs conjugated with antibodies (i.e., targeted biotin-MBs. Albumin MBs are widely used as contrast agents in ultrasound imaging due to their good biocompatibility and stability. For conjugating antibodies, biotin is conjugated onto the albumin MB shell via covalent bonds and the biotinylated antibodies are conjugated using an avidin-biotin system. The albumin microbubbles had a mean diameter of 2 μm with a polydispersity index of 0.16. For cell separation, the MDA-MB-231 cells are incubated with the targeted biotin-MBs conjugated with anti-CD44 for 10 min, centrifuged at 10 g for 1 min, and then allowed 1 hour at 4 °C for separation. The results indicate that targeted biotin-MBs conjugated with anti-CD44 antibodies can be used to separate MDA-MB-231 breast cancer cells; more than 90% of the cells were collected in the MB layer when the ratio of the MBs to cells was higher than 70:1. Furthermore, we found that the separating efficiency was higher for targeted biotin-MBs than for targeted avidin-incorporated albumin MBs (avidin-MBs, which is the most common way to make targeted albumin MBs. We also demonstrated that the recovery rate of targeted biotin-MBs was up to 88% and the sorting purity was higher than 84% for a a heterogenous cell population containing MDA-MB-231 cells (CD44(+ and MDA-MB-453 cells (CD44-, which are classified as basal-like breast cancer cells and luminal breast cancer cells, respectively. Knowing that the CD44(+ is a commonly used cancer

Gender Sorting across K-12 Schools in the United States

Science.gov (United States)

Long, Mark C.; Conger, Dylan

2013-01-01

This article documents evidence of nonrandom gender sorting across K-12 schools in the United States. The sorting exists among coed schools and at all grade levels, and it is highest in the secondary school grades. We observe some gender sorting across school sectors and types: for instance, males are slightly underrepresented in private schools…

A novel automated spike sorting algorithm with adaptable feature extraction.

Science.gov (United States)

Bestel, Robert; Daus, Andreas W; Thielemann, Christiane

2012-10-15

To study the electrophysiological properties of neuronal networks, in vitro studies based on microelectrode arrays have become a viable tool for analysis. Although in constant progress, a challenging task still remains in this area: the development of an efficient spike sorting algorithm that allows an accurate signal analysis at the single-cell level. Most sorting algorithms currently available only extract a specific feature type, such as the principal components or Wavelet coefficients of the measured spike signals in order to separate different spike shapes generated by different neurons. However, due to the great variety in the obtained spike shapes, the derivation of an optimal feature set is still a very complex issue that current algorithms struggle with. To address this problem, we propose a novel algorithm that (i) extracts a variety of geometric, Wavelet and principal component-based features and (ii) automatically derives a feature subset, most suitable for sorting an individual set of spike signals. Thus, there is a new approach that evaluates the probability distribution of the obtained spike features and consequently determines the candidates most suitable for the actual spike sorting. These candidates can be formed into an individually adjusted set of spike features, allowing a separation of the various shapes present in the obtained neuronal signal by a subsequent expectation maximisation clustering algorithm. Test results with simulated data files and data obtained from chick embryonic neurons cultured on microelectrode arrays showed an excellent classification result, indicating the superior performance of the described algorithm approach. Copyright © 2012 Elsevier B.V. All rights reserved.

Missing Links in Middle School: Developing Use of Disciplinary Relatedness in Evaluating Internet Search Results.

Directory of Open Access Journals (Sweden)

Frank C Keil

Full Text Available In the "digital native" generation, internet search engines are a commonly used source of information. However, adolescents may fail to recognize relevant search results when they are related in discipline to the search topic but lack other cues. Middle school students, high school students, and adults rated simulated search results for relevance to the search topic. The search results were designed to contrast deep discipline-based relationships with lexical similarity to the search topic. Results suggest that the ability to recognize disciplinary relatedness without supporting cues may continue to develop into high school. Despite frequent search engine usage, younger adolescents may require additional support to make the most of the information available to them.

Efficient Architecture for Spike Sorting in Reconfigurable Hardware

Science.gov (United States)

Hwang, Wen-Jyi; Lee, Wei-Hao; Lin, Shiow-Jyu; Lai, Sheng-Ying

2013-01-01

This paper presents a novel hardware architecture for fast spike sorting. The architecture is able to perform both the feature extraction and clustering in hardware. The generalized Hebbian algorithm (GHA) and fuzzy C-means (FCM) algorithm are used for feature extraction and clustering, respectively. The employment of GHA allows efficient computation of principal components for subsequent clustering operations. The FCM is able to achieve near optimal clustering for spike sorting. Its performance is insensitive to the selection of initial cluster centers. The hardware implementations of GHA and FCM feature low area costs and high throughput. In the GHA architecture, the computation of different weight vectors share the same circuit for lowering the area costs. Moreover, in the FCM hardware implementation, the usual iterative operations for updating the membership matrix and cluster centroid are merged into one single updating process to evade the large storage requirement. To show the effectiveness of the circuit, the proposed architecture is physically implemented by field programmable gate array (FPGA). It is embedded in a System-on-Chip (SOC) platform for performance measurement. Experimental results show that the proposed architecture is an efficient spike sorting design for attaining high classification correct rate and high speed computation. PMID:24189331

Efficient Architecture for Spike Sorting in Reconfigurable Hardware

Directory of Open Access Journals (Sweden)

Sheng-Ying Lai

2013-11-01

Full Text Available This paper presents a novel hardware architecture for fast spike sorting. The architecture is able to perform both the feature extraction and clustering in hardware. The generalized Hebbian algorithm (GHA and fuzzy C-means (FCM algorithm are used for feature extraction and clustering, respectively. The employment of GHA allows efficient computation of principal components for subsequent clustering operations. The FCM is able to achieve near optimal clustering for spike sorting. Its performance is insensitive to the selection of initial cluster centers. The hardware implementations of GHA and FCM feature low area costs and high throughput. In the GHA architecture, the computation of different weight vectors share the same circuit for lowering the area costs. Moreover, in the FCM hardware implementation, the usual iterative operations for updating the membership matrix and cluster centroid are merged into one single updating process to evade the large storage requirement. To show the effectiveness of the circuit, the proposed architecture is physically implemented by field programmable gate array (FPGA. It is embedded in a System-on-Chip (SOC platform for performance measurement. Experimental results show that the proposed architecture is an efficient spike sorting design for attaining high classification correct rate and high speed computation.

Software information sorting code 'PLUTO-R'

International Nuclear Information System (INIS)

Tsunematsu, Toshihide; Naraoka, Kenitsu; Adachi, Masao; Takeda, Tatsuoki

1984-10-01

A software information sorting code PLUTO-R is developed as one of the supporting codes of the TRITON system for the fusion plasma analysis. The objective of the PLUTO-R code is to sort reference materials of the codes in the TRITON code system. The easiness in the registration of information is especially pursued. As experience and skill in the data registration are not required, this code is usable for construction of general small-scale information system. This report gives an overall description and the user's manual of the PLUTO-R code. (author)

Noise-robust unsupervised spike sorting based on discriminative subspace learning with outlier handling

Science.gov (United States)

Keshtkaran, Mohammad Reza; Yang, Zhi

2017-06-01

Objective. Spike sorting is a fundamental preprocessing step for many neuroscience studies which rely on the analysis of spike trains. Most of the feature extraction and dimensionality reduction techniques that have been used for spike sorting give a projection subspace which is not necessarily the most discriminative one. Therefore, the clusters which appear inherently separable in some discriminative subspace may overlap if projected using conventional feature extraction approaches leading to a poor sorting accuracy especially when the noise level is high. In this paper, we propose a noise-robust and unsupervised spike sorting algorithm based on learning discriminative spike features for clustering. Approach. The proposed algorithm uses discriminative subspace learning to extract low dimensional and most discriminative features from the spike waveforms and perform clustering with automatic detection of the number of the clusters. The core part of the algorithm involves iterative subspace selection using linear discriminant analysis and clustering using Gaussian mixture model with outlier detection. A statistical test in the discriminative subspace is proposed to automatically detect the number of the clusters. Main results. Comparative results on publicly available simulated and real in vivo datasets demonstrate that our algorithm achieves substantially improved cluster distinction leading to higher sorting accuracy and more reliable detection of clusters which are highly overlapping and not detectable using conventional feature extraction techniques such as principal component analysis or wavelets. Significance. By providing more accurate information about the activity of more number of individual neurons with high robustness to neural noise and outliers, the proposed unsupervised spike sorting algorithm facilitates more detailed and accurate analysis of single- and multi-unit activities in neuroscience and brain machine interface studies.

LOGISTICAL SUPPORT OF PROCESSES OF SORTING OUT OF THE DESTROYED BUILDING OBJECTS

Directory of Open Access Journals (Sweden)

SHATOV S. V.

2016-09-01

Full Text Available Summary. Raising of problem. Natural calamities, technogenic catastrophes and failures, result in destruction of building objects. Under the obstructions of destructions there can be victims. The most widespread technogenic failure are explosions of domestic gas. The structure of obstructions changes depending on parameters and direction of explosion, first of all size and location of wreckages. Sorting out of obstructions is executed by machines and mechanisms which do not answer the requirements of these works, that predetermines falling short of logistical support to the requirements of rescue or restoration works, and it increases terms and labour intensiveness of their conduct. Development of technological decisions is therefore needed for the effective sorting out of destructions of building objects. Purpose. Development of methodology of determination of logistical support of processes of sorting out of destructions of building and building. Conclusion. Experience of works shows on sorting out of the destroyed building objects, that they are executed with the use of imperfect logistical support, which are not taken into account by character of destruction of objects and is based on the use of buildings machines which do not answer the requirements of these processes, that results in considerable resource losses. Building machines with a multipurpose equipment, which provide the increase of efficiency of implementation of rescue and restoration works, are worked out. Methodology of determination of number of technique is worked out for providing of material-supply of sorting out of destructions, in particular on the initial stage of rescue works for liberation of victims from under obstructions.

Coupling amplified DNA from flow-sorted chromosomes to high-density SNP mapping in barley

Directory of Open Access Journals (Sweden)

Bartoš Jan

2008-06-01

Full Text Available Abstract Background Flow cytometry facilitates sorting of single chromosomes and chromosome arms which can be used for targeted genome analysis. However, the recovery of microgram amounts of DNA needed for some assays requires sorting of millions of chromosomes which is laborious and time consuming. Yet, many genomic applications such as development of genetic maps or physical mapping do not require large DNA fragments. In such cases time-consuming de novo sorting can be minimized by utilizing whole-genome amplification. Results Here we report a protocol optimized in barley including amplification of DNA from only ten thousand chromosomes, which can be isolated in less than one hour. Flow-sorted chromosomes were treated with proteinase K and amplified using Phi29 multiple displacement amplification (MDA. Overnight amplification in a 20-microlitre reaction produced 3.7 – 5.7 micrograms DNA with a majority of products between 5 and 30 kb. To determine the purity of sorted fractions and potential amplification bias we used quantitative PCR for specific genes on each chromosome. To extend the analysis to a whole genome level we performed an oligonucleotide pool assay (OPA for interrogation of 1524 loci, of which 1153 loci had known genetic map positions. Analysis of unamplified genomic DNA of barley cv. Akcent using this OPA resulted in 1426 markers with present calls. Comparison with three replicates of amplified genomic DNA revealed >99% concordance. DNA samples from amplified chromosome 1H and a fraction containing chromosomes 2H – 7H were examined. In addition to loci with known map positions, 349 loci with unknown map positions were included. Based on this analysis 40 new loci were mapped to 1H. Conclusion The results indicate a significant potential of using this approach for physical mapping. Moreover, the study showed that multiple displacement amplification of flow-sorted chromosomes is highly efficient and representative which

Automatic online spike sorting with singular value decomposition and fuzzy C-mean clustering.

Science.gov (United States)

Oliynyk, Andriy; Bonifazzi, Claudio; Montani, Fernando; Fadiga, Luciano

2012-08-08

Understanding how neurons contribute to perception, motor functions and cognition requires the reliable detection of spiking activity of individual neurons during a number of different experimental conditions. An important problem in computational neuroscience is thus to develop algorithms to automatically detect and sort the spiking activity of individual neurons from extracellular recordings. While many algorithms for spike sorting exist, the problem of accurate and fast online sorting still remains a challenging issue. Here we present a novel software tool, called FSPS (Fuzzy SPike Sorting), which is designed to optimize: (i) fast and accurate detection, (ii) offline sorting and (iii) online classification of neuronal spikes with very limited or null human intervention. The method is based on a combination of Singular Value Decomposition for fast and highly accurate pre-processing of spike shapes, unsupervised Fuzzy C-mean, high-resolution alignment of extracted spike waveforms, optimal selection of the number of features to retain, automatic identification the number of clusters, and quantitative quality assessment of resulting clusters independent on their size. After being trained on a short testing data stream, the method can reliably perform supervised online classification and monitoring of single neuron activity. The generalized procedure has been implemented in our FSPS spike sorting software (available free for non-commercial academic applications at the address: http://www.spikesorting.com) using LabVIEW (National Instruments, USA). We evaluated the performance of our algorithm both on benchmark simulated datasets with different levels of background noise and on real extracellular recordings from premotor cortex of Macaque monkeys. The results of these tests showed an excellent accuracy in discriminating low-amplitude and overlapping spikes under strong background noise. The performance of our method is competitive with respect to other robust spike

A discrimination model in waste plastics sorting using NIR hyperspectral imaging system.

Science.gov (United States)

Zheng, Yan; Bai, Jiarui; Xu, Jingna; Li, Xiayang; Zhang, Yimin

2018-02-01

Classification of plastics is important in the recycling industry. A plastic identification model in the near infrared spectroscopy wavelength range 1000-2500 nm is proposed for the characterization and sorting of waste plastics using acrylonitrile butadiene styrene (ABS), polystyrene (PS), polypropylene (PP), polyethylene (PE), polyethylene terephthalate (PET), and polyvinyl chloride (PVC). The model is built by the feature wavelengths of standard samples applying the principle component analysis (PCA), and the accuracy, property and cross-validation of the model were analyzed. The model just contains a simple equation, center of mass coordinates, and radial distance, with which it is easy to develop classification and sorting software. A hyperspectral imaging system (HIS) with the identification model verified its practical application by using the unknown plastics. Results showed that the identification accuracy of unknown samples is 100%. All results suggested that the discrimination model was potential to an on-line characterization and sorting platform of waste plastics based on HIS. Copyright © 2017 Elsevier Ltd. All rights reserved.

BayesMotif: de novo protein sorting motif discovery from impure datasets.

Science.gov (United States)

Hu, Jianjun; Zhang, Fan

2010-01-18

Protein sorting is the process that newly synthesized proteins are transported to their target locations within or outside of the cell. This process is precisely regulated by protein sorting signals in different forms. A major category of sorting signals are amino acid sub-sequences usually located at the N-terminals or C-terminals of protein sequences. Genome-wide experimental identification of protein sorting signals is extremely time-consuming and costly. Effective computational algorithms for de novo discovery of protein sorting signals is needed to improve the understanding of protein sorting mechanisms. We formulated the protein sorting motif discovery problem as a classification problem and proposed a Bayesian classifier based algorithm (BayesMotif) for de novo identification of a common type of protein sorting motifs in which a highly conserved anchor is present along with a less conserved motif regions. A false positive removal procedure is developed to iteratively remove sequences that are unlikely to contain true motifs so that the algorithm can identify motifs from impure input sequences. Experiments on both implanted motif datasets and real-world datasets showed that the enhanced BayesMotif algorithm can identify anchored sorting motifs from pure or impure protein sequence dataset. It also shows that the false positive removal procedure can help to identify true motifs even when there is only 20% of the input sequences containing true motif instances. We proposed BayesMotif, a novel Bayesian classification based algorithm for de novo discovery of a special category of anchored protein sorting motifs from impure datasets. Compared to conventional motif discovery algorithms such as MEME, our algorithm can find less-conserved motifs with short highly conserved anchors. Our algorithm also has the advantage of easy incorporation of additional meta-sequence features such as hydrophobicity or charge of the motifs which may help to overcome the limitations of

Pattern Nulling of Linear Antenna Arrays Using Backtracking Search Optimization Algorithm

Directory of Open Access Journals (Sweden)

Kerim Guney

2015-01-01

Full Text Available An evolutionary method based on backtracking search optimization algorithm (BSA is proposed for linear antenna array pattern synthesis with prescribed nulls at interference directions. Pattern nulling is obtained by controlling only the amplitude, position, and phase of the antenna array elements. BSA is an innovative metaheuristic technique based on an iterative process. Various numerical examples of linear array patterns with the prescribed single, multiple, and wide nulls are given to illustrate the performance and flexibility of BSA. The results obtained by BSA are compared with the results of the following seventeen algorithms: particle swarm optimization (PSO, genetic algorithm (GA, modified touring ant colony algorithm (MTACO, quadratic programming method (QPM, bacterial foraging algorithm (BFA, bees algorithm (BA, clonal selection algorithm (CLONALG, plant growth simulation algorithm (PGSA, tabu search algorithm (TSA, memetic algorithm (MA, nondominated sorting GA-2 (NSGA-2, multiobjective differential evolution (MODE, decomposition with differential evolution (MOEA/D-DE, comprehensive learning PSO (CLPSO, harmony search algorithm (HSA, seeker optimization algorithm (SOA, and mean variance mapping optimization (MVMO. The simulation results show that the linear antenna array synthesis using BSA provides low side-lobe levels and deep null levels.

A Model Vision of Sorting System Application Using Robotic Manipulator

Directory of Open Access Journals (Sweden)

Maralo Sinaga

2010-08-01

Full Text Available Image processing in today’s world grabs massive attentions as it leads to possibilities of broaden application in many fields of high technology. The real challenge is how to improve existing sorting system in the Moduler Processing System (MPS laboratory which consists of four integrated stations of distribution, testing, processing and handling with a new image processing feature. Existing sorting method uses a set of inductive, capacitive and optical sensors do differentiate object color. This paper presents a mechatronics color sorting system solution with the application of image processing. Supported by OpenCV, image processing procedure senses the circular objects in an image captured in realtime by a webcam and then extracts color and position information out of it. This information is passed as a sequence of sorting commands to the manipulator (Mitsubishi Movemaster RV-M1 that does pick-and-place mechanism. Extensive testing proves that this color based object sorting system works 100% accurate under ideal condition in term of adequate illumination, circular objects’ shape and color. The circular objects tested for sorting are silver, red and black. For non-ideal condition, such as unspecified color the accuracy reduces to 80%.

Design and analysis on sorting blade for automated size-based sorting device

Science.gov (United States)

Razali, Zol Bahri; Kader, Mohamed Mydin M. Abdul; Samsudin, Yasser Suhaimi; Daud, Mohd Hisam

2017-09-01

Nowadays rubbish separating or recycling is a main problem of nation, where peoples dumped their rubbish into dumpsite without caring the value of the rubbish if it can be recycled and reused. Thus the author proposed an automated segregating device, purposely to teach people to separate their rubbish and value the rubbish that can be reused. The automated size-based mechanical segregating device provides significant improvements in terms of efficiency and consistency in this segregating process. This device is designed to make recycling easier, user friendly, in the hope that more people will take responsibility if it is less of an expense of time and effort. This paper discussed about redesign a blade for the sorting device which is to develop an efficient automated mechanical sorting device for the similar material but in different size. The machine is able to identify the size of waste and it depends to the coil inside the container to separate it out. The detail design and methodology is described in detail in this paper.

Standard practice for cell sorting in a BSL-3 facility.

Science.gov (United States)

Perfetto, Stephen P; Ambrozak, David R; Nguyen, Richard; Roederer, Mario; Koup, Richard A; Holmes, Kevin L

2011-01-01

Over the past decade, there has been a rapid growth in the number of BSL-3 and BSL-4 laboratories in the USA and an increase in demand for infectious cell sorting in BSL-3 laboratories. In 2007, the International Society for Advancement of Cytometry (ISAC) Biosafety Committee published standards for the sorting of unfixed cells and is an important resource for biosafety procedures when performing infectious cell sorting. Following a careful risk assessment, if it is determined that a cell sorter must be located within a BSL-3 laboratory, there are a variety of factors to be considered prior to the establishment of the laboratory. This chapter outlines procedures for infectious cell sorting in a BSL-3 environment to facilitate the establishment and safe operation of a BSL-3 cell sorting laboratory. Subjects covered include containment verification, remote operation, disinfection, personal protective equipment (PPE), and instrument-specific modifications for enhanced aerosol evacuation.

Decision trees with minimum average depth for sorting eight elements

KAUST Repository

AbouEisha, Hassan M.

2015-11-19

We prove that the minimum average depth of a decision tree for sorting 8 pairwise different elements is equal to 620160/8!. We show also that each decision tree for sorting 8 elements, which has minimum average depth (the number of such trees is approximately equal to 8.548×10^326365), has also minimum depth. Both problems were considered by Knuth (1998). To obtain these results, we use tools based on extensions of dynamic programming which allow us to make sequential optimization of decision trees relative to depth and average depth, and to count the number of decision trees with minimum average depth.

A 1.375-approximation algorithm for sorting by transpositions.

Science.gov (United States)

Elias, Isaac; Hartman, Tzvika

2006-01-01

Sorting permutations by transpositions is an important problem in genome rearrangements. A transposition is a rearrangement operation in which a segment is cut out of the permutation and pasted in a different location. The complexity of this problem is still open and it has been a 10-year-old open problem to improve the best known 1.5-approximation algorithm. In this paper, we provide a 1.375-approximation algorithm for sorting by transpositions. The algorithm is based on a new upper bound on the diameter of 3-permutations. In addition, we present some new results regarding the transposition diameter: we improve the lower bound for the transposition diameter of the symmetric group and determine the exact transposition diameter of simple permutations.

Recent results from the search for new phenomena at D0

International Nuclear Information System (INIS)

Wightman, J.A.

1997-06-01

We present results from several new searches for physics beyond the Standard Model. We describe a search based on the scalar sum of the transverse energy of the event, a global quantity nearly independent of the event topology. We summarize our searches for first generation leptoquarks into all three decay channels, eqeq, eqνq, and νqνq and note that this is the first time that the triumvirate of decay channels has been searched. We do not find any evidence for production of first generation leptoquarks and set a lower limit on the mass of the leptoquark of 175 GeV/c 2 , assuming the decay is exclusively into eqeq. We also present results from the first search for a third generation leptoquark with charge ±1/3. Again, we find no evidence for its existence for a mass less than 80 GeV/c 2 Finally, we discuss one of our searches for supersymmetry, specifically the pair-production of e, ν, and χ 0 2 where the decay yields final states with two photons plus missing transverse energy (E T ). We set limits on the production cross section ranging from 1 pb to 400 fb, depending on the mass. This analysis also sets a model-independent limit of σ · B(pp - γγ |E T | X) T (γ) > 12 GeV and |η| T > 25 GeV

Influence of retrospective sorting on image quality in respiratory correlated computed tomography

International Nuclear Information System (INIS)

Guckenberger, Matthias; Weininger, Markus; Wilbert, Juergen; Richter, Anne; Baier, Kurt; Krieger, Thomas; Polat, Buelent; Flentje, Michael

2007-01-01

Purpose: To evaluate the influence of retrospective sorting on image quality in four-dimensional respiratory correlated CT. Materials and methods: Twelve patients with intrapulmonary tumors were examined using a 24-slice CT-scanner in helical mode. Images were reconstructed after retrospective sorting based on five algorithms: amplitude-based sorting with definition of peak-exhalation and peak-inhalation separately/locally for all breathing cycles (LAS) and globally for the time of image acquisition (GAS). Drifts of the breathing signal were corrected in dc-GAS. In phase-based (PS) and cycle-based (CS) algorithm the projections were sorted relative to time. Motion artifacts were scored by a radiologist. The tumor volumes were measured using automatic image segmentation. Results: Averaged over all breathing phases, LAS and PS achieved significantly improved image quality and lowest tumor volume variability compared to GAS, dc-GAS and CS. Imaging redundancy of 5 s was not sufficient for GAS and dc-GAS: missing corresponding amplitude positions in one or several breathing cycles resulted in incomplete reconstruction of peak-ventilation images in 11/12 and 10/12 patients with GAS and dc-GAS, respectively. Limiting the analysis to mid-ventilation phases showed GAS and dc-GAS as the most reliable algorithms. Conclusions: LAS and PS are suggested as a compromise between image quality and radiation dose

IB-LBM simulation on blood cell sorting with a micro-fence structure.

Science.gov (United States)

Wei, Qiang; Xu, Yuan-Qing; Tian, Fang-bao; Gao, Tian-xin; Tang, Xiao-ying; Zu, Wen-Hong

2014-01-01

A size-based blood cell sorting model with a micro-fence structure is proposed in the frame of immersed boundary and lattice Boltzmann method (IB-LBM). The fluid dynamics is obtained by solving the discrete lattice Boltzmann equation, and the cells motion and deformation are handled by the immersed boundary method. A micro-fence consists of two parallel slope post rows which are adopted to separate red blood cells (RBCs) from white blood cells (WBCs), in which the cells to be separated are transported one after another by the flow into the passageway between the two post rows. Effected by the cross flow, RBCs are schemed to get through the pores of the nether post row since they are smaller and more deformable compared with WBCs. WBCs are required to move along the nether post row till they get out the micro-fence. Simulation results indicate that for a fix width of pores, the slope angle of the post row plays an important role in cell sorting. The cells mixture can not be separated properly in a small slope angle, while obvious blockages by WBCs will take place to disturb the continuous cell sorting in a big slope angle. As an optimal result, an adaptive slope angle is found to sort RBCs form WBCs correctly and continuously.

Sorting Real Numbers in $O(n\\sqrt{\\log n})$ Time and Linear Space

OpenAIRE

Han, Yijie

2017-01-01

We present an $O(n\\sqrt{\\log n})$ time and linear space algorithm for sorting real numbers. This breaks the long time illusion that real numbers have to be sorted by comparison sorting and take $\\Omega (n\\log n)$ time to be sorted.

An extensible infrastructure for fully automated spike sorting during online experiments.

Science.gov (United States)

Santhanam, Gopal; Sahani, Maneesh; Ryu, Stephen; Shenoy, Krishna

2004-01-01

When recording extracellular neural activity, it is often necessary to distinguish action potentials arising from distinct cells near the electrode tip, a process commonly referred to as "spike sorting." In a number of experiments, notably those that involve direct neuroprosthetic control of an effector, this cell-by-cell classification of the incoming signal must be achieved in real time. Several commercial offerings are available for this task, but all of these require some manual supervision per electrode, making each scheme cumbersome with large electrode counts. We present a new infrastructure that leverages existing unsupervised algorithms to sort and subsequently implement the resulting signal classification rules for each electrode using a commercially available Cerebus neural signal processor. We demonstrate an implementation of this infrastructure to classify signals from a cortical electrode array, using a probabilistic clustering algorithm (described elsewhere). The data were collected from a rhesus monkey performing a delayed center-out reach task. We used both sorted and unsorted (thresholded) action potentials from an array implanted in pre-motor cortex to "predict" the reach target, a common decoding operation in neuroprosthetic research. The use of sorted spikes led to an improvement in decoding accuracy of between 3.6 and 6.4%.

Sandia National Laboratories: Search Results

Science.gov (United States)

Locations Contact Us Employee Locator Search Menu About Leadership Mission Social Media Community Diversity Social Media Careers View All Jobs Students & Postdocs Benefits & Perks Hiring Process Deployment Centers New Mexico Small Business Assistance Program Sandia's Economic Impact Sandia Science &

4D CT sorting based on patient internal anatomy

Science.gov (United States)

Li, Ruijiang; Lewis, John H.; Cerviño, Laura I.; Jiang, Steve B.

2009-08-01

Respiratory motion during free-breathing computed tomography (CT) scan may cause significant errors in target definition for tumors in the thorax and upper abdomen. A four-dimensional (4D) CT technique has been widely used for treatment simulation of thoracic and abdominal cancer radiotherapy. The current 4D CT techniques require retrospective sorting of the reconstructed CT slices oversampled at the same couch position. Most sorting methods depend on external surrogates of respiratory motion recorded by extra instruments. However, respiratory signals obtained from these external surrogates may not always accurately represent the internal target motion, especially when irregular breathing patterns occur. We have proposed a new sorting method based on multiple internal anatomical features for multi-slice CT scan acquired in the cine mode. Four features are analyzed in this study, including the air content, lung area, lung density and body area. We use a measure called spatial coherence to select the optimal internal feature at each couch position and to generate the respiratory signals for 4D CT sorting. The proposed method has been evaluated for ten cancer patients (eight with thoracic cancer and two with abdominal cancer). For nine patients, the respiratory signals generated from the combined internal features are well correlated to those from external surrogates recorded by the real-time position management (RPM) system (average correlation: 0.95 ± 0.02), which is better than any individual internal measures at 95% confidence level. For these nine patients, the 4D CT images sorted by the combined internal features are almost identical to those sorted by the RPM signal. For one patient with an irregular breathing pattern, the respiratory signals given by the combined internal features do not correlate well with those from RPM (correlation: 0.68 ± 0.42). In this case, the 4D CT image sorted by our method presents fewer artifacts than that from the RPM signal. Our

Multiple pathways for vacuolar sorting of yeast proteinase A

DEFF Research Database (Denmark)

Westphal, V; Marcusson, E G; Winther, Jakob R.

1996-01-01

The sorting of the yeast proteases proteinase A and carboxypeptidase Y to the vacuole is a saturable, receptor-mediated process. Information sufficient for vacuolar sorting of the normally secreted protein invertase has in fusion constructs previously been found to reside in the propeptide...

Flow cytogenetics and chromosome sorting.

Science.gov (United States)

Cram, L S

1990-06-01

This review of flow cytogenetics and chromosome sorting provides an overview of general information in the field and describes recent developments in more detail. From the early developments of chromosome analysis involving single parameter or one color analysis to the latest developments in slit scanning of single chromosomes in a flow stream, the field has progressed rapidly and most importantly has served as an important enabling technology for the human genome project. Technological innovations that advanced flow cytogenetics are described and referenced. Applications in basic cell biology, molecular biology, and clinical investigations are presented. The necessary characteristics for large number chromosome sorting are highlighted. References to recent review articles are provided as a starting point for locating individual references that provide more detail. Specific references are provided for recent developments.

Recent results on the search for continuous sources with LIGO and GEO 600

International Nuclear Information System (INIS)

Sintes, Alicia M

2006-01-01

An overview of the searches for continuous gravitational wave signals in LIGO and GEO 600 performed on different recent science runs and results are presented. This includes both searching for gravitational waves from known pulsars as well as blind searches over a wide parameter space

Machine Vision System for Color Sorting Wood Edge-Glued Panel Parts

Science.gov (United States)

Qiang Lu; S. Srikanteswara; W. King; T. Drayer; Richard Conners; D. Earl Kline; Philip A. Araman

1997-01-01

This paper describes an automatic color sorting system for hardwood edge-glued panel parts. The color sorting system simultaneously examines both faces of a panel part and then determines which face has the "better" color given specified color uniformity and priority defined by management. The real-time color sorting system software and hardware are briefly...

Non-SUSY BSM Searches: Recent Results from ATLAS & CMS

CERN Document Server

Malek, Fairouz; The ATLAS collaboration

2015-01-01

The Standard Model of particle physics is a sensational success, especially since the discovery the 125 GeV Higgs boson. However, there are still numerous unanswered questions… Why is the Higgs so light? Do the interactions couplings unify and how can gravity be included? Why three fermion generations? What is dark matter? Theories Beyond the Standard Model (BSM), such as Grand Unified Theories, Extra Dimensions or Technicolour are trying to answer these questions. In this talk, we will focus on the most recent results obtained by the ATLAS and CMS experiments at the LHC for BSM searches, excluding Higgs and supersymmetry searches. New results in Dark matter, heavy narrow bosons, new heavy quarks and 3rd generation lepto-quarks will be presented. A brief summary of the perspectives at 14 Tev and at HL-LHC will be shown.

System Architecture For High Speed Sorting Of Potatoes

Science.gov (United States)

Marchant, J. A.; Onyango, C. M.; Street, M. J.

1989-03-01

This paper illustrates an industrial application of vision processing in which potatoes are sorted according to their size and shape at speeds of up to 40 objects per second. The result is a multi-processing approach built around the VME bus. A hardware unit has been designed and constructed to encode the boundary of the potatoes, to reducing the amount of data to be processed. A master 68000 processor is used to control this unit and to handle data transfers along the bus. Boundary data is passed to one of three 68010 slave processors each responsible for a line of potatoes across a conveyor belt. The slave processors calculate attributes such as shape, size and estimated weight of each potato and the master processor uses this data to operate the sorting mechanism. The system has been interfaced with a commercial grading machine and performance trials are now in progress.

The PreferenSort: A Holistic Instrument for Career Counseling

Science.gov (United States)

Amit, Adi; Sagiv, Lilach

2013-01-01

We present the PreferenSort, a career counseling instrument that derives counselees' vocational interests from their preferences among occupational titles. The PreferenSort allows for a holistic decision process, while taking into account the full complexity of occupations and encouraging deliberation about one's preferences and acceptable…

Effect of Hydrograph Characteristics on Vertical Grain Sorting in Gravel Bed Rivers

Science.gov (United States)

Hassan, M. A.; Parker, G.; Egozi, R.

2005-12-01

This study focuses on the formation of armour layers over a range of hydrologic conditions that includes two limiting cases; a relatively flat hydrograph that represents conditions produced by continuous snowmelt and a sharply peaked hydrograph that represents conditions associated with flash floods. To achieve our objective we analyzed field evidence, conducted flume experiments and performed numerical simulations. Sediment supply appears to be a first-order control on bed surface armouring, while the shape of the hydrograph plays a secondary role. All constant hydrograph experiments developed a well-armored structured surface while short asymmetrical hydrographs did not show substantial vertical sorting. All symmetrical hydrographs show some degree of sorting, and the sorting tended to become more pronounced with longer duration. Using the numerical framework of Parker, modified Powell, et al. and Wilcock and Crowe, we were able to achieve similar results.

Reduction of Aflatoxins in Apricot Kernels by Electronic and Manual Color Sorting

Directory of Open Access Journals (Sweden)

Rosanna Zivoli

2016-01-01

Full Text Available The efficacy of color sorting on reducing aflatoxin levels in shelled apricot kernels was assessed. Naturally-contaminated kernels were submitted to an electronic optical sorter or blanched, peeled, and manually sorted to visually identify and sort discolored kernels (dark and spotted from healthy ones. The samples obtained from the two sorting approaches were ground, homogenized, and analysed by HPLC-FLD for their aflatoxin content. A mass balance approach was used to measure the distribution of aflatoxins in the collected fractions. Aflatoxin B1 and B2 were identified and quantitated in all collected fractions at levels ranging from 1.7 to 22,451.5 µg/kg of AFB1 + AFB2, whereas AFG1 and AFG2 were not detected. Excellent results were obtained by manual sorting of peeled kernels since the removal of discolored kernels (2.6%–19.9% of total peeled kernels removed 97.3%–99.5% of total aflatoxins. The combination of peeling and visual/manual separation of discolored kernels is a feasible strategy to remove 97%–99% of aflatoxins accumulated in naturally-contaminated samples. Electronic optical sorter gave highly variable results since the amount of AFB1 + AFB2 measured in rejected fractions (15%–18% of total kernels ranged from 13% to 59% of total aflatoxins. An improved immunoaffinity-based HPLC-FLD method having low limits of detection for the four aflatoxins (0.01–0.05 µg/kg was developed and used to monitor the occurrence of aflatoxins in 47 commercial products containing apricot kernels and/or almonds commercialized in Italy. Low aflatoxin levels were found in 38% of the tested samples and ranged from 0.06 to 1.50 μg/kg for AFB1 and from 0.06 to 1.79 μg/kg for total aflatoxins.

Quartile and Outlier Detection on Heterogeneous Clusters Using Distributed Radix Sort

International Nuclear Information System (INIS)

Meredith, Jeremy S.; Vetter, Jeffrey S.

2011-01-01

In the past few years, performance improvements in CPUs and memory technologies have outpaced those of storage systems. When extrapolated to the exascale, this trend places strict limits on the amount of data that can be written to disk for full analysis, resulting in an increased reliance on characterizing in-memory data. Many of these characterizations are simple, but require sorted data. This paper explores an example of this type of characterization - the identification of quartiles and statistical outliers - and presents a performance analysis of a distributed heterogeneous radix sort as well as an assessment of current architectural bottlenecks.

Reduction of Aflatoxins in Apricot Kernels by Electronic and Manual Color Sorting

OpenAIRE

Zivoli, Rosanna; Gambacorta, Lucia; Piemontese, Luca; Solfrizzo, Michele

2016-01-01

The efficacy of color sorting on reducing aflatoxin levels in shelled apricot kernels was assessed. Naturally-contaminated kernels were submitted to an electronic optical sorter or blanched, peeled, and manually sorted to visually identify and sort discolored kernels (dark and spotted) from healthy ones. The samples obtained from the two sorting approaches were ground, homogenized, and analysed by HPLC-FLD for their aflatoxin content. A mass balance approach was used to measure the distributi...

Bicaudal-D1 regulates the intracellular sorting and signalling of neurotrophin receptors.

Science.gov (United States)

Terenzio, Marco; Golding, Matthew; Russell, Matthew R G; Wicher, Krzysztof B; Rosewell, Ian; Spencer-Dene, Bradley; Ish-Horowicz, David; Schiavo, Giampietro

2014-07-17

We have identified a new function for the dynein adaptor Bicaudal D homolog 1 (BICD1) by screening a siRNA library for genes affecting the dynamics of neurotrophin receptor-containing endosomes in motor neurons (MNs). Depleting BICD1 increased the intracellular accumulation of brain-derived neurotrophic factor (BDNF)-activated TrkB and p75 neurotrophin receptor (p75(NTR)) by disrupting the endosomal sorting, reducing lysosomal degradation and increasing the co-localisation of these neurotrophin receptors with retromer-associated sorting nexin 1. The resulting re-routing of active receptors increased their recycling to the plasma membrane and altered the repertoire of signalling-competent TrkB isoforms and p75(NTR) available for ligand binding on the neuronal surface. This resulted in attenuated, but more sustained, AKT activation in response to BDNF stimulation. These data, together with our observation that Bicd1 expression is restricted to the developing nervous system when neurotrophin receptor expression peaks, indicate that BICD1 regulates neurotrophin signalling by modulating the endosomal sorting of internalised ligand-activated receptors. © 2014 The Authors.

Selective sorting of waste

CERN Multimedia

2007-01-01

Not much effort needed, just willpower In order to keep the cost of disposing of waste materials as low as possible, CERN provides two types of recipient at the entrance to each building: a green plastic one for paper/cardboard and a metal one for general refuse. For some time now we have noticed, to our great regret, a growing negligence as far as selective sorting is concerned, with, for example, the green recipients being filled with a mixture of cardboard boxes full of polystyrene or protective wrappers, plastic bottles, empty yogurts pots, etc. …We have been able to ascertain, after careful checking, that this haphazard mixing of waste cannot be attributed to the cleaning staff but rather to members of the personnel who unscrupulously throw away their rubbish in a completely random manner. Non-sorted waste entails heavy costs for CERN. For information, once a non-compliant item is found in a green recipient, the entire contents are sent off for incineration rather than recycling… We are all concerned...

Differential evolution enhanced with multiobjective sorting-based mutation operators.

Science.gov (United States)

Wang, Jiahai; Liao, Jianjun; Zhou, Ying; Cai, Yiqiao

2014-12-01

Differential evolution (DE) is a simple and powerful population-based evolutionary algorithm. The salient feature of DE lies in its mutation mechanism. Generally, the parents in the mutation operator of DE are randomly selected from the population. Hence, all vectors are equally likely to be selected as parents without selective pressure at all. Additionally, the diversity information is always ignored. In order to fully exploit the fitness and diversity information of the population, this paper presents a DE framework with multiobjective sorting-based mutation operator. In the proposed mutation operator, individuals in the current population are firstly sorted according to their fitness and diversity contribution by nondominated sorting. Then parents in the mutation operators are proportionally selected according to their rankings based on fitness and diversity, thus, the promising individuals with better fitness and diversity have more opportunity to be selected as parents. Since fitness and diversity information is simultaneously considered for parent selection, a good balance between exploration and exploitation can be achieved. The proposed operator is applied to original DE algorithms, as well as several advanced DE variants. Experimental results on 48 benchmark functions and 12 real-world application problems show that the proposed operator is an effective approach to enhance the performance of most DE algorithms studied.

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'.

Science.gov (United States)

Swindale, Nicholas V; Mitelut, Catalin; Murphy, Timothy H; Spacek, Martin A

2017-02-10

Few stand-alone software applications are available for sorting spikes from recordings made with multi-electrode arrays. Ideally, an application should be user friendly with a graphical user interface, able to read data files in a variety of formats, and provide users with a flexible set of tools giving them the ability to detect and sort extracellular voltage waveforms from different units with some degree of reliability. Previously published spike sorting methods are now available in a software program, SpikeSorter, intended to provide electrophysiologists with a complete set of tools for sorting, starting from raw recorded data file and ending with the export of sorted spikes times. Procedures are automated to the extent this is currently possible. The article explains and illustrates the use of the program. A representative data file is opened, extracellular traces are filtered, events are detected and then clustered. A number of problems that commonly occur during sorting are illustrated, including the artefactual over-splitting of units due to the tendency of some units to fire spikes in pairs where the second spike is significantly smaller than the first, and over-splitting caused by slow variation in spike height over time encountered in some units. The accuracy of SpikeSorter's performance has been tested with surrogate ground truth data and found to be comparable to that of other algorithms in current development.

An introduction to three algorithms for sorting in situ

NARCIS (Netherlands)

Dijkstra, E.W.; Gasteren, van A.J.M.

1982-01-01

The purpose of this paper is to give a crisp introduction to three algorithms for sorting in situ, viz. insertion sort, heapsort and smoothsort. The more complicated the algorithm, the more elaborate the justification for the design decisions embodied by it. In passing we offer a style for the

Oscillating microbubbles for selective particle sorting in acoustic microfluidic devices

Science.gov (United States)

Rogers, Priscilla; Xu, Lin; Neild, Adrian

2012-05-01

In this study, acoustic waves were used to excite a microbubble for selective particle trapping and sorting. Excitation of the bubble at its volume resonance, as necessary to drive strong fluid microstreaming, resulted in the particles being either selectively attracted to the bubble or continuing to follow the local microstreamlines. The operating principle exploited two acoustic phenomena acting on the particle suspension: the drag force arising from the acoustic microstreaming and the secondary Bjerknes force, i.e. the attractive radiation force produced between an oscillating bubble and a non-buoyant particle. It was also found that standing wave fields within the fluid chamber could be used to globally align bubbles and particles for local particle sorting by the bubble.

Inconsistencies between Academic E-Book Platforms: A Comparison of Metadata and Search Results

Science.gov (United States)

Wiersma, Gabrielle; Tovstiadi, Esta

2017-01-01

This article presents the results of a study of academic e-books that compared the metadata and search results from major academic e-book platforms. The authors collected data and performed a series of test searches designed to produce the same result regardless of platform. Testing, however, revealed metadata-related errors and significant…

Heuristics for Relevancy Ranking of Earth Dataset Search Results

Science.gov (United States)

Lynnes, Christopher; Quinn, Patrick; Norton, James

2016-01-01

As the Variety of Earth science datasets increases, science researchers find it more challenging to discover and select the datasets that best fit their needs. The most common way of search providers to address this problem is to rank the datasets returned for a query by their likely relevance to the user. Large web page search engines typically use text matching supplemented with reverse link counts, semantic annotations and user intent modeling. However, this produces uneven results when applied to dataset metadata records simply externalized as a web page. Fortunately, data and search provides have decades of experience in serving data user communities, allowing them to form heuristics that leverage the structure in the metadata together with knowledge about the user community. Some of these heuristics include specific ways of matching the user input to the essential measurements in the dataset and determining overlaps of time range and spatial areas. Heuristics based on the novelty of the datasets can prioritize later, better versions of data over similar predecessors. And knowledge of how different user types and communities use data can be brought to bear in cases where characteristics of the user (discipline, expertise) or their intent (applications, research) can be divined. The Earth Observing System Data and Information System has begun implementing some of these heuristics in the relevancy algorithm of its Common Metadata Repository search engine.

Recent results from searches for Supersymmetry at ATLAS

CERN Multimedia

CERN. Geneva

2017-01-01

This talk summarizes the latest ATLAS results for searches for supersymmetric (SUSY) particles performed with pp collisions at a centre-of-mass energy of 13 TeV, using the full 2015 and 2016 dataset in many cases. Weak and strong production of SUSY particles in both R-Parity conserving and violating scenarios are considered assuming either prompt decays or longer-lived states.

Experimental results on SUSY searches with top

CERN Document Server

Eifert, Till

2014-01-01

Searches for supersymmetric partner particles of the top and bottom quarks at the Large Hadron Collider are reviewed. The focus is on the status of searches for a relatively light partner of the top quark performed by the CMS and ATLAS Collaborations. No excess beyond Standard Model expectations is observed and exclusion limits are set on the masses of supersymmetric particles.

A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting.

Science.gov (United States)

Gustavsson, Patrik; Syberfeldt, Anna

2018-01-01

Non-dominated sorting is a technique often used in evolutionary algorithms to determine the quality of solutions in a population. The most common algorithm is the Fast Non-dominated Sort (FNS). This algorithm, however, has the drawback that its performance deteriorates when the population size grows. The same drawback applies also to other non-dominating sorting algorithms such as the Efficient Non-dominated Sort with Binary Strategy (ENS-BS). An algorithm suggested to overcome this drawback is the Divide-and-Conquer Non-dominated Sort (DCNS) which works well on a limited number of objectives but deteriorates when the number of objectives grows. This article presents a new, more efficient algorithm called the Efficient Non-dominated Sort with Non-Dominated Tree (ENS-NDT). ENS-NDT is an extension of the ENS-BS algorithm and uses a novel Non-Dominated Tree (NDTree) to speed up the non-dominated sorting. ENS-NDT is able to handle large population sizes and a large number of objectives more efficiently than existing algorithms for non-dominated sorting. In the article, it is shown that with ENS-NDT the runtime of multi-objective optimization algorithms such as the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) can be substantially reduced.

COST EVALUATION OF AUTOMATED AND MANUAL POST- CONSUMER PLASTIC BOTTLE SORTING SYSTEMS

Science.gov (United States)

This project evaluates, on the basis of performance and cost, two Automated BottleSort® sorting systems for post-consumer commingled plastic containers developed by Magnetic Separation Systems. This study compares the costs to sort mixed bales of post-consumer plastic at these t...

Vertical sorting and the morphodynamics of bed form-dominated rivers : a sorting evolution model

NARCIS (Netherlands)

Blom, Astrid; Ribberink, Jan S.; Parker, Gary

2008-01-01

Existing sediment continuity models for nonuniform sediment suffer from a number of shortcomings, as they fail to describe vertical sorting fluxes other than through net aggradation or degradation of the bed and are based on a discrete representation of the bed material interacting with the flow. We

Exposure to airborne fungi during sorting of recyclable plastics in waste treatment facilities

Directory of Open Access Journals (Sweden)

Kristýna Černá

2017-02-01

Full Text Available Background: In working environment of waste treatment facilities, employees are exposed to high concentrations of airborne microorganisms. Fungi constitute an essential part of them. This study aims at evaluating the diurnal variation in concentrations and species composition of the fungal contamination in 2 plastic waste sorting facilities in different seasons. Material and Methods: Air samples from the 2 sorting facilities were collected through the membrane filters method on 4 different types of cultivation media. Isolated fungi were classified to genera or species by using a light microscopy. Results: Overall, the highest concentrations of airborne fungi were recorded in summer (9.1×103–9.0×105 colony-forming units (CFU/m3, while the lowest ones in winter (2.7×103–2.9×105 CFU/m3. The concentration increased from the beginning of the work shift and reached a plateau after 6–7 h of the sorting. The most frequently isolated airborne fungi were those of the genera Penicillium and Aspergillus. The turnover of fungal species between seasons was relatively high as well as changes in the number of detected species, but potentially toxigenic and allergenic fungi were detected in both facilities during all seasons. Conclusions: Generally, high concentrations of airborne fungi were detected in the working environment of plastic waste sorting facilities, which raises the question of health risk taken by the employees. Based on our results, the use of protective equipment by employees is recommended and preventive measures should be introduced into the working environment of waste sorting facilities to reduce health risk for employees. Med Pr 2017;68(1:1–9

Automatic Color Sorting Machine Using TCS230 Color Sensor And PIC Microcontroller

Directory of Open Access Journals (Sweden)

Kunhimohammed C K

2015-12-01

Full Text Available Sorting of products is a very difficult industrial process. Continuous manual sorting creates consistency issues. This paper describes a working prototype designed for automatic sorting of objects based on the color. TCS230 sensor was used to detect the color of the product and the PIC16F628A microcontroller was used to control the overall process. The identification of the color is based on the frequency analysis of the output of TCS230 sensor. Two conveyor belts were used, each controlled by separate DC motors. The first belt is for placing the product to be analyzed by the color sensor, and the second belt is for moving the container, having separated compartments, in order to separate the products. The experimental results promise that the prototype will fulfill the needs for higher production and precise quality in the field of automation.

Dielectrophoretic focusing integrated pulsed laser activated cell sorting

Science.gov (United States)

Zhu, Xiongfeng; Kung, Yu-Chun; Wu, Ting-Hsiang; Teitell, Michael A.; Chiou, Pei-Yu

2017-08-01

We present a pulsed laser activated cell sorter (PLACS) integrated with novel sheathless size-independent dielectrophoretic (DEP) focusing. Microfluidic fluorescence activated cell sorting (μFACS) systems aim to provide a fully enclosed environment for sterile cell sorting and integration with upstream and downstream microfluidic modules. Among them, PLACS has shown a great potential in achieving comparable performance to commercial aerosol-based FACS (>90% purity at 25,000 cells sec-1). However conventional sheath flow focusing method suffers a severe sample dilution issue. Here we demonstrate a novel dielectrophoresis-integrated pulsed laser activated cell sorter (DEP-PLACS). It consists of a microfluidic channel with 3D electrodes laid out to provide a tunnel-shaped electric field profile along a 4cmlong channel for sheathlessly focusing microparticles/cells into a single stream in high-speed microfluidic flows. All focused particles pass through the fluorescence detection zone along the same streamline regardless of their sizes and types. Upon detection of target fluorescent particles, a nanosecond laser pulse is triggered and focused in a neighboring channel to generate a rapidly expanding cavitation bubble for precise sorting. DEP-PLACS has achieved a sorting purity of 91% for polystyrene beads at a throughput of 1,500 particle/sec.

Validation of neural spike sorting algorithms without ground-truth information.

Science.gov (United States)

Barnett, Alex H; Magland, Jeremy F; Greengard, Leslie F

2016-05-01

The throughput of electrophysiological recording is growing rapidly, allowing thousands of simultaneous channels, and there is a growing variety of spike sorting algorithms designed to extract neural firing events from such data. This creates an urgent need for standardized, automatic evaluation of the quality of neural units output by such algorithms. We introduce a suite of validation metrics that assess the credibility of a given automatic spike sorting algorithm applied to a given dataset. By rerunning the spike sorter two or more times, the metrics measure stability under various perturbations consistent with variations in the data itself, making no assumptions about the internal workings of the algorithm, and minimal assumptions about the noise. We illustrate the new metrics on standard sorting algorithms applied to both in vivo and ex vivo recordings, including a time series with overlapping spikes. We compare the metrics to existing quality measures, and to ground-truth accuracy in simulated time series. We provide a software implementation. Metrics have until now relied on ground-truth, simulated data, internal algorithm variables (e.g. cluster separation), or refractory violations. By contrast, by standardizing the interface, our metrics assess the reliability of any automatic algorithm without reference to internal variables (e.g. feature space) or physiological criteria. Stability is a prerequisite for reproducibility of results. Such metrics could reduce the significant human labor currently spent on validation, and should form an essential part of large-scale automated spike sorting and systematic benchmarking of algorithms. Copyright © 2016 Elsevier B.V. All rights reserved.

Recent Results on Supersymmetry Searches with the CMS Detector

CERN Multimedia

CERN. Geneva

2014-01-01

We review the status of SUSY searches in CMS with the 8 TeV data, collected in 2012. We focus on inclusive and exclusive searches for third generation squarks, produced directly or in gluino cascades, in final states with or without leptons. We also present searches for direct production of charginos and neutralinos, as well as dedicated searches for GMSB SUSY in final states with photons.

Event-driven processing for hardware-efficient neural spike sorting

Science.gov (United States)

Liu, Yan; Pereira, João L.; Constandinou, Timothy G.

2018-02-01

Objective. The prospect of real-time and on-node spike sorting provides a genuine opportunity to push the envelope of large-scale integrated neural recording systems. In such systems the hardware resources, power requirements and data bandwidth increase linearly with channel count. Event-based (or data-driven) processing can provide here a new efficient means for hardware implementation that is completely activity dependant. In this work, we investigate using continuous-time level-crossing sampling for efficient data representation and subsequent spike processing. Approach. (1) We first compare signals (synthetic neural datasets) encoded with this technique against conventional sampling. (2) We then show how such a representation can be directly exploited by extracting simple time domain features from the bitstream to perform neural spike sorting. (3) The proposed method is implemented in a low power FPGA platform to demonstrate its hardware viability. Main results. It is observed that considerably lower data rates are achievable when using 7 bits or less to represent the signals, whilst maintaining the signal fidelity. Results obtained using both MATLAB and reconfigurable logic hardware (FPGA) indicate that feature extraction and spike sorting accuracies can be achieved with comparable or better accuracy than reference methods whilst also requiring relatively low hardware resources. Significance. By effectively exploiting continuous-time data representation, neural signal processing can be achieved in a completely event-driven manner, reducing both the required resources (memory, complexity) and computations (operations). This will see future large-scale neural systems integrating on-node processing in real-time hardware.

Continuous sorting of Brownian particles using coupled photophoresis and asymmetric potential cycling.

Science.gov (United States)

Ng, Tuck Wah; Neild, Adrian; Heeraman, Pascal

2008-03-15

Feasible sorters need to function rapidly and permit the input and delivery of particles continuously. Here, we describe a scheme that incorporates (i) restricted spatial input location and (ii) orthogonal sort and movement direction features. Sorting is achieved using an asymmetric potential that is cycled on and off, whereas movement is accomplished using photophoresis. Simulations with 0.2 and 0.5 microm diameter spherical particles indicate that sorting can commence quickly from a continuous stream. Procedures to optimize the sorting scheme are also described.

Det sorte USA

DEFF Research Database (Denmark)

Brøndal, Jørn

Bogen gennemgår det sorte USAs historie fra 1776 til 2016, idet grundtemaet er spændingsforholdet mellem USAs grundlæggelsesidealer og den racemæssige praksis, et spændingsforhold som Gunnar Myrdal kaldte "det amerikanske dilemma." Bogen, der er opbygget som politisk, social og racemæssig histori......, er opdelt i 13 kapitler og består af fire dele: Første del: Slaveriet; anden del: Jim Crow; tredje del. King-årene; fjerde del: Frem mod Obama....

Effects of Added Enzymes on Sorted, Unsorted and Sorted-Out Barley: A Model Study on Realtime Viscosity and Process Potentials Using Rapid Visco Analyser

DEFF Research Database (Denmark)

Shetty, Radhakrishna; Zhuang, Shiwen; Olsen, Rasmus Lyngsø

2017-01-01

Barley sorting is an important step for selecting grain of required quality for malting prior to brewing. However, brewing with unmalted barley with added enzymes has been thoroughly proven, raising the question of whether traditional sorting for high quality malting-barley is still necessary. To...

Noise-robust unsupervised spike sorting based on discriminative subspace learning with outlier handling.

Science.gov (United States)

Keshtkaran, Mohammad Reza; Yang, Zhi

2017-06-01

Spike sorting is a fundamental preprocessing step for many neuroscience studies which rely on the analysis of spike trains. Most of the feature extraction and dimensionality reduction techniques that have been used for spike sorting give a projection subspace which is not necessarily the most discriminative one. Therefore, the clusters which appear inherently separable in some discriminative subspace may overlap if projected using conventional feature extraction approaches leading to a poor sorting accuracy especially when the noise level is high. In this paper, we propose a noise-robust and unsupervised spike sorting algorithm based on learning discriminative spike features for clustering. The proposed algorithm uses discriminative subspace learning to extract low dimensional and most discriminative features from the spike waveforms and perform clustering with automatic detection of the number of the clusters. The core part of the algorithm involves iterative subspace selection using linear discriminant analysis and clustering using Gaussian mixture model with outlier detection. A statistical test in the discriminative subspace is proposed to automatically detect the number of the clusters. Comparative results on publicly available simulated and real in vivo datasets demonstrate that our algorithm achieves substantially improved cluster distinction leading to higher sorting accuracy and more reliable detection of clusters which are highly overlapping and not detectable using conventional feature extraction techniques such as principal component analysis or wavelets. By providing more accurate information about the activity of more number of individual neurons with high robustness to neural noise and outliers, the proposed unsupervised spike sorting algorithm facilitates more detailed and accurate analysis of single- and multi-unit activities in neuroscience and brain machine interface studies.

Effect of early exposure to different feed presentations on feed sorting of dairy calves.

Science.gov (United States)

Miller-Cushon, E K; Bergeron, R; Leslie, K E; Mason, G J; Devries, T J

2013-07-01

This study examined how early exposure to different feed presentations affects development of feed sorting in dairy calves. Twenty Holstein bull calves were exposed for the first 8 wk of life to 1 of 2 feed presentation treatments: concentrate and chopped grass hay (haylage, 21.5% high-moisture corn, and 16.0% protein supplement) in wk 12 to 13. Intake was recorded daily and calves were weighed twice a week. Fresh feed and orts were sampled on d 1 to 4 of wk 6, 8, 9, 11, 12, and 13 for analysis of feed sorting, which was assessed through nutrient analysis for the MIX diet and particle size analysis for the TMR. The particle separator had 3 screens (19, 8, and 1.18mm) producing long, medium, short, and fine particle fractions. Sorting of nutrients or particle fractions was calculated as the actual intake as a percentage of predicted intake; values >100% indicate sorting for, whereas values <100% indicate sorting against. Feed presentation did not affect dry matter intake or growth. Prior to weaning, all calves selected in favor of hay; MIX calves consumed more neutral detergent fiber (NDF) than predicted (103.6%) and less nonfiber carbohydrates (NFC) than predicted (92.6%), and COM calves consumed, as a percentage of dry matter intake, 40.3% hay (vs. 30% offered rate). In wk 8, calves fed COM consumed more NFC than calves fed MIX (1.0 vs. 0.95kg/d) and less NDF (0.43 vs. 0.54kg/d), indicating greater selection in favor of concentrate. However, when provided the MIX diet, calves previously fed COM did not sort, whereas calves previously fed MIX consumed more NFC intake than predicted (103.2%) and less NDF intake than predicted (97.6%). Calves previously fed MIX maintained increased sorting after transition to the novel TMR, sorting against long particles (86.5%) and for short (101.8%) and fine (101.2%) particles. These results indicate that initially providing dairy calves with solid feeds as separate components, compared with as a mixed ration, reduces the extent of

Review of Physics Results from the Tevatron: Searches for New Particles and Interactions

Energy Technology Data Exchange (ETDEWEB)

Toback, David [Texas A-M; ŽIvković, Lidija [Belgrade U.

2015-02-17

We present a summary of results for searches for new particles and interactions at the Fermilab Tevatron collider by the CDF and the D0 experiments. These include results from Run I as well as Run II for the time period up to July 2014. We focus on searches for supersymmetry, as well as other models of new physics such as new fermions and bosons, various models of excited fermions, leptoquarks, technicolor, hidden-valley model particles, long-lived particles, extra dimensions, dark matter particles, and signature-based searches.

Genetic surfing, not allopatric divergence, explains spatial sorting of mitochondrial haplotypes in venomous coralsnakes.

Science.gov (United States)

Streicher, Jeffrey W; McEntee, Jay P; Drzich, Laura C; Card, Daren C; Schield, Drew R; Smart, Utpal; Parkinson, Christopher L; Jezkova, Tereza; Smith, Eric N; Castoe, Todd A

2016-07-01

Strong spatial sorting of genetic variation in contiguous populations is often explained by local adaptation or secondary contact following allopatric divergence. A third explanation, spatial sorting by stochastic effects of range expansion, has been considered less often though theoretical models suggest it should be widespread, if ephemeral. In a study designed to delimit species within a clade of venomous coralsnakes, we identified an unusual pattern within the Texas coral snake (Micrurus tener): strong spatial sorting of divergent mitochondrial (mtDNA) lineages over a portion of its range, but weak sorting of these lineages elsewhere. We tested three alternative hypotheses to explain this pattern-local adaptation, secondary contact following allopatric divergence, and range expansion. Collectively, near panmixia of nuclear DNA, the signal of range expansion associated sampling drift, expansion origins in the Gulf Coast of Mexico, and species distribution modeling suggest that the spatial sorting of divergent mtDNA lineages within M. tener has resulted from genetic surfing of standing mtDNA variation-not local adaptation or allopatric divergence. Our findings highlight the potential for the stochastic effects of recent range expansion to mislead estimations of population divergence made from mtDNA, which may be exacerbated in systems with low vagility, ancestral mtDNA polymorphism, and male-biased dispersal. © 2016 The Author(s).

Search for muonium to antimuonium conversion: Overview and recent experimental results

International Nuclear Information System (INIS)

Reiner Schaefer, H.

1988-01-01

The motivation for an experimental search for muonium to antimuonium conversion is briefly discussed. Results of measurements on limits for the strength of the coupling constant involved in this interaction are summarized with emphasis on the recently completed search, LAMPF E985. Plans are presented for an upcoming next generation experiment, LAMF E1073, which aims at an improvement in the sensitivity by more than two orders of magnitude

Learning to merge search results for efficient Distributed Information Retrieval

NARCIS (Netherlands)

Tjin-Kam-Jet, Kien; Hiemstra, Djoerd

2010-01-01

Merging search results from different servers is a major problem in Distributed Information Retrieval. We used Regression-SVM and Ranking-SVM which would learn a function that merges results based on information that is readily available: i.e. the ranks, titles, summaries and URLs contained in the

The kSORT assay to detect renal transplant patients at high risk for acute rejection: results of the multicenter AART study.

Directory of Open Access Journals (Sweden)

Silke Roedder

2014-11-01

Full Text Available Development of noninvasive molecular assays to improve disease diagnosis and patient monitoring is a critical need. In renal transplantation, acute rejection (AR increases the risk for chronic graft injury and failure. Noninvasive diagnostic assays to improve current late and nonspecific diagnosis of rejection are needed. We sought to develop a test using a simple blood gene expression assay to detect patients at high risk for AR.We developed a novel correlation-based algorithm by step-wise analysis of gene expression data in 558 blood samples from 436 renal transplant patients collected across eight transplant centers in the US, Mexico, and Spain between 5 February 2005 and 15 December 2012 in the Assessment of Acute Rejection in Renal Transplantation (AART study. Gene expression was assessed by quantitative real-time PCR (QPCR in one center. A 17-gene set--the Kidney Solid Organ Response Test (kSORT--was selected in 143 samples for AR classification using discriminant analysis (area under the receiver operating characteristic curve [AUC] = 0.94; 95% CI 0.91-0.98, validated in 124 independent samples (AUC = 0.95; 95% CI 0.88-1.0 and evaluated for AR prediction in 191 serial samples, where it predicted AR up to 3 mo prior to detection by the current gold standard (biopsy. A novel reference-based algorithm (using 13 12-gene models was developed in 100 independent samples to provide a numerical AR risk score, to classify patients as high risk versus low risk for AR. kSORT was able to detect AR in blood independent of age, time post-transplantation, and sample source without additional data normalization; AUC = 0.93 (95% CI 0.86-0.99. Further validation of kSORT is planned in prospective clinical observational and interventional trials.The kSORT blood QPCR assay is a noninvasive tool to detect high risk of AR of renal transplants. Please see later in the article for the Editors' Summary.

Decision trees with minimum average depth for sorting eight elements

KAUST Repository

AbouEisha, Hassan M.; Chikalov, Igor; Moshkov, Mikhail

2015-01-01

We prove that the minimum average depth of a decision tree for sorting 8 pairwise different elements is equal to 620160/8!. We show also that each decision tree for sorting 8 elements, which has minimum average depth (the number of such trees

The role of waste sorting in the South African gold-mining industry

International Nuclear Information System (INIS)

Freer, J.S.; Boehme, R.C.

1985-01-01

The absolute potential for sorting waste from run-of-mine Witwatersrand gold ores normally lies between 60 and 90 per cent by mass. At present, the practical potential lies between 40 and 50 per cent. Yet few mines achieve a waste rejection of even 30 per cent. The average waste rejection for industry, including underground sorting, fell from 19,6 per cent in 1959 to 10,1 per cent in 1983, as industry moved from labour-intensive, multistage comminution, incorporating washing, screening, and sorting, to single-stage run-of-mine milling. Most of the sorting is still being done by hand; yet photometric and radiometric sorting machines of high capacity are available. More recently, a sorter based on neutron activation and the subsequent isomeric radioactive decay of gold itself was designed. This paper examines the case for an increased role for sorting in the South African gold-mining industry brought about by the increasing cost of power for milling and the possibility of extracting gold from low-grade reject fractions by heap leaching

The economic benefits of sorting SPF lumber to be kiln-dried on the basis of initial moisture content

International Nuclear Information System (INIS)

Warren, S.; Johnson, G.

1997-01-01

This study evaluates the economic benefits of sorting green lumber into moisture content classes before kiln-drying. Laser moisture sensing technology was implemented in the sawmill for sorting purposes. The grade outturn and energy savings resulting from shortened drying times were examined. The final moisture content distribution resulting from moisture sorting did not show overdrying or underdrying. Based on grade outturn, the benefits were as much as $15.94 per thousand board feet (MBF) for 2 by 4 by 16 lumber and $19.66 per MBF for 2 by 6 by 16 lumber; energy savings were $1.88 per thousand board feet

Learning banknote fitness for sorting

NARCIS (Netherlands)

Geusebroek, J.M.; Markus, P.; Balke, P.

2011-01-01

In this work, a machine learning method is proposed for banknote soiling determination. We apply proven techniques from computer vision to come up with a robust and effective method for automatic sorting of banknotes. The proposed method is evaluated with respect to various invariance classes. The

New Architectures for Presenting Search Results Based on Web Search Engines Users Experience

Science.gov (United States)

Martinez, F. J.; Pastor, J. A.; Rodriguez, J. V.; Lopez, Rosana; Rodriguez, J. V., Jr.

2011-01-01

Introduction: The Internet is a dynamic environment which is continuously being updated. Search engines have been, currently are and in all probability will continue to be the most popular systems in this information cosmos. Method: In this work, special attention has been paid to the series of changes made to search engines up to this point,…

Answers to Health Questions: Internet Search Results Versus Online Health Community Responses.

Science.gov (United States)

Kanthawala, Shaheen; Vermeesch, Amber; Given, Barbara; Huh, Jina

2016-04-28

About 6 million people search for health information on the Internet each day in the United States. Both patients and caregivers search for information about prescribed courses of treatments, unanswered questions after a visit to their providers, or diet and exercise regimens. Past literature has indicated potential challenges around quality in health information available on the Internet. However, diverse information exists on the Internet-ranging from government-initiated webpages to personal blog pages. Yet we do not fully understand the strengths and weaknesses of different types of information available on the Internet. The objective of this research was to investigate the strengths and challenges of various types of health information available online and to suggest what information sources best fit various question types. We collected questions posted to and the responses they received from an online diabetes community and classified them according to Rothwell's classification of question types (fact, policy, or value questions). We selected 60 questions (20 each of fact, policy, and value) and the replies the questions received from the community. We then searched for responses to the same questions using a search engine and recorded the Community responses answered more questions than did search results overall. Search results were most effective in answering value questions and least effective in answering policy questions. Community responses answered questions across question types at an equivalent rate, but most answered policy questions and the least answered fact questions. Value questions were most answered by community responses, but some of these answers provided by the community were incorrect. Fact question search results were the most clinically valid. The Internet is a prevalent source of health information for people. The information quality people encounter online can have a large impact on them. We present what kinds of questions people ask

Sorting fluorescent nanocrystals with DNA

Energy Technology Data Exchange (ETDEWEB)

Gerion, Daniele; Parak, Wolfgang J.; Williams, Shara C.; Zanchet, Daniela; Micheel, Christine M.; Alivisatos, A. Paul

2001-12-10

Semiconductor nanocrystals with narrow and tunable fluorescence are covalently linked to oligonucleotides. These biocompounds retain the properties of both nanocrystals and DNA. Therefore, different sequences of DNA can be coded with nanocrystals and still preserve their ability to hybridize to their complements. We report the case where four different sequences of DNA are linked to four nanocrystal samples having different colors of emission in the range of 530-640 nm. When the DNA-nanocrystal conjugates are mixed together, it is possible to sort each type of nanoparticle using hybridization on a defined micrometer -size surface containing the complementary oligonucleotide. Detection of sorting requires only a single excitation source and an epifluorescence microscope. The possibility of directing fluorescent nanocrystals towards specific biological targets and detecting them, combined with their superior photo-stability compared to organic dyes, opens the way to improved biolabeling experiments, such as gene mapping on a nanometer scale or multicolor microarray analysis.

Volume reduction of dry active waste by use of a waste sorting table at the Brunswick nuclear power plant

International Nuclear Information System (INIS)

Snead, P.B.

1988-01-01

Carolina Power and Light Company's Brunswick nuclear power plant has been using a National Nuclear Corporation Model WST-18 Waste Sorting Table to monitor and sort dry active waste for segregating uncontaminated material as a means of low-level waste volume reduction. The WST-18 features 18 large-area, solid scintillation detectors arranged in a 3 x 6 array underneath a sorting/monitoring surface that is shielded from background radiation. An 11-week study at Brunswick showed that the use of the waste sorting table resulted in dramatic improvements in both productivity (man-hours expended per cubic foot of waste processed) and monitoring quality over the previous hand-probe frisking method. Use of the sorting table since the study has confirmed its effectiveness in volume reduction. The waste sorting table paid for its operation in volume reduction savings alone, without accounting for the additional savings from recovering reusable items

NEWordS A News Search Engine for English Vocabulary Learning

Directory of Open Access Journals (Sweden)

Xuejing Huang

2015-08-01

Full Text Available Vocabulary is the first hurdle for English learners to over- come. Instead of simply showing a word again and again we come up with an idea to develop an English news article search engine based on users word-reciting record on Shanbay.com. It is designed for advanced English learners to find suitable reading materials. The search engine consists of Crawling Module Document Normalizing module Indexing Module Querying Module and Interface Module. We propose three sorting amp ranking algorithms for Querying Module. For the basic algorithm five crucial principles are taken into consideration. Term frequency inverse document frequency familiarity degree and article freshness degree are factors in this algorithm. Then we think of a improved algorithm for the scene in which a user read multiple articles in the searching result list. Here we adopt a iterative amp greedy method. The essential idea is to select English news articles one by one according to the query meanwhile dynamically update the unfamiliarity of the words during each iterative step. Moreover we develop an advanced algorithm to take article difficulty in to account. Interface Module is designed as a website meanwhile some data visualization technologies e.g. word cloud are applied here. Furthermore we conduct both applicability check and performance evaluation. Metrics such as searching time word-covering ratio and minimum number of articles that completely cover all the queried vocabulary are randomly sampled and profoundly analyzed. The result shows that our search engine works very well with satisfying performance.

Sorting genomes by reciprocal translocations, insertions, and deletions.

Science.gov (United States)

Qi, Xingqin; Li, Guojun; Li, Shuguang; Xu, Ying

2010-01-01

The problem of sorting by reciprocal translocations (abbreviated as SBT) arises from the field of comparative genomics, which is to find a shortest sequence of reciprocal translocations that transforms one genome Pi into another genome Gamma, with the restriction that Pi and Gamma contain the same genes. SBT has been proved to be polynomial-time solvable, and several polynomial algorithms have been developed. In this paper, we show how to extend Bergeron's SBT algorithm to include insertions and deletions, allowing to compare genomes containing different genes. In particular, if the gene set of Pi is a subset (or superset, respectively) of the gene set of Gamma, we present an approximation algorithm for transforming Pi into Gamma by reciprocal translocations and deletions (insertions, respectively), providing a sorting sequence with length at most OPT + 2, where OPT is the minimum number of translocations and deletions (insertions, respectively) needed to transform Pi into Gamma; if Pi and Gamma have different genes but not containing each other, we give a heuristic to transform Pi into Gamma by a shortest sequence of reciprocal translocations, insertions, and deletions, with bounds for the length of the sorting sequence it outputs. At a conceptual level, there is some similarity between our algorithm and the algorithm developed by El Mabrouk which is used to sort two chromosomes with different gene contents by reversals, insertions, and deletions.

Design of monitoring system for mail-sorting based on the Profibus S7 series PLC

Science.gov (United States)

Zhang, W.; Jia, S. H.; Wang, Y. H.; Liu, H.; Tang, G. C.

2017-01-01

With the rapid development of the postal express, the workload of mail sorting is increasing, but the automatic technology of mail sorting is not mature enough. In view of this, the system uses Siemens S7-300 PLC as the main station controller, PLC of Siemens S7-200/400 is from the station controller, through the man-machine interface configuration software MCGS, PROFIBUS-DP communication, RFID technology and mechanical sorting hand achieve mail classification sorting monitoring. Among them, distinguish mail-sorting by scanning RFID posted in the mail electronic bar code (fixed code), the system uses the corresponding controller on the acquisition of information processing, the processed information transmit to the sorting manipulator by PROFIBUS-DP. The system can realize accurate and efficient mail sorting, which will promote the development of mail sorting technology.

A methodical approach for the assessment of waste sorting plants

NARCIS (Netherlands)

Feil, Alexander; Pretz, Thomas; Vitz, Philipp; Thoden van Velzen, Ulphard

2017-01-01

A techno-economical evaluation of the processing result of waste sorting plants should at least provide a realistic assessment of the recovery yields of valuable materials and of the qualities of the obtained products. This practical data is generated by weighing all the output products and

Pareto Optimization of a Half Car Passive Suspension Model Using a Novel Multiobjective Heat Transfer Search Algorithm

Directory of Open Access Journals (Sweden)

Vimal Savsani

2017-01-01

Full Text Available Most of the modern multiobjective optimization algorithms are based on the search technique of genetic algorithms; however the search techniques of other recently developed metaheuristics are emerging topics among researchers. This paper proposes a novel multiobjective optimization algorithm named multiobjective heat transfer search (MOHTS algorithm, which is based on the search technique of heat transfer search (HTS algorithm. MOHTS employs the elitist nondominated sorting and crowding distance approach of an elitist based nondominated sorting genetic algorithm-II (NSGA-II for obtaining different nondomination levels and to preserve the diversity among the optimal set of solutions, respectively. The capability in yielding a Pareto front as close as possible to the true Pareto front of MOHTS has been tested on the multiobjective optimization problem of the vehicle suspension design, which has a set of five second-order linear ordinary differential equations. Half car passive ride model with two different sets of five objectives is employed for optimizing the suspension parameters using MOHTS and NSGA-II. The optimization studies demonstrate that MOHTS achieves the better nondominated Pareto front with the widespread (diveresed set of optimal solutions as compared to NSGA-II, and further the comparison of the extreme points of the obtained Pareto front reveals the dominance of MOHTS over NSGA-II, multiobjective uniform diversity genetic algorithm (MUGA, and combined PSO-GA based MOEA.

Magnetic fluid equipment for sorting of secondary polyolefins from waste

NARCIS (Netherlands)

Rem, P.C.; Di Maio, F.; Hu, B.; Houzeaux, G.; Baltes, L.; Tierean, M.

2012-01-01

The paper presents the researches made on the FP7 project „Magnetic Sorting and Ultrasound Sensor Technologies for Production of High Purity Secondary Polyolefins from Waste” in order to develop a magnetic fluid equipment for sorting of polypropylene (PP) and polyethylene (PE) from polymers mixed

ALGORITHM OF CARDIO COMPLEX DETECTION AND SORTING FOR PROCESSING THE DATA OF CONTINUOUS CARDIO SIGNAL MONITORING.

Science.gov (United States)

Krasichkov, A S; Grigoriev, E B; Nifontov, E M; Shapovalov, V V

The paper presents an algorithm of cardio complex classification as part of processing the data of continuous cardiac monitoring. R-wave detection concurrently with cardio complex sorting is discussed. The core of this approach is the use of prior information about. cardio complex forms, segmental structure, and degree of kindness. Results of the sorting algorithm testing are provided.

Short communication: Feed sorting of dairy heifers is influenced by method of dietary transition.

Science.gov (United States)

Miller-Cushon, E K; Vogel, J P; DeVries, T J

2015-04-01

This study investigated the effect of exposing heifers to individual feed components on the extent and pattern of feed sorting upon transition to a novel ration. Holstein heifers (394 ± 62 d old, weighing 409.8 ± 37.3 kg; mean ± SD), consuming a familiar mixed silage-based ration [55% corn silage and 45% haylage, dry matter (DM) basis], were transitioned to a novel total mixed ration [TMR; 41.6% haylage, 36.5% corn silage, 14.6% high-moisture corn, and 7.3% protein supplement, DM basis] by 1 of 2 treatments: direct transition to novel TMR (DIR; n = 5) or exposure to novel TMR components individually before receiving novel TMR (COM; n = 6). During the baseline period (d 1 to 4), all heifers were offered the familiar silage-based ration. During transition (d 5 to 12), DIR heifers received the novel TMR, whereas COM heifers received the novel TMR components offered separately, in amounts according to TMR composition (target 15% orts). After transition (d 13 to 20), all heifers received the novel TMR. Feed intake and feeding time were determined daily and fresh feed and individual orts were sampled every 2d for particle size analysis and neutral detergent fiber content. The particle size separator consisted of 3 screens (18, 9, and 1.18 mm) and a bottom pan, resulting in 4 fractions (long, medium, short, and fine). Sorting activity for each fraction was calculated as actual intake expressed as a percentage of predicted intake. We detected no effect of treatment on dry matter intake or feeding time. After transition to the novel TMR, COM heifers sorted to a greater extent than did DIR heifers, sorting against long particles (95.4 vs. 98.9%) and for short particles (101.7 vs. 100.6%). Differences in sorting patterns resulted in COM heifers tending to have lower neutral detergent fiber intake as a percentage of predicted intake (98.9 vs. 100.5%). The results of this study suggest that the degree of feed sorting may be influenced by method of transition to a novel

Protein Sorting Prediction

DEFF Research Database (Denmark)

Nielsen, Henrik

2017-01-01

and drawbacks of each of these approaches is described through many examples of methods that predict secretion, integration into membranes, or subcellular locations in general. The aim of this chapter is to provide a user-level introduction to the field with a minimum of computational theory.......Many computational methods are available for predicting protein sorting in bacteria. When comparing them, it is important to know that they can be grouped into three fundamentally different approaches: signal-based, global-property-based and homology-based prediction. In this chapter, the strengths...

Bidirectional sorting of flocking particles in the presence of asymmetric barriers.

Science.gov (United States)

Drocco, Jeffrey A; Olson Reichhardt, C J; Reichhardt, C

2012-05-01

We demonstrate numerically bidirectional sorting of flocking particles interacting with an array of V-shaped asymmetric barriers. Each particle aligns with the average swimming direction of its neighbors according to the Vicsek model and experiences additional steric interactions as well as repulsion from the fixed barriers. We show that particles preferentially localize to one side of the barrier array over time and that the direction of this rectification can be reversed by adjusting the particle-particle exclusion radius or the noise term in the equations of motion. These results provide a conceptual basis for isolation and sorting of single-cell and multicellular organisms that move collectively according to flocking-type interaction rules.

Sort-Mid tasks scheduling algorithm in grid computing.

Science.gov (United States)

Reda, Naglaa M; Tawfik, A; Marzok, Mohamed A; Khamis, Soheir M

2015-11-01

Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

Anti-Hermitian photodetector facilitating efficient subwavelength photon sorting.

Science.gov (United States)

Kim, Soo Jin; Kang, Ju-Hyung; Mutlu, Mehmet; Park, Joonsuk; Park, Woosung; Goodson, Kenneth E; Sinclair, Robert; Fan, Shanhui; Kik, Pieter G; Brongersma, Mark L

2018-01-22

The ability to split an incident light beam into separate wavelength bands is central to a diverse set of optical applications, including imaging, biosensing, communication, photocatalysis, and photovoltaics. Entirely new opportunities are currently emerging with the recently demonstrated possibility to spectrally split light at a subwavelength scale with optical antennas. Unfortunately, such small structures offer limited spectral control and are hard to exploit in optoelectronic devices. Here, we overcome both challenges and demonstrate how within a single-layer metafilm one can laterally sort photons of different wavelengths below the free-space diffraction limit and extract a useful photocurrent. This chipscale demonstration of anti-Hermitian coupling between resonant photodetector elements also facilitates near-unity photon-sorting efficiencies, near-unity absorption, and a narrow spectral response (∼ 30 nm) for the different wavelength channels. This work opens up entirely new design paradigms for image sensors and energy harvesting systems in which the active elements both sort and detect photons.

Particle migration and sorting in microbubble streaming flows

Science.gov (United States)

Thameem, Raqeeb; Hilgenfeldt, Sascha

2016-01-01

Ultrasonic driving of semicylindrical microbubbles generates strong streaming flows that are robust over a wide range of driving frequencies. We show that in microchannels, these streaming flow patterns can be combined with Poiseuille flows to achieve two distinctive, highly tunable methods for size-sensitive sorting and trapping of particles much smaller than the bubble itself. This method allows higher throughput than typical passive sorting techniques, since it does not require the inclusion of device features on the order of the particle size. We propose a simple mechanism, based on channel and flow geometry, which reliably describes and predicts the sorting behavior observed in experiment. It is also shown that an asymptotic theory that incorporates the device geometry and superimposed channel flow accurately models key flow features such as peak speeds and particle trajectories, provided it is appropriately modified to account for 3D effects caused by the axial confinement of the bubble. PMID:26958103

Efficient sorting using registers and caches

DEFF Research Database (Denmark)

Wickremesinghe, Rajiv; Arge, Lars Allan; Chase, Jeffrey S.

2002-01-01

. Inadequate models lead to poor algorithmic choices and an incomplete understanding of algorithm behavior on real machines.A key step toward developing better models is to quantify the performance effects of features not reflected in the models. This paper explores the effect of memory system features...... on sorting performance. We introduce a new cache-conscious sorting algorithm, R-MERGE, which achieves better performance in practice over algorithms that are superior in the theoretical models. R-MERGE is designed to minimize memory stall cycles rather than cache misses by considering features common to many......Modern computer systems have increasingly complex memory systems. Common machine models for algorithm analysis do not reflect many of the features of these systems, e.g., large register sets, lockup-free caches, cache hierarchies, associativity, cache line fetching, and streaming behavior...

Size-based cell sorting with a resistive pulse sensor and an electromagnetic pump in a microfluidic chip.

Science.gov (United States)

Song, Yongxin; Li, Mengqi; Pan, Xinxiang; Wang, Qi; Li, Dongqing

2015-02-01

An electrokinetic microfluidic chip is developed to detect and sort target cells by size from human blood samples. Target-cell detection is achieved by a differential resistive pulse sensor (RPS) based on the size difference between the target cell and other cells. Once a target cell is detected, the detected RPS signal will automatically actuate an electromagnetic pump built in a microchannel to push the target cell into a collecting channel. This method was applied to automatically detect and sort A549 cells and T-lymphocytes from a peripheral fingertip blood sample. The viability of A549 cells sorted in the collecting well was verified by Hoechst33342 and propidium iodide staining. The results show that as many as 100 target cells per minute can be sorted out from the sample solution and thus is particularly suitable for sorting very rare target cells, such as circulating tumor cells. The actuation of the electromagnetic valve has no influence on RPS cell detection and the consequent cell-sorting process. The viability of the collected A549 cell is not impacted by the applied electric field when the cell passes the RPS detection area. The device described in this article is simple, automatic, and label-free and has wide applications in size-based rare target cell sorting for medical diagnostics. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A degradation-based sorting method for lithium-ion battery reuse.

Directory of Open Access Journals (Sweden)

Hao Chen

Full Text Available In a world where millions of people are dependent on batteries to provide them with convenient and portable energy, battery recycling is of the utmost importance. In this paper, we developed a new method to sort 18650 Lithium-ion batteries in large quantities and in real time for harvesting used cells with enough capacity for battery reuse. Internal resistance and capacity tests were conducted as a basis for comparison with a novel degradation-based method based on X-ray radiographic scanning and digital image contrast computation. The test results indicate that the sorting accuracy of the test cells is about 79% and the execution time of our algorithm is at a level of 200 milliseconds, making our method a potential real-time solution for reusing the remaining capacity in good used cells.

Below Regulatory Concern Owners Group: An evaluation of dry active waste sorting: Final report

International Nuclear Information System (INIS)

Casey, S.M.

1989-02-01

The objective of this research was to determine the accuracy of manual inspection of Dry Active Waste (DAW). Three studies were conducted at two nuclear power plants in which unmodified DAW waste streams of roughly 10,000 items each were inspected by technicians using pancake probes. Sorting performance was measured unobtrusively by intercepting the ''outflow'' from inspection stations. Verification of sorting accuracy was performed with a prototype, semi-automated sorting table employing a matrix of fixed plastic scintillation detectors. More than 30,000 items of trash were examined, classified, counted, and verified, and the composition of the ''inflow'' to the inspection stations was determined by reconstructing the ''outflow'' components, as determined during verification procedures. The results showed that between 1 and 19% of all items in each of the three DAW waste streams were contaminated at levels ≥100 ccpm. Sixty-two percent of the ''contaminated'' items in Study I, 87% of the contaminated items in Study II, and 97% of the contaminated items in Study III were detected. One-half to one percent of all items classified as <100 ccpm by technicians were actually ≥100 ccpm. False positive rates were very high in all three studies. The production rates and accuracy obtained on the semi-automated plastic scintillation sorting table used during the verification stages of this project greatly exceeded the rates for manual sorting. 9 figs., 13 tabs

Dynamic colloidal sorting on a magnetic bubble lattice

Science.gov (United States)

Tierno, Pietro; Soba, Alejandro; Johansen, Tom H.; Sagués, Francesc

2008-11-01

We use a uniaxial garnet film with a magnetic bubble lattice to sort paramagnetic colloidal particles with different diameters, i.e., 1.0 and 2.8μm. We apply an external magnetic field which precesses around an axis normal to the film with a frequency Ω =62.8s-1 and intensity 3120A/m bubbles while the others are transported through the array. We complement the experimental measurements with numerical simulations to explore the sorting capability for particles with different magnetic moments.

Pre-accretional sorting of grains in the outer solar nebula

International Nuclear Information System (INIS)

Wozniakiewicz, P. J.; Bradley, J. P.; Ishii, H. A.; Price, M. C.; Brownlee, D. E.

2013-01-01

Despite their micrometer-scale dimensions and nanogram masses, chondritic porous interplanetary dust particles (CP IDPs) are an important class of extraterrestrial material since their properties are consistent with a cometary origin and they show no evidence of significant post-accretional parent body alteration. Consequently, they can provide information about grain accretion in the comet-forming region of the outer solar nebula. We have previously reported our comparative study of the sizes and size distributions of crystalline silicate and sulfide grains in CP IDPs, in which we found these components exhibit a size-density relationship consistent with having been sorted together prior to accretion. Here we extend our data set and include GEMS (glass with embedded metal and sulfide), the most abundant amorphous silicate phase observed in CP IDPs. We find that while the silicate and sulfide sorting trend previously observed is maintained, the GEMS size data do not exhibit any clear relationship to these crystalline components. Therefore, GEMS do not appear to have been sorted with the silicate and sulfide crystals. The disparate sorting trends observed in GEMS and the crystalline grains in CP IDPs present an interesting challenge for modeling early transport and accretion processes. They may indicate that several sorting mechanisms operated on these CP IDP components, or alternatively, they may simply be a reflection of different source environments.

Optical cell sorting with multiple imaging modalities

DEFF Research Database (Denmark)

Banas, Andrew; Carrissemoux, Caro; Palima, Darwin

2017-01-01

healthy cells. With the richness of visual information, a lot of microscopy techniques have been developed and have been crucial in biological studies. To utilize their complementary advantages we adopt both fluorescence and brightfield imaging in our optical cell sorter. Brightfield imaging has...... the advantage of being non-invasive, thus maintaining cell viability. Fluorescence imaging, on the other hand, takes advantages of the chemical specificity of fluorescence markers and can validate machine vision results from brightfield images. Visually identified cells are sorted using optical manipulation...

An algorithm for 4D CT image sorting using spatial continuity.

Science.gov (United States)

Li, Chen; Liu, Jie

2013-01-01

4D CT, which could locate the position of the movement of the tumor in the entire respiratory cycle and reduce image artifacts effectively, has been widely used in making radiation therapy of tumors. The current 4D CT methods required external surrogates of respiratory motion obtained from extra instruments. However, respiratory signals recorded by these external makers may not always accurately represent the internal tumor and organ movements, especially when irregular breathing patterns happened. In this paper we have proposed a novel automatic 4D CT sorting algorithm that performs without these external surrogates. The sorting algorithm requires collecting the image data with a cine scan protocol. Beginning with the first couch position, images from the adjacent couch position are selected out according to spatial continuity. The process is continued until images from all couch positions are sorted and the entire 3D volume is produced. The algorithm is verified by respiratory phantom image data and clinical image data. The primary test results show that the 4D CT images created by our algorithm have eliminated the motion artifacts effectively and clearly demonstrated the movement of tumor and organ in the breath period.

How many neurons can we see with current spike sorting algorithms?

Science.gov (United States)

Pedreira, Carlos; Martinez, Juan; Ison, Matias J; Quian Quiroga, Rodrigo

2012-10-15

Recent studies highlighted the disagreement between the typical number of neurons observed with extracellular recordings and the ones to be expected based on anatomical and physiological considerations. This disagreement has been mainly attributed to the presence of sparsely firing neurons. However, it is also possible that this is due to limitations of the spike sorting algorithms used to process the data. To address this issue, we used realistic simulations of extracellular recordings and found a relatively poor spike sorting performance for simulations containing a large number of neurons. In fact, the number of correctly identified neurons for single-channel recordings showed an asymptotic behavior saturating at about 8-10 units, when up to 20 units were present in the data. This performance was significantly poorer for neurons with low firing rates, as these units were twice more likely to be missed than the ones with high firing rates in simulations containing many neurons. These results uncover one of the main reasons for the relatively low number of neurons found in extracellular recording and also stress the importance of further developments of spike sorting algorithms. Copyright © 2012 Elsevier B.V. All rights reserved.

Automatic Color Sorting System for Hardwood Edge-Glued Panel Parts

Science.gov (United States)

Richard W. Conners; D.Earl Kline; Philip A. Araman

1996-01-01

The color sorting of edge-glued panel parts is becoming more important in the manufacture of hardwood products. Consumers, while admiring the natural appearance of hardwoods, do not like excessive color variation across product surfaces. Color uniformity is particularly important today because of the popularity of lightly stained products. Unfortunately, color sorting...

Comparative environmental evaluation of construction waste management through different waste sorting systems in Hong Kong.

Science.gov (United States)

Hossain, Md Uzzal; Wu, Zezhou; Poon, Chi Sun

2017-11-01

This study aimed to compare the environmental performance of building construction waste management (CWM) systems in Hong Kong. Life cycle assessment (LCA) approach was applied to evaluate the performance of CWM systems holistically based on primary data collected from two real building construction sites and secondary data obtained from the literature. Different waste recovery rates were applied based on compositions and material flow to assess the influence on the environmental performance of CWM systems. The system boundary includes all stages of the life cycle of building construction waste (including transportation, sorting, public fill or landfill disposal, recovery and reuse, and transformation and valorization into secondary products). A substitutional LCA approach was applied for capturing the environmental gains due to the utilizations of recovered materials. The results showed that the CWM system by using off-site sorting and direct landfilling resulted in significant environmental impacts. However, a considerable net environmental benefit was observed through an on-site sorting system. For example, about 18-30kg CO 2 eq. greenhouse gases (GHGs) emission were induced for managing 1 t of construction waste through off-site sorting and direct landfilling, whereas significant GHGs emission could be potentially avoided (considered as a credit -126 to -182kg CO 2 eq.) for an on-site sorting system due to the higher recycling potential. Although the environmental benefits mainly depend on the waste compositions and their sortability, the analysis conducted in this study can serve as guidelines to design an effective and resource-efficient building CWM system. Copyright © 2017 Elsevier Ltd. All rights reserved.

MANNER OF STOCKS SORTING USING CLUSTER ANALYSIS METHODS

Directory of Open Access Journals (Sweden)

Jana Halčinová

2014-06-01

Full Text Available The aim of the present article is to show the possibility of using the methods of cluster analysis in classification of stocks of finished products. Cluster analysis creates groups (clusters of finished products according to similarity in demand i.e. customer requirements for each product. Manner stocks sorting of finished products by clusters is described a practical example. The resultants clusters are incorporated into the draft layout of the distribution warehouse.

Recent results on search for new physics at BaBar

Directory of Open Access Journals (Sweden)

Oberhof Benjamin

2017-01-01

Full Text Available We present some recent measurements for the search of New Physics using 514 fb−1 of e+e− collisions collected with the BaBar detector at the PEP-II e+e− collider at SLAC. First we present a search for the decay ϒ (1S → γA0, A0 → cc̄, where A0 is a candidate for the CP-odd Higgs boson of the next-to-minimal supersymmetric standard model. No significant signal is observed and we set 90% confidence-level upper limits on B(ϒ(1S → γA0 × B(A0 → cc̄. We report the search for a light non-Standard Model gauge boson Z′ coupling only to the second and third lepton families. Our results significantly improve current limits and further constrain the remaining region of the allowed parameter space. Finally, we present a search for a long-lived particle L that is produced in e+e− annihilations and decays into two oppositely charged tracks. We do not observe a significant signal and we and set 90% confidence level upper limits on the product of the L production cross section, branching fraction, and reconstruction efficiency as a function of the L mass. In addition, upper limits are provided on the branching fraction B(B → XsL, where Xs is an hadronic system with strangeness -1.

Quantum lower bound for sorting

OpenAIRE

Shi, Yaoyun

2000-01-01

We prove that \\Omega(n log(n)) comparisons are necessary for any quantum algorithm that sorts n numbers with high success probability and uses only comparisons. If no error is allowed, at least 0.110nlog_2(n) - 0.067n + O(1) comparisons must be made. The previous known lower bound is \\Omega(n).

Towards understanding and managing the learning process in mail sorting.

Science.gov (United States)

Berglund, M; Karltun, A

2012-01-01

This paper was based on case study research at the Swedish Mail Service Division and it addresses learning time to sort mail at new districts and means to support the learning process on an individual as well as organizational level. The study population consisted of 46 postmen and one team leader in the Swedish Mail Service Division. Data were collected through measurements of time for mail sorting, interviews and a focus group. The study showed that learning to sort mail was a much more complex process and took more time than expected by management. Means to support the learning process included clarification of the relationship between sorting and the topology of the district, a good work environment, increased support from colleagues and management, and a thorough introduction for new postmen. The identified means to support the learning process require an integration of human, technological and organizational aspects. The study further showed that increased operations flexibility cannot be reinforced without a systems perspective and thorough knowledge about real work activities and that ergonomists can aid businesses to acquire this knowledge.

The Role of the Clathrin Adaptor AP-1: Polarized Sorting and Beyond

Directory of Open Access Journals (Sweden)

Fubito Nakatsu

2014-11-01

Full Text Available The selective transport of proteins or lipids by vesicular transport is a fundamental process supporting cellular physiology. The budding process involves cargo sorting and vesicle formation at the donor membrane and constitutes an important process in vesicular transport. This process is particularly important for the polarized sorting in epithelial cells, in which the cargo molecules need to be selectively sorted and transported to two distinct destinations, the apical or basolateral plasma membrane. Adaptor protein (AP-1, a member of the AP complex family, which includes the ubiquitously expressed AP-1A and the epithelium-specific AP-1B, regulates polarized sorting at the trans-Golgi network and/or at the recycling endosomes. A growing body of evidence, especially from studies using model organisms and animals, demonstrates that the AP-1-mediated polarized sorting supports the development and physiology of multi-cellular units as functional organs and tissues (e.g., cell fate determination, inflammation and gut immune homeostasis. Furthermore, a possible involvement of AP-1B in the pathogenesis of human diseases, such as Crohn’s disease and cancer, is now becoming evident. These data highlight the significant contribution of AP-1 complexes to the physiology of multicellular organisms, as master regulators of polarized sorting in epithelial cells.

Recent results on Higgs measurements and searches in ATLAS

CERN Multimedia

CERN. Geneva

2016-01-01

The excellent operation of the LHC, and a fast processing and analysis, has enabled ATLAS to produce many new results during the last months with similar or better sensitivity than the one reached during Run 1 of the LHC. The seminar will give an overview of the Standard Model Higgs boson measurements and of searches for non-standard scalar states or decay modes.

Pilot scale digestion of source-sorted household waste as a tool for evaluation of different pre-sorting and pre-treatment strategies

DEFF Research Database (Denmark)

Svärd, Å; Gruvberger, C.; Aspegren, H.

2002-01-01

Pilot scale digestion of the organic fraction of source-sorted household waste from Sweden and Denmark was performed during one year. The study includes 17 waste types with differences in originating municipality, housing type, kitchen wrapping, sack type, pre-treatment method and season. The pilot...... scale digestion has been carried out in systems with a 35-litres digester connected to a 77-litres gas tank. Four rounds of digestion were performed including start-up periods, full operation periods for evaluation and post-digestion periods without feeding. Different pre-sorting and pre-treatment...

Sort-Mid tasks scheduling algorithm in grid computing

Directory of Open Access Journals (Sweden)

Naglaa M. Reda

2015-11-01

Full Text Available Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

Low power and high accuracy spike sorting microprocessor with on-line interpolation and re-alignment in 90 nm CMOS process.

Science.gov (United States)

Chen, Tung-Chien; Ma, Tsung-Chuan; Chen, Yun-Yu; Chen, Liang-Gee

2012-01-01

Accurate spike sorting is an important issue for neuroscientific and neuroprosthetic applications. The sorting of spikes depends on the features extracted from the neural waveforms, and a better sorting performance usually comes with a higher sampling rate (SR). However for the long duration experiments on free-moving subjects, the miniaturized and wireless neural recording ICs are the current trend, and the compromise on sorting accuracy is usually made by a lower SR for the lower power consumption. In this paper, we implement an on-chip spike sorting processor with integrated interpolation hardware in order to improve the performance in terms of power versus accuracy. According to the fabrication results in 90nm process, if the interpolation is appropriately performed during the spike sorting, the system operated at the SR of 12.5 k samples per second (sps) can outperform the one not having interpolation at 25 ksps on both accuracy and power.

Efficient Out of Core Sorting Algorithms for the Parallel Disks Model.

Science.gov (United States)

Kundeti, Vamsi; Rajasekaran, Sanguthevar

2011-11-01

In this paper we present efficient algorithms for sorting on the Parallel Disks Model (PDM). Numerous asymptotically optimal algorithms have been proposed in the literature. However many of these merge based algorithms have large underlying constants in the time bounds, because they suffer from the lack of read parallelism on PDM. The irregular consumption of the runs during the merge affects the read parallelism and contributes to the increased sorting time. In this paper we first introduce a novel idea called the dirty sequence accumulation that improves the read parallelism. Secondly, we show analytically that this idea can reduce the number of parallel I/O's required to sort the input close to the lower bound of [Formula: see text]. We experimentally verify our dirty sequence idea with the standard R-Way merge and show that our idea can reduce the number of parallel I/Os to sort on PDM significantly.

Interpreting the LHC Higgs search results in the MSSM

Energy Technology Data Exchange (ETDEWEB)

Heinemeyer, S. [Instituto de Fisica de Cantabria (CSIC-UC), Santander (Spain); Staal, O.; Weiglein, G. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

2011-12-15

Recent results reported by the ATLAS and CMS experiments on the search for a SM-like Higgs boson both show an excess for a Higgs mass near 125 GeV, which is mainly driven by the {gamma}{gamma} and ZZ{sup *} decay channels, but also receives some support from channels with a lower mass resolution. We discuss the implications of this possible signal within the context of the minimal supersymmetric Standard Model (MSSM), taking into account previous limits from Higgs searches at LEP, the Tevatron and the LHC. The consequences for the remaining MSSM parameter space are investigated. Under the assumption of a Higgs signal we derive new lower bounds on the tree-level parameters of the MSSM Higgs sector. We also discuss briefly an alternative interpretation of the excess in terms of the heavy CP-even Higgs boson, a scenario which is found to be still viable. (orig.)

MUSiC, a Model Unspecific Search for New Physics, in pp Collisions at $\\sqrt{s}=8\\,\\mathrm{TeV}$

CERN Document Server

CMS Collaboration

2017-01-01

This analysis summary presents the results of the Model Unspecific Search in CMS (MUSiC) based on data taken by the CMS detector at the LHC at a proton-proton center of mass energy of $\\sqrt{s}=8\\,\\mathrm{TeV}$. Based on comparisons to standard model (SM) simulations, this search for unexpected new physics covers a wide array of final states with minimal theoretical bias. Events collected with electron and muon triggers are sorted into classes based on their final state topology, taking electrons, muons, photons, jets and missing transverse energy into account. For the analyzed data corresponding to about $20\\,\\mathrm{fb}^{-1}$, this results in more than 200 event classes. The automated search algorithm subsequently surveys kinematic distributions of the data for deviations from the SM expectations, calculating a statistical significance. The sensitivity of the analysis is validated by surveying simulations of hypothetical models and by omitting known SM processes from the simulation. No indication of new phy...

Modeling the effect of dune sorting on the river long profile

Science.gov (United States)

Blom, A.

2012-12-01

River dunes, which occur in low slope sand bed and sand-gravel bed rivers, generally show a downward coarsening pattern due to grain flows down their avalanche lee faces. These grain flows cause coarse particles to preferentially deposit at lower elevations of the lee face, while fines show a preference for its upper elevations. Before considering the effect of this dune sorting mechanism on the river long profile, let us first have a look at some general trends along the river profile. Tributaries increasing the river's water discharge in streamwise direction also cause a streamwise increase in flow depth. As under subcritical conditions mean dune height generally increases with increasing flow depth, the dune height shows a streamwise increase, as well. This means that also the standard deviation of bedform height increases in streamwise direction, as in earlier work it was found that the standard deviation of bedform height linearly increases with an increasing mean value of bedform height. As a result of this streamwise increase in standard deviation of dune height, the above-mentioned dune sorting then results in a loss of coarse particles to the lower elevations of the bed that are less and even rarely exposed to the flow. This loss of coarse particles to lower elevations thus increases the rate of fining in streamwise direction. As finer material is more easily transported downstream than coarser material, a smaller bed slope is required to transport the same amount of sediment downstream. This means that dune sorting adds to river profile concavity, compared to the combined effect of abrasion, selective transport and tributaries. A Hirano-type mass conservation model is presented that deals with dune sorting. The model includes two active layers: a bedform layer representing the sediment in the bedforms and a coarse layer representing the coarse and less mobile sediment underneath migrating bedforms. The exposure of the coarse layer is governed by the rate

NA62 and NA48/2 results on search for Heavy Neutral Leptons

Directory of Open Access Journals (Sweden)

Lamanna Gianluca

2018-01-01

Full Text Available In this paper we present new results on upper limits for the search of Heavy Neutral Leptons (HNL with data collected by NA48/2 (2003-2004, NA62-RK (2007 and NA62 (2015 CERN experiments. The data collected with different trigger configuration allow to search for both long and short living heavy neutrinos in the mass range below the kaon mass. In addition the status of the search for K+ → π+vv with the NA62 detector will be briefly presented.

Online health information search: what struggles and empowers the users? Results of an online survey.

Science.gov (United States)

Pletneva, Natalia; Vargas, Alejandro; Kalogianni, Konstantina; Boyer, Célia

2012-01-01

The most popular mean of searching for online health content is a general search engine for all domains of interest. Being general implies on one hand that the search engine is not tailored to the needs which are particular to the medical and on another hand that health domain and health-specific queries may not always return adequate and adapted results. The aim of our study was to identify difficulties and preferences in online health information search encountered by members of the general public. The survey in four languages was online from the 9th of March until the 27th of April, 2011. 385 answers were collected, representing mostly the opinions of highly educated users, mostly from France and Spain. The most important characteristics of a search engine are relevance and trustworthiness of results. The results currently retrieved do not fulfil these requirements. The ideal representation of the information will be a categorization of the results into different groups. Medical dictionaries/thesauruses, suggested relevant topics, image searches and spelling corrections are regarded as helpful tools. There is a need to work towards better customized solutions which provide users with the trustworthy information of high quality specific to his/her case in a user-friendly environment which would eventually lead to making appropriate health decisions.

Multi-objective calibration of a reservoir model: aggregation and non-dominated sorting approaches

Science.gov (United States)

Huang, Y.

2012-12-01

Numerical reservoir models can be helpful tools for water resource management. These models are generally calibrated against historical measurement data made in reservoirs. In this study, two methods are proposed for the multi-objective calibration of such models: aggregation and non-dominated sorting methods. Both methods use a hybrid genetic algorithm as an optimization engine and are different in fitness assignment. In the aggregation method, a weighted sum of scaled simulation errors is designed as an overall objective function to measure the fitness of solutions (i.e. parameter values). The contribution of this study to the aggregation method is the correlation analysis and its implication to the choice of weight factors. In the non-dominated sorting method, a novel method based on non-dominated sorting and the method of minimal distance is used to calculate the dummy fitness of solutions. The proposed methods are illustrated using a water quality model that was set up to simulate the water quality of Pepacton Reservoir, which is located to the north of New York City and is used for water supply of city. The study also compares the aggregation and the non-dominated sorting methods. The purpose of this comparison is not to evaluate the pros and cons between the two methods but to determine whether the parameter values, objective function values (simulation errors) and simulated results obtained are significantly different with each other. The final results (objective function values) from the two methods are good compromise between all objective functions, and none of these results are the worst for any objective function. The calibrated model provides an overall good performance and the simulated results with the calibrated parameter values match the observed data better than the un-calibrated parameters, which supports and justifies the use of multi-objective calibration. The results achieved in this study can be very useful for the calibration of water

Sorting processes with energy-constrained comparisons*

Science.gov (United States)

Geissmann, Barbara; Penna, Paolo

2018-05-01

We study very simple sorting algorithms based on a probabilistic comparator model. In this model, errors in comparing two elements are due to (1) the energy or effort put in the comparison and (2) the difference between the compared elements. Such algorithms repeatedly compare and swap pairs of randomly chosen elements, and they correspond to natural Markovian processes. The study of these Markov chains reveals an interesting phenomenon. Namely, in several cases, the algorithm that repeatedly compares only adjacent elements is better than the one making arbitrary comparisons: in the long-run, the former algorithm produces sequences that are "better sorted". The analysis of the underlying Markov chain poses interesting questions as the latter algorithm yields a nonreversible chain, and therefore its stationary distribution seems difficult to calculate explicitly. We nevertheless provide bounds on the stationary distributions and on the mixing time of these processes in several restrictions.

Microtechnology for cell manipulation and sorting

CERN Document Server

Tseng, Peter; Carlo, Dino

2017-01-01

This book delves into the recent developments in the microscale and microfluidic technologies that allow manipulation at the single and cell aggregate level. Expert authors review the dominant mechanisms that manipulate and sort biological structures, making this a state-of-the-art overview of conventional cell sorting techniques, the principles of microfluidics, and of microfluidic devices. All chapters highlight the benefits and drawbacks of each technique they discuss, which include magnetic, electrical, optical, acoustic, gravity/sedimentation, inertial, deformability, and aqueous two-phase systems as the dominant mechanisms utilized by microfluidic devices to handle biological samples. Each chapter explains the physics of the mechanism at work, and reviews common geometries and devices to help readers decide the type of style of device required for various applications. This book is appropriate for graduate-level biomedical engineering and analytical chemistry students, as well as engineers and scientist...

Constructing Efficient Dictionaries in Close to Sorting Time

DEFF Research Database (Denmark)

Ruzic, Milan

2008-01-01

to be a particularly challenging task. We present solutions to the static dictionary problem that significantly improve the previously known upper bounds and bring them close to obvious lower bounds. Our dictionaries have a constant lookup cost and use linear space, which was known to be possible, but the worst......-case cost of construction of the structures is proportional to only loglogn times the cost of sorting the input. Our claimed performance bounds are obtained in the word RAM model and in the external memory models; only the involved sorting procedures in the algorithms need to be changed between the models....

Aldefluor protocol to sort keratinocytes stem cells from skin

OpenAIRE

Noronha, Samuel Marcos Ribeiro; Gragnani, Alfredo; Pereira, Thiago Antônio Calado; Correa, Silvana Aparecida Alves; Bonucci, Jessica; Ferreira, Lydia Masako

2017-01-01

Abstract Purpose: To investigate the use Aldefluor® and N, N - Dimethylaminobenzaldehyde (DEAB) to design a protocol to sort keratinocyte stem cells from cultured keratinocytes from burned patients. Methods: Activated Aldefluor® aliquots were prepared and maintained at temperature between 2 to 8°C, or stored at -20°C. Next, the cells were collected following the standard protocol of sample preparation. Results: Best results were obtained with Aldefluor® 1.5µl and DEAB 15 µl for 1 x 106 c...

Co-assembly of viral envelope glycoproteins regulates their polarized sorting in neurons.

Directory of Open Access Journals (Sweden)

Rafael Mattera

2014-05-01

Full Text Available Newly synthesized envelope glycoproteins of neuroinvasive viruses can be sorted in a polarized manner to the somatodendritic and/or axonal domains of neurons. Although critical for transneuronal spread of viruses, the molecular determinants and interregulation of this process are largely unknown. We studied the polarized sorting of the attachment (NiV-G and fusion (NiV-F glycoproteins of Nipah virus (NiV, a paramyxovirus that causes fatal human encephalitis, in rat hippocampal neurons. When expressed individually, NiV-G exhibited a non-polarized distribution, whereas NiV-F was specifically sorted to the somatodendritic domain. Polarized sorting of NiV-F was dependent on interaction of tyrosine-based signals in its cytosolic tail with the clathrin adaptor complex AP-1. Co-expression of NiV-G with NiV-F abolished somatodendritic sorting of NiV-F due to incorporation of NiV-G•NiV-F complexes into axonal transport carriers. We propose that faster biosynthetic transport of unassembled NiV-F allows for its proteolytic activation in the somatodendritic domain prior to association with NiV-G and axonal delivery of NiV-G•NiV-F complexes. Our study reveals how interactions of viral glycoproteins with the host's transport machinery and between themselves regulate their polarized sorting in neurons.

A mower detector to judge soil sorting

International Nuclear Information System (INIS)

Bramlitt, E.T.; Johnson, N.R.

1995-01-01

Thermo Nuclear Services (TNS) has developed a mower detector as an inexpensive and fast means for deciding potential value of soil sorting for cleanup. It is a shielded detector box on wheels pushed over the ground (as a person mows grass) at 30 ft/min with gamma-ray counts recorded every 0.25 sec. It mirror images detection by the TNS transportable sorter system which conveys soil at 30 ft/min and toggles a gate to send soil on separate paths based on counts. The mower detector shows if contamination is variable and suitable for sorting, and by unique calibration sources, it indicates detection sensitivity. The mower detector has been used to characterize some soil at Department of Energy sites in New Jersey and South Carolina

A mower detector to judge soil sorting

Energy Technology Data Exchange (ETDEWEB)

Bramlitt, E.T.; Johnson, N.R. [Thermo Nuclear Services, Inc., Albuquerque, NM (United States)

1995-12-31

Thermo Nuclear Services (TNS) has developed a mower detector as an inexpensive and fast means for deciding potential value of soil sorting for cleanup. It is a shielded detector box on wheels pushed over the ground (as a person mows grass) at 30 ft/min with gamma-ray counts recorded every 0.25 sec. It mirror images detection by the TNS transportable sorter system which conveys soil at 30 ft/min and toggles a gate to send soil on separate paths based on counts. The mower detector shows if contamination is variable and suitable for sorting, and by unique calibration sources, it indicates detection sensitivity. The mower detector has been used to characterize some soil at Department of Energy sites in New Jersey and South Carolina.

Peningkatan Prestasi Belajar Pendidikan Agama Islam Melalui Penerapan Card Sort Learning

Directory of Open Access Journals (Sweden)

Nur Fadilah

2017-11-01

Full Text Available Appropriate learning methods should be applied in order to maximize the students’ ability during learning activities. The purpose of this study is to determine the improvement of learning achievement of Islamic Religious Education (PAI through the application of card sort learning method. Action study conducted on PAI learning. The material of this learning is to  understand the provision of sholat of fourth graders of Gunungsari State Elementary School 2 Kaliori Sub district Rembang District Lesson Year 2015/2016. The indicator of successful learning in this research is 75%. The results showed that the percentage of learning mastery at the pre cycle stage was 10.7%, 67.9% in the first cycle, and in the second cycle reached 92.9%. The average score of students' test results also increased significantly, ie the pre cycle stage was 58.8, the first cycle was 72.4, and in the second cycle reached 78.9. This means, through the implementation of card sort learning methode can improve student learning achievement on PAI learning material understanding the provision of sholat.  lAbstrak Metode pembelajaran yang tepat harus diterapkan untuk memaksimalkan kemampuan siswa selama kegiatan pembelajaran. Penelitian ini bertujuan untuk mengetahui peningkatan prestasi belajar Pendidikan Agama Islam (PAI melalui penerapan metode card sort. Studi tindakan (action research dilakukan pada pembelajaran PAI materi mengenai rukun sholat siswa kelas IV Sekolah Dasar Negeri Gunungsari 2 Kecamatan Kaliori Kabupaten Rembang Tahun Pelajaran 2015/2016. Indikator eHasil penelitian menunjukkan bahwa persentase ketuntasan belajar pada tahap pra siklus sebesar 10,7%, pada siklus I sebesar 67,9%, dan pada siklus II mencapai 92,9%. Nilai rata-rata hasil tes siswa juga mengalami peningkatan yang signifikan, yaitu para tahap pra siklus sebesar 58,8, siklus I sebesar 72,4, dan pada siklus II naik menjadi 78,9. Hal ini berarti, melalui penerapan card sort learning dapat

An efficient non-dominated sorting method for evolutionary algorithms.

Science.gov (United States)

Fang, Hongbing; Wang, Qian; Tu, Yi-Cheng; Horstemeyer, Mark F

2008-01-01

We present a new non-dominated sorting algorithm to generate the non-dominated fronts in multi-objective optimization with evolutionary algorithms, particularly the NSGA-II. The non-dominated sorting algorithm used by NSGA-II has a time complexity of O(MN(2)) in generating non-dominated fronts in one generation (iteration) for a population size N and M objective functions. Since generating non-dominated fronts takes the majority of total computational time (excluding the cost of fitness evaluations) of NSGA-II, making this algorithm faster will significantly improve the overall efficiency of NSGA-II and other genetic algorithms using non-dominated sorting. The new non-dominated sorting algorithm proposed in this study reduces the number of redundant comparisons existing in the algorithm of NSGA-II by recording the dominance information among solutions from their first comparisons. By utilizing a new data structure called the dominance tree and the divide-and-conquer mechanism, the new algorithm is faster than NSGA-II for different numbers of objective functions. Although the number of solution comparisons by the proposed algorithm is close to that of NSGA-II when the number of objectives becomes large, the total computational time shows that the proposed algorithm still has better efficiency because of the adoption of the dominance tree structure and the divide-and-conquer mechanism.

A Low Cost VLSI Architecture for Spike Sorting Based on Feature Extraction with Peak Search.

Science.gov (United States)

Chang, Yuan-Jyun; Hwang, Wen-Jyi; Chen, Chih-Chang

2016-12-07

The goal of this paper is to present a novel VLSI architecture for spike sorting with high classification accuracy, low area costs and low power consumption. A novel feature extraction algorithm with low computational complexities is proposed for the design of the architecture. In the feature extraction algorithm, a spike is separated into two portions based on its peak value. The area of each portion is then used as a feature. The algorithm is simple to implement and less susceptible to noise interference. Based on the algorithm, a novel architecture capable of identifying peak values and computing spike areas concurrently is proposed. To further accelerate the computation, a spike can be divided into a number of segments for the local feature computation. The local features are subsequently merged with the global ones by a simple hardware circuit. The architecture can also be easily operated in conjunction with the circuits for commonly-used spike detection algorithms, such as the Non-linear Energy Operator (NEO). The architecture has been implemented by an Application-Specific Integrated Circuit (ASIC) with 90-nm technology. Comparisons to the existing works show that the proposed architecture is well suited for real-time multi-channel spike detection and feature extraction requiring low hardware area costs, low power consumption and high classification accuracy.

Impact of respiratory-correlated CT sorting algorithms on the choice of margin definition for free-breathing lung radiotherapy treatments.

Science.gov (United States)

Thengumpallil, Sheeba; Germond, Jean-François; Bourhis, Jean; Bochud, François; Moeckli, Raphaël

2016-06-01

To investigate the impact of Toshiba phase- and amplitude-sorting algorithms on the margin strategies for free-breathing lung radiotherapy treatments in the presence of breathing variations. 4D CT of a sphere inside a dynamic thorax phantom was acquired. The 4D CT was reconstructed according to the phase- and amplitude-sorting algorithms. The phantom was moved by reproducing amplitude, frequency, and a mix of amplitude and frequency variations. Artefact analysis was performed for Mid-Ventilation and ITV-based strategies on the images reconstructed by phase- and amplitude-sorting algorithms. The target volume deviation was assessed by comparing the target volume acquired during irregular motion to the volume acquired during regular motion. The amplitude-sorting algorithm shows reduced artefacts for only amplitude variations while the phase-sorting algorithm for only frequency variations. For amplitude and frequency variations, both algorithms perform similarly. Most of the artefacts are blurring and incomplete structures. We found larger artefacts and volume differences for the Mid-Ventilation with respect to the ITV strategy, resulting in a higher relative difference of the surface distortion value which ranges between maximum 14.6% and minimum 4.1%. The amplitude- is superior to the phase-sorting algorithm in the reduction of motion artefacts for amplitude variations while phase-sorting for frequency variations. A proper choice of 4D CT sorting algorithm is important in order to reduce motion artefacts, especially if Mid-Ventilation strategy is used. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Improvement of natural image search engines results by emotional filtering

Directory of Open Access Journals (Sweden)

Patrice Denis

2016-04-01

Full Text Available With the Internet 2.0 era, managing user emotions is a problem that more and more actors are interested in. Historically, the first notions of emotion sharing were expressed and defined with emoticons. They allowed users to show their emotional status to others in an impersonal and emotionless digital world. Now, in the Internet of social media, every day users share lots of content with each other on Facebook, Twitter, Google+ and so on. Several new popular web sites like FlickR, Picassa, Pinterest, Instagram or DeviantArt are now specifically based on sharing image content as well as personal emotional status. This kind of information is economically very valuable as it can for instance help commercial companies sell more efficiently. In fact, with this king of emotional information, business can made where companies will better target their customers needs, and/or even sell them more products. Research has been and is still interested in the mining of emotional information from user data since then. In this paper, we focus on the impact of emotions from images that have been collected from search image engines. More specifically our proposition is the creation of a filtering layer applied on the results of such image search engines. Our peculiarity relies in the fact that it is the first attempt from our knowledge to filter image search engines results with an emotional filtering approach.

Grain-size sorting in grainflows at the lee side of deltas

NARCIS (Netherlands)

Kleinhans, M.G.

2005-01-01

The sorting of sediment mixtures at the lee slope of deltas (at the angle of repose) is studied with experiments in a narrow, deep flume with subaqueous Gilbert-type deltas using varied flow conditions and different sediment mixtures. Sediment deposition and sorting on the lee slope of the delta

Final results of the search for $\

CERN Document Server

Agafonova, N.; Anokhina, A.; Aoki, S.; Ariga, A.; Ariga, T.; Bertolin, A.; Bozza, C.; Brugnera, R.; Buonaura, A.; Buontempo, S.; Chernyavskiy, M.; Chukanov, A.; Consiglio, L.; D'Ambrosio, N.; De Lellis, G.; De Serio, M.; del Amo Sanchez, P.; Di Crescenzo, A.; Di Ferdinando, D.; Di Marco, N.; Dmitrievsky, S.; Dracos, M.; Duchesneau, D.; Dusini, S.; Dzhatdoev, T.; Ebert, J.; Ereditato, A.; Favier, J.; Fini, R.A.; Fornari, F.; Fukuda, T.; Galati, G.; Garfagnini, A.; Gentile, V.; Goldberg, J.; Gornushkin, Y.; Gorbunov, S.; Grella, G.; Guler, A.M.; Gustavino, C.; Hagner, C.; Hara, T.; Hayakawa, T.; Hollnagel, A.; Hosseini, B.; Ishiguro, K.; Iuliano, A.; Jakovcic, K.; Jollet, C.; Kamiscioglu, C.; Kamiscioglu, M.; Kim, S.H.; Kitagawa, N.; Klicek, B.; Kodama, K.; Komatsu, M.; Kose, U.; Kreslo, I.; Laudisio, F.; Lauria, A.; Ljubicic, A.; Longhin, A.; Loverre, P.; Malgin, A.; Malenica, M.; Mandrioli, G.; Matsuo, T.; Matveev, V.; Mauri, N.; Medinaceli, E.; Meisel, F.; Meregaglia, A.; Mikado, S.; Miyanishi, M.; Mizutani, F.; Monacelli, P.; Montesi, M.C.; Morishima, K.; Muciaccia, M.T.; Naganawa, N.; Naka, T.; Nakamura, M.; Nakano, T.; Niwa, K.; Okateva, N.; Ogawa, S.; Ozaki, K.; Paoloni, A.; Paparella, L.; Park, B.D.; Pasqualini, L.; Pastore, A.; Patrizii, L.; Pessard, H.; Podgrudkov, D.; Polukhina, N.; Pozzato, M.; Pupilli, F.; Roda, M.; Roganova, T.; Rokujo, H.; Rosa, G.; Ryazhskaya, O.; Sato, O.; Schembri, A.; Shakiryanova, I.; Shchedrina, T.; Shibuya, H.; Shibayama, E.; Shiraishi, T.; Simone, S.; Sirignano, C.; Sirri, G.; Sotnikov, A.; Spinetti, M.; Stanco, L.; Starkov, N.; Stellacci, S.M.; Stipcevic, M.; Strolin, P.; Takahashi, S.; Tenti, M.; Terranova, F.; Tioukov, V.; Vasina, S.; Vilain, P.; Voevodina, E.; Votano, L.; Vuilleumier, J.L.; Wilquet, G.; Yoon, C.S.

The OPERA experiment has discovered the tau neutrino appearance in the CNGS muon neutrino beam, in agreement with the 3 neutrino flavour oscillation hypothesis. The OPERA neutrino interaction target, made of Emulsion Cloud Chamber, was particularly efficient in the reconstruction of electromagnetic showers. Moreover, thanks to the very high granularity of the emulsion films, showers induced by electrons can be distinguished from those induced by $\\pi^0$s, thus allowing the detection of charged current interactions of electron neutrinos. In this paper the results of the search for electron neutrino events using the full dataset are reported. An improved method for the electron neutrino energy estimation is exploited. Data are compatible with the 3 neutrino flavour mixing model expectations and are used to set limits on the oscillation parameters of the 3+1 neutrino mixing model, in which an additional mass eigenstate $m_{4}$ is introduced. At high $\\Delta m^{2}_{41}$ $( \\gtrsim 0.1~\\textrm{eV}^{2})$, an upper ...

Trapping, focusing, and sorting of microparticles through bubble streaming

Science.gov (United States)

Wang, Cheng; Jalikop, Shreyas; Hilgenfeldt, Sascha

2010-11-01

Ultrasound-driven oscillating microbubbles can set up vigorous steady streaming flows around the bubbles. In contrast to previous work, we make use of the interaction between the bubble streaming and the streaming induced around mobile particles close to the bubble. Our experiment superimposes a unidirectional Poiseuille flow containing a well-mixed suspension of neutrally buoyant particles with the bubble streaming. The particle-size dependence of the particle-bubble interaction selects which particles are transported and which particles are trapped near the bubbles. The sizes selected for can be far smaller than any scale imposed by the device geometry, and the selection mechanism is purely passive. Changing the amplitude and frequency of ultrasound driving, we can further control focusing and sorting of the trapped particles, leading to the emergence of sharply defined monodisperse particle streams within a much wider channel. Optimizing parameters for focusing and sorting are presented. The technique is applicable in important fields like cell sorting and drug delivery.

Risk Aversion and Sorting into Public Sector Employment

OpenAIRE

Pfeifer, Christian

2008-01-01

This research note uses two German data sets – the large-scale German Socio-Economic Panel and unique data from own student questionnaires – to analyse the relationship between risk aversion and the choice for public sector employment. Main results are: (1) more risk averse individuals sort into public sector employment, (2) the impact of career specific and unemployment risk attitudes is larger than the impact of general risk attitudes, and (3) risk taking is rewarded with higher wages in th...

Learning sorting algorithms through visualization construction

Science.gov (United States)

Cetin, Ibrahim; Andrews-Larson, Christine

2016-01-01

Recent increased interest in computational thinking poses an important question to researchers: What are the best ways to teach fundamental computing concepts to students? Visualization is suggested as one way of supporting student learning. This mixed-method study aimed to (i) examine the effect of instruction in which students constructed visualizations on students' programming achievement and students' attitudes toward computer programming, and (ii) explore how this kind of instruction supports students' learning according to their self-reported experiences in the course. The study was conducted with 58 pre-service teachers who were enrolled in their second programming class. They expect to teach information technology and computing-related courses at the primary and secondary levels. An embedded experimental model was utilized as a research design. Students in the experimental group were given instruction that required students to construct visualizations related to sorting, whereas students in the control group viewed pre-made visualizations. After the instructional intervention, eight students from each group were selected for semi-structured interviews. The results showed that the intervention based on visualization construction resulted in significantly better acquisition of sorting concepts. However, there was no significant difference between the groups with respect to students' attitudes toward computer programming. Qualitative data analysis indicated that students in the experimental group constructed necessary abstractions through their engagement in visualization construction activities. The authors of this study argue that the students' active engagement in the visualization construction activities explains only one side of students' success. The other side can be explained through the instructional approach, constructionism in this case, used to design instruction. The conclusions and implications of this study can be used by researchers and

A Proposed Analytical Model for Integrated Pick-and-Sort Systems

Directory of Open Access Journals (Sweden)

Recep KIZILASLAN

2013-11-01

Full Text Available In this study we present an analytical approach for integration of order picking and sortation operations which are the most important, labour intensive and costly activity for warehouses. Main aim is to investigate order picking and sorting efficiencies under different design issues as a function of order wave size. Integrated analytical model is proposed to estimate the optimum order picking and order sortation efficiency. The model, which has been tested by simulations with different illustrative examples, calculates the optimum wave size that solves the trade-off between picking and sorting operations and makes the order picking and sortations efficiency maximum. Our model also allow system designer to predict the order picking and sorting capacity for different system configurations. This study presents an innovative approach for integrated warehouse operations.

Heavy mineral sorting and distributions within massive sandstone divisions (Bouma A divisions) of Brushy Canyon Formation turbidites

Science.gov (United States)

Motanated, K.; Tice, M. M.

2009-12-01

KANNIPA MOTANATED and MICHAEL M. TICE Department of Geology and Geophysics, Texas A&M University, College Station, TX 77843-3115, USA Sediment sorting data are commonly used for interpreting depositional environments, analyzing mechanisms of deposition and transportation, and inferring relative transport distance of sediments. Typically, sorting in sandstones is estimated by point-counting thin sections which is a time consuming procedure and requires cutting sections of rock samples. We demonstrate a new technique for quantifying sediment sorting using element distribution maps obtained by x-ray fluorescence microscopy. We show that hydraulic sorting of Zr- and Ti- bearing grains (probably zircon and rutile, respectively) results in characteristic vertical profiles of Zr and Ti abundances within the Bouma A divisions of turbidites of the Brushy Canyon Formation, Delaware Basin, southern New Mexico. Zr- and Ti- bearing grains decrease in abundance and diameter from bases to tops of A divisions in every sample examined in this study. These results contrast with previous observations which suggest that grading in Brushy Canyon Formation structureless sandstones is absent or rare. The data support turbiditic interpretations of these rocks against traction current interpretations which rely on the lack of textural grading. Grading is reflected in vertical profiles of Ti/Al, Zr/Al and Zr/Ti ratios, which each decrease upward. These compositional variations could potentially be used as geochemical proxies for physical sorting, and might be useful for inferring depositional processes and relative transport distances.

A Linear Criterion to sort Color Components in Images

Directory of Open Access Journals (Sweden)

Leonardo Barriga Rodriguez

2017-01-01

Full Text Available The color and its representation play a basic role in Image Analysis process. Several methods can be beneficial whenever they have a correct representation of wave-length variations used to represent scenes with a camera. A wide variety of spaces and color representations is founded in specialized literature. Each one is useful in concrete circumstances and others may offer redundant color information (for instance, all RGB components are high correlated. This work deals with the task of identifying and sorting which component from several color representations offers the majority of information about the scene. This approach is based on analyzing linear dependences among each color component, by the implementation of a new sorting algorithm based on entropy. The proposal is tested in several outdoor/indoor scenes with different light conditions. Repeatability and stability are tested in order to guarantee its use in several image analysis applications. Finally, the results of this work have been used to enhance an external algorithm to compensate the camera random vibrations.

Exposure to airborne fungi during sorting of recyclable plastics in waste treatment facilities.

Science.gov (United States)

Černá, Kristýna; Wittlingerová, Zdeňka; Zimová, Magdaléna; Janovský, Zdeněk

2017-02-28

In working environment of waste treatment facilities, employees are exposed to high concentrations of airborne microorganisms. Fungi constitute an essential part of them. This study aims at evaluating the diurnal variation in concentrations and species composition of the fungal contamination in 2 plastic waste sorting facilities in different seasons. Air samples from the 2 sorting facilities were collected through the membrane filters method on 4 different types of cultivation media. Isolated fungi were classified to genera or species by using a light microscopy. Overall, the highest concentrations of airborne fungi were recorded in summer (9.1×103-9.0×105 colony-forming units (CFU)/m3), while the lowest ones in winter (2.7×103-2.9×105 CFU/m3). The concentration increased from the beginning of the work shift and reached a plateau after 6-7 h of the sorting. The most frequently isolated airborne fungi were those of the genera Penicillium and Aspergillus. The turnover of fungal species between seasons was relatively high as well as changes in the number of detected species, but potentially toxigenic and allergenic fungi were detected in both facilities during all seasons. Generally, high concentrations of airborne fungi were detected in the working environment of plastic waste sorting facilities, which raises the question of health risk taken by the employees. Based on our results, the use of protective equipment by employees is recommended and preventive measures should be introduced into the working environment of waste sorting facilities to reduce health risk for employees. Med Pr 2017;68(1):1-9. This work is available in Open Access model and licensed under a CC BY-NC 3.0 PL license.

The development and implementation of a dry active waste (DAW) sorting program at Catawba Nuclear Station

International Nuclear Information System (INIS)

Schulte, J.H.; McNamara, P.N.

1988-01-01

Duke Power Company, like other nuclear utilities, bears a burdensome radwaste disposal cost that has rapidly escalated during recent years. Dry active waste (DAW) represents approximately 85% of the total radioactive waste volume shipped to low-level disposal facilities. Sorting waste with less than detectable radioactivity from waste with detectable radioactivity provides a volume reduction (VR) technique that can save significant radwaste disposal costs and conserve dwindling burial space. This paper presents the development and results of a project that was conducted at Catawba Nuclear Station to determine the volume reduction potential from sorting DAW. Guidelines are given so that other utilities can perform a VR potential study on a low cost basis. Based on the results of the DAW VR study, an overall DAW volume radiation program was initiated at Duke Power Company. This program includes personnel training, drumming techniques, bag tracking and equipment purchases for sorting. This program has been fully implemented at Duke Power Company since January 1, 1988 and preliminary results and savings are given

Early planting and hand sorting effectively controls seed-borne fungi in farm-retained bean seed

Directory of Open Access Journals (Sweden)

Ernest Dube

2014-11-01

Full Text Available Home-saved bean (Phaseolus vulgaris L. seed can be hand-sorted to remove discoloured seed, thereby reducing the level of contamination by certain seed-borne fungi and improving seed germination. In this study, the effect of planting date on the infection and discolouration of bean seed by seed-borne fungi was investigated in order to improve the quality of hand-sorted, farm-retained bean seeds used by resource poor smallholder farmers. The germination quality and level of seed-borne fungi in hand-sorted first-generation bean seed harvested from an early-, mid- and late-summer season planted crop was therefore assessed. The highest percentage of discoloured seed (68% was obtained from the mid-summer season planting. Non-discoloured seed from early- and late-season plantings had significantly (p"less than"0.001 higher normal germination (82% and 77%, respectively than that from the mid-season planting date (58%. Irrespective of planting date, unsorted seed and discoloured seed had higher levels of infection by Fusarium spp. and Phaeoisariopsis spp. than the non-discoloured seed. Removal of discoloured seed by hand sorting eliminated Rhizoctonia spp. from all seed lots. Farmers can eliminate this pathogen by simply removing discoloured seed. Non-discoloured seed from the early-planted crop had the lowest level of infection by Fusarium spp. and Phaeoisariopsis spp. The results indicate that planting date is an important consideration in improving the quality of hand-sorted farm-retained bean seed.

The VirusBanker database uses a Java program to allow flexible searching through Bunyaviridae sequences

Directory of Open Access Journals (Sweden)

Gibbs Mark J

2008-02-01

Full Text Available Abstract Background Viruses of the Bunyaviridae have segmented negative-stranded RNA genomes and several of them cause significant disease. Many partial sequences have been obtained from the segments so that GenBank searches give complex results. Sequence databases usually use HTML pages to mediate remote sorting, but this approach can be limiting and may discourage a user from exploring a database. Results The VirusBanker database contains Bunyaviridae sequences and alignments and is presented as two spreadsheets generated by a Java program that interacts with a MySQL database on a server. Sequences are displayed in rows and may be sorted using information that is displayed in columns and includes data relating to the segment, gene, protein, species, strain, sequence length, terminal sequence and date and country of isolation. Bunyaviridae sequences and alignments may be downloaded from the second spreadsheet with titles defined by the user from the columns, or viewed when passed directly to the sequence editor, Jalview. Conclusion VirusBanker allows large datasets of aligned nucleotide and protein sequences from the Bunyaviridae to be compiled and winnowed rapidly using criteria that are formulated heuristically.

Results on dark matter searches with the ANTARES neutrino telescope

CERN Multimedia

Zornoza, Juande

2016-01-01

Neutrino telescopes have a wide scientific scope. One of their main goals is the detection of dark matter, for which they have specific advantages. The understanding of the nature of dark matter requires a multi-front approach since we still do not know many of their properties. Neutrino telescopes offer the possibility of look at several kinds of sources, not all of them available to other indirect searches. In this work we provide an overview of the results obtained by the ANTARES neutrino telescope, which has been taking data for almost ten years. It is installed in the Mediterranean Sea at a depth of 2475 m, off the coast of Toulon (France). The results presented in this work include searches for neutrino excess from several astrophysical sources. One of the most interesting ones is the Sun. Dark matter particles by the solar system would scatter with nuclei of the Sun, lose energy and accumulate in its centre. Among the final products of their annihilations, only neutrinos could escape. Therefore, a dete...

International Society for Analytical Cytology biosafety standard for sorting of unfixed cells.

Science.gov (United States)

Schmid, Ingrid; Lambert, Claude; Ambrozak, David; Marti, Gerald E; Moss, Delynn M; Perfetto, Stephen P

2007-06-01

Cell sorting of viable biological specimens has become very prevalent in laboratories involved in basic and clinical research. As these samples can contain infectious agents, precautions to protect instrument operators and the environment from hazards arising from the use of sorters are paramount. To this end the International Society of Analytical Cytology (ISAC) took a lead in establishing biosafety guidelines for sorting of unfixed cells (Schmid et al., Cytometry 1997;28:99-117). During the time period these recommendations have been available, they have become recognized worldwide as the standard practices and safety precautions for laboratories performing viable cell sorting experiments. However, the field of cytometry has progressed since 1997, and the document requires an update. Initially, suggestions about the document format and content were discussed among members of the ISAC Biosafety Committee and were incorporated into a draft version that was sent to all committee members for review. Comments were collected, carefully considered, and incorporated as appropriate into a draft document that was posted on the ISAC web site to invite comments from the flow cytometry community at large. The revised document was then submitted to ISAC Council for review. Simultaneously, further comments were sought from newly-appointed ISAC Biosafety committee members. This safety standard for performing viable cell sorting experiments was recently generated. The document contains background information on the biohazard potential of sorting and the hazard classification of infectious agents as well as recommendations on (1) sample handling, (2) operator training and personal protection, (3) laboratory design, (4) cell sorter set-up, maintenance, and decontamination, and (5) testing the instrument for the efficiency of aerosol containment. This standard constitutes an updated and expanded revision of the 1997 biosafety guideline document. It is intended to provide

Finding electronic information for health policy advocacy: a guide to improving search results.

Science.gov (United States)

Olsan, Tobie H; Bianchi, Carolanne; White, Pamela; Glessner, Theresa; Mapstone, Pamela L

2011-12-01

The success of advanced practice registered nurses' (APRNs') health policy advocacy depends on staying well informed about key issues. Searching for high-quality health policy information, however, can be frustrating and time consuming. Busy clinicians need strategies and tips to reduce information overload and to access synthesized research for evidence-based health policy. This article therefore offers APRNs practical guidelines and resources for searching electronic health policy information. Scholarly databases and Internet sites. Electronic health policy information is generated by a wide variety of public and private organizations and disseminated in hundreds of journals and Web pages. Specialty search tools are needed to retrieve the unindexed gray literature, which includes government documents, agency reports, fact sheets, standards, and statistics not produced by commercial publishers. Further, Internet users need to examine search results with a critical eye for information quality. Expertise in searching electronic health policy information is a prerequisite for developing APRNs' leadership in political arenas to influence health policy and the delivery of healthcare services. ©2011 The Author(s) Journal compilation ©2011 American Academy of Nurse Practitioners.

Google Scholar Out-Performs Many Subscription Databases when Keyword Searching. A Review of: Walters, W. H. (2009. Google Scholar search performance: Comparative recall and precision. portal: Libraries and the Academy, 9(1, 5-24.

Directory of Open Access Journals (Sweden)

Giovanna Badia

2010-09-01

Full Text Available Objective – To compare the search performance (i.e., recall and precision of Google Scholar with that of 11 other bibliographic databases when using a keyword search to find references on later-life migration. Design – Comparative database evaluation. Setting – Not stated in the article. It appears from the author’s affiliation that this research took place in an academic institution of higher learning. Subjects – Twelve databases were compared: Google Scholar, Academic Search Elite, AgeLine, ArticleFirst, EconLit, Geobase, Medline, PAIS International, Popline, Social Sciences Abstracts, Social Sciences Citation Index, and SocIndex. Methods – The relevant literature on later-life migration was pre-identified as a set of 155 journal articles published from 1990 to 2000. The author selected these articles from database searches, citation tracking, journal scans, and consultations with social sciences colleagues. Each database was evaluated with regards to its performance in finding references to these 155 papers.Elderly and migration were the keywords used to conduct the searches in each of the 12 databases, since these were the words that were the most frequently used in the titles of the 155 relevant articles. The search was performed in the most basic search interface of each database that allowed limiting results by the needed publication dates (1990-2000. Search results were sorted by relevance when possible (for 9 out of the 12 databases, and by date when the relevance sorting option was not available. Recall and precision statistics were then calculated from the search results. Recall is the number of relevant results obtained in the database for a search topic, divided by all the potential results which can be obtained on that topic (in this case, 155 references. Precision is the number of relevant results obtained in the database for a search topic, divided by the total number of results that were obtained in the database on

Aminopeptidase N is directly sorted to the apical domain in MDCK cells

DEFF Research Database (Denmark)

Wessels, H P; Hansen, Gert Helge; Fuhrer, C

1990-01-01

In different epithelial cell types, integral membrane proteins appear to follow different sorting pathways to the apical surface. In hepatocytes, several apical proteins were shown to be transported there indirectly via the basolateral membrane, whereas in MDCK cells a direct sorting pathway from...

A polynomial-time algorithm to design push plans for sensorless parts sorting

NARCIS (Netherlands)

Berg, de M.; Goaoc, X.; van der Stappen, A.F.

2005-01-01

We consider the efficient computation of sequences of push actions that simultaneously orient two different polygons. Our motivation for studying this problem comes from the observation that appropriately oriented parts admit simple sensorless sorting. We study the sorting of two polygonal parts by

A Low Cost VLSI Architecture for Spike Sorting Based on Feature Extraction with Peak Search

Directory of Open Access Journals (Sweden)

Yuan-Jyun Chang

2016-12-01

Full Text Available The goal of this paper is to present a novel VLSI architecture for spike sorting with high classification accuracy, low area costs and low power consumption. A novel feature extraction algorithm with low computational complexities is proposed for the design of the architecture. In the feature extraction algorithm, a spike is separated into two portions based on its peak value. The area of each portion is then used as a feature. The algorithm is simple to implement and less susceptible to noise interference. Based on the algorithm, a novel architecture capable of identifying peak values and computing spike areas concurrently is proposed. To further accelerate the computation, a spike can be divided into a number of segments for the local feature computation. The local features are subsequently merged with the global ones by a simple hardware circuit. The architecture can also be easily operated in conjunction with the circuits for commonly-used spike detection algorithms, such as the Non-linear Energy Operator (NEO. The architecture has been implemented by an Application-Specific Integrated Circuit (ASIC with 90-nm technology. Comparisons to the existing works show that the proposed architecture is well suited for real-time multi-channel spike detection and feature extraction requiring low hardware area costs, low power consumption and high classification accuracy.

Study on Impact Acoustic-Visual Sensor-Based Sorting of ELV Plastic Materials.

Science.gov (United States)

Huang, Jiu; Tian, Chuyuan; Ren, Jingwei; Bian, Zhengfu

2017-06-08

This paper concentrates on a study of a novel multi-sensor aided method by using acoustic and visual sensors for detection, recognition and separation of End-of Life vehicles' (ELVs) plastic materials, in order to optimize the recycling rate of automotive shredder residues (ASRs). Sensor-based sorting technologies have been utilized for material recycling for the last two decades. One of the problems still remaining results from black and dark dyed plastics which are very difficult to recognize using visual sensors. In this paper a new multi-sensor technology for black plastic recognition and sorting by using impact resonant acoustic emissions (AEs) and laser triangulation scanning was introduced. A pilot sorting system which consists of a 3-dimensional visual sensor and an acoustic sensor was also established; two kinds commonly used vehicle plastics, polypropylene (PP) and acrylonitrile-butadiene-styrene (ABS) and two kinds of modified vehicle plastics, polypropylene/ethylene-propylene-diene-monomer (PP-EPDM) and acrylonitrile-butadiene-styrene/polycarbonate (ABS-PC) were tested. In this study the geometrical features of tested plastic scraps were measured by the visual sensor, and their corresponding impact acoustic emission (AE) signals were acquired by the acoustic sensor. The signal processing and feature extraction of visual data as well as acoustic signals were realized by virtual instruments. Impact acoustic features were recognized by using FFT based power spectral density analysis. The results shows that the characteristics of the tested PP and ABS plastics were totally different, but similar to their respective modified materials. The probability of scrap material recognition rate, i.e., the theoretical sorting efficiency between PP and PP-EPDM, could reach about 50%, and between ABS and ABS-PC it could reach about 75% with diameters ranging from 14 mm to 23 mm, and with exclusion of abnormal impacts, the actual separation rates were 39.2% for PP, 41

The VirusBanker database uses a Java program to allow flexible searching through Bunyaviridae sequences.

Science.gov (United States)

Fourment, Mathieu; Gibbs, Mark J

2008-02-05

Viruses of the Bunyaviridae have segmented negative-stranded RNA genomes and several of them cause significant disease. Many partial sequences have been obtained from the segments so that GenBank searches give complex results. Sequence databases usually use HTML pages to mediate remote sorting, but this approach can be limiting and may discourage a user from exploring a database. The VirusBanker database contains Bunyaviridae sequences and alignments and is presented as two spreadsheets generated by a Java program that interacts with a MySQL database on a server. Sequences are displayed in rows and may be sorted using information that is displayed in columns and includes data relating to the segment, gene, protein, species, strain, sequence length, terminal sequence and date and country of isolation. Bunyaviridae sequences and alignments may be downloaded from the second spreadsheet with titles defined by the user from the columns, or viewed when passed directly to the sequence editor, Jalview. VirusBanker allows large datasets of aligned nucleotide and protein sequences from the Bunyaviridae to be compiled and winnowed rapidly using criteria that are formulated heuristically.

Image analysis to measure sorting and stratification applied to sand-gravel experiments

NARCIS (Netherlands)

Orrú, C.

2016-01-01

The main objective of this project is to develop new measuring techniques for providing detailed data on sediment sorting suitable for sand-gravel laboratory experiments. Such data will be of aid in obtaining new insights on sorting mechanisms and improving prediction capabilities of morphodynamic

Self-sorting of guests and hard blocks in bisurea-based thermoplastic elastomers

NARCIS (Netherlands)

Botterhuis, N.E.; Karthikeyan, S.; Spiering, A.J.H.; Sijbesma, R.P.

2010-01-01

Self-sorting in thermoplastic elastomers was studied using bisurea-based thermoplastic elastomers (TPEs) which are known to form hard blocks via hierarchical aggregation of bisurea segments into ribbons and of ribbons into fibers. Self-sorting of different bisurea hard blocks in mixtures of polymers

Spatial sorting promotes the spread of maladaptive hybridization

Science.gov (United States)

Lowe, Winsor H.; Muhlfeld, Clint C.; Allendorf, Fred W.

2015-01-01

Invasive hybridization is causing loss of biodiversity worldwide. The spread of such introgression can occur even when hybrids have reduced Darwinian fitness, which decreases the frequency of hybrids due to low survival or reproduction through time. This paradox can be partially explained by spatial sorting, where genotypes associated with dispersal increase in frequency at the edge of expansion, fueling further expansion and allowing invasive hybrids to increase in frequency through space rather than time. Furthermore, because all progeny of a hybrid will be hybrids (i.e., will possess genes from both parental taxa), nonnative admixture in invaded populations can increase even when most hybrid progeny do not survive. Broader understanding of spatial sorting is needed to protect native biodiversity.

Colour based sorting station with Matlab simulation

Directory of Open Access Journals (Sweden)

Constantin Victor

2017-01-01

Full Text Available The paper presents the design process and manufacturing elements of a colour-based sorting station. The system is comprised of a gravitational storage, which also contains the colour sensor. Parts are extracted using a linear pneumatic motor and are fed onto an electrically driven conveyor belt. Extraction of the parts is done at 4 points, using two pneumatic motors and a geared DC motor, while the 4th position is at the end of the belt. The mechanical parts of the system are manufactured using 3D printer technology, allowing for easy modification and adaption to the geometry of different parts. The paper shows all of the stages needed to design, optimize, test and implement the proposed solution. System optimization was performed using a graphical Matlab interface which also allows for sorting algorithm optimization.

Efficient Sorting on the Tilera Manycore Architecture

Energy Technology Data Exchange (ETDEWEB)

Morari, Alessandro; Tumeo, Antonino; Villa, Oreste; Secchi, Simone; Valero, Mateo

2012-10-24

e present an efficient implementation of the radix sort algo- rithm for the Tilera TILEPro64 processor. The TILEPro64 is one of the first successful commercial manycore processors. It is com- posed of 64 tiles interconnected through multiple fast Networks- on-chip and features a fully coherent, shared distributed cache. The architecture has a large degree of flexibility, and allows various optimization strategies. We describe how we mapped the algorithm to this architecture. We present an in-depth analysis of the optimizations for each phase of the algorithm with respect to the processor’s sustained performance. We discuss the overall throughput reached by our radix sort implementation (up to 132 MK/s) and show that it provides comparable or better performance-per-watt with respect to state-of-the art implemen- tations on x86 processors and graphic processing units.

Application of sperm sorting and associated reproductive technology for wildlife management and conservation.

Science.gov (United States)

O'Brien, J K; Steinman, K J; Robeck, T R

2009-01-01

Efforts toward the conservation and captive breeding of wildlife can be enhanced by sperm sorting and associated reproductive technologies such as sperm cryopreservation and artificial insemination (AI). Sex ratio management is of particular significance to species which naturally exist in female-dominated social groups. A bias of the sex ratio towards females of these species will greatly assist in maintaining socially cohesive groups and minimizing male-male aggression. Another application of this technology potentially exists for endangered species, as the preferential production of females can enable propagation of those species at a faster rate. The particular assisted reproductive technology (ART) used in conjunction with sperm sorting for the production of offspring is largely determined by the quality and quantity of spermatozoa following sorting and preservation processes. Regardless of the ART selected, breeding decisions involving sex-sorted spermatozoa should be made in conjunction with appropriate genetic management. Zoological-based research on reproductive physiology and assisted reproduction, including sperm sorting, is being conducted on numerous terrestrial and marine mammals. The wildlife species for which the technology has undergone the most advance is the bottlenose dolphin. AI using sex-sorted fresh or frozen-thawed spermatozoa has become a valuable tool for the genetic and reproductive management of captive bottlenose dolphins with six pre-sexed calves, all of the predetermined sex born to date.

Similarity Digest Search: A Survey and Comparative Analysis of Strategies to Perform Known File Filtering Using Approximate Matching

Directory of Open Access Journals (Sweden)

Vitor Hugo Galhardo Moia

2017-01-01

Full Text Available Digital forensics is a branch of Computer Science aiming at investigating and analyzing electronic devices in the search for crime evidence. There are several ways to perform this search. Known File Filter (KFF is one of them, where a list of interest objects is used to reduce/separate data for analysis. Holding a database of hashes of such objects, the examiner performs lookups for matches against the target device. However, due to limitations over hash functions (inability to detect similar objects, new methods have been designed, called approximate matching. This sort of function has interesting characteristics for KFF investigations but suffers mainly from high costs when dealing with huge data sets, as the search is usually done by brute force. To mitigate this problem, strategies have been developed to better perform lookups. In this paper, we present the state of the art of similarity digest search strategies, along with a detailed comparison involving several aspects, as time complexity, memory requirement, and search precision. Our results show that none of the approaches address at least these main aspects. Finally, we discuss future directions and present requirements for a new strategy aiming to fulfill current limitations.

First Dark Matter Search Results from the XENON1T Experiment

Science.gov (United States)

Aprile, E.; Aalbers, J.; Agostini, F.; Alfonsi, M.; Amaro, F. D.; Anthony, M.; Arneodo, F.; Barrow, P.; Baudis, L.; Bauermeister, B.; Benabderrahmane, M. L.; Berger, T.; Breur, P. A.; Brown, A.; Brown, A.; Brown, E.; Bruenner, S.; Bruno, G.; Budnik, R.; Bütikofer, L.; Calvén, J.; Cardoso, J. M. R.; Cervantes, M.; Cichon, D.; Coderre, D.; Colijn, A. P.; Conrad, J.; Cussonneau, J. P.; Decowski, M. P.; de Perio, P.; di Gangi, P.; di Giovanni, A.; Diglio, S.; Eurin, G.; Fei, J.; Ferella, A. D.; Fieguth, A.; Fulgione, W.; Gallo Rosso, A.; Galloway, M.; Gao, F.; Garbini, M.; Gardner, R.; Geis, C.; Goetzke, L. W.; Grandi, L.; Greene, Z.; Grignon, C.; Hasterok, C.; Hogenbirk, E.; Howlett, J.; Itay, R.; Kaminsky, B.; Kazama, S.; Kessler, G.; Kish, A.; Landsman, H.; Lang, R. F.; Lellouch, D.; Levinson, L.; Lin, Q.; Lindemann, S.; Lindner, M.; Lombardi, F.; Lopes, J. A. M.; Manfredini, A.; Mariş, I.; Marrodán Undagoitia, T.; Masbou, J.; Massoli, F. V.; Masson, D.; Mayani, D.; Messina, M.; Micheneau, K.; Molinario, A.; Morâ, K.; Murra, M.; Naganoma, J.; Ni, K.; Oberlack, U.; Pakarha, P.; Pelssers, B.; Persiani, R.; Piastra, F.; Pienaar, J.; Pizzella, V.; Piro, M.-C.; Plante, G.; Priel, N.; Rauch, L.; Reichard, S.; Reuter, C.; Riedel, B.; Rizzo, A.; Rosendahl, S.; Rupp, N.; Saldanha, R.; Dos Santos, J. M. F.; Sartorelli, G.; Scheibelhut, M.; Schindler, S.; Schreiner, J.; Schumann, M.; Scotto Lavina, L.; Selvi, M.; Shagin, P.; Shockley, E.; Silva, M.; Simgen, H.; Sivers, M. V.; Stein, A.; Thapa, S.; Thers, D.; Tiseni, A.; Trinchero, G.; Tunnell, C.; Vargas, M.; Upole, N.; Wang, H.; Wang, Z.; Wei, Y.; Weinheimer, C.; Wulf, J.; Ye, J.; Zhang, Y.; Zhu, T.; Xenon Collaboration

2017-11-01

We report the first dark matter search results from XENON1T, a ˜2000 -kg -target-mass dual-phase (liquid-gas) xenon time projection chamber in operation at the Laboratori Nazionali del Gran Sasso in Italy and the first ton-scale detector of this kind. The blinded search used 34.2 live days of data acquired between November 2016 and January 2017. Inside the (1042 ±12 )-kg fiducial mass and in the [5 ,40 ] keVnr energy range of interest for weakly interacting massive particle (WIMP) dark matter searches, the electronic recoil background was (1.93 ±0.25 )×10-4 events /(kg ×day ×keVee) , the lowest ever achieved in such a dark matter detector. A profile likelihood analysis shows that the data are consistent with the background-only hypothesis. We derive the most stringent exclusion limits on the spin-independent WIMP-nucleon interaction cross section for WIMP masses above 10 GeV /c2 , with a minimum of 7.7 ×10-47 cm2 for 35 -GeV /c2 WIMPs at 90% C.L.

Performance evaluation of PCA-based spike sorting algorithms.

Science.gov (United States)

Adamos, Dimitrios A; Kosmidis, Efstratios K; Theophilidis, George

2008-09-01

Deciphering the electrical activity of individual neurons from multi-unit noisy recordings is critical for understanding complex neural systems. A widely used spike sorting algorithm is being evaluated for single-electrode nerve trunk recordings. The algorithm is based on principal component analysis (PCA) for spike feature extraction. In the neuroscience literature it is generally assumed that the use of the first two or most commonly three principal components is sufficient. We estimate the optimum PCA-based feature space by evaluating the algorithm's performance on simulated series of action potentials. A number of modifications are made to the open source nev2lkit software to enable systematic investigation of the parameter space. We introduce a new metric to define clustering error considering over-clustering more favorable than under-clustering as proposed by experimentalists for our data. Both the program patch and the metric are available online. Correlated and white Gaussian noise processes are superimposed to account for biological and artificial jitter in the recordings. We report that the employment of more than three principal components is in general beneficial for all noise cases considered. Finally, we apply our results to experimental data and verify that the sorting process with four principal components is in agreement with a panel of electrophysiology experts.

The Methods and Goals of Teaching Sorting Algorithms in Public Education

Science.gov (United States)

Bernát, Péter

2014-01-01

The topic of sorting algorithms is a pleasant subject of informatics education. Not only is it so because the notion of sorting is well known from our everyday life, but also because as an algorithm task, whether we expect naive or practical solutions, it is easy to define and demonstrate. In my paper I will present some of the possible methods…

An Efficient Hardware Circuit for Spike Sorting Based on Competitive Learning Networks

Directory of Open Access Journals (Sweden)

Huan-Yuan Chen

2017-09-01

Full Text Available This study aims to present an effective VLSI circuit for multi-channel spike sorting. The circuit supports the spike detection, feature extraction and classification operations. The detection circuit is implemented in accordance with the nonlinear energy operator algorithm. Both the peak detection and area computation operations are adopted for the realization of the hardware architecture for feature extraction. The resulting feature vectors are classified by a circuit for competitive learning (CL neural networks. The CL circuit supports both online training and classification. In the proposed architecture, all the channels share the same detection, feature extraction, learning and classification circuits for a low area cost hardware implementation. The clock-gating technique is also employed for reducing the power dissipation. To evaluate the performance of the architecture, an application-specific integrated circuit (ASIC implementation is presented. Experimental results demonstrate that the proposed circuit exhibits the advantages of a low chip area, a low power dissipation and a high classification success rate for spike sorting.

An Efficient Hardware Circuit for Spike Sorting Based on Competitive Learning Networks

Science.gov (United States)

Chen, Huan-Yuan; Chen, Chih-Chang

2017-01-01

This study aims to present an effective VLSI circuit for multi-channel spike sorting. The circuit supports the spike detection, feature extraction and classification operations. The detection circuit is implemented in accordance with the nonlinear energy operator algorithm. Both the peak detection and area computation operations are adopted for the realization of the hardware architecture for feature extraction. The resulting feature vectors are classified by a circuit for competitive learning (CL) neural networks. The CL circuit supports both online training and classification. In the proposed architecture, all the channels share the same detection, feature extraction, learning and classification circuits for a low area cost hardware implementation. The clock-gating technique is also employed for reducing the power dissipation. To evaluate the performance of the architecture, an application-specific integrated circuit (ASIC) implementation is presented. Experimental results demonstrate that the proposed circuit exhibits the advantages of a low chip area, a low power dissipation and a high classification success rate for spike sorting. PMID:28956859

Mimicking Faraday rotation to sort the orbital angular momentum of light.

Science.gov (United States)

Zhang, Wuhong; Qi, Qianqian; Zhou, Jie; Chen, Lixiang

2014-04-18

The efficient separation of the orbital angular momentum (OAM) is essential to both the classical and quantum applications with twisted photons. Here we devise and demonstrate experimentally an efficient method of mimicking the Faraday rotation to sort the OAM based on the OAM-to-polarization coupling effect induced by a modified Mach-Zehnder interferometer. Our device is capable of sorting the OAM of positive and negative numbers, as well as their mixtures. Furthermore, we report the first experimental demonstration to sort optical vortices of noninteger charges. The possibility of working at the photon-count level is also shown using an electron-multiplying CCD camera. Our scheme holds promise for quantum information applications with single-photon entanglement and for high-capacity communication systems with polarization and OAM multiplexing.

Culture of somatic cells isolated from frozen-thawed equine semen using fluorescence-assisted cell sorting.

Science.gov (United States)

Brom-de-Luna, Joao Gatto; Canesin, Heloísa Siqueira; Wright, Gus; Hinrichs, Katrin

2018-03-01

Nuclear transfer using somatic cells from frozen semen (FzSC) would allow cloning of animals for which no other genetic material is available. Horses are one of the few species for which cloning is commercially feasible; despite this, there is no information available on the culture of equine FzSC. After preliminary trials on equine FzSC, recovered by density-gradient centrifugation, resulted in no growth, we hypothesized that sperm in the culture system negatively affected cell proliferation. Therefore, we evaluated culture of FzSC isolated using fluorescence-assisted cell sorting. In Exp. 1, sperm were labeled using antibodies to a sperm-specific antigen, SP17, and unlabeled cells were collected. This resulted in high sperm contamination. In Exp. 2, FzSC were labeled using an anti-MHC class I antibody. This resulted in an essentially pure population of FzSC, 13-25% of which were nucleated. Culture yielded no proliferation in any of nine replicates. In Exp. 3, 5 × 10 3 viable fresh, cultured horse fibroblasts were added to the frozen-thawed, washed semen, then this suspension was labeled and sorted as for Exp. 2. The enriched population had a mean of five sperm per recovered somatic cell; culture yielded formation of monolayers. In conclusion, an essentially pure population of equine FzSC could be obtained using sorting for presence of MHC class I antigens. No equine FzSC grew in culture; however, the proliferation of fibroblasts subjected to the same processing demonstrated that the labeling and sorting methods, and the presence of few sperm in culture, were compatible with cell viability. Copyright © 2017 Elsevier B.V. All rights reserved.

Integration through a Card-Sort Activity

Science.gov (United States)

Green, Kris; Ricca, Bernard P.

2015-01-01

Learning to compute integrals via the various techniques of integration (e.g., integration by parts, partial fractions, etc.) is difficult for many students. Here, we look at how students in a college level Calculus II course develop the ability to categorize integrals and the difficulties they encounter using a card sort-resort activity. Analysis…

A note on sorting buffrs offline

NARCIS (Netherlands)

Chan, H.L.; Megow, N.; Sitters, R.A.; van Stee, R.

2012-01-01

We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with a random-access buffer of limited capacity which can be used to rearrange items. The problem is to design a scheduling

School accountability Incentives or sorting?

OpenAIRE

Hege Marie Gjefsen; Trude Gunnes

2015-01-01

We exploit a nested school accountability reform to estimate the causal effect on teacher mobility, sorting, and student achievement. In 2003, lower-secondary schools in Oslo became accountable to the school district authority for student achievement. In 2005, information on school performance in lower secondary education also became public. Using a difference-in-difference-in-difference approach, we find a significant increase in teacher mobility and that almost all non-stayers leave the tea...

A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling

Directory of Open Access Journals (Sweden)

Qianwang Deng

2017-01-01

Full Text Available Flexible job-shop scheduling problem (FJSP is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II for multiobjective FJSP (MO-FJSP with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload of all machines. It adopts a two-stage optimization mechanism during the optimizing process. In the first stage, the NSGA-II algorithm with T iteration times is first used to obtain the initial population N, in which a bee evolutionary guiding scheme is presented to exploit the solution space extensively. In the second stage, the NSGA-II algorithm with GEN iteration times is used again to obtain the Pareto-optimal solutions. In order to enhance the searching ability and avoid the premature convergence, an updating mechanism is employed in this stage. More specifically, its population consists of three parts, and each of them changes with the iteration times. What is more, numerical simulations are carried out which are based on some published benchmark instances. Finally, the effectiveness of the proposed BEG-NSGA-II algorithm is shown by comparing the experimental results and the results of some well-known algorithms already existed.

A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling.

Science.gov (United States)

Deng, Qianwang; Gong, Guiliang; Gong, Xuran; Zhang, Like; Liu, Wei; Ren, Qinghua

2017-01-01

Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload of all machines. It adopts a two-stage optimization mechanism during the optimizing process. In the first stage, the NSGA-II algorithm with T iteration times is first used to obtain the initial population N , in which a bee evolutionary guiding scheme is presented to exploit the solution space extensively. In the second stage, the NSGA-II algorithm with GEN iteration times is used again to obtain the Pareto-optimal solutions. In order to enhance the searching ability and avoid the premature convergence, an updating mechanism is employed in this stage. More specifically, its population consists of three parts, and each of them changes with the iteration times. What is more, numerical simulations are carried out which are based on some published benchmark instances. Finally, the effectiveness of the proposed BEG-NSGA-II algorithm is shown by comparing the experimental results and the results of some well-known algorithms already existed.

AMDLIBGZ, IBM 360 Subroutine Library for Data Processing, Graphics, Sorting

International Nuclear Information System (INIS)

Wang, Jesse Y.

1980-01-01

Description of problem or function: AMDLIBGZ is a subset of the IBM 360 Subroutine Library at the Applied Mathematics Division at Argonne National Laboratory. This subset includes library categories G-Z: Identification/Description: G552S F RANF: Random number generator; J952S F YOLYPLOT: CalComp plots; J955S P GRAF: Prints a graph of points on line printer; K250S A1: Core to core conversion; K251S A HEXINP: Hexadecimal input for PL/I programs; K252S A HEXOUT: Hexadecimal output conv. PL/I programs; M101S F SORT: Algebraic sort; M150S F CSORT: Algebraic sort; M151S P2 ANLKWIC: KWIC sort; M250S A SMALLIST: Squeezes assembler listing to 8 x 11; N251S A ABEND: Calls ABEND dump; Q052S A CLOCK: Time; Q053S A COPYAGO: Copy load module from tape to disk; Q054S A DATE: Current date in form MM/DD/YY; Q055S A TIME: Time (24 hour clock) in EBCDIC HH.MM.SS; Z013S F: Variable metric minimization; Z057S A LOCF: Locate machine addresses of variables; Z071S A ALLOC: Allocate LCS for FORTRAN programs; Z074S A ANLMNP: Exponent and mantissa manipulative functs.

Search Results | Page 7 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

2013-11-06

Nov 6, 2013 ... Mobile Nav Footer Links. Careers · Contact Us · Subscribe · Unsubscribe · Copyright · Open Access Policy · Privacy Policy · Research Ethics · Transparency · Website/Usage. Search. Home · South of Sahara; Cameroon ...

STEPS: a grid search methodology for optimized peptide identification filtering of MS/MS database search results.

Science.gov (United States)

Piehowski, Paul D; Petyuk, Vladislav A; Sandoval, John D; Burnum, Kristin E; Kiebel, Gary R; Monroe, Matthew E; Anderson, Gordon A; Camp, David G; Smith, Richard D

2013-03-01

For bottom-up proteomics, there are wide variety of database-searching algorithms in use for matching peptide sequences to tandem MS spectra. Likewise, there are numerous strategies being employed to produce a confident list of peptide identifications from the different search algorithm outputs. Here we introduce a grid-search approach for determining optimal database filtering criteria in shotgun proteomics data analyses that is easily adaptable to any search. Systematic Trial and Error Parameter Selection--referred to as STEPS--utilizes user-defined parameter ranges to test a wide array of parameter combinations to arrive at an optimal "parameter set" for data filtering, thus maximizing confident identifications. The benefits of this approach in terms of numbers of true-positive identifications are demonstrated using datasets derived from immunoaffinity-depleted blood serum and a bacterial cell lysate, two common proteomics sample types. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Smoothsort, an alternative for sorting in situ

NARCIS (Netherlands)

Dijkstra, E.W.

1982-01-01

Like heapsort - which inspired it - smoothsort is an algorithm for sorting in situ. It is of order N · log N in the worst case, but of order N in the best case, with a smooth transition between the two. (Hence its name.)

In-flight Sorting of BNNTs by Aspect Ratio

Data.gov (United States)

National Aeronautics and Space Administration — The key technical challenges are: (a) mechanical sorting is ineffective for nanoscale product, (b) BNNTs are non-conductive and the agglomeration tendency is strong,...

Sorting points into neighborhoods (SPIN): data analysis and visualization by ordering distance matrices.

Science.gov (United States)

Tsafrir, D; Tsafrir, I; Ein-Dor, L; Zuk, O; Notterman, D A; Domany, E

2005-05-15

We introduce a novel unsupervised approach for the organization and visualization of multidimensional data. At the heart of the method is a presentation of the full pairwise distance matrix of the data points, viewed in pseudocolor. The ordering of points is iteratively permuted in search of a linear ordering, which can be used to study embedded shapes. Several examples indicate how the shapes of certain structures in the data (elongated, circular and compact) manifest themselves visually in our permuted distance matrix. It is important to identify the elongated objects since they are often associated with a set of hidden variables, underlying continuous variation in the data. The problem of determining an optimal linear ordering is shown to be NP-Complete, and therefore an iterative search algorithm with O(n3) step-complexity is suggested. By using sorting points into neighborhoods, i.e. SPIN to analyze colon cancer expression data we were able to address the serious problem of sample heterogeneity, which hinders identification of metastasis related genes in our data. Our methodology brings to light the continuous variation of heterogeneity--starting with homogeneous tumor samples and gradually increasing the amount of another tissue. Ordering the samples according to their degree of contamination by unrelated tissue allows the separation of genes associated with irrelevant contamination from those related to cancer progression. Software package will be available for academic users upon request.

Event displays and plots of latest results from ATLAS Higgs Search

CERN Multimedia

ATLAS, collaboration

2012-01-01

On 4 July, 2012, the ATLAS experiment presented a preview of its updated results on the search for the Higgs Boson. The results were shown at a seminar held jointly at CERN and via video link at ICHEP 2012, the International Conference for High Energy Physics in Melbourne, Australia, where detailed analyses will be presented later this week. More information at http://atlas.cern

System for optical sorting of microscopic objects

DEFF Research Database (Denmark)

2014-01-01

The present invention relates to a system for optical sorting of microscopic objects and corresponding method. An optical detection system (52) is capable of determining the positions of said first and/or said second objects. One or more force transfer units (200, 205, 210, 215) are placed...... in a first reservoir, the one or more force units being suitable for optical momentum transfer. An electromagnetic radiation source (42) yields a radiation beam (31, 32) capable of optically displacing the force transfer units from one position to another within the first reservoir (1R). The force transfer...... units are displaced from positions away from the first objects to positions close to the first objects, and then displacing the first objects via a contact force (300) between the first objects and the force transfer units facilitates an optical sorting of the first objects and the second objects....

Size-based sorting of micro-particles using microbubble streaming

Science.gov (United States)

Wang, Cheng; Jalikop, Shreyas; Hilgenfeldt, Sascha

2009-11-01

Oscillating microbubbles driven by ultrasound have shown great potential in microfluidic applications, such as transporting particles and promoting mixing [1-3]. The oscillations generate secondary steady streaming that can also trap particles. We use the streaming to develop a method of sorting particles of different sizes in an initially well-mixed solution. The solution is fed into a channel consisting of bubbles placed periodically along a side wall. When the bubbles are excited by an ultrasound piezo-electric transducer to produce steady streaming, the flow field is altered by the presence of the particles. This effect is dependent on particle size and results in size-based sorting of the particles. The effectiveness of the separation depends on the dimensions of the bubbles and particles as well as on the ultrasound frequency. Our experimental studies are aimed at a better understanding of the design and control of effective microfluidic separating devices. Ref: [1] P. Marmottant and S. Hilgenfeldt, Nature 423, 153 (2003). [2] P. Marmottant and S. Hilgenfeldt, Proc. Natl. Acad. Science USA, 101, 9523 (2004). [3] P. Marmottant, J.-P. Raven, H. Gardeniers, J. G. Bomer, and S. Hilgenfeldt, J. Fluid Mech., vol.568, 109 (2006).

FISHIS: fluorescence in situ hybridization in suspension and chromosome flow sorting made easy.

Directory of Open Access Journals (Sweden)

Debora Giorgi

Full Text Available The large size and complex polyploid nature of many genomes has often hampered genomics development, as is the case for several plants of high agronomic value. Isolating single chromosomes or chromosome arms via flow sorting offers a clue to resolve such complexity by focusing sequencing to a discrete and self-consistent part of the whole genome. The occurrence of sufficient differences in the size and or base-pair composition of the individual chromosomes, which is uncommon in plants, is critical for the success of flow sorting. We overcome this limitation by developing a robust method for labeling isolated chromosomes, named Fluorescent In situ Hybridization In suspension (FISHIS. FISHIS employs fluorescently labeled synthetic repetitive DNA probes, which are hybridized, in a wash-less procedure, to chromosomes in suspension following DNA alkaline denaturation. All typical A, B and D genomes of wheat, as well as individual chromosomes from pasta (T. durum L. and bread (T. aestivum L. wheat, were flow-sorted, after FISHIS, at high purity. For the first time in eukaryotes, each individual chromosome of a diploid organism, Dasypyrum villosum (L. Candargy, was flow-sorted regardless of its size or base-pair related content. FISHIS-based chromosome sorting is a powerful and innovative flow cytogenetic tool which can develop new genomic resources from each plant species, where microsatellite DNA probes are available and high quality chromosome suspensions could be produced. The joining of FISHIS labeling and flow sorting with the Next Generation Sequencing methodology will enforce genomics for more species, and by this mightier chromosome approach it will be possible to increase our knowledge about structure, evolution and function of plant genome to be used for crop improvement. It is also anticipated that this technique could contribute to analyze and sort animal chromosomes with peculiar cytogenetic abnormalities, such as copy number variations

FISHIS: fluorescence in situ hybridization in suspension and chromosome flow sorting made easy.

Science.gov (United States)

Giorgi, Debora; Farina, Anna; Grosso, Valentina; Gennaro, Andrea; Ceoloni, Carla; Lucretti, Sergio

2013-01-01

The large size and complex polyploid nature of many genomes has often hampered genomics development, as is the case for several plants of high agronomic value. Isolating single chromosomes or chromosome arms via flow sorting offers a clue to resolve such complexity by focusing sequencing to a discrete and self-consistent part of the whole genome. The occurrence of sufficient differences in the size and or base-pair composition of the individual chromosomes, which is uncommon in plants, is critical for the success of flow sorting. We overcome this limitation by developing a robust method for labeling isolated chromosomes, named Fluorescent In situ Hybridization In suspension (FISHIS). FISHIS employs fluorescently labeled synthetic repetitive DNA probes, which are hybridized, in a wash-less procedure, to chromosomes in suspension following DNA alkaline denaturation. All typical A, B and D genomes of wheat, as well as individual chromosomes from pasta (T. durum L.) and bread (T. aestivum L.) wheat, were flow-sorted, after FISHIS, at high purity. For the first time in eukaryotes, each individual chromosome of a diploid organism, Dasypyrum villosum (L.) Candargy, was flow-sorted regardless of its size or base-pair related content. FISHIS-based chromosome sorting is a powerful and innovative flow cytogenetic tool which can develop new genomic resources from each plant species, where microsatellite DNA probes are available and high quality chromosome suspensions could be produced. The joining of FISHIS labeling and flow sorting with the Next Generation Sequencing methodology will enforce genomics for more species, and by this mightier chromosome approach it will be possible to increase our knowledge about structure, evolution and function of plant genome to be used for crop improvement. It is also anticipated that this technique could contribute to analyze and sort animal chromosomes with peculiar cytogenetic abnormalities, such as copy number variations or cytogenetic

Size and density sorting of dust grains in SPH simulations of protoplanetary discs

Science.gov (United States)

Pignatale, F. C.; Gonzalez, J.-F.; Cuello, Nicolas; Bourdon, Bernard; Fitoussi, Caroline

2017-07-01

The size and density of dust grains determine their response to gas drag in protoplanetary discs. Aerodynamical (size × density) sorting is one of the proposed mechanisms to explain the grain properties and chemical fractionation of chondrites. However, the efficiency of aerodynamical sorting and the location in the disc in which it could occur are still unknown. Although the effects of grain sizes and growth in discs have been widely studied, a simultaneous analysis including dust composition is missing. In this work, we present the dynamical evolution and growth of multicomponent dust in a protoplanetary disc using a 3D, two-fluid (gas+dust) smoothed particle hydrodynamics code. We find that the dust vertical settling is characterized by two phases: a density-driven phase that leads to a vertical chemical sorting of dust and a size-driven phase that enhances the amount of lighter material in the mid-plane. We also see an efficient radial chemical sorting of the dust at large scales. We find that dust particles are aerodynamically sorted in the inner disc. The disc becomes sub-solar in its Fe/Si ratio on the surface since the early stage of evolution but sub-solar Fe/Si can be also found in the outer disc-mid-plane at late stages. Aggregates in the disc mimic the physical and chemical properties of chondrites, suggesting that aerodynamical sorting played an important role in determining their final structure.

A new technology for automatic identification and sorting of plastics for recycling.

Science.gov (United States)

Ahmad, S R

2004-10-01

A new technology for automatic sorting of plastics, based upon optical identification of fluorescence signatures of dyes, incorporated in such materials in trace concentrations prior to product manufacturing, is described. Three commercial tracers were selected primarily on the basis of their good absorbency in the 310-370 nm spectral band and their identifiable narrow-band fluorescence signatures in the visible band of the spectrum when present in binary combinations. This absorption band was selected because of the availability of strong emission lines in this band from a commercial Hg-arc lamp and high fluorescence quantum yields of the tracers at this excitation wavelength band. The plastics chosen for tracing and identification are HDPE, LDPE, PP, EVA, PVC and PET and the tracers were compatible and chemically non-reactive with the host matrices and did not affect the transparency of the plastics. The design of a monochromatic and collimated excitation source, the sensor system are described and their performances in identifying and sorting plastics doped with tracers at a few parts per million concentration levels are evaluated. In an industrial sorting system, the sensor was able to sort 300 mm long plastic bottles at a conveyor belt speed of 3.5 m.sec(-1) with a sorting purity of -95%. The limitation was imposed due to mechanical singulation irregularities at high speed and the limited processing speed of the computer used.

76 FR 82279 - Electronic Delivery of Search Results From the United States Patent and Trademark Office to the...

Science.gov (United States)

2011-12-30

...] Electronic Delivery of Search Results From the United States Patent and Trademark Office to the European... United States Patent and Trademark Office (USPTO) has recently begun electronic delivery of search... the search results from a previously filed patent application to which the European patent application...

Unified selective sorting approach to analyse multi-electrode extracellular data

Science.gov (United States)

Veerabhadrappa, R.; Lim, C. P.; Nguyen, T. T.; Berk, M.; Tye, S. J.; Monaghan, P.; Nahavandi, S.; Bhatti, A.

2016-01-01

Extracellular data analysis has become a quintessential method for understanding the neurophysiological responses to stimuli. This demands stringent techniques owing to the complicated nature of the recording environment. In this paper, we highlight the challenges in extracellular multi-electrode recording and data analysis as well as the limitations pertaining to some of the currently employed methodologies. To address some of the challenges, we present a unified algorithm in the form of selective sorting. Selective sorting is modelled around hypothesized generative model, which addresses the natural phenomena of spikes triggered by an intricate neuronal population. The algorithm incorporates Cepstrum of Bispectrum, ad hoc clustering algorithms, wavelet transforms, least square and correlation concepts which strategically tailors a sequence to characterize and form distinctive clusters. Additionally, we demonstrate the influence of noise modelled wavelets to sort overlapping spikes. The algorithm is evaluated using both raw and synthesized data sets with different levels of complexity and the performances are tabulated for comparison using widely accepted qualitative and quantitative indicators. PMID:27339770

Heavy mineral sorting in downwards injected Palaeocene sandstone, Siri Canyon, Danish North Sea

DEFF Research Database (Denmark)

Kazerouni, Afsoon Moatari; Friis, Henrik; Svendsen, Johan Byskov

2011-01-01

Post-depositional remobilization and injection of sand are often seen in deep-water clastic systems and has been recently recognised as a significant modifier of deep-water sandstone geometry. Large-scale injectite complexes have been interpreted from borehole data in the Palaeocene Siri Canyon...... of depositional structures in deep-water sandstones, the distinction between "in situ" and injected or remobilised sandstones is often ambiguous. Large scale heavy mineral sorting (in 10 m thick units) is observed in several reservoir units in the Siri Canyon and has been interpreted to represent the depositional...... sorting. In this study we describe an example of effective shear-zone sorting of heavy minerals in a thin downward injected sandstone dyke which was encountered in one of the cores in the Cecilie Field, Siri Canyon. Differences in sorting pattern of heavy minerals are suggested as a tool for petrographic...

How to develop a Standard Operating Procedure for sorting unfixed cells

Science.gov (United States)

Schmid, Ingrid

2012-01-01

Written Standard Operating Procedures (SOPs) are an important tool to assure that recurring tasks in a laboratory are performed in a consistent manner. When the procedure covered in the SOP involves a high-risk activity such as sorting unfixed cells using a jet-in-air sorter, safety elements are critical components of the document. The details on sort sample handling, sorter set-up, validation, operation, troubleshooting, and maintenance, personal protective equipment (PPE), and operator training, outlined in the SOP are to be based on careful risk assessment of the procedure. This review provides background information on the hazards associated with sorting of unfixed cells and the process used to arrive at the appropriate combination of facility design, instrument placement, safety equipment, and practices to be followed. PMID:22381383

How to develop a standard operating procedure for sorting unfixed cells.

Science.gov (United States)

Schmid, Ingrid

2012-07-01

Written standard operating procedures (SOPs) are an important tool to assure that recurring tasks in a laboratory are performed in a consistent manner. When the procedure covered in the SOP involves a high-risk activity such as sorting unfixed cells using a jet-in-air sorter, safety elements are critical components of the document. The details on sort sample handling, sorter set-up, validation, operation, troubleshooting, and maintenance, personal protective equipment (PPE), and operator training, outlined in the SOP are to be based on careful risk assessment of the procedure. This review provides background information on the hazards associated with sorting of unfixed cells and the process used to arrive at the appropriate combination of facility design, instrument placement, safety equipment, and practices to be followed. Copyright © 2012 Elsevier Inc. All rights reserved.

TECHNICAL EQUIPMENT FOR SORTING APPLES BY SIZE

Directory of Open Access Journals (Sweden)

Vasilica Ştefan

2012-01-01

Full Text Available Need to increase the competitiveness of semi-subsistence farms, by valorisation of the fruits, led to research for designing of an equipment for sorting apples by size, in order to meet market requirement, pricing according to the size of the fruits.

First Dark Matter Search Results from the XENON1T Experiment.

Science.gov (United States)

Aprile, E; Aalbers, J; Agostini, F; Alfonsi, M; Amaro, F D; Anthony, M; Arneodo, F; Barrow, P; Baudis, L; Bauermeister, B; Benabderrahmane, M L; Berger, T; Breur, P A; Brown, A; Brown, A; Brown, E; Bruenner, S; Bruno, G; Budnik, R; Bütikofer, L; Calvén, J; Cardoso, J M R; Cervantes, M; Cichon, D; Coderre, D; Colijn, A P; Conrad, J; Cussonneau, J P; Decowski, M P; de Perio, P; Di Gangi, P; Di Giovanni, A; Diglio, S; Eurin, G; Fei, J; Ferella, A D; Fieguth, A; Fulgione, W; Gallo Rosso, A; Galloway, M; Gao, F; Garbini, M; Gardner, R; Geis, C; Goetzke, L W; Grandi, L; Greene, Z; Grignon, C; Hasterok, C; Hogenbirk, E; Howlett, J; Itay, R; Kaminsky, B; Kazama, S; Kessler, G; Kish, A; Landsman, H; Lang, R F; Lellouch, D; Levinson, L; Lin, Q; Lindemann, S; Lindner, M; Lombardi, F; Lopes, J A M; Manfredini, A; Mariş, I; Marrodán Undagoitia, T; Masbou, J; Massoli, F V; Masson, D; Mayani, D; Messina, M; Micheneau, K; Molinario, A; Morå, K; Murra, M; Naganoma, J; Ni, K; Oberlack, U; Pakarha, P; Pelssers, B; Persiani, R; Piastra, F; Pienaar, J; Pizzella, V; Piro, M-C; Plante, G; Priel, N; Rauch, L; Reichard, S; Reuter, C; Riedel, B; Rizzo, A; Rosendahl, S; Rupp, N; Saldanha, R; Dos Santos, J M F; Sartorelli, G; Scheibelhut, M; Schindler, S; Schreiner, J; Schumann, M; Scotto Lavina, L; Selvi, M; Shagin, P; Shockley, E; Silva, M; Simgen, H; Sivers, M V; Stein, A; Thapa, S; Thers, D; Tiseni, A; Trinchero, G; Tunnell, C; Vargas, M; Upole, N; Wang, H; Wang, Z; Wei, Y; Weinheimer, C; Wulf, J; Ye, J; Zhang, Y; Zhu, T

2017-11-03

We report the first dark matter search results from XENON1T, a ∼2000-kg-target-mass dual-phase (liquid-gas) xenon time projection chamber in operation at the Laboratori Nazionali del Gran Sasso in Italy and the first ton-scale detector of this kind. The blinded search used 34.2 live days of data acquired between November 2016 and January 2017. Inside the (1042±12)-kg fiducial mass and in the [5,40]  keV_{nr} energy range of interest for weakly interacting massive particle (WIMP) dark matter searches, the electronic recoil background was (1.93±0.25)×10^{-4}  events/(kg×day×keV_{ee}), the lowest ever achieved in such a dark matter detector. A profile likelihood analysis shows that the data are consistent with the background-only hypothesis. We derive the most stringent exclusion limits on the spin-independent WIMP-nucleon interaction cross section for WIMP masses above 10  GeV/c^{2}, with a minimum of 7.7×10^{-47}  cm^{2} for 35-GeV/c^{2} WIMPs at 90% C.L.

Protein-Level Integration Strategy of Multiengine MS Spectra Search Results for Higher Confidence and Sequence Coverage.

Science.gov (United States)

Zhao, Panpan; Zhong, Jiayong; Liu, Wanting; Zhao, Jing; Zhang, Gong

2017-12-01

Multiple search engines based on various models have been developed to search MS/MS spectra against a reference database, providing different results for the same data set. How to integrate these results efficiently with minimal compromise on false discoveries is an open question due to the lack of an independent, reliable, and highly sensitive standard. We took the advantage of the translating mRNA sequencing (RNC-seq) result as a standard to evaluate the integration strategies of the protein identifications from various search engines. We used seven mainstream search engines (Andromeda, Mascot, OMSSA, X!Tandem, pFind, InsPecT, and ProVerB) to search the same label-free MS data sets of human cell lines Hep3B, MHCCLM3, and MHCC97H from the Chinese C-HPP Consortium for Chromosomes 1, 8, and 20. As expected, the union of seven engines resulted in a boosted false identification, whereas the intersection of seven engines remarkably decreased the identification power. We found that identifications of at least two out of seven engines resulted in maximizing the protein identification power while minimizing the ratio of suspicious/translation-supported identifications (STR), as monitored by our STR index, based on RNC-Seq. Furthermore, this strategy also significantly improves the peptides coverage of the protein amino acid sequence. In summary, we demonstrated a simple strategy to significantly improve the performance for shotgun mass spectrometry by protein-level integrating multiple search engines, maximizing the utilization of the current MS spectra without additional experimental work.

Tag-Based Social Image Search: Toward Relevant and Diverse Results

Science.gov (United States)

Yang, Kuiyuan; Wang, Meng; Hua, Xian-Sheng; Zhang, Hong-Jiang

Recent years have witnessed a great success of social media websites. Tag-based image search is an important approach to access the image content of interest on these websites. However, the existing ranking methods for tag-based image search frequently return results that are irrelevant or lack of diversity. This chapter presents a diverse relevance ranking scheme which simultaneously takes relevance and diversity into account by exploring the content of images and their associated tags. First, it estimates the relevance scores of images with respect to the query term based on both visual information of images and semantic information of associated tags. Then semantic similarities of social images are estimated based on their tags. Based on the relevance scores and the similarities, the ranking list is generated by a greedy ordering algorithm which optimizes Average Diverse Precision (ADP), a novel measure that is extended from the conventional Average Precision (AP). Comprehensive experiments and user studies demonstrate the effectiveness of the approach.

Magnetic measurement, sorting optimization and adjustment of SDUV-FEL hybrid undulator

International Nuclear Information System (INIS)

Wang Tao; Jia Qika

2007-01-01

Construction of an undulator includes magnet block measurement, sorting, field measurement and adjustment. Optimizing SDUV-FEL undulator by simulated annealing algorithm using measurement results of the magnet blocks by Helmholtz coil before installing undulator magnets, the cost function can be reduced by three orders of magnitude. The practical parameters of one segment meet the design specifications after adjusting the magnetic field. (authors)

Raman tweezers in microfluidic systems for analysis and sorting of living cells

Science.gov (United States)

Pilát, Zdeněk.; Ježek, Jan; Kaňka, Jan; Zemánek, Pavel

2014-12-01

We have devised an analytical and sorting system combining optical trapping with Raman spectroscopy in microfluidic environment, dedicated to identification and sorting of biological objects, such as living cells of various unicellular organisms. Our main goal was to create a robust and universal platform for non-destructive and non-contact sorting of micro-objects based on their Raman spectral properties. This approach allowed us to collect spectra containing information about the chemical composition of the objects, such as the presence and composition of pigments, lipids, proteins, or nucleic acids, avoiding artificial chemical probes such as fluorescent markers. The non-destructive nature of this optical analysis and manipulation allowed us to separate individual living cells of our interest in a sterile environment and provided the possibility to cultivate the selected cells for further experiments. We used a mixture of polystyrene micro-particles and algal cells to test and demonstrate the function of our analytical and sorting system. The devised system could find its use in many medical, biotechnological, and biological applications.

New designs in the reconstruction of coke-sorting systems

Energy Technology Data Exchange (ETDEWEB)

A.S. Larin; V.V. Demenko; V.L. Voitanik [Giprokoks, the State Institute for the Design of Coke-Industry Enterprises, Kharkov (Ukraine)

2009-07-15

In recent Giprokoks designs for the reconstruction of coke-sorting systems, high-productivity vibrational-inertial screens have been employed. This permits single-stage screening and reduction in capital and especially operating expenditures, without loss of coke quality. In two-stage screening, >80 mm coke (for foundry needs) is additionally separated, with significant improvement in quality of the metallurgical coke (25-80 mm). New designs for the reconstruction of coke-sorting systems employ mechanical treatment of the coke outside the furnace, which offers new scope for stabilization of coke quality and permits considerable improvement in mechanical strength and granulometric composition of the coke by mechanical crushing.

PLAN: a web platform for automating high-throughput BLAST searches and for managing and mining results

Directory of Open Access Journals (Sweden)

Zhao Xuechun

2007-02-01

Full Text Available Abstract Background BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating unknown sequences, investigating gene models and comparing two sequence sets. Advances in sequencing technologies pose challenges for high-throughput analysis of large-scale sequence data. A number of programs and hardware solutions exist for efficient BLAST searching, but there is a lack of generic software solutions for mining and personalized management of the results. Systematically reviewing the results and identifying information of interest remains tedious and time-consuming. Results Personal BLAST Navigator (PLAN is a versatile web platform that helps users to carry out various personalized pre- and post-BLAST tasks, including: (1 query and target sequence database management, (2 automated high-throughput BLAST searching, (3 indexing and searching of results, (4 filtering results online, (5 managing results of personal interest in favorite categories, (6 automated sequence annotation (such as NCBI NR and ontology-based annotation. PLAN integrates, by default, the Decypher hardware-based BLAST solution provided by Active Motif Inc. with a greatly improved efficiency over conventional BLAST software. BLAST results are visualized by spreadsheets and graphs and are full-text searchable. BLAST results and sequence annotations can be exported, in part or in full, in various formats including Microsoft Excel and FASTA. Sequences and BLAST results are organized in projects, the data publication levels of which are controlled by the registered project owners. In addition, all analytical functions are provided to public users without registration. Conclusion PLAN has proved a valuable addition to the community for automated high-throughput BLAST searches, and, more importantly, for knowledge discovery, management and sharing based on sequence alignment results

Personalized Search

CERN Document Server

AUTHOR|(SzGeCERN)749939

2015-01-01

As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

Restricted DCJ-indel model: sorting linear genomes with DCJ and indels

Science.gov (United States)

2012-01-01

Background The double-cut-and-join (DCJ) is a model that is able to efficiently sort a genome into another, generalizing the typical mutations (inversions, fusions, fissions, translocations) to which genomes are subject, but allowing the existence of circular chromosomes at the intermediate steps. In the general model many circular chromosomes can coexist in some intermediate step. However, when the compared genomes are linear, it is more plausible to use the so-called restricted DCJ model, in which we proceed the reincorporation of a circular chromosome immediately after its creation. These two consecutive DCJ operations, which create and reincorporate a circular chromosome, mimic a transposition or a block-interchange. When the compared genomes have the same content, it is known that the genomic distance for the restricted DCJ model is the same as the distance for the general model. If the genomes have unequal contents, in addition to DCJ it is necessary to consider indels, which are insertions and deletions of DNA segments. Linear time algorithms were proposed to compute the distance and to find a sorting scenario in a general, unrestricted DCJ-indel model that considers DCJ and indels. Results In the present work we consider the restricted DCJ-indel model for sorting linear genomes with unequal contents. We allow DCJ operations and indels with the following constraint: if a circular chromosome is created by a DCJ, it has to be reincorporated in the next step (no other DCJ or indel can be applied between the creation and the reincorporation of a circular chromosome). We then develop a sorting algorithm and give a tight upper bound for the restricted DCJ-indel distance. Conclusions We have given a tight upper bound for the restricted DCJ-indel distance. The question whether this bound can be reduced so that both the general and the restricted DCJ-indel distances are equal remains open. PMID:23281630

A Novel and Simple Spike Sorting Implementation.

Science.gov (United States)

Petrantonakis, Panagiotis C; Poirazi, Panayiota

2017-04-01

Monitoring the activity of multiple, individual neurons that fire spikes in the vicinity of an electrode, namely perform a Spike Sorting (SS) procedure, comprises one of the most important tools for contemporary neuroscience in order to reverse-engineer the brain. As recording electrodes' technology rabidly evolves by integrating thousands of electrodes in a confined spatial setting, the algorithms that are used to monitor individual neurons from recorded signals have to become even more reliable and computationally efficient. In this work, we propose a novel framework of the SS approach in which a single-step processing of the raw (unfiltered) extracellular signal is sufficient for both the detection and sorting of the activity of individual neurons. Despite its simplicity, the proposed approach exhibits comparable performance with state-of-the-art approaches, especially for spike detection in noisy signals, and paves the way for a new family of SS algorithms with the potential for multi-recording, fast, on-chip implementations.

A real time sorting algorithm to time sort any deterministic time disordered data stream

Science.gov (United States)

Saini, J.; Mandal, S.; Chakrabarti, A.; Chattopadhyay, S.

2017-12-01

In new generation high intensity high energy physics experiments, millions of free streaming high rate data sources are to be readout. Free streaming data with associated time-stamp can only be controlled by thresholds as there is no trigger information available for the readout. Therefore, these readouts are prone to collect large amount of noise and unwanted data. For this reason, these experiments can have output data rate of several orders of magnitude higher than the useful signal data rate. It is therefore necessary to perform online processing of the data to extract useful information from the full data set. Without trigger information, pre-processing on the free streaming data can only be done with time based correlation among the data set. Multiple data sources have different path delays and bandwidth utilizations and therefore the unsorted merged data requires significant computational efforts for real time manifestation of sorting before analysis. Present work reports a new high speed scalable data stream sorting algorithm with its architectural design, verified through Field programmable Gate Array (FPGA) based hardware simulation. Realistic time based simulated data likely to be collected in an high energy physics experiment have been used to study the performance of the algorithm. The proposed algorithm uses parallel read-write blocks with added memory management and zero suppression features to make it efficient for high rate data-streams. This algorithm is best suited for online data streams with deterministic time disorder/unsorting on FPGA like hardware.

The effect of transverse bed slope and sediment mobility on bend sorting

NARCIS (Netherlands)

Weisscher, S.A.H.; Baar, A.W.; Uijttewaal, W.S.J.; Kleinhans, MG

2017-01-01

Lateral sorting (= bend sorting) is observed in  natural meanders, where the inner and outer  bend are fairly fine and coarse, respectively  (e.g. Julien and Anthony, 2002; Clayton and  Pitlick, 2007). This is caused by the mass  differences between grains on a

Annotating images by mining image search results

NARCIS (Netherlands)

Wang, X.J.; Zhang, L.; Li, X.; Ma, W.Y.

2008-01-01

Although it has been studied for years by the computer vision and machine learning communities, image annotation is still far from practical. In this paper, we propose a novel attempt at model-free image annotation, which is a data-driven approach that annotates images by mining their search

Robust spike sorting of retinal ganglion cells tuned to spot stimuli.

Science.gov (United States)

Ghahari, Alireza; Badea, Tudor C

2016-08-01

We propose an automatic spike sorting approach for the data recorded from a microelectrode array during visual stimulation of wild type retinas with tiled spot stimuli. The approach first detects individual spikes per electrode by their signature local minima. With the mixture probability distribution of the local minima estimated afterwards, it applies a minimum-squared-error clustering algorithm to sort the spikes into different clusters. A template waveform for each cluster per electrode is defined, and a number of reliability tests are performed on it and its corresponding spikes. Finally, a divisive hierarchical clustering algorithm is used to deal with the correlated templates per cluster type across all the electrodes. According to the measures of performance of the spike sorting approach, it is robust even in the cases of recordings with low signal-to-noise ratio.

Past, present and future of spike sorting techniques.

Science.gov (United States)

Rey, Hernan Gonzalo; Pedreira, Carlos; Quian Quiroga, Rodrigo

2015-10-01

Spike sorting is a crucial step to extract information from extracellular recordings. With new recording opportunities provided by the development of new electrodes that allow monitoring hundreds of neurons simultaneously, the scenario for the new generation of algorithms is both exciting and challenging. However, this will require a new approach to the problem and the development of a common reference framework to quickly assess the performance of new algorithms. In this work, we review the basic concepts of spike sorting, including the requirements for different applications, together with the problems faced by presently available algorithms. We conclude by proposing a roadmap stressing the crucial points to be addressed to support the neuroscientific research of the near future. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

PLAN: a web platform for automating high-throughput BLAST searches and for managing and mining results.

Science.gov (United States)

He, Ji; Dai, Xinbin; Zhao, Xuechun

2007-02-09

BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating unknown sequences, investigating gene models and comparing two sequence sets. Advances in sequencing technologies pose challenges for high-throughput analysis of large-scale sequence data. A number of programs and hardware solutions exist for efficient BLAST searching, but there is a lack of generic software solutions for mining and personalized management of the results. Systematically reviewing the results and identifying information of interest remains tedious and time-consuming. Personal BLAST Navigator (PLAN) is a versatile web platform that helps users to carry out various personalized pre- and post-BLAST tasks, including: (1) query and target sequence database management, (2) automated high-throughput BLAST searching, (3) indexing and searching of results, (4) filtering results online, (5) managing results of personal interest in favorite categories, (6) automated sequence annotation (such as NCBI NR and ontology-based annotation). PLAN integrates, by default, the Decypher hardware-based BLAST solution provided by Active Motif Inc. with a greatly improved efficiency over conventional BLAST software. BLAST results are visualized by spreadsheets and graphs and are full-text searchable. BLAST results and sequence annotations can be exported, in part or in full, in various formats including Microsoft Excel and FASTA. Sequences and BLAST results are organized in projects, the data publication levels of which are controlled by the registered project owners. In addition, all analytical functions are provided to public users without registration. PLAN has proved a valuable addition to the community for automated high-throughput BLAST searches, and, more importantly, for knowledge discovery, management and sharing based on sequence alignment results. The PLAN web interface is platform

Generic sorting of raft lipids into secretory vesicles in yeast

DEFF Research Database (Denmark)

Surma, Michal A; Klose, Christian; Klemm, Robin W

2011-01-01

Previous work has showed that ergosterol and sphingolipids become sorted to secretory vesicles immunoisolated using a chimeric, artificial raft membrane protein as bait. In this study, we have extended this analysis to three populations of secretory vesicles isolated using natural yeast plasma...... a complete lipid overview of the yeast late secretory pathway. We could show that vesicles captured with different baits carry the same cargo and have almost identical lipid compositions; being highly enriched in ergosterol and sphingolipids. This finding indicates that lipid raft sorting is a generic...

Radiometric sorting of Rio Algom uranium ore

International Nuclear Information System (INIS)

Cristovici, M.A.

1983-11-01

An ore sample of about 0.2 percent uranium from Quirke Mine was subjected to radiometric sorting by Ore Sorters Limited. Approximately 60 percent of the sample weight fell within the sortable size range: -150 + 25 mm. Rejects of low uranium content ( 2 (2 counts/in 2 ) but only 7.6 percent of the ore, by weight, was discarded. At 0.8-0.9 counts/cm 2 (5-6 counts/in 2 ) a significant amount of rejects was removed (> 25 percent) but the uranium loss was unacceptably high (7.7 percent). Continuation of the testwork to improve the results is proposed by trying to extend the sortable size range and to reduce the amount of fines during crushing

In-Line Sorting of Harumanis Mango Based on External Quality Using Visible Imaging.

Science.gov (United States)

Ibrahim, Mohd Firdaus; Ahmad Sa'ad, Fathinul Syahir; Zakaria, Ammar; Md Shakaff, Ali Yeon

2016-10-27

The conventional method of grading Harumanis mango is time-consuming, costly and affected by human bias. In this research, an in-line system was developed to classify Harumanis mango using computer vision. The system was able to identify the irregularity of mango shape and its estimated mass. A group of images of mangoes of different size and shape was used as database set. Some important features such as length, height, centroid and parameter were extracted from each image. Fourier descriptor and size-shape parameters were used to describe the mango shape while the disk method was used to estimate the mass of the mango. Four features have been selected by stepwise discriminant analysis which was effective in sorting regular and misshapen mango. The volume from water displacement method was compared with the volume estimated by image processing using paired t -test and Bland-Altman method. The result between both measurements was not significantly different (P > 0.05). The average correct classification for shape classification was 98% for a training set composed of 180 mangoes. The data was validated with another testing set consist of 140 mangoes which have the success rate of 92%. The same set was used for evaluating the performance of mass estimation. The average success rate of the classification for grading based on its mass was 94%. The results indicate that the in-line sorting system using machine vision has a great potential in automatic fruit sorting according to its shape and mass.

Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving

Directory of Open Access Journals (Sweden)

Salvador Lucas

2015-12-01

Full Text Available Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models for other logics via transformations. We investigate the automatic generation of numerical models for order-sorted first-order logics and its use in program analysis, in particular in termination analysis of declarative programs. We use convex domains to give domains to the different sorts of an order-sorted signature; we interpret the ranked symbols of sorted signatures by means of appropriately adapted convex matrix interpretations. Such numerical interpretations permit the use of existing algorithms and tools from linear algebra and arithmetic constraint solving to synthesize the models.

SU-E-J-26: A Novel Technique for Markerless Self-Sorted 4D-CBCT Using Patient Motion Modeling: A Feasibility Study

Energy Technology Data Exchange (ETDEWEB)

Zhang, L; Zhang, Y; Harris, W; Yin, F; Ren, L [Duke University Medical Center, Durham, NC (United States)

2015-06-15

Purpose: To develop an automatic markerless 4D-CBCT projection sorting technique by using a patient respiratory motion model extracted from the planning 4D-CT images. Methods: Each phase of onboard 4D-CBCT is considered as a deformation of one phase of the prior planning 4D-CT. The deformation field map (DFM) is represented as a linear combination of three major deformation patterns extracted from the planning 4D-CT using principle component analysis (PCA). The coefficients of the PCA deformation patterns are solved by matching the digitally reconstructed radiograph (DRR) of the deformed volume to the onboard projection acquired. The PCA coefficients are solved for each single projection, and are used for phase sorting. Projections at the peaks of the Z direction coefficient are sorted as phase 1 and other projections are assigned into 10 phase bins by dividing phases equally between peaks. The 4D digital extended-cardiac-torso (XCAT) phantom was used to evaluate the proposed technique. Three scenarios were simulated, with different tumor motion amplitude (3cm to 2cm), tumor spatial shift (8mm SI), and tumor body motion phase shift (2 phases) from prior to on-board images. Projections were simulated over 180 degree scan-angle for the 4D-XCAT. The percentage of accurately binned projections across entire dataset was calculated to represent the phase sorting accuracy. Results: With a changed tumor motion amplitude from 3cm to 2cm, markerless phase sorting accuracy was 100%. With a tumor phase shift of 2 phases w.r.t. body motion, the phase sorting accuracy was 100%. With a tumor spatial shift of 8mm in SI direction, phase sorting accuracy was 86.1%. Conclusion: The XCAT phantom simulation results demonstrated that it is feasible to use prior knowledge and motion modeling technique to achieve markerless 4D-CBCT phase sorting. National Institutes of Health Grant No. R01-CA184173 Varian Medical System.

Non-SUSY Beyond Standard Model Searches: Recent Results from ATLAS and CMS

International Nuclear Information System (INIS)

Malek, Fairouz

2015-01-01

The Standard Model of particle physics is a sensational success, especially since the discovery of the 125 GeV Higgs boson. However, there are still numerous unanswered questions. Why is the Higgs so light? Do the interactions couplings unify and how can gravity be included? Why three fermion generations? What is dark matter? Theories Beyond the Standard Model (BSM), such as Grand Unified Theories, Extra Dimensions or Technicolour are trying to answer these questions. In these proceedings, we will focus on the most recent results obtained by the ATLAS and CMS experiments at the LHC for BSM searches, excluding Higgs and supersymmetry searches. New results on Dark Matter, heavy narrow-width resonances, new heavy quarks and third generation leptoquarks are presented. A summary of the prospects at 14 TeV and at the High Luminosity LHC period is given. (paper)

Non-SUSY Beyond Standard Model Searches: Recent Results from ATLAS and CMS

CERN Document Server

Malek, Fairouz; The ATLAS collaboration

2015-01-01

The Standard Model of particle physics is a sensational success, especially since the discovery of the 125 GeV Higgs boson. However, there are still numerous unanswered questions. Why is the Higgs so light? Do the interactions couplings unify and how can gravity be included? Why three fermion generations? What is dark matter? Theories Beyond the Standard Model (BSM), such as Grand Unified Theories, Extra Dimensions or Technicolour are trying to answer these questions. In this proceedings, we will focus on the most recent results obtained by the ATLAS and CMS experiments at the LHC for BSM searches, excluding Higgs and supersymmetry searches. New results on Dark matter, heavy narrow bosons, new heavy quarks and third generation leptoquarks are presented. A summary of the prospects at 14 TeV and at the High Luminosity LHC period is given.

Prions amplify through degradation of the VPS10P sorting receptor sortilin.

Science.gov (United States)

Uchiyama, Keiji; Tomita, Mitsuru; Yano, Masashi; Chida, Junji; Hara, Hideyuki; Das, Nandita Rani; Nykjaer, Anders; Sakaguchi, Suehiro

2017-06-01

Prion diseases are a group of fatal neurodegenerative disorders caused by prions, which consist mainly of the abnormally folded isoform of prion protein, PrPSc. A pivotal pathogenic event in prion disease is progressive accumulation of prions, or PrPSc, in brains through constitutive conformational conversion of the cellular prion protein, PrPC, into PrPSc. However, the cellular mechanism by which PrPSc is progressively accumulated in prion-infected neurons remains unknown. Here, we show that PrPSc is progressively accumulated in prion-infected cells through degradation of the VPS10P sorting receptor sortilin. We first show that sortilin interacts with PrPC and PrPSc and sorts them to lysosomes for degradation. Consistently, sortilin-knockdown increased PrPSc accumulation in prion-infected cells. In contrast, overexpression of sortilin reduced PrPSc accumulation in prion-infected cells. These results indicate that sortilin negatively regulates PrPSc accumulation in prion-infected cells. The negative role of sortilin in PrPSc accumulation was further confirmed in sortilin-knockout mice infected with prions. The infected mice had accelerated prion disease with early accumulation of PrPSc in their brains. Interestingly, sortilin was reduced in prion-infected cells and mouse brains. Treatment of prion-infected cells with lysosomal inhibitors, but not proteasomal inhibitors, increased the levels of sortilin. Moreover, sortilin was reduced following PrPSc becoming detectable in cells after infection with prions. These results indicate that PrPSc accumulation stimulates sortilin degradation in lysosomes. Taken together, these results show that PrPSc accumulation of itself could impair the sortilin-mediated sorting of PrPC and PrPSc to lysosomes for degradation by stimulating lysosomal degradation of sortilin, eventually leading to progressive accumulation of PrPSc in prion-infected cells.

Intracellular transport and sorting of mutant human proinsulins that fail to form hexamers.

Science.gov (United States)

Quinn, D; Orci, L; Ravazzola, M; Moore, H P

1991-06-01

Human proinsulin and insulin oligomerize to form dimers and hexamers. It has been suggested that the ability of prohormones to self associate and form aggregates may be responsible for the sorting process at the trans-Golgi. To examine whether insulin oligomerization is required for proper sorting into regulated storage granules, we have constructed point mutations in human insulin B chain that have been previously shown to prevent formation of insulin hexamers (Brange, J., U. Ribel, J. F. Hansen, G. Dodson, M. T. Hansen, S. Havelund, S. G. Melberg, F. Norris, K. Norris, L. Snel, A. R. Sorensen, and H. O. Voight. 1988. Nature [Lond.]. 333:679-682). One mutant (B10His----Asp) allows formation of dimers but not hexamers and the other (B9Ser----Asp) prevents formation of both dimers and hexamers. The mutants were transfected into the mouse pituitary AtT-20 cells, and their ability to be sorted into regulated secretory granules was compared to wild-type insulin. We found that while B10His----Asp is sorted somewhat less efficiently than wild-type insulin as reported previously (Carroll, R. J., R. E. Hammer, S. J. Chan, H. H. Swift, A. H. Rubenstein, and D. F. Steiner. 1988. Proc. Natl. Acad. Sci. USA. 85:8943-8947; Gross, D. J., P. A. Halban, C. R. Kahn, G. C. Weir, and L. Villa-Kumaroff. 1989. Proc. Natl. Acad. Sci. USA. 86:4107-4111). B9Ser----Asp is targeted to granules as efficiently as wild-type insulin. These results indicate that self association of proinsulin into hexamers is not required for its targeting to the regulated secretory pathway.

A sorting network in bounded arithmetic

Czech Academy of Sciences Publication Activity Database

Jeřábek, Emil

2011-01-01

Roč. 162, č. 4 (2011), s. 341-355 ISSN 0168-0072 R&D Projects: GA AV ČR IAA1019401; GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10190503 Keywords : bounded arithmetic * sorting network * proof complexity * monotone sequent calculus Subject RIV: BA - General Mathematics Impact factor: 0.450, year: 2011 http://www.sciencedirect.com/science/article/pii/S0168007210001272

Numerical study on the complete blood cell sorting using particle tracing and dielectrophoresis in a microfluidic device

Science.gov (United States)

Ali, Haider; Park, Cheol Woo

2016-11-01

In this study, a numerical model of a microfluidic device with particle tracing and dielectrophoresis field-flow fractionation was employed to perform a complete and continuous blood cell sorting. A low voltage was applied to electrodes to separate the red blood cells, white blood cells, and platelets based on their cell size. Blood cell sorting and counting were performed by evaluating the cell trajectories, displacements, residence times, and recovery rates in the device. A novel numerical technique was used to count the number of separated blood cells by estimating the displacement and residence time of the cells in a microfluidic device. For successful blood cell sorting, the value of cells displacement must be approximately equal to or higher than the corresponding maximum streamwise distance. The study also proposed different outlet designs to improve blood cell separation. The basic outlet design resulted in a higher cells recovery rate than the other outlets design. The recovery rate decreased as the number of inlet cells and flow rates increased because of the high particle-particle interactions and collisions with walls. The particle-particle interactions significantly affect blood cell sorting and must therefore be considered in future work.

A monolithic glass chip for active single-cell sorting based on mechanical phenotyping.

Science.gov (United States)

Faigle, Christoph; Lautenschläger, Franziska; Whyte, Graeme; Homewood, Philip; Martín-Badosa, Estela; Guck, Jochen

2015-03-07

The mechanical properties of biological cells have long been considered as inherent markers of biological function and disease. However, the screening and active sorting of heterogeneous populations based on serial single-cell mechanical measurements has not been demonstrated. Here we present a novel monolithic glass chip for combined fluorescence detection and mechanical phenotyping using an optical stretcher. A new design and manufacturing process, involving the bonding of two asymmetrically etched glass plates, combines exact optical fiber alignment, low laser damage threshold and high imaging quality with the possibility of several microfluidic inlet and outlet channels. We show the utility of such a custom-built optical stretcher glass chip by measuring and sorting single cells in a heterogeneous population based on their different mechanical properties and verify sorting accuracy by simultaneous fluorescence detection. This offers new possibilities of exact characterization and sorting of small populations based on rheological properties for biological and biomedical applications.

Hrs and SNX3 functions in sorting and membrane invagination within multivesicular bodies.

Directory of Open Access Journals (Sweden)

Véronique Pons

2008-09-01

Full Text Available After internalization, ubiquitinated signaling receptors are delivered to early endosomes. There, they are sorted and incorporated into the intralumenal invaginations of nascent multivesicular bodies, which function as transport intermediates to late endosomes. Receptor sorting is achieved by Hrs--an adaptor--like protein that binds membrane PtdIns3P via a FYVE motif-and then by ESCRT complexes, which presumably also mediate the invagination process. Eventually, intralumenal vesicles are delivered to lysosomes, leading to the notion that EGF receptor sorting into multivesicular bodies mediates lysosomal targeting. Here, we report that Hrs is essential for lysosomal targeting but dispensable for multivesicular body biogenesis and transport to late endosomes. By contrast, we find that the PtdIns3P-binding protein SNX3 is required for multivesicular body formation, but not for EGF receptor degradation. PtdIns3P thus controls the complementary functions of Hrs and SNX3 in sorting and multivesicular body biogenesis.

First Results from the Cryogenic Dark Matter Search Experiment at the Deep Site

Energy Technology Data Exchange (ETDEWEB)

Mandic, Vuk [Univ. of California, Berkeley, CA (United States)

2004-06-01

The Cryogenic Dark Matter Search (CDMS) experiment is designed to search for dark matter in the form of the Weakly Interacting Massive Particles (WIMPs). For this purpose, CDMS uses detectors based on crystals of Ge and Si, operated at the temperature of 20 mK, and providing a two-fold signature of an interaction: the ionization and the athermal phonon signals. The two signals, along with the passive and active shielding of the experimental setup, and with the underground experimental sites, allow very effective suppression and rejection of different types of backgrounds. This dissertation presents the commissioning and the results of the first WIMP-search run performed by the CDMS collaboration at the deep underground site at the Soudan mine in Minnesota. We develop different methods of suppressing the dominant background due to the electron-recoil events taking place at the detector surface and we apply these algorithms to the data set. These results place the world's most sensitive limits on the WIMP-nucleon spin-independent elastic-scattering cross-section. Finally, they examine the compatibility of the supersymmetric WIMP-models with the direct-detection experiments (such as CDMS) and discuss the implications of the new CDMS result on these models.

A Systematic Assessment of Google Search Queries and Readability of Online Gynecologic Oncology Patient Education Materials.

Science.gov (United States)

Martin, Alexandra; Stewart, J Ryan; Gaskins, Jeremy; Medlin, Erin

2018-01-20

The Internet is a major source of health information for gynecologic cancer patients. In this study, we systematically explore common Google search terms related to gynecologic cancer and calculate readability of top resulting websites. We used Google AdWords Keyword Planner to generate a list of commonly searched keywords related to gynecologic oncology, which were sorted into five groups (cervical cancer, ovarian cancer, uterine cancer, vulvar cancer, vaginal cancer) using five patient education websites from sgo.org . Each keyword was Google searched to create a list of top websites. The Python programming language (version 3.5.1) was used to describe frequencies of keywords, top-level domains (TLDs), domains, and readability of top websites using four validated formulae. Of the estimated 1,846,950 monthly searches resulting in 62,227 websites, the most common was cancer.org . The most common TLD was *.com. Most websites were above the eighth-grade reading level recommended by the American Medical Association (AMA) and the National Institute of Health (NIH). The SMOG Index was the most reliable formula. The mean grade level readability for all sites using SMOG was 9.4 ± 2.3, with 23.9% of sites falling at or below the eighth-grade reading level. The first ten results for each Google keyword were easiest to read with results beyond the first page of Google being consistently more difficult. Keywords related to gynecologic malignancies are Google-searched frequently. Most websites are difficult to read without a high school education. This knowledge may help gynecologic oncology providers adequately meet the needs of their patients.

In vitro detection of circulating tumor cells compared by the CytoTrack and CellSearch methods

DEFF Research Database (Denmark)

Hillig, T.; Horn, P.; Nygaard, Ann-Britt

2015-01-01

.23/p = 0.09). Overall, the recovery of CytoTrack and CellSearch was 68.8 +/- 3.9 %/71.1 +/- 2.9 %, respectively (p = 0.58). In spite of different methodologies, CytoTrack and CellSearch found similar number of CTCs, when spiking was performed with the EpCAM and pan cytokeratin-positive cell line MCF-7......Comparison of two methods to detect circulating tumor cells (CTC) CytoTrack and CellSearch through recovery of MCF-7 breast cancer cells, spiked into blood collected from healthy donors. Spiking of a fixed number of EpCAM and pan-cytokeratin positive MCF-7 cells into 7.5 mL donor blood...... was performed by FACSAria flow sorting. The samples were shipped to either CytoTrack or CellSearch research facilities within 48 h, where evaluation of MCF-7 recovery was performed. CytoTrack and CellSearch analyses were performed simultaneously. Recoveries of MCF-7 single cells, cells in clusters, and clusters...

Rapid isolation of antibody from a synthetic human antibody library by repeated fluorescence-activated cell sorting (FACS.

Directory of Open Access Journals (Sweden)

Sung Sun Yim

Full Text Available Antibodies and their derivatives are the most important agents in therapeutics and diagnostics. Even after the significant progress in the technology for antibody screening from huge libraries, it takes a long time to isolate an antibody, which prevents a prompt action against the spread of a disease. Here, we report a new strategy for isolating desired antibodies from a combinatorial library in one day by repeated fluorescence-activated cell sorting (FACS. First, we constructed a library of synthetic human antibody in which single-chain variable fragment (scFv was expressed in the periplasm of Escherichia coli. After labeling the cells with fluorescent antigen probes, the highly fluorescent cells were sorted by using a high-speed cell sorter, and these cells were reused without regeneration in the next round of sorting. After repeating this sorting, the positive clones were completely enriched in several hours. Thus, we screened the library against three viral antigens, including the H1N1 influenza virus, Hepatitis B virus, and Foot-and-mouth disease virus. Finally, the potential antibody candidates, which show K(D values between 10 and 100 nM against the target antigens, could be successfully isolated even though the library was relatively small (∼ 10(6. These results show that repeated FACS screening without regeneration of the sorted cells can be a powerful method when a rapid response to a spreading disease is required.

Selective sorting of waste - not much effort needed, just willpower

CERN Multimedia

2007-01-01

In order to keep as low as possible the cost of disposing of waste materials, CERN provides in the entrance to each building two types of recipient: a green plastic one for paper/cardboard and a metallic one for general refuse. For some time now, we have noticed, to our great regret, a growing neglect as far as the selective sorting is concerned, for example the green recipients being filled with a mixture of cardboard boxes full of polystyrene or of protective wrappers, plastic bottles, empty yogurts pots, etc …We have been able to ascertain, after carefully checking, that this haphazard mixing of waste cannot be attributed to the cleaning staff but rather to members of personnel who unscrupulously throw away their rubbish in a completely random manner. Waste non sorted entails heavy costs for CERN. For your information, once a non-compliant item is found in a green recipient, the entire contents are sent off for incineration rather than recycling… We are all concerned by selective sorting of waste mater...

An Automated Sorting System Based on Virtual Instrumentation Techniques

Directory of Open Access Journals (Sweden)

Rodica Holonec

2008-07-01

Full Text Available The application presented in this paper represents an experimental model and it refers to the implementing of an automated sorting system for pieces of same shape but different sizes and/or colors. The classification is made according to two features: the color and weight of these pieces. The system is a complex combination of NI Vision hardware and software tools, strain gauges transducers, signal conditioning connected to data acquisition boards, motion and control elements. The system is very useful for students to learn and experiment different virtual instrumentation techniques in order to be able to develop a large field of applications from inspection and process control to sorting and assembly

Fast sorting measurement technique to determine decontamination priority

International Nuclear Information System (INIS)

Distenfeld, C.H.; Brosey, B.; Igarashi, H.

1986-01-01

The method used to select decontamination priorities for the Three Mile Island Unit 2 (TMI-2) reactor building (RB) is systematic, but costs in personnel exposure and time must be borne. One way of minimizing exposure is to define and treat the one or two surface sources that are important contributors to the collective dose of the recovery personnel. Surface characteristics can then be determined and decontamination techniques developed to match the removal requirements. At TMI-2, a fast sorting technique was developed and used to prioritize surfaces for exposure reduction. A second quick sort can then be used to determine the next generation of surface characterization, decontamination method selection, and performance. The quick-sort method that was developed is based on the Eberline HP 220A probes directional survey system. The angular response of the HP 220A probes approaches 2 pi steradians and allows toward-away type measurements. Sources distributed over 4 pi steradians are hard to define with this system. Angular differentiation was improved to about pi/2 steradians by redesigning the probe shield. The change allows unambiguous six-direction measurements, such as up, down, front, rear, right, and left with practically no angular overlap or exclusion. A simple, light-weight stand was used to establish an angular reference for the rectangular packaged probe. The six surface planes of the rectangle work with the angular reference to establish the six viewing angles

Cell flux through S phase in the mouse duodenal epithelium determined by cell sorting and radioautography

International Nuclear Information System (INIS)

Bjerknes, M.; Cheng, H.

1982-01-01

An accumulation of cells in early S phase was observed in normal mouse duodenal epithelium studied with flow cytometry. To determine if this accumulation of cells was the result of a lower rate of DNA synthesis, animals were given a single injection of 3 H-thymidine and the epithelium collected one hour later. The epithelium was processed for flow cytometry. Seven sort windows were established in different portions of the DNA histogram. Cells from each window were sorted onto glass slides that were then processed for radioautography. The number of silver grains over the nuclei of each sorted population was counted. It was found that cells in early S phase had significantly fewer grains over their nuclei than did mid- or late-S phase cells. We conclude that the accumulation of cells in early S phase is due, at least in part, to a lower rate of DNA synthesis in early than in mid or late S phase

An end user evaluation of query formulation and results review tools in three medical meta-search engines.

Science.gov (United States)

Leroy, Gondy; Xu, Jennifer; Chung, Wingyan; Eggers, Shauna; Chen, Hsinchun

2007-01-01

Retrieving sufficient relevant information online is difficult for many people because they use too few keywords to search and search engines do not provide many support tools. To further complicate the search, users often ignore support tools when available. Our goal is to evaluate in a realistic setting when users use support tools and how they perceive these tools. We compared three medical search engines with support tools that require more or less effort from users to form a query and evaluate results. We carried out an end user study with 23 users who were asked to find information, i.e., subtopics and supporting abstracts, for a given theme. We used a balanced within-subjects design and report on the effectiveness, efficiency and usability of the support tools from the end user perspective. We found significant differences in efficiency but did not find significant differences in effectiveness between the three search engines. Dynamic user support tools requiring less effort led to higher efficiency. Fewer searches were needed and more documents were found per search when both query reformulation and result review tools dynamically adjust to the user query. The query reformulation tool that provided a long list of keywords, dynamically adjusted to the user query, was used most often and led to more subtopics. As hypothesized, the dynamic result review tools were used more often and led to more subtopics than static ones. These results were corroborated by the usability questionnaires, which showed that support tools that dynamically optimize output were preferred.

Fast Search and Adaptive Resolution for Complex Particle Kinetics

Science.gov (United States)

Larson, David J.

2005-10-01

A new plasma simulation algorithm, intended to bridge the gap between Eulerian fluid and kinetic regimes, is now being used for a variety of applications in ICF and weapon effects. The CPK method (Complex Particle Kinetic) concept [1] uses an ensemble of macro-particles with a Gaussian spatial profile and a Mawellian velocity distribution to represent particle distributions in phase space. Time evolution is modeled by a combination of Lagrangian motion and internal evolution within each individual macro-particle. Collisional particle-particle interactions [2] are facilitated by sorting particles into bins depending of the particle size. Different bin levels are connected by a linked list. Searching for neighboring particles is highly efficient because the search is limited to particles in neighboring bins with the possibility of interaction. The bin structure also allows the computation of various spatial moments at different resolutions. Combining the results of the moment calculations yields information on where and when increased resolution is necessary. We will present details of the particle binning process along with progress towards our goal of simulating the transition from continuum to fully kinetic physics. [1] D. W. Hewett, J. Comp. Phys. 189 (2003). [2] D. J. Larson, J. Comp. Phys. 188 (2003).

Results from the Super Cryogenic Dark Matter Search Experiment at Soudan

Energy Technology Data Exchange (ETDEWEB)

Agnese, R.; Aramaki, T.; Arnquist, I. J.; Baker, W.; Balakishiyeva, D.; Banik, S.; Barker, D.; Basu Thakur, R.; Bauer, D. A.; Binder, T.; Bowles, M. A.; Brink, P. L.; Bunker, R.; Cabrera, B.; Caldwell, D. O.; Calkins, R.; Cartaro, C.; Cerdeño, D. G.; Chang, Y.; Chen, Y.; Cooley, J.; Cornell, B.; Cushman, P.; Daal, M.; Di Stefano, P. C. F.; Doughty, T.; Fascione, E.; Figueroa-Feliciano, E.; Fritts, M.; Gerbier, G.; Germond, R.; Ghaith, M.; Godfrey, G. L.; Golwala, S. R.; Hall, J.; Harris, H. R.; Hong, Z.; Hoppe, E. W.; Hsu, L.; Huber, M. E.; Iyer, V.; Jardin, D.; Jastram, A.; Jena, C.; Kelsey, M. H.; Kennedy, A.; Kubik, A.; Kurinsky, N. A.; Loer, B.; Lopez Asamar, E.; Lukens, P.; MacDonell, D.; Mahapatra, R.; Mandic, V.; Mast, N.; Miller, E. H.; Mirabolfathi, N.; Mohanty, B.; Morales Mendoza, J. D.; Nelson, J.; Orrell, J. L.; Oser, S. M.; Page, K.; Page, W. A.; Partridge, R.; Penalver Martinez, M.; Pepin, M.; Phipps, A.; Poudel, S.; Pyle, M.; Qiu, H.; Rau, W.; Redl, P.; Reisetter, A.; Reynolds, T.; Roberts, A.; Robinson, A. E.; Rogers, H. E.; Saab, T.; Sadoulet, B.; Sander, J.; Schneck, K.; Schnee, R. W.; Scorza, S.; Senapati, K.; Serfass, B.; Speller, D.; Stein, M.; Street, J.; Tanaka, H. A.; Toback, D.; Underwood, R.; Villano, A. N.; von Krosigk, B.; Welliver, B.; Wilson, J. S.; Wilson, M. J.; Wright, D. H.; Yellin, S.; Yen, J. J.; Young, B. A.; Zhang, X.; Zhao, X.

2018-02-01

We report the result of a blinded search for Weakly Interacting Massive Particles (WIMPs) using the full SuperCDMS Soudan dataset. With an exposure of 1690 kg days, a single event was observed after unblinding, consistent with expected backgrounds. This analysis (combined with previous Ge results) sets an upper limit on the spin-independent WIMP-nucleon cross section of 1.4x10^-44 (1.0x10^-44) cm^2 at 46 GeV/c^2 . These results set the strongest limits for WIMP-germanium-nucleus interactions for masses >12 GeV/c^2.

Spinach seed quality - potential for combining seed size grading and chlorophyll flourescence sorting

DEFF Research Database (Denmark)

Deleuran, Lise Christina; Olesen, Merete Halkjær; Boelt, Birte

2013-01-01

might therefore improve the establishment of spinach for producers. Spinach seeds were harvested at five different times (H1, H2, H3, H4 and H5) starting 3 weeks before estimated optimum harvest time. The harvested seeds were sorted according to chlorophyll fluorescence (CF) and seed size. Two harvest.......5–3.25 mm size seeds had germinated on day 3 than both their larger and smaller counterparts at the later time of harvest (H4). Seeds with a diameter below 2.5 mm displayed the lowest MGT. Commercially, the use of chlorophyll fluorescence (CF)-sorted seeds, in combination with seed size sorting, may provide...

Experience and problems of the automated measuring and sorting of sealed radiation sources

International Nuclear Information System (INIS)

Shmidt, G.

1979-01-01

It has been shown that with the help of a serial device for samples changing and a mini-computer with a suitable software it is possible to organize the radioactivity measuring and sorting of sealed gamma-sources with activity in the microcuri region. Application of the computer permits to rise accuracy of the data on the radiation sources radioactivity, sorted according to the preset activity level groups and, in the casa of necessity, to perform the activity measurements with lower error. The method listed, gives the working-time economy of nearly 4 hours in measuring and sorting of some 500 sealed radiation sources [ru

A Computer Environment for Beginners' Learning of Sorting Algorithms: Design and Pilot Evaluation

Science.gov (United States)

Kordaki, M.; Miatidis, M.; Kapsampelis, G.

2008-01-01

This paper presents the design, features and pilot evaluation study of a web-based environment--the SORTING environment--for the learning of sorting algorithms by secondary level education students. The design of this environment is based on modeling methodology, taking into account modern constructivist and social theories of learning while at…

Rapid assay for cell age response to radiation by electronic volume flow cell sorting

International Nuclear Information System (INIS)

Freyer, J.P.; Wilder, M.E.; Raju, M.R.

1987-01-01

A new technique is described for measuring cell survival as a function of cell cycle position using flow cytometric cell sorting on the basis of electronic volume signals. Sorting of cells into different cell age compartments is demonstrated for three different cell lines commonly used in radiobiological research. Using flow cytometric DNA content analysis and [ 3 H]thymidine autoradiography of the sorted cell populations, it is demonstrated that resolution of the age compartment separation is as good as or better than that reported for other cell synchronizing techniques. Variation in cell survival as a function of position in the cell cycle after a single dose of radiation as measured by volume cell sorting is similar to that determined by other cell synchrony techniques. Advantages of this method include: (1) no treatment of the cells is required, thus, this method is noncytotoxic; (2) no cell cycle progression is needed to obtain different cell age compartments; (3) the cell population can be held in complete growth medium at any desired temperature during sorting; (4) a complete radiation age - response assay can be plated in 2 h. Applications of this method are discussed, along with some technical limitations. (author)

Distinct forms of mitochondrial TOM-TIM supercomplexes define signal-dependent states of preprotein sorting.

Science.gov (United States)

Chacinska, Agnieszka; van der Laan, Martin; Mehnert, Carola S; Guiard, Bernard; Mick, David U; Hutu, Dana P; Truscott, Kaye N; Wiedemann, Nils; Meisinger, Chris; Pfanner, Nikolaus; Rehling, Peter

2010-01-01

Mitochondrial import of cleavable preproteins occurs at translocation contact sites, where the translocase of the outer membrane (TOM) associates with the presequence translocase of the inner membrane (TIM23) in a supercomplex. Different views exist on the mechanism of how TIM23 mediates preprotein sorting to either the matrix or inner membrane. On the one hand, two TIM23 forms were proposed, a matrix transport form containing the presequence translocase-associated motor (PAM; TIM23-PAM) and a sorting form containing Tim21 (TIM23(SORT)). On the other hand, it was reported that TIM23 and PAM are permanently associated in a single-entity translocase. We have accumulated distinct transport intermediates of preproteins to analyze the translocases in their active, preprotein-carrying state. We identified two different forms of active TOM-TIM23 supercomplexes, TOM-TIM23(SORT) and TOM-TIM23-PAM. These two supercomplexes do not represent separate pathways but are in dynamic exchange during preprotein translocation and sorting. Depending on the signals of the preproteins, switches between the different forms of supercomplex and TIM23 are required for the completion of preprotein import.

Pulsed laser activated cell sorter (PLACS) for high-throughput fluorescent mammalian cell sorting

Science.gov (United States)

Chen, Yue; Wu, Ting-Hsiang; Chung, Aram; Kung, Yu-Chung; Teitell, Michael A.; Di Carlo, Dino; Chiou, Pei-Yu

2014-09-01

We present a Pulsed Laser Activated Cell Sorter (PLACS) realized by exciting laser induced cavitation bubbles in a PDMS microfluidic channel to create high speed liquid jets to deflect detected fluorescent samples for high speed sorting. Pulse laser triggered cavitation bubbles can expand in few microseconds and provide a pressure higher than tens of MPa for fluid perturbation near the focused spot. This ultrafast switching mechanism has a complete on-off cycle less than 20 μsec. Two approaches have been utilized to achieve 3D sample focusing in PLACS. One is relying on multilayer PDMS channels to provide 3D hydrodynamic sheath flows. It offers accurate timing control of fast (2 m sec-1) passing particles so that synchronization with laser bubble excitation is possible, an critically important factor for high purity and high throughput sorting. PLACS with 3D hydrodynamic focusing is capable of sorting at 11,000 cells/sec with >95% purity, and 45,000 cells/sec with 45% purity using a single channel in a single step. We have also demonstrated 3D focusing using inertial flows in PLACS. This sheathless focusing approach requires 10 times lower initial cell concentration than that in sheath-based focusing and avoids severe sample dilution from high volume sheath flows. Inertia PLACS is capable of sorting at 10,000 particles sec-1 with >90% sort purity.

Distinct pathways mediate the sorting of tail-anchored proteins to the plastid outer envelope.

Directory of Open Access Journals (Sweden)

Preetinder K Dhanoa

Full Text Available BACKGROUND: Tail-anchored (TA proteins are a distinct class of membrane proteins that are sorted post-translationally to various organelles and function in a number of important cellular processes, including redox reactions, vesicular trafficking and protein translocation. While the molecular targeting signals and pathways responsible for sorting TA proteins to their correct intracellular destinations in yeasts and mammals have begun to be characterized, relatively little is known about TA protein biogenesis in plant cells, especially for those sorted to the plastid outer envelope. METHODOLOGY/PRINCIPAL FINDINGS: Here we investigated the biogenesis of three plastid TA proteins, including the 33-kDa and 34-kDa GTPases of the translocon at the outer envelope of chloroplasts (Toc33 and Toc34 and a novel 9-kDa protein of unknown function that we define here as an outer envelope TA protein (OEP9. Using a combination of in vivo and in vitro assays we show that OEP9 utilizes a different sorting pathway than that used by Toc33 and Toc34. For instance, while all three TA proteins interact with the cytosolic OEP chaperone/receptor, AKR2A, the plastid targeting information within OEP9 is distinct from that within Toc33 and Toc34. Toc33 and Toc34 also appear to differ from OEP9 in that their insertion is dependent on themselves and the unique lipid composition of the plastid outer envelope. By contrast, the insertion of OEP9 into the plastid outer envelope occurs in a proteinaceous-dependent, but Toc33/34-independent manner and membrane lipids appear to serve primarily to facilitate normal thermodynamic integration of this TA protein. CONCLUSIONS/SIGNIFICANCE: Collectively, the results provide evidence in support of at least two sorting pathways for plastid TA outer envelope proteins and shed light on not only the complex diversity of pathways involved in the targeting and insertion of proteins into plastids, but also the molecular mechanisms that underlie

Using Sorting Networks for Skill Building and Reasoning

Science.gov (United States)

Andre, Robert; Wiest, Lynda R.

2007-01-01

Sorting networks, used in graph theory, have instructional value as a skill- building tool as well as an interesting exploration in discrete mathematics. Students can practice mathematics facts and develop reasoning and logic skills with this topic. (Contains 4 figures.)

Fluence map optimization (FMO) with dose–volume constraints in IMRT using the geometric distance sorting method

International Nuclear Information System (INIS)

Lan Yihua; Li Cunhua; Ren Haozheng; Zhang Yong; Min Zhifang

2012-01-01

A new heuristic algorithm based on the so-called geometric distance sorting technique is proposed for solving the fluence map optimization with dose–volume constraints which is one of the most essential tasks for inverse planning in IMRT. The framework of the proposed method is basically an iterative process which begins with a simple linear constrained quadratic optimization model without considering any dose–volume constraints, and then the dose constraints for the voxels violating the dose–volume constraints are gradually added into the quadratic optimization model step by step until all the dose–volume constraints are satisfied. In each iteration step, an interior point method is adopted to solve each new linear constrained quadratic programming. For choosing the proper candidate voxels for the current dose constraint adding, a so-called geometric distance defined in the transformed standard quadratic form of the fluence map optimization model was used to guide the selection of the voxels. The new geometric distance sorting technique can mostly reduce the unexpected increase of the objective function value caused inevitably by the constraint adding. It can be regarded as an upgrading to the traditional dose sorting technique. The geometry explanation for the proposed method is also given and a proposition is proved to support our heuristic idea. In addition, a smart constraint adding/deleting strategy is designed to ensure a stable iteration convergence. The new algorithm is tested on four cases including head–neck, a prostate, a lung and an oropharyngeal, and compared with the algorithm based on the traditional dose sorting technique. Experimental results showed that the proposed method is more suitable for guiding the selection of new constraints than the traditional dose sorting method, especially for the cases whose target regions are in non-convex shapes. It is a more efficient optimization technique to some extent for choosing constraints than

Fluence map optimization (FMO) with dose-volume constraints in IMRT using the geometric distance sorting method.

Science.gov (United States)

Lan, Yihua; Li, Cunhua; Ren, Haozheng; Zhang, Yong; Min, Zhifang

2012-10-21