Generation of correlated finite alphabet waveforms using gaussian random variables

KAUST Repository

Jardak, Seifallah

2014-09-01

Correlated waveforms have a number of applications in different fields, such as radar and communication. It is very easy to generate correlated waveforms using infinite alphabets, but for some of the applications, it is very challenging to use them in practice. Moreover, to generate infinite alphabet constant envelope correlated waveforms, the available research uses iterative algorithms, which are computationally very expensive. In this work, we propose simple novel methods to generate correlated waveforms using finite alphabet constant and non-constant-envelope symbols. To generate finite alphabet waveforms, the proposed method map the Gaussian random variables onto the phase-shift-keying, pulse-amplitude, and quadrature-amplitude modulation schemes. For such mapping, the probability-density-function of Gaussian random variables is divided into M regions, where M is the number of alphabets in the corresponding modulation scheme. By exploiting the mapping function, the relationship between the cross-correlation of Gaussian and finite alphabet symbols is derived. To generate equiprobable symbols, the area of each region is kept same. If the requirement is to have each symbol with its own unique probability, the proposed scheme allows us that as well. Although, the proposed scheme is general, the main focus of this paper is to generate finite alphabet waveforms for multiple-input multiple-output radar, where correlated waveforms are used to achieve desired beampatterns. © 2014 IEEE.

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

Exploring the evolution of standard amino-acid alphabet: When genomics meets thermodynamics

International Nuclear Information System (INIS)

Zhang, Hong-Yu

2007-01-01

One of the most intriguing aspects of life is that despite the diversified apparent shapes, similar building blocks and infrastructures, such as standard amino acids and canonical genetic codes, are shared by most life on Earth. Thus, it is challenging to explore: why nature just selects these building blocks and strategies from numerous candidates to construct life? Was this deterministic or fortuitous? Thanks to the rapid progress in genomics, bioinformatics and synthetic biology, more and more basic principles underlying life design and construction were disclosed in the past decade. However, since the origin of early life is substantially a chemical process, to understand the enigma of life origin, chemists' efforts can not be neglected. In this paper, we focus on the evolution of standard amino-acid alphabet and indicate that chemistry, especially thermodynamics, is indeed critical to understanding the forming mechanisms of amino-acid alphabet. It is revealed that nature prefers low free energy and thus ubiquitous (cheap) small amino acids when beginning to build life, which is compatible with many recent findings from genomics and bioinformatics

Developing Early Literacy Skills: A Meta-Analysis of Alphabet Learning and Instruction

OpenAIRE

Piasta, Shayne B.; Wagner, Richard K.

2010-01-01

Alphabet knowledge is a hallmark of early literacy and facilitating its development has become a primary objective of pre-school instruction and intervention. However, little agreement exists about how to promote the development of alphabet knowledge effectively. A meta-analysis of the effects of instruction on alphabet outcomes demonstrated that instructional impacts differed by type of alphabet outcome examined and content of instruction provided. School-based instruction yielded larger eff...

Parallel deposition, sorting, and reordering methods in the Hybrid Ordered Plasma Simulation (HOPS) code

International Nuclear Information System (INIS)

Anderson, D.V.; Shumaker, D.E.

1993-01-01

From a computational standpoint, particle simulation calculations for plasmas have not adapted well to the transitions from scalar to vector processing nor from serial to parallel environments. They have suffered from inordinate and excessive accessing of computer memory and have been hobbled by relatively inefficient gather-scatter constructs resulting from the use of indirect indexing. Lastly, the many-to-one mapping characteristic of the deposition phase has made it difficult to perform this in parallel. The authors' code sorts and reorders the particles in a spatial order. This allows them to greatly reduce the memory references, to run in directly indexed vector mode, and to employ domain decomposition to achieve parallelization. In this hybrid simulation the electrons are modeled as a fluid and the field equations solved are obtained from the electron momentum equation together with the pre-Maxwell equations (displacement current neglected). Either zero or finite electron mass can be used in the electron model. The resulting field equations are solved with an iteratively explicit procedure which is thus trivial to parallelize. Likewise, the field interpolations and the particle pushing is simple to parallelize. The deposition, sorting, and reordering phases are less simple and it is for these that the authors present detailed algorithms. They have now successfully tested the parallel version of HOPS in serial mode and it is now being readied for parallel execution on the Cray C-90. They will then port HOPS to a massively parallel computer, in the next year

Perbandingan Kecepatan Gabungan Algoritma Quick Sort dan Merge Sort dengan Insertion Sort, Bubble Sort dan Selection Sort

OpenAIRE

Al Rivan, Muhammad Ezar

2017-01-01

Ordering is one of the process done before doing data processing. The sorting algorithm has its own strengths and weaknesses. By taking strengths of each algorithm then combined can be a better algorithm. Quick Sort and Merge Sort are algorithms that divide the data into parts and each part divide again into sub-section until one element. Usually one element join with others and then sorted by. In this experiment data divide into parts that have size not more than threshold. This part then so...

Universal Partial Words over Non-Binary Alphabets

OpenAIRE

Goeckner, Bennet; Groothuis, Corbin; Hettle, Cyrus; Kell, Brian; Kirkpatrick, Pamela; Kirsch, Rachel; Solava, Ryan

2016-01-01

Chen, Kitaev, M\\"{u}tze, and Sun recently introduced the notion of universal partial words, a generalization of universal words and de Bruijn sequences. Universal partial words allow for a wild-card character $\\diamond$, which is a placeholder for any letter in the alphabet. We settle and strengthen conjectures posed in the same paper where this notion was introduced. For non-binary alphabets, we show that universal partial words have periodic $\\diamond$ structure and are cyclic, and we give ...

Nurturing Phonemic Awareness and Alphabetic Knowledge in Pre-Kindergartners.

Science.gov (United States)

Steinhaus, Patricia L.

Reading research continues to identify phonemic awareness and knowledge of the alphabetic principle as key factors in the literacy acquisition process and to indicate that they greatly facilitate decoding efforts. While research indicates that phonemic awareness and alphabetic knowledge are necessary to literacy acquisition, many early childhood…

A multifractal formalism for countable alphabet subshifts

International Nuclear Information System (INIS)

Meson, Alejandro; Vericat, Fernando

2009-01-01

We study here the multifractal spectrum of local entropies for subshifts with an infinite alphabet. The description of this spectrum is obtained from the Legendre transform of a free energy map and Gibbs states associated with adequate potentials. The lack of compactness in the symbolic space necessitates modifications to the description for the compact case, i.e. for finite alphabet. In particular, the class of potentials must be restricted to a narrower one than that considered for the compact case

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...

Degenerate quantum codes and the quantum Hamming bound

International Nuclear Information System (INIS)

Sarvepalli, Pradeep; Klappenecker, Andreas

2010-01-01

The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum codes. In this article we show that Calderbank-Shor-Steane (CSS) codes, over a prime power alphabet q≥5, cannot beat the quantum Hamming bound. We prove a quantum version of the Griesmer bound for the CSS codes, which allows us to strengthen the Rains' bound that an [[n,k,d

An Interactive Augmented Reality Implementation of Hijaiyah Alphabet for Children Education

Science.gov (United States)

Rahmat, R. F.; Akbar, F.; Syahputra, M. F.; Budiman, M. A.; Hizriadi, A.

2018-03-01

Hijaiyah alphabet is letters used in the Qur’an. An attractive and exciting learning process of Hijaiyah alphabet is necessary for the children. One of the alternatives to create attractive and interesting learning process of Hijaiyah alphabet is to develop it into a mobile application using augmented reality technology. Augmented reality is a technology that combines two-dimensional or three-dimensional virtual objects into actual three-dimensional circles and projects them in real time. The purpose of application aims to foster the children interest in learning Hijaiyah alphabet. This application is using Smartphone and marker as the medium. It was built using Unity and augmented reality library, namely Vuforia, then using Blender as the 3D object modeling software. The output generated from this research is the learning application of Hijaiyah letters using augmented reality. How to use it is as follows: first, place marker that has been registered and printed; second, the smartphone camera will track the marker. If the marker is invalid, the user should repeat the tracking process. If the marker is valid and identified, the marker will have projected the objects of Hijaiyah alphabet in three-dimensional form. Lastly, the user can learn and understand the shape and pronunciation of Hijaiyah alphabet by touching the virtual button on the marker

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.

On alphabetic presentations of Clifford algebras and their possible applications

NARCIS (Netherlands)

Toppan, F.; Verbeek, P.W.

2009-01-01

In this paper, we address the problem of constructing a class of representations of Clifford algebras that can be named “alphabetic (re)presentations.” The Clifford algebra generators are expressed as m-letter words written with a three-character or a four-character alphabet. We formulate the

Admission to selective schools, alphabetically

Czech Academy of Sciences Publication Activity Database

Jurajda, Štěpán; Münich, Daniel

2010-01-01

Roč. 29, č. 6 (2010), s. 1100-1109 ISSN 0272-7757 R&D Projects: GA MŠk LC542 Institutional research plan: CEZ:MSM0021620846 Keywords : admissions to school * alphabetical order * order effects Subject RIV: AH - Economics Impact factor: 1.066, year: 2010

Alphabetical order effects in school admissions

Czech Academy of Sciences Publication Activity Database

Jurajda, Štěpán; Münich, Daniel

2016-01-01

Roč. 31, č. 4 (2016), s. 483-498 ISSN 0267-1522 Institutional support: PRVOUK-P23 Keywords : admissions * alphabetical order * order effects Subject RIV: AH - Economics Impact factor: 1.033, year: 2016

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

Reflections of Debates Upon Alphabet (Letter to Journal of Sebilürreşad

Directory of Open Access Journals (Sweden)

Mehmet Soğukömeroğulları

2014-12-01

Full Text Available In Otoman State which had used Arabic alphabet until a certain period the issue of writing in Latin alphabet was gained currency thanks to the students who had been to Europe and the embassadors who had come from Europe in 18th and 19th centuries. After Tanzimat (reforms in 1839 amendment of letters had been given point first and then it was abondoned and alphabet replacement attempts began. In later periods serious arguments among the ones in favour and against the transition to Latin alphabet occured. One of the media organs in which these arguments had been appeared was Sebilürreşad. In all these articles acceptance of Latin alphabet was refused and instead the amendment of current letters was required. Some of the articles were taken from the journals of that time and according to the broadcasting policy of the journal occupied a certain place even a little. When the journal had leaned to nationalism and Turanism in its first periods afteryears a critisism began in a distinct manner. The articles related to Latin alphabet belonged to the first periods of the journal. It was seen that especially Turks who had been forced to accept Latin alphabet by Russia in Turkish world were taken place in newspaper columns and it was emphasized that this situation would interrupt the unity within Turkish world. Relections of civilization, printery, economy, colonialism and nationalism in terms of alphabet were also taken place in the journal

Parameter-Invariant Hierarchical Exclusive Alphabet Design for 2-WRC with HDF Strategy

Directory of Open Access Journals (Sweden)

T. Uřičář

2010-01-01

Full Text Available Hierarchical eXclusive Code (HXC for the Hierarchical Decode and Forward (HDF strategy in the Wireless 2-Way Relay Channel (2-WRC has the achievable rate region extended beyond the classical MAC region. Although direct HXC design is in general highly complex, a layered approach to HXC design is a feasible solution. While the outer layer code of the layered HXC can be any state-of-the-art capacity approaching code, the inner layer must be designed in such a way that the exclusive property of hierarchical symbols (received at the relay will be provided. The simplest case of the inner HXC layer is a simple signal space channel symbol memoryless mapper called Hierarchical eXclusive Alphabet (HXA. The proper design of HXA is important, especially in the case of parametric channels, where channel parametrization (e.g. phase rotation can violate the exclusive property of hierarchical symbols (as seen by the relay, resulting in significant capacity degradation. In this paper we introduce an example of a geometrical approach to Parameter-Invariant HXA design, and we show that the corresponding hierarchical MAC capacity region extends beyond the classical MAC region, irrespective of the channel pametrization.

Report number codes

Energy Technology Data Exchange (ETDEWEB)

Nelson, R.N. (ed.)

1985-05-01

This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name.

Report number codes

International Nuclear Information System (INIS)

Nelson, R.N.

1985-05-01

This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name

Alphabetical co-authorship in the social sciences and humanities: evidence from a comprehensive local database

Energy Technology Data Exchange (ETDEWEB)

Guns, R

2016-07-01

We present an analysis of alphabetical co-authorship in the social sciences and humanities (SSH), based on data from the VABB-SHW, a comprehensive database of SSH research output in Flanders (2000-2013). Using an unbiased estimator of the share of intentional alphabetical co-authorship (IAC), we find that alphabetical co-authorship is more engrained in SSH than in science as a whole. Within the SSH, large differences exist between disciplines. The highest proportions of IAC are found for Literature, Economics & business, and History. Furthermore, alphabetical co-authorship varies with publication type: it occurs most often in books, is less common in articles in journals or in books, and is rare in proceedings papers. The use of alphabetical co-authorship appears to be slowly declining. (Author)

PM1 steganographic algorithm using ternary Hamming Code

Directory of Open Access Journals (Sweden)

Kamil Kaczyński

2015-12-01

Full Text Available PM1 algorithm is a modification of well-known LSB steganographic algorithm. It has increased resistance to selected steganalytic attacks and increased embedding efficiency. Due to its uniqueness, PM1 algorithm allows us to use of larger alphabet of symbols, making it possible to further increase steganographic capacity. In this paper, we present the modified PM1 algorithm which utilizies so-called syndrome coding and ternary Hamming code. The modified algorithm has increased embedding efficiency, which means fewer changes introduced to carrier and increased capacity.[b]Keywords[/b]: steganography, linear codes, PM1, LSB, ternary Hamming code

Efficient motif finding algorithms for large-alphabet inputs

Directory of Open Access Journals (Sweden)

Pavlovic Vladimir

2010-10-01

Full Text Available Abstract Background We consider the problem of identifying motifs, recurring or conserved patterns, in the biological sequence data sets. To solve this task, we present a new deterministic algorithm for finding patterns that are embedded as exact or inexact instances in all or most of the input strings. Results The proposed algorithm (1 improves search efficiency compared to existing algorithms, and (2 scales well with the size of alphabet. On a synthetic planted DNA motif finding problem our algorithm is over 10× more efficient than MITRA, PMSPrune, and RISOTTO for long motifs. Improvements are orders of magnitude higher in the same setting with large alphabets. On benchmark TF-binding site problems (FNP, CRP, LexA we observed reduction in running time of over 12×, with high detection accuracy. The algorithm was also successful in rapidly identifying protein motifs in Lipocalin, Zinc metallopeptidase, and supersecondary structure motifs for Cadherin and Immunoglobin families. Conclusions Our algorithm reduces computational complexity of the current motif finding algorithms and demonstrate strong running time improvements over existing exact algorithms, especially in important and difficult cases of large-alphabet sequences.

Alphabetical order effects in school admissions

Czech Academy of Sciences Publication Activity Database

Jurajda, Štěpán; Münich, Daniel

2016-01-01

Roč. 31, č. 4 (2016), s. 483-498 ISSN 0267-1522 R&D Projects: GA ČR(CZ) GBP402/12/G130 Institutional support: RVO:67985998 Keywords : admissions * alphabetical order * order effects Subject RIV: AH - Economics Impact factor: 1.033, year: 2016

Perbandingan Bubble Sort dengan Insertion Sort pada Bahasa Pemrograman C dan Fortran

OpenAIRE

Reina, Reina; Gautama, Josef Bernadi

2013-01-01

Sorting is a basic algorithm studied by students of computer science major. Sorting algorithm is the basis of other algorithms such as searching algorithm, pattern matching algorithm. Bubble sort is a popular basic sorting algorithm due to its easiness to be implemented. Besides bubble sort, there is insertion sort. It is lesspopular than bubble sort because it has more difficult algorithm. This paper discusses about process time between insertion sort and bubble sort with two kinds of data. ...

Biography of louis braille and invention of the braille alphabet.

Science.gov (United States)

Jiménez, Javier; Olea, Jesús; Torres, Jesús; Alonso, Inmaculada; Harder, Dirk; Fischer, Konstanze

2009-01-01

Louis Braille (1809-1852) was born in France. At the age of three, he wounded his right eye with a cobbler's tool while playing in his father's workshop. No medical knowledge could save his eyesight at that time. Louis's left eye became inflamed, apparently due to subsequent sympathetic ophthalmia, and he eventually lost the sight in that eye. At the age of five, Louis Braille was completely blind. He is considered to be the inventor of a writing system by touch that bears his name, the Braille system. This revolutionary system has allowed blind people to access written culture, and it can therefore be considered a major advance in the quality of life for the blind. The immediate precursor of the invention of the Braille system was the alphabet created by Charles Barbier de la Serre (1767-1841) who created a language by touch designed for military and secret use. Louis Braille modified this alphabet into the Braille alphabet, which is practically the same one that is currently used. It required time to be recognized and to be implemented as a reading and writing method for blind people throughout the world. In 1950, UNESCO effectively universalized the Braille alphabet, and in 2005 it recognized Braille system as a "vital language of communication, as legitimate as all other languages in the world."

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.

African Journals Online: Browse Alphabetically -- letter T

African Journals Online (AJOL)

Items 1 - 19 of 19 ... African Journals Online: Browse Alphabetically -- letter T ... and economic aspects of management and conservation of tropical flora and fauna. ... Les principaux thèmes qui y sont abordés recouvrent les axes de recherche ...

Perbandingan Bubble Sort dengan Insertion Sort pada Bahasa Pemrograman C dan Fortran

Directory of Open Access Journals (Sweden)

Reina Reina

2013-12-01

Full Text Available Sorting is a basic algorithm studied by students of computer science major. Sorting algorithm is the basis of other algorithms such as searching algorithm, pattern matching algorithm. Bubble sort is a popular basic sorting algorithm due to its easiness to be implemented. Besides bubble sort, there is insertion sort. It is lesspopular than bubble sort because it has more difficult algorithm. This paper discusses about process time between insertion sort and bubble sort with two kinds of data. First is randomized data, and the second is data of descending list. Comparison of process time has been done in two kinds of programming language that is C programming language and FORTRAN programming language. The result shows that bubble sort needs more time than insertion sort does.

Kichwa or Quichua? Competing Alphabets, Political Histories, and Complicated Reading in Indigenous Languages

Science.gov (United States)

Limerick, Nicholas

2018-01-01

Over the past century, missionary educators, nation-state and academic planners, and literacy development workers have used alphabets for political ends for traditionally marginalized languages, and Native peoples have contested such planning with other alphabet proposals. Yet literacy work now often overlooks that there are multiple alphabets…

Alphabetics: A History of Our Alphabet. A Source Guide for Self-Directed Units. Great Ideas Series. Revised Edition.

Science.gov (United States)

Patton, Sally J.

This teaching resource presents a historical perspective of the alphabet which encompasses a study of major contributions by: (1) "Prehistoric People"; (2) "The Sumerians"; (3) "The Egyptians"; (4) "The Chinese"; (5) "The Greeks"; and (6) "The Romans." Background information, vocabulary study, student activities, a letter history, and a…

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.

Alphabetic Phonics: An organization and expansion of orton-gillingham.

Science.gov (United States)

Cox, A R

1985-01-01

Alphabetic Phonics is a sequential language curriculum designed to assure that all students can achieve literacy. This curriculum is a 1980's organization and extension of the Orton-Gillingham-Childs multisensory teaching of the structure of English. Alphabetic Phonics allows 95 percent of the auditory, visual, and kinesthetic learners in a regular classroom to master written English. The curriculum includes modern behavioral, psychological, and educational theories and practice. Developed initially as remediation for dyslexics, Alphabetic Phonics is succeeding both with small groups of severely blocked dyslexics and as prevention in regular classrooms in the primary grades. Administrators, classroom teachers, clinicians, remedial, and resource room specialists, as well as speech and language therapists representing small and large schools (public and private; remedial and accelerated) have traveled to Texas from forty states and six foreign countries during the past ten years to earn graduate credit in one or more of the four month-long Introductory Courses held each year. Teachers report that cultural minority students and those learning English as a second language benefit especially from reading instruction which emphasizes the foundations of English and time-on-task activities to effect mastery. Outreach programs and multimedia tools are being developed and implemented to broaden the programs availability to groups with varied needs.

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

The Effects of Orthographic Depth on Learning to Read Alphabetic, Syllabic, and Logographic Scripts

Science.gov (United States)

Ellis, Nick C.; Natsume, Miwa; Stavropoulou, Katerina; Hoxhallari, Lorenc; Van Daal, Victor H.P.; Polyzoe, Nicoletta; Tsipa, Maria-Louisa; Petalas, Michalis

2004-01-01

This study investigated the effects of orthographic depth on reading acquisition in alphabetic, syllabic, and logographic scripts. Children between 6 and 15 years old read aloud in transparent syllabic Japanese hiragana, alphabets of increasing orthographic depth (Albanian, Greek, English), and orthographically opaque Japanese kanji ideograms,…

Theoretical explanations for preschoolers' lowercase alphabet knowledge.

Science.gov (United States)

Pence Turnbull, Khara L; Bowles, Ryan P; Skibbe, Lori E; Justice, Laura M; Wiggins, Alice K

2010-12-01

Letter knowledge is a key aspect of children's language development, yet relatively little research has aimed to understand the nature of lowercase letter knowledge. We considered 4 hypotheses about children's lowercase letter knowledge simultaneously--uppercase familiarity, uppercase-lowercase similarity, own-name advantage, and frequency in printed English--as well as 3 interactions. Participants were 461 children ranging in age from 3 to 5 years, all of whom attended public preschool programs serving primarily children from low-income homes, who completed a letter naming task. Uppercase familiarity was the strongest predictor of children's lowercase alphabet knowledge; children were more than 16 times more likely to know a lowercase letter if they knew the corresponding uppercase letter. Uppercase-lowercase similarity and frequency in printed English also predicted children's lowercase letter knowledge, as did the interaction between uppercase familiarity and own-name advantage and the interaction between uppercase familiarity and uppercase-lowercase similarity. Findings suggest that transference from uppercase letter knowledge may be a primary mechanism for lowercase letter knowledge and that young children's knowledge of the lowercase alphabet letters is multiply determined.

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...

Coding chaotic billiards: I-Non-Compact billiards on a negative curvature manifold

International Nuclear Information System (INIS)

Giannoni, M.J.; Ullmo, D.

1989-03-01

This paper presents a method for coding billiards. The main device is to use a proper surface of section, the bounce mapping, and foliate the reduced phase space into regions associated with a given code. The alphabet is merely the ensemble of the labels of the sides of the billiard. The procedure is applied here to non-compact polygonal billiard defined on a manifold of constant negative curvature, with all vertices at infinity. A simple grammar rule is necessary and sufficient to insure existence and uniqueness of the coding

Bi-alphabetic pulse compression radar signal design

Indian Academy of Sciences (India)

Bi-alphabetic radar; Hamming scan; back-tracking; merit factor; ... of 14.08, 12.10, 9.85, 8.85, 8.83, 8.86, 8.58 and 8.50 respectively. Beyond n ˆ 59 but below n ˆ 117, the highest merit factor available is 9.56. Known high merit ... subjected to dual ternary±binary interpretation to facilitate a coincidence detection scheme.

Mastering the International Phonetic Alphabet; Guide and Workbook.

Science.gov (United States)

Decker, Donald M.

The present volume, containing lessons with practice and review exercises, offers a systematic presentation of the symbols of the International Phonetic Alphabet (IPA) most widely used as a simplified means of representing the pronunciation of General American English. The transcription symbols presented are those primarily employed by Kenyon and…

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.

Letter Frequency Analysis of Lithuanian and Other Languages Using the Latin Alphabet

Directory of Open Access Journals (Sweden)

Gintautas Grigas

2015-12-01

Full Text Available It is important to evaluate specificities of alphabets, particularly the letter frequencies while designing keyboards, analyzing texts, designing games based on alphabets, and doing some text mining. In order to adequately compare lettter frequences of Lithuanian language to other languages in the Internet space, Wikipedia source was selected which content is common to different languages. The method of letter frequency jumps is used. The main attention is paid to the analysis of letter frequencies at the boundary between native letters and foreign letters used in Lithuanian and other languages.

The Coral Reef Alphabet Book for American Samoa.

Science.gov (United States)

Madrigal, Larry G.

This book, produced for the American Samoa Department of Education Marine Enhancement Program, presents underwater color photography of coral reef life in an alphabetical resource. The specimens are described in English, and some are translated into the Samoan language. A picture-matching learning exercise and a glossary of scientific and oceanic…

The protection of the Cyrillic alphabet in telecommunications: Taxation aspects

Directory of Open Access Journals (Sweden)

Marilović Đorđe

2016-01-01

Full Text Available The use of Cyrillic and other specific alphabets is discouraged in some telecommunication services. In this paper; the author focuses on unequal treatment of the Cyrillic alphabet in telecommunications (in SMS messages, which is incompatible with the interests of a multilingual society to cherish its linguistic heritage and diversity. Referring to the Convention on the Protection and Promotion of the Diversity of Cultural Expression (2005, the author suggests introducing measures which would lead to removing the discriminatory pricing of Cyrillic SMS messages; and introducing tax measures which would support mobile network operators and prevent possible market inequalities stemming from introducing these measures. The suggested solution is applicable to any multicultural society facing the same problem; regardless of languages in question.

Government Acronyms and Alphabetic Designations Used in DDC.

Science.gov (United States)

Defense Documentation Center, Alexandria, VA.

The compilation consists of a guide to acronyms and alphabetic designations used by the Department of Defense (DOD), federal government and foreign military organizations on documents to designate reports on research monitored by them and cataloged by the Defense Documentation Center (DDC). In all instances the acronyms are those actually used by…

INDC list of correspondents for the exchange of nuclear data information and compilation of national nuclear data committees

International Nuclear Information System (INIS)

1989-05-01

The document includes information on currently existing National Nuclear Data Committees and their memberships. It contains five sections. The first section contains a detailed description of the INDC distribution categories, distribution codes and document designator codes. The second section describes the aims, organization and objectives of individual national nuclear data committees. The third section lists names and addresses in alphabetical order within each state or international organization together with the assigned INDC document distribution code(s). This is followed by four shorter lists, indicating the names of individuals in each distribution category, sorted by country or international organization, and the total number of individuals in each category. The final section provides the names of nuclear data committee members also listed by country or international organization

INDC list of correspondents for the exchange of nuclear data information and compilation of National Nuclear Data Committees

International Nuclear Information System (INIS)

1984-07-01

The report is presented in five sections. In the first section a detailed description of the INDC distribution categories, distribution codes and document designator codes is given. The second section describes the aims, organization and objectives of individual national nuclear data committees. The third section lists names and addresses in alphabetical order within each state or international organization; INDC document distribution code(s), committee membership and/or area of specialization are indicated, where applicable, for each person. This is followed by four shorter lists, indicating the names of individuals in each distribution category, sorted by country or international organization, and the total number of individuals in each category. The final section provides the names of nuclear data committee members also listed by country or international organization

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...

Generation of correlated finite alphabet waveforms using gaussian random variables

KAUST Repository

Jardak, Seifallah; Ahmed, Sajid; Alouini, Mohamed-Slim

2014-01-01

, the proposed scheme is general, the main focus of this paper is to generate finite alphabet waveforms for multiple-input multiple-output radar, where correlated waveforms are used to achieve desired beampatterns. © 2014 IEEE.

Sur l’origine de l’écriture libyque. Quelques propositions On the origin of the Libyco-Berber alphabet: A few proposals

Directory of Open Access Journals (Sweden)

Dominique Casajus

2013-06-01

Full Text Available Le présent article propose quelques hypothèses sur l’origine des alphabets dits libyques. Attestés par plus d’un millier d’inscriptions recueillies dans toute l’Afrique du Nord, depuis la Libye jusqu’aux îles Canaries, ces alphabets sont selon toute vraisemblance les ancêtres des alphabets touaregs actuels. La seule inscription qui ait pu être datée avec un degré raisonnable de certitude est une bilingue libyco-punique, mise au jour sur le site de Dougga (Tunisie, qui daterait de 139 avant J.-C. Il semble que les alphabets libyques existaient déjà alors depuis plusieurs siècles. Leurs créateurs ont emprunté quelques lettres (au moins quatre aux alphabets phénico-puniques. Pour composer les autres lettres, ils semblent avoir eu recours à des procédés géométriques simples qu’on essaie ici de reconstituer.A few hypotheses about the origin of the so-called “Libyan” alphabets are presented. Attested in more than a thousand inscriptions from Libya to the Canary Islands in northern Africa, these alphabets are probably the forebears of the current ones used by the Tuareg. The only inscription that has been dated (139 BCE with a reasonable degree of certainty is bilingual, Libyco-Punic, from Dougga in Tunisia. The “Libyan” alphabets apparently already existed, several centuries earlier. Their creators borrowed a few — at least four — letters from the Phoenician/Punic alphabets; and apparently used simple geometric procedures, which are reconstituted herein, for the other letters.

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

Genesis, visual attributes and contemporary communication features of the alphabet

Directory of Open Access Journals (Sweden)

Filip Cvitić

2014-10-01

Full Text Available Throughout 5,000 years of human literacy, the alphabet system has developed from pictograms and ideograms to the contemporary system of Latin letters. The simplification of primary pictograms and their transformation to ideograms followed the major goal of written communication – to transmit thoughts and ideas. Besides, written communication has enabled preservation of knowledge, and that has generated the expansion of information and its availability today. The high speed of gathering written information, as well as its superabundance, calls for rethinking of semiotic features of Latin letters as the basic units of written communication in the Western world, especially in terms of marketing communication and its effectiveness. The written expression is the major tool of branding and getting closer to target market segments. Social development influences the development of communication, which is visible through numerous brands and signs, i.e. symbols that make products and companies recognizable in the market. The distinct sign forms of the alphabet are used to suggest the story of a brand, product or service. A constituent element of its comprehension is conscious or unconscious knowledge drawn from different sources in the environment. The history of human literacy, the development of each particular letter, the communication rules of the contemporary marketplace, the impact of brands and information superabundance make up the basis for further research into communication features of the alphabet, semantics of written forms and their redefinition in the context of effective marketing communication.

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2005-01-01

This is the 31st revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13,104 journal titles, 2,078 regularly scanned journals and 561 key journals. It was last updated in February 2005. The purpose of this report is to provide descriptive cataloguers with a standard entry for the full title of a journal. In addition to the full journal title, the ISSN (International Standard Serial Number), administered by the ISSN International Centre, Paris, France, and/or CODEN, assigned by Chemical Abstracts Service, USA, are given in this manual. In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part III, all journals that are regularly scanned by INIS Centers are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part IV, all journals that are regularly scanned by INIS Centers are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part V, all journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part VI, all journals are sorted alphabetically under their title. The name of the

INIS: Authority list for journal titles

Energy Technology Data Exchange (ETDEWEB)

NONE

2005-03-01

This is the 31st revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13,104 journal titles, 2,078 regularly scanned journals and 561 key journals. It was last updated in February 2005. The purpose of this report is to provide descriptive cataloguers with a standard entry for the full title of a journal. In addition to the full journal title, the ISSN (International Standard Serial Number), administered by the ISSN International Centre, Paris, France, and/or CODEN, assigned by Chemical Abstracts Service, USA, are given in this manual. In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part III, all journals that are regularly scanned by INIS Centers are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part IV, all journals that are regularly scanned by INIS Centers are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part V, all journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part VI, all journals are sorted alphabetically under their title. The name of the

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2006-01-01

This is the 32nd revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13,231 journal titles, 2,125 regularly scanned journals and 555 key journals. It was last updated in February 2006. The purpose of this report is to provide descriptive cataloguers with a standard entry for the full title of a journal. In addition to the full journal title, the ISSN (International Standard Serial Number), administered by the ISSN International Centre, Paris, France, and/or CODEN, assigned by Chemical Abstracts Service, USA, are given in this manual. In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part III, all journals that are regularly scanned by INIS Centres are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part IV, all journals that are regularly scanned by INIS Centres are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part V, all journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part VI, all journals are sorted alphabetically under their title. The name of the

A reduced amino acid alphabet for understanding and designing protein adaptation to mutation.

Science.gov (United States)

Etchebest, C; Benros, C; Bornot, A; Camproux, A-C; de Brevern, A G

2007-11-01

Protein sequence world is considerably larger than structure world. In consequence, numerous non-related sequences may adopt similar 3D folds and different kinds of amino acids may thus be found in similar 3D structures. By grouping together the 20 amino acids into a smaller number of representative residues with similar features, sequence world simplification may be achieved. This clustering hence defines a reduced amino acid alphabet (reduced AAA). Numerous works have shown that protein 3D structures are composed of a limited number of building blocks, defining a structural alphabet. We previously identified such an alphabet composed of 16 representative structural motifs (5-residues length) called Protein Blocks (PBs). This alphabet permits to translate the structure (3D) in sequence of PBs (1D). Based on these two concepts, reduced AAA and PBs, we analyzed the distributions of the different kinds of amino acids and their equivalences in the structural context. Different reduced sets were considered. Recurrent amino acid associations were found in all the local structures while other were specific of some local structures (PBs) (e.g Cysteine, Histidine, Threonine and Serine for the alpha-helix Ncap). Some similar associations are found in other reduced AAAs, e.g Ile with Val, or hydrophobic aromatic residues Trp with Phe and Tyr. We put into evidence interesting alternative associations. This highlights the dependence on the information considered (sequence or structure). This approach, equivalent to a substitution matrix, could be useful for designing protein sequence with different features (for instance adaptation to environment) while preserving mainly the 3D fold.

Random walks on semaphore codes and delay de Bruijn semigroups

OpenAIRE

Rhodes, John; Schilling, Anne; Silva, Pedro V.

2015-01-01

© 2016 World Scientific Publishing Company. We develop a new approach to random walks on de Bruijn graphs over the alphabet A through right congruences on A k , defined using the natural right action of A + . A major role is played by special right congruences, which correspond to semaphore codes and allow an easier computation of the hitting time. We show how right congruences can be approximated by special right congruences.

The Multidimensional Influence of Acculturation on Digit Symbol-Coding and Wisconsin Card Sorting Test in Hispanics.

Science.gov (United States)

Krch, Denise; Lequerica, Anthony; Arango-Lasprilla, Juan Carlos; Rogers, Heather L; DeLuca, John; Chiaravalloti, Nancy D

2015-01-01

The purpose of the current study was to evaluate the relative contribution of acculturation to two tests of nonverbal test performance in Hispanics. This study compared 40 Hispanic and 20 non-Hispanic whites on Digit Symbol-Coding (DSC) and the Wisconsin Card Sorting Test (WCST) and evaluated the relative contribution of the various acculturation components to cognitive test performance in the Hispanic group. Hispanics performed significantly worse on DSC and WCST relative to non-Hispanic whites. Multiple regressions conducted within the Hispanic group revealed that language use uniquely accounted for 11.0% of the variance on the DSC, 18.8% of the variance on WCST categories completed, and 13.0% of the variance in perseverative errors on the WCST. Additionally, years of education in the United States uniquely accounted for 14.9% of the variance in DSC. The significant impact of acculturation on DSC and WCST lends support that nonverbal cognitive tests are not necessarily culture free. The differential contribution of acculturation proxies highlights the importance of considering these separate components when interpreting performance on neuropsychological tests in clinical and research settings. Factors, such as the country where education was received, may in fact be more meaningful information than the years of education of education attained. Thus, acculturation should be considered an important factor in any cognitive evaluation of culturally diverse individuals.

INDC list of correspondents for the exchange of nuclear data information and compilation of National Nuclear Data Committees

International Nuclear Information System (INIS)

1991-01-01

The document includes information on currently existing National Nuclear Data Committees and their memberships. The report is presented in five sections. The first section contains a detailed description of the INDC distribution categories, distribution codes and document designator codes. The second section describes the aims, organization and objectives of individual national nuclear data committees. The third section lists names and addresses in alphabetical order within each state or international organization together with the assigned INDC document distribution code(s). This is followed by four shorter lists, indicating the names of individuals in each distribution category, sorted by country or international organization, and the total number of individuals in each category. The final section provides the names of nuclear data committee members also listed by country or international organization

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

[The alphabet of nature and the alphabet of culture in the eighteenth century. botany, diplomatics, and ethno-linguistics according to Carl von Linné, Johann Christoph Gatterer, and Christian Wilhelm Büttner : Botany, Diplomatics, and ethno-linguistics according to Carl von Linné, Johann Christoph Gatterer, and Christian Wilhelm Büttner].

Science.gov (United States)

Gierl, Martin

2010-01-01

In the middle of the eighteenth century, Carl von Linné, Johann Christoph Gatterer, and Christian Wilhelm Büttner attempted to realize the old idea of deciphering the alphabet of the world, which Francis Bacon had raised as a general postulate of science. This article describes these attempts and their interrelations. Linné used the model of the alphabet to classify plants according to the characters of this fruiting body. Gatterer, one of the leading German historians during the Enlightenment, adopted the botanical method of classification by genus and species to classify the history of scripts. He used the forms of the alphabetic characters to measure the age of manuscripts and to map the process of history as a genealogy of culture. Gatterer collaborated closely with Büttner, the first Göttingen professor of natural history. Büttner constructed a general alphabet of languages which connected the phonetics of language with the historically known alphabets. Early on, diplomatics and ethnography combined the natural order of natural history and the cultural order of the alphabet with the attempt to register development and to document development by the evolution of forms. Based on the shared model of the alphabet and on the common necessity to classify their empirical material, natural history and the description of culture were related attempts in the middle of the eighteenth century to comprehend the alphabetically organized nature and a naturally ordered culture.

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.

Parents' Goals for and Perceptions of Alphabet Books

Science.gov (United States)

Nowak, Sarah N.; Evans, Mary Ann

2013-01-01

This study examined parents' goals for reading ABC books with their children and their perceptions of page features. Factor analysis of a questionnaire answered by 225 parents of junior and senior kindergarten students revealed four goals for reading alphabet books. In order of importance as rated by parents the goals were: Learning to Read,…

Generation of correlated finite alphabet waveforms using gaussian random variables

KAUST Repository

Ahmed, Sajid

2016-01-13

Various examples of methods and systems are provided for generation of correlated finite alphabet waveforms using Gaussian random variables in, e.g., radar and communication applications. In one example, a method includes mapping an input signal comprising Gaussian random variables (RVs) onto finite-alphabet non-constant-envelope (FANCE) symbols using a predetermined mapping function, and transmitting FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The FANCE waveforms can be based upon the mapping of the Gaussian RVs onto the FANCE symbols. In another example, a system includes a memory unit that can store a plurality of digital bit streams corresponding to FANCE symbols and a front end unit that can transmit FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The system can include a processing unit that can encode the input signal and/or determine the mapping function.

Generation of correlated finite alphabet waveforms using gaussian random variables

KAUST Repository

Ahmed, Sajid; Alouini, Mohamed-Slim; Jardak, Seifallah

2016-01-01

Various examples of methods and systems are provided for generation of correlated finite alphabet waveforms using Gaussian random variables in, e.g., radar and communication applications. In one example, a method includes mapping an input signal comprising Gaussian random variables (RVs) onto finite-alphabet non-constant-envelope (FANCE) symbols using a predetermined mapping function, and transmitting FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The FANCE waveforms can be based upon the mapping of the Gaussian RVs onto the FANCE symbols. In another example, a system includes a memory unit that can store a plurality of digital bit streams corresponding to FANCE symbols and a front end unit that can transmit FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The system can include a processing unit that can encode the input signal and/or determine the mapping function.

Is Chinese Special? Four Aspects of Chinese Literacy Acquisition That Might Distinguish Learning Chinese from Learning Alphabetic Orthographies

Science.gov (United States)

McBride, Catherine Alexandra

2016-01-01

Some aspects of Chinese literacy development do not conform to patterns of literacy development in alphabetic orthographies. Four are highlighted here. First, semantic radicals are one aspect of Chinese characters that have no analogy to alphabetic orthographies. Second, the unreliability of phonological cues in Chinese along with the fact that…

Decoding the Assessment Alphabet Soup

Science.gov (United States)

Engelhardt, Paula

2010-10-01

The number of assessment instruments that help physics instructors evaluate the conceptual learning of their students has grown over the last twenty years. Today, the number of tests that are available begin to look like an alphabet soup, FCI, MBT, TUG-K, CSE, CSM, CSEM, DIRECT, BEMA, LOCE, FMCE, SEMCO, etc. What can these assessment tests do for you that is different from what you regularly do? How do these tests differ from the tests and other assessments you already give in class? What is meant by formative and summative assessment and why should you care? What are some of the issues associated with giving one of these assessment tests? These are the questions that will be addressed in this talk.

Logic-Symbolic and Alphabetization

Directory of Open Access Journals (Sweden)

Dair Aily Franco de Camargo

2007-10-01

Full Text Available The present article tries to recoup the ideas and the proposal of H. Furth (1973, pointing it as another option to try to work with the children’s difficulties in the alphabetization process. The author considers the substitution of “schools of the language” for “schools of the thought”, that is, to substitute the option of the teacher in the reading-writing education, in its traditional form, of how to transform graphical signals into sonorous and vice-versa, for that one of the thought consolidation, feeding the intellect in development of the child by exercises of “symbolic logic”. For theoretical basing, we still present some aspects of the psychogenetic theory, as well as other works carried through more recently on the subject, that even so “transvestite” (disguised with new clothing, still find their beddings in the J. Piaget’s basis.

dNTPs :  the alphabet of life

OpenAIRE

Kumar, Dinesh

2010-01-01

From microscopic bacteria to the giant whale, every single living organism on Earth uses the same language of life: DNA. Deoxyribonucleoside triphosphates––dNTPs (dATP, dTTP, dGTP, and dCTP)––are the building blocks of DNA and are therefore the “alphabet of life”. A balanced supply of dNTPs is essential for integral DNA transactions such as faithful genome duplication and repair. The enzyme ribonucleotide reductase (RNR) not only synthesizes all four dNTPs but also primarily maintains the cru...

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.

Modes of Alphabet Letter Production during Middle Childhood and Adolescence: Interrelationships with Each Other and Other Writing Skills

Directory of Open Access Journals (Sweden)

Zachary Alstad

2015-02-01

Full Text Available Although handwriting is typically taught during early childhood and keyboarding may not be taught explicitly, both may be relevant to writing development in the later grades. Thus, Study 1 investigated automatic production of the ordered alphabet from memory for manuscript (unjoined, cursive (joined, keyboard letter modes (alphabet 15 sec, their relationships with each other, and spelling and composing in typically developing writers in grades 4 to 7 (n =113. Study 2 compared students with dysgraphia (impaired handwriting, n=27, dyslexia (impaired word spelling, n=40, or oral and written language learning disability (OWL LD (impaired syntax composing, n=11 or controls without specific writing disabilities (n=10 in grades 4 to 9 (n=88 on the same alphabet 15 modes, manner of copying, spelling, and sentence composing. In Study 1, sequential multilevel model regressions of predictor alphabet 15 letter production/selection modes on spelling and composition outcomes, measured annually from grade 4 to grade 7 (ages 9 to 13 years, showed that only the cursive mode uniquely, positively, and consistently predicted both spelling and composing in each grade. For composing, in grade 4 manuscript mode was positively predictive and in grades 5-7 keyboard selection was. In Study 2 all letter production modes correlated with each other and one’s best and fast sentence copying, spelling, and timed sentence composing. The groups with specific writing disabilities differed from control group on alphabet 15 manuscript mode, copy fast, and timed sentence composing. The dysgraphia and dyslexia groups differed on copying sentences in one’s best handwriting, with the dysgraphia group scoring lower. The educational and theoretical significance of the findings are discussed for multiple modes and manners of letter production/selection of the alphabet that support spelling and composing beyond the early grades in students with and without specific writing

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...

High-speed architecture for the decoding of trellis-coded modulation

Science.gov (United States)

Osborne, William P.

1992-01-01

Since 1971, when the Viterbi Algorithm was introduced as the optimal method of decoding convolutional codes, improvements in circuit technology, especially VLSI, have steadily increased its speed and practicality. Trellis-Coded Modulation (TCM) combines convolutional coding with higher level modulation (non-binary source alphabet) to provide forward error correction and spectral efficiency. For binary codes, the current stare-of-the-art is a 64-state Viterbi decoder on a single CMOS chip, operating at a data rate of 25 Mbps. Recently, there has been an interest in increasing the speed of the Viterbi Algorithm by improving the decoder architecture, or by reducing the algorithm itself. Designs employing new architectural techniques are now in existence, however these techniques are currently applied to simpler binary codes, not to TCM. The purpose of this report is to discuss TCM architectural considerations in general, and to present the design, at the logic gate level, or a specific TCM decoder which applies these considerations to achieve high-speed decoding.

Genetic coding and united-hypercomplex systems in the models of algebraic biology.

Science.gov (United States)

Petoukhov, Sergey V

2017-08-01

Structured alphabets of DNA and RNA in their matrix form of representations are connected with Walsh functions and a new type of systems of multidimensional numbers. This type generalizes systems of complex numbers and hypercomplex numbers, which serve as the basis of mathematical natural sciences and many technologies. The new systems of multi-dimensional numbers have interesting mathematical properties and are called in a general case as "systems of united-hypercomplex numbers" (or briefly "U-hypercomplex numbers"). They can be widely used in models of multi-parametrical systems in the field of algebraic biology, artificial life, devices of biological inspired artificial intelligence, etc. In particular, an application of U-hypercomplex numbers reveals hidden properties of genetic alphabets under cyclic permutations in their doublets and triplets. A special attention is devoted to the author's hypothesis about a multi-linguistic in DNA-sequences in a relation with an ensemble of U-numerical sub-alphabets. Genetic multi-linguistic is considered as an important factor to provide noise-immunity properties of the multi-channel genetic coding. Our results attest to the conformity of the algebraic properties of the U-numerical systems with phenomenological properties of the DNA-alphabets and with the complementary device of the double DNA-helix. It seems that in the modeling field of algebraic biology the genetic-informational organization of living bodies can be considered as a set of united-hypercomplex numbers in some association with the famous slogan of Pythagoras "the numbers rule the world". Copyright © 2017 Elsevier B.V. All rights reserved.

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.

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.

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)

46 CFR Table I to Part 150 - Alphabetical List of Cargoes

Science.gov (United States)

2010-10-01

... cargo name), see Caustic potash solution 5 2 CPS Potassium oleate 34 POE Potassium salt of polyolefin... Sodium polyacrylate solution 43 2 Sodium salt of Ferric hydroxyethylethylenediaminetriacetic acid... 46 Shipping 5 2010-10-01 2010-10-01 false Alphabetical List of Cargoes I Table I to Part 150...

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

Comparing Different Strategies in Directed Evolution of Enzyme Stereoselectivity: Single- versus Double-Code Saturation Mutagenesis.

Science.gov (United States)

Sun, Zhoutong; Lonsdale, Richard; Li, Guangyue; Reetz, Manfred T

2016-10-04

Saturation mutagenesis at sites lining the binding pockets of enzymes constitutes a viable protein engineering technique for enhancing or inverting stereoselectivity. Statistical analysis shows that oversampling in the screening step (the bottleneck) increases astronomically as the number of residues in the randomization site increases, which is the reason why reduced amino acid alphabets have been employed, in addition to splitting large sites into smaller ones. Limonene epoxide hydrolase (LEH) has previously served as the experimental platform in these methodological efforts, enabling comparisons between single-code saturation mutagenesis (SCSM) and triple-code saturation mutagenesis (TCSM); these employ either only one or three amino acids, respectively, as building blocks. In this study the comparative platform is extended by exploring the efficacy of double-code saturation mutagenesis (DCSM), in which the reduced amino acid alphabet consists of two members, chosen according to the principles of rational design on the basis of structural information. The hydrolytic desymmetrization of cyclohexene oxide is used as the model reaction, with formation of either (R,R)- or (S,S)-cyclohexane-1,2-diol. DCSM proves to be clearly superior to the likewise tested SCSM, affording both R,R- and S,S-selective mutants. These variants are also good catalysts in reactions of further substrates. Docking computations reveal the basis of enantioselectivity. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

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...

ALPHABET "Ante Portas": How English Text Invades Japanese Public Space

Science.gov (United States)

Backhaus, Peter

2007-01-01

This paper examines the prominence of written English on shop signs in Japan. Based on data from a larger empirical study into multilingual signs in Tokyo, the most common ways of using English and the roman alphabet on Japanese shops signs are identified. It is argued that the ambivalent nature of English loan words plays a key role in the ever…

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...

American Sign Language Alphabet Recognition Using a Neuromorphic Sensor and an Artificial Neural Network

Directory of Open Access Journals (Sweden)

Miguel Rivera-Acosta

2017-09-01

Full Text Available This paper reports the design and analysis of an American Sign Language (ASL alphabet translation system implemented in hardware using a Field-Programmable Gate Array. The system process consists of three stages, the first being the communication with the neuromorphic camera (also called Dynamic Vision Sensor, DVS sensor using the Universal Serial Bus protocol. The feature extraction of the events generated by the DVS is the second part of the process, consisting of a presentation of the digital image processing algorithms developed in software, which aim to reduce redundant information and prepare the data for the third stage. The last stage of the system process is the classification of the ASL alphabet, achieved with a single artificial neural network implemented in digital hardware for higher speed. The overall result is the development of a classification system using the ASL signs contour, fully implemented in a reconfigurable device. The experimental results consist of a comparative analysis of the recognition rate among the alphabet signs using the neuromorphic camera in order to prove the proper operation of the digital image processing algorithms. In the experiments performed with 720 samples of 24 signs, a recognition accuracy of 79.58% was obtained.

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

Teaching Beginning Braille Reading Using an Alphabet or Uncontracted Braille Approach

Science.gov (United States)

Day, Janice Neibaur; McDonnell, Andrea P.; O'Neill, Rob

2008-01-01

This study examined the effects of using a research based print reading program modified to accommodate beginning braille readers using an alphabet or uncontracted braille reading approach with five beginning braille readers. Four of the 5 participants displayed a clear increase in their ability to read high frequency words when they began using…

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....

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.

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.

Magnet sorting algorithms

International Nuclear Information System (INIS)

Dinev, D.

1996-01-01

Several new algorithms for sorting of dipole and/or quadrupole magnets in synchrotrons and storage rings are described. The algorithms make use of a combinatorial approach to the problem and belong to the class of random search algorithms. They use an appropriate metrization of the state space. The phase-space distortion (smear) is used as a goal function. Computational experiments for the case of the JINR-Dubna superconducting heavy ion synchrotron NUCLOTRON have shown a significant reduction of the phase-space distortion after the magnet sorting. (orig.)

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.

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...

Cyrillic alphabet as the designation of national identity among students of University of Priština with temporary head office in Kosovska Mitrovica

Directory of Open Access Journals (Sweden)

Miketić Sanja D.

2016-01-01

Full Text Available The relationship between culture and nationality and in that sense - national identity of a particular community - is a known thing for a long time. Nationality is usually strongly connected to culture. We will only mention few of their joint characteristics: language, religion, art, customs, tradition etc. In this article special attention will be paid to one of the features of national identity - language - and we will focus on the usage of Cyrillic alphabet of our target group (students of University of Priština, with temporary head office in Kosovska Mitrovica. The study consists of two smaller researches. In the first part we explored reactions of students at University of Priština and we assumed that they will have different reactions towards Cyrillic alphabet and Latin alphabet used as stimuli-words comparing to pupils of Belgrade and Zrenjanin high schools and students of University of Belgrade, Novi Sad and Niš presented in The associative dictionary of Serbian language (Asocjativni rečnik srpskog jezika, 2005. In the second part we tried to find out if our informants prefer the usage of Cyrillic or Latin alphabet, and which one they find better in the esthetic sense. We compared attitudes of students who enroll University of Priština to attitudes of students who enroll University of Belgrade and differences between their attitudes. With both researches we wanted to see if there are formed verbal stereotypes with positive or negative connotation, and what are the attitudes on using Cyrillic alphabet among students in the age of expansion of Latin alphabet. We concluded that Cyrillic alphabet is more used and valued at University of Priština than in the rest of Republic of Serbia and the reason for that might be the stronger sense of national identity among these students.

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)

High-Rate Field Demonstration of Large-Alphabet Quantum Key Distribution

Science.gov (United States)

2016-10-12

count rate of Bob’s detectors. In this detector-limited regime , it is advantageous to increase M to encode as much information as possible in each...High- rate field demonstration of large-alphabet quantum key distribution Catherine Lee,1, 2 Darius Bunandar,1 Zheshen Zhang,1 Gregory R. Steinbrecher...October 12, 2016) 2 Quantum key distribution (QKD) enables secure symmetric key exchange for information-theoretically secure com- munication via one-time

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

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.

Perceptual Confusions of the Manual Alphabet by Naive, Trained, and Familiar Users.

Science.gov (United States)

Hawes, M. Dixie; Danhauer, Jeffrey L.

1980-01-01

An investigation of the confusion resulting from reliance on visual perceptual teachers in the identification of dactylemes (handshapes) in the American Manual Alphabet (MA) is reported. A hierarchy of errors varying with subjects' degree of expertness in the MA is established. This can help manual communication teachers develop techniques for…

The Effects of Shona Language Change on Monolingual Lexicography: The Need for a Revised Alphabet

Directory of Open Access Journals (Sweden)

William Zivenge

2011-10-01

Full Text Available

ABSTRACT: In this article, the phenomenon of Shona language change, its effects on lexicography and the need for a revised alphabet are discussed. Because of the defective Shona alphabet, lexicographers at the African Languages Research Institute (ALRI encountered problems in handling some words that were potential headwords in dictionaries they were compiling under the ALLEX project. The current Shona alphabet is unable to realize quite a number of sounds and morphemes in lexical items in everyday use by the native Shona speakers, because they are alien loanwords. The article was prompted by the challenges encountered during the compilation of Duramazwi reMimhanzi (Shona Musical Terms Dictionary. It shows how language change accounts for the problem of headword selection and how modifying the current alphabet can enhance monolingual Shona lexicographical work vis-à-vis the development of the Shona language. It therefore stresses the need for a revised alphabet so as to solve orthographical problems during dictionary compilation.

PFUPISO YECHINYORWA: Matambudziko Anosanganwa Nawo Mukugadzira Maduramazwi eMutauro Mumwe chete neKuda Kwekushanduka Kwemutauro weChiShona: Panofanirwa Kuva neManyorerwo eChiShona Matsva. Muchinyorwa chino vanyori vanoongorora kushanduka kuri kuita mutauro weChiShona nekufamba kuri kuita nguva nematambudziko anosanganikwa nawo nekuda kweshanduko iyi zvikurusei mukugadzira maduramazwi ari mururimi rweChiShona chete. Vanyori vanoonesawo pfungwa yekuti panodiwa manyorerwo matsva. Nyanzvi dzinogadzira maduramazwi paAfrican Languages Research Institute (ALRI dzinosangana namadambudziko esarudzo yamazwi padzinenge dzichisarudza mazwi adzinenge dzichida kuisa mumaduramazwi adzinogadzira pachirongwa chokugadzira maduramazwi chinonzi ALLEX. Dambudziko resarudzo yemazwi rinowanikwa nekuda kwechimiro chebumbiro remanyorerwo eChiShona risingatenderi mamwe mavara ari mune imwe mitauro asiri muChiShona. Bumbiro iri

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.

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.

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.

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.

Action Research of a Color-Coded, Onset-Rime Decoding Intervention: Examining the Effects with First Grade Students Identified as at Risk

Science.gov (United States)

Wall, Candace A.; Rafferty, Lisa A.; Camizzi, Mariya A.; Max, Caroline A.; Van Blargan, David M.

2016-01-01

Many students who struggle to obtain the alphabetic principle are at risk for being identified as having a reading disability and would benefit from additional explicit phonics instruction as a remedial measure. In this action research case study, the research team conducted two experiments to investigate the effects of a color-coded, onset-rime,…

Computerized Dental Comparison: A Critical Review of Dental Coding and Ranking Algorithms Used in Victim Identification.

Science.gov (United States)

Adams, Bradley J; Aschheim, Kenneth W

2016-01-01

Comparison of antemortem and postmortem dental records is a leading method of victim identification, especially for incidents involving a large number of decedents. This process may be expedited with computer software that provides a ranked list of best possible matches. This study provides a comparison of the most commonly used conventional coding and sorting algorithms used in the United States (WinID3) with a simplified coding format that utilizes an optimized sorting algorithm. The simplified system consists of seven basic codes and utilizes an optimized algorithm based largely on the percentage of matches. To perform this research, a large reference database of approximately 50,000 antemortem and postmortem records was created. For most disaster scenarios, the proposed simplified codes, paired with the optimized algorithm, performed better than WinID3 which uses more complex codes. The detailed coding system does show better performance with extremely large numbers of records and/or significant body fragmentation. © 2015 American Academy of Forensic Sciences.

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.

Compendium of technical computer codes used in support of the DOE Office of Civilian Radioactive Waste Management

International Nuclear Information System (INIS)

McBride, A.F.; Austin, P.N.; Ward, W.M.; McCarn, L.B.; Roddy, J.W.; Ludwig, S.B.; Reich, W.J.; Roussin, R.W.

1989-04-01

A compilation of technical computer codes related to ongoing work under the cognizance of the US Department of Energy's Office of Civilian Radioactive Waste Management (DOE/OCRWM) is presented. Much of the information was obtained from responses to a questionnaire distributed by DOE/OCRWM to all DOE offices associated with the radioactive waste management program. The codes are arranged alphabetically by name. In addition to the code description, each sheet includes other data such as computer hardware and software requirements, document references, name of respondent, and code variants. The codes are categorized into seventeen subject areas plus a miscellaneous category. Some of the subject areas covered are atmospheric dispersion, biosphere transport, geochemistry, nuclear radiation transport, nuclide inventory, and risk assessment. Three appendixes are included which list the names of the contributors, a list of the literature reviewed, and a glossary of computer code terminology and definitions. 50 refs., 3 tabs

Coding for Two Dimensional Constrained Fields

DEFF Research Database (Denmark)

Laursen, Torben Vaarbye

2006-01-01

a first order model to model higher order constraints by the use of an alphabet extension. We present an iterative method that based on a set of conditional probabilities can help in choosing the large numbers of parameters of the model in order to obtain a stationary model. Explicit results are given...... for the No Isolated Bits constraint. Finally we present a variation of the encoding scheme of bit-stuffing that is applicable to the class of checkerboard constrained fields. It is possible to calculate the entropy of the coding scheme thus obtaining lower bounds on the entropy of the fields considered. These lower...... bounds are very tight for the Run-Length limited fields. Explicit bounds are given for the diamond constrained field as well....

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…

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...

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...

Effective Teaching Strategies: Case Studies from the Alphabetic Braille and Contracted Braille Study

Science.gov (United States)

Barclay, Lizbeth; Herlich, Stephanie A.; Sacks, Sharon Zell

2010-01-01

This article discusses some of the qualitative data that were documented during the Alphabetic Braille and Contracted Braille Study. Two case studies of students are described, highlighting many effective teaching strategies used by their teachers of students with visual impairments that resulted in the students' successful academic progress.…

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)

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...

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...

Sorting the Alphabet Soup of Renal Pathology: A Review.

Science.gov (United States)

Curran-Melendez, Sheilah M; Hartman, Matthew S; Heller, Matthew T; Okechukwu, Nancy

2016-01-28

Diseases of the kidney often have their names shortened, creating an arcane set of acronyms which can be confusing to both radiologists and clinicians. This review of renal pathology aims to explain some of the most commonly used acronyms within the field. For each entity, a summary of the clinical features, pathophysiology, and radiological findings is included to aid in the understanding and differentiation of these entities. Discussed topics include acute cortical necrosis, autosomal dominant polycystic kidney disease, angiomyolipoma, autosomal recessive polycystic kidney disease, acute tubular necrosis, localized cystic renal disease, multicystic dysplastic kidney, multilocular cystic nephroma, multilocular cystic renal cell carcinoma, medullary sponge kidney, paroxysmal nocturnal hemoglobinuria, renal papillary necrosis, transitional cell carcinoma, and xanthogranulomatous pyelonephritis. Copyright © 2016 Mosby, Inc. All rights reserved.

Data summary of municipal solid waste management alternatives. Volume 11, Alphabetically indexed bibliography

Energy Technology Data Exchange (ETDEWEB)

None

1992-10-01

This appendix contains the alphabetically indexed bibliography for the complete group of reports on municipal waste management alternatives. The references are listed for each of the following topics: mass burn technologies, RDF technologies, fluidized-bed combustion, pyrolysis and gasification of MSW, materials recovery- recycling technologies, sanitary landfills, composting, and anaerobic digestion of MSW.

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)

Viewing speech in action: speech articulation videos in the public domain that demonstrate the sounds of the International Phonetic Alphabet (IPA)

OpenAIRE

Nakai, S.; Beavan, D.; Lawson, E.; Leplâtre, G.; Scobbie, J. M.; Stuart-Smith, J.

2016-01-01

In this article, we introduce recently released, publicly available resources, which allow users to watch videos of hidden articulators (e.g. the tongue) during the production of various types of sounds found in the world’s languages. The articulation videos on these resources are linked to a clickable International Phonetic Alphabet chart ([International Phonetic Association. 1999. Handbook of the International Phonetic Association: A Guide to the Use of the International Phonetic Alphabet. ...

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...

Illegal alphabets and adult biliteracy latino migrants crossing the linguistic border, expanded edition

CERN Document Server

Kalmar, Tomás Mario

2015-01-01

How do "illegal aliens" chart the speech sounds of colloquial English? This book is timeless in offering an unusually direct entry into how a group of Mexican fruit pickers analyze their first encounter with local American speech in a tiny rural Midwestern community in the United States. Readers see close up how intelligently migrant workers help each other use what they already know-the alphabetic principle of one letter, one sound-to teach each other, from scratch, at the very first contact, a language which none of them can speak. They see how and why the strategies adult immigrants actually use in order to cope with English in the real world seem to have little in common with those used in publicly funded bilingual and ESL classrooms. What's new in this expanded edition of Tomás Mario Kalmar's landmark Illegal Alphabets and Adult Biliteracy are in-depth commentaries from six distinguished scholars-Peter Elbow, Ofelia García, James Paul Gee, Hervé Varenne, Luis Vázquez León, Karen Velasquez-who bring ...

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.

Construction of Fixed Rate Non-Binary WOM Codes Based on Integer Programming

Science.gov (United States)

Fujino, Yoju; Wadayama, Tadashi

In this paper, we propose a construction of non-binary WOM (Write-Once-Memory) codes for WOM storages such as flash memories. The WOM codes discussed in this paper are fixed rate WOM codes where messages in a fixed alphabet of size $M$ can be sequentially written in the WOM storage at least $t^*$-times. In this paper, a WOM storage is modeled by a state transition graph. The proposed construction has the following two features. First, it includes a systematic method to determine the encoding regions in the state transition graph. Second, the proposed construction includes a labeling method for states by using integer programming. Several novel WOM codes for $q$ level flash memories with 2 cells are constructed by the proposed construction. They achieve the worst numbers of writes $t^*$ that meet the known upper bound in many cases. In addition, we constructed fixed rate non-binary WOM codes with the capability to reduce ICI (inter cell interference) of flash cells. One of the advantages of the proposed construction is its flexibility. It can be applied to various storage devices, to various dimensions (i.e, number of cells), and various kind of additional constraints.

Promoting Alphabet Knowledge Using Peer-Mediated Intervention: A Dynamic Duo for Early Literacy Development

Science.gov (United States)

Harris, Kathleen I.; Kinley, Hannah L.; Cook, Angela

2017-01-01

One of early childhood teachers' first questions of parents with regard to school readiness is whether the child knows the ABCs (Hyson & Tomlinson, 2014). Crucial pre-reading and writing skills, such as oral language, phonological awareness, print awareness, and alphabet letter recognition, are important to children's cognitive development…

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....

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.

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.

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.

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.

Federal Logistics Information System (FLIS) Procedures Manual. Volume 8. Document Identifier Code Input/Output Formats (Fixed Length)

Science.gov (United States)

1994-07-01

REQUIRED MIX OF SEGMENTS OR INDIVIDUAL DATA ELEMENTS TO BE EXTRACTED. IN SEGMENT R ON AN INTERROGATION TRANSACTION (LTI), DATA RECORD NUMBER (DRN 0950) ONLY...and zation and Marketing input DICs. insert the Continuation Indicator Code (DRN 8555) in position 80 of this record. Maximum of OF The assigned NSN...for Procurement KFR, File Data Minus Security Classified Characteristics Data KFC 8.5-2 DoD 4100.39-M Volume 8 CHAPTER 5 ALPHABETIC INDEX OF DIC

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.

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.)

The Authoritarian Personality in Emerging Adulthood: Longitudinal Analysis Using Standardized Scales, Observer Ratings, and Content Coding of the Life Story.

Science.gov (United States)

Peterson, Bill E; Pratt, Michael W; Olsen, Janelle R; Alisat, Susan

2016-04-01

Three different methods (a standardized scale, an observer-based Q-sort, and content coding of narratives) were used to study the continuity of authoritarianism longitudinally in emerging and young adults. Authoritarianism was assessed in a Canadian sample (N = 92) of men and women at ages 19 and 32 with Altemeyer's (1996) Right-Wing Authoritarianism (RWA) Scale. In addition, components of the authoritarian personality were assessed at age 26 through Q-sort observer methods (Block, 2008) and at age 32 through content coding of life stories. Age 19 authoritarianism predicted the Q-sort and life story measures of authoritarianism. Two hierarchical regression analyses showed that the Q-sort and life story measures of authoritarianism also predicted the RWA scale at age 32 beyond educational level and parental status, and even after the inclusion of age 19 RWA. Differences and similarities in the pattern of correlates for the Q-sort and life story measures are discussed, including the overall lack of results for authoritarian aggression. Content in narratives may be the result of emerging adult authoritarianism and may serve to maintain levels of authoritarianism in young adulthood. © 2014 Wiley Periodicals, Inc.

Familial Colorectal Cancer: Understanding the Alphabet Soup.

Science.gov (United States)

Giglia, Matthew D; Chu, Daniel I

2016-09-01

While most colorectal cancers (CRCs) originate from nonhereditary spontaneous mutations, one-third of cases are familial or hereditary. Hereditary CRCs, which account for < 5% of all CRCs, have identifiable germline mutations and phenotypes, such as Lynch syndrome and familial adenomatous polyposis (FAP). Familial CRCs, which account for up to 30% of CRCs, have no identifiable germline mutation or specific pattern of inheritance, but higher-than-expected incidence within a family. Since the discovery that certain genotypes can lead to development of CRC, thousands of mutations have now been implicated in CRC. These new findings have enhanced our ability to identify at-risk patients, initiate better surveillance, and take preventative measures. Given the large number of genes now associated with hereditary and familial CRCs, clinicians should be familiar with the alphabet soup of genes to provide the highest quality of care for patients and families.

Collaborative Research: The Alphabetic Braille and Contracted Braille Study as an Example of Collaborative Research

Science.gov (United States)

Wormsley, Diane P.; Emerson, Robert Wall; Erin, Jane

2011-01-01

This article examines the Alphabetic Braille Contracted Braille Study in relation to the dimensions of collaborative research: extent, intensity, substance, heterogeneity, velocity, formality, and productivity. It also discusses the dimensions of financing research and researchers' attitudes. The overall consensus is that the study would not have…

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)

The Ideological Aspects of Contemporary Cyrillic Alphabet Transliteration Practices in the Balkans

Directory of Open Access Journals (Sweden)

Giustina Selvelli

2016-02-01

Full Text Available This article illustrates the new rules on the transliteration of the Cyrillic alphabet adopted in Bulgaria, Serbia and the Republic of Macedonia over the last few years. It also considers the possible political and identity reasons underlying changes to such practices. To this aim, I contextualize the question within various ongoing debates in the respective countries, with reference to the ideologies that have emerged in the most recent post-socialist period.

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...

Circular codes revisited: a statistical approach.

Science.gov (United States)

Gonzalez, D L; Giannerini, S; Rosa, R

2011-04-21

In 1996 Arquès and Michel [1996. A complementary circular code in the protein coding genes. J. Theor. Biol. 182, 45-58] discovered the existence of a common circular code in eukaryote and prokaryote genomes. Since then, circular code theory has provoked great interest and underwent a rapid development. In this paper we discuss some theoretical issues related to the synchronization properties of coding sequences and circular codes with particular emphasis on the problem of retrieval and maintenance of the reading frame. Motivated by the theoretical discussion, we adopt a rigorous statistical approach in order to try to answer different questions. First, we investigate the covering capability of the whole class of 216 self-complementary, C(3) maximal codes with respect to a large set of coding sequences. The results indicate that, on average, the code proposed by Arquès and Michel has the best covering capability but, still, there exists a great variability among sequences. Second, we focus on such code and explore the role played by the proportion of the bases by means of a hierarchy of permutation tests. The results show the existence of a sort of optimization mechanism such that coding sequences are tailored as to maximize or minimize the coverage of circular codes on specific reading frames. Such optimization clearly relates the function of circular codes with reading frame synchronization. Copyright © 2011 Elsevier Ltd. All rights reserved.

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

A Note on Sequence Prediction over Large Alphabets

Directory of Open Access Journals (Sweden)

Travis Gagie

2012-02-01

Full Text Available Building on results from data compression, we prove nearly tight bounds on how well sequences of length n can be predicted in terms of the size σ of the alphabet and the length k of the context considered when making predictions. We compare the performance achievable by an adaptive predictor with no advance knowledge of the sequence, to the performance achievable by the optimal static predictor using a table listing the frequency of each (k + 1-tuple in the sequence. We show that, if the elements of the sequence are chosen uniformly at random, then an adaptive predictor can compete in the expected case if k ≤ logσ n – 3 – ε, for a constant ε > 0, but not if k ≥ logσ n.

Reliability issues and solutions for coding social communication performance in classroom settings.

Science.gov (United States)

Olswang, Lesley B; Svensson, Liselotte; Coggins, Truman E; Beilinson, Jill S; Donaldson, Amy L

2006-10-01

To explore the utility of time-interval analysis for documenting the reliability of coding social communication performance of children in classroom settings. Of particular interest was finding a method for determining whether independent observers could reliably judge both occurrence and duration of ongoing behavioral dimensions for describing social communication performance. Four coders participated in this study. They observed and independently coded 6 social communication behavioral dimensions using handheld computers. The dimensions were mutually exclusive and accounted for all verbal and nonverbal productions during a specified time frame. The technology allowed for coding frequency and duration for each entered code. Data were collected from 20 different 2-min video segments of children in kindergarten through 3rd-grade classrooms. Data were analyzed for interobserver and intraobserver agreements using time-interval sorting and Cohen's kappa. Further, interval size and total observation length were manipulated to determine their influence on reliability. The data revealed interval sorting and kappa to be a suitable method for examining reliability of occurrence and duration of ongoing social communication behavioral dimensions. Nearly all comparisons yielded medium to large kappa values; interval size and length of observation minimally affected results. Implications The analysis procedure described in this research solves a challenge in reliability: comparing coding by independent observers of both occurrence and duration of behaviors. Results indicate the utility of a new coding taxonomy and technology for application in online observations of social communication in a classroom setting.

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

Moving Beyond of The Alphabet Soup of HIV Prevention

Science.gov (United States)

Collins, Chris; Coates, Thomas J.; Curran, James

2010-01-01

It is time to scrap the “ABCs” and elevate the debate on HIV prevention beyond the incessant controversies over individual interventions. The ABCs are a woefully incomplete list of necessary prevention interventions, but the goal should not be to just add more letters to the prevention alphabet. Instead, advancing global HIV prevention means holding national gover nments, donors and global agencies accountable for prevention efforts that are tailored to national epidemics, bring quality interventions to a scale, and address environmental factors in vulnerability. The debate is not so much about one intervention or another, but whether countries have a comprehensive prevention effort in place that responds to their own unique situations. PMID:18641471

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.

New free-release and sorting monitors developed for NPP A-1 decommissioning, Slovakia - 59071

International Nuclear Information System (INIS)

Slavik, Ondrej; Listjak, Martin; Kravar, Kamil; Slaninka, Alojz; Pely, Igor

2012-01-01

A pilot free-release monitoring post with a 600 L container monitor was developed and metrological tested within the 2. stage of NPP A1 decommissioning project. In order to reduce the volume of contaminated soil monitoring a conceptual design of fast sorting loader shovel monitor (loader's spoon) was proposed and tested within the project as well. The free-release monitoring post makes use of a pair of electrically cooled lead shielded semiconductor detectors placed into a mounting rack ensuring measurements in either horizontal (container monitoring) or vertical (drum monitoring) counting geometry. For evaluation of measured HPGe spectra the Canberra -Packard ISOCS detection efficiency calculation code was used. A loader is used to change the measured side of the 600 L container. For metrological certification of this monitor a special prototype test container with 24 rod sources inside a regular grid was necessary to design and to use. The mentioned above vertical counting geometry together with an additional drum rotator ensures standard free release monitoring of materials in 200 l rotating drums. Successful metrological qualification of the both counting geometries at SMU Bratislava showed 20 % accuracy class. A pair of NaI(Tl) detectors and a measurement and navigation frame ensuring loader shovel fixation in counting position are used for the fast sorting monitoring. The navigation of loader and its shovel to the counting geometry should be as fast as possible. The monitored results shall be indicated by a prompt light indication system (apart from storing on HDD). MCNP 5 calculation code was used for assessment of gross gamma 137 Cs detection efficiency. The estimated MDA for a pair of 2'' x 2'' Na(Tl) detectors and 30 s acquisition time is about 90 Bq/kg. However, due to the counting geometry deviations from calculated values the uncertainty of measurements can be relatively high. Hence, the system is applicable for sorting monitoring only. (authors)

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.

Hand Movements and Braille Reading Efficiency: Data from the Alphabetic Braille and Contracted Braille Study

Science.gov (United States)

Wright, Tessa; Wormsley, Diane P.; Kamei-Hannan, Cheryl

2009-01-01

Using a subset of data from the Alphabetic Braille and Contracted Braille Study, researchers analyzed the patterns and characteristics of hand movements as predictors of reading performance. Statistically significant differences were found between one- and two-handed readers and between patterns of hand movements and reading rates. (Contains 6…

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

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

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.

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

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.

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

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.

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 ...

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.

A family of names : rune-names and ogam-names and their relation to alphabet letter-names

NARCIS (Netherlands)

Griffiths, Alan

2013-01-01

The current consensus is that vernacular names assigned to the runes of the Germanic fuþark and to Irish ogam characters are indigenous creations independent of Mediterranean alphabet traditions. I propose, however, that ogam-names are based on interpretations of Hebrew, Greek or Latin letter-names

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.

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2007-01-01

This is the 33rd revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13 396 journal titles, 2 170 regularly scanned journals and 578 key journals. It was last updated in February 2007. A journal - or periodical - is a continuing publication issued in a succession of discrete parts, usually bearing numbering and/or chronological designations and intended to be continued indefinitely. It is generally published within a defined, fixed interval between issues and normally appears more than once per year. It includes a mixture of articles, letters, summaries, etc. Within this definition, annuals such as the Annual Review of Nuclear Science are included, but series titles such as the McGraw-Hill Series in Nuclear Engineering are not. The purpose of this document is to provide descriptive cataloguers with standard elements to include in bibliographic level 'S' of the INIS record. These elements include field (tag) 229 (Full Journal Title), 320 (ISSN) and 321 (CODEN). The full journal title is mandatory, and either the ISSN or the CODEN must be included (both may appear). Instructions on how to use this and other elements of the INIS record format are found in INIS: Guide to Bibliographic Description (IAEA-INIS-1). In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: - In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. - In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. - In Part III, all journals that are regularly scanned by

From the Alphabet to the Web

Directory of Open Access Journals (Sweden)

Gevisa La Rocca

2012-04-01

Full Text Available The article discusses the issues of social and cultural construction of the concepts of time, space, and thought. This analysis is matched by a parallel between the physics and those of communication. To be used as a reference is the shift from the Newtonian conception of time and space to the one proposed by Einstein. In fact, the concepts of space and time outlined in Newtonian physics well befits to what is the cultural and experiential that outlines M. McLuhan in his description of the aural and visual culture—an examination that, starting from the introduction of the alphabet, takes us to Gutenberg and the electric media. The revolution introduced by Einstein seems similar to the one that goes to the concepts of time, space, and thought with the advent of the Net. This article includes a review of the literature on the subject, through the lesson of Meyrowitz, McLuhan, Innis, Castells, Appadurai, Manovich, Berners-Lee to get to Carr. Facing this path is referred to as the birth of the hypertext moment of transition from linear thinking to the reticular.

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...

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...

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

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

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 ...

SRComp: short read sequence compression using burstsort and Elias omega coding.

Directory of Open Access Journals (Sweden)

Jeremy John Selva

Full Text Available Next-generation sequencing (NGS technologies permit the rapid production of vast amounts of data at low cost. Economical data storage and transmission hence becomes an increasingly important challenge for NGS experiments. In this paper, we introduce a new non-reference based read sequence compression tool called SRComp. It works by first employing a fast string-sorting algorithm called burstsort to sort read sequences in lexicographical order and then Elias omega-based integer coding to encode the sorted read sequences. SRComp has been benchmarked on four large NGS datasets, where experimental results show that it can run 5-35 times faster than current state-of-the-art read sequence compression tools such as BEETL and SCALCE, while retaining comparable compression efficiency for large collections of short read sequences. SRComp is a read sequence compression tool that is particularly valuable in certain applications where compression time is of major concern.

Annual report of nuclear code evaluation committee for fiscal 2000 year

Energy Technology Data Exchange (ETDEWEB)

NONE

2002-03-01

In this report, research results discussed in fiscal 2000 year at Nuclear Code Evaluation Committee of Nuclear Code Research Committee were summarized. In 2000, papers mainly on the three topics of (1) present status of burnup credit evaluation methods, (2) issues concerning convergence of criticality calculation and (3) estimation methods for errors associated with criticality calculation based on nuclear data covariance file, are presented and discussed. These results are sorted to grasp the present status of related technology and described in this report. (author)

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...

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.

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

Complexity control algorithm based on adaptive mode selection for interframe coding in high efficiency video coding

Science.gov (United States)

Chen, Gang; Yang, Bing; Zhang, Xiaoyun; Gao, Zhiyong

2017-07-01

The latest high efficiency video coding (HEVC) standard significantly increases the encoding complexity for improving its coding efficiency. Due to the limited computational capability of handheld devices, complexity constrained video coding has drawn great attention in recent years. A complexity control algorithm based on adaptive mode selection is proposed for interframe coding in HEVC. Considering the direct proportionality between encoding time and computational complexity, the computational complexity is measured in terms of encoding time. First, complexity is mapped to a target in terms of prediction modes. Then, an adaptive mode selection algorithm is proposed for the mode decision process. Specifically, the optimal mode combination scheme that is chosen through offline statistics is developed at low complexity. If the complexity budget has not been used up, an adaptive mode sorting method is employed to further improve coding efficiency. The experimental results show that the proposed algorithm achieves a very large complexity control range (as low as 10%) for the HEVC encoder while maintaining good rate-distortion performance. For the lowdelayP condition, compared with the direct resource allocation method and the state-of-the-art method, an average gain of 0.63 and 0.17 dB in BDPSNR is observed for 18 sequences when the target complexity is around 40%.

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.

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...

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.

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.

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 %.

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…

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.

Alphabet Writing and Allograph Selection as Predictors of Spelling in Sentences Written by Spanish-Speaking Children Who Are Poor or Good Keyboarders.

Science.gov (United States)

Peake, Christian; Diaz, Alicia; Artiles, Ceferino

This study examined the relationship and degree of predictability that the fluency of writing the alphabet from memory and the selection of allographs have on measures of fluency and accuracy of spelling in a free-writing sentence task when keyboarding. The Test Estandarizado para la Evaluación de la Escritura con Teclado ("Spanish Keyboarding Writing Test"; Jiménez, 2012) was used as the assessment tool. A sample of 986 children from Grades 1 through 3 were classified according to transcription skills measured by keyboard ability (poor vs. good) across the grades. Results demonstrated that fluency in writing the alphabet and selecting allographs mediated the differences in spelling between good and poor keyboarders in the free-writing task. Execution in the allograph selection task and writing alphabet from memory had different degrees of predictability in each of the groups in explaining the level of fluency and spelling in the free-writing task sentences, depending on the grade. These results suggest that early assessment of writing by means of the computer keyboard can provide clues and guidelines for intervention and training to strengthen specific skills to improve writing performance in the early primary grades in transcription skills by keyboarding.

The Analysis of Dimensionality Reduction Techniques in Cryptographic Object Code Classification

Energy Technology Data Exchange (ETDEWEB)

Jason L. Wright; Milos Manic

2010-05-01

This paper compares the application of three different dimension reduction techniques to the problem of locating cryptography in compiled object code. A simple classi?er is used to compare dimension reduction via sorted covariance, principal component analysis, and correlation-based feature subset selection. The analysis concentrates on the classi?cation accuracy as the number of dimensions is increased.

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

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%.

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2008-01-01

This is the 34th revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13 538 journal titles, 2 106 regularly scanned journals and 613 key journals. It was last updated in February 2008. A journal - or periodical - is a continuing publication issued in a succession of discrete parts, usually bearing numbering and/or chronological designations and intended to be continued indefinitely. It is generally published within a defined, fixed interval between issues and normally appears more than once per year. It includes a mixture of articles, letters, summaries, etc. Within this definition, annuals such as the Annual Review of Nuclear Science are included, but series titles such as the McGraw-Hill Series in Nuclear Engineering are not. The purpose of this document is to provide descriptive cataloguers with standard elements to include in bibliographic level 'S' of the INIS record. These elements include field (tag) 229 (Full Journal Title), 320 (ISSN) and 321 (CODEN). The full journal title is mandatory, and either the ISSN or the CODEN must be included (both may appear). Instructions on how to use this and other elements of the INIS record format are found in INIS: Guide to Bibliographic Description (IAEA-INIS-1). In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: - In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. - In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. - In Part III, all journals that are regularly scanned by

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.

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.

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.

SA-Search: a web tool for protein structure mining based on a Structural Alphabet

OpenAIRE

Guyon, Frédéric; Camproux, Anne-Claude; Hochez, Joëlle; Tufféry, Pierre

2004-01-01

SA-Search is a web tool that can be used to mine for protein structures and extract structural similarities. It is based on a hidden Markov model derived Structural Alphabet (SA) that allows the compression of three-dimensional (3D) protein conformations into a one-dimensional (1D) representation using a limited number of prototype conformations. Using such a representation, classical methods developed for amino acid sequences can be employed. Currently, SA-Search permits the performance of f...

Description and use of the SOS Plabord code

International Nuclear Information System (INIS)

Morera, J.P.; Samain, A.; Capes, H.; Ghendrih, P.

1990-09-01

The SOS Plabord code calculates the local steady states at the plasma edge. Plasma impurities and neutral particles freed from the wall are included in the calculations. The coordinates of the two axes that limit the plasma edge layer are defined in the program. Three sorts of ions and electrons are considered. The physical parameters, the equations and the boundary conditions are given. The method chosen for solving the nonlinear differential equations and the computer program are presented [fr

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.

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.

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...

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

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.

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.

Action and perception in literacy: A common-code for spelling and reading.

Science.gov (United States)

Houghton, George

2018-01-01

There is strong evidence that reading and spelling in alphabetical scripts depend on a shared representation (common-coding). However, computational models usually treat the two skills separately, producing a wide variety of proposals as to how the identity and position of letters is represented. This article treats reading and spelling in terms of the common-coding hypothesis for perception-action coupling. Empirical evidence for common representations in spelling-reading is reviewed. A novel version of the Start-End Competitive Queuing (SE-CQ) spelling model is introduced, and tested against the distribution of positional errors in Letter Position Dysgraphia, data from intralist intrusion errors in spelling to dictation, and dysgraphia because of nonperipheral neglect. It is argued that no other current model is equally capable of explaining this range of data. To pursue the common-coding hypothesis, the representation used in SE-CQ is applied, without modification, to the coding of letter identity and position for reading and lexical access, and a lexical matching rule for the representation is proposed (Start End Position Code model, SE-PC). Simulations show the model's compatibility with benchmark findings from form priming, its ability to account for positional effects in letter identification priming and the positional distribution of perseverative intrusion errors. The model supports the view that spelling and reading use a common orthographic description, providing a well-defined account of the major features of this representation. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

Optimization and Openmp Parallelization of a Discrete Element Code for Convex Polyhedra on Multi-Core Machines

Science.gov (United States)

Chen, Jian; Matuttis, Hans-Georg

2013-02-01

We report our experiences with the optimization and parallelization of a discrete element code for convex polyhedra on multi-core machines and introduce a novel variant of the sort-and-sweep neighborhood algorithm. While in theory the whole code in itself parallelizes ideally, in practice the results on different architectures with different compilers and performance measurement tools depend very much on the particle number and optimization of the code. After difficulties with the interpretation of the data for speedup and efficiency are overcome, respectable parallelization speedups could be obtained.

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...

Processing of English scientific articles on an IBM 1401 computer for linguistic and statistic purposes; Traitement sur ordinateur IBM 1401 de textes scientifiques anglais en vue d'etudes linguistiques et statistiques

Energy Technology Data Exchange (ETDEWEB)

Vandeputte, N.

1961-07-01

The author reports how he addressed the processing of a large set of scientific articles written in English and stored on a punched tape. The objective is to build up an alphabetically ordered list of occurrence of a set of pre-defined words, and also to build up statistics on the presence of these words within the concerned set of articles. He presents how data are organised on the storage support, comments how data are read by the tape reading device and thus how records are processed. He indicates which characters are ignored, or converted or detected. He indicates the different processing steps: tape reading, data storage, alphabetic sorting, outputs, calculation of component frequency and frequency sorting. He also discusses how tape punching errors are handled. He proposes a brief quantitative assessment of the article set processing, notably with a reference to computing time.

User's manual for BINIAC: A computer code to translate APET bins

International Nuclear Information System (INIS)

Gough, S.T.

1994-03-01

This report serves as the user's manual for the FORTRAN code BINIAC. BINIAC is a utility code designed to format the output from the Defense Waste Processing Facility (DWPF) Accident Progression Event Tree (APET) methodology. BINIAC inputs the accident progression bins from the APET methodology, converts the frequency from occurrences per hour to occurrences per year, sorts the progression bins, and converts the individual dimension character codes into facility attributes. Without the use of BINIAC, this process would be done manually at great time expense. BINIAC was written under the quality assurance control of IQ34 QAP IV-1, revision 0, section 4.1.4. Configuration control is established through the use of a proprietor and a cognizant users list

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.

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…

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...

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

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.

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...

Synchronization Control for a Class of Discrete-Time Dynamical Networks With Packet Dropouts: A Coding-Decoding-Based Approach.

Science.gov (United States)

Wang, Licheng; Wang, Zidong; Han, Qing-Long; Wei, Guoliang

2017-09-06

The synchronization control problem is investigated for a class of discrete-time dynamical networks with packet dropouts via a coding-decoding-based approach. The data is transmitted through digital communication channels and only the sequence of finite coded signals is sent to the controller. A series of mutually independent Bernoulli distributed random variables is utilized to model the packet dropout phenomenon occurring in the transmissions of coded signals. The purpose of the addressed synchronization control problem is to design a suitable coding-decoding procedure for each node, based on which an efficient decoder-based control protocol is developed to guarantee that the closed-loop network achieves the desired synchronization performance. By applying a modified uniform quantization approach and the Kronecker product technique, criteria for ensuring the detectability of the dynamical network are established by means of the size of the coding alphabet, the coding period and the probability information of packet dropouts. Subsequently, by resorting to the input-to-state stability theory, the desired controller parameter is obtained in terms of the solutions to a certain set of inequality constraints which can be solved effectively via available software packages. Finally, two simulation examples are provided to demonstrate the effectiveness of the obtained results.

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

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...

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

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.

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.

An Efficient Integer Coding and Computing Method for Multiscale Time Segment

Directory of Open Access Journals (Sweden)

TONG Xiaochong

2016-12-01

Full Text Available This article focus on the exist problem and status of current time segment coding, proposed a new set of approach about time segment coding: multi-scale time segment integer coding (MTSIC. This approach utilized the tree structure and the sort by size formed among integer, it reflected the relationship among the multi-scale time segments: order, include/contained, intersection, etc., and finally achieved an unity integer coding processing for multi-scale time. On this foundation, this research also studied the computing method for calculating the time relationships of MTSIC, to support an efficient calculation and query based on the time segment, and preliminary discussed the application method and prospect of MTSIC. The test indicated that, the implement of MTSIC is convenient and reliable, and the transformation between it and the traditional method is convenient, it has the very high efficiency in query and calculating.

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

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.

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...

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)

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.

Publications in biomedical and environmental sciences programs, 1982

Energy Technology Data Exchange (ETDEWEB)

Moody, J.B. (comp.)

1983-04-01

This bibliography contains 725 references to articles in journals, books, and reports published in the subject area of biomedical and environmental sciences during 1982. There are 553 references to articles published in journals and books and 172 references to reports. The citations appear once ordered by the first author's division or by the performing division. Staff members in the Biomedical and Environmental Sciences divisions have other publications not included in this bibliography; for example, theses, book reviews, abstracts published in journals or symposia proceedings, pending journal publications and reports such as monthly, bimonthly, and quarterly progress reports, contractor reports, and reports for internal distribution. This document is sorted by the division, and then alphabetically by author. The sorting by divisions separates the references by subject area in a simple way. The divisions are represented alphabetically. Indexes are provided by author, title, and journal reference. Reprints of articles referenced in this bibliography can be obtained from the author or the author's division.

Faster Algorithms for Computing Longest Common Increasing Subsequences

DEFF Research Database (Denmark)

Kutz, Martin; Brodal, Gerth Stølting; Kaligosi, Kanela

2011-01-01

of the alphabet, and Sort is the time to sort each input sequence. For k⩾3 length-n sequences we present an algorithm which improves the previous best bound by more than a factor k for many inputs. In both cases, our algorithms are conceptually quite simple but rely on existing sophisticated data structures......We present algorithms for finding a longest common increasing subsequence of two or more input sequences. For two sequences of lengths n and m, where m⩾n, we present an algorithm with an output-dependent expected running time of and O(m) space, where ℓ is the length of an LCIS, σ is the size....... Finally, we introduce the problem of longest common weakly-increasing (or non-decreasing) subsequences (LCWIS), for which we present an -time algorithm for the 3-letter alphabet case. For the extensively studied longest common subsequence problem, comparable speedups have not been achieved for small...

Publications in biomedical and environmental sciences programs, 1982

International Nuclear Information System (INIS)

Moody, J.B.

1983-04-01

This bibliography contains 725 references to articles in journals, books, and reports published in the subject area of biomedical and environmental sciences during 1982. There are 553 references to articles published in journals and books and 172 references to reports. The citations appear once ordered by the first author's division or by the performing division. Staff members in the Biomedical and Environmental Sciences divisions have other publications not included in this bibliography; for example, theses, book reviews, abstracts published in journals or symposia proceedings, pending journal publications and reports such as monthly, bimonthly, and quarterly progress reports, contractor reports, and reports for internal distribution. This document is sorted by the division, and then alphabetically by author. The sorting by divisions separates the references by subject area in a simple way. The divisions are represented alphabetically. Indexes are provided by author, title, and journal reference. Reprints of articles referenced in this bibliography can be obtained from the author or the author's division

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

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®.

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

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

Semantic and phonological coding in poor and normal readers.

Science.gov (United States)

Vellutino, F R; Scanlon, D M; Spearing, D

1995-02-01

Three studies were conducted evaluating semantic and phonological coding deficits as alternative explanations of reading disability. In the first study, poor and normal readers in second and sixth grade were compared on various tests evaluating semantic development as well as on tests evaluating rapid naming and pseudoword decoding as independent measures of phonological coding ability. In a second study, the same subjects were given verbal memory and visual-verbal learning tasks using high and low meaning words as verbal stimuli and Chinese ideographs as visual stimuli. On the semantic tasks, poor readers performed below the level of the normal readers only at the sixth grade level, but, on the rapid naming and pseudoword learning tasks, they performed below the normal readers at the second as well as at the sixth grade level. On both the verbal memory and visual-verbal learning tasks, performance in poor readers approximated that of normal readers when the word stimuli were high in meaning but not when they were low in meaning. These patterns were essentially replicated in a third study that used some of the same semantic and phonological measures used in the first experiment, and verbal memory and visual-verbal learning tasks that employed word lists and visual stimuli (novel alphabetic characters) that more closely approximated those used in learning to read. It was concluded that semantic coding deficits are an unlikely cause of reading difficulties in most poor readers at the beginning stages of reading skills acquisition, but accrue as a consequence of prolonged reading difficulties in older readers. It was also concluded that phonological coding deficits are a probable cause of reading difficulties in most poor readers.

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.

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

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...

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.

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.

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...

INDC list of correspondents for the exchange of nuclear data information and compilation of national nuclear data committees

International Nuclear Information System (INIS)

1986-04-01

This list of INDC Correspondents, including information on currently existing National Nuclear Data Committees and their memberships, is compiled and published upon the request of the International Nuclear Data Committee with the objective to promote the interaction and enhance the awareness of nuclear data activities in IAEA Member States. It also serves as a basis for the distribution of documents originated by or for the International Nuclear Data Committee and includes the names of all recipients of INDC documents. The report is presented in five sections. The first section contains a detailed description of the INDC distribution categories, distribution codes and document designator codes. The second section describes the aims, organization and objectives of individual national nuclear data committees. The third section list names and addresses in alphabetical order within each state or international organization together with the assigned INDC document distribution code(s); where applicable committee membership and/or area of specialization are indicated. This is followed by four shorter lists, indicating the names of individuals in each distribution category, sorted by country or international organization, and the total number of individuals in each category. The final section provides the names of nuclear data committee members also listed by country or international organization

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.

A PARALLEL MONTE CARLO CODE FOR SIMULATING COLLISIONAL N-BODY SYSTEMS

Energy Technology Data Exchange (ETDEWEB)

Pattabiraman, Bharath; Umbreit, Stefan; Liao, Wei-keng; Choudhary, Alok; Kalogera, Vassiliki; Memik, Gokhan; Rasio, Frederic A., E-mail: bharath@u.northwestern.edu [Center for Interdisciplinary Exploration and Research in Astrophysics, Northwestern University, Evanston, IL (United States)

2013-02-15

We present a new parallel code for computing the dynamical evolution of collisional N-body systems with up to N {approx} 10{sup 7} particles. Our code is based on the Henon Monte Carlo method for solving the Fokker-Planck equation, and makes assumptions of spherical symmetry and dynamical equilibrium. The principal algorithmic developments involve optimizing data structures and the introduction of a parallel random number generation scheme as well as a parallel sorting algorithm required to find nearest neighbors for interactions and to compute the gravitational potential. The new algorithms we introduce along with our choice of decomposition scheme minimize communication costs and ensure optimal distribution of data and workload among the processing units. Our implementation uses the Message Passing Interface library for communication, which makes it portable to many different supercomputing architectures. We validate the code by calculating the evolution of clusters with initial Plummer distribution functions up to core collapse with the number of stars, N, spanning three orders of magnitude from 10{sup 5} to 10{sup 7}. We find that our results are in good agreement with self-similar core-collapse solutions, and the core-collapse times generally agree with expectations from the literature. Also, we observe good total energy conservation, within {approx}< 0.04% throughout all simulations. We analyze the performance of the code, and demonstrate near-linear scaling of the runtime with the number of processors up to 64 processors for N = 10{sup 5}, 128 for N = 10{sup 6} and 256 for N = 10{sup 7}. The runtime reaches saturation with the addition of processors beyond these limits, which is a characteristic of the parallel sorting algorithm. The resulting maximum speedups we achieve are approximately 60 Multiplication-Sign , 100 Multiplication-Sign , and 220 Multiplication-Sign , respectively.

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.

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

A PARALLEL MONTE CARLO CODE FOR SIMULATING COLLISIONAL N-BODY SYSTEMS

International Nuclear Information System (INIS)

Pattabiraman, Bharath; Umbreit, Stefan; Liao, Wei-keng; Choudhary, Alok; Kalogera, Vassiliki; Memik, Gokhan; Rasio, Frederic A.

2013-01-01

We present a new parallel code for computing the dynamical evolution of collisional N-body systems with up to N ∼ 10 7 particles. Our code is based on the Hénon Monte Carlo method for solving the Fokker-Planck equation, and makes assumptions of spherical symmetry and dynamical equilibrium. The principal algorithmic developments involve optimizing data structures and the introduction of a parallel random number generation scheme as well as a parallel sorting algorithm required to find nearest neighbors for interactions and to compute the gravitational potential. The new algorithms we introduce along with our choice of decomposition scheme minimize communication costs and ensure optimal distribution of data and workload among the processing units. Our implementation uses the Message Passing Interface library for communication, which makes it portable to many different supercomputing architectures. We validate the code by calculating the evolution of clusters with initial Plummer distribution functions up to core collapse with the number of stars, N, spanning three orders of magnitude from 10 5 to 10 7 . We find that our results are in good agreement with self-similar core-collapse solutions, and the core-collapse times generally agree with expectations from the literature. Also, we observe good total energy conservation, within ∼ 5 , 128 for N = 10 6 and 256 for N = 10 7 . The runtime reaches saturation with the addition of processors beyond these limits, which is a characteristic of the parallel sorting algorithm. The resulting maximum speedups we achieve are approximately 60×, 100×, and 220×, respectively.

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.

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...

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…

Recognition of Arabic Sign Language Alphabet Using Polynomial Classifiers

Directory of Open Access Journals (Sweden)

M. Al-Rousan

2005-08-01

Full Text Available Building an accurate automatic sign language recognition system is of great importance in facilitating efficient communication with deaf people. In this paper, we propose the use of polynomial classifiers as a classification engine for the recognition of Arabic sign language (ArSL alphabet. Polynomial classifiers have several advantages over other classifiers in that they do not require iterative training, and that they are highly computationally scalable with the number of classes. Based on polynomial classifiers, we have built an ArSL system and measured its performance using real ArSL data collected from deaf people. We show that the proposed system provides superior recognition results when compared with previously published results using ANFIS-based classification on the same dataset and feature extraction methodology. The comparison is shown in terms of the number of misclassified test patterns. The reduction in the rate of misclassified patterns was very significant. In particular, we have achieved a 36% reduction of misclassifications on the training data and 57% on the test data.

IR Cards: Inquiry-Based Introduction to Infrared Spectroscopy

Science.gov (United States)

Bennett, Jacqueline; Forster, Tabetha

2010-01-01

As infrared spectroscopy (IR) is frequently used in undergraduate organic chemistry courses, an inductive introduction to IR spectroscopy that uses index cards printed with spectra, structures, and chemical names is described. Groups of students are given an alphabetized deck of these "IR cards" to sort into functional groups. The students then…

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.

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

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.

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.

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...

Orthographic effects in spoken word recognition: Evidence from Chinese.

Science.gov (United States)

Qu, Qingqing; Damian, Markus F

2017-06-01

Extensive evidence from alphabetic languages demonstrates a role of orthography in the processing of spoken words. Because alphabetic systems explicitly code speech sounds, such effects are perhaps not surprising. However, it is less clear whether orthographic codes are involuntarily accessed from spoken words in languages with non-alphabetic systems, in which the sound-spelling correspondence is largely arbitrary. We investigated the role of orthography via a semantic relatedness judgment task: native Mandarin speakers judged whether or not spoken word pairs were related in meaning. Word pairs were either semantically related, orthographically related, or unrelated. Results showed that relatedness judgments were made faster for word pairs that were semantically related than for unrelated word pairs. Critically, orthographic overlap on semantically unrelated word pairs induced a significant increase in response latencies. These findings indicate that orthographic information is involuntarily accessed in spoken-word recognition, even in a non-alphabetic language such as Chinese.

Optimization of Wind Turbine Airfoil Using Nondominated Sorting Genetic Algorithm and Pareto Optimal Front

Directory of Open Access Journals (Sweden)

Ziaul Huque

2012-01-01

Full Text Available A Computational Fluid Dynamics (CFD and response surface-based multiobjective design optimization were performed for six different 2D airfoil profiles, and the Pareto optimal front of each airfoil is presented. FLUENT, which is a commercial CFD simulation code, was used to determine the relevant aerodynamic loads. The Lift Coefficient (CL and Drag Coefficient (CD data at a range of 0° to 12° angles of attack (α and at three different Reynolds numbers (Re=68,459, 479, 210, and 958, 422 for all the six airfoils were obtained. Realizable k-ε turbulence model with a second-order upwind solution method was used in the simulations. The standard least square method was used to generate response surface by the statistical code JMP. Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II was used to determine the Pareto optimal set based on the response surfaces. Each Pareto optimal solution represents a different compromise between design objectives. This gives the designer a choice to select a design compromise that best suits the requirements from a set of optimal solutions. The Pareto solution set is presented in the form of a Pareto optimal front.

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2009-01-01

This is the 35th revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13 750 journal titles, 1 965 regularly scanned journals and 593 key journals. It was last updated in March 2009. A journal - or periodical - is a continuing publication issued in a succession of discrete parts, usually bearing numbering and/or chronological designations and intended to be continued indefinitely. It is generally published within a defined, fixed interval between issues and normally appears more than once per year. It includes a mixture of articles, letters, summaries, etc. Within this definition, annuals such as the Annual Review of Nuclear Science are included, but series titles such as the McGraw-Hill Series in Nuclear Engineering are not. The purpose of this document is to provide descriptive cataloguers with standard elements to include in bibliographic level 'S' of the INIS record. These elements include field (tag) 229 (Full Journal Title), 320 (ISSN) and 321 (CODEN). The full journal title is mandatory, and either the ISSN or the CODEN must be included (both may appear). Instructions on how to use this and other elements of the INIS record format are found in INIS: Guide to Bibliographic Description (IAEA-INIS-1). In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: - In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. - In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. - In Part III, all journals that are regularly scanned by the

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.

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.

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.

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

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.

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...

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.

Fluency and Accuracy in Alphabet Writing by Keyboarding : A Cross-Sectional Study in Spanish-Speaking Children With and Without Learning Disabilities

NARCIS (Netherlands)

Bisschop, Elaine; Morales, Celia; Gil, Verónica; Jiménez-Suárez, Elizabeth

2017-01-01

The aim of this study was to analyze whether children with and without difficulties in handwriting, spelling, or both differed in alphabet writing when using a keyboard. The total sample consisted of 1,333 children from Grades 1 through 3. Scores on the spelling and handwriting factors from the

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....

Decoding English Alphabet Letters Using EEG Phase Information

Directory of Open Access Journals (Sweden)

YiYan Wang

2018-02-01

Full Text Available Increasing evidence indicates that the phase pattern and power of the low frequency oscillations of brain electroencephalograms (EEG contain significant information during the human cognition of sensory signals such as auditory and visual stimuli. Here, we investigate whether and how the letters of the alphabet can be directly decoded from EEG phase and power data. In addition, we investigate how different band oscillations contribute to the classification and determine the critical time periods. An English letter recognition task was assigned, and statistical analyses were conducted to decode the EEG signal corresponding to each letter visualized on a computer screen. We applied support vector machine (SVM with gradient descent method to learn the potential features for classification. It was observed that the EEG phase signals have a higher decoding accuracy than the oscillation power information. Low-frequency theta and alpha oscillations have phase information with higher accuracy than do other bands. The decoding performance was best when the analysis period began from 180 to 380 ms after stimulus presentation, especially in the lateral occipital and posterior temporal scalp regions (PO7 and PO8. These results may provide a new approach for brain-computer interface techniques (BCI and may deepen our understanding of EEG oscillations in cognition.

Stochastic geometry in PRIZMA code

International Nuclear Information System (INIS)

Malyshkin, G. N.; Kashaeva, E. A.; Mukhamadiev, R. F.

2007-01-01

The paper describes a method used to simulate radiation transport through random media - randomly placed grains in a matrix material. The method models the medium consequently from one grain crossed by particle trajectory to another. Like in the Limited Chord Length Sampling (LCLS) method, particles in grains are tracked in the actual grain geometry, but unlike LCLS, the medium is modeled using only Matrix Chord Length Sampling (MCLS) from the exponential distribution and it is not necessary to know the grain chord length distribution. This helped us extend the method to media with randomly oriented arbitrarily shaped convex grains. Other extensions include multicomponent media - grains of several sorts, and polydisperse media - grains of different sizes. Sort and size distributions of crossed grains were obtained and an algorithm was developed for sampling grain orientations and positions. Special consideration was given to medium modeling at the boundary of the stochastic region. The method was implemented in the universal 3D Monte Carlo code PRIZMA. The paper provides calculated results for a model problem where we determine volume fractions of modeled components crossed by particle trajectories. It also demonstrates the use of biased sampling techniques implemented in PRIZMA for solving a problem of deep penetration in model random media. Described are calculations for the spectral response of a capacitor dose detector whose anode was modeled with account for its stochastic structure. (authors)

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.

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.

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.

6. Algorithms for Sorting and Searching

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 3. Algorithms - Algorithms for Sorting and Searching. R K Shyamasundar. Series Article ... Author Affiliations. R K Shyamasundar1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai 400 005, India ...

Recognizing protein–protein interfaces with empirical potentials and reduced amino acid alphabets

Directory of Open Access Journals (Sweden)

Wodak Shoshana

2007-07-01

Full Text Available Abstract Background In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We have developed empirical energy functions to identify native structures of protein–protein complexes among sets of decoy structures. To understand the role of amino acid diversity, we parameterized a series of functions, using a hierarchy of amino acid alphabets of increasing complexity, with 2, 3, 4, 6, and 20 amino acid groups. Compared to previous work, we used the simplest possible functional form, with residue–residue interactions and a stepwise distance-dependence. We used increased computational ressources, however, constructing 290,000 decoys for 219 protein–protein complexes, with a realistic docking protocol where the protein partners are flexible and interact through a molecular mechanics energy function. The energy parameters were optimized to correctly assign as many native complexes as possible. To resolve the multiple minimum problem in parameter space, over 64000 starting parameter guesses were tried for each energy function. The optimized functions were tested by cross validation on subsets of our native and decoy structures, by blind tests on series of native and decoy structures available on the Web, and on models for 13 complexes submitted to the CAPRI structure prediction experiment. Results Performance is similar to several other statistical potentials of the same complexity. For example, the CAPRI target structure is correctly ranked ahead of 90% of its decoys in 6 cases out of 13. The hierarchy of amino acid alphabets leads to a coherent hierarchy of energy functions, with qualitatively similar parameters for similar amino acid types at all levels. Most remarkably, the performance with six amino acid classes is equivalent to that of the most detailed, 20-class energy function. Conclusion This suggests that six carefully chosen amino

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

Compact Hilbert Curve Index Algorithm Based on Gray Code

Directory of Open Access Journals (Sweden)

CAO Xuefeng

2016-12-01

Full Text Available Hilbert curve has best clustering in various kinds of space filling curves, and has been used as an important tools in discrete global grid spatial index design field. But there are lots of redundancies in the standard Hilbert curve index when the data set has large differences between dimensions. In this paper, the construction features of Hilbert curve is analyzed based on Gray code, and then the compact Hilbert curve index algorithm is put forward, in which the redundancy problem has been avoided while Hilbert curve clustering preserved. Finally, experiment results shows that the compact Hilbert curve index outperforms the standard Hilbert index, their 1 computational complexity is nearly equivalent, but the real data set test shows the coding time and storage space decrease 40%, the speedup ratio of sorting speed is nearly 4.3.

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.

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.

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

Comparison of alphabetical versus categorical display format for medication order entry in a simulated touch screen anesthesia information management system: an experiment in clinician-computer interaction in anesthesia.

Science.gov (United States)

Marian, Anil A; Dexter, Franklin; Tucker, Peter; Todd, Michael M

2012-05-29

Anesthesia information management system (AIMS) records should be designed and configured to facilitate the accurate and prompt recording of multiple drugs administered coincidentally or in rapid succession. We proposed two touch-screen display formats for use with our department's new EPIC touch-screen AIMS. In one format, medication "buttons" were arranged in alphabetical order (i.e. A-C, D-H etc.). In the other, buttons were arranged in categories (Common, Fluids, Cardiovascular, Coagulation etc.). Both formats were modeled on an iPad screen to resemble the AIMS interface. Anesthesia residents, anesthesiologists, and Certified Registered Nurse Anesthetists (n = 60) were then asked to find and touch the correct buttons for a series of medications whose names were displayed to the side of the entry screen. The number of entries made within 2 minutes was recorded. This was done 3 times for each format, with the 1st format chosen randomly. Data were analyzed from the third trials with each format to minimize differences in learning. The categorical format had a mean of 5.6 more drugs entered using the categorical method in two minutes than the alphabetical format (95% confidence interval [CI] 4.5 to 6.8, P < 0.0001). The findings were the same regardless of the order of testing (i.e. alphabetical-categorical vs. categorical - alphabetical) and participants' years of clinical experience. Most anesthesia providers made no (0) errors for most trials (N = 96/120 trials, lower 95% limit 73%, P < 0.0001). There was no difference in error rates between the two formats (P = 0.53). The use of touch-screen user interfaces in healthcare is increasingly common. Arrangement of drugs names in a categorical display format in the medication order-entry touch screen of an AIMS can result in faster data entry compared to an alphabetical arrangement of drugs. Results of this quality improvement project were used in our department's design of our final intraoperative electronic

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.

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.

Skip-webs: Efficient distributed data structures for multi-dimensional data sets

DEFF Research Database (Denmark)

Arge, Lars; Eppstein, David; Goodrich, Michael T.

2005-01-01

querying scenarios, which include linear (one-dimensional) data, such as sorted sets, as well as multi-dimensional data, such as d-dimensional octrees and digital tries of character strings defined over a fixed alphabet. We show how to perform a query over such a set of n items spread among n hosts using O...

Interdependence, Reflexivity, Fidelity, Impedance Matching, and the Evolution of Genetic Coding

Science.gov (United States)

Carter, Charles W; Wills, Peter R

2018-01-01

Abstract Genetic coding is generally thought to have required ribozymes whose functions were taken over by polypeptide aminoacyl-tRNA synthetases (aaRS). Two discoveries about aaRS and their interactions with tRNA substrates now furnish a unifying rationale for the opposite conclusion: that the key processes of the Central Dogma of molecular biology emerged simultaneously and naturally from simple origins in a peptide•RNA partnership, eliminating the epistemological utility of a prior RNA world. First, the two aaRS classes likely arose from opposite strands of the same ancestral gene, implying a simple genetic alphabet. The resulting inversion symmetries in aaRS structural biology would have stabilized the initial and subsequent differentiation of coding specificities, rapidly promoting diversity in the proteome. Second, amino acid physical chemistry maps onto tRNA identity elements, establishing reflexive, nanoenvironmental sensing in protein aaRS. Bootstrapping of increasingly detailed coding is thus intrinsic to polypeptide aaRS, but impossible in an RNA world. These notions underline the following concepts that contradict gradual replacement of ribozymal aaRS by polypeptide aaRS: 1) aaRS enzymes must be interdependent; 2) reflexivity intrinsic to polypeptide aaRS production dynamics promotes bootstrapping; 3) takeover of RNA-catalyzed aminoacylation by enzymes will necessarily degrade specificity; and 4) the Central Dogma’s emergence is most probable when replication and translation error rates remain comparable. These characteristics are necessary and sufficient for the essentially de novo emergence of a coupled gene–replicase–translatase system of genetic coding that would have continuously preserved the functional meaning of genetically encoded protein genes whose phylogenetic relationships match those observed today. PMID:29077934

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

Inventory of power plants in the United States. [By state within standard Federal Regions, using county codes

Energy Technology Data Exchange (ETDEWEB)

None

1977-12-01

The purpose of this inventory of power plants is to provide a ready reference for planners whose focus is on the state, standard Federal region, and/or national level. Thus the inventory is compiled alphabetically by state within standard Federal regions. The units are listed alphabetically within electric utility systems which in turn are listed alphabetically within states. The locations are identified to county level according to the Federal Information Processing Standards Publication Counties and County Equivalents of the States of the United States. Data compiled include existing and projected electrical generation units, jointly owned units, and projected construction units.

Publications, 1972--1976

International Nuclear Information System (INIS)

Hilborn, H.S.

1977-03-01

This is a compilation of documents that communicate the results of scientific and technical work done at Savannah River. The bibliographic listing is arranged alphabetically by the first-mentioned author of each document. The subject listing is arranged alphabetically by key word out of context (KWOC) indexing of the titles. The author listing includes in alphabetical order all authors, coauthors, editors, and compilers with identifying code numbers, and the titles of all documents on which their names appear

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.

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

Learning to Write in Braille: An Analysis of Writing Samples from Participants in the Alphabetic Braille and Contracted (ABC) Braille Study

Science.gov (United States)

Erin, Jane N.; Wright, Tessa S.

2011-01-01

This article reports the results of data from 114 writing samples of 39 children who read braille and who were included in the Alphabetic Braille and Contracted Braille (ABC) Study between 2002 and 2005. Writing characteristics, miscues, and composition characteristics are analyzed, and two case studies are included. (Contains 1 box and 2 tables.)

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

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...

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...

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.

Phonetic radicals, not phonological coding systems, support orthographic learning via self-teaching in Chinese.

Science.gov (United States)

Li, Luan; Wang, Hua-Chen; Castles, Anne; Hsieh, Miao-Ling; Marinus, Eva

2018-07-01

According to the self-teaching hypothesis (Share, 1995), phonological decoding is fundamental to acquiring orthographic representations of novel written words. However, phonological decoding is not straightforward in non-alphabetic scripts such as Chinese, where words are presented as characters. Here, we present the first study investigating the role of phonological decoding in orthographic learning in Chinese. We examined two possible types of phonological decoding: the use of phonetic radicals, an internal phonological aid, andthe use of Zhuyin, an external phonological coding system. Seventy-three Grade 2 children were taught the pronunciations and meanings of twelve novel compound characters over four days. They were then exposed to the written characters in short stories, and were assessed on their reading accuracy and on their subsequent orthographic learning via orthographic choice and spelling tasks. The novel characters were assigned three different types of pronunciation in relation to its phonetic radical - (1) a pronunciation that is identical to the phonetic radical in isolation; (2) a common alternative pronunciation associated with the phonetic radical when it appears in other characters; and (3) a pronunciation that is unrelated to the phonetic radical. The presence of Zhuyin was also manipulated. The children read the novel characters more accurately when phonological cues from the phonetic radicals were available and in the presence of Zhuyin. However, only the phonetic radicals facilitated orthographic learning. The findings provide the first empirical evidence of orthographic learning via self-teaching in Chinese, and reveal how phonological decoding functions to support learning in non-alphabetic writing systems. Copyright © 2018 Elsevier B.V. All rights reserved.

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.

Continuos integration and monitorization system for code quality and cooperation work

OpenAIRE

Artigas Morales, Carles

2017-01-01

Nowadays it exist a sort of tools that allow a greater management of developing projects and although it allows by using this tools increase the efficiency and the effectiveness of the developing process and the developer knowledge. Therefore in this project it will be presented, implemented and tested a set of tool for this purpose. This Project will mainly analyze the code quality and de workers cooperation, in order to do that different software will be used. Sonar will be used as the tool...

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.

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…

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.

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

Relevance-aware filtering of tuples sorted by an attribute value via direct optimization of search quality metrics

NARCIS (Netherlands)

Spirin, N.V.; Kuznetsov, M.; Kiseleva, Y.; Spirin, Y.V.; Izhutov, P.A.

2015-01-01

Sorting tuples by an attribute value is a common search scenario and many search engines support such capabilities, e.g. price-based sorting in e-commerce, time-based sorting on a job or social media website. However, sorting purely by the attribute value might lead to poor user experience because

INDC list of correspondents for the exchange of nuclear data information and compilation of national nuclear data committees

International Nuclear Information System (INIS)

1987-09-01

This list of INDC Correspondents, including information on currently existing National Nuclear Data Committees and their memberships, is compiled and published upon the request of the International Nuclear Data Committee with the objective to promote the interaction and enhance the awareness of nuclear data activities in IAEA Member States. It also serves as a basis for the distribution of documents originated by or for the International Nuclear Data Committee and includes the names of all recipients of INDC documents. The INDC Secretariat tries to maintain this list up-to-date in order to facilitate an efficient interchange of information on nuclear data topics. The report is presented in five sections. The first section contains a detailed description of the INDC distribution categories, distribution codes and document designator codes. The second section describes the aims, organization and objectives of individual national nuclear data committees. The third section lists names and addresses in alphabetical order within each state or international organization together with the assigned INDC document distribution code(s); where applicable committee membership and/or area of specialization are indicated. This is followed by four shorter lists, indicating the names of individuals in each distribution category, sorted by country or international organization, and the total number of individuals in each category. The final section provides the names of nuclear data committee members also listed by country or international organization

Understanding of the Alphabetic Principle through Invented Spelling among Hearing-Impaired Children Learning to Read and Write: Experimentation with a Pedagogical Approach

Science.gov (United States)

Sirois, Pauline; Boisclair, Andree; Giasson, Jocelyne

2008-01-01

Given the problems experienced by hearing-impaired individuals in learning the written language, a pedagogical approach was tested. The study examined the links between the development of representations of alphabetic system and the results in reading and writing of first graders. In the study, there were 31 hearing-impaired children and 25…

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...

Sorting, Searching, and Simulation in the MapReduce Framework

DEFF Research Database (Denmark)

Goodrich, Michael T.; Sitchinava, Nodari; Zhang, Qin

2011-01-01

usefulness of our approach by designing and analyzing efficient MapReduce algorithms for fundamental sorting, searching, and simulation problems. This study is motivated by a goal of ultimately putting the MapReduce framework on an equal theoretical footing with the well-known PRAM and BSP parallel...... in parallel computational geometry for the MapReduce framework, which result in efficient MapReduce algorithms for sorting, 2- and 3-dimensional convex hulls, and fixed-dimensional linear programming. For the case when mappers and reducers have a memory/message-I/O size of M = (N), for a small constant > 0...

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.

EXIT Chart Analysis of Binary Message-Passing Decoders

DEFF Research Database (Denmark)

Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard

2007-01-01

Binary message-passing decoders for LDPC codes are analyzed using EXIT charts. For the analysis, the variable node decoder performs all computations in the L-value domain. For the special case of a hard decision channel, this leads to the well know Gallager B algorithm, while the analysis can...... be extended to channels with larger output alphabets. By increasing the output alphabet from hard decisions to four symbols, a gain of more than 1.0 dB is achieved using optimized codes. For this code optimization, the mixing property of EXIT functions has to be modified to the case of binary message......-passing decoders....

47 CFR 13.207 - Preparing an examination.

Science.gov (United States)

2010-10-01

... consist of a plain language text or code group message sent in the international Morse code at no less... examination. Each five letters of the alphabet must be counted as one word or one code group. Each numeral...

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,...

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....

Syllable frequency and word frequency effects in spoken and written word production in a non-alphabetic script

Directory of Open Access Journals (Sweden)

Qingfang eZhang

2014-02-01

Full Text Available The effects of word frequency and syllable frequency are well-established phenomena in domain such as spoken production in alphabetic languages. Chinese, as a non-alphabetic language, presents unique lexical and phonological properties in speech production. For example, the proximate unit of phonological encoding is syllable in Chinese but segments in Dutch, French or English. The present study investigated the effects of word frequency and syllable frequency, and their interaction in Chinese written and spoken production. Significant facilitatory word frequency and syllable frequency effects were observed in spoken as well as in written production. The syllable frequency effect in writing indicated that phonological properties (i.e., syllabic frequency constrain orthographic output via a lexical route, at least, in Chinese written production. However, the syllable frequency effect over repetitions was divergent in both modalities: it was significant in the former two repetitions in spoken whereas it was significant in the second repetition only in written. Due to the fragility of the syllable frequency effect in writing, we suggest that the phonological influence in handwritten production is not mandatory and universal, and it is modulated by experimental manipulations. This provides evidence for the orthographic autonomy hypothesis, rather than the phonological mediation hypothesis. The absence of an interaction between word frequency and syllable frequency showed that the syllable frequency effect is independent of the word frequency effect in spoken and written output modalities. The implications of these results on written production models are discussed.

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

Comprehensive two-dimensional gas chromatography/time-of-flight mass spectrometry peak sorting algorithm.

Science.gov (United States)

Oh, Cheolhwan; Huang, Xiaodong; Regnier, Fred E; Buck, Charles; Zhang, Xiang

2008-02-01

We report a novel peak sorting method for the two-dimensional gas chromatography/time-of-flight mass spectrometry (GC x GC/TOF-MS) system. The objective of peak sorting is to recognize peaks from the same metabolite occurring in different samples from thousands of peaks detected in the analytical procedure. The developed algorithm is based on the fact that the chromatographic peaks for a given analyte have similar retention times in all of the chromatograms. Raw instrument data are first processed by ChromaTOF (Leco) software to provide the peak tables. Our algorithm achieves peak sorting by utilizing the first- and second-dimension retention times in the peak tables and the mass spectra generated during the process of electron impact ionization. The algorithm searches the peak tables for the peaks generated by the same type of metabolite using several search criteria. Our software also includes options to eliminate non-target peaks from the sorting results, e.g., peaks of contaminants. The developed software package has been tested using a mixture of standard metabolites and another mixture of standard metabolites spiked into human serum. Manual validation demonstrates high accuracy of peak sorting with this algorithm.

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.

Alphabet Writing and Allograph Selection as Predictors of Spelling in Sentences Written by Spanish-Speaking Children Who Are Poor or Good Keyboarders

Science.gov (United States)

Peake, Christian; Diaz, Alicia; Artiles, Ceferino

2017-01-01

This study examined the relationship and degree of predictability that the fluency of writing the alphabet from memory and the selection of allographs have on measures of fluency and accuracy of spelling in a free-writing sentence task when keyboarding. The "Test Estandarizado para la Evaluación de la Escritura con Teclado"…

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.

The Effectiveness of Using Augmented Reality Apps in Teaching the English Alphabet to Kindergarten Children: A Case Study in the State of Kuwait

Science.gov (United States)

Safar, Ammar H.; Al-Jafar, Ali A.; Al-Yousefi, Zainab H.

2017-01-01

This experimental research study scrutinized the effectiveness of using augmented reality (AR) applications (apps) as a teaching and learning tool when instructing kindergarten children in the English alphabet in the State of Kuwait. The study compared two groups: (a) experimental, taught using AR apps, and (b) control, taught using traditional…

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

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.

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

SA-Search: a web tool for protein structure mining based on a Structural Alphabet.

Science.gov (United States)

Guyon, Frédéric; Camproux, Anne-Claude; Hochez, Joëlle; Tufféry, Pierre

2004-07-01

SA-Search is a web tool that can be used to mine for protein structures and extract structural similarities. It is based on a hidden Markov model derived Structural Alphabet (SA) that allows the compression of three-dimensional (3D) protein conformations into a one-dimensional (1D) representation using a limited number of prototype conformations. Using such a representation, classical methods developed for amino acid sequences can be employed. Currently, SA-Search permits the performance of fast 3D similarity searches such as the extraction of exact words using a suffix tree approach, and the search for fuzzy words viewed as a simple 1D sequence alignment problem. SA-Search is available at http://bioserv.rpbs.jussieu.fr/cgi-bin/SA-Search.

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.

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.

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%.

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

Publications, 1977-1979

International Nuclear Information System (INIS)

Hilborn, H.S.

1980-03-01

This is a compilation of documents that communicate the results of scientific and technical work done at Savannah River. The compilation includes those documents that have been published (research and development reports, journal articles, book chapters, etc.), and documents that have been announced in Energy Research Abstracts. Where applicable, the meeting at which the paper was presented is given. This report updates the information included in DP-929, Rev. 2, Publications, 1951 through 1971 and DP-929-1, Publications, 1972 through 1976, and replaces DP-929-1, Supplements 1 and 2. The bibliographic listing is arranged alphabetically by the first-mentioned author of each document. The listing includes an identifying code number. This identifying code is used to cross reference the author and subject listings with the bibliographic information. The subject listing is arranged alphabetically by key word out of context (KWOC) indexing of the titles. The listing includes the identifying code number and the complete title. The author listing includes in alphabetical order all authors, coauthors, editors, and compilers with identifying code numbers, and the titles of all documents on which their names appear

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.

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.

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...

Calibration and statistical techniques for building an interactive screen for learning of alphabets by children

Directory of Open Access Journals (Sweden)

Riby Abraham Boby

2017-05-01

Full Text Available This article focuses on the implementation details of a portable interactive device called Image-projective Desktop Varnamala Trainer. The device uses a projector to produce a virtual display on a flat surface. For enabling interaction, the information about a user’s hand movement is obtained from a single two-dimensional scanning laser range finder in contrast with a camera sensor used in many earlier applications. A generalized calibration process to obtain exact transformation from projected screen coordinate system to sensor coordinate system is proposed in this article and implemented for enabling interaction. This permits production of large interactive displays with minimal cost. Additionally, it makes the entire system portable, that is, display can be produced on any planar surface like floor, tabletop, and so on. The calibration and its performance have been evaluated by varying screen sizes and the number of points used for calibration. The device was successfully calibrated for different screens. A novel learning-based methodology for predicting a user’s behaviour was then realized to improve the system’s performance. This has been experimentally evaluated, and the overall accuracy of prediction was about 96%. An application was then designed for this set-up to improve the learning of alphabets by the children through an interactive audiovisual feedback system. It uses a game-based methodology to help students learn in a fun way. Currently, it has bilingual (Hindi and English user interface to enable learning of alphabets and elementary mathematics. A user survey was conducted after demonstrating it to school children. The survey results are very encouraging. Additionally, a study to ascertain the improvement in the learning outcome of the children was done. The results clearly indicate an improvement in the learning outcome of the children who used the device over those who did not.

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.

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.

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

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

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.

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

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

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...

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...

The colors of the alphabet: naturally-biased associations between shape and color.

Science.gov (United States)

Spector, Ferrinne; Maurer, Daphne

2011-04-01

Many letters of the alphabet are consistently mapped to specific colors in English-speaking adults, both in the general population and in individuals with grapheme-color synaesthesia who perceive letters in color. Here, across six experiments, we tested the ubiquity of the color/letter associations with typically developing toddlers, literate children, and adults. We found that pre-literate children associate O with white and X with black and discovered that they also associate I and ameboid nonsense shapes with white; Z and jagged nonsense shapes with black; and C with yellow; but do not make a number of other associations (B blue; Y yellow; A red; G green) seen in literate children and adults. The toddlers' mappings were based on the shape and not the sound of the letter. The results suggest that sensory cortical organization initially binds specific colors to some specific shapes and that learning to read can induce additional associations, likely through the influence of higher order networks as letters take on meaning.

Balinese Alphabet Sebagai Aplikasi Media Pembelajaran Aksara Bali Berbasis Android Mobile Platform

Directory of Open Access Journals (Sweden)

Putu Ary Setiyawan

2016-01-01

Full Text Available Aksara Bali menjadi salah satu kekayaan budaya Bali yang hampir punah walaupun sebagaian besar insitusi pendidikan di Bali telah melakukan pembelajaran Aksara Bali tersebut. Metode pengajaran dapat menjadi salah satu faktor terhadap ketidaktertarikan siswa khususnya anak-anak akan Aksara Bali apabila penyampaian yang diberikan kurang. Media pembelajaran Aksara Balimenjadi solusi yang dikemas berbentuk sebuah aplikasi yang dapat dipasang/di-install pada gadget yang menggunakan sistem operasi Android. Aplikasi ini berfokuskan pada pembelajaran Aksara Bali (mengenal bentuk, bunyi, tulisan, dan merangkai kata serta permainan menggunakan Aksara Bali. Aplikasi Balinese Alphabet telah berjalan sukses pada sistem operasi Android dan termasuk dalam kategori baik sesuai pada hasil yang didapat dari hasil survey dengan rincian penilaian tertinggi dari aspek grafis visual dan audio terletak pada kategori baik dengan persentase sejumlah 47%, sedangkan penilaian tertinggi dari aspek entertainment dan pembelajaran terletak pada kategori baik dengan persentase sejumlah 57%.   Kata Kunci: Media Pembelajaran, Budaya Bali, Aksara Bali, Android.

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

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.

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.

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.

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.

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.

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.

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.

ZENO: N-body and SPH Simulation Codes

Science.gov (United States)

Barnes, Joshua E.

2011-02-01

The ZENO software package integrates N-body and SPH simulation codes with a large array of programs to generate initial conditions and analyze numerical simulations. Written in C, the ZENO system is portable between Mac, Linux, and Unix platforms. It is in active use at the Institute for Astronomy (IfA), at NRAO, and possibly elsewhere. Zeno programs can perform a wide range of simulation and analysis tasks. While many of these programs were first created for specific projects, they embody algorithms of general applicability and embrace a modular design strategy, so existing code is easily applied to new tasks. Major elements of the system include: Structured data file utilities facilitate basic operations on binary data, including import/export of ZENO data to other systems.Snapshot generation routines create particle distributions with various properties. Systems with user-specified density profiles can be realized in collisionless or gaseous form; multiple spherical and disk components may be set up in mutual equilibrium.Snapshot manipulation routines permit the user to sift, sort, and combine particle arrays, translate and rotate particle configurations, and assign new values to data fields associated with each particle.Simulation codes include both pure N-body and combined N-body/SPH programs: Pure N-body codes are available in both uniprocessor and parallel versions.SPH codes offer a wide range of options for gas physics, including isothermal, adiabatic, and radiating models. Snapshot analysis programs calculate temporal averages, evaluate particle statistics, measure shapes and density profiles, compute kinematic properties, and identify and track objects in particle distributions.Visualization programs generate interactive displays and produce still images and videos of particle distributions; the user may specify arbitrary color schemes and viewing transformations.

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.

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.)

Consensus-Based Sorting of Neuronal Spike Waveforms.

Science.gov (United States)

Fournier, Julien; Mueller, Christian M; Shein-Idelson, Mark; Hemberger, Mike; Laurent, Gilles

2016-01-01

Optimizing spike-sorting algorithms is difficult because sorted clusters can rarely be checked against independently obtained "ground truth" data. In most spike-sorting algorithms in use today, the optimality of a clustering solution is assessed relative to some assumption on the distribution of the spike shapes associated with a particular single unit (e.g., Gaussianity) and by visual inspection of the clustering solution followed by manual validation. When the spatiotemporal waveforms of spikes from different cells overlap, the decision as to whether two spikes should be assigned to the same source can be quite subjective, if it is not based on reliable quantitative measures. We propose a new approach, whereby spike clusters are identified from the most consensual partition across an ensemble of clustering solutions. Using the variability of the clustering solutions across successive iterations of the same clustering algorithm (template matching based on K-means clusters), we estimate the probability of spikes being clustered together and identify groups of spikes that are not statistically distinguishable from one another. Thus, we identify spikes that are most likely to be clustered together and therefore correspond to consistent spike clusters. This method has the potential advantage that it does not rely on any model of the spike shapes. It also provides estimates of the proportion of misclassified spikes for each of the identified clusters. We tested our algorithm on several datasets for which there exists a ground truth (simultaneous intracellular data), and show that it performs close to the optimum reached by a support vector machine trained on the ground truth. We also show that the estimated rate of misclassification matches the proportion of misclassified spikes measured from the ground truth data.

Neuron recycling for learning the alphabetic principles.

Science.gov (United States)

Scliar-Cabral, Leonor

2014-01-01

The main purpose of this paper is to discuss an approach to the phonic method of learning-teaching early literacy development, namely that the visual neurons must be recycled to recognize the small differences among pertinent letter features. In addition to the challenge of segmenting the speech chain and the syllable for learning the alphabetic principles, neuroscience has demonstrated another major challenge: neurons in mammals are programmed to process visual signals symmetrically. In order to develop early literacy, visual neurons must be recycled to overcome this initial programming together with phonological awareness, expanding it with the ability to delimit words, including clitics, as well as assigning stress to words. To achieve this goal, Scliar's Early Literacy Development System was proposed and tested. Sixteen subjects (10 girls and 6 boys) comprised the experimental group (mean age 6.02 years), and 16 subjects (7 girls and 9 boys) formed the control group (mean age 6.10 years). The research instruments were a psychosociolinguistic questionnaire to reveal the subjects' profile and a post-test battery of tests. At the beginning of the experiment, the experimental group was submitted to an intervention program based on Scliar's Early Literacy Development System. One of the tests is discussed in this paper, the grapheme-phoneme test: subjects had to read aloud a pseudoword with 4 graphemes, signaled by the experimenter and designed to assess the subject's ability to convert a grapheme into its correspondent phoneme. The average value for the test group was 25.0 correct answers (SD = 11.4); the control group had an average of 14.3 correct answers (SD = 10.6): The difference was significant. The experimental results validate Scliar's Early Literacy Development System and indicate the need to redesign early literacy development methods. © 2014 S. Karger AG, Basel.

Sorting waste - A question of good will

CERN Multimedia

TS Department - FM Group

2006-01-01

In order to minimise waste-sorting costs, CERN provides two types of container at the entrance of buildings: a green plastic container for paper/cardboard and a metal container for household-type waste. We regret that recently there has been a significant decrease in the extent to which these types of waste are sorted, for example green containers have been found to hold assorted waste such as cardboard boxes filled with polystyrene, bubble-wrap or even plastic bottles, yoghurt pots, etc. Checks have shown that this 'non-compliant' waste does not come from the rubbish bins emptied by the cleaners but is deposited there directly by inconsiderate users. During the months of October and November alone, for example, only 15% of the waste from the paper/cardboard containers was recycled and the remaining 85% had to be incinerated, which entails a high cost for CERN. You should note that once an item of non-compliant waste is found in a green container its contents are immediately sent as waste to be incinerated ...

Bacterial lipoproteins; biogenesis, sorting and quality control.

Science.gov (United States)

Narita, Shin-Ichiro; Tokuda, Hajime

2017-11-01

Bacterial lipoproteins are a subset of membrane proteins localized on either leaflet of the lipid bilayer. These proteins are anchored to membranes through their N-terminal lipid moiety attached to a conserved Cys. Since the protein moiety of most lipoproteins is hydrophilic, they are expected to play various roles in a hydrophilic environment outside the cytoplasmic membrane. Gram-negative bacteria such as Escherichia coli possess an outer membrane, to which most lipoproteins are sorted. The Lol pathway plays a central role in the sorting of lipoproteins to the outer membrane after lipoprotein precursors are processed to mature forms in the cytoplasmic membrane. Most lipoproteins are anchored to the inner leaflet of the outer membrane with their protein moiety in the periplasm. However, recent studies indicated that some lipoproteins further undergo topology change in the outer membrane, and play critical roles in the biogenesis and quality control of the outer membrane. This article is part of a Special Issue entitled: Bacterial Lipids edited by Russell E. Bishop. Copyright © 2016 Elsevier B.V. All rights reserved.

Track data sort program

International Nuclear Information System (INIS)

Abramov, N.A.; Matveev, V.A.; Fedotov, O.P.

1977-01-01

The description is given of the MASKA program, based on the principle of sorting points array at surface due to their belonging to the topologically connected regions with boundaries of locked broken lines. The algorithm is realized on the ES-1010 computer for automatic image processing from the bubble chambers by scanning measuring projector. The methods are considered for constructing the above mentioned regions for all the images according to the base points measured on the semiautomatic measuring table. The MASKA program is written in the ASSEMBLER-2 language and equals 3.5K words of the main memory. The average processing time for 10000 points according to one mask is 1 sec

Neuroscience applied to learning alphabetic principles: new proposals

Directory of Open Access Journals (Sweden)

Leonor Scliar-Cabral

2012-12-01

Full Text Available http://dx.doi.org/10.5007/2175-8026.2012n63p187   This study reviews recent data on functional illiteracy and advances on neuroscience about the reading process. alarming figures on functional illiteracy will be presented with examples of UK and brazil. Empirical evidences brought by neuroscience prove the neuropsychological basis constructs, namely invariance already claimed by modern linguistics. however, emphasis will be given to the psychological reality of letters’ feature invariance, demonstrated by various experiments which had been recently run by neuroscientists. two types of invariance are shown, the spatial and the font invariance, exemplified by a description of invariant features of the roman alphabet. We then cite the major difficulties faced at by beginning readers, namely, how to dismember the chain speech into words (separated in the written space by blanks and the syllable into its units, in order to link them to their correspondent graphemes (composed by one or more letters.  in addition, one of the major difficulties is how to teach neurons to dissymmetrize the letter features. neuroscience conclusions from experiments about the readingprocess demonstrate that neurons of the  occipito-temporalventral region of the left hemisphere must be recycled in orderto learn how to recognize the written word.  altogether withthe results obtained on a well succeeded experience run by theprogram Early intervention initiative (Eii and by an experimentrun in a Florianopolis school, in 2012, they give support to thestrategies to prevent functional illiteracy.

Safe sorting of GFP-transduced live cells for subsequent culture using a modified FACS vantage

DEFF Research Database (Denmark)

Sørensen, T U; Gram, G J; Nielsen, S D

1999-01-01

BACKGROUND: A stream-in-air cell sorter enables rapid sorting to a high purity, but it is not well suited for sorting of infectious material due to the risk of airborne spread to the surroundings. METHODS: A FACS Vantage cell sorter was modified for safe use with potentially HIV infected cells...... culture. CONCLUSIONS: Sorting of live infected cells can be performed safely and with no deleterious effects on vector expression using the modified FACS Vantage instrument....

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.

Comparison of spike-sorting algorithms for future hardware implementation.

Science.gov (United States)

Gibson, Sarah; Judy, Jack W; Markovic, Dejan

2008-01-01

Applications such as brain-machine interfaces require hardware spike sorting in order to (1) obtain single-unit activity and (2) perform data reduction for wireless transmission of data. Such systems must be low-power, low-area, high-accuracy, automatic, and able to operate in real time. Several detection and feature extraction algorithms for spike sorting are described briefly and evaluated in terms of accuracy versus computational complexity. The nonlinear energy operator method is chosen as the optimal spike detection algorithm, being most robust over noise and relatively simple. The discrete derivatives method [1] is chosen as the optimal feature extraction method, maintaining high accuracy across SNRs with a complexity orders of magnitude less than that of traditional methods such as PCA.

Sphingolipid trafficking and protein sorting in epithelial cells

NARCIS (Netherlands)

Slimane, TA; Hoekstra, D

2002-01-01

Sphingolipids represent a minor, but highly dynamic subclass of lipids in all eukaryotic cells. They are involved in functions that range from structural protection to signal transduction and protein sorting, and participate in lipid raft assembly. In polarized epithelial cells, which display an

Optical sorting and photo-transfection of mammalian cells

CSIR Research Space (South Africa)

Mthunzi, P

2010-02-01

Full Text Available and that the scattering force can enable sorting through axial guiding onto laminin coated glass coverslips upon which the selected cells adhere. Following this, I report on transient photo-transfection of mammalian cells including neuroblastomas (rat/mouse and human...

A general design strategy for block copolymer directed self-assembly patterning of integrated circuits contact holes using an alphabet approach.

Science.gov (United States)

Yi, He; Bao, Xin-Yu; Tiberio, Richard; Wong, H-S Philip

2015-02-11

Directed self-assembly (DSA) is a promising lithography candidate for technology nodes beyond 14 nm. Researchers have shown contact hole patterning for random logic circuits using DSA with small physical templates. This paper introduces an alphabet approach that uses a minimal set of small physical templates to pattern all contacts configurations on integrated circuits. We illustrate, through experiments, a general and scalable template design strategy that links the DSA material properties to the technology node requirements.

Raman-Activated Droplet Sorting (RADS) for Label-Free High-Throughput Screening of Microalgal Single-Cells.

Science.gov (United States)

Wang, Xixian; Ren, Lihui; Su, Yetian; Ji, Yuetong; Liu, Yaoping; Li, Chunyu; Li, Xunrong; Zhang, Yi; Wang, Wei; Hu, Qiang; Han, Danxiang; Xu, Jian; Ma, Bo

2017-11-21

Raman-activated cell sorting (RACS) has attracted increasing interest, yet throughput remains one major factor limiting its broader application. Here we present an integrated Raman-activated droplet sorting (RADS) microfluidic system for functional screening of live cells in a label-free and high-throughput manner, by employing AXT-synthetic industrial microalga Haematococcus pluvialis (H. pluvialis) as a model. Raman microspectroscopy analysis of individual cells is carried out prior to their microdroplet encapsulation, which is then directly coupled to DEP-based droplet sorting. To validate the system, H. pluvialis cells containing different levels of AXT were mixed and underwent RADS. Those AXT-hyperproducing cells were sorted with an accuracy of 98.3%, an enrichment ratio of eight folds, and a throughput of ∼260 cells/min. Of the RADS-sorted cells, 92.7% remained alive and able to proliferate, which is equivalent to the unsorted cells. Thus, the RADS achieves a much higher throughput than existing RACS systems, preserves the vitality of cells, and facilitates seamless coupling with downstream manipulations such as single-cell sequencing and cultivation.

Axon-Axon Interactions Regulate Topographic Optic Tract Sorting via CYFIP2-Dependent WAVE Complex Function.

Science.gov (United States)

Cioni, Jean-Michel; Wong, Hovy Ho-Wai; Bressan, Dario; Kodama, Lay; Harris, William A; Holt, Christine E

2018-03-07

The axons of retinal ganglion cells (RGCs) are topographically sorted before they arrive at the optic tectum. This pre-target sorting, typical of axon tracts throughout the brain, is poorly understood. Here, we show that cytoplasmic FMR1-interacting proteins (CYFIPs) fulfill non-redundant functions in RGCs, with CYFIP1 mediating axon growth and CYFIP2 specifically involved in axon sorting. We find that CYFIP2 mediates homotypic and heterotypic contact-triggered fasciculation and repulsion responses between dorsal and ventral axons. CYFIP2 associates with transporting ribonucleoprotein particles in axons and regulates translation. Axon-axon contact stimulates CYFIP2 to move into growth cones where it joins the actin nucleating WAVE regulatory complex (WRC) in the periphery and regulates actin remodeling and filopodial dynamics. CYFIP2's function in axon sorting is mediated by its binding to the WRC but not its translational regulation. Together, these findings uncover CYFIP2 as a key regulatory link between axon-axon interactions, filopodial dynamics, and optic tract sorting. Copyright © 2018 The Authors. Published by Elsevier Inc. All rights reserved.

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.

Spike sorting using locality preserving projection with gap statistics and landmark-based spectral clustering.

Science.gov (United States)

Nguyen, Thanh; Khosravi, Abbas; Creighton, Douglas; Nahavandi, Saeid

2014-12-30

Understanding neural functions requires knowledge from analysing electrophysiological data. The process of assigning spikes of a multichannel signal into clusters, called spike sorting, is one of the important problems in such analysis. There have been various automated spike sorting techniques with both advantages and disadvantages regarding accuracy and computational costs. Therefore, developing spike sorting methods that are highly accurate and computationally inexpensive is always a challenge in the biomedical engineering practice. An automatic unsupervised spike sorting method is proposed in this paper. The method uses features extracted by the locality preserving projection (LPP) algorithm. These features afterwards serve as inputs for the landmark-based spectral clustering (LSC) method. Gap statistics (GS) is employed to evaluate the number of clusters before the LSC can be performed. The proposed LPP-LSC is highly accurate and computationally inexpensive spike sorting approach. LPP spike features are very discriminative; thereby boost the performance of clustering methods. Furthermore, the LSC method exhibits its efficiency when integrated with the cluster evaluator GS. The proposed method's accuracy is approximately 13% superior to that of the benchmark combination between wavelet transformation and superparamagnetic clustering (WT-SPC). Additionally, LPP-LSC computing time is six times less than that of the WT-SPC. LPP-LSC obviously demonstrates a win-win spike sorting solution meeting both accuracy and computational cost criteria. LPP and LSC are linear algorithms that help reduce computational burden and thus their combination can be applied into real-time spike analysis. Copyright © 2014 Elsevier B.V. All rights reserved.

Longest Common Extensions via Fingerprinting

DEFF Research Database (Denmark)

Bille, Philip; Gørtz, Inge Li; Kristensen, Jesper

2012-01-01

query time, no extra space and no preprocessing achieves significantly better average case performance. We show a new algorithm, Fingerprint k , which for a parameter k, 1 ≤ k ≤ [log n], on a string of length n and alphabet size σ, gives O(k n1/k) query time using O(k n) space and O(k n + sort......(n,σ)) preprocessing time, where sort(n,σ) is the time it takes to sort n numbers from σ. Though this solution is asymptotically strictly worse than the asymptotically best previously known algorithms, it outperforms them in practice in average case and is almost as fast as the simple linear time algorithm. On worst....... The LCE problem can be solved in linear space with constant query time and a preprocessing of sorting complexity. There are two known approaches achieving these bounds, which use nearest common ancestors and range minimum queries, respectively. However, in practice a much simpler approach with linear...

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).

The structured-objective rorschach test (sort occupational profile for state accountants

Directory of Open Access Journals (Sweden)

J. J. Gouws

1996-06-01

Full Text Available The objective of this study was to provide an occupational profile of performance on the Structured-Objective Rorschach Test (SORT by state accountants for use in guidance, election and placement of personnel. The sample comprised accountants and auditors from the financial sections in various state institutions who were selected for the Senior Financial Management Course at the University of Stellenbosch. As all participants were considered successful in their occupation and no significant differences were found between the profiles of various age and year groups, the SORT profile obtained for the total group can be used as a predictor to determine and evaluate the personality traits that are important in the profession of state accountant. Opsomming Die doel van hierdie studie was die daarstelling van 'n beroepsprofiel van staatsrekenmeesters se prestasie op die Gestruktureerd-Objektiewe Rorschachtoets (SORT wat vir voorligting/ keuring en plasing van personeel gebruik kan word. Die steekproef is saamgestel uit rekenmeesters en ouditeure van die finansiele afdelings in verskeie staatsinstansies wat geselekteer is vir die Senior Finansiele Bestuurskursus by die Universiteit van Stellenbosch. Aangesien alle deelnemers as suksesvol in hulle beroep beskou is en geen beduidende verskille in die profiele van verskillende ouderdomsgroepe en jaargroepe gevind is nie, kan die SORT profiel van die totale groep as 'n voorspeller gebruik word vir die bepaling en evaluering van die persoonlikheidseienskappe wat belangrik is in die beroep van staatsrekenmeester.

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.

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.

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

OpenAIRE

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 models. Two measuring techniques have been developed. The first technique is aimed at measuring the size stratification of a sand-gravel deposit through combining image analysis and a sediment remov...

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

Sorting and quantifying orbital angular momentum of laser beams

CSIR Research Space (South Africa)

Schulze, C

2013-10-01

Full Text Available We present a novel tool for sorting the orbital angular momentum and to determine the orbital angular momentum density of laser beams, which is based on the use of correlation filters....

Stability-based sorting: The forgotten process behind (not only) biological evolution.

Science.gov (United States)

Toman, Jan; Flegr, Jaroslav

2017-12-21

Natural selection is considered to be the main process that drives biological evolution. It requires selected entities to originate dependent upon one another by the means of reproduction or copying, and for the progeny to inherit the qualities of their ancestors. However, natural selection is a manifestation of a more general persistence principle, whose temporal consequences we propose to name "stability-based sorting" (SBS). Sorting based on static stability, i.e., SBS in its strict sense and usual conception, favours characters that increase the persistence of their holders and act on all material and immaterial entities. Sorted entities could originate independently from each other, are not required to propagate and need not exhibit heredity. Natural selection is a specific form of SBS-sorting based on dynamic stability. It requires some form of heredity and is based on competition for the largest difference between the speed of generating its own copies and their expiration. SBS in its strict sense and selection thus have markedly different evolutionary consequences that are stressed in this paper. In contrast to selection, which is opportunistic, SBS is able to accumulate even momentarily detrimental characters that are advantageous for the long-term persistence of sorted entities. However, it lacks the amplification effect based on the preferential propagation of holders of advantageous characters. Thus, it works slower than selection and normally is unable to create complex adaptations. From a long-term perspective, SBS is a decisive force in evolution-especially macroevolution. SBS offers a new explanation for numerous evolutionary phenomena, including broad distribution and persistence of sexuality, altruistic behaviour, horizontal gene transfer, patterns of evolutionary stasis, planetary homeostasis, increasing ecosystem resistance to disturbances, and the universal decline of disparity in the evolution of metazoan lineages. SBS acts on all levels in

Mathematical fundamentals for the noise immunity of the genetic code.

Science.gov (United States)

Fimmel, Elena; Strüngmann, Lutz

2018-02-01

Symmetry is one of the essential and most visible patterns that can be seen in nature. Starting from the left-right symmetry of the human body, all types of symmetry can be found in crystals, plants, animals and nature as a whole. Similarly, principals of symmetry are also some of the fundamental and most useful tools in modern mathematical natural science that play a major role in theory and applications. As a consequence, it is not surprising that the desire to understand the origin of life, based on the genetic code, forces us to involve symmetry as a mathematical concept. The genetic code can be seen as a key to biological self-organisation. All living organisms have the same molecular bases - an alphabet consisting of four letters (nitrogenous bases): adenine, cytosine, guanine, and thymine. Linearly ordered sequences of these bases contain the genetic information for synthesis of proteins in all forms of life. Thus, one of the most fascinating riddles of nature is to explain why the genetic code is as it is. Genetic coding possesses noise immunity which is the fundamental feature that allows to pass on the genetic information from parents to their descendants. Hence, since the time of the discovery of the genetic code, scientists have tried to explain the noise immunity of the genetic information. In this chapter we will discuss recent results in mathematical modelling of the genetic code with respect to noise immunity, in particular error-detection and error-correction. We will focus on two central properties: Degeneracy and frameshift correction. Different amino acids are encoded by different quantities of codons and a connection between this degeneracy and the noise immunity of genetic information is a long standing hypothesis. Biological implications of the degeneracy have been intensively studied and whether the natural code is a frozen accident or a highly optimised product of evolution is still controversially discussed. Symmetries in the structure of

Performance pay, sorting and social motivation

OpenAIRE

Eriksson, Tor; Villeval, Marie Claire

2008-01-01

International audience; Variable pay links pay and performance but may also help firms in attracting more productive employees. Our experiment investigates the impact of performance pay on both incentives and sorting and analyzes the influence of repeated interactions between firms and employees on these effects. We show that (i) the opportunity to switch from a fixed wage to variable pay scheme increases the average effort level and its variance; (ii) high skill employees concentrate under t...

Educational Games for Early Childhood: Using Tabletop Surface Computers for Teaching the Arabic Alphabet

DEFF Research Database (Denmark)

Papadopoulos, Pantelis M.; Ibrahim, Zeinab; Karatsolis, Andreas

2015-01-01

This paper presents initial evaluation regarding the use of simple educational games on tabletop surface computers to teach Kindergarten students in Qatar the Arabic alphabet. This effort is part of the “Arabiyyatii” research project, a 3-year endeavor aimed to teach 5-year-olds Modern Standard...... to the students, along with data collected from system log files and class observations. Result analysis suggests that these kinds of games could be useful in (a) enhancing students’ engagement in language learning, (b) increasing their exposure to MSA, and (c) developing their vocabulary....... Arabic (MSA). The paper describes a naturalistic study design, following the activities of 18 students for a period of 9 weeks in the project. All students were native speakers of the Qatari dialect and they were early users of similar surface technologies. The paper presents three of the games available...

THE STUDY OF SELF-BALANCED POTATO SORTING MACHINE WITH LINEAR INDUCTION DRIVE

OpenAIRE

Linenko A. V.; Baynazarov V. G.; Kamalov T. I.

2016-01-01

In the article we have considered the self-balanced potato sorting machine differing from existing designs of self-balanced potato sorting machines with an oscillatory electric drive. That drive uses a linear induction motor. As the counterbalancing device, the method of the duplicating mechanism is applied. The duplicating mechanism is a specular reflection of the main working body, and also participates in technological process. Its application in the drive of machine allows not only to inc...

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

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.

European project BOOSTER: how to sort victims of a nuclear accident?

International Nuclear Information System (INIS)

Robbe, M.F.; Gmar, M.; Schoepff, V.

2013-01-01

The purpose of the BOOSTER project is to develop tools allowing victims to be sorted quickly according to their level of irradiation. The fastness of the sorting is very important as a nuclear accident or a terrorist attack involving a dirty bomb is likely to cause numerous casualties. A preliminary sorting can be made with a portable walk-through gamma detector that allows the detection of contaminated victims. 4 technologies are proposed for assessing in less than 20 minutes the level of irradiation of a victim: the first method that is based on the analysis of the phosphorylation of the H2AX protein, allows the determination of the irradiation level from the analysis of a drop of blood. The second method allows the determination of the radionuclides present in a drop of blood or urine. The third method uses the thermo-luminescent properties of SMD resistances present in mobile phones to determine the level of irradiation. The fourth method is based on a portable low-background gamma spectrometer able to study environmental and biological samples on the spot. (A.C.)

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.

Mining protein loops using a structural alphabet and statistical exceptionality

Directory of Open Access Journals (Sweden)

Martin Juliette

2010-02-01

Full Text Available Abstract Background Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, catalytic pocket... However, the description of protein loops with conventional tools is an uneasy task. Regular secondary structures, helices and strands, have been widely studied whereas loops, because they are highly variable in terms of sequence and structure, are difficult to analyze. Due to data sparsity, long loops have rarely been systematically studied. Results We developed a simple and accurate method that allows the description and analysis of the structures of short and long loops using structural motifs without restriction on loop length. This method is based on the structural alphabet HMM-SA. HMM-SA allows the simplification of a three-dimensional protein structure into a one-dimensional string of states, where each state is a four-residue prototype fragment, called structural letter. The difficult task of the structural grouping of huge data sets is thus easily accomplished by handling structural letter strings as in conventional protein sequence analysis. We systematically extracted all seven-residue fragments in a bank of 93000 protein loops and grouped them according to the structural-letter sequence, named structural word. This approach permits a systematic analysis of loops of all sizes since we consider the structural motifs of seven residues rather than complete loops. We focused the analysis on highly recurrent words of loops (observed more than 30 times. Our study reveals that 73% of loop-lengths are covered by only 3310 highly recurrent structural words out of 28274 observed words. These structural words have low structural variability (mean RMSd of 0.85 Å. As expected, half of these motifs display a flanking-region preference but interestingly, two thirds are shared by short (less than 12 residues and long loops. Moreover, half of

Mining protein loops using a structural alphabet and statistical exceptionality.

Science.gov (United States)

Regad, Leslie; Martin, Juliette; Nuel, Gregory; Camproux, Anne-Claude

2010-02-04

Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, catalytic pocket... However, the description of protein loops with conventional tools is an uneasy task. Regular secondary structures, helices and strands, have been widely studied whereas loops, because they are highly variable in terms of sequence and structure, are difficult to analyze. Due to data sparsity, long loops have rarely been systematically studied. We developed a simple and accurate method that allows the description and analysis of the structures of short and long loops using structural motifs without restriction on loop length. This method is based on the structural alphabet HMM-SA. HMM-SA allows the simplification of a three-dimensional protein structure into a one-dimensional string of states, where each state is a four-residue prototype fragment, called structural letter. The difficult task of the structural grouping of huge data sets is thus easily accomplished by handling structural letter strings as in conventional protein sequence analysis. We systematically extracted all seven-residue fragments in a bank of 93000 protein loops and grouped them according to the structural-letter sequence, named structural word. This approach permits a systematic analysis of loops of all sizes since we consider the structural motifs of seven residues rather than complete loops. We focused the analysis on highly recurrent words of loops (observed more than 30 times). Our study reveals that 73% of loop-lengths are covered by only 3310 highly recurrent structural words out of 28274 observed words). These structural words have low structural variability (mean RMSd of 0.85 A). As expected, half of these motifs display a flanking-region preference but interestingly, two thirds are shared by short (less than 12 residues) and long loops. Moreover, half of recurrent motifs exhibit a significant level of

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.

Evaluation of motility, membrane status and DNA integrity of frozen-thawed bottlenose dolphin (Tursiops truncatus) spermatozoa after sex-sorting and recryopreservation.

Science.gov (United States)

Montano, G A; Kraemer, D C; Love, C C; Robeck, T R; O'Brien, J K

2012-06-01

Artificial insemination (AI) with sex-sorted frozen-thawed spermatozoa has led to enhanced management of ex situ bottlenose dolphin populations. Extended distance of animals from the sorting facility can be overcome by the use of frozen-thawed, sorted and recryopreserved spermatozoa. Although one bottlenose dolphin calf had been born using sexed frozen-thawed spermatozoa derived from frozen semen, a critical evaluation of in vitro sperm quality is needed to justify the routine use of such samples in AI programs. Sperm motility parameters and plasma membrane integrity were influenced by stage of the sex-sorting process, sperm type (non-sorted and sorted) and freezing method (straw and directional) (P0.05) at 24 h. The viability of sorted spermatozoa was higher (Pdolphin spermatozoa undergoing cryopreservation, sorting and recryopreservation are of adequate quality for use in AI.

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

Efficiency at Sorting Cards in Compressed Air

Science.gov (United States)

Poulton, E. C.; Catton, M. J.; Carpenter, A.

1964-01-01

At a site where compressed air was being used in the construction of a tunnel, 34 men sorted cards twice, once at normal atmospheric pressure and once at 3½, 2½, or 2 atmospheres absolute pressure. An additional six men sorted cards twice at normal atmospheric pressure. When the task was carried out for the first time, all the groups of men performing at raised pressure were found to yield a reliably greater proportion of very slow responses than the group of men performing at normal pressure. There was reliably more variability in timing at 3½ and 2½ atmospheres absolute than at normal pressure. At 3½ atmospheres absolute the average performance was also reliably slower. When the task was carried out for the second time, exposure to 3½ atmospheres absolute pressure had no reliable effect. Thus compressed air affected performance only while the task was being learnt; it had little effect after practice. No reliable differences were found related to age, to length of experience in compressed air, or to the duration of the exposure to compressed air, which was never less than 10 minutes at 3½ atmospheres absolute pressure. PMID:14180485

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.

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.

Job Sorting in African Labor Markets

OpenAIRE

Marcel Fafchamps; Mans Soderbom; Najy Benhassine

2006-01-01

Using matched employer-employee data from eleven African countries, we investigate if there is a job sorting in African labor markets. We find that much of the wage gap correlated with education is driven by selection across occupations and firms. This is consistent with educated workers being more effective at complex tasks like labor management. In all countries the education wage gap widens rapidly at high low levels of education. Most of the education wage gap at low levels of education c...

Unnatural base pair systems toward the expansion of the genetic alphabet in the central dogma.

Science.gov (United States)

Hirao, Ichiro; Kimoto, Michiko

2012-01-01

Toward the expansion of the genetic alphabet of DNA, several artificial third base pairs (unnatural base pairs) have been created. Synthetic DNAs containing the unnatural base pairs can be amplified faithfully by PCR, along with the natural A-T and G-C pairs, and transcribed into RNA. The unnatural base pair systems now have high potential to open the door to next generation biotechnology. The creation of unnatural base pairs is a consequence of repeating "proof of concept" experiments. In the process, initially designed base pairs were modified to address their weak points. Some of them were artificially evolved to ones with higher efficiency and selectivity in polymerase reactions, while others were eliminated from the analysis. Here, we describe the process of unnatural base pair development, as well as the tests of their applications.

Bibliography of astatine chemistry and biomedical applications

International Nuclear Information System (INIS)

Berei, K.; Vasaros, L.

1992-02-01

An overall bibliography is presented on astatine chemistry and on the biomedical applications of its 211 At isotope. The references were grouped in the following chapters: General reviews; Discovery, Natural Occurence; Nuclear Data; Preparation, Handling, Radiation Risk; Physico-chemical Properties; Astatine Compounds and Chemical Reactions; Biological Effects and Applications. Entries are sorted alphabetically by authors name in each chapter, and cross-references to other chapters are provided if appropriate. (R.P.)

Mechanism for Particle Transport and Size Sorting via Low-Frequency Vibrations

Science.gov (United States)

Sherrit, Stewart; Scott, James S.; Bar-Cohen, Yoseph; Badescu, Mircea; Bao, Xiaoqi

2010-01-01

There is a need for effective sample handling tools to deliver and sort particles for analytical instruments that are planned for use in future NASA missions. Specifically, a need exists for a compact mechanism that allows transporting and sieving particle sizes of powdered cuttings and soil grains that may be acquired by sampling tools such as a robotic scoop or drill. The required tool needs to be low mass and compact to operate from such platforms as a lander or rover. This technology also would be applicable to sample handling when transporting samples to analyzers and sorting particles by size.

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.

A fully automated non-external marker 4D-CT sorting algorithm using a serial cine scanning protocol.

Science.gov (United States)

Carnes, Greg; Gaede, Stewart; Yu, Edward; Van Dyk, Jake; Battista, Jerry; Lee, Ting-Yim

2009-04-07

Current 4D-CT methods require external marker data to retrospectively sort image data and generate CT volumes. In this work we develop an automated 4D-CT sorting algorithm that performs without the aid of data collected from an external respiratory surrogate. The sorting algorithm requires an overlapping cine scan protocol. The overlapping protocol provides a spatial link between couch positions. Beginning with a starting scan position, images from the adjacent scan position (which spatial match the starting scan position) are selected by maximizing the normalized cross correlation (NCC) of the images at the overlapping slice position. The process was continued by 'daisy chaining' all couch positions using the selected images until an entire 3D volume was produced. The algorithm produced 16 phase volumes to complete a 4D-CT dataset. Additional 4D-CT datasets were also produced using external marker amplitude and phase angle sorting methods. The image quality of the volumes produced by the different methods was quantified by calculating the mean difference of the sorted overlapping slices from adjacent couch positions. The NCC sorted images showed a significant decrease in the mean difference (p < 0.01) for the five patients.

Feature extraction using extrema sampling of discrete derivatives for spike sorting in implantable upper-limb neural prostheses.

Science.gov (United States)

Zamani, Majid; Demosthenous, Andreas

2014-07-01

Next generation neural interfaces for upper-limb (and other) prostheses aim to develop implantable interfaces for one or more nerves, each interface having many neural signal channels that work reliably in the stump without harming the nerves. To achieve real-time multi-channel processing it is important to integrate spike sorting on-chip to overcome limitations in transmission bandwidth. This requires computationally efficient algorithms for feature extraction and clustering suitable for low-power hardware implementation. This paper describes a new feature extraction method for real-time spike sorting based on extrema analysis (namely positive peaks and negative peaks) of spike shapes and their discrete derivatives at different frequency bands. Employing simulation across different datasets, the accuracy and computational complexity of the proposed method are assessed and compared with other methods. The average classification accuracy of the proposed method in conjunction with online sorting (O-Sort) is 91.6%, outperforming all the other methods tested with the O-Sort clustering algorithm. The proposed method offers a better tradeoff between classification error and computational complexity, making it a particularly strong choice for on-chip spike sorting.

N-Glycosylation instead of cholesterol mediates oligomerization and apical sorting of GPI-APs in FRT cells.

Science.gov (United States)

Imjeti, Naga Salaija; Lebreton, Stéphanie; Paladino, Simona; de la Fuente, Erwin; Gonzalez, Alfonso; Zurzolo, Chiara

2011-12-01

Sorting of glycosylphosphatidyl-inositol--anchored proteins (GPI-APs) in polarized epithelial cells is not fully understood. Oligomerization in the Golgi complex has emerged as the crucial event driving apical segregation of GPI-APs in two different kind of epithelial cells, Madin-Darby canine kidney (MDCK) and Fisher rat thyroid (FRT) cells, but whether the mechanism is conserved is unknown. In MDCK cells cholesterol promotes GPI-AP oligomerization, as well as apical sorting of GPI-APs. Here we show that FRT cells lack this cholesterol-driven oligomerization as apical sorting mechanism. In these cells both apical and basolateral GPI-APs display restricted diffusion in the Golgi likely due to a cholesterol-enriched membrane environment. It is striking that N-glycosylation is the critical event for oligomerization and apical sorting of GPI-APs in FRT cells but not in MDCK cells. Our data indicate that at least two mechanisms exist to determine oligomerization in the Golgi leading to apical sorting of GPI-APs. One depends on cholesterol, and the other depends on N-glycosylation and is insensitive to cholesterol addition or depletion.

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.

System for sorting microscopic objects using electromagnetic radiation

DEFF Research Database (Denmark)

2013-01-01

There is presented a system 10,100 for sorting microscopic objects 76, 78, 80, where the system comprises a fluid channel 66 with an inlet 68 and an outlet 70, where the fluid channel is arranged for allowing the fluid flow to be laminar. The system furthermore comprises a detection system 52 whi...

Financial feasibility of a log sort yard handling small-diameter logs: A preliminary study

Science.gov (United States)

Han-Sup Han; E. M. (Ted) Bilek; John (Rusty) Dramm; Dan Loeffler; Dave Calkin

2011-01-01

The value and use of the trees removed in fuel reduction thinning and restoration treatments could be enhanced if the wood were effectively evaluated and sorted for quality and highest value before delivery to the next manufacturing destination. This article summarizes a preliminary financial feasibility analysis of a log sort yard that would serve as a log market to...

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

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.

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

Development of nondestructive sorting method for brown bloody eggs using VIS/NIR spectroscopy

Energy Technology Data Exchange (ETDEWEB)

Lee, Hong Seock; Kim, Dae Yong; Kandpal, Lalit Mohan; Lee, Sang Dae; Cho, Byoung Kwan [Dept. of Biosystems Machinery Engineering, College of Agriculture and Life Science, Chungnam National University, Daejeon (Korea, Republic of); Mo, Chang Yeun; Hong, Soon Jung [Rural Development Administration, Jeonju (Korea, Republic of)

2014-02-15

The aim of this study was the non-destructive evaluation of bloody eggs using VIS/NIR spectroscopy. The bloody egg samples used to develop the sorting mode were produced by injecting chicken blood into the edges of egg yolks. Blood amounts of 0.1, 0.7, 0.04, and 0.01 mL were used for the bloody egg samples. The wavelength range for the VIS/NIR spectroscopy was 471 to 1154 nm, and the spectral resolution was 1.5nm. For the measurement system, the position of the light source was set to, and the distance between the light source and samples was set to 100 mm. The minimum exposure time of the light source was set to 30 ms to ensure the fast sorting of bloody eggs and prevent heating damage of the egg samples. Partial least squares-discriminant analysis (PLS-DA) was used for the spectral data obtained from VIS/NIR spectroscopy. The classification accuracies of the sorting models developed with blood samples of 0.1, 0.07, 0.04, and 0.01 mL were 97.9%, 98.9%, 94.8%, and 86.45%, respectively. In this study, a novel nondestructive sorting technique was developed to detect bloody brown eggs using spectral data obtained from VIS/NIR spectroscopy.

Structural deformation upon protein-protein interaction: a structural alphabet approach.

Science.gov (United States)

Martin, Juliette; Regad, Leslie; Lecornet, Hélène; Camproux, Anne-Claude

2008-02-28

In a number of protein-protein complexes, the 3D structures of bound and unbound partners significantly differ, supporting the induced fit hypothesis for protein-protein binding. In this study, we explore the induced fit modifications on a set of 124 proteins available in both bound and unbound forms, in terms of local structure. The local structure is described thanks to a structural alphabet of 27 structural letters that allows a detailed description of the backbone. Using a control set to distinguish induced fit from experimental error and natural protein flexibility, we show that the fraction of structural letters modified upon binding is significantly greater than in the control set (36% versus 28%). This proportion is even greater in the interface regions (41%). Interface regions preferentially involve coils. Our analysis further reveals that some structural letters in coil are not favored in the interface. We show that certain structural letters in coil are particularly subject to modifications at the interface, and that the severity of structural change also varies. These information are used to derive a structural letter substitution matrix that summarizes the local structural changes observed in our data set. We also illustrate the usefulness of our approach to identify common binding motifs in unrelated proteins. Our study provides qualitative information about induced fit. These results could be of help for flexible docking.

Structural deformation upon protein-protein interaction: A structural alphabet approach

Directory of Open Access Journals (Sweden)

Lecornet Hélène

2008-02-01

Full Text Available Abstract Background In a number of protein-protein complexes, the 3D structures of bound and unbound partners significantly differ, supporting the induced fit hypothesis for protein-protein binding. Results In this study, we explore the induced fit modifications on a set of 124 proteins available in both bound and unbound forms, in terms of local structure. The local structure is described thanks to a structural alphabet of 27 structural letters that allows a detailed description of the backbone. Using a control set to distinguish induced fit from experimental error and natural protein flexibility, we show that the fraction of structural letters modified upon binding is significantly greater than in the control set (36% versus 28%. This proportion is even greater in the interface regions (41%. Interface regions preferentially involve coils. Our analysis further reveals that some structural letters in coil are not favored in the interface. We show that certain structural letters in coil are particularly subject to modifications at the interface, and that the severity of structural change also varies. These information are used to derive a structural letter substitution matrix that summarizes the local structural changes observed in our data set. We also illustrate the usefulness of our approach to identify common binding motifs in unrelated proteins. Conclusion Our study provides qualitative information about induced fit. These results could be of help for flexible docking.

INTERACTING MANY-PARTICLE SYSTEMS OF DIFFERENT PARTICLE TYPES CONVERGE TO A SORTED STATE

DEFF Research Database (Denmark)

Kokkendorff, Simon Lyngby; Starke, Jens; Hummel, N.

2010-01-01

We consider a model class of interacting many-particle systems consisting of different types of particles defined by a gradient flow. The corresponding potential expresses attractive and repulsive interactions between particles of the same type and different types, respectively. The introduced...... system converges by self-organized pattern formation to a sorted state where particles of the same type share a common position and those of different types are separated from each other. This is proved in the sense that we show that the property of being sorted is asymptotically stable and all other...... states are unstable. The models are motivated from physics, chemistry, and biology, and the principal investigations can be useful for many systems with interacting particles or agents. The models match particularly well a system in neuroscience, namely the axonal pathfinding and sorting in the olfactory...

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.

Sorting, Searching, and Simulation in the MapReduce Framework

DEFF Research Database (Denmark)

Goodrich, Michael T.; Sitchinava, Nodar; Zhang, Qin

2011-01-01

We study the MapReduce framework from an algorithmic standpoint, providing a generalization of the previous algorithmic models for MapReduce. We present optimal solutions for the fundamental problems of all-prefix-sums, sorting and multi-searching. Additionally, we design optimal simulations...

Application of Quality Function Deployment (QFD) method and kano model to redesign fresh fruit bunches sorting tool

Science.gov (United States)

Anizar; Siregar, I.; Yahya, I.; Yesika, N.

2018-02-01

The activity of lowering fresh fruit bunches (FFB) from truck to sorting floor is performed manually by workers using a sorting tool. Previously, the sorting tool used is a pointed iron bar with a T-shaped handle. Changes made to the sorting tool causes several complaints on worker and affect the time to lower the fruit. The purpose of this article is to obtain the design of an FFB sorting tool that suits the needs of these workers by applying the Quality Function Deployment (QFD) and Kano Model methods. Both of the two methods will be integrated to find the design that matches workers’ image and psychological feeling. The main parameters are to obtain the customer requirements of the palm fruit loading workers, to find the most important technical characteristics and critical part affecting the quality of the FFB sorting tool. The customer requirements of the palm loading workers are the following : the color of the coating paint is gray, the bar material is made of stainless pipe, the main grip coating material is made of grip, the tip material is made of the spring steel, the additional grip is made of rubber and the handle is of triangular shape.

Measurement, sorting and tuning of LCLS undulator magnets

CERN Document Server

Vasserman, I B; Dejus, Roger J; Moog, E; Trakhtenberg, E; Vinokurov, N A

2002-01-01

Currently, a Linac Coherent Light Source (LCLS) prototype undulator is under construction. The prototype is a 3.4-m-long hybrid-type undulator with fixed gap of 6 mm. The period length is 30 mm and the number of poles is 226. For this undulator, 450 NdFeB magnet blocks are used. This project does not have demanding requirements for multipole component errors, but the field strength at x=0 should be as precise as possible to provide proper particle steering and phase errors. The first set of magnetic blocks has been measured. The strength and direction of magnetization of the magnet blocks are measured using a Helmholtz coil system. In addition to this, Hall probe measurements are performed for magnet blocks while they are mounted in a specially designed cassette with vanadium-permendur poles. The magnet blocks will be sorted using these data to minimize errors. Computer simulations show that magnets may be sorted in decreasing strengths with little or no additional tuning of the undulators.

Spike sorting based upon machine learning algorithms (SOMA).

Science.gov (United States)

Horton, P M; Nicol, A U; Kendrick, K M; Feng, J F

2007-02-15

We have developed a spike sorting method, using a combination of various machine learning algorithms, to analyse electrophysiological data and automatically determine the number of sampled neurons from an individual electrode, and discriminate their activities. We discuss extensions to a standard unsupervised learning algorithm (Kohonen), as using a simple application of this technique would only identify a known number of clusters. Our extra techniques automatically identify the number of clusters within the dataset, and their sizes, thereby reducing the chance of misclassification. We also discuss a new pre-processing technique, which transforms the data into a higher dimensional feature space revealing separable clusters. Using principal component analysis (PCA) alone may not achieve this. Our new approach appends the features acquired using PCA with features describing the geometric shapes that constitute a spike waveform. To validate our new spike sorting approach, we have applied it to multi-electrode array datasets acquired from the rat olfactory bulb, and from the sheep infero-temporal cortex, and using simulated data. The SOMA sofware is available at http://www.sussex.ac.uk/Users/pmh20/spikes.

Natural Selection Is a Sorting Process: What Does that Mean?

Science.gov (United States)

Price, Rebecca M.

2013-01-01

To learn why natural selection acts only on existing variation, students categorize processes as either creative or sorting. This activity helps students confront the misconception that adaptations evolve because species need them.

SALT [System Analysis Language Translater]: A steady state and dynamic systems code

International Nuclear Information System (INIS)

Berry, G.; Geyer, H.

1983-01-01

SALT (System Analysis Language Translater) is a lumped parameter approach to system analysis which is totally modular. The modules are all precompiled and only the main program, which is generated by SALT, needs to be compiled for each unique system configuration. This is a departure from other lumped parameter codes where all models are written by MACROS and then compiled for each unique configuration, usually after all of the models are lumped together and sorted to eliminate undetermined variables. The SALT code contains a robust and sophisticated steady-sate finder (non-linear equation solver), optimization capability and enhanced GEAR integration scheme which makes use of sparsity and algebraic constraints. The SALT systems code has been used for various technologies. The code was originally developed for open-cycle magnetohydrodynamic (MHD) systems. It was easily extended to liquid metal MHD systems by simply adding the appropriate models and property libraries. Similarly, the model and property libraries were expanded to handle fuel cell systems, flue gas desulfurization systems, combined cycle gasification systems, fluidized bed combustion systems, ocean thermal energy conversion systems, geothermal systems, nuclear systems, and conventional coal-fired power plants. Obviously, the SALT systems code is extremely flexible to be able to handle all of these diverse systems. At present, the dynamic option has only been used for LMFBR nuclear power plants and geothermal power plants. However, it can easily be extended to other systems and can be used for analyzing control problems. 12 refs

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.

Numerical Model of Streaming DEP for Stem Cell Sorting

Directory of Open Access Journals (Sweden)

Rucha Natu

2016-11-01

Full Text Available Neural stem cells are of special interest due to their potential in neurogenesis to treat spinal cord injuries and other nervous disorders. Flow cytometry, a common technique used for cell sorting, is limited due to the lack of antigens and labels that are specific enough to stem cells of interest. Dielectrophoresis (DEP is a label-free separation technique that has been recently demonstrated for the enrichment of neural stem/progenitor cells. Here we use numerical simulation to investigate the use of streaming DEP for the continuous sorting of neural stem/progenitor cells. Streaming DEP refers to the focusing of cells into streams by equilibrating the dielectrophoresis and drag forces acting on them. The width of the stream should be maximized to increase throughput while the separation between streams must be widened to increase efficiency during retrieval. The aim is to understand how device geometry and experimental variables affect the throughput and efficiency of continuous sorting of SC27 stem cells, a neurogenic progenitor, from SC23 cells, an astrogenic progenitor. We define efficiency as the ratio between the number of SC27 cells over total number of cells retrieved in the streams, and throughput as the number of SC27 cells retrieved in the streams compared to their total number introduced to the device. The use of cylindrical electrodes as tall as the channel yields streams featuring >98% of SC27 cells and width up to 80 µm when using a flow rate of 10 µL/min and sample cell concentration up to 105 cells/mL.

Mineral-PET Kimberlite sorting by nuclear-medical technology

CERN Document Server

Ballestrero, S; Cafferty, L; Caveney, R; Connell, SH; Cook, M; Dalton, M; Gopal, H; Ives, N; Lee, C A; Mampe, W; Phoku, M; Roodt, A; Sibande, W; Sellschop, J P F; Topkin, J; Unwucholaa, D A

2010-01-01

A revolutionary new technology for diamond bearing rock sorting which has its roots in medical-nuclear physics has been taken through a substantial part of the R&D phase. This has led to the construction of the technology demonstrator. Experiments using the technology demonstrator and experiments at a hospital have established the scientific and technological viability of the project.

The AutoProof Verifier: Usability by Non-Experts and on Standard Code

Directory of Open Access Journals (Sweden)

Carlo A. Furia

2015-08-01

Full Text Available Formal verification tools are often developed by experts for experts; as a result, their usability by programmers with little formal methods experience may be severely limited. In this paper, we discuss this general phenomenon with reference to AutoProof: a tool that can verify the full functional correctness of object-oriented software. In particular, we present our experiences of using AutoProof in two contrasting contexts representative of non-expert usage. First, we discuss its usability by students in a graduate course on software verification, who were tasked with verifying implementations of various sorting algorithms. Second, we evaluate its usability in verifying code developed for programming assignments of an undergraduate course. The first scenario represents usability by serious non-experts; the second represents usability on "standard code", developed without full functional verification in mind. We report our experiences and lessons learnt, from which we derive some general suggestions for furthering the development of verification tools with respect to improving their usability.

Ore sorting using natural gamma radiation

International Nuclear Information System (INIS)

Clark, G.J.; Dickson, B.L.; Gray, F.E.

1980-01-01

A method of sorting an ore which emits natural gamma radiation is described, comprising the steps of: (a) mining the ore, (b) placing, substantially at the mining location, the sampled or mined ore on to a moving conveyor belt, (c) measuring the natural gamma emission, water content and mass of the ore while the ore is on the conveyor belt, (d) using the gamma, water content and mass measurements to determine the ore grade, and (e) directing the ore to a location characteristic of its grade when it leaves the conveyor belt

A hidden markov model derived structural alphabet for proteins.

Science.gov (United States)

Camproux, A C; Gautier, R; Tufféry, P

2004-06-04

Understanding and predicting protein structures depends on the complexity and the accuracy of the models used to represent them. We have set up a hidden Markov model that discretizes protein backbone conformation as series of overlapping fragments (states) of four residues length. This approach learns simultaneously the geometry of the states and their connections. We obtain, using a statistical criterion, an optimal systematic decomposition of the conformational variability of the protein peptidic chain in 27 states with strong connection logic. This result is stable over different protein sets. Our model fits well the previous knowledge related to protein architecture organisation and seems able to grab some subtle details of protein organisation, such as helix sub-level organisation schemes. Taking into account the dependence between the states results in a description of local protein structure of low complexity. On an average, the model makes use of only 8.3 states among 27 to describe each position of a protein structure. Although we use short fragments, the learning process on entire protein conformations captures the logic of the assembly on a larger scale. Using such a model, the structure of proteins can be reconstructed with an average accuracy close to 1.1A root-mean-square deviation and for a complexity of only 3. Finally, we also observe that sequence specificity increases with the number of states of the structural alphabet. Such models can constitute a very relevant approach to the analysis of protein architecture in particular for protein structure prediction.

Pure chromosome-specific PCR libraries from single sorted chromosomes

NARCIS (Netherlands)

VanDevanter, D. R.; Choongkittaworn, N. M.; Dyer, K. A.; Aten, J. A.; Otto, P.; Behler, C.; Bryant, E. M.; Rabinovitch, P. S.

1994-01-01

Chromosome-specific DNA libraries can be very useful in molecular and cytogenetic genome mapping studies. We have developed a rapid and simple method for the generation of chromosome-specific DNA sequences that relies on polymerase chain reaction (PCR) amplification of a single flow-sorted

Direct closed-form covariance matrix and finite alphabet constant-envelope waveforms for planar array beampatterns

KAUST Repository

Ahmed, Sajid

2016-11-24

Various examples of methods and systems are provided for direct closed-form finite alphabet constant-envelope waveforms for planar array beampatterns. In one example, a method includes defining a waveform covariance matrix based at least in part upon a two-dimensional fast Fourier transform (2D-FFT) analysis of a frequency domain matrix Hf associated with a planar array of antennas. Symbols can be encoded based upon the waveform covariance matrix and the encoded symbols can be transmitted via the planar array of antennas. In another embodiment, a system comprises an N x M planar array of antennas and transmission circuitry configured to transmit symbols via a two-dimensional waveform beampattern defined based at least in part upon a 2D-FFT analysis of a frequency domain matrix Hf associated with the planar array of antennas.

Flow cytometric sex sorting affects CD4 membrane distribution and binding of exogenous DNA on bovine sperm cells.

Science.gov (United States)

Domingues, William Borges; da Silveira, Tony Leandro Rezende; Komninou, Eliza Rossi; Monte, Leonardo Garcia; Remião, Mariana Härter; Dellagostin, Odir Antônio; Corcini, Carine Dahl; Varela Junior, Antônio Sergio; Seixas, Fabiana Kömmling; Collares, Tiago; Campos, Vinicius Farias

2017-08-01

Bovine sex-sorted sperm have been commercialized and successfully used for the production of transgenic embryos of the desired sex through the sperm-mediated gene transfer (SMGT) technique. However, sex-sorted sperm show a reduced ability to internalize exogenous DNA. The interaction between sperm cells and the exogenous DNA has been reported in other species to be a CD4-like molecule-dependent process. The flow cytometry-based sex-sorting process subjects the spermatozoa to different stresses causing changes in the cell membrane. The aim of this study was to elucidate the relationship between the redistribution of CD4-like molecules and binding of exogenous DNA to sex-sorted bovine sperm. In the first set of experiments, the membrane phospholipid disorder and the redistribution of the CD4 were evaluated. The second set of experiments was conducted to investigate the effect of CD4 redistribution on the mechanism of binding of exogenous DNA to sperm cells and the efficiency of lipofection in sex-sorted bovine sperm. Sex-sorting procedure increased the membrane phospholipid disorder and induced the redistribution of CD4-like molecules. Both X-sorted and Y-sorted sperm had decreased DNA bound to membrane in comparison with the unsorted sperm; however, the binding of the exogenous DNA was significantly increased with the addition of liposomes. Moreover, we demonstrated that the number of sperm-bound exogenous DNA was decreased when these cells were preincubated with anti-bovine CD4 monoclonal antibody, supporting our hypothesis that CD4-like molecules indeed play a crucial role in the process of exogenous DNA/bovine sperm cells interaction.

Design and control of multifunctional sorting and training platform based on PLC control

Science.gov (United States)

Wan, Hongqiang; Ge, Shuai; Han, Peiying; Li, Fancong; Zhang, Simiao

2018-05-01

Electromechanical integration, as a multi-disciplinary subject, has been paid much attention by universities and is widely used in the automation production of enterprises. Aiming at the problem of the lack of control among enterprises and the lack of training among colleges and universities, this paper presents a design of multifunctional sorting training platform based on PLC control. Firstly, the structure of the platform is determined and three-dimensional modeling is done. Then design the platform's aerodynamic control and electrical control. Finally, realize the platform sorting function through PLC programming and configuration software development. The training platform can be used to design the practical training experiment, which has a strong advance and pertinence in the electromechanical integration teaching. At the same time, the platform makes full use of modular thinking to make the sorting modules more flexible. Compared with the traditional training platform, its teaching effect is more significant.

Teleoperated robotic sorting system

Science.gov (United States)

Roos, Charles E.; Sommer, Edward J.; Parrish, Robert H.; Russell, James R.

2000-01-01

A method and apparatus are disclosed for classifying materials utilizing a computerized touch sensitive screen or other computerized pointing device for operator identification and electronic marking of spatial coordinates of materials to be extracted. An operator positioned at a computerized touch sensitive screen views electronic images of the mixture of materials to be sorted as they are conveyed past a sensor array which transmits sequences of images of the mixture either directly or through a computer to the touch sensitive display screen. The operator manually "touches" objects displayed on the screen to be extracted from the mixture thereby registering the spatial coordinates of the objects within the computer. The computer then tracks the registered objects as they are conveyed and directs automated devices including mechanical means such as air jets, robotic arms, or other mechanical diverters to extract the registered objects.

Are Korean Industry-Sorted Portfolios Mean Reverting?

Directory of Open Access Journals (Sweden)

Seongman Moon

2016-06-01

Full Text Available This paper tests the weak-form efficient market hypothesis for Korean industry-sorted portfolios. Based on a panel variance ratio approach, we find significant mean reversion of stock returns over long horizons in the pre Asian currency crisis period but little evidence in the post-crisis period. Our empirical findings are consistent with the fact that Korea accelerated its integration with international financial market by implementing extensive capital liberalization since the crisis.