Fan fault diagnosis based on symmetrized dot pattern analysis and image matching

Science.gov (United States)

Xu, Xiaogang; Liu, Haixiao; Zhu, Hao; Wang, Songling

2016-07-01

To detect the mechanical failure of fans, a new diagnostic method based on the symmetrized dot pattern (SDP) analysis and image matching is proposed. Vibration signals of 13 kinds of running states are acquired on a centrifugal fan test bed and reconstructed by the SDP technique. The SDP pattern templates of each running state are established. An image matching method is performed to diagnose the fault. In order to improve the diagnostic accuracy, the single template, multiple templates and clustering fault templates are used to perform the image matching.

Rating Algorithm for Pronunciation of English Based on Audio Feature Pattern Matching

Directory of Open Access Journals (Sweden)

Li Kun

2015-01-01

Full Text Available With the increasing internationalization of China, language communication has become an important channel for us to adapt to the political and economic environment. How to improve English learners’ language learning efficiency in limited conditions has turned into a problem demanding prompt solution at present. This paper applies two pronunciation patterns according to the actual needs of English pronunciation rating: to-be-evaluated pronunciation pattern and standard pronunciation pattern. It will translate the patterns into English pronunciation rating results through European distance. Besides, this paper will introduce the design philosophy of the whole algorithm in combination with CHMM matching pattern. Each link of the CHMM pattern will be given selective analysis while a contrast experiment between the CHMM matching pattern and the other two patterns will be conducted. From the experiment results, it can be concluded that CHMM pattern is the best option.

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

International Nuclear Information System (INIS)

Azad, Ariful; Buluc, Aydn; Pothen, Alex

2016-01-01

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.

Effects of variability in probable maximum precipitation patterns on flood losses

Science.gov (United States)

Zischg, Andreas Paul; Felder, Guido; Weingartner, Rolf; Quinn, Niall; Coxon, Gemma; Neal, Jeffrey; Freer, Jim; Bates, Paul

2018-05-01

The assessment of the impacts of extreme floods is important for dealing with residual risk, particularly for critical infrastructure management and for insurance purposes. Thus, modelling of the probable maximum flood (PMF) from probable maximum precipitation (PMP) by coupling hydrological and hydraulic models has gained interest in recent years. Herein, we examine whether variability in precipitation patterns exceeds or is below selected uncertainty factors in flood loss estimation and if the flood losses within a river basin are related to the probable maximum discharge at the basin outlet. We developed a model experiment with an ensemble of probable maximum precipitation scenarios created by Monte Carlo simulations. For each rainfall pattern, we computed the flood losses with a model chain and benchmarked the effects of variability in rainfall distribution with other model uncertainties. The results show that flood losses vary considerably within the river basin and depend on the timing and superimposition of the flood peaks from the basin's sub-catchments. In addition to the flood hazard component, the other components of flood risk, exposure, and vulnerability contribute remarkably to the overall variability. This leads to the conclusion that the estimation of the probable maximum expectable flood losses in a river basin should not be based exclusively on the PMF. Consequently, the basin-specific sensitivities to different precipitation patterns and the spatial organization of the settlements within the river basin need to be considered in the analyses of probable maximum flood losses.

PATTERN CLASSIFICATION APPROACHES TO MATCHING BUILDING POLYGONS AT MULTIPLE SCALES

Directory of Open Access Journals (Sweden)

X. Zhang

2012-07-01

Full Text Available Matching of building polygons with different levels of detail is crucial in the maintenance and quality assessment of multi-representation databases. Two general problems need to be addressed in the matching process: (1 Which criteria are suitable? (2 How to effectively combine different criteria to make decisions? This paper mainly focuses on the second issue and views data matching as a supervised pattern classification. Several classifiers (i.e. decision trees, Naive Bayes and support vector machines are evaluated for the matching task. Four criteria (i.e. position, size, shape and orientation are used to extract information for these classifiers. Evidence shows that these classifiers outperformed the weighted average approach.

Rotation and scale change invariant point pattern relaxation matching by the Hopfield neural network

Science.gov (United States)

Sang, Nong; Zhang, Tianxu

1997-12-01

Relaxation matching is one of the most relevant methods for image matching. The original relaxation matching technique using point patterns is sensitive to rotations and scale changes. We improve the original point pattern relaxation matching technique to be invariant to rotations and scale changes. A method that makes the Hopfield neural network perform this matching process is discussed. An advantage of this is that the relaxation matching process can be performed in real time with the neural network's massively parallel capability to process information. Experimental results with large simulated images demonstrate the effectiveness and feasibility of the method to perform point patten relaxation matching invariant to rotations and scale changes and the method to perform this matching by the Hopfield neural network. In addition, we show that the method presented can be tolerant to small random error.

Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.

Science.gov (United States)

Peng, Huan-Kai; Lee, Hao-Chih; Pan, Jia-Yu; Marculescu, Radu

2016-01-01

In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.

Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.

Directory of Open Access Journals (Sweden)

Huan-Kai Peng

Full Text Available In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.

Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization

Science.gov (United States)

Peng, Huan-Kai; Lee, Hao-Chih; Pan, Jia-Yu; Marculescu, Radu

2016-01-01

In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications. PMID:26771830

Post-decomposition optimizations using pattern matching and rule-based clustering for multi-patterning technology

Science.gov (United States)

Wang, Lynn T.-N.; Madhavan, Sriram

2018-03-01

A pattern matching and rule-based polygon clustering methodology with DFM scoring is proposed to detect decomposition-induced manufacturability detractors and fix the layout designs prior to manufacturing. A pattern matcher scans the layout for pre-characterized patterns from a library. If a pattern were detected, rule-based clustering identifies the neighboring polygons that interact with those captured by the pattern. Then, DFM scores are computed for the possible layout fixes: the fix with the best score is applied. The proposed methodology was applied to two 20nm products with a chip area of 11 mm2 on the metal 2 layer. All the hotspots were resolved. The number of DFM spacing violations decreased by 7-15%.

Maximum-entropy networks pattern detection, network reconstruction and graph combinatorics

CERN Document Server

Squartini, Tiziano

2017-01-01

This book is an introduction to maximum-entropy models of random graphs with given topological properties and their applications. Its original contribution is the reformulation of many seemingly different problems in the study of both real networks and graph theory within the unified framework of maximum entropy. Particular emphasis is put on the detection of structural patterns in real networks, on the reconstruction of the properties of networks from partial information, and on the enumeration and sampling of graphs with given properties.  After a first introductory chapter explaining the motivation, focus, aim and message of the book, chapter 2 introduces the formal construction of maximum-entropy ensembles of graphs with local topological constraints. Chapter 3 focuses on the problem of pattern detection in real networks and provides a powerful way to disentangle nontrivial higher-order structural features from those that can be traced back to simpler local constraints. Chapter 4 focuses on the problem o...

Structural pattern matching of nonribosomal peptides

Directory of Open Access Journals (Sweden)

Leclère Valérie

2009-03-01

Full Text Available Abstract Background Nonribosomal peptides (NRPs, bioactive secondary metabolites produced by many microorganisms, show a broad range of important biological activities (e.g. antibiotics, immunosuppressants, antitumor agents. NRPs are mainly composed of amino acids but their primary structure is not always linear and can contain cycles or branchings. Furthermore, there are several hundred different monomers that can be incorporated into NRPs. The NORINE database, the first resource entirely dedicated to NRPs, currently stores more than 700 NRPs annotated with their monomeric peptide structure encoded by undirected labeled graphs. This opens a way to a systematic analysis of structural patterns occurring in NRPs. Such studies can investigate the functional role of some monomeric chains, or analyse NRPs that have been computationally predicted from the synthetase protein sequence. A basic operation in such analyses is the search for a given structural pattern in the database. Results We developed an efficient method that allows for a quick search for a structural pattern in the NORINE database. The method identifies all peptides containing a pattern substructure of a given size. This amounts to solving a variant of the maximum common subgraph problem on pattern and peptide graphs, which is done by computing cliques in an appropriate compatibility graph. Conclusion The method has been incorporated into the NORINE database, available at http://bioinfo.lifl.fr/norine. Less than one second is needed to search for a pattern in the entire database.

Rewrite Systems, Pattern Matching, and Code Generation

Science.gov (United States)

1988-06-09

fmd a local set L’ which includes L and define the transformation on L’ instead of on L. 11 The straightforward way to define tree transformations...Proposition 2.19 Both B-ftt and T-ftt include: REL relabelings FTA (t ,t) such that t e RECOG HOM homomorphisms LHOM linear homomorphisms The capabilities...fsa for the set of the structures of the original pattern set. The LB-fsa IS used to fmd the structural subpatterns matching a: each node of the

A new taxonomy of sublinear keyword pattern matching algorithms

NARCIS (Netherlands)

Cleophas, L.G.W.A.; Watson, B.W.; Zwaan, G.

2004-01-01

Abstract This paper presents a new taxonomy of sublinear (multiple) keyword pattern matching algorithms. Based on an earlier taxonomy by Watson and Zwaan [WZ96, WZ95], this new taxonomy includes not only suffix-based algorithms related to the Boyer-Moore, Commentz-Walter and Fan-Su algorithms, but

PTree: pattern-based, stochastic search for maximum parsimony phylogenies

Directory of Open Access Journals (Sweden)

Ivan Gregor

2013-06-01

Full Text Available Phylogenetic reconstruction is vital to analyzing the evolutionary relationship of genes within and across populations of different species. Nowadays, with next generation sequencing technologies producing sets comprising thousands of sequences, robust identification of the tree topology, which is optimal according to standard criteria such as maximum parsimony, maximum likelihood or posterior probability, with phylogenetic inference methods is a computationally very demanding task. Here, we describe a stochastic search method for a maximum parsimony tree, implemented in a software package we named PTree. Our method is based on a new pattern-based technique that enables us to infer intermediate sequences efficiently where the incorporation of these sequences in the current tree topology yields a phylogenetic tree with a lower cost. Evaluation across multiple datasets showed that our method is comparable to the algorithms implemented in PAUP* or TNT, which are widely used by the bioinformatics community, in terms of topological accuracy and runtime. We show that our method can process large-scale datasets of 1,000–8,000 sequences. We believe that our novel pattern-based method enriches the current set of tools and methods for phylogenetic tree inference. The software is available under: http://algbio.cs.uni-duesseldorf.de/webapps/wa-download/.

PTree: pattern-based, stochastic search for maximum parsimony phylogenies.

Science.gov (United States)

Gregor, Ivan; Steinbrück, Lars; McHardy, Alice C

2013-01-01

Phylogenetic reconstruction is vital to analyzing the evolutionary relationship of genes within and across populations of different species. Nowadays, with next generation sequencing technologies producing sets comprising thousands of sequences, robust identification of the tree topology, which is optimal according to standard criteria such as maximum parsimony, maximum likelihood or posterior probability, with phylogenetic inference methods is a computationally very demanding task. Here, we describe a stochastic search method for a maximum parsimony tree, implemented in a software package we named PTree. Our method is based on a new pattern-based technique that enables us to infer intermediate sequences efficiently where the incorporation of these sequences in the current tree topology yields a phylogenetic tree with a lower cost. Evaluation across multiple datasets showed that our method is comparable to the algorithms implemented in PAUP* or TNT, which are widely used by the bioinformatics community, in terms of topological accuracy and runtime. We show that our method can process large-scale datasets of 1,000-8,000 sequences. We believe that our novel pattern-based method enriches the current set of tools and methods for phylogenetic tree inference. The software is available under: http://algbio.cs.uni-duesseldorf.de/webapps/wa-download/.

Attention Modulates Visual-Tactile Interaction in Spatial Pattern Matching

Science.gov (United States)

Göschl, Florian; Engel, Andreas K.; Friese, Uwe

2014-01-01

Factors influencing crossmodal interactions are manifold and operate in a stimulus-driven, bottom-up fashion, as well as via top-down control. Here, we evaluate the interplay of stimulus congruence and attention in a visual-tactile task. To this end, we used a matching paradigm requiring the identification of spatial patterns that were concurrently presented visually on a computer screen and haptically to the fingertips by means of a Braille stimulator. Stimulation in our paradigm was always bimodal with only the allocation of attention being manipulated between conditions. In separate blocks of the experiment, participants were instructed to (a) focus on a single modality to detect a specific target pattern, (b) pay attention to both modalities to detect a specific target pattern, or (c) to explicitly evaluate if the patterns in both modalities were congruent or not. For visual as well as tactile targets, congruent stimulus pairs led to quicker and more accurate detection compared to incongruent stimulation. This congruence facilitation effect was more prominent under divided attention. Incongruent stimulation led to behavioral decrements under divided attention as compared to selectively attending a single sensory channel. Additionally, when participants were asked to evaluate congruence explicitly, congruent stimulation was associated with better performance than incongruent stimulation. Our results extend previous findings from audiovisual studies, showing that stimulus congruence also resulted in behavioral improvements in visuotactile pattern matching. The interplay of stimulus processing and attentional control seems to be organized in a highly flexible fashion, with the integration of signals depending on both bottom-up and top-down factors, rather than occurring in an ‘all-or-nothing’ manner. PMID:25203102

Attention modulates visual-tactile interaction in spatial pattern matching.

Directory of Open Access Journals (Sweden)

Florian Göschl

Full Text Available Factors influencing crossmodal interactions are manifold and operate in a stimulus-driven, bottom-up fashion, as well as via top-down control. Here, we evaluate the interplay of stimulus congruence and attention in a visual-tactile task. To this end, we used a matching paradigm requiring the identification of spatial patterns that were concurrently presented visually on a computer screen and haptically to the fingertips by means of a Braille stimulator. Stimulation in our paradigm was always bimodal with only the allocation of attention being manipulated between conditions. In separate blocks of the experiment, participants were instructed to (a focus on a single modality to detect a specific target pattern, (b pay attention to both modalities to detect a specific target pattern, or (c to explicitly evaluate if the patterns in both modalities were congruent or not. For visual as well as tactile targets, congruent stimulus pairs led to quicker and more accurate detection compared to incongruent stimulation. This congruence facilitation effect was more prominent under divided attention. Incongruent stimulation led to behavioral decrements under divided attention as compared to selectively attending a single sensory channel. Additionally, when participants were asked to evaluate congruence explicitly, congruent stimulation was associated with better performance than incongruent stimulation. Our results extend previous findings from audiovisual studies, showing that stimulus congruence also resulted in behavioral improvements in visuotactile pattern matching. The interplay of stimulus processing and attentional control seems to be organized in a highly flexible fashion, with the integration of signals depending on both bottom-up and top-down factors, rather than occurring in an 'all-or-nothing' manner.

Highly Parallelized Pattern Matching Execution for the ATLAS Experiment

CERN Document Server

Citraro, Saverio; The ATLAS collaboration

2015-01-01

The trigger system of the ATLAS experiment at LHC will extend its rejection capabilities during operations in 2015-2018 by introducing the Fast TracKer system (FTK). FTK is a hardware based system capable of finding charged particle tracks by analyzing hits in silicon detectors at the rate of 105 events per second. The core of track reconstruction is performed into two pipelined steps. At first step the candidate tracks are found by matching combination of low resolution hits to predefined patterns; then they are used in the second step to seed a more precise track fitting algorithm. The key FTK component is an Associative Memory (AM) system that is used to perform pattern matching with high degree of parallelism. The AM system implementation, the AM Serial Link Processor, is based on an extremely powerful network of 2 Gb/s serial links to sustain a huge traffic of data. We report on the design of the Serial Link Processor consisting of two types of boards, the Little Associative Memory Board (LAMB), a mezzan...

Highly Parallelized Pattern Matching Execution for the ATLAS Experiment

CERN Document Server

Citraro, Saverio; The ATLAS collaboration

2015-01-01

Abstract– The Associative Memory (AM) system of the Fast Tracker (FTK) processor has been designed to perform pattern matching using as input the data from the silicon tracker in the ATLAS experiment. The AM is the primary component of the FTK system and is designed using ASIC technology (the AM chip) to execute pattern matching with a high degree of parallelism. The FTK system finds track candidates at low resolution that are seeds for a full resolution track fitting. The AM system implementation is named “Serial Link Processor” and is based on an extremely powerful network of 2 Gb/s serial links to sustain a huge traffic of data. This paper reports on the design of the Serial Link Processor consisting of two types of boards, the Little Associative Memory Board (LAMB), a mezzanine where the AM chips are mounted, and the Associative Memory Board (AMB), a 9U VME motherboard which hosts four LAMB daughterboards. We also report on the performance of the prototypes (both hardware and firmware) produced and ...

Two related algorithms for root-to-frontier tree pattern matching

NARCIS (Netherlands)

Cleophas, L.G.W.A.; Hemerik, C.; Zwaan, G.

2006-01-01

Tree pattern matching (TPM) algorithms on ordered, ranked trees play an important role in applications such as compilers and term rewriting systems. Many TPM algorithms appearing in the literature are based on tree automata. For efficiency, these automata should be deterministic, yet deterministic

A Data-Driven Modeling Strategy for Smart Grid Power Quality Coupling Assessment Based on Time Series Pattern Matching

Directory of Open Access Journals (Sweden)

Hao Yu

2018-01-01

Full Text Available This study introduces a data-driven modeling strategy for smart grid power quality (PQ coupling assessment based on time series pattern matching to quantify the influence of single and integrated disturbance among nodes in different pollution patterns. Periodic and random PQ patterns are constructed by using multidimensional frequency-domain decomposition for all disturbances. A multidimensional piecewise linear representation based on local extreme points is proposed to extract the patterns features of single and integrated disturbance in consideration of disturbance variation trend and severity. A feature distance of pattern (FDP is developed to implement pattern matching on univariate PQ time series (UPQTS and multivariate PQ time series (MPQTS to quantify the influence of single and integrated disturbance among nodes in the pollution patterns. Case studies on a 14-bus distribution system are performed and analyzed; the accuracy and applicability of the FDP in the smart grid PQ coupling assessment are verified by comparing with other time series pattern matching methods.

Pattern formation, logistics, and maximum path probability

Science.gov (United States)

Kirkaldy, J. S.

1985-05-01

The concept of pattern formation, which to current researchers is a synonym for self-organization, carries the connotation of deductive logic together with the process of spontaneous inference. Defining a pattern as an equivalence relation on a set of thermodynamic objects, we establish that a large class of irreversible pattern-forming systems, evolving along idealized quasisteady paths, approaches the stable steady state as a mapping upon the formal deductive imperatives of a propositional function calculus. In the preamble the classical reversible thermodynamics of composite systems is analyzed as an externally manipulated system of space partitioning and classification based on ideal enclosures and diaphragms. The diaphragms have discrete classification capabilities which are designated in relation to conserved quantities by descriptors such as impervious, diathermal, and adiabatic. Differentiability in the continuum thermodynamic calculus is invoked as equivalent to analyticity and consistency in the underlying class or sentential calculus. The seat of inference, however, rests with the thermodynamicist. In the transition to an irreversible pattern-forming system the defined nature of the composite reservoirs remains, but a given diaphragm is replaced by a pattern-forming system which by its nature is a spontaneously evolving volume partitioner and classifier of invariants. The seat of volition or inference for the classification system is thus transferred from the experimenter or theoretician to the diaphragm, and with it the full deductive facility. The equivalence relations or partitions associated with the emerging patterns may thus be associated with theorems of the natural pattern-forming calculus. The entropy function, together with its derivatives, is the vehicle which relates the logistics of reservoirs and diaphragms to the analog logistics of the continuum. Maximum path probability or second-order differentiability of the entropy in isolation are

Fuzzy automata and pattern matching

Science.gov (United States)

Setzer, C. B.; Warsi, N. A.

1986-01-01

A wide-ranging search for articles and books concerned with fuzzy automata and syntactic pattern recognition is presented. A number of survey articles on image processing and feature detection were included. Hough's algorithm is presented to illustrate the way in which knowledge about an image can be used to interpret the details of the image. It was found that in hand generated pictures, the algorithm worked well on following the straight lines, but had great difficulty turning corners. An algorithm was developed which produces a minimal finite automaton recognizing a given finite set of strings. One difficulty of the construction is that, in some cases, this minimal automaton is not unique for a given set of strings and a given maximum length. This algorithm compares favorably with other inference algorithms. More importantly, the algorithm produces an automaton with a rigorously described relationship to the original set of strings that does not depend on the algorithm itself.

Nutritional Status and Daytime Pattern of Protein Intake on Match, Post-Match, Rest and Training Days in Senior Professional and Youth Elite Soccer Players.

Science.gov (United States)

Bettonviel A, E O; Brinkmans N, Y J; Russcher, Kris; Wardenaar, Floris C; Witard, Oliver C

2016-06-01

The nutritional status of elite soccer players across match, postmatch, training and rest days has not been defined. Recent evidence suggests the pattern of dietary protein intake impacts the daytime turnover of muscle proteins and, as such, influences muscle recovery. We assessed the nutritional status and daytime pattern of protein intake in senior professional and elite youth soccer players and compared findings against published recommendations. Fourteen senior professional (SP) and 15 youth elite (YP) soccer players from the Dutch premier division completed nutritional assessments using a 24-hr web-based recall method. Recall days consisted of a match, postmatch, rest, and training day. Daily energy intake over the 4-day period was similar between SP (2988 ± 583 kcal/day) and YP (2938 ± 465 kcal/day; p = .800). Carbohydrate intake over the combined 4-day period was lower in SP (4.7 ± 0.7 g·kg-1 BM·day-1) vs. YP (6.0 ± 1.5 g·kg-1 BM·day-1, p = .006) and SP failed to meet recommended carbohydrate intakes on match and training days. Conversely, recommended protein intakes were met for SP (1.9 ± 0.3 g·kg-1 BM·day-1) and YP (1.7 ± 0.4 g·kg-1 BM·day-1), with no differences between groups (p = .286). Accordingly, both groups met or exceeded recommended daily protein intakes on individual match, postmatch, rest and training days. A similar "balanced" daytime pattern of protein intake was observed in SP and YP. To conclude, SP increased protein intake on match and training days to a greater extent than YP, however at the expense of carbohydrate intake. The daytime distribution of protein intake for YP and SP aligned with current recommendations of a balanced protein meal pattern.

Dietary pattern analysis: a comparison between matched vegetarian and omnivorous subjects.

Science.gov (United States)

Clarys, Peter; Deriemaeker, Peter; Huybrechts, Inge; Hebbelinck, Marcel; Mullie, Patrick

2013-06-13

Dietary pattern analysis, based on the concept that foods eaten together are as important as a reductive methodology characterized by a single food or nutrient analysis, has emerged as an alternative approach to study the relation between nutrition and disease. The aim of the present study was to compare nutritional intake and the results of dietary pattern analysis in properly matched vegetarian and omnivorous subjects. Vegetarians (n = 69) were recruited via purposeful sampling and matched non-vegetarians (n = 69) with same age, gender, health and lifestyle characteristics were searched for via convenience sampling. Two dietary pattern analysis methods, the Healthy Eating Index-2010 (HEI-2010) and the Mediterranean Diet Score (MDS) were calculated and analysed in function of the nutrient intake. Mean total energy intake was comparable between vegetarians and omnivorous subjects (p > 0.05). Macronutrient analysis revealed significant differences between the mean values for vegetarians and omnivorous subjects (absolute and relative protein and total fat intake were significantly lower in vegetarians, while carbohydrate and fibre intakes were significantly higher in vegetarians than in omnivorous subjects). The HEI and MDS were significantly higher for the vegetarians (HEI = 53.8.1 ± 11.2; MDS = 4.3 ± 1.3) compared to the omnivorous subjects (HEI = 46.4 ± 15.3; MDS = 3.8 ± 1.4). Our results indicate a more nutrient dense pattern, closer to the current dietary recommendations for the vegetarians compared to the omnivorous subjects. Both indexing systems were able to discriminate between the vegetarians and the non-vegetarians with higher scores for the vegetarian subjects.

What makes a pattern? Matching decoding methods to data in multivariate pattern analysis

Directory of Open Access Journals (Sweden)

Philip A Kragel

2012-11-01

Full Text Available Research in neuroscience faces the challenge of integrating information across different spatial scales of brain function. A promising technique for harnessing information at a range of spatial scales is multivariate pattern analysis (MVPA of functional magnetic resonance imaging (fMRI data. While the prevalence of MVPA has increased dramatically in recent years, its typical implementations for classification of mental states utilize only a subset of the information encoded in local fMRI signals. We review published studies employing multivariate pattern classification since the technique’s introduction, which reveal an extensive focus on the improved detection power that linear classifiers provide over traditional analysis techniques. We demonstrate using simulations and a searchlight approach, however, that nonlinear classifiers are capable of extracting distinct information about interactions within a local region. We conclude that for spatially localized analyses, such as searchlight and region of interest, multiple classification approaches should be compared in order to match fMRI analyses to the properties of local circuits.

Robust real-time pattern matching using bayesian sequential hypothesis testing.

Science.gov (United States)

Pele, Ofir; Werman, Michael

2008-08-01

This paper describes a method for robust real time pattern matching. We first introduce a family of image distance measures, the "Image Hamming Distance Family". Members of this family are robust to occlusion, small geometrical transforms, light changes and non-rigid deformations. We then present a novel Bayesian framework for sequential hypothesis testing on finite populations. Based on this framework, we design an optimal rejection/acceptance sampling algorithm. This algorithm quickly determines whether two images are similar with respect to a member of the Image Hamming Distance Family. We also present a fast framework that designs a near-optimal sampling algorithm. Extensive experimental results show that the sequential sampling algorithm performance is excellent. Implemented on a Pentium 4 3 GHz processor, detection of a pattern with 2197 pixels, in 640 x 480 pixel frames, where in each frame the pattern rotated and was highly occluded, proceeds at only 0.022 seconds per frame.

Receptive fields of locust brain neurons are matched to polarization patterns of the sky.

Science.gov (United States)

Bech, Miklós; Homberg, Uwe; Pfeiffer, Keram

2014-09-22

Many animals, including insects, are able to use celestial cues as a reference for spatial orientation and long-distance navigation [1]. In addition to direct sunlight, the chromatic gradient of the sky and its polarization pattern are suited to serve as orientation cues [2-5]. Atmospheric scattering of sunlight causes a regular pattern of E vectors in the sky, which are arranged along concentric circles around the sun [5, 6]. Although certain insects rely predominantly on sky polarization for spatial orientation [7], it has been argued that detection of celestial E vector orientation may not suffice to differentiate between solar and antisolar directions [8, 9]. We show here that polarization-sensitive (POL) neurons in the brain of the desert locust Schistocerca gregaria can overcome this ambiguity. Extracellular recordings from POL units in the central complex and lateral accessory lobes revealed E vector tunings arranged in concentric circles within large receptive fields, matching the sky polarization pattern at certain solar positions. Modeling of neuronal responses under an idealized sky polarization pattern (Rayleigh sky) suggests that these "matched filter" properties allow locusts to unambiguously determine the solar azimuth by relying solely on the sky polarization pattern for compass navigation. Copyright © 2014 Elsevier Ltd. All rights reserved.

A Boyer-Moore (or Watson-Watson) type algorithm for regular tree pattern matching

NARCIS (Netherlands)

Watson, B.W.; Aarts, E.H.L.; Eikelder, ten H.M.M.; Hemerik, C.; Rem, M.

1995-01-01

In this chapter, I outline a new algorithm for regular tree pattern matching. The existence of this algorithm was first mentioned in the statements accompanying my dissertation, [2]. In order to avoid repeating the material in my dissertation, it is assumed that the reader is familiar with Chapters

Stochastic modelling of the monthly average maximum and minimum temperature patterns in India 1981-2015

Science.gov (United States)

Narasimha Murthy, K. V.; Saravana, R.; Vijaya Kumar, K.

2018-04-01

The paper investigates the stochastic modelling and forecasting of monthly average maximum and minimum temperature patterns through suitable seasonal auto regressive integrated moving average (SARIMA) model for the period 1981-2015 in India. The variations and distributions of monthly maximum and minimum temperatures are analyzed through Box plots and cumulative distribution functions. The time series plot indicates that the maximum temperature series contain sharp peaks in almost all the years, while it is not true for the minimum temperature series, so both the series are modelled separately. The possible SARIMA model has been chosen based on observing autocorrelation function (ACF), partial autocorrelation function (PACF), and inverse autocorrelation function (IACF) of the logarithmic transformed temperature series. The SARIMA (1, 0, 0) × (0, 1, 1)12 model is selected for monthly average maximum and minimum temperature series based on minimum Bayesian information criteria. The model parameters are obtained using maximum-likelihood method with the help of standard error of residuals. The adequacy of the selected model is determined using correlation diagnostic checking through ACF, PACF, IACF, and p values of Ljung-Box test statistic of residuals and using normal diagnostic checking through the kernel and normal density curves of histogram and Q-Q plot. Finally, the forecasting of monthly maximum and minimum temperature patterns of India for the next 3 years has been noticed with the help of selected model.

Maximum power output and load matching of a phosphoric acid fuel cell-thermoelectric generator hybrid system

Science.gov (United States)

Chen, Xiaohang; Wang, Yuan; Cai, Ling; Zhou, Yinghui

2015-10-01

Based on the current models of phosphoric acid fuel cells (PAFCs) and thermoelectric generators (TGs), a new hybrid system is proposed, in which the effects of multi-irreversibilities resulting from the activation, concentration, and ohmic overpotentials in the PAFC, Joule heat and heat leak in the TG, finite-rate heat transfer between the TG and the heat reservoirs, and heat leak from the PAFC to the environment are taken into account. Expressions for the power output and efficiency of the PAFC, TG, and hybrid system are analytically derived and directly used to discuss the performance characteristics of the hybrid system. The optimal relationship between the electric currents in the PAFC and TG is obtained. The maximum power output is numerically calculated. It is found that the maximum power output density of the hybrid system will increase about 150 Wm-2, compared with that of a single PAFC. The problem how to optimally match the load resistances of two subsystems is discussed. Some significant results for practical hybrid systems are obtained.

Advanced optical correlation and digital methods for pattern matching—50th anniversary of Vander Lugt matched filter

Science.gov (United States)

Millán, María S.

2012-10-01

On the verge of the 50th anniversary of Vander Lugt’s formulation for pattern matching based on matched filtering and optical correlation, we acknowledge the very intense research activity developed in the field of correlation-based pattern recognition during this period of time. The paper reviews some domains that appeared as emerging fields in the last years of the 20th century and have been developed later on in the 21st century. Such is the case of three-dimensional (3D) object recognition, biometric pattern matching, optical security and hybrid optical-digital processors. 3D object recognition is a challenging case of multidimensional image recognition because of its implications in the recognition of real-world objects independent of their perspective. Biometric recognition is essentially pattern recognition for which the personal identification is based on the authentication of a specific physiological characteristic possessed by the subject (e.g. fingerprint, face, iris, retina, and multifactor combinations). Biometric recognition often appears combined with encryption-decryption processes to secure information. The optical implementations of correlation-based pattern recognition processes still rely on the 4f-correlator, the joint transform correlator, or some of their variants. But the many applications developed in the field have been pushing the systems for a continuous improvement of their architectures and algorithms, thus leading towards merged optical-digital solutions.

Advanced optical correlation and digital methods for pattern matching—50th anniversary of Vander Lugt matched filter

International Nuclear Information System (INIS)

Millán, María S

2012-01-01

On the verge of the 50th anniversary of Vander Lugt’s formulation for pattern matching based on matched filtering and optical correlation, we acknowledge the very intense research activity developed in the field of correlation-based pattern recognition during this period of time. The paper reviews some domains that appeared as emerging fields in the last years of the 20th century and have been developed later on in the 21st century. Such is the case of three-dimensional (3D) object recognition, biometric pattern matching, optical security and hybrid optical–digital processors. 3D object recognition is a challenging case of multidimensional image recognition because of its implications in the recognition of real-world objects independent of their perspective. Biometric recognition is essentially pattern recognition for which the personal identification is based on the authentication of a specific physiological characteristic possessed by the subject (e.g. fingerprint, face, iris, retina, and multifactor combinations). Biometric recognition often appears combined with encryption–decryption processes to secure information. The optical implementations of correlation-based pattern recognition processes still rely on the 4f-correlator, the joint transform correlator, or some of their variants. But the many applications developed in the field have been pushing the systems for a continuous improvement of their architectures and algorithms, thus leading towards merged optical–digital solutions. (review article)

Infiltration patterns in monoclonal plasma cell disorders: correlation of magnetic resonance imaging with matched bone marrow histology

Energy Technology Data Exchange (ETDEWEB)

Andrulis, Mindaugas [Institute of Pathology, University of Heidelberg, Heidelberg (Germany); Bäuerle, Tobias [Department of Diagnostic and Interventional Radiology, University of Hamburg, Hamburg (Germany); Goldschmidt, Hartmut [Department of Hematology and Oncology, University of Heidelberg, Heidelberg (Germany); Delorme, Stefan [Department of Radiology, German Cancer Research Center (DKFZ), Heidelberg (Germany); Landgren, Ola [Multiple Myeloma Section, Metabolism Branch, National Cancer Institute, Bethesda (United States); Schirmacher, Peter [Institute of Pathology, University of Heidelberg, Heidelberg (Germany); Hillengass, Jens, E-mail: jens.hillengass@med.uni-heidelberg.de [Department of Hematology and Oncology, University of Heidelberg, Heidelberg (Germany); Department of Radiology, German Cancer Research Center (DKFZ), Heidelberg (Germany)

2014-06-15

Objectives: To investigate how plasma cell infiltration patterns detected by MRI match the plasma cell distribution in bone marrow biopsy. Methods: We assessed 50 patients with monoclonal plasma cell disorders of all clinical stages. MRI infiltration pattern was compared with matched BM histology from the same anatomic region. Results: MRI revealed a minimal (n = 11, 22%), focal (n = 5, 10%), diffuse (n = 14, 28%) and mixed (n = 20, 40%) infiltration pattern. Diffuse MRI pattern was predominant in smoldering myeloma patients whereas the MRI patterns with “focal component” (i.e. focal and mixed) were most common in symptomatic myeloma (p < 0.01). In histology an interstitial (n = 13, 26%), nodular (n = 23, 46%) and packed marrow (n = 14, 28%) was found respectively. All three histological types of infiltration were observed in patients with diffuse and mixed MRI patterns. Minimal MRI pattern was found in all MGUS patients and was associated with an interstitial BM infiltration. In two patients with minimal MRI pattern an extensive micro-nodular BM infiltration was found in histology. Conclusions: Infiltration patterns in MRI represent different histological growth patterns of plasma cells, but the MRI resolution is not sufficient to visualize micro-nodular aggregates of plasma cells.

Infiltration patterns in monoclonal plasma cell disorders: correlation of magnetic resonance imaging with matched bone marrow histology

International Nuclear Information System (INIS)

Andrulis, Mindaugas; Bäuerle, Tobias; Goldschmidt, Hartmut; Delorme, Stefan; Landgren, Ola; Schirmacher, Peter; Hillengass, Jens

2014-01-01

Objectives: To investigate how plasma cell infiltration patterns detected by MRI match the plasma cell distribution in bone marrow biopsy. Methods: We assessed 50 patients with monoclonal plasma cell disorders of all clinical stages. MRI infiltration pattern was compared with matched BM histology from the same anatomic region. Results: MRI revealed a minimal (n = 11, 22%), focal (n = 5, 10%), diffuse (n = 14, 28%) and mixed (n = 20, 40%) infiltration pattern. Diffuse MRI pattern was predominant in smoldering myeloma patients whereas the MRI patterns with “focal component” (i.e. focal and mixed) were most common in symptomatic myeloma (p < 0.01). In histology an interstitial (n = 13, 26%), nodular (n = 23, 46%) and packed marrow (n = 14, 28%) was found respectively. All three histological types of infiltration were observed in patients with diffuse and mixed MRI patterns. Minimal MRI pattern was found in all MGUS patients and was associated with an interstitial BM infiltration. In two patients with minimal MRI pattern an extensive micro-nodular BM infiltration was found in histology. Conclusions: Infiltration patterns in MRI represent different histological growth patterns of plasma cells, but the MRI resolution is not sufficient to visualize micro-nodular aggregates of plasma cells

How Game Location Affects Soccer Performance: T-Pattern Analysis of Attack Actions in Home and Away Matches

Directory of Open Access Journals (Sweden)

Barbara Diana

2017-08-01

Full Text Available The influence of game location on performance has been widely examined in sport contexts. Concerning soccer, game-location affects positively the secondary and tertiary level of performance; however, there are fewer evidences about its effect on game structure (primary level of performance. This study aimed to detect the effect of game location on a primary level of performance in soccer. In particular, the objective was to reveal the hidden structures underlying the attack actions, in both home and away matches played by a top club (Serie A 2012/2013—First Leg. The methodological approach was based on systematic observation, supported by digital recordings and T-pattern analysis. Data were analyzed with THEME 6.0 software. A quantitative analysis, with nonparametric Mann–Whitney test and descriptive statistics, was carried out to test the hypotheses. A qualitative analysis on complex patterns was performed to get in-depth information on the game structure. This study showed that game tactics were significantly different, with home matches characterized by a more structured and varied game than away matches. In particular, a higher number of different patterns, with a higher level of complexity and including more unique behaviors was detected in home matches than in the away ones. No significant differences were found in the number of events coded per game between the two conditions. THEME software, and the corresponding T-pattern detection algorithm, enhance research opportunities by going further than frequency-based analyses, making this method an effective tool in supporting sport performance analysis and training.

How Game Location Affects Soccer Performance: T-Pattern Analysis of Attack Actions in Home and Away Matches.

Science.gov (United States)

Diana, Barbara; Zurloni, Valentino; Elia, Massimiliano; Cavalera, Cesare M; Jonsson, Gudberg K; Anguera, M Teresa

2017-01-01

The influence of game location on performance has been widely examined in sport contexts. Concerning soccer, game-location affects positively the secondary and tertiary level of performance; however, there are fewer evidences about its effect on game structure (primary level of performance). This study aimed to detect the effect of game location on a primary level of performance in soccer. In particular, the objective was to reveal the hidden structures underlying the attack actions, in both home and away matches played by a top club (Serie A 2012/2013-First Leg). The methodological approach was based on systematic observation, supported by digital recordings and T-pattern analysis. Data were analyzed with THEME 6.0 software. A quantitative analysis, with nonparametric Mann-Whitney test and descriptive statistics, was carried out to test the hypotheses. A qualitative analysis on complex patterns was performed to get in-depth information on the game structure. This study showed that game tactics were significantly different, with home matches characterized by a more structured and varied game than away matches. In particular, a higher number of different patterns, with a higher level of complexity and including more unique behaviors was detected in home matches than in the away ones. No significant differences were found in the number of events coded per game between the two conditions. THEME software, and the corresponding T-pattern detection algorithm, enhance research opportunities by going further than frequency-based analyses, making this method an effective tool in supporting sport performance analysis and training.

Cryptically patterned moths perceive bark structure when choosing body orientations that match wing color pattern to the bark pattern.

Science.gov (United States)

Kang, Chang-Ku; Moon, Jong-Yeol; Lee, Sang-Im; Jablonski, Piotr G

2013-01-01

Many moths have wing patterns that resemble bark of trees on which they rest. The wing patterns help moths to become camouflaged and to avoid predation because the moths are able to assume specific body orientations that produce a very good match between the pattern on the bark and the pattern on the wings. Furthermore, after landing on a bark moths are able to perceive stimuli that correlate with their crypticity and are able to re-position their bodies to new more cryptic locations and body orientations. However, the proximate mechanisms, i.e. how a moth finds an appropriate resting position and orientation, are poorly studied. Here, we used a geometrid moth Jankowskia fuscaria to examine i) whether a choice of resting orientation by moths depends on the properties of natural background, and ii) what sensory cues moths use. We studied moths' behavior on natural (a tree log) and artificial backgrounds, each of which was designed to mimic one of the hypothetical cues that moths may perceive on a tree trunk (visual pattern, directional furrow structure, and curvature). We found that moths mainly used structural cues from the background when choosing their resting position and orientation. Our findings highlight the possibility that moths use information from one type of sensory modality (structure of furrows is probably detected through tactile channel) to achieve crypticity in another sensory modality (visual). This study extends our knowledge of how behavior, sensory systems and morphology of animals interact to produce crypsis.

Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.

Science.gov (United States)

Inoue, Kentaro; Shimozono, Shinichi; Yoshida, Hideaki; Kurata, Hiroyuki

2012-01-01

For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor) algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html.

Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.

Directory of Open Access Journals (Sweden)

Kentaro Inoue

Full Text Available BACKGROUND: For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. RESULTS: We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. CONCLUSIONS: Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html.

Grip-Pattern Verification for Smart Gun Based on Maximum-Pairwise Comparison and Mean-Template Comparison

NARCIS (Netherlands)

Shang, X.; Veldhuis, Raymond N.J.

2008-01-01

In our biometric verification system of a smart gun, the rightful user of a gun is authenticated by grip-pattern recognition. In this work verification will be done using two types of comparison methods, respectively. One is mean-template comparison, where the matching score between a test image and

Optimizing Fukushima Emissions Through Pattern Matching and Genetic Algorithms

Science.gov (United States)

Lucas, D. D.; Simpson, M. D.; Philip, C. S.; Baskett, R.

2017-12-01

Hazardous conditions during the Fukushima Daiichi nuclear power plant (NPP) accident hindered direct observations of the emissions of radioactive materials into the atmosphere. A wide range of emissions are estimated from bottom-up studies using reactor inventories and top-down approaches based on inverse modeling. We present a new inverse modeling estimate of cesium-137 emitted from the Fukushima NPP. Our estimate considers weather uncertainty through a large ensemble of Weather Research and Forecasting model simulations and uses the FLEXPART atmospheric dispersion model to transport and deposit cesium. The simulations are constrained by observations of the spatial distribution of cumulative cesium deposited on the surface of Japan through April 2, 2012. Multiple spatial metrics are used to quantify differences between observed and simulated deposition patterns. In order to match the observed pattern, we use a multi-objective genetic algorithm to optimize the time-varying emissions. We find that large differences with published bottom-up estimates are required to explain the observations. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.

A novel iris patterns matching algorithm of weighted polar frequency correlation

Science.gov (United States)

Zhao, Weijie; Jiang, Linhua

2014-11-01

Iris recognition is recognized as one of the most accurate techniques for biometric authentication. In this paper, we present a novel correlation method - Weighted Polar Frequency Correlation(WPFC) - to match and evaluate two iris images, actually it can also be used for evaluating the similarity of any two images. The WPFC method is a novel matching and evaluating method for iris image matching, which is complete different from the conventional methods. For instance, the classical John Daugman's method of iris recognition uses 2D Gabor wavelets to extract features of iris image into a compact bit stream, and then matching two bit streams with hamming distance. Our new method is based on the correlation in the polar coordinate system in frequency domain with regulated weights. The new method is motivated by the observation that the pattern of iris that contains far more information for recognition is fine structure at high frequency other than the gross shapes of iris images. Therefore, we transform iris images into frequency domain and set different weights to frequencies. Then calculate the correlation of two iris images in frequency domain. We evaluate the iris images by summing the discrete correlation values with regulated weights, comparing the value with preset threshold to tell whether these two iris images are captured from the same person or not. Experiments are carried out on both CASIA database and self-obtained images. The results show that our method is functional and reliable. Our method provides a new prospect for iris recognition system.

Dynamic Matchings in Convex Bipartite Graphs

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt

2007-01-01

We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...

Cryptically patterned moths perceive bark structure when choosing body orientations that match wing color pattern to the bark pattern.

Directory of Open Access Journals (Sweden)

Chang-Ku Kang

Full Text Available Many moths have wing patterns that resemble bark of trees on which they rest. The wing patterns help moths to become camouflaged and to avoid predation because the moths are able to assume specific body orientations that produce a very good match between the pattern on the bark and the pattern on the wings. Furthermore, after landing on a bark moths are able to perceive stimuli that correlate with their crypticity and are able to re-position their bodies to new more cryptic locations and body orientations. However, the proximate mechanisms, i.e. how a moth finds an appropriate resting position and orientation, are poorly studied. Here, we used a geometrid moth Jankowskia fuscaria to examine i whether a choice of resting orientation by moths depends on the properties of natural background, and ii what sensory cues moths use. We studied moths' behavior on natural (a tree log and artificial backgrounds, each of which was designed to mimic one of the hypothetical cues that moths may perceive on a tree trunk (visual pattern, directional furrow structure, and curvature. We found that moths mainly used structural cues from the background when choosing their resting position and orientation. Our findings highlight the possibility that moths use information from one type of sensory modality (structure of furrows is probably detected through tactile channel to achieve crypticity in another sensory modality (visual. This study extends our knowledge of how behavior, sensory systems and morphology of animals interact to produce crypsis.

Two tree-formation methods for fast pattern search using nearest-neighbour and nearest-centroid matching

NARCIS (Netherlands)

Schomaker, Lambertus; Mangalagiu, D.; Vuurpijl, Louis; Weinfeld, M.; Schomaker, Lambert; Vuurpijl, Louis

2000-01-01

This paper describes tree­based classification of character images, comparing two methods of tree formation and two methods of matching: nearest neighbor and nearest centroid. The first method, Preprocess Using Relative Distances (PURD) is a tree­based reorganization of a flat list of patterns,

A Maximum Resonant Set of Polyomino Graphs

Directory of Open Access Journals (Sweden)

Zhang Heping

2016-05-01

Full Text Available A polyomino graph P is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square. A dimer covering of P corresponds to a perfect matching. Different dimer coverings can interact via an alternating cycle (or square with respect to them. A set of disjoint squares of P is a resonant set if P has a perfect matching M so that each one of those squares is M-alternating. In this paper, we show that if K is a maximum resonant set of P, then P − K has a unique perfect matching. We further prove that the maximum forcing number of a polyomino graph is equal to the cardinality of a maximum resonant set. This confirms a conjecture of Xu et al. [26]. We also show that if K is a maximal alternating set of P, then P − K has a unique perfect matching.

PATTERNS OF THE MAXIMUM RAINFALL AMOUNTS REGISTERED IN 24 HOURS WITHIN THE OLTENIA PLAIN

Directory of Open Access Journals (Sweden)

ALINA VLĂDUŢ

2012-03-01

Full Text Available Patterns of the maximum rainfall amounts registered in 24 hours within the Oltenia Plain. The present study aims at rendering the main features of the maximum rainfall amounts registered in 24 h within the Oltenia Plain. We used 30-year time series (1980-2009 for seven meteorological stations. Generally, the maximum amounts in 24 h display the same pattern as the monthly mean amounts, namely higher values in the interval May-October. In terms of mean values, the highest amounts are registered in the western and northern extremity of the plain. The maximum values generally exceed 70 mm at all meteorological stations: D.T. Severin, 224 mm, July 1999; Slatina, 104.8 mm, August 2002; Caracal, 92.2 m, July 1991; Bechet, 80.8 mm, July 2006; Craiova, 77.6 mm, April 2003. During the cold season, there was noticed a greater uniformity all over the plain, due to the cyclonic origin of rainfalls compared to the warm season, when thermal convection is quite active and it triggers local showers. In order to better emphasize the peculiarities of this parameter, we have calculated the frequency on different value classes (eight classes, as well as the probability of appearance of different amounts. Thus, it resulted that the highest frequency (25-35% is held by the first two classes of values (0-10 mm; 10.1-20 mm. The lowest frequency is registered in case of the amounts of more than 100 mm, which generally display a probability of occurrence of less than 1% and only in the western and eastern extremities of the plain.

CERN Computing Colloquia Spring Series: IT Security - A High-Performance Pattern Matching Engine for Intrusion Detection

CERN Multimedia

CERN. Geneva

2006-01-01

The flexible and modular design of the engine allows a broad spectrum of applications, ranging from high-end enterprise level network devices that need to match hundreds of thousands of patterns at speeds of tens of gigabits per second, to low-end dev...

A Hybrid CPU/GPU Pattern-Matching Algorithm for Deep Packet Inspection.

Directory of Open Access Journals (Sweden)

Chun-Liang Lee

Full Text Available The large quantities of data now being transferred via high-speed networks have made deep packet inspection indispensable for security purposes. Scalable and low-cost signature-based network intrusion detection systems have been developed for deep packet inspection for various software platforms. Traditional approaches that only involve central processing units (CPUs are now considered inadequate in terms of inspection speed. Graphic processing units (GPUs have superior parallel processing power, but transmission bottlenecks can reduce optimal GPU efficiency. In this paper we describe our proposal for a hybrid CPU/GPU pattern-matching algorithm (HPMA that divides and distributes the packet-inspecting workload between a CPU and GPU. All packets are initially inspected by the CPU and filtered using a simple pre-filtering algorithm, and packets that might contain malicious content are sent to the GPU for further inspection. Test results indicate that in terms of random payload traffic, the matching speed of our proposed algorithm was 3.4 times and 2.7 times faster than those of the AC-CPU and AC-GPU algorithms, respectively. Further, HPMA achieved higher energy efficiency than the other tested algorithms.

Using Maximum Entropy to Find Patterns in Genomes

Science.gov (United States)

Liu, Sophia; Hockenberry, Adam; Lancichinetti, Andrea; Jewett, Michael; Amaral, Luis

The existence of over- and under-represented sequence motifs in genomes provides evidence of selective evolutionary pressures on biological mechanisms such as transcription, translation, ligand-substrate binding, and host immunity. To accurately identify motifs and other genome-scale patterns of interest, it is essential to be able to generate accurate null models that are appropriate for the sequences under study. There are currently no tools available that allow users to create random coding sequences with specified amino acid composition and GC content. Using the principle of maximum entropy, we developed a method that generates unbiased random sequences with pre-specified amino acid and GC content. Our method is the simplest way to obtain maximally unbiased random sequences that are subject to GC usage and primary amino acid sequence constraints. This approach can also be easily be expanded to create unbiased random sequences that incorporate more complicated constraints such as individual nucleotide usage or even di-nucleotide frequencies. The ability to generate correctly specified null models will allow researchers to accurately identify sequence motifs which will lead to a better understanding of biological processes. National Institute of General Medical Science, Northwestern University Presidential Fellowship, National Science Foundation, David and Lucile Packard Foundation, Camille Dreyfus Teacher Scholar Award.

Neural network based pattern matching and spike detection tools and services--in the CARMEN neuroinformatics project.

Science.gov (United States)

Fletcher, Martyn; Liang, Bojian; Smith, Leslie; Knowles, Alastair; Jackson, Tom; Jessop, Mark; Austin, Jim

2008-10-01

In the study of information flow in the nervous system, component processes can be investigated using a range of electrophysiological and imaging techniques. Although data is difficult and expensive to produce, it is rarely shared and collaboratively exploited. The Code Analysis, Repository and Modelling for e-Neuroscience (CARMEN) project addresses this challenge through the provision of a virtual neuroscience laboratory: an infrastructure for sharing data, tools and services. Central to the CARMEN concept are federated CARMEN nodes, which provide: data and metadata storage, new, thirdparty and legacy services, and tools. In this paper, we describe the CARMEN project as well as the node infrastructure and an associated thick client tool for pattern visualisation and searching, the Signal Data Explorer (SDE). We also discuss new spike detection methods, which are central to the services provided by CARMEN. The SDE is a client application which can be used to explore data in the CARMEN repository, providing data visualization, signal processing and a pattern matching capability. It performs extremely fast pattern matching and can be used to search for complex conditions composed of many different patterns across the large datasets that are typical in neuroinformatics. Searches can also be constrained by specifying text based metadata filters. Spike detection services which use wavelet and morphology techniques are discussed, and have been shown to outperform traditional thresholding and template based systems. A number of different spike detection and sorting techniques will be deployed as services within the CARMEN infrastructure, to allow users to benchmark their performance against a wide range of reference datasets.

Neuraminidase and hemagglutinin matching patterns of a highly pathogenic avian and two pandemic H1N1 influenza A viruses.

Directory of Open Access Journals (Sweden)

Yonghui Zhang

Full Text Available BACKGROUND: Influenza A virus displays strong reassortment characteristics, which enable it to achieve adaptation in human infection. Surveying the reassortment and virulence of novel viruses is important in the prevention and control of an influenza pandemic. Meanwhile, studying the mechanism of reassortment may accelerate the development of anti-influenza strategies. METHODOLOGY/PRINCIPAL FINDINGS: The hemagglutinin (HA and neuraminidase (NA matching patterns of two pandemic H1N1 viruses (the 1918 and current 2009 strains and a highly pathogenic avian influenza A virus (H5N1 were studied using a pseudotyped particle (pp system. Our data showed that four of the six chimeric HA/NA combinations could produce infectious pps, and that some of the chimeric pps had greater infectivity than did their ancestors, raising the possibility of reassortment among these viruses. The NA of H5N1 (A/Anhui/1/2005 could hardly reassort with the HAs of the two H1N1 viruses. Many biological characteristics of HA and NA, including infectivity, hemagglutinating ability, and NA activity, are dependent on their matching pattern. CONCLUSIONS/SIGNIFICANCE: Our data suggest the existence of an interaction between HA and NA, and the HA NA matching pattern is critical for valid viral reassortment.

Pattern Matching Framework to Estimate the Urgency of Off-Normal Situations in NPPs

Energy Technology Data Exchange (ETDEWEB)

Shin, Jin Soo; Park, Sang Jun; Heo, Gyun Young [Kyung Hee University, Yongin (Korea, Republic of); Park, Jin Kyun [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); Kim, Hyo Jin; Park, Soon Yeol [Korea Hydro and Nuclear Power, Yeonggwang (Korea, Republic of)

2010-10-15

According to power plant operators, it was said that they could quite well recognize off-normal situations from an incipient stage and also anticipate the possibility of upcoming trips in case of skilled operators, even though it is difficult to clarify the cause of the off-normal situation. From the interview, we could assure the feasibility of two assumptions for the diagnosis of off-normal conditions: One is that we can predict whether an accidental shutdown happens or not if we observe the early stage when an off-normal starts to grow. The other is the observation at the early stage can provide the remaining time to a trip as well as the cause of such an off-normal situation. For this purpose, the development of on-line monitoring systems using various data processing techniques in nuclear power plants (NPPs) has been the subject of increasing attention and becomes important contributor to improve performance and economics. Many of studies have suggested the diagnostic methodologies. One of representative methods was to use the distance discrimination as a similarity measure, for example, such as the Euclidean distance. A variety of artificial intelligence techniques such as a neural network have been developed as well. In addition, some of these methodologies were to reduce the data dimensions for more effectively work. While sharing the same motivation with the previous achievements, this study proposed non-parametric pattern matching techniques to reduce the uncertainty in pursuance of selection of models and modeling processes. This could be characterized by the following two aspects: First, for overcoming considering only a few typical scenarios in the most of the studies, this study is getting the entire sets of off-normal situations which are anticipated in NPPs, which are created by a full-scope simulator. Second, many of the existing researches adopted the process of forming a diagnosis model which is so-called a training technique or a parametric

Pattern Matching Framework to Estimate the Urgency of Off-Normal Situations in NPPs

International Nuclear Information System (INIS)

Shin, Jin Soo; Park, Sang Jun; Heo, Gyun Young; Park, Jin Kyun; Kim, Hyo Jin; Park, Soon Yeol

2010-01-01

According to power plant operators, it was said that they could quite well recognize off-normal situations from an incipient stage and also anticipate the possibility of upcoming trips in case of skilled operators, even though it is difficult to clarify the cause of the off-normal situation. From the interview, we could assure the feasibility of two assumptions for the diagnosis of off-normal conditions: One is that we can predict whether an accidental shutdown happens or not if we observe the early stage when an off-normal starts to grow. The other is the observation at the early stage can provide the remaining time to a trip as well as the cause of such an off-normal situation. For this purpose, the development of on-line monitoring systems using various data processing techniques in nuclear power plants (NPPs) has been the subject of increasing attention and becomes important contributor to improve performance and economics. Many of studies have suggested the diagnostic methodologies. One of representative methods was to use the distance discrimination as a similarity measure, for example, such as the Euclidean distance. A variety of artificial intelligence techniques such as a neural network have been developed as well. In addition, some of these methodologies were to reduce the data dimensions for more effectively work. While sharing the same motivation with the previous achievements, this study proposed non-parametric pattern matching techniques to reduce the uncertainty in pursuance of selection of models and modeling processes. This could be characterized by the following two aspects: First, for overcoming considering only a few typical scenarios in the most of the studies, this study is getting the entire sets of off-normal situations which are anticipated in NPPs, which are created by a full-scope simulator. Second, many of the existing researches adopted the process of forming a diagnosis model which is so-called a training technique or a parametric

Recurrence quantification analysis of extremes of maximum and minimum temperature patterns for different climate scenarios in the Mesochora catchment in Central-Western Greece

Science.gov (United States)

Panagoulia, Dionysia; Vlahogianni, Eleni I.

2018-06-01

A methodological framework based on nonlinear recurrence analysis is proposed to examine the historical data evolution of extremes of maximum and minimum daily mean areal temperature patterns over time under different climate scenarios. The methodology is based on both historical data and atmospheric General Circulation Model (GCM) produced climate scenarios for the periods 1961-2000 and 2061-2100 which correspond to 1 × CO2 and 2 × CO2 scenarios. Historical data were derived from the actual daily observations coupled with atmospheric circulation patterns (CPs). The dynamics of the temperature was reconstructed in the phase-space from the time series of temperatures. The statistically comparing different temperature patterns were based on some discriminating statistics obtained by the Recurrence Quantification Analysis (RQA). Moreover, the bootstrap method of Schinkel et al. (2009) was adopted to calculate the confidence bounds of RQA parameters based on a structural preserving resampling. The overall methodology was implemented to the mountainous Mesochora catchment in Central-Western Greece. The results reveal substantial similarities between the historical maximum and minimum daily mean areal temperature statistical patterns and their confidence bounds, as well as the maximum and minimum temperature patterns in evolution under the 2 × CO2 scenario. A significant variability and non-stationary behaviour characterizes all climate series analyzed. Fundamental differences are produced from the historical and maximum 1 × CO2 scenarios, the maximum 1 × CO2 and minimum 1 × CO2 scenarios, as well as the confidence bounds for the two CO2 scenarios. The 2 × CO2 scenario reflects the strongest shifts in intensity, duration and frequency in temperature patterns. Such transitions can help the scientists and policy makers to understand the effects of extreme temperature changes on water resources, economic development, and health of ecosystems and hence to proceed to

Computing solutions for matching games

NARCIS (Netherlands)

Biró, Péter; Kern, Walter; Paulusma, Daniël

2012-01-01

A matching game is a cooperative game (N, v) defined on a graph G = (N, E) with an edge weighting w : E → R+. The player set is N and the value of a coalition S ⊆ N is defined as the maximum weight of a matching in the subgraph induced by S. First we present an O(nm+n2 log n) algorithm that tests if

Estimation of subcriticality and fuel concentration by using 'pattern matching' of neutron flux distribution under non uniformed system

International Nuclear Information System (INIS)

Ishitani, Kazuki; Yamane, Yoshihiro

1999-01-01

In nuclear fuel reprocessing plants, monitoring the spatial profile of neutron flux to infer subcriticality and distribution of fuel concentration using detectors such as PSPC, is very beneficial in sight of criticality safety. In this paper a method of subcriticality and fuel concentration estimation which is supposed to use under non-uniformed system is proposed. Its basic concept is the pattern matching between measured neutron flux distribution and beforehand calculated one. In any kind of subcriticality estimation, we can regard that measured neutron counts put any kind of black box, and then this black box outputs subcriticality. We proposed the use of artificial neural network or 'pattern matching' as black box which have no theoretical clear base. These method are wholly based on the calculated value as recently advancement of computer code accuracy for criticality safety. The most difference between indirect bias estimation method and our method is that our new approach target are the unknown non-uniform system. (J.P.N.)

On Tree-Constrained Matchings and Generalizations

NARCIS (Netherlands)

S. Canzar (Stefan); K. Elbassioni; G.W. Klau (Gunnar); J. Mestre

2011-01-01

htmlabstractWe consider the following \\textsc{Tree-Constrained Bipartite Matching} problem: Given two rooted trees $T_1=(V_1,E_1)$, $T_2=(V_2,E_2)$ and a weight function $w: V_1\\times V_2 \\mapsto \\mathbb{R}_+$, find a maximum weight matching $\\mathcal{M}$ between nodes of the two trees, such that

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

NARCIS (Netherlands)

Bauer, D.; Broersma, Haitze J.; Kahl, N.; Morgana, A.; Schmeichel, E.; Surowiec, T.

2007-01-01

A well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph $G$ in terms of what is usually called the deficiency. A subset $X$ of $V(G)$ for which this deficiency is attained is called a Tutte set of $G$. While much is known about maximum matchings, less is known

On solution concepts for matching games

NARCIS (Netherlands)

Biro, Peter; Kern, Walter; Paulusma, Daniël; Kratochvil, J.; Li, A.; Fiala, J.; Kolman, P.

A matching game is a cooperative game $(N,v)$ defined on a graph $G = (N,E)$ with an edge weighting $\\omega : E \\to {\\Bbb R}_+$ . The player set is $N$ and the value of a coalition $S \\subseteq  N$ is defined as the maximum weight of a matching in the subgraph induced by $S$. First we present an

Facial emotion recognition in Williams syndrome and Down syndrome: A matching and developmental study.

Science.gov (United States)

Martínez-Castilla, Pastora; Burt, Michael; Borgatti, Renato; Gagliardi, Chiara

2015-01-01

In this study both the matching and developmental trajectories approaches were used to clarify questions that remain open in the literature on facial emotion recognition in Williams syndrome (WS) and Down syndrome (DS). The matching approach showed that individuals with WS or DS exhibit neither proficiency for the expression of happiness nor specific impairments for negative emotions. Instead, they present the same pattern of emotion recognition as typically developing (TD) individuals. Thus, the better performance on the recognition of positive compared to negative emotions usually reported in WS and DS is not specific of these populations but seems to represent a typical pattern. Prior studies based on the matching approach suggested that the development of facial emotion recognition is delayed in WS and atypical in DS. Nevertheless, and even though performance levels were lower in DS than in WS, the developmental trajectories approach used in this study evidenced that not only individuals with DS but also those with WS present atypical development in facial emotion recognition. Unlike in the TD participants, where developmental changes were observed along with age, in the WS and DS groups, the development of facial emotion recognition was static. Both individuals with WS and those with DS reached an early maximum developmental level due to cognitive constraints.

Use of Hyperspectral Imagery to Assess Cryptic Color Matching in Sargassum Associated Crabs.

Directory of Open Access Journals (Sweden)

Brandon J Russell

Full Text Available Mats of the pelagic macroalgae Sargassum represent a complex environment for the study of marine camouflage at the air-sea interface. Endemic organisms have convergently evolved similar colors and patterns, but quantitative assessments of camouflage strategies are lacking. Here, spectral camouflage of two crab species (Portunus sayi and Planes minutus was assessed using hyperspectral imagery (HSI. Crabs matched Sargassum reflectance across blue and green wavelengths (400-550 nm and diverged at longer wavelengths. Maximum discrepancy was observed in the far-red (i.e., 675 nm where Chlorophyll a absorption occurred in Sargassum and not the crabs. In a quantum catch color model, both crabs showed effective color matching against blue/green sensitive dichromat fish, but were still discernible to tetrachromat bird predators that have visual sensitivity to far red wavelengths. The two species showed opposing trends in background matching with relation to body size. Variation in model parameters revealed that discrimination of crab and background was impacted by distance from the predator, and the ratio of cone cell types for bird predators. This is one of the first studies to detail background color matching in this unique, challenging ecosystem at the air-sea interface.

Individual Biometric Identification Using Multi-Cycle Electrocardiographic Waveform Patterns

Directory of Open Access Journals (Sweden)

Wonki Lee

2018-03-01

Full Text Available The electrocardiogram (ECG waveform conveys information regarding the electrical property of the heart. The patterns vary depending on the individual heart characteristics. ECG features can be potentially used for biometric recognition. This study presents a new method using the entire ECG waveform pattern for matching and demonstrates that the approach can potentially be employed for individual biometric identification. Multi-cycle ECG signals were assessed using an ECG measuring circuit, and three electrodes can be patched on the wrists or fingers for considering various measurements. For biometric identification, our-fold cross validation was used in the experiments for assessing how the results of a statistical analysis will generalize to an independent data set. Four different pattern matching algorithms, i.e., cosine similarity, cross correlation, city block distance, and Euclidean distances, were tested to compare the individual identification performances with a single channel of ECG signal (3-wire ECG. To evaluate the pattern matching for biometric identification, the ECG recordings for each subject were partitioned into training and test set. The suggested method obtained a maximum performance of 89.9% accuracy with two heartbeats of ECG signals measured on the wrist and 93.3% accuracy with three heartbeats for 55 subjects. The performance rate with ECG signals measured on the fingers improved up to 99.3% with two heartbeats and 100% with three heartbeats of signals for 20 subjects.

Individual Biometric Identification Using Multi-Cycle Electrocardiographic Waveform Patterns.

Science.gov (United States)

Lee, Wonki; Kim, Seulgee; Kim, Daeeun

2018-03-28

The electrocardiogram (ECG) waveform conveys information regarding the electrical property of the heart. The patterns vary depending on the individual heart characteristics. ECG features can be potentially used for biometric recognition. This study presents a new method using the entire ECG waveform pattern for matching and demonstrates that the approach can potentially be employed for individual biometric identification. Multi-cycle ECG signals were assessed using an ECG measuring circuit, and three electrodes can be patched on the wrists or fingers for considering various measurements. For biometric identification, our-fold cross validation was used in the experiments for assessing how the results of a statistical analysis will generalize to an independent data set. Four different pattern matching algorithms, i.e., cosine similarity, cross correlation, city block distance, and Euclidean distances, were tested to compare the individual identification performances with a single channel of ECG signal (3-wire ECG). To evaluate the pattern matching for biometric identification, the ECG recordings for each subject were partitioned into training and test set. The suggested method obtained a maximum performance of 89.9% accuracy with two heartbeats of ECG signals measured on the wrist and 93.3% accuracy with three heartbeats for 55 subjects. The performance rate with ECG signals measured on the fingers improved up to 99.3% with two heartbeats and 100% with three heartbeats of signals for 20 subjects.

Techniques Used in String Matching for Network Security

OpenAIRE

Jamuna Bhandari

2014-01-01

String matching also known as pattern matching is one of primary concept for network security. In this area the effectiveness and efficiency of string matching algorithms is important for applications in network security such as network intrusion detection, virus detection, signature matching and web content filtering system. This paper presents brief review on some of string matching techniques used for network security.

GPUs for fast pattern matching in the RICH of the NA62 experiment

International Nuclear Information System (INIS)

Lamanna, Gianluca; Collazuol, Gianmaria; Sozzi, Marco

2011-01-01

In rare decays experiments an effective online selection is a fundamental part of the data acquisition system (DAQ) in order to reduce both the quantity of data written on tape and the bandwidth requirements for the DAQ system. A multilevel architecture is commonly used to achieve a higher reduction factor, exploiting dedicated custom hardware and flexible software in standard computers. In this paper we discuss the possibility to use commercial video card processors (GPU) to build a fast and effective trigger system, both at hardware and software level. The computing power of the GPUs allows to design a real-time system in which trigger decisions are taken directly in the video processor with a defined maximum latency. This allows building lowest trigger levels based on standard off-the-shelf PCs with CPU and GPU (instead of the commonly adopted solutions based on custom electronics with FPGA or ASICs) with enhanced and high performance computation capabilities, resulting in high rejection power, high efficiency and simpler low level triggers. The ongoing work presented here shows the results achieved in the case of fast pattern matching in the RICH detector of the NA62 at CERN, aiming at measuring the Branching Ratio of the ultra rare decay K + →π + νν-bar, is considered as use case, although the versatility and the customizability of this approach easily allow exporting the concept to different contexts. In particular the application is related to particle identification in the RICH detector of the NA62 experiment, where the rate of events to be analyzed will be around 10 MHz. The results obtained in lab tests are very encouraging to go towards a working prototype. Due to the use of off-the-shelf technology, in continuous development for other purposes (Video Games, image editing,...), the architecture described would be easily exported into other experiments, for building powerful, flexible and fully customizable trigger systems.

GPUs for fast pattern matching in the RICH of the NA62 experiment

Energy Technology Data Exchange (ETDEWEB)

Lamanna, Gianluca, E-mail: gianluca.lamanna@cern.c [CERN, 1211 Geneve 23 (Switzerland); Collazuol, Gianmaria, E-mail: gianmaria.collazuol@cern.c [INFN Pisa, Largo Pontecorvo 3, 56127 Pisa (Italy); Sozzi, Marco, E-mail: marco.sozzi@cern.c [University and INFN Pisa, Largo Pontecorvo 3, 56127 Pisa (Italy)

2011-05-21

In rare decays experiments an effective online selection is a fundamental part of the data acquisition system (DAQ) in order to reduce both the quantity of data written on tape and the bandwidth requirements for the DAQ system. A multilevel architecture is commonly used to achieve a higher reduction factor, exploiting dedicated custom hardware and flexible software in standard computers. In this paper we discuss the possibility to use commercial video card processors (GPU) to build a fast and effective trigger system, both at hardware and software level. The computing power of the GPUs allows to design a real-time system in which trigger decisions are taken directly in the video processor with a defined maximum latency. This allows building lowest trigger levels based on standard off-the-shelf PCs with CPU and GPU (instead of the commonly adopted solutions based on custom electronics with FPGA or ASICs) with enhanced and high performance computation capabilities, resulting in high rejection power, high efficiency and simpler low level triggers. The ongoing work presented here shows the results achieved in the case of fast pattern matching in the RICH detector of the NA62 at CERN, aiming at measuring the Branching Ratio of the ultra rare decay K{sup +}{yields}{pi}{sup +}{nu}{nu}-bar, is considered as use case, although the versatility and the customizability of this approach easily allow exporting the concept to different contexts. In particular the application is related to particle identification in the RICH detector of the NA62 experiment, where the rate of events to be analyzed will be around 10 MHz. The results obtained in lab tests are very encouraging to go towards a working prototype. Due to the use of off-the-shelf technology, in continuous development for other purposes (Video Games, image editing,...), the architecture described would be easily exported into other experiments, for building powerful, flexible and fully customizable trigger systems.

Cephalopod dynamic camouflage: bridging the continuum between background matching and disruptive coloration

Science.gov (United States)

Hanlon, R.T.; Chiao, C.-C.; Mäthger, L.M.; Barbosa, A.; Buresch, K.C.; Chubb, C.

2008-01-01

Individual cuttlefish, octopus and squid have the versatile capability to use body patterns for background matching and disruptive coloration. We define—qualitatively and quantitatively—the chief characteristics of the three major body pattern types used for camouflage by cephalopods: uniform and mottle patterns for background matching, and disruptive patterns that primarily enhance disruptiveness but aid background matching as well. There is great variation within each of the three body pattern types, but by defining their chief characteristics we lay the groundwork to test camouflage concepts by correlating background statistics with those of the body pattern. We describe at least three ways in which background matching can be achieved in cephalopods. Disruptive patterns in cuttlefish possess all four of the basic components of ‘disruptiveness’, supporting Cott's hypotheses, and we provide field examples of disruptive coloration in which the body pattern contrast exceeds that of the immediate surrounds. Based upon laboratory testing as well as thousands of images of camouflaged cephalopods in the field (a sample is provided on a web archive), we note that size, contrast and edges of background objects are key visual cues that guide cephalopod camouflage patterning. Mottle and disruptive patterns are frequently mixed, suggesting that background matching and disruptive mechanisms are often used in the same pattern. PMID:19008200

PTree: pattern-based, stochastic search for maximum parsimony phylogenies

OpenAIRE

Gregor, Ivan; Steinbr?ck, Lars; McHardy, Alice C.

2013-01-01

Phylogenetic reconstruction is vital to analyzing the evolutionary relationship of genes within and across populations of different species. Nowadays, with next generation sequencing technologies producing sets comprising thousands of sequences, robust identification of the tree topology, which is optimal according to standard criteria such as maximum parsimony, maximum likelihood or posterior probability, with phylogenetic inference methods is a computationally very demanding task. Here, we ...

ISOLATED SPEECH RECOGNITION SYSTEM FOR TAMIL LANGUAGE USING STATISTICAL PATTERN MATCHING AND MACHINE LEARNING TECHNIQUES

Directory of Open Access Journals (Sweden)

VIMALA C.

2015-05-01

Full Text Available In recent years, speech technology has become a vital part of our daily lives. Various techniques have been proposed for developing Automatic Speech Recognition (ASR system and have achieved great success in many applications. Among them, Template Matching techniques like Dynamic Time Warping (DTW, Statistical Pattern Matching techniques such as Hidden Markov Model (HMM and Gaussian Mixture Models (GMM, Machine Learning techniques such as Neural Networks (NN, Support Vector Machine (SVM, and Decision Trees (DT are most popular. The main objective of this paper is to design and develop a speaker-independent isolated speech recognition system for Tamil language using the above speech recognition techniques. The background of ASR system, the steps involved in ASR, merits and demerits of the conventional and machine learning algorithms and the observations made based on the experiments are presented in this paper. For the above developed system, highest word recognition accuracy is achieved with HMM technique. It offered 100% accuracy during training process and 97.92% for testing process.

Half-width at half-maximum, full-width at half-maximum analysis

Indian Academy of Sciences (India)

addition to the well-defined parameter full-width at half-maximum (FWHM). The distribution of ... optical side-lobes in the diffraction pattern resulting in steep central maxima [6], reduc- tion of effects of ... and broad central peak. The idea of.

Ring-enhancement pattern on contrast-enhanced CT predicts adenosquamous carcinoma of the pancreas: a matched case-control study.

Science.gov (United States)

Imaoka, Hiroshi; Shimizu, Yasuhiro; Mizuno, Nobumasa; Hara, Kazuo; Hijioka, Susumu; Tajika, Masahiro; Tanaka, Tsutomu; Ishihara, Makoto; Ogura, Takeshi; Obayashi, Tomohiko; Shinagawa, Akihide; Sakaguchi, Masafumi; Yamaura, Hidekazu; Kato, Mina; Niwa, Yasumasa; Yamao, Kenji

2014-01-01

Adenosquamous carcinoma of the pancreas (ASC) is a rare malignant neoplasm of the pancreas, exhibiting both glandular and squamous differentiation. However, little is known about its imaging features. This study examined the imaging features of pancreatic ASC. We evaluated images of contrast-enhanced computed tomography (CT) and endoscopic ultrasonography (EUS). As controls, solid pancreatic neoplasms matched in a 2:1 ratio to ASC cases for age, sex and tumor location were also evaluated. Twenty-three ASC cases were examined, and 46 solid pancreatic neoplasms (43 pancreatic ductal adenocarcinomas, two pancreatic neuroendocrine tumors and one acinar cell carcinoma) were matched as controls. Univariate analysis demonstrated significant differences in the outline and vascularity of tumors on contrast-enhanced CT in the ASC and control groups (P outline, cystic changes, and the ring-enhancement pattern on contrast-enhanced CT were seen to have significant predictive powers by stepwise forward logistic regression analysis (P = 0.044, P = 0.010, and P = 0.001, respectively). Of the three, the ring-enhancement pattern was the most useful, and its predictive diagnostic sensitivity, specificity, positive predictive value and negative predictive value for diagnosis of ASC were 65.2%, 89.6%, 75.0% and 84.3%, respectively. These results demonstrate that presence of the ring-enhancement pattern on contrast-enhanced CT is the most useful predictive factor for ASC. Copyright © 2014 IAP and EPC. Published by Elsevier B.V. All rights reserved.

Crack displacement sensing and measurement in concrete using circular grating moire fringes and pattern matching

Science.gov (United States)

Chan, H. M.; Yen, K. S.; Ratnam, M. M.

2008-09-01

The moire method has been extensively studied in the past and applied in various engineering applications. Several techniques are available for generating the moire fringes in these applications, which include moire interferometry, projection moire, shadow moire, moire deflectometry etc. Most of these methods use the superposition of linear gratings to generate the moire patterns. The use of non-linear gratings, such as circular, radial and elongated gratings has received less attention from the research community. The potential of non-linear gratings in engineering measurement has been realized in a limited number of applications, such as rotation measurement, measurement of linear displacement, measurement of expansion coefficients of materials and measurement of strain distribution. In this work, circular gratings of different pitch were applied to the sensing and measurement of crack displacement in concrete structures. Gratings of pitch 0.50 mm and 0.55 mm were generated using computer software and attached to two overlapping acrylic plates that were bonded to either side of the crack. The resulting moire patterns were captured using a standard digital camera and compared with a set of reference patterns generated using a precision positioning stage. Using several image pre-processing stages, such as filtering and morphological operations, and pattern matching the magnitude displacements along two orthogonal axes can be detected with a resolution of 0.05 mm.

Effects of the Maximum Luminance in a Medical-grade Liquid-crystal Display on the Recognition Time of a Test Pattern: Observer Performance Using Landolt Rings.

Science.gov (United States)

Doi, Yasuhiro; Matsuyama, Michinobu; Ikeda, Ryuji; Hashida, Masahiro

2016-07-01

This study was conducted to measure the recognition time of the test pattern and to investigate the effects of the maximum luminance in a medical-grade liquid-crystal display (LCD) on the recognition time. Landolt rings as signals of the test pattern were used with four random orientations, one on each of the eight gray-scale steps. Ten observers input the orientation of the gap on the Landolt rings using cursor keys on the keyboard. The recognition times were automatically measured from the display of the test pattern on the medical-grade LCD to the input of the orientation of the gap in the Landolt rings. The maximum luminance in this study was set to one of four values (100, 170, 250, and 400 cd/m(2)), for which the corresponding recognition times were measured. As a result, the average recognition times for each observer with maximum luminances of 100, 170, 250, and 400 cd/m(2) were found to be 3.96 to 7.12 s, 3.72 to 6.35 s, 3.53 to 5.97 s, and 3.37 to 5.98 s, respectively. The results indicate that the observer's recognition time is directly proportional to the luminance of the medical-grade LCD. Therefore, it is evident that the maximum luminance of the medical-grade LCD affects the test pattern recognition time.

Impedance-matched Marx generators

Directory of Open Access Journals (Sweden)

W. A. Stygar

2017-04-01

Full Text Available We have conceived a new class of prime-power sources for pulsed-power accelerators: impedance-matched Marx generators (IMGs. The fundamental building block of an IMG is a brick, which consists of two capacitors connected electrically in series with a single switch. An IMG comprises a single stage or several stages distributed axially and connected in series. Each stage is powered by a single brick or several bricks distributed azimuthally within the stage and connected in parallel. The stages of a multistage IMG drive an impedance-matched coaxial transmission line with a conical center conductor. When the stages are triggered sequentially to launch a coherent traveling wave along the coaxial line, the IMG achieves electromagnetic-power amplification by triggered emission of radiation. Hence a multistage IMG is a pulsed-power analogue of a laser. To illustrate the IMG approach to prime power, we have developed conceptual designs of two ten-stage IMGs with LC time constants on the order of 100 ns. One design includes 20 bricks per stage, and delivers a peak electrical power of 1.05 TW to a matched-impedance 1.22-Ω load. The design generates 113 kV per stage and has a maximum energy efficiency of 89%. The other design includes a single brick per stage, delivers 68 GW to a matched-impedance 19-Ω load, generates 113 kV per stage, and has a maximum energy efficiency of 90%. For a given electrical-power-output time history, an IMG is less expensive and slightly more efficient than a linear transformer driver, since an IMG does not use ferromagnetic cores.

Impedance-matched Marx generators

Science.gov (United States)

Stygar, W. A.; LeChien, K. R.; Mazarakis, M. G.; Savage, M. E.; Stoltzfus, B. S.; Austin, K. N.; Breden, E. W.; Cuneo, M. E.; Hutsel, B. T.; Lewis, S. A.; McKee, G. R.; Moore, J. K.; Mulville, T. D.; Muron, D. J.; Reisman, D. B.; Sceiford, M. E.; Wisher, M. L.

2017-04-01

We have conceived a new class of prime-power sources for pulsed-power accelerators: impedance-matched Marx generators (IMGs). The fundamental building block of an IMG is a brick, which consists of two capacitors connected electrically in series with a single switch. An IMG comprises a single stage or several stages distributed axially and connected in series. Each stage is powered by a single brick or several bricks distributed azimuthally within the stage and connected in parallel. The stages of a multistage IMG drive an impedance-matched coaxial transmission line with a conical center conductor. When the stages are triggered sequentially to launch a coherent traveling wave along the coaxial line, the IMG achieves electromagnetic-power amplification by triggered emission of radiation. Hence a multistage IMG is a pulsed-power analogue of a laser. To illustrate the IMG approach to prime power, we have developed conceptual designs of two ten-stage IMGs with L C time constants on the order of 100 ns. One design includes 20 bricks per stage, and delivers a peak electrical power of 1.05 TW to a matched-impedance 1.22 -Ω load. The design generates 113 kV per stage and has a maximum energy efficiency of 89%. The other design includes a single brick per stage, delivers 68 GW to a matched-impedance 19 -Ω load, generates 113 kV per stage, and has a maximum energy efficiency of 90%. For a given electrical-power-output time history, an IMG is less expensive and slightly more efficient than a linear transformer driver, since an IMG does not use ferromagnetic cores.

GPUs for fast triggering and pattern matching at the CERN experiment NA62

International Nuclear Information System (INIS)

Lamanna, Gianluca; Collazuol, Gianmaria; Sozzi, Marco

2011-01-01

In rare decays experiments an effective trigger is crucial to reduce both the quantity of data written on tape and the bandwidth requirements for the DAQ (Data Acquisition) system. A multilevel architecture is commonly used to achieve a higher reduction factor, exploiting dedicated custom hardware and flexible software in standard computers. In this paper we discuss the possibility to use commercial video card processors (GPU) to build a fast and effective trigger system, both at hardware and software level. The case of fast pattern matching in the RICH detector of the NA62 experiment at CERN aiming at measuring the Branching Ratio of the ultra rare decay K + →π + νν-bar is considered as use case although the versatility and the customizability of this approach easily allow exporting the concept to different contexts.

Quantum learning and universal quantum matching machine

International Nuclear Information System (INIS)

Sasaki, Masahide; Carlini, Alberto

2002-01-01

Suppose that three kinds of quantum systems are given in some unknown states vertical bar f> xN , vertical bar g 1 > xK , and vertical bar g 2 > xK , and we want to decide which template state vertical bar g 1 > or vertical bar g 2 >, each representing the feature of the pattern class C 1 or C 2 , respectively, is closest to the input feature state vertical bar f>. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of K=1, showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process

Statistical density modification using local pattern matching

International Nuclear Information System (INIS)

Terwilliger, Thomas C.

2003-01-01

Statistical density modification can make use of local patterns of density found in protein structures to improve crystallographic phases. A method for improving crystallographic phases is presented that is based on the preferential occurrence of certain local patterns of electron density in macromolecular electron-density maps. The method focuses on the relationship between the value of electron density at a point in the map and the pattern of density surrounding this point. Patterns of density that can be superimposed by rotation about the central point are considered equivalent. Standard templates are created from experimental or model electron-density maps by clustering and averaging local patterns of electron density. The clustering is based on correlation coefficients after rotation to maximize the correlation. Experimental or model maps are also used to create histograms relating the value of electron density at the central point to the correlation coefficient of the density surrounding this point with each member of the set of standard patterns. These histograms are then used to estimate the electron density at each point in a new experimental electron-density map using the pattern of electron density at points surrounding that point and the correlation coefficient of this density to each of the set of standard templates, again after rotation to maximize the correlation. The method is strengthened by excluding any information from the point in question from both the templates and the local pattern of density in the calculation. A function based on the origin of the Patterson function is used to remove information about the electron density at the point in question from nearby electron density. This allows an estimation of the electron density at each point in a map, using only information from other points in the process. The resulting estimates of electron density are shown to have errors that are nearly independent of the errors in the original map using

Patterns of somatic alterations between matched primary and metastatic colorectal tumors characterized by whole-genome sequencing.

Science.gov (United States)

Xie, Tao; Cho, Yong Beom; Wang, Kai; Huang, Donghui; Hong, Hye Kyung; Choi, Yoon-La; Ko, Young Hyeh; Nam, Do-Hyun; Jin, Juyoun; Yang, Heekyoung; Fernandez, Julio; Deng, Shibing; Rejto, Paul A; Lee, Woo Yong; Mao, Mao

2014-10-01

Colorectal cancer (CRC) patients have poor prognosis after formation of distant metastasis. Understanding the molecular mechanisms by which genetic changes facilitate metastasis is critical for the development of targeted therapeutic strategies aimed at controlling disease progression while minimizing toxic side effects. A comprehensive portrait of somatic alterations in CRC and the changes between primary and metastatic tumors has yet to be developed. We performed whole genome sequencing of two primary CRC tumors and their matched liver metastases. By comparing to matched germline DNA, we catalogued somatic alterations at multiple scales, including single nucleotide variations, small insertions and deletions, copy number aberrations and structural variations in both the primary and matched metastasis. We found that the majority of these somatic alterations are present in both sites. Despite the overall similarity, several de novo alterations in the metastases were predicted to be deleterious, in genes including FBXW7, DCLK1 and FAT2, which might contribute to the initiation and progression of distant metastasis. Through careful examination of the mutation prevalence among tumor cells at each site, we also proposed distinct clonal evolution patterns between primary and metastatic tumors in the two cases. These results suggest that somatic alterations may play an important role in driving the development of colorectal cancer metastasis and present challenges and opportunities when considering the choice of treatment. Copyright © 2014 Elsevier Inc. All rights reserved.

The effect of football matches on crime patterns in Barcelona

OpenAIRE

Struse, Simon Planells; Montolio, Daniel

2014-01-01

Given the actual debate, in many European countries, about the need for public administrations to raise their revenues through taxing the crime externalities generated by some private leisure activities, this article analyzes the effect of football matches on crime focusing both on property crimes and interpersonal violent crimes. Our aim is to determine up to what extent a private leisure activity, such as football matches, induces negative crime externalities to the whole society. Using dat...

Matching games: the least core and the nucleolus

NARCIS (Netherlands)

Kern, Walter; Paulusma, Daniël

2003-01-01

A matching game is a cooperative game defined by a graph G = (N, E). The player set is N and the value of a coalition S ⫅ N is defined as the size of a maximum matching in the subgraph induced by S. We show that the nucleolus of such games can be computed efficiently. The result is based on an

Maximum speed of dewetting on a fiber

NARCIS (Netherlands)

Chan, Tak Shing; Gueudre, Thomas; Snoeijer, Jacobus Hendrikus

2011-01-01

A solid object can be coated by a nonwetting liquid since a receding contact line cannot exceed a critical speed. We theoretically investigate this forced wetting transition for axisymmetric menisci on fibers of varying radii. First, we use a matched asymptotic expansion and derive the maximum speed

Trends in Correlation-Based Pattern Recognition and Tracking in Forward-Looking Infrared Imagery

Science.gov (United States)

Alam, Mohammad S.; Bhuiyan, Sharif M. A.

2014-01-01

In this paper, we review the recent trends and advancements on correlation-based pattern recognition and tracking in forward-looking infrared (FLIR) imagery. In particular, we discuss matched filter-based correlation techniques for target detection and tracking which are widely used for various real time applications. We analyze and present test results involving recently reported matched filters such as the maximum average correlation height (MACH) filter and its variants, and distance classifier correlation filter (DCCF) and its variants. Test results are presented for both single/multiple target detection and tracking using various real-life FLIR image sequences. PMID:25061840

Speed-up Template Matching through Integral Image based Weak Classifiers

NARCIS (Netherlands)

Wu, t.; Toet, A.

2014-01-01

Template matching is a widely used pattern recognition method, especially in industrial inspection. However, the computational costs of traditional template matching increase dramatically with both template-and scene imagesize. This makes traditional template matching less useful for many (e.g.

Adaptive Unscented Kalman Filter using Maximum Likelihood Estimation

DEFF Research Database (Denmark)

Mahmoudi, Zeinab; Poulsen, Niels Kjølstad; Madsen, Henrik

2017-01-01

The purpose of this study is to develop an adaptive unscented Kalman filter (UKF) by tuning the measurement noise covariance. We use the maximum likelihood estimation (MLE) and the covariance matching (CM) method to estimate the noise covariance. The multi-step prediction errors generated...

Fixed-pattern noise correction method based on improved moment matching for a TDI CMOS image sensor.

Science.gov (United States)

Xu, Jiangtao; Nie, Huafeng; Nie, Kaiming; Jin, Weimin

2017-09-01

In this paper, an improved moment matching method based on a spatial correlation filter (SCF) and bilateral filter (BF) is proposed to correct the fixed-pattern noise (FPN) of a time-delay-integration CMOS image sensor (TDI-CIS). First, the values of row FPN (RFPN) and column FPN (CFPN) are estimated and added to the original image through SCF and BF, respectively. Then the filtered image will be processed by an improved moment matching method with a moving window. Experimental results based on a 128-stage TDI-CIS show that, after correcting the FPN in the image captured under uniform illumination, the standard deviation of row mean vector (SDRMV) decreases from 5.6761 LSB to 0.1948 LSB, while the standard deviation of the column mean vector (SDCMV) decreases from 15.2005 LSB to 13.1949LSB. In addition, for different images captured by different TDI-CISs, the average decrease of SDRMV and SDCMV is 5.4922/2.0357 LSB, respectively. Comparative experimental results indicate that the proposed method can effectively correct the FPNs of different TDI-CISs while maintaining image details without any auxiliary equipment.

Efficient Aho-Corasick String Matching on Emerging Multicore Architectures

Energy Technology Data Exchange (ETDEWEB)

Tumeo, Antonino; Villa, Oreste; Secchi, Simone; Chavarría-Miranda, Daniel

2013-12-12

String matching algorithms are critical to several scientific fields. Beside text processing and databases, emerging applications such as DNA protein sequence analysis, data mining, information security software, antivirus, ma- chine learning, all exploit string matching algorithms [3]. All these applica- tions usually process large quantity of textual data, require high performance and/or predictable execution times. Among all the string matching algorithms, one of the most studied, especially for text processing and security applica- tions, is the Aho-Corasick algorithm. 1 2 Book title goes here Aho-Corasick is an exact, multi-pattern string matching algorithm which performs the search in a time linearly proportional to the length of the input text independently from pattern set size. However, depending on the imple- mentation, when the number of patterns increase, the memory occupation may raise drastically. In turn, this can lead to significant variability in the performance, due to the memory access times and the caching effects. This is a significant concern for many mission critical applications and modern high performance architectures. For example, security applications such as Network Intrusion Detection Systems (NIDS), must be able to scan network traffic against very large dictionaries in real time. Modern Ethernet links reach up to 10 Gbps, and malicious threats are already well over 1 million, and expo- nentially growing [28]. When performing the search, a NIDS should not slow down the network, or let network packets pass unchecked. Nevertheless, on the current state-of-the-art cache based processors, there may be a large per- formance variability when dealing with big dictionaries and inputs that have different frequencies of matching patterns. In particular, when few patterns are matched and they are all in the cache, the procedure is fast. Instead, when they are not in the cache, often because many patterns are matched and the caches are

Investigation of cortical thickness abnormalities in lithium-free adults with bipolar type I disorder using cortical pattern matching

Science.gov (United States)

Foland-Ross, Lara C.; Thompson, Paul M.; Sugar, Catherine A.; Madsen, Sarah K.; Shen, Jim K.; Penfold, Conor; Ahlf, Kyle; Rasser, Paul E.; Fischer, Jeffrey; Yang, Yilan; Townsend, Jennifer; Bookheimer, Susan Y.; Altshuler, Lori L.

2013-01-01

Objective Several lines of evidence implicate gray matter abnormalities in the prefrontal cortex and anterior cingulate cortex in patients with bipolar disorder. Findings however, have been largely inconsistent across studies. Differences in patients’ medication status or mood state, or the application of traditional volumetric methods that are insensitive to subtle neuroanatomic differences may have contributed to these inconsistent findings. Given this, we used magnetic resonance imaging (MRI) in conjunction with cortical pattern matching methods to assess cortical thickness abnormalities in euthymic bipolar subjects who were not treated with lithium. Method Sixty-five subjects, including 34 lithium-free euthymic subjects with bipolar (type I) disorder and 31 healthy subjects were scanned using magnetic resonance imaging (MRI). Data were processed to measure cortical gray matter thickness. Cortical pattern matching methods associated homologous brain regions across subjects. Spatially normalized thickness maps were analyzed to assess illness effects and associations with clinical variables. Results Relative to healthy subjects, euthymic bipolar I subjects had significantly thinner gray matter in bilateral prefrontal cortex (Brodmann Areas 11, 10, 8 and 44) and left anterior cingulate cortex (Brodmann Areas 24/32). Additionally, thinning in these regions was more pronounced in patients with a history of psychosis. No areas of thicker cortex were detected in bipolar subjects versus healthy subjects. Conclusions Using a technique that is highly sensitive to subtle neuroanatomic differences, significant regional cortical thinning was found in euthymic subjects with bipolar disorder. Clinical implications are discussed. PMID:21285139

Physical match performance of youth football players in relation to physical capacity

DEFF Research Database (Denmark)

Rebelo, António; Brito, João; Seabra, André

2014-01-01

competitive matches per player. Distance covered during the match was 6311±948 (range: 4435-8098) m, of which 12% were high-intensity activities (HIA; 759±437 [374-2062] m), and 5% was backwards running (309±205 [12-776] m). Mean match HR was 168±12 (140-187) bpm, corresponding to 85% (69-91) of maximum HR...

LCLS Maximum Credible Beam Power

International Nuclear Information System (INIS)

Clendenin, J.

2005-01-01

The maximum credible beam power is defined as the highest credible average beam power that the accelerator can deliver to the point in question, given the laws of physics, the beam line design, and assuming all protection devices have failed. For a new accelerator project, the official maximum credible beam power is determined by project staff in consultation with the Radiation Physics Department, after examining the arguments and evidence presented by the appropriate accelerator physicist(s) and beam line engineers. The definitive parameter becomes part of the project's safety envelope. This technical note will first review the studies that were done for the Gun Test Facility (GTF) at SSRL, where a photoinjector similar to the one proposed for the LCLS is being tested. In Section 3 the maximum charge out of the gun for a single rf pulse is calculated. In Section 4, PARMELA simulations are used to track the beam from the gun to the end of the photoinjector. Finally in Section 5 the beam through the matching section and injected into Linac-1 is discussed

MODEL PREDICTIVE CONTROL FOR PHOTOVOLTAIC STATION MAXIMUM POWER POINT TRACKING SYSTEM

Directory of Open Access Journals (Sweden)

I. Elzein

2015-01-01

Full Text Available The purpose of this paper is to present an alternative maximum power point tracking, MPPT, algorithm for a photovoltaic module, PVM, to produce the maximum power, Pmax, using the optimal duty ratio, D, for different types of converters and load matching.We present a state-based approach to the design of the maximum power point tracker for a stand-alone photovoltaic power generation system. The system under consideration consists of a solar array with nonlinear time-varying characteristics, a step-up converter with appropriate filter.The proposed algorithm has the advantages of maximizing the efficiency of the power utilization, can be integrated to other MPPT algorithms without affecting the PVM performance, is excellent for Real-Time applications and is a robust analytical method, different from the traditional MPPT algorithms which are more based on trial and error, or comparisons between present and past states. The procedure to calculate the optimal duty ratio for a buck, boost and buck-boost converters, to transfer the maximum power from a PVM to a load, is presented in the paper. Additionally, the existence and uniqueness of optimal internal impedance, to transfer the maximum power from a photovoltaic module using load matching, is proved.

Matching beams on photon/electron linear accelerators

International Nuclear Information System (INIS)

Oliver, L.; Vial, P.; Hunt, P.

2004-01-01

Full text: There are a number of obvious reasons to match megavoltage X-ray and electron beams for clinical purposes. If two dual-purpose X-ray/electron linear accelerators are of the same design and manufacturer, then this might be possible. The issue is however whether the beams can be matched sufficiently close to be considered the same for patient treatments and planning data for dose calculation purposes. If successfully achieved, there are significant advantages in reduced commissioning time, less work in planning and flexibility in the treatment of patients between the two treatment machines. We have investigated matching a new Varian Clinac 21EX with our 1993 Varian Clinac 2100 C/D. A Varian Clinac 1800 was the first linear accelerator installed at RNSH in 1987. When the Clinac 2100 C/D was installed in 1993, we attempted to match all the X-ray and electron beams with the original Clinac 1800 physical data. The X-ray beam characteristics were satisfactory but the electron beams were not sufficiently compatible for planning or patient treatment purposes. A different designed scattering foil and electron applicator were the cause of the different electron beam physical characteristics between the two models. In replacing the Clinac 1800 with the Clinac 21EX, we have used the original 1993 data of the Clinac 2100 C/D as the gold standard to aim for. Initial measurements during acceptance tests showed that all beams satisfied the manufacturer's specification. The energy was then matched to the existing clinical physics data by adjusting the bending magnet power supply and re-tuning the accelerator. This involved matching % depth dose and the corresponding ratio of 10 and 20 cm % depth dose ratio for 6MV and 18 MV X-ray beams. For 6, 9, 12, 16 and 20 MeV electron beams the normal physical parameters of depth of maximum (R max ), the practical range (R p ), the depth of 50% (R 50 ), the slope (G), the average energy at the surface (E 0 ) and the % photon

Continuous Acetylsalicylic Acid Treatment Does Not Influence Bleeding Pattern or Outcome of Aneurysmal Subarachnoid Hemorrhage: A Matched-Pair Analysis.

Science.gov (United States)

Bruder, Markus; Won, Sae-Yeon; Wagner, Marlies; Brawanski, Nina; Dinc, Nazife; Kashefiolasl, Sepide; Seifert, Volker; Konczalla, Juergen

2018-05-01

Demographic changes are leading to an aging society with a growing number of patients with cardiovascular diseases, relying on antiplatelet drugs like acetylsalicylic acid (ASA). Although antiplatelet agents are suspected to be protective not only in the cardiologic but in the neurovascular field, the alteration of the coagulating process could have a major impact on the course and outcome after rupture of intracranial aneurysms. Between June 1999 and December 2014, 1422 patients were treated for aneurysmal SAH in our institution, 144 (10.1%) with continuous ASA at the time of aneurysm rupture. A matched-pair analysis was performed. The rate of patients with continuous ASA treatment while rupture of the aneurysm is rising significantly (P bleeding pattern. Outcome was not different in the matched-pair analysis. There was no statistical difference in treatment related-complication rates of microsurgical and endovascular procedures. Therefore, ASA use should not influence treatment decision of the ruptured aneurysm. Copyright © 2018 Elsevier Inc. All rights reserved.

Sequential pattern recognition by maximum conditional informativity

Czech Academy of Sciences Publication Activity Database

Grim, Jiří

2014-01-01

Roč. 45, č. 1 (2014), s. 39-45 ISSN 0167-8655 R&D Projects: GA ČR(CZ) GA14-02652S; GA ČR(CZ) GA14-10911S Keywords : Multivariate statistics * Statistical pattern recognition * Sequential decision making * Product mixtures * EM algorithm * Shannon information Subject RIV: IN - Informatics, Computer Sci ence Impact factor: 1.551, year: 2014 http://library.utia.cas.cz/separaty/2014/RO/grim-0428565.pdf

Method of electric powertrain matching for battery-powered electric cars

Science.gov (United States)

Ning, Guobao; Xiong, Lu; Zhang, Lijun; Yu, Zhuoping

2013-05-01

The current match method of electric powertrain still makes use of longitudinal dynamics, which can't realize maximum capacity for on-board energy storage unit and can't reach lowest equivalent fuel consumption as well. Another match method focuses on improving available space considering reasonable layout of vehicle to enlarge rated energy capacity for on-board energy storage unit, which can keep the longitudinal dynamics performance almost unchanged but can't reach lowest fuel consumption. Considering the characteristics of driving motor, method of electric powertrain matching utilizing conventional longitudinal dynamics for driving system and cut-and-try method for energy storage system is proposed for passenger cars converted from traditional ones. Through combining the utilization of vehicle space which contributes to the on-board energy amount, vehicle longitudinal performance requirements, vehicle equivalent fuel consumption level, passive safety requirements and maximum driving range requirement together, a comprehensive optimal match method of electric powertrain for battery-powered electric vehicle is raised. In simulation, the vehicle model and match method is built in Matlab/simulink, and the Environmental Protection Agency (EPA) Urban Dynamometer Driving Schedule (UDDS) is chosen as a test condition. The simulation results show that 2.62% of regenerative energy and 2% of energy storage efficiency are increased relative to the traditional method. The research conclusions provide theoretical and practical solutions for electric powertrain matching for modern battery-powered electric vehicles especially for those converted from traditional ones, and further enhance dynamics of electric vehicles.

Hyperspectral imaging of cuttlefish camouflage indicates good color match in the eyes of fish predators.

Science.gov (United States)

Chiao, Chuan-Chin; Wickiser, J Kenneth; Allen, Justine J; Genter, Brock; Hanlon, Roger T

2011-05-31

Camouflage is a widespread phenomenon throughout nature and an important antipredator tactic in natural selection. Many visual predators have keen color perception, and thus camouflage patterns should provide some degree of color matching in addition to other visual factors such as pattern, contrast, and texture. Quantifying camouflage effectiveness in the eyes of the predator is a challenge from the perspectives of both biology and optical imaging technology. Here we take advantage of hyperspectral imaging (HSI), which records full-spectrum light data, to simultaneously visualize color match and pattern match in the spectral and the spatial domains, respectively. Cuttlefish can dynamically camouflage themselves on any natural substrate and, despite their colorblindness, produce body patterns that appear to have high-fidelity color matches to the substrate when viewed directly by humans or with RGB images. Live camouflaged cuttlefish on natural backgrounds were imaged using HSI, and subsequent spectral analysis revealed that most reflectance spectra of individual cuttlefish and substrates were similar, rendering the color match possible. Modeling color vision of potential di- and trichromatic fish predators of cuttlefish corroborated the spectral match analysis and demonstrated that camouflaged cuttlefish show good color match as well as pattern match in the eyes of fish predators. These findings (i) indicate the strong potential of HSI technology to enhance studies of biological coloration and (ii) provide supporting evidence that cuttlefish can produce color-coordinated camouflage on natural substrates despite lacking color vision.

POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY

Directory of Open Access Journals (Sweden)

S. Chen

2016-06-01

Full Text Available Image matching lies at the heart of photogrammetry and computer vision. For poor textural images, the matching result is affected by low contrast, repetitive patterns, discontinuity or occlusion, few or homogeneous textures. Recently, graph matching became popular for its integration of geometric and radiometric information. Focused on poor textural image matching problem, it is proposed an edge-weight strategy to improve graph matching algorithm. A series of experiments have been conducted including 4 typical landscapes: Forest, desert, farmland, and urban areas. And it is experimentally found that our new algorithm achieves better performance. Compared to SIFT, doubled corresponding points were acquired, and the overall recall rate reached up to 68%, which verifies the feasibility and effectiveness of the algorithm.

Movement patterns and muscle damage during simulated rugby sevens matches in National team players.

Science.gov (United States)

Pereira, Lucas A; Nakamura, Fábio Y; Moraes, José E; Kitamura, Katia; Ramos, Solange P; Loturco, Irineu

2017-02-23

The aim of this study was to analyze the match performance (i.e., distance covered in different intensities), signs of muscle damage (assessed by means of creatine kinase [CK] activity and rate of force development [RFD]), and neuromuscular fatigue (using linear sprint and vertical jump performances) following three single-day simulated matches performed by rugby sevens players from the Brazilian National Team. Ten male rugby sevens players (25.2 ± 3.6 years; 88.7 ± 7.1 kg; 182.2 ± 6.3 cm) participated in this study. On the day prior to the matches, the athletes performed a 40-m sprint, a vertical jump assessment and a maximal isometric force test. In the morning of the match day, blood samples were collected to analyze the CK activity. Afterwards, three simulated rugby sevens' matches were performed with 2-h intermission periods. The match performance (encompassing total distance and distance covered in different velocity ranges and body loads [BL]) were obtained from global positioning system units. The statistical analysis was performed by using a mixed model approach and the effect sizes (ES) of the differences. The statistical significance level was set at P0.8) and significant (P< 0.05) reductions were demonstrated in the total distance and BL when comparing the 2 with the 1 halves. Decrements in the explosive force capacity (assessed by means of RFD) and the squat jump were noticed (ES varying from 0.55 to 1.14; P< 0.05). The CK activity increased after the matches (ES = 1.29; P< 0.05). The rugby sevens players were able to maintain the physical performance across three successive matches simulating the first day of a tournament. The augmented CK activity and the decreases in the squat jump and RFD suggest that increased levels of muscle damage were experienced on the day after the matches. Therefore, the technical staff are encouraged to implement recovery strategies and planned substitutions during multi-day tournaments in order to reduce the impact of

Actors with Multi-Headed Message Receive Patterns

DEFF Research Database (Denmark)

Sulzmann, Martin; Lam, Edmund Soon Lee; Van Weert, Peter

2008-01-01

style actors with receive clauses containing multi-headed message patterns. Patterns may be non-linear and constrained by guards. We provide a number of examples to show the usefulness of the extension. We also explore the design space for multi-headed message matching semantics, for example first-match......The actor model provides high-level concurrency abstractions to coordinate simultaneous computations by message passing. Languages implementing the actor model such as Erlang commonly only support single-headed pattern matching over received messages. We propose and design an extension of Erlang...... and rule priority-match semantics. The various semantics are inspired by the multi-set constraint matching semantics found in Constraint Handling Rules. This provides us with a formal model to study actors with multi-headed message receive patterns. The system can be implemented efficiently and we have...

Comparison of the Physical and Technical Demands of Cricket Players During Training and Match-Play.

Science.gov (United States)

Vickery, Will; Duffield, Rob; Crowther, Rian; Beakley, David; Blanch, Peter; Dascombe, Ben J

2018-03-01

Vickery, W, Duffield, R, Crowther, R, Beakley, D, Blanch, P, and Dascombe, BJ. Comparison of the physical and technical demands of cricket players during training and match-play. J Strength Cond Res 32(3): 821-829, 2018-This study aimed to determine which training method (net-based sessions or center-wicket simulations) currently used in national level and U19 male players cricket provided a more physical and technical match-specific training response. The heart rate, rating of perceived exertion, and movement patterns of 42 male cricket players were measured across the various training and match formats. Video analysis was coded retrospectively to quantify technical loads based on the cricket skills performed. Magnitude-based inferences were based on the standardization of effect and presented with ±90% confidence intervals. Regardless of playing position, differences in physiological demands between training modes and match-play were unclear, with the exception of higher heart rates in fielders during traditional net sessions (mean heart rate: d = -2.7 [-4.7 to -0.7]; 75% of maximum heart rate: d = -1.7 [-3.2 to -0.2]). Typically, the movement demands of center-wicket simulations were similar or greater than match-play, which was most evident in the distance traveled at a high intensity within each playing position (batsmen: d = 6.4 [3.7-9.2]; medium-fast bowlers: d = 1.71 [0.1-3.3]; spin bowlers: d = 6.5 [0.01-13.0]; fielders: d = 0.8 [-0.2 to 1.7]). The technical demands of traditional net cricket training exceeded that of a typical match for each playing position. Specifically, fast bowlers delivered a greater number of balls during net-bowling compared with a match (d = -2.2 [-3.6 to 0.9]). In conclusion, center-wicket simulations more closely matched the physical demands of a One-Day match within batsmen and spin bowlers, whereas traditional cricket training often exceeded match-specific demands.

Uma proposta de solução para o problema da construção de escalas de motoristas e cobradores de ônibus por meio do algoritmo do matching de peso máximo A proposed solution for bus driver and fare collector scheduling problems using the maximum weight matching algorithm

Directory of Open Access Journals (Sweden)

Paulo Henrique Siqueira

2004-08-01

Full Text Available O objetivo deste trabalho é mostrar a aplicação do Algoritmo do Matching de peso máximo, na elaboração de jornadas de trabalho para motoristas e cobradores de ônibus. Este problema deve ser resolvido levando-se em consideração o maior aproveitamento possível das tabelas de horários, com o objetivo de minimizar o número de funcionários, de horas extras e de horas ociosas. Desta forma, os custos das companhias de transporte público são minimizados. Na primeira fase do trabalho, supondo-se que as tabelas de horários já estejam divididas em escalas de curta e de longa duração, as escalas de curta duração são combinadas para a formação da jornada diária de trabalho de um funcionário. Esta combinação é feita com o Algoritmo do Matching de peso máximo, no qual as escalas são representadas por vértices de um grafo, e o peso máximo é atribuído às combinações de escalas que não formam horas extras e horas ociosas. Na segunda fase, uma jornada de final de semana é designada para cada jornada semanal de dias úteis. Por meio destas duas fases, as jornadas semanais de trabalho para motoristas e cobradores de ônibus podem ser construídas com custo mínimo. A terceira e última fase deste trabalho consiste na designação das jornadas semanais de trabalho para cada motorista e cobrador de ônibus, considerando-se suas preferências. O Algoritmo do Matching de peso máximo é utilizado para esta fase também. Este trabalho foi aplicado em três empresas de transporte público da cidade de Curitiba - PR, nas quais os algoritmos utilizados anteriormente eram heurísticos, baseados apenas na experiência do encarregado por esta tarefa.The purpose of this paper is to discuss how the maximum weight Matching Algorithm can be applied to schedule the workdays of bus drivers and bus fare collectors. This scheduling should be based on the best possible use of timetables in order to minimize the number of employees, overtime and

Plasma focus matching conditions

International Nuclear Information System (INIS)

Soliman, H.M.; Masoud, M.M.; Elkhalafawy, T.A.

1988-01-01

A snow-plough and slug models have been used to obtain the optimum matching conditions of the plasma in the focus. The dimensions of the plasma focus device are, inner electrode radius = 2 cm, outer electrode radius = 5.5 cm, and its length = 8 cm. It was found that the maximum magnetic energy of 12.26 kJ has to be delivered to plasma focus whose density is 10 19 /cm 3 at focusing time of 2.55 μs and with total external inductance of 24.2 n H. The same method is used to evaluate the optimum matching conditions for the previous coaxial discharge system which had inner electrode radius = 1.6 cm, outer electrode radius = 3.3 cm and its length = 31.5 cm. These conditions are charging voltage = 12 kV, capacity of the condenser bank = 430 μf, plasma focus density = 10 19 /cm 3 focusing time = 8 μs and total external inductance = 60.32 n H.3 fig., 2 tab

Geodesic acoustic eigenmode for tokamak equilibrium with maximum of local GAM frequency

Energy Technology Data Exchange (ETDEWEB)

Lakhin, V.P. [NRC “Kurchatov Institute”, Moscow (Russian Federation); Sorokina, E.A., E-mail: sorokina.ekaterina@gmail.com [NRC “Kurchatov Institute”, Moscow (Russian Federation); Peoples' Friendship University of Russia, Moscow (Russian Federation)

2014-01-24

The geodesic acoustic eigenmode for tokamak equilibrium with the maximum of local GAM frequency is found analytically in the frame of MHD model. The analysis is based on the asymptotic matching technique.

A pattern-matched Twitter analysis of US cancer-patient sentiments.

Science.gov (United States)

Crannell, W Christian; Clark, Eric; Jones, Chris; James, Ted A; Moore, Jesse

2016-12-01

Twitter has been recognized as an important source of organic sentiment and opinion. This study aimed to (1) characterize the content of tweets authored by the United States cancer patients; and (2) use patient tweets to compute the average happiness of cancer patients for each cancer diagnosis. A large sample of English tweets from March 2014 through December 2014 was obtained from Twitter. Using regular expression software pattern matching, the tweets were filtered by cancer diagnosis. For each cancer-specific tweetset, individual patients were extracted, and the content of the tweet was categorized. The patients' Twitter identification numbers were used to gather all tweets for each patient, and happiness values for patient tweets were calculated using a quantitative hedonometric analysis. The most frequently tweeted cancers were breast (n = 15,421, 11% of total cancer tweets), lung (n = 2928, 2.0%), prostate (n = 1036, 0.7%), and colorectal (n = 773, 0.5%). Patient tweets pertained to the treatment course (n = 73, 26%), diagnosis (n = 65, 23%), and then surgery and/or biopsy (n = 42, 15%). Computed happiness values for each cancer diagnosis revealed higher average happiness values for thyroid (h_avg = 6.1625), breast (h_avg = 6.1485), and lymphoma (h_avg = 6.0977) cancers and lower average happiness values for pancreatic (h_avg = 5.8766), lung (h_avg = 5.8733), and kidney (h_avg = 5.8464) cancers. The study confirms that patients are expressing themselves openly on social media about their illness and that unique cancer diagnoses are correlated with varying degrees of happiness. Twitter can be employed as a tool to identify patient needs and as a means to gauge the cancer patient experience. Copyright © 2016 Elsevier Inc. All rights reserved.

Improved peak detection in mass spectrum by incorporating continuous wavelet transform-based pattern matching.

Science.gov (United States)

Du, Pan; Kibbe, Warren A; Lin, Simon M

2006-09-01

A major problem for current peak detection algorithms is that noise in mass spectrometry (MS) spectra gives rise to a high rate of false positives. The false positive rate is especially problematic in detecting peaks with low amplitudes. Usually, various baseline correction algorithms and smoothing methods are applied before attempting peak detection. This approach is very sensitive to the amount of smoothing and aggressiveness of the baseline correction, which contribute to making peak detection results inconsistent between runs, instrumentation and analysis methods. Most peak detection algorithms simply identify peaks based on amplitude, ignoring the additional information present in the shape of the peaks in a spectrum. In our experience, 'true' peaks have characteristic shapes, and providing a shape-matching function that provides a 'goodness of fit' coefficient should provide a more robust peak identification method. Based on these observations, a continuous wavelet transform (CWT)-based peak detection algorithm has been devised that identifies peaks with different scales and amplitudes. By transforming the spectrum into wavelet space, the pattern-matching problem is simplified and in addition provides a powerful technique for identifying and separating the signal from the spike noise and colored noise. This transformation, with the additional information provided by the 2D CWT coefficients can greatly enhance the effective signal-to-noise ratio. Furthermore, with this technique no baseline removal or peak smoothing preprocessing steps are required before peak detection, and this improves the robustness of peak detection under a variety of conditions. The algorithm was evaluated with SELDI-TOF spectra with known polypeptide positions. Comparisons with two other popular algorithms were performed. The results show the CWT-based algorithm can identify both strong and weak peaks while keeping false positive rate low. The algorithm is implemented in R and will be

Body Weight and Matching with a Physically Attractive Romantic Partner

Science.gov (United States)

Carmalt, Julie H.; Cawley, John; Joyner, Kara; Sobal, Jeffery

2008-01-01

Matching and attribute trade are two perspectives used to explain mate selection. We investigated patterns of matching and trade, focusing on obesity, using Add Health Romantic Pair data (N = 1,405 couples). Obese individuals, relative to healthy weight individuals, were less likely to have physically attractive partners, with this disadvantage…

Optimal background matching camouflage.

Science.gov (United States)

Michalis, Constantine; Scott-Samuel, Nicholas E; Gibson, David P; Cuthill, Innes C

2017-07-12

Background matching is the most familiar and widespread camouflage strategy: avoiding detection by having a similar colour and pattern to the background. Optimizing background matching is straightforward in a homogeneous environment, or when the habitat has very distinct sub-types and there is divergent selection leading to polymorphism. However, most backgrounds have continuous variation in colour and texture, so what is the best solution? Not all samples of the background are likely to be equally inconspicuous, and laboratory experiments on birds and humans support this view. Theory suggests that the most probable background sample (in the statistical sense), at the size of the prey, would, on average, be the most cryptic. We present an analysis, based on realistic assumptions about low-level vision, that estimates the distribution of background colours and visual textures, and predicts the best camouflage. We present data from a field experiment that tests and supports our predictions, using artificial moth-like targets under bird predation. Additionally, we present analogous data for humans, under tightly controlled viewing conditions, searching for targets on a computer screen. These data show that, in the absence of predator learning, the best single camouflage pattern for heterogeneous backgrounds is the most probable sample. © 2017 The Authors.

Fast matching of sensor data with manual observations.

Science.gov (United States)

Jit, Biswas; Maniyeri, Jayachandran; Louis, Shue; Philip, Yap Lin Kiat

2009-01-01

In systems and trials concerning wearable sensors and devices used for medical data collection, the validation of sensor data with respect to manual observations is very important. However, this is often problematic because of feigned behavior, errors in manual recording (misclassification), gaps in recording (missing readings), missed observations and timing mismatch between manual observations and sensor data due to a difference in time granularity. Using sleep activity pattern monitoring as an example we present a fast algorithm for matching sensor data with manual observations. Major components include a) signal analysis to classify states of sleep activity pattern, b) matching of states with Sleep Diary (SD) and c) automated detection of anomalies and reconciliation of mismatches between the SD and the sensor data.

Envelope matching for enhanced backward Raman amplification by using self-ionizing plasmas

International Nuclear Information System (INIS)

Zhang, Z. M.; Zhang, B.; Hong, W.; Teng, J.; He, S. K.; Gu, Y. Q.; Yu, M. Y.

2014-01-01

Backward Raman amplification (BRA) in plasmas has been promoted as a means for generating ultrapowerful laser pulses. For the purpose of achieving the maximum intensities over the shortest distances, an envelope matching between the seed pulse and the amplification gain is required, i.e., the seed pulse propagates at the same velocity with the gain such that the peak of the seed pulse can always enjoy the maximum gain. However, such an envelope matching is absent in traditional BRA because in the latter the amplification gain propagates at superluminous velocity while the seed pulse propagates at the group velocity, which is less than the speed of light. It is shown here that, by using self-ionizing plasmas, the speed of the amplification gain can be well reduced to reach the envelope matching regime. This results in a favorable BRA process, in which higher saturated intensity, shorter interaction length and higher energy-transfer efficiency are achieved

Most Recent Match Queries in On-Line Suffix Trees

DEFF Research Database (Denmark)

Larsson, N. Jesper

2014-01-01

A suffix tree is able to efficiently locate a pattern in an indexed string, but not in general the most recent copy of the pattern in an online stream, which is desirable in some applications. We study the most general version of the problem of locating a most recent match: supporting queries...

Anatomy Ontology Matching Using Markov Logic Networks

Directory of Open Access Journals (Sweden)

Chunhua Li

2016-01-01

Full Text Available The anatomy of model species is described in ontologies, which are used to standardize the annotations of experimental data, such as gene expression patterns. To compare such data between species, we need to establish relationships between ontologies describing different species. Ontology matching is a kind of solutions to find semantic correspondences between entities of different ontologies. Markov logic networks which unify probabilistic graphical model and first-order logic provide an excellent framework for ontology matching. We combine several different matching strategies through first-order logic formulas according to the structure of anatomy ontologies. Experiments on the adult mouse anatomy and the human anatomy have demonstrated the effectiveness of proposed approach in terms of the quality of result alignment.

Analysis of shots on target and goals scored in soccer matches ...

African Journals Online (AJOL)

The aim of this study was to analyse the characteristics and patterns of shots on target and goals scored during the 2012-European Championship. The broadcasted matches were recorded and converted into electronic video files for a computerbased analysis. This quantitative study examined 31 matches of the ...

The complexity of the matching-cut problem for planar graphs and other graph classes

NARCIS (Netherlands)

Bonsma, P.S.

2009-01-01

The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be -complete when restricted to graphs with maximum degree four. In this paper it

Predicting the Outcome of NBA Playoffs Based on the Maximum Entropy Principle

OpenAIRE

Ge Cheng; Zhenyu Zhang; Moses Ntanda Kyebambe; Nasser Kimbugwe

2016-01-01

Predicting the outcome of National Basketball Association (NBA) matches poses a challenging problem of interest to the research community as well as the general public. In this article, we formalize the problem of predicting NBA game results as a classification problem and apply the principle of Maximum Entropy to construct an NBA Maximum Entropy (NBAME) model that fits to discrete statistics for NBA games, and then predict the outcomes of NBA playoffs using the model. Our results reveal that...

A Novel Fast and Robust Binary Affine Invariant Descriptor for Image Matching

Directory of Open Access Journals (Sweden)

Xiujie Qu

2014-01-01

Full Text Available As the current binary descriptors have disadvantages of high computational complexity, no affine invariance, and the high false matching rate with viewpoint changes, a new binary affine invariant descriptor, called BAND, is proposed. Different from other descriptors, BAND has an irregular pattern, which is based on local affine invariant region surrounding a feature point, and it has five orientations, which are obtained by LBP effectively. Ultimately, a 256 bits binary string is computed by simple random sampling pattern. Experimental results demonstrate that BAND has a good matching result in the conditions of rotating, image zooming, noising, lighting, and small-scale perspective transformation. It has better matching performance compared with current mainstream descriptors, while it costs less time.

Poor textural image tie point matching via graph theory

Science.gov (United States)

Yuan, Xiuxiao; Chen, Shiyu; Yuan, Wei; Cai, Yang

2017-07-01

Feature matching aims to find corresponding points to serve as tie points between images. Robust matching is still a challenging task when input images are characterized by low contrast or contain repetitive patterns, occlusions, or homogeneous textures. In this paper, a novel feature matching algorithm based on graph theory is proposed. This algorithm integrates both geometric and radiometric constraints into an edge-weighted (EW) affinity tensor. Tie points are then obtained by high-order graph matching. Four pairs of poor textural images covering forests, deserts, bare lands, and urban areas are tested. For comparison, three state-of-the-art matching techniques, namely, scale-invariant feature transform (SIFT), speeded up robust features (SURF), and features from accelerated segment test (FAST), are also used. The experimental results show that the matching recall obtained by SIFT, SURF, and FAST varies from 0 to 35% in different types of poor textures. However, through the integration of both geometry and radiometry and the EW strategy, the recall obtained by the proposed algorithm is better than 50% in all four image pairs. The better matching recall improves the number of correct matches, dispersion, and positional accuracy.

The match-to-match variation of match-running in elite female soccer.

Science.gov (United States)

Trewin, Joshua; Meylan, César; Varley, Matthew C; Cronin, John

2018-02-01

The purpose of this study was to examine the match-to-match variation of match-running in elite female soccer players utilising GPS, using full-match and rolling period analyses. Longitudinal study. Elite female soccer players (n=45) from the same national team were observed during 55 international fixtures across 5 years (2012-2016). Data was analysed using a custom built MS Excel spreadsheet as full-matches and using a rolling 5-min analysis period, for all players who played 90-min matches (files=172). Variation was examined using co-efficient of variation and 90% confidence limits, calculated following log transformation. Total distance per minute exhibited the smallest variation when both the full-match and peak 5-min running periods were examined (CV=6.8-7.2%). Sprint-efforts were the most variable during a full-match (CV=53%), whilst high-speed running per minute exhibited the greatest variation in the post-peak 5-min period (CV=143%). Peak running periods were observed as slightly more variable than full-match analyses, with the post-peak period very-highly variable. Variability of accelerations (CV=17%) and Player Load (CV=14%) was lower than that of high-speed actions. Positional differences were also present, with centre backs exhibiting the greatest variation in high-speed movements (CV=41-65%). Practitioners and researchers should account for within player variability when examining match performances. Identification of peak running periods should be used to assist worst case scenarios. Whilst micro-sensor technology should be further examined as to its viable use within match-analyses. Copyright © 2017 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.

MUSCLE DAMAGE AFTER A TENNIS MATCH IN YOUNG PLAYERS

Directory of Open Access Journals (Sweden)

R.V. Gomes

2014-07-01

Full Text Available The present study investigated changes in indirect markers of muscle damage following a simulated tennis match play using nationally ranked young (17.6 ± 1.4 years male tennis players. Ten young athletes played a 3-hour simulated match play on outdoor red clay courts following the International Tennis Federation rules. Muscle soreness, plasma creatine kinase activity (CK, serum myoglobin concentration (Mb, one repetition maximum (1RM squat strength, and squat jump (SJ and counter movement jump (CMJ heights were assessed before, immediately after, and 24 and 48 h after the simulated match play. All parameters were also evaluated in a non-exercised group (control group. A small increase in the indirect markers of muscle damage (muscle soreness, CK and Mb was detected at 24-48 hours post-match (p<0.05. A marked acute decrement in neuromuscular performance (1RM squat strength: -35.2 ± 10.4%, SJ: -7.0 ± 6.0%, CMJ: -10.0 ± 6.3% was observed immediately post-match (p<0.05. At 24 h post-match, the 1RM strength and jump heights were not significantly different from the baseline values. However, several players showed a decrease of these measures at 24 h after the match play. The simulated tennis match play induced mild muscle damage in young players. Coaches could monitor changes in the indirect markers of muscle damage to assess athletes’ recovery status during training and competition.

Star pattern recognition algorithm aided by inertial information

Science.gov (United States)

Liu, Bao; Wang, Ke-dong; Zhang, Chao

2011-08-01

Star pattern recognition is one of the key problems of the celestial navigation. The traditional star pattern recognition approaches, such as the triangle algorithm and the star angular distance algorithm, are a kind of all-sky matching method whose recognition speed is slow and recognition success rate is not high. Therefore, the real time and reliability of CNS (Celestial Navigation System) is reduced to some extent, especially for the maneuvering spacecraft. However, if the direction of the camera optical axis can be estimated by other navigation systems such as INS (Inertial Navigation System), the star pattern recognition can be fulfilled in the vicinity of the estimated direction of the optical axis. The benefits of the INS-aided star pattern recognition algorithm include at least the improved matching speed and the improved success rate. In this paper, the direction of the camera optical axis, the local matching sky, and the projection of stars on the image plane are estimated by the aiding of INS firstly. Then, the local star catalog for the star pattern recognition is established in real time dynamically. The star images extracted in the camera plane are matched in the local sky. Compared to the traditional all-sky star pattern recognition algorithms, the memory of storing the star catalog is reduced significantly. Finally, the INS-aided star pattern recognition algorithm is validated by simulations. The results of simulations show that the algorithm's computation time is reduced sharply and its matching success rate is improved greatly.

Rotation-invariant fingerprint matching using radon and DCT

Indian Academy of Sciences (India)

Sangita Bharkad

2017-11-20

Nov 20, 2017 ... [6] Bazen A and Gerez S 2003 Fingerprint matching by thin- plate spline modeling of elastic deformations. Pattern. Recogn. 36(8): 1859–1867. [7] Jain A, Hong L and Bolle R 1997 On-line fingerprint veri- fication. IEEE Trans.

Application of four different football match analysis systems

DEFF Research Database (Denmark)

Randers, Morten B; Mujika, Inigo; Hewitt, Adam

2010-01-01

Using a video-based time-motion analysis system, a semi-automatic multiple-camera system, and two commercially available GPS systems (GPS-1; 5 Hz and GPS-2; 1 Hz), we compared activity pattern and fatigue development in the same football match. Twenty football players competing in the Spanish...... a football game and can be used to study game-induced fatigue. Rather large between-system differences were present in the determination of the absolute distances covered, meaning that any comparisons of results between different match analysis systems should be done with caution....

Pengenalan Angka Pada Sistem Operasi Android Dengan Menggunakan Metode Template Matching

Directory of Open Access Journals (Sweden)

Abdi Pandu Kusuma

2016-07-01

Full Text Available AbstrakUsia dini merupakan usia yang efektif untuk mengembangkan berbagai potensi yang dimiliki oleh anak. Upaya pengembangan potensi dapat dilakukan melalui berbagai cara termasuk dengan cara bermain. Bermain bagi anak merupakan cara yang tepat untuk belajar. Berdasarkan fenomena tersebut, maka perlu dibuat sebuah aplikasi pengenalan angka yang interaktif dengan unsur edukasi. Aplikasi tersebut diharapkan dapat mengambil keputusan secara otomatis apa yang ditulis anak itu bernilai benar atau salah dan juga dapat membangkitkan semangat belajar anak dalam mengenal pola angka. Solusi yang sesuai agar aplikasi tersebut dapat memberikan jawaban salah atau benar digunakan satu metode yaitu template matching. Pengenalan angka dengan menggunakan metode template matching dilakukan dengan cara membandingkan citra masukan dengan citra template. Hasil template matching dihitung dari banyaknya titik pada citra masukan yang sesuai dengan citra template. Template disediakan pada database untuk memberikan contoh cara penulisan pola angka. Uji coba dilakukan pada aplikasi sebanyak 40 kali dengan pola yang berbeda. Dari hasil uji coba didapat prosentase keberhasilan aplikasi ini mencapai 75,75%.Kata kunci: Belajar, bermain, Template Matching, dan pola. AbstractEarly childhood is an effective age to develop the potential of the child. Potential development efforts can be done through various ways, including by playing. Playing for children is a great way to learn. Based on this phenomenon, it should be made an introduction to the numbers interactive application with elements of education. The application is expected to take decisions automatically what the child is written is true or false, and also can encourage a child's learning in recognizing number patterns. Appropriate solutions so that the app can give an answer right or wrong to use the methods that template matching. The introduction of the numbers by using template matching is done by comparing the

PHYSIOLOGICAL RESPONSES DURING MATCHES AND PROFILE OF ELITE PENCAK SILAT EXPONENTS

Directory of Open Access Journals (Sweden)

Benedict Tan

2002-12-01

Full Text Available This is a descriptive, cross-sectional study describing the physiological responses during competitive matches and profile of elite exponents of an emerging martial art sport, pencak silat. Thirty exponents (21 males and 9 females were involved in the study. Match responses (i.e. heart rate (HR throughout match and capillary blood lactate concentration, [La], at pre-match and at the end of every round were obtained during actual competitive duels. Elite silat exponents' physiological attributes were assessed via anthropometry, vertical jump, isometric grip strength, maximal oxygen uptake, and the Wingate 30 s anaerobic test of the upper and lower body, in the laboratory. The match response data showed that silat competitors' mean HR was > 84% of estimated HR maximum and levels of [La] ranged from 6.7 - 18.7 mMol-1 during matches. This suggests that competitive silat matches are characterised by high aerobic and anaerobic responses. In comparison to elite taekwondo and judo athletes' physiological characteristics, elite silat exponents have lower aerobic fitness and grip strength, but greater explosive leg power (vertical jump. Generally, they also possessed a similar anaerobic capability in the lower but markedly inferior anaerobic capability in the upper body

Predicting the Outcome of NBA Playoffs Based on the Maximum Entropy Principle

Directory of Open Access Journals (Sweden)

Ge Cheng

2016-12-01

Full Text Available Predicting the outcome of National Basketball Association (NBA matches poses a challenging problem of interest to the research community as well as the general public. In this article, we formalize the problem of predicting NBA game results as a classification problem and apply the principle of Maximum Entropy to construct an NBA Maximum Entropy (NBAME model that fits to discrete statistics for NBA games, and then predict the outcomes of NBA playoffs using the model. Our results reveal that the model is able to predict the winning team with 74.4% accuracy, outperforming other classical machine learning algorithms that could only afford a maximum prediction accuracy of 70.6% in the experiments that we performed.

K-Line Patterns’ Predictive Power Analysis Using the Methods of Similarity Match and Clustering

Directory of Open Access Journals (Sweden)

Lv Tao

2017-01-01

Full Text Available Stock price prediction based on K-line patterns is the essence of candlestick technical analysis. However, there are some disputes on whether the K-line patterns have predictive power in academia. To help resolve the debate, this paper uses the data mining methods of pattern recognition, pattern clustering, and pattern knowledge mining to research the predictive power of K-line patterns. The similarity match model and nearest neighbor-clustering algorithm are proposed for solving the problem of similarity match and clustering of K-line series, respectively. The experiment includes testing the predictive power of the Three Inside Up pattern and Three Inside Down pattern with the testing dataset of the K-line series data of Shanghai 180 index component stocks over the latest 10 years. Experimental results show that (1 the predictive power of a pattern varies a great deal for different shapes and (2 each of the existing K-line patterns requires further classification based on the shape feature for improving the prediction performance.

An accurate algorithm to match imperfectly matched images for lung tumor detection without markers.

Science.gov (United States)

Rozario, Timothy; Bereg, Sergey; Yan, Yulong; Chiu, Tsuicheng; Liu, Honghuan; Kearney, Vasant; Jiang, Lan; Mao, Weihua

2015-05-08

In order to locate lung tumors on kV projection images without internal markers, digitally reconstructed radiographs (DRRs) are created and compared with projection images. However, lung tumors always move due to respiration and their locations change on projection images while they are static on DRRs. In addition, global image intensity discrepancies exist between DRRs and projections due to their different image orientations, scattering, and noises. This adversely affects comparison accuracy. A simple but efficient comparison algorithm is reported to match imperfectly matched projection images and DRRs. The kV projection images were matched with different DRRs in two steps. Preprocessing was performed in advance to generate two sets of DRRs. The tumors were removed from the planning 3D CT for a single phase of planning 4D CT images using planning contours of tumors. DRRs of background and DRRs of tumors were generated separately for every projection angle. The first step was to match projection images with DRRs of background signals. This method divided global images into a matrix of small tiles and similarities were evaluated by calculating normalized cross-correlation (NCC) between corresponding tiles on projections and DRRs. The tile configuration (tile locations) was automatically optimized to keep the tumor within a single projection tile that had a bad matching with the corresponding DRR tile. A pixel-based linear transformation was determined by linear interpolations of tile transformation results obtained during tile matching. The background DRRs were transformed to the projection image level and subtracted from it. The resulting subtracted image now contained only the tumor. The second step was to register DRRs of tumors to the subtracted image to locate the tumor. This method was successfully applied to kV fluoro images (about 1000 images) acquired on a Vero (BrainLAB) for dynamic tumor tracking on phantom studies. Radiation opaque markers were

Modeling Architectural Patterns Using Architectural Primitives

NARCIS (Netherlands)

Zdun, Uwe; Avgeriou, Paris

2005-01-01

Architectural patterns are a key point in architectural documentation. Regrettably, there is poor support for modeling architectural patterns, because the pattern elements are not directly matched by elements in modeling languages, and, at the same time, patterns support an inherent variability that

Effects of drugs of abuse and cholinergic agents on delayed matching-to-sample responding in the squirrel monkey.

Science.gov (United States)

Hudzik, T J; Wenger, G R

1993-04-01

To study how drugs may disrupt short-term memory function, squirrel monkeys were trained to respond under a titrating delayed matching-to-sample schedule of reinforcement. Monkeys could respond on each of three keys in an operant chamber. At the start of each trial, the 30th response on the center key illuminated each of the side keys, one of which matched the stimulus presented on the center key (simultaneous matching). A response to the correct (matching) side key turned off all stimuli and initiated a delay, the length of which varied as a function of ongoing performance. After the delay, stimuli were randomly presented on two of the three keys. A response to the key which matched the color on the center key before the delay resulted in delivery of a food pellet (delayed matching). Incorrect simultaneous or delayed matching responses initiated a timeout. Under this procedure, diazepam and scopolamine decreased delayed matching accuracy at one or more doses that did not significantly decrease mean delay values, but only scopolamine decreased matching accuracy at a dose that did not significantly decrease response rates. Cocaine decreased mean delay values after the highest dose without affecting matching accuracy. Pentobarbital and methylscopolamine decreased matching accuracy and mean and maximum delay values after the highest doses. Nicotine and phencyclidine produced small decreases in delayed matching accuracy without affecting mean and maximum delay values. Caffeine, morphine, physostigmine and neostigmine did not alter matching performance even after doses that markedly decreased rates of responding.(ABSTRACT TRUNCATED AT 250 WORDS)

Generalized Phase contrast and matched filtering for speckle‐free patterned illumination

DEFF Research Database (Denmark)

Palima, Darwin; Bañas, Andrew Rafael; Villangca, Mark Jayson

2013-01-01

Generalized Phase Contrast (GPC) and matched‐filtering GPC use tandem diffractive phase elements on Fourier‐conjugate planes of a 4f optical processor to efficiently reshape incident light into a pattern that resembles the input phase modulation pattern. The synthesized patterns are inherently...... to optically trap and mechanically manipulate microparticles, GPC has also been applied for laser beamshaping, optical phase cryptography, and greyscale image projection. Recent reports from our collaborators highlight that GPC‐based spatial lightshaping, when combined with temporal focusing and multiphoton...... excitation, exhibits some robustness against light scattering and, hence, makes a promising tool for spatially precise targeting of deeper subsurface neurons using minimally speckled patterned illumination for multiphoton excitation....

A pattern-based methodology for optimizing stitches in double-patterning technology

Science.gov (United States)

Wang, Lynn T.; Madhavan, Sriram; Dai, Vito; Capodieci, Luigi

2015-03-01

A pattern-based methodology for optimizing stitches is developed based on identifying stitch topologies and replacing them with pre-characterized fixing solutions in decomposed layouts. A topology-based library of stitches with predetermined fixing solutions is built. A pattern-based engine searches for matching topologies in the decomposed layouts. When a match is found, the engine opportunistically replaces the predetermined fixing solution: only a design rule check error-free replacement is preserved. The methodology is demonstrated on a 20nm layout design that contains over 67 million, first metal layer stitches. Results show that a small library containing 3 stitch topologies improves the stitch area regularity by 4x.

Practical relevance of pattern uniqueness in forensic science.

Science.gov (United States)

Jayaprakash, Paul T

2013-09-10

Uniqueness being unprovable, it has recently been argued that individualization in forensic science is irrelevant and, probability, as applied for DNA profiles, should be applied for all identifications. Critiques against uniqueness have omitted physical matching, a realistic and tangible individualization that supports uniqueness. Describing case examples illustrating pattern matches including physical matching, it is indicated that individualizations are practically relevant for forensic science as they establish facts on a definitive basis providing firm leads benefitting criminal investigation. As a tenet of forensic identification, uniqueness forms a fundamental paradigm relevant for individualization. Evidence on the indeterministic and stochastic causal pathways of characteristics in patterns available in the related fields of science sufficiently supports the proposition of uniqueness. Characteristics involved in physical matching and matching achieved in patterned evidence existing in the state of nature are not events amenable for counting; instead these are ensemble of visible units occupying the entire pattern area stretching the probability of re-occurrence of a verisimilitude pattern into infinity offering epistemic support to uniqueness. Observational methods are as respectable as instrumental or statistical methods since they are capable of generating results that are tangible and obviously valid as in physical matching. Applying the probabilistic interpretation used for DNA profiles to the other patterns would be unbefitting since these two are disparate, the causal pathways of the events, the loci, in the manipulated DNA profiles being determinable. While uniqueness enables individualizations, it does not vouch for eliminating errors. Instead of dismissing uniqueness and individualization, accepting errors as human or system failures and seeking remedial measures would benefit forensic science practice and criminal investigation. Copyright © 2013

Effects of countermovement depth on kinematic and kinetic patterns of maximum vertical jumps.

Science.gov (United States)

Mandic, Radivoj; Jakovljevic, Sasa; Jaric, Slobodan

2015-04-01

Although maximum height (H(max)), muscle force (F), and power output (P), have been routinely obtained from maximum vertical jumps for various purposes, a possible role of the countermovement depth (H(cmd)) on the same variables remains largely unexplored. Here we hypothesized that (1) the optimum H(cmd) for maximizing H(max) exists, while (2) an increase in H(cmd) would be associated with a decrease in both F and P. Professional male basketball players (N=11) preformed maximum countermovement jumps with and without arm swing while varying H(cmd)±25 cm from its preferred value. Although regression models revealed a presence of optimum H(cmd) for maximizing H(max), H(max) revealed only small changes within a wide range of H(cmd). The preferred H(cmd) was markedly below its optimum value (p vertical jumps should be taken with caution since both of them could be markedly confounded by H(cmd). Copyright © 2014 Elsevier Ltd. All rights reserved.

Exploring the impact of climate variability during the Last Glacial Maximum on the pattern of human occupation of Iberia.

Science.gov (United States)

Burke, Ariane; Levavasseur, Guillaume; James, Patrick M A; Guiducci, Dario; Izquierdo, Manuel Arturo; Bourgeon, Lauriane; Kageyama, Masa; Ramstein, Gilles; Vrac, Mathieu

2014-08-01

The Last Glacial Maximum (LGM) was a global climate event, which had significant repercussions for the spatial distribution and demographic history of prehistoric populations. In Eurasia, the LGM coincides with a potential bottleneck for modern humans and may mark the divergence date for Asian and European populations (Keinan et al., 2007). In this research, the impact of climate variability on human populations in the Iberian Peninsula during the Last Glacial Maximum (LGM) is examined with the aid of downscaled high-resolution (16 × 16 km) numerical climate experiments. Human sensitivity to short time-scale (inter-annual) climate variability during this key time period, which follows the initial modern human colonisation of Eurasia and the extinction of the Neanderthals, is tested using the spatial distribution of archaeological sites. Results indicate that anatomically modern human populations responded to small-scale spatial patterning in climate variability, specifically inter-annual variability in precipitation levels as measured by the standard precipitation index. Climate variability at less than millennial scale, therefore, is shown to be an important component of ecological risk, one that played a role in regulating the spatial behaviour of prehistoric human populations and consequently affected their social networks. Copyright © 2014 Elsevier Ltd. All rights reserved.

A Malicious Pattern Detection Engine for Embedded Security Systems in the Internet of Things

Directory of Open Access Journals (Sweden)

Doohwan Oh

2014-12-01

Full Text Available With the emergence of the Internet of Things (IoT, a large number of physical objects in daily life have been aggressively connected to the Internet. As the number of objects connected to networks increases, the security systems face a critical challenge due to the global connectivity and accessibility of the IoT. However, it is difficult to adapt traditional security systems to the objects in the IoT, because of their limited computing power and memory size. In light of this, we present a lightweight security system that uses a novel malicious pattern-matching engine. We limit the memory usage of the proposed system in order to make it work on resource-constrained devices. To mitigate performance degradation due to limitations of computation power and memory, we propose two novel techniques, auxiliary shifting and early decision. Through both techniques, we can efficiently reduce the number of matching operations on resource-constrained systems. Experiments and performance analyses show that our proposed system achieves a maximum speedup of 2.14 with an IoT object and provides scalable performance for a large number of patterns.

A Malicious Pattern Detection Engine for Embedded Security Systems in the Internet of Things

Science.gov (United States)

Oh, Doohwan; Kim, Deokho; Ro, Won Woo

2014-01-01

With the emergence of the Internet of Things (IoT), a large number of physical objects in daily life have been aggressively connected to the Internet. As the number of objects connected to networks increases, the security systems face a critical challenge due to the global connectivity and accessibility of the IoT. However, it is difficult to adapt traditional security systems to the objects in the IoT, because of their limited computing power and memory size. In light of this, we present a lightweight security system that uses a novel malicious pattern-matching engine. We limit the memory usage of the proposed system in order to make it work on resource-constrained devices. To mitigate performance degradation due to limitations of computation power and memory, we propose two novel techniques, auxiliary shifting and early decision. Through both techniques, we can efficiently reduce the number of matching operations on resource-constrained systems. Experiments and performance analyses show that our proposed system achieves a maximum speedup of 2.14 with an IoT object and provides scalable performance for a large number of patterns. PMID:25521382

A malicious pattern detection engine for embedded security systems in the Internet of Things.

Science.gov (United States)

Oh, Doohwan; Kim, Deokho; Ro, Won Woo

2014-12-16

With the emergence of the Internet of Things (IoT), a large number of physical objects in daily life have been aggressively connected to the Internet. As the number of objects connected to networks increases, the security systems face a critical challenge due to the global connectivity and accessibility of the IoT. However, it is difficult to adapt traditional security systems to the objects in the IoT, because of their limited computing power and memory size. In light of this, we present a lightweight security system that uses a novel malicious pattern-matching engine. We limit the memory usage of the proposed system in order to make it work on resource-constrained devices. To mitigate performance degradation due to limitations of computation power and memory, we propose two novel techniques, auxiliary shifting and early decision. Through both techniques, we can efficiently reduce the number of matching operations on resource-constrained systems. Experiments and performance analyses show that our proposed system achieves a maximum speedup of 2.14 with an IoT object and provides scalable performance for a large number of patterns.

An Implementation of the Frequency Matching Method

DEFF Research Database (Denmark)

Lange, Katrine; Frydendall, Jan; Hansen, Thomas Mejer

During the last decade multiple-point statistics has become in-creasingly popular as a tool for incorporating complex prior infor-mation when solving inverse problems in geosciences. A variety of methods have been proposed but often the implementation of these is not straightforward. One of these......During the last decade multiple-point statistics has become in-creasingly popular as a tool for incorporating complex prior infor-mation when solving inverse problems in geosciences. A variety of methods have been proposed but often the implementation of these is not straightforward. One...... of these methods is the recently proposed Frequency Matching method to compute the maximum a posteriori model of an inverse problem where multiple-point statistics, learned from a training image, is used to formulate a closed form expression for an a priori probability density function. This paper discusses...... aspects of the implementation of the Fre-quency Matching method and the techniques adopted to make it com-putationally feasible also for large-scale inverse problems. The source code is publicly available at GitHub and this paper also provides an example of how to apply the Frequency Matching method...

Optical Frequency Mixing in Periodically-Patterned and in Quasi-Periodically-Patterned Nonlinear media

International Nuclear Information System (INIS)

Arie, A.

1999-01-01

Nonlinear frequency mixing processes, e.g. second harmonic generation, sum and difference frequency generation, etc., require matching of the phases of the interacting waves. The traditional method to achieve it is by selecting a specific angle of propagation in a birefringent nonlinear crystal. The main limitation of the birefringent phase matching method stems from the fact that for many interesting interactions, the phase matching condition cannot be satisfied in a specific crystal. This obstacle can be removed by the technique of quasi-phase-matching (QPM), where the nonlinear coefficient of the material is modulated at a fixed spatial frequency that equals the wave-vector phase mismatch between the interacting waves. An important development in recent years is the ability to periodically reverse the sign of the nonlinear coefficient in ferroelectric crystals by applying a high electric field through a periodic electrode. Some recent QPM interactions in periodically-poled KTP that were recently achieved at Tel-Aviv University include continuous-wave optical parametric oscillations, as well as generation of tunable mid-infrared radiation by difference frequency generation. Periodic patterning of the nonlinear coefficient enables to phase match only a single interaction. It would be advantageous to further extend the applications of this technique in order to simultaneously satisfy several interactions on a single crystal. This cannot be usually achieved in a periodic pattern, however more sophisticated quasi-periodic structures can be designed in this case. An interesting analogy can be drawn between artificially-made quasi-periodically-patterned nonlinear crystals and quasi-crystals found in nature, in rapidly-cooled metallic alloys

Template matching techniques in computer vision theory and practice

CERN Document Server

Brunelli, Roberto

2009-01-01

The detection and recognition of objects in images is a key research topic in the computer vision community.  Within this area, face recognition and interpretation has attracted increasing attention owing to the possibility of unveiling human perception mechanisms, and for the development of practical biometric systems. This book and the accompanying website, focus on template matching, a subset of object recognition techniques of wide applicability, which has proved to be particularly effective for face recognition applications. Using examples from face processing tasks throughout the book to illustrate more general object recognition approaches, Roberto Brunelli: examines the basics of digital image formation, highlighting points critical to the task of template matching;presents basic and  advanced template matching techniques, targeting grey-level images, shapes and point sets;discusses recent pattern classification paradigms from a template matching perspective;illustrates the development of a real fac...

A spot-matching method using cumulative frequency matrix in 2D gel images

Science.gov (United States)

Han, Chan-Myeong; Park, Joon-Ho; Chang, Chu-Seok; Ryoo, Myung-Chun

2014-01-01

A new method for spot matching in two-dimensional gel electrophoresis images using a cumulative frequency matrix is proposed. The method improves on the weak points of the previous method called ‘spot matching by topological patterns of neighbour spots’. It accumulates the frequencies of neighbour spot pairs produced through the entire matching process and determines spot pairs one by one in order of higher frequency. Spot matching by frequencies of neighbour spot pairs shows a fairly better performance. However, it can give researchers a hint for whether the matching results can be trustworthy or not, which can save researchers a lot of effort for verification of the results. PMID:26019609

Individual Module Maximum Power Point Tracking for a Thermoelectric Generator Systems

DEFF Research Database (Denmark)

Vadstrup, Casper; Chen, Min; Schaltz, Erik

Thermo Electric Generator (TEG) modules are often connected in a series and/or parallel system in order to match the TEG system voltage with the load voltage. However, in order to be able to control the power production of the TEG system a DC/DC converter is inserted between the TEG system...... and the load. The DC/DC converter is under the control of a Maximum Power Point Tracker (MPPT) which insures that the TEG system produces the maximum possible power to the load. However, if the conditions, e.g. temperature, health, etc., of the TEG modules are different each TEG module will not produce its...

Gender differences in game responses during badminton match play.

Science.gov (United States)

Fernandez-Fernandez, Jaime; de la Aleja Tellez, Jose G; Moya-Ramon, Manuel; Cabello-Manrique, David; Mendez-Villanueva, Alberto

2013-09-01

The aim of this study was to evaluate possible gender differences in match play activity pattern [rally duration, rest time between rallies, effective playing time, and strokes performed during a rally] and exercise intensity (heart rate [HR], blood lactate [La], and subjective ratings of perceived exertion [RPE]) during 9 simulated badminton matches in male (n = 8) and female (n = 8) elite junior (16.0 ± 1.4 years) players. Results showed significant differences (all p 0.05; ES = -0.33 to 0.08) were observed between female or male players in average HR (174 ± 7 vs. 170 ± 9 b·min(-1)), %HRmax (89.2 ± 4.0% vs. 85.9 ± 4.3%), La (2.5 ± 1.3 vs. 3.2 ± 1.8 mmol·L(-1)), and RPE values (14.2 ± 1.9 vs. 14.6 ± 1.8) during match play, although male players spent more time (moderate effect sizes) at intensities between 81 and 90% HRmax (35.3 ± 17.9 vs. 25.3 ± 13.6; p < 0.05; ES = 0.64) in the second game. There seemed to be a trend toward an increased playing intensity (i.e., higher HR, La, and RPE) from the first to the second game, highlighting the higher exercise intensity experienced during the last part of the match. The clear between-gender differences in activity patterns induced only slightly different physiological responses.

Efficient Direct-Matching Rectenna Design for RF Power Transfer Applications

Science.gov (United States)

Keyrouz, Shady; Visser, Huib

2013-12-01

This paper presents the design, simulation, fabrication and measurements of a 50 ohm rectenna system. The paper investigates each part (in terms of input impedance) of the rectenna system starting from the antenna, followed by the matching network, to the rectifier. The system consists of an antenna, which captures the transmitted RF signal, connected to a rectifier which converts the AC captured signal into a DC power signal. For maximum power transfer, a matching network is designed between the rectifier and the antenna. At an input power level of -10 dBm, the system is able to achieve an RF/DC power conversion efficiency of 49.7%.

Efficient Direct-Matching Rectenna Design for RF Power Transfer Applications

International Nuclear Information System (INIS)

Keyrouz, Shady; Visser, Huib

2013-01-01

This paper presents the design, simulation, fabrication and measurements of a 50 ohm rectenna system. The paper investigates each part (in terms of input impedance) of the rectenna system starting from the antenna, followed by the matching network, to the rectifier. The system consists of an antenna, which captures the transmitted RF signal, connected to a rectifier which converts the AC captured signal into a DC power signal. For maximum power transfer, a matching network is designed between the rectifier and the antenna. At an input power level of −10 dBm, the system is able to achieve an RF/DC power conversion efficiency of 49.7%

Matching theory

CERN Document Server

Plummer, MD

1986-01-01

This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.

Iris Matching Based on Personalized Weight Map.

Science.gov (United States)

Dong, Wenbo; Sun, Zhenan; Tan, Tieniu

2011-09-01

Iris recognition typically involves three steps, namely, iris image preprocessing, feature extraction, and feature matching. The first two steps of iris recognition have been well studied, but the last step is less addressed. Each human iris has its unique visual pattern and local image features also vary from region to region, which leads to significant differences in robustness and distinctiveness among the feature codes derived from different iris regions. However, most state-of-the-art iris recognition methods use a uniform matching strategy, where features extracted from different regions of the same person or the same region for different individuals are considered to be equally important. This paper proposes a personalized iris matching strategy using a class-specific weight map learned from the training images of the same iris class. The weight map can be updated online during the iris recognition procedure when the successfully recognized iris images are regarded as the new training data. The weight map reflects the robustness of an encoding algorithm on different iris regions by assigning an appropriate weight to each feature code for iris matching. Such a weight map trained by sufficient iris templates is convergent and robust against various noise. Extensive and comprehensive experiments demonstrate that the proposed personalized iris matching strategy achieves much better iris recognition performance than uniform strategies, especially for poor quality iris images.

Statistical Mechanics of a Simplified Bipartite Matching Problem: An Analytical Treatment

Science.gov (United States)

Dell'Erba, Matías Germán

2012-03-01

We perform an analytical study of a simplified bipartite matching problem in which there exists a constant matching energy, and both heterosexual and homosexual pairings are allowed. We obtain the partition function in a closed analytical form and we calculate the corresponding thermodynamic functions of this model. We conclude that the model is favored at high temperatures, for which the probabilities of heterosexual and homosexual pairs tend to become equal. In the limits of low and high temperatures, the system is extensive, however this property is lost in the general case. There exists a relation between the matching energies for which the system becomes more stable under external (thermal) perturbations. As the difference of energies between the two possible matches increases the system becomes more ordered, while the maximum of entropy is achieved when these energies are equal. In this limit, there is a first order phase transition between two phases with constant entropy.

Pattern Discovery in Time-Ordered Data; TOPICAL

International Nuclear Information System (INIS)

CONRAD, GREGORY N.; BRITANIK, JOHN M.; DELAND, SHARON M.; JENKIN, CHRISTINA L.

2002-01-01

This report describes the results of a Laboratory-Directed Research and Development project on techniques for pattern discovery in discrete event time series data. In this project, we explored two different aspects of the pattern matching/discovery problem. The first aspect studied was the use of Dynamic Time Warping for pattern matching in continuous data. In essence, DTW is a technique for aligning time series along the time axis to optimize the similarity measure. The second aspect studied was techniques for discovering patterns in discrete event data. We developed a pattern discovery tool based on adaptations of the A-priori and GSP (Generalized Sequential Pattern mining) algorithms. We then used the tool on three different application areas-unattended monitoring system data from a storage magazine, computer network intrusion detection, and analysis of robot training data

A Maximum Power Transfer Tracking Method for WPT Systems with Coupling Coefficient Identification Considering Two-Value Problem

Directory of Open Access Journals (Sweden)

Xin Dai

2017-10-01

Full Text Available Maximum power transfer tracking (MPTT is meant to track the maximum power point during the system operation of wireless power transfer (WPT systems. Traditionally, MPTT is achieved by impedance matching at the secondary side when the load resistance is varied. However, due to a loosely coupling characteristic, the variation of coupling coefficient will certainly affect the performance of impedance matching, therefore MPTT will fail accordingly. This paper presents an identification method of coupling coefficient for MPTT in WPT systems. Especially, the two-value issue during the identification is considered. The identification approach is easy to implement because it does not require additional circuit. Furthermore, MPTT is easy to realize because only two easily measured DC parameters are needed. The detailed identification procedure corresponding to the two-value issue and the maximum power transfer tracking process are presented, and both the simulation analysis and experimental results verified the identification method and MPTT.

Oscillatory signatures of crossmodal congruence effects: An EEG investigation employing a visuotactile pattern matching paradigm.

Science.gov (United States)

Göschl, Florian; Friese, Uwe; Daume, Jonathan; König, Peter; Engel, Andreas K

2015-08-01

Coherent percepts emerge from the accurate combination of inputs from the different sensory systems. There is an ongoing debate about the neurophysiological mechanisms of crossmodal interactions in the brain, and it has been proposed that transient synchronization of neurons might be of central importance. Oscillatory activity in lower frequency ranges (congruence. Analysis of the behavioral data showed benefits for congruent visuotactile stimulus combinations. Differences in oscillatory dynamics related to crossmodal congruence within the two tasks were observed in the beta-band for crossmodal target detection, as well as in the theta-band for congruence evaluation. Contrasting ongoing activity preceding visuotactile stimulation between the two tasks revealed differences in the alpha- and beta-bands. Source reconstruction of between-task differences showed prominent involvement of premotor cortex, supplementary motor area, somatosensory association cortex and the supramarginal gyrus. These areas not only exhibited more involvement in the pre-stimulus interval for target detection compared to congruence evaluation, but were also crucially involved in post-stimulus differences related to crossmodal stimulus congruence within the detection task. These results add to the increasing evidence that low frequency oscillations are functionally relevant for integration in distributed brain networks, as demonstrated for crossmodal interactions in visuotactile pattern matching in the current study. Copyright © 2015 Elsevier Inc. All rights reserved.

A Frequency Matching Method: Solving Inverse Problems by Use of Geologically Realistic Prior Information

DEFF Research Database (Denmark)

Lange, Katrine; Frydendall, Jan; Cordua, Knud Skou

2012-01-01

The frequency matching method defines a closed form expression for a complex prior that quantifies the higher order statistics of a proposed solution model to an inverse problem. While existing solution methods to inverse problems are capable of sampling the solution space while taking into account...... arbitrarily complex a priori information defined by sample algorithms, it is not possible to directly compute the maximum a posteriori model, as the prior probability of a solution model cannot be expressed. We demonstrate how the frequency matching method enables us to compute the maximum a posteriori...... solution model to an inverse problem by using a priori information based on multiple point statistics learned from training images. We demonstrate the applicability of the suggested method on a synthetic tomographic crosshole inverse problem....

Design of Asymmetrical Relay Resonators for Maximum Efficiency of Wireless Power Transfer

Directory of Open Access Journals (Sweden)

Bo-Hee Choi

2016-01-01

Full Text Available This paper presents a new design method of asymmetrical relay resonators for maximum wireless power transfer. A new design method for relay resonators is demanded because maximum power transfer efficiency (PTE is not obtained at the resonant frequency of unit resonator. The maximum PTE for relay resonators is obtained at the different resonances of unit resonator. The optimum design of asymmetrical relay is conducted by both the optimum placement and the optimum capacitance of resonators. The optimum placement is found by scanning the positions of the relays and optimum capacitance can be found by using genetic algorithm (GA. The PTEs are enhanced when capacitance is optimally designed by GA according to the position of relays, respectively, and then maximum efficiency is obtained at the optimum placement of relays. The capacitance of the second resonator to nth resonator and the load resistance should be determined for maximum efficiency while the capacitance of the first resonator and the source resistance are obtained for the impedance matching. The simulated and measured results are in good agreement.

Study of the variation of maximum beam size with quadrupole gradient in the FMIT drift tube linac

International Nuclear Information System (INIS)

Boicourt, G.P.; Jameson, R.A.

1981-01-01

The sensitivity of maximum beam size to input mismatch is studied as a function of quadrupole gradient in a short, high-current, drift-tube linac (DTL), for two presriptions: constant phase advance with constant filling factor; and constant strength with constant-length quads. Numerical study using PARMILA shows that the choice of quadrupole strength that minimizes the maximum transverse size of the matched beam through subsequent cells of the linac tends to be most sensitive to input mismatch. However, gradients exist nearby that result in almost-as-small beams over a suitably broad range of mismatch. The study was used to choose the initial gradient for the DTL portion of the Fusion Material Irradiation Test (FMIT) linac. The matching required across quad groups is also discussed

Scanless multitarget-matching multiphoton excitation fluorescence microscopy

Directory of Open Access Journals (Sweden)

Junpeng Qiu

2018-03-01

Full Text Available Using the combination of a reflective blazed grating and a reflective phase-only diffractive spatial light modulator (SLM, scanless multitarget-matching multiphoton excitation fluorescence microscopy (SMTM-MPM was achieved. The SLM shaped an incoming mode-locked, near-infrared Ti:sapphire laser beam into an excitation pattern with addressable shapes and sizes that matched the samples of interest in the field of view. Temporal and spatial focusing were simultaneously realized by combining an objective lens and a blazed grating. The fluorescence signal from illuminated areas was recorded by a two-dimensional sCMOS camera. Compared with a conventional temporal focusing multiphoton microscope, our microscope achieved effective use of the laser power and decreased photodamage with higher axial resolution.

An improved principal component analysis based region matching method for fringe direction estimation

Science.gov (United States)

He, A.; Quan, C.

2018-04-01

The principal component analysis (PCA) and region matching combined method is effective for fringe direction estimation. However, its mask construction algorithm for region matching fails in some circumstances, and the algorithm for conversion of orientation to direction in mask areas is computationally-heavy and non-optimized. We propose an improved PCA based region matching method for the fringe direction estimation, which includes an improved and robust mask construction scheme, and a fast and optimized orientation-direction conversion algorithm for the mask areas. Along with the estimated fringe direction map, filtered fringe pattern by automatic selective reconstruction modification and enhanced fast empirical mode decomposition (ASRm-EFEMD) is used for Hilbert spiral transform (HST) to demodulate the phase. Subsequently, windowed Fourier ridge (WFR) method is used for the refinement of the phase. The robustness and effectiveness of proposed method are demonstrated by both simulated and experimental fringe patterns.

On the uniqueness of color patterns in raptor feathers

Science.gov (United States)

Ellis, D.H.

2009-01-01

For this study, I compared sequentially molted feathers for a few captive raptors from year to year and symmetrically matched feathers (left/right pairs) for many raptors to see if color patterns of sequential feather pairs were identical or if symmetrical pairs were mirror-image identical. Feather pairs were found to be identical only when without color pattern (e.g., the all-white rectrices of Bald Eagles [Haliaeetus leucocephalus]). Complex patterns were not closely matched, but some simple patterns were sometimes closely matched, although not identical. Previous claims that complex color patterns in feather pairs are fingerprint-identical (and therefore that molted feathers from wild raptors can be used to identify breeding adults from year to year with certainty) were found to be untrue: each feather is unique. Although it is unwise to be certain of bird of origin using normal feathers, abnormal feathers can often be so used. ?? 2009 The Raptor Research Foundation, Inc.

Generative models versus underlying symmetries to explain biological pattern.

Science.gov (United States)

Frank, S A

2014-06-01

Mathematical models play an increasingly important role in the interpretation of biological experiments. Studies often present a model that generates the observations, connecting hypothesized process to an observed pattern. Such generative models confirm the plausibility of an explanation and make testable hypotheses for further experiments. However, studies rarely consider the broad family of alternative models that match the same observed pattern. The symmetries that define the broad class of matching models are in fact the only aspects of information truly revealed by observed pattern. Commonly observed patterns derive from simple underlying symmetries. This article illustrates the problem by showing the symmetry associated with the observed rate of increase in fitness in a constant environment. That underlying symmetry reveals how each particular generative model defines a single example within the broad class of matching models. Further progress on the relation between pattern and process requires deeper consideration of the underlying symmetries. © 2014 The Author. Journal of Evolutionary Biology © 2014 European Society For Evolutionary Biology.

Template matching via densities on the roto-translation group

NARCIS (Netherlands)

Bekkers, E.; Loog, M.; Romeny, B. ter Haar; Duits, R.

2018-01-01

We propose a template matching method for the detection of 2D image objects that are characterized by orientation patterns. Our method is based on data representations via orientation scores, which are functions on the space of positions and orientations, and which are obtained via a wavelet-type

Human Identification by Cross-Correlation and Pattern Matching of Personalized Heartbeat: Influence of ECG Leads and Reference Database Size.

Science.gov (United States)

Jekova, Irena; Krasteva, Vessela; Schmid, Ramun

2018-01-27

Human identification (ID) is a biometric task, comparing single input sample to many stored templates to identify an individual in a reference database. This paper aims to present the perspectives of personalized heartbeat pattern for reliable ECG-based identification. The investigations are using a database with 460 pairs of 12-lead resting electrocardiograms (ECG) with 10-s durations recorded at time-instants T1 and T2 > T1 + 1 year. Intra-subject long-term ECG stability and inter-subject variability of personalized PQRST (500 ms) and QRS (100 ms) patterns is quantified via cross-correlation, amplitude ratio and pattern matching between T1 and T2 using 7 features × 12-leads. Single and multi-lead ID models are trained on the first 230 ECG pairs. Their validation on 10, 20, ... 230 reference subjects (RS) from the remaining 230 ECG pairs shows: (i) two best single-lead ID models using lead II for a small population RS = (10-140) with identification accuracy AccID = (89.4-67.2)% and aVF for a large population RS = (140-230) with AccID = (67.2-63.9)%; (ii) better performance of the 6-lead limb vs. the 6-lead chest ID model-(91.4-76.1)% vs. (90.9-70)% for RS = (10-230); (iii) best performance of the 12-lead ID model-(98.4-87.4)% for RS = (10-230). The tolerable reference database size, keeping AccID > 80%, is RS = 30 in the single-lead ID scenario (II); RS = 50 (6 chest leads); RS = 100 (6 limb leads), RS > 230-maximal population in this study (12-lead ECG).

Spatial-temporal changes of maximum and minimum temperatures in the Wei River Basin, China: Changing patterns, causes and implications

Science.gov (United States)

Liu, Saiyan; Huang, Shengzhi; Xie, Yangyang; Huang, Qiang; Leng, Guoyong; Hou, Beibei; Zhang, Ying; Wei, Xiu

2018-05-01

Due to the important role of temperature in the global climate system and energy cycles, it is important to investigate the spatial-temporal change patterns, causes and implications of annual maximum (Tmax) and minimum (Tmin) temperatures. In this study, the Cloud model were adopted to fully and accurately analyze the changing patterns of annual Tmax and Tmin from 1958 to 2008 by quantifying their mean, uniformity, and stability in the Wei River Basin (WRB), a typical arid and semi-arid region in China. Additionally, the cross wavelet analysis was applied to explore the correlations among annual Tmax and Tmin and the yearly sunspots number, Arctic Oscillation, Pacific Decadal Oscillation, and soil moisture with an aim to determine possible causes of annual Tmax and Tmin variations. Furthermore, temperature-related impacts on vegetation cover and precipitation extremes were also examined. Results indicated that: (1) the WRB is characterized by increasing trends in annual Tmax and Tmin, with a more evident increasing trend in annual Tmin, which has a higher dispersion degree and is less uniform and stable than annual Tmax; (2) the asymmetric variations of Tmax and Tmin can be generally explained by the stronger effects of solar activity (primarily), large-scale atmospheric circulation patterns, and soil moisture on annual Tmin than on annual Tmax; and (3) increasing annual Tmax and Tmin have exerted strong influences on local precipitation extremes, in terms of their duration, intensity, and frequency in the WRB. This study presents new analyses of Tmax and Tmin in the WRB, and the findings may help guide regional agricultural production and water resources management.

Retrieval of sea surface velocities using sequential ocean colour monitor (OCM) data

Digital Repository Service at National Institute of Oceanography (India)

Prasad, J.S.; Rajawat, A.S.; Pradhan, Y.; Chauhan, O.S.; Nayak, S.R.

velocities has been developed. The method is based on matching suspended sediment dispersion patterns, in sequential two time lapsed images. The pattern matching is performed on atmospherically corrected and geo-referenced sequential pair of images by Maximum...

Effects of Pattern Matching, Pattern Discrimination, and Experience in the Development of Diagnostic Expertise.

Science.gov (United States)

Papa, Frank; And Others

1990-01-01

In this study an artificial intelligence assessment tool used disease-by-feature frequency estimates to create disease prototypes for nine common causes of acute chest pain. The tool then used each subject's prototypes and a pattern-recognition-based decision-making mechanism to diagnose 18 myocardial infarction cases. (MLW)

A Frequency Matching Method for Generation of a Priori Sample Models from Training Images

DEFF Research Database (Denmark)

Lange, Katrine; Cordua, Knud Skou; Frydendall, Jan

2011-01-01

This paper presents a Frequency Matching Method (FMM) for generation of a priori sample models based on training images and illustrates its use by an example. In geostatistics, training images are used to represent a priori knowledge or expectations of models, and the FMM can be used to generate...... new images that share the same multi-point statistics as a given training image. The FMM proceeds by iteratively updating voxel values of an image until the frequency of patterns in the image matches the frequency of patterns in the training image; making the resulting image statistically...... indistinguishable from the training image....

76 FR 5235 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA Internal Match)-Match Number 1014

Science.gov (United States)

2011-01-28

...; Computer Matching Program (SSA Internal Match)--Match Number 1014 AGENCY: Social Security Administration... regarding protections for such persons. The Privacy Act, as amended, regulates the use of computer matching....C. 552a, as amended, and the provisions of the Computer Matching and Privacy Protection Act of 1988...

Technical performance and match-to-match variation in elite football teams.

Science.gov (United States)

Liu, Hongyou; Gómez, Miguel-Angel; Gonçalves, Bruno; Sampaio, Jaime

2016-01-01

Recent research suggests that match-to-match variation adds important information to performance descriptors in team sports, as it helps measure how players fine-tune their tactical behaviours and technical actions to the extreme dynamical environments. The current study aims to identify the differences in technical performance of players from strong and weak teams and to explore match-to-match variation of players' technical match performance. Performance data of all the 380 matches of season 2012-2013 in the Spanish First Division Professional Football League were analysed. Twenty-one performance-related match actions and events were chosen as variables in the analyses. Players' technical performance profiles were established by unifying count values of each action or event of each player per match into the same scale. Means of these count values of players from Top3 and Bottom3 teams were compared and plotted into radar charts. Coefficient of variation of each match action or event within a player was calculated to represent his match-to-match variation of technical performance. Differences in the variation of technical performances of players across different match contexts (team and opposition strength, match outcome and match location) were compared. All the comparisons were achieved by the magnitude-based inferences. Results showed that technical performances differed between players of strong and weak teams from different perspectives across different field positions. Furthermore, the variation of the players' technical performance is affected by the match context, with effects from team and opposition strength greater than effects from match location and match outcome.

PHYSIOLOGICAL RESPONSES OF ELITE JUNIOR AUSTRALIAN RULES FOOTBALLERS DURING MATCH-PLAY

Directory of Open Access Journals (Sweden)

James P. Veale

2009-09-01

Full Text Available Australian Football (AF is Australia's major football code. Despite research in other football codes, to date, no data has been published on the physiological responses of AF players during match play. Fifteen athletes (17.28 ± 0.76 yrs participated in four pre-season matches, sanctioned by Australian Football League (AFL Victoria, investigating Heart Rate (HR, Blood Lactate (BLa, Core Temperature (Tcore, and Hydration status. Match HR was measured continuously using HR monitors. BLa was measured via finger prick lancet at the end of each quarter of play. Tcore was measured by use of ingestible temperature sensor and measured wirelessly at the end of each quarter of play. Hydration status was measured using refractometry, measuring urine specific gravity, and body weight pre and post-match. Environmental conditions were measured continuously during matches. Results of HR responses showed a high exertion of players in the 85-95% maximum HR range. Elevated mean BLa levels, compared to rest, were observed in all players over the duration of the matches (p = 0.007. Mean Tcore rose 0.68 °C between start and end of matches. Mean USG increased between 0.008 g/ml (p = 0.001 with mean body weight decreasing 1.88 kg (p = 0.001. This study illustrates physiological responses in junior AF players playing in the heat as well as providing physiological data for consideration by AF coaching staff when developing specific training programs. Continued research should consider physiological measurements under varying environments, and at all playing levels of AF, to ascertain full physiological responses during AF matches.

Network-level accident-mapping: Distance based pattern matching using artificial neural network.

Science.gov (United States)

Deka, Lipika; Quddus, Mohammed

2014-04-01

The objective of an accident-mapping algorithm is to snap traffic accidents onto the correct road segments. Assigning accidents onto the correct segments facilitate to robustly carry out some key analyses in accident research including the identification of accident hot-spots, network-level risk mapping and segment-level accident risk modelling. Existing risk mapping algorithms have some severe limitations: (i) they are not easily 'transferable' as the algorithms are specific to given accident datasets; (ii) they do not perform well in all road-network environments such as in areas of dense road network; and (iii) the methods used do not perform well in addressing inaccuracies inherent in and type of road environment. The purpose of this paper is to develop a new accident mapping algorithm based on the common variables observed in most accident databases (e.g. road name and type, direction of vehicle movement before the accident and recorded accident location). The challenges here are to: (i) develop a method that takes into account uncertainties inherent to the recorded traffic accident data and the underlying digital road network data, (ii) accurately determine the type and proportion of inaccuracies, and (iii) develop a robust algorithm that can be adapted for any accident set and road network of varying complexity. In order to overcome these challenges, a distance based pattern-matching approach is used to identify the correct road segment. This is based on vectors containing feature values that are common in the accident data and the network data. Since each feature does not contribute equally towards the identification of the correct road segments, an ANN approach using the single-layer perceptron is used to assist in "learning" the relative importance of each feature in the distance calculation and hence the correct link identification. The performance of the developed algorithm was evaluated based on a reference accident dataset from the UK confirming that

Maximum mutual information regularized classification

KAUST Repository

Wang, Jim Jing-Yan

2014-09-07

In this paper, a novel pattern classification approach is proposed by regularizing the classifier learning to maximize mutual information between the classification response and the true class label. We argue that, with the learned classifier, the uncertainty of the true class label of a data sample should be reduced by knowing its classification response as much as possible. The reduced uncertainty is measured by the mutual information between the classification response and the true class label. To this end, when learning a linear classifier, we propose to maximize the mutual information between classification responses and true class labels of training samples, besides minimizing the classification error and reducing the classifier complexity. An objective function is constructed by modeling mutual information with entropy estimation, and it is optimized by a gradient descend method in an iterative algorithm. Experiments on two real world pattern classification problems show the significant improvements achieved by maximum mutual information regularization.

Maximum mutual information regularized classification

KAUST Repository

Wang, Jim Jing-Yan; Wang, Yi; Zhao, Shiguang; Gao, Xin

2014-01-01

In this paper, a novel pattern classification approach is proposed by regularizing the classifier learning to maximize mutual information between the classification response and the true class label. We argue that, with the learned classifier, the uncertainty of the true class label of a data sample should be reduced by knowing its classification response as much as possible. The reduced uncertainty is measured by the mutual information between the classification response and the true class label. To this end, when learning a linear classifier, we propose to maximize the mutual information between classification responses and true class labels of training samples, besides minimizing the classification error and reducing the classifier complexity. An objective function is constructed by modeling mutual information with entropy estimation, and it is optimized by a gradient descend method in an iterative algorithm. Experiments on two real world pattern classification problems show the significant improvements achieved by maximum mutual information regularization.

State of otolaryngology match: has competition increased since the "early" match?

Science.gov (United States)

Cabrera-Muffly, Cristina; Sheeder, Jeanelle; Abaza, Mona

2015-05-01

To examine fluctuations in supply and demand of otolaryngology residency positions after the shift from an "early match" coordinated by the San Francisco match to a "conventional" matching process through the National Residency Matching Program (NRMP). To determine whether competition among otolaryngology residency positions have changed during this time frame. Database analysis. Matching statistics from 1998 to 2013 were obtained for all first-year residency positions through the NRMP. Matching statistics from 1998 to 2005 were obtained for otolaryngology residency positions through the San Francisco match. Univariate analysis was performed, with a P value less than .05 determined as significant. The number of otolaryngology positions and applicants remained proportional to the overall number of positions and applicants in the NRMP match. Otolaryngology applicants per position and the matching rate of all applicants did not change between the 2 time periods studied. The overall match rate of US seniors applying to otolaryngology did not change, while the match rate of non-US seniors decreased significantly following initiation of the conventional match. There was no significant change in United States Medical Licensing Exam step 1 scores or percentage of unfilled otolaryngology residency positions between the 2 time periods. When comparing the early versus conventional otolaryngology match time periods, the only major change was the decreased percentage of matching among non-US senior applicants. Despite a significant shift in match timing after 2006, the supply, demand, and competitiveness of otolaryngology residency positions have not changed significantly. © American Academy of Otolaryngology—Head and Neck Surgery Foundation 2015.

Spectral matching research for light-emitting diode-based neonatal jaundice therapeutic device light source

Science.gov (United States)

Gan, Ruting; Guo, Zhenning; Lin, Jieben

2015-09-01

To decrease the risk of bilirubin encephalopathy and minimize the need for exchange transfusions, we report a novel design for light source of light-emitting diode (LED)-based neonatal jaundice therapeutic device (NJTD). The bilirubin absorption spectrum in vivo was regarded as target. Based on spectral constructing theory, we used commercially available LEDs with different peak wavelengths and full width at half maximum as matching light sources. Simple genetic algorithm was first proposed as the spectral matching method. The required LEDs number at each peak wavelength was calculated, and then, the commercial light source sample model of the device was fabricated to confirm the spectral matching technology. In addition, the corresponding spectrum was measured and the effect was analyzed finally. The results showed that fitted spectrum was very similar to the target spectrum with 98.86 % matching degree, and the actual device model has a spectrum close to the target with 96.02 % matching degree. With higher fitting degree and efficiency, this matching algorithm is very suitable for light source matching technology of LED-based spectral distribution, and bilirubin absorption spectrum in vivo will be auspicious candidate for the target spectrum of new LED-based NJTD light source.

Impact of a soccer match on the cardiac autonomic control of referees.

Science.gov (United States)

Boullosa, Daniel Alexandre; Abreu, Laurinda; Tuimil, José Luis; Leicht, Anthony Scott

2012-06-01

The purpose of this study was to assess the effect of a soccer match on the cardiac autonomic control of heart rate (HR) in soccer referees. Sixteen Spanish regional and third division referees (11 males: 26 ± 7 years, 74.4 ± 4.1 kg, 178 ± 3 cm, Yo-Yo IR1 ~600-1,560 m; 5 females: 22 ± 3 years, 59.3 ± 4.8 kg, 158 ± 8 cm, Yo-Yo IR1 ~200-520 m) participated with 24-h HR recordings measured with a Polar RS800 during a rest and a match day. Autonomic control of HR was assessed from HR variability (HRV) analysis. Inclusion of a soccer match (92.5% spent at >75% maximum HR) reduced pre-match (12:00-17:00 hours; small to moderate), post-match (19:00-00:00 hours; moderate to almost perfect), and night-time (00:00-05:00 hours; small to moderate) HRV. Various moderate-to-large correlations were detected between resting HRV and the rest-to-match day difference in HRV. The rest-to-match day differences of low and high-frequency bands ratio (LF/HF) and HR in the post-match period were moderately correlated with time spent at different exercise intensities. Yo-Yo IR1 performance was highly correlated with jump capacity and peak lactate, but not with any HRV parameter. These results suggest that a greater resting HRV may allow referees to tolerate stresses during a match day with referees who spent more time at higher intensities during matches exhibiting a greater LF/HF increment in the post-match period. The relationship between match activities, [Formula: see text] and HR recovery kinetics in referees and team sport athletes of different competitive levels remains to be clarified.

Hypothesis Support Mechanism for Mid-Level Visual Pattern Recognition

Science.gov (United States)

Amador, Jose J (Inventor)

2007-01-01

A method of mid-level pattern recognition provides for a pose invariant Hough Transform by parametrizing pairs of points in a pattern with respect to at least two reference points, thereby providing a parameter table that is scale- or rotation-invariant. A corresponding inverse transform may be applied to test hypothesized matches in an image and a distance transform utilized to quantify the level of match.

Accurate switching intensities and length scales in quasi-phase-matched materials

DEFF Research Database (Denmark)

Bang, Ole; Graversen, Torben Winther; Corney, Joel Frederick

2001-01-01

We consider unseeded typeI second-harmonic generation in quasi-phase-matched quadratic nonlinear materials and derive an accurate analytical expression for the evolution of the average intensity. The intensity- dependent nonlinear phase mismatch that is due to the cubic nonlinearity induced...... by quasi phase matching is found. The equivalent formula for the intensity of maximum conversion, the crossing of which changes the one-period nonlinear phase shift of the fundamental abruptly by p , corrects earlier estimates [Opt.Lett. 23, 506 (1998)] by a factor of 5.3. We find the crystal lengths...... that are necessary to obtain an optimal flat phase versus intensity response on either side of this separatrix intensity....

Excess Readmission vs Excess Penalties: Maximum Readmission Penalties as a Function of Socioeconomics and Geography.

Science.gov (United States)

Caracciolo, Chris; Parker, Devin; Marshall, Emily; Brown, Jeremiah

2017-08-01

The Hospital Readmission Reduction Program (HRRP) penalizes hospitals with "excess" readmissions up to 3% of Medicare reimbursement. Approximately 75% of eligible hospitals received penalties, worth an estimated $428 million, in fiscal year 2015. To identify demographic and socioeconomic disparities between matched and localized maximum-penalty and no-penalty hospitals. A case-control study in which cases included were hospitals to receive the maximum 3% penalty under the HRRP during the 2015 fiscal year. Controls were drawn from no-penalty hospitals and matched to cases by hospital characteristics (primary analysis) or geographic proximity (secondary analysis). A selectiion of 3383 US hospitals eligible for HRRP. Thirty-nine case and 39 control hospitals from the HRRP cohort. Socioeconomic status variables were collected by the American Community Survey. Hospital and health system characteristics were drawn from Centers for Medicare and Medicaid Services, American Hospital Association, and Dartmouth Atlas of Health Care. The statistical analysis was conducted using Student t tests. Thirty-nine hospitals received a maximum penalty. Relative to controls, maximum-penalty hospitals in counties with lower SES profiles are defined by increased poverty rates (19.1% vs 15.5%, = 0.015) and lower rates of high school graduation (82.2% vs 87.5%, = 0.001). County level age, sex, and ethnicity distributions were similar between cohorts. Cases were more likely than controls to be in counties with low socioeconomic status; highlighting potential unintended consequences of national benchmarks for phenomena underpinned by environmental factors; specifically, whether maximum penalties under the HRRP are a consequence of underperforming hospitals or a manifestation of underserved communities. © 2017 Society of Hospital Medicine

Matching and correlation computations in stereoscopic depth perception.

Science.gov (United States)

Doi, Takahiro; Tanabe, Seiji; Fujita, Ichiro

2011-03-02

A fundamental task of the visual system is to infer depth by using binocular disparity. To encode binocular disparity, the visual cortex performs two distinct computations: one detects matched patterns in paired images (matching computation); the other constructs the cross-correlation between the images (correlation computation). How the two computations are used in stereoscopic perception is unclear. We dissociated their contributions in near/far discrimination by varying the magnitude of the disparity across separate sessions. For small disparity (0.03°), subjects performed at chance level to a binocularly opposite-contrast (anti-correlated) random-dot stereogram (RDS) but improved their performance with the proportion of contrast-matched (correlated) dots. For large disparity (0.48°), the direction of perceived depth reversed with an anti-correlated RDS relative to that for a correlated one. Neither reversed nor normal depth was perceived when anti-correlation was applied to half of the dots. We explain the decision process as a weighted average of the two computations, with the relative weight of the correlation computation increasing with the disparity magnitude. We conclude that matching computation dominates fine depth perception, while both computations contribute to coarser depth perception. Thus, stereoscopic depth perception recruits different computations depending on the disparity magnitude.

Modelling relationships between match events and match outcome in elite football.

Science.gov (United States)

Liu, Hongyou; Hopkins, Will G; Gómez, Miguel-Angel

2016-08-01

Identifying match events that are related to match outcome is an important task in football match analysis. Here we have used generalised mixed linear modelling to determine relationships of 16 football match events and 1 contextual variable (game location: home/away) with the match outcome. Statistics of 320 close matches (goal difference ≤ 2) of season 2012-2013 in the Spanish First Division Professional Football League were analysed. Relationships were evaluated with magnitude-based inferences and were expressed as extra matches won or lost per 10 close matches for an increase of two within-team or between-team standard deviations (SD) of the match event (representing effects of changes in team values from match to match and of differences between average team values, respectively). There was a moderate positive within-team effect from shots on target (3.4 extra wins per 10 matches; 99% confidence limits ±1.0), and a small positive within-team effect from total shots (1.7 extra wins; ±1.0). Effects of most other match events were related to ball possession, which had a small negative within-team effect (1.2 extra losses; ±1.0) but a small positive between-team effect (1.7 extra wins; ±1.4). Game location showed a small positive within-team effect (1.9 extra wins; ±0.9). In analyses of nine combinations of team and opposition end-of-season rank (classified as high, medium, low), almost all between-team effects were unclear, while within-team effects varied depending on the strength of team and opposition. Some of these findings will be useful to coaches and performance analysts when planning training sessions and match tactics.

Job Searchers, Job Matches and the Elasticity of Matching

NARCIS (Netherlands)

Broersma, L.; van Ours, J.C.

1998-01-01

This paper stresses the importance of a specification of the matching function in which the measure of job matches corresponds to the measure of job searchers. In many empirical studies on the matching function this requirement has not been fulfilled because it is difficult to find information about

78 FR 73195 - Privacy Act of 1974: CMS Computer Matching Program Match No. 2013-01; HHS Computer Matching...

Science.gov (United States)

2013-12-05

... 1974: CMS Computer Matching Program Match No. 2013-01; HHS Computer Matching Program Match No. 1312 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS... Privacy Act of 1974 (5 U.S.C. 552a), as amended, this notice announces the renewal of a CMP that CMS plans...

Family Patterns Associated with Anorexia Nervosa.

Science.gov (United States)

Grigg, Darryl N.; And Others

1989-01-01

Used family systems perspective to explore familial transactional patterns related to anorexia nervosa among 22 families with an anorexic child and 22 matched control families. Identified 7 family groups with unique family dynamics differentiating one from another. With no single family pattern characterizing families of anorexics, results…

Influence of a Prolonged Tennis Match Play on Serve Biomechanics.

Directory of Open Access Journals (Sweden)

Caroline Martin

Full Text Available The aim of this study was to quantify kinematic, kinetic and performance changes that occur in the serve throughout a prolonged tennis match play. Serves of eight male advanced tennis players were recorded with a motion capture system before, at mid-match, and after a 3-hour tennis match. Before and after each match, electromyographic data of 8 upper limb muscles obtained during isometric maximal voluntary contraction were compared to determine the presence of muscular fatigue. Vertical ground reaction forces, rating of perceived exertion, ball speed, and ball impact height were measured. Kinematic and upper limb kinetic variables were computed. The results show decrease in mean power frequency values for several upper limb muscles that is an indicator of local muscular fatigue. Decreases in serve ball speed, ball impact height, maximal angular velocities and an increase in rating of perceived exertion were also observed between the beginning and the end of the match. With fatigue, the majority of the upper limb joint kinetics decreases at the end of the match. No change in timing of maximal angular velocities was observed between the beginning and the end of the match. A prolonged tennis match play may induce fatigue in upper limb muscles, which decrease performance and cause changes in serve maximal angular velocities and joint kinetics. The consistency in timing of maximal angular velocities suggests that advanced tennis players are able to maintain the temporal pattern of their serve technique, in spite of the muscular fatigue development.

SU-E-T-622: Identification and Improvement of Patients Eligible for Dose Escalation with Matched Plans

International Nuclear Information System (INIS)

Bush, K; Holcombe, C; Kapp, D; Buyyounouski, M; Hancock, S; Xing, L; Atwood, T; King, M

2014-01-01

Purpose: Radiation-therapy dose-escalation beyond 80Gy may improve tumor control rates for patients with localized prostate cancer. Since toxicity remains a concern, treatment planners must achieve dose-escalation while still adhering to dose-constraints for surrounding structures. Patientmatching is a machine-learning technique that identifies prior patients that dosimetrically match DVH parameters of target volumes and critical structures prior to actual treatment planning. We evaluated the feasibility of patient-matching in (1)identifying candidates for safe dose-escalation; and (2)improving DVH parameters for critical structures in actual dose-escalated plans. Methods: We analyzed DVH parameters from 319 historical treatment plans to determine which plans could achieve dose-escalation (8640cGy) without exceeding Zelefsky dose-constraints (rectal and bladder V47Gy<53%, and V75.6Gy<30%, max-point dose to rectum of 8550cGy, max dose to PTV< 9504cGy). We then estimated the percentage of cases that could achieve safe dose-escalation using software that enables patient matching (QuickMatch, Siris Medical, Mountain View, CA). We then replanned a case that had violated DVH constraints with DVH parameters from patient matching, in order to determine whether this previously unacceptable plan could be made eligible with this automated technique. Results: Patient-matching improved the percentage of patients eligible for dose-escalation from 40% to 63% (p=4.7e-4, t-test). Using a commercial optimizer augmented with patient-matching, we demonstrated a case where patient-matching improved the toxicity-profile such that dose-escalation would have been possible; this plan was rapidly achieved using patientmatching software. In this patient, all lower-dose constraints were met with both the denovo and patient-matching plan. In the patient-matching plan, maximum dose to the rectum was 8385cGy, while the denovo plan failed to meet the maximum rectal constraint at 8571c

Reconstruction of Laser-Induced Surface Topography from Electron Backscatter Diffraction Patterns.

Science.gov (United States)

Callahan, Patrick G; Echlin, McLean P; Pollock, Tresa M; De Graef, Marc

2017-08-01

We demonstrate that the surface topography of a sample can be reconstructed from electron backscatter diffraction (EBSD) patterns collected with a commercial EBSD system. This technique combines the location of the maximum background intensity with a correction from Monte Carlo simulations to determine the local surface normals at each point in an EBSD scan. A surface height map is then reconstructed from the local surface normals. In this study, a Ni sample was machined with a femtosecond laser, which causes the formation of a laser-induced periodic surface structure (LIPSS). The topography of the LIPSS was analyzed using atomic force microscopy (AFM) and reconstructions from EBSD patterns collected at 5 and 20 kV. The LIPSS consisted of a combination of low frequency waviness due to curtaining and high frequency ridges. The morphology of the reconstructed low frequency waviness and high frequency ridges matched the AFM data. The reconstruction technique does not require any modification to existing EBSD systems and so can be particularly useful for measuring topography and its evolution during in situ experiments.

Local Search Approaches in Stable Matching Problems

Directory of Open Access Journals (Sweden)

Toby Walsh

2013-10-01

Full Text Available The stable marriage (SM problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical formulation, n men and n women express their preferences (via a strict total order over the members of the other sex. Solving an SM problem means finding a stable marriage where stability is an envy-free notion: no man and woman who are not married to each other would both prefer each other to their partners or to being single. We consider both the classical stable marriage problem and one of its useful variations (denoted SMTI (Stable Marriage with Ties and Incomplete lists where the men and women express their preferences in the form of an incomplete preference list with ties over a subset of the members of the other sex. Matchings are permitted only with people who appear in these preference lists, and we try to find a stable matching that marries as many people as possible. Whilst the SM problem is polynomial to solve, the SMTI problem is NP-hard. We propose to tackle both problems via a local search approach, which exploits properties of the problems to reduce the size of the neighborhood and to make local moves efficiently. We empirically evaluate our algorithm for SM problems by measuring its runtime behavior and its ability to sample the lattice of all possible stable marriages. We evaluate our algorithm for SMTI problems in terms of both its runtime behavior and its ability to find a maximum cardinality stable marriage. Experimental results suggest that for SM problems, the number of steps of our algorithm grows only as O(n log(n, and that it samples very well the set of all stable marriages. It is thus a fair and efficient approach to generate stable marriages. Furthermore, our approach for SMTI problems is able to solve large problems, quickly returning stable matchings of large and often optimal size, despite the

Foods Served in Child Care Facilities Participating in the Child and Adult Care Food Program: Menu Match and Agreement with the New Meal Patterns and Best Practices.

Science.gov (United States)

Dave, Jayna M; Cullen, Karen W

2018-02-20

To assess the agreement of posted menus with foods served to 3- to 5-year-old children attending federal Child and Adult Care Food Program (CACFP)-enrolled facilities, and the degree to which the facilities met the new meal patterns and best practices. On-site observations and menu coding. Nine early care and education centers. Agreement of posted menus with foods served, and comparison of foods served and consumed with the new CACFP meal guidelines and best practices. Data were compiled for each meal (breakfast, lunch, and snacks). Frequencies and percentages of agreement with the posted menu (coded matches, substitutions, additions, and omissions) were calculated for each food component in the CACFP menu guidelines. Menu total match was created by summing the menu match plus acceptable substitutions. Menus were compared with the new CACFP meal guidelines and best practices. The match between the posted menus and foods actually served to children at breakfast, lunch, and snack was high when the acceptable menu substitutions were considered (approximately 94% to 100% total match). Comparing the menus with the new meal guidelines and best practices, the 1 guideline that was fully implemented was serving only unflavored, low-fat, or 1% milk; fruit and vegetable guidelines were partially met; fruit juice was not served often, nor were legumes; the guideline for 1 whole grain-rich serving/d was not met; and regular beef and full-fat cheese products were commonly served. Early care and education centers enrolled in CACFP provided meals that met the current CACFP guidelines. Some menu improvements are needed for the centers to meet the new guidelines and best practices. Copyright © 2018 Society for Nutrition Education and Behavior. Published by Elsevier Inc. All rights reserved.

The effect of an acute sleep hygiene strategy following a late-night soccer match on recovery of players.

Science.gov (United States)

Fullagar, Hugh; Skorski, Sabrina; Duffield, Rob; Meyer, Tim

2016-01-01

Elite soccer players are at risk of reduced recovery following periods of sleep disruption, particularly following late-night matches. It remains unknown whether improving sleep quality or quantity in such scenarios can improve post-match recovery. Therefore, the aim of this study was to investigate the effect of an acute sleep hygiene strategy (SHS) on physical and perceptual recovery of players following a late-night soccer match. In a randomised cross-over design, two highly-trained amateur teams (20 players) played two late-night (20:45) friendly matches against each other seven days apart. Players completed an SHS after the match or proceeded with their normal post-game routine (NSHS). Over the ensuing 48 h, objective sleep parameters (sleep duration, onset latency, efficiency, wake episodes), countermovement jump (CMJ; height, force production), YoYo Intermittent Recovery test (YYIR2; distance, maximum heart rate, lactate), venous blood (creatine kinase, urea and c-reactive protein) and perceived recovery and stress markers were collected. Sleep duration was significantly greater in SHS compared to NSHS on match night (P = 0.002, d = 1.50), with NSHS significantly less than baseline (P sleep onset latency (P = 0.12), efficiency (P = 0.39) or wake episode duration (P = 0.07). No significant differences were observed between conditions for any physical performance or venous blood marker (all P > 0.05); although maximum heart rate during the YYIR2 was significantly higher in NSHS than SHS at 36 h post-match (P = 0.01; d = 0.81). There were no significant differences between conditions for perceptual "overall recovery" (P = 0.47) or "overall stress" (P = 0.17). Overall, an acute SHS improved sleep quantity following a late-night soccer match; albeit without any improvement in physical performance, perceptual recovery or blood-borne markers of muscle damage and inflammation.

Fast Partial Evaluation of Pattern Matching in Strings

DEFF Research Database (Denmark)

Ager, Mads Sig; Danvy, Olivier; Rohde, Henning Korsholm

2003-01-01

We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by partial evaluation of a quadratic-time string matcher with respect to a pattern string. Although it has been known for 15 years how to obtain this linear matcher by partial evaluation of a quadratic one, how...... to obtain it in linear time has remained an open problem.Obtaining a linear matcher by partial evaluation of a quadratic one is achieved by performing its backtracking at specialization time and memoizing its results. We show (1) how to rewrite the source matcher such that its static intermediate...... computations can be shared at specialization time and (2) how to extend the memoization capabilities of a partial evaluator to static functions. Such an extended partial evaluator, if its memoization is implemented efficiently, specializes the rewritten source matcher in linear time....

Pattern formation without diffraction matching in optical parametric oscillators with a metamaterial.

Science.gov (United States)

Tassin, Philippe; Van der Sande, Guy; Veretennicoff, Irina; Kockaert, Pascal; Tlidi, Mustapha

2009-05-25

We consider a degenerate optical parametric oscillator containing a left-handed material. We show that the inclusion of a left-handed material layer allows for controlling the strength and sign of the diffraction coefficient at either the pump or the signal frequency. Subsequently, we demonstrate the existence of stable dissipative structures without diffraction matching, i.e., without the usual relationship between the diffraction coefficients of the signal and pump fields. Finally, we investigate the size scaling of these light structures with decreasing diffraction strength.

Evaluation of the hydrological cycle of MATCH driven by NCEP reanalysis data: comparison with GOME water vapor measurements

Directory of Open Access Journals (Sweden)

R. Lang

2005-01-01

Full Text Available This study examines two key parameters of the hydrological cycle, water vapor (WV and precipitation rates (PR, as modelled by the chemistry transport model MATCH (Model of Atmospheric Transport and Chemistry driven by National Centers for Environmental Prediction (NCEP reanalysis data (NRA. For model output evaluation we primarily employ WV total column data from the Global Ozone Monitoring Experiment (GOME on ERS-2, which is the only instrument capable measuring WV on a global scale and over all surface types with a substantial data record from 1995 to the present. We find that MATCH and NRA WV and PR distributions are closely related, but that significant regional differences in both parameters exist in magnitude and distribution patterns when compared to the observations. We also find that WV residual patterns between model and observations show remarkable similarities to residuals observed in the PR when comparing MATCH and NRA output to observations comprised by the Global Precipitation Climatology Project (GPCP. We conclude that deficiencies in model parameters shared by MATCH and NRA, like in the surface evaporation rates and regional transport patterns, are likely to lead to the observed differences. Monthly average regional differences between MATCH modelled WV columns and the observations can be as large as 2 cm, based on the analysis of three years. Differences in the global mean WV values are, however, below 0.1 cm. Regional differences in the PR between MATCH and GPCP can be above 0.5 cm per day and MATCH computes on average a higher PR than what has been observed. The lower water vapor content of MATCH is related to shorter model WV residence times by up to 1 day as compared to the observations. We find that MATCH has problems in modelling the WV content in regions of strong upward convection like, for example, along the Inter Tropical Convergence Zone, where it appears to be generally too dry as compared to the observations. We

Fast and accurate phylogeny reconstruction using filtered spaced-word matches

Science.gov (United States)

Sohrabi-Jahromi, Salma; Morgenstern, Burkhard

2017-01-01

Abstract Motivation: Word-based or ‘alignment-free’ algorithms are increasingly used for phylogeny reconstruction and genome comparison, since they are much faster than traditional approaches that are based on full sequence alignments. Existing alignment-free programs, however, are less accurate than alignment-based methods. Results: We propose Filtered Spaced Word Matches (FSWM), a fast alignment-free approach to estimate phylogenetic distances between large genomic sequences. For a pre-defined binary pattern of match and don’t-care positions, FSWM rapidly identifies spaced word-matches between input sequences, i.e. gap-free local alignments with matching nucleotides at the match positions and with mismatches allowed at the don’t-care positions. We then estimate the number of nucleotide substitutions per site by considering the nucleotides aligned at the don’t-care positions of the identified spaced-word matches. To reduce the noise from spurious random matches, we use a filtering procedure where we discard all spaced-word matches for which the overall similarity between the aligned segments is below a threshold. We show that our approach can accurately estimate substitution frequencies even for distantly related sequences that cannot be analyzed with existing alignment-free methods; phylogenetic trees constructed with FSWM distances are of high quality. A program run on a pair of eukaryotic genomes of a few hundred Mb each takes a few minutes. Availability and Implementation: The program source code for FSWM including a documentation, as well as the software that we used to generate artificial genome sequences are freely available at http://fswm.gobics.de/ Contact: chris.leimeister@stud.uni-goettingen.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:28073754

The urology residency matching program in practice.

Science.gov (United States)

Teichman, J M; Anderson, K D; Dorough, M M; Stein, C R; Optenberg, S A; Thompson, I M

2000-06-01

We evaluate behaviors and attitudes among resident applicants and program directors related to the American Urological Association (AUA) residency matching program and recommend changes to improve the match. Written questionnaires were mailed to 519 resident applicants and 112 program directors after the 1999 American Urological Association match. Subjects were asked about their observations, behaviors and opinions towards the match. Questionnaires were returned by 230 resident applicants and 94 program directors (44% and 83% response rates, respectively.) Of the resident applicants 75% spent $1,001 to $5,000 for interviewing. Of the program directors 47% recalled that applicants asked how programs would rank the applicant and 61% of applicants recalled that program directors asked applicants how they would rank programs. Dishonesty was acknowledged by 31% of program directors and 44% of resident applicants. Of program directors 82% thought applicants "lied", while 67% of applicants thought that programs "lied" (quotations indicate questionnaire language). Participants characterized their own dishonesty as "just playing the game" or they "did not feel badly." Of program directors 81% and of applicants 61% were "skeptical" or "did not believe" when informed they were a "high" or "number 1" selection. Being asked about marital status was recalled by 91% of male and 100% of female (p = 0. 02), if they had children by 53% of male and 67% of female, (p = 0. 03), and intent to have children by 25% of male and 62% of female (p match code rules frequently. Program directors and resident applicants are skeptical of each other. Patterns of faculty behavior differ based on applicant gender. Interviews are costly for applicants. We recommend that 1) programs adopt policies to enhance fairness, 2) applications be filed electronically, 3) programs assist resident applicants with interview accommodation to reduce financial burden and 4) a post-interview code of limited or

Haptic spatial matching in near peripersonal space.

Science.gov (United States)

Kaas, Amanda L; Mier, Hanneke I van

2006-04-01

Research has shown that haptic spatial matching at intermanual distances over 60 cm is prone to large systematic errors. The error pattern has been explained by the use of reference frames intermediate between egocentric and allocentric coding. This study investigated haptic performance in near peripersonal space, i.e. at intermanual distances of 60 cm and less. Twelve blindfolded participants (six males and six females) were presented with two turn bars at equal distances from the midsagittal plane, 30 or 60 cm apart. Different orientations (vertical/horizontal or oblique) of the left bar had to be matched by adjusting the right bar to either a mirror symmetric (/ \\) or parallel (/ /) position. The mirror symmetry task can in principle be performed accurately in both an egocentric and an allocentric reference frame, whereas the parallel task requires an allocentric representation. Results showed that parallel matching induced large systematic errors which increased with distance. Overall error was significantly smaller in the mirror task. The task difference also held for the vertical orientation at 60 cm distance, even though this orientation required the same response in both tasks, showing a marked effect of task instruction. In addition, men outperformed women on the parallel task. Finally, contrary to our expectations, systematic errors were found in the mirror task, predominantly at 30 cm distance. Based on these findings, we suggest that haptic performance in near peripersonal space might be dominated by different mechanisms than those which come into play at distances over 60 cm. Moreover, our results indicate that both inter-individual differences and task demands affect task performance in haptic spatial matching. Therefore, we conclude that the study of haptic spatial matching in near peripersonal space might reveal important additional constraints for the specification of adequate models of haptic spatial performance.

Fast Partial Evaluation of Pattern Matching in Strings

DEFF Research Database (Denmark)

Ager, Mads Sig; Danvy, Olivier; Rohde, Henning Korsholm

2006-01-01

We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by specializing a quadratic-time string matcher with respect to a pattern string. Although it has been known for 15 years how to obtain this linear matcher by partial evaluation of a quadratic one, how to obtain...... it in linear time has remained an open problem. Obtaining a linear matcher by partial evaluation of a quadratic one is achieved by performing its backtracking at specialization time and memoizing its results. We show (1) how to rewrite the source matcher such that its static intermediate computations can...... be shared at specialization time and (2) how to extend the memoization capabilities of a partial evaluator to static functions. Such an extended partial evaluator, if its memoization is implemented efficiently, specializes the rewritten source matcher in linear time. Finally, we show that the method also...

Fast Partial Evaluation of Pattern Matching in Strings

DEFF Research Database (Denmark)

Ager, Mads Sig; Danvy, Olivier; Rohde, Henning Korsholm

2003-01-01

We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by specializing a quadratic-time string matcher with respect to a pattern string. Although it has been known for 15 years how to obtain this linear matcher by partial evaluation of a quadratic one, how to obtain...... it in linear time has remained an open problem. Obtaining a linear matcher by partial evaluation of a quadratic one is achieved by performing its backtracking at specialization time and memoizing its results. We show (1) how to rewrite the source matcher such that its static intermediate computations can...... be shared at specialization time and (2) how to extend the memoization capabilities of a partial evaluator to static functions. Such an extended partial evaluator, if its memoization is implemented efficiently, specializes the rewritten source matcher in linear time. Finally, we show that the method also...

Pigeons ("Columba Livia") Approach Nash Equilibrium in Experimental Matching Pennies Competitions

Science.gov (United States)

Sanabria, Federico; Thrailkill, Eric

2009-01-01

The game of Matching Pennies (MP), a simplified version of the more popular Rock, Papers, Scissors, schematically represents competitions between organisms with incentives to predict each other's behavior. Optimal performance in iterated MP competitions involves the production of random choice patterns and the detection of nonrandomness in the…

Matching consumer feeding behaviours and resource traits: a fourth-corner problem in food-web theory.

Science.gov (United States)

Monteiro, Angelo Barbosa; Faria, Lucas Del Bianco

2018-06-06

For decades, food web theory has proposed phenomenological models for the underlying structure of ecological networks. Generally, these models rely on latent niche variables that match the feeding behaviour of consumers with their resource traits. In this paper, we used a comprehensive database to evaluate different hypotheses on the best dependency structure of trait-matching patterns between consumers and resource traits. We found that consumer feeding behaviours had complex interactions with resource traits; however, few dimensions (i.e. latent variables) could reproduce the trait-matching patterns. We discuss our findings in the light of three food web models designed to reproduce the multidimensionality of food web data; additionally, we discuss how using species traits clarify food webs beyond species pairwise interactions and enable studies to infer ecological generality at larger scales, despite potential taxonomic differences, variations in ecological conditions and differences in species abundance between communities. © 2018 John Wiley & Sons Ltd/CNRS.

Specific Patterns of Emotion Recognition from Faces in Children with ASD: Results of a Cross-Modal Matching Paradigm

Science.gov (United States)

Golan, Ofer; Gordon, Ilanit; Fichman, Keren; Keinan, Giora

2018-01-01

Children with ASD show emotion recognition difficulties, as part of their social communication deficits. We examined facial emotion recognition (FER) in intellectually disabled children with ASD and in younger typically developing (TD) controls, matched on mental age. Our emotion-matching paradigm employed three different modalities: facial, vocal…

Maximum discharge rate of liquid-vapor mixtures from vessels

International Nuclear Information System (INIS)

Moody, F.J.

1975-09-01

A discrepancy exists in theoretical predictions of the two-phase equilibrium discharge rate from pipes attached to vessels. Theory which predicts critical flow data in terms of pipe exit pressure and quality severely overpredicts flow rates in terms of vessel fluid properties. This study shows that the discrepancy is explained by the flow pattern. Due to decompression and flashing as fluid accelerates into the pipe entrance, the maximum discharge rate from a vessel is limited by choking of a homogeneous bubbly mixture. The mixture tends toward a slip flow pattern as it travels through the pipe, finally reaching a different choked condition at the pipe exit

Women match men when learning a spatial skill.

Science.gov (United States)

Spence, Ian; Yu, Jingjie Jessica; Feng, Jing; Marshman, Jeff

2009-07-01

Meta-analytic studies have concluded that although training improves spatial cognition in both sexes, the male advantage generally persists. However, because some studies run counter to this pattern, a closer examination of the anomaly is warranted. The authors investigated the acquisition of a basic skill (spatial selective attention) using a matched-pair two-wave longitudinal design. Participants were screened with the use of an attentional visual field task, with the objective of selecting and matching 10 male-female pairs, over a wide range (30% to 57% correct). Subsequently, 20 participants 17-23 years of age (selected from 43 screened) were trained for 10 hr (distributed over several sessions) by playing a first-person shooter video game. This genre is known to be highly effective in enhancing spatial skills. All 20 participants improved, with matched members of the male-female pairs achieving very similar gains, independent of starting level. This is consistent with the hypothesis that the learning trajectory of women is not inferior to that of men when acquiring a basic spatial skill. Training methods that develop basic spatial skills may be essential to achieve gender parity in both basic and complex spatial tasks.

Motif trie: An efficient text index for pattern discovery with don't cares

DEFF Research Database (Denmark)

Grossi, Roberto; Menconi, Giulia; Pisanti, Nadia

2017-01-01

We introduce the motif trie data structure, which has applications in pattern matching and discovery in genomic analysis, plagiarism detection, data mining, intrusion detection, spam fighting and time series analysis, to name a few. Here the extraction of recurring patterns in sequential and text......We introduce the motif trie data structure, which has applications in pattern matching and discovery in genomic analysis, plagiarism detection, data mining, intrusion detection, spam fighting and time series analysis, to name a few. Here the extraction of recurring patterns in sequential...

Robust, Efficient Depth Reconstruction With Hierarchical Confidence-Based Matching.

Science.gov (United States)

Sun, Li; Chen, Ke; Song, Mingli; Tao, Dacheng; Chen, Gang; Chen, Chun

2017-07-01

In recent years, taking photos and capturing videos with mobile devices have become increasingly popular. Emerging applications based on the depth reconstruction technique have been developed, such as Google lens blur. However, depth reconstruction is difficult due to occlusions, non-diffuse surfaces, repetitive patterns, and textureless surfaces, and it has become more difficult due to the unstable image quality and uncontrolled scene condition in the mobile setting. In this paper, we present a novel hierarchical framework with multi-view confidence-based matching for robust, efficient depth reconstruction in uncontrolled scenes. Particularly, the proposed framework combines local cost aggregation with global cost optimization in a complementary manner that increases efficiency and accuracy. A depth map is efficiently obtained in a coarse-to-fine manner by using an image pyramid. Moreover, confidence maps are computed to robustly fuse multi-view matching cues, and to constrain the stereo matching on a finer scale. The proposed framework has been evaluated with challenging indoor and outdoor scenes, and has achieved robust and efficient depth reconstruction.

Automatic loading pattern optimization tool for Loviisa VVER-440 reactors

Energy Technology Data Exchange (ETDEWEB)

Kuopanportti, Jaakko [Fortum Power and Heat, Fortum (Finland). Nuclear Competence Center

2013-09-15

An automatic loading pattern optimization tool called ALPOT has been developed for Loviisa VVER-440 reactors. The ALPOT code utilizes combination of three different optimization methods. The first method is the imitation of the equilibrium pattern that is the optimized pattern in case the cycle length and the operation conditions are constant and the same shuffling pattern is repeated from cycle to cycle. In practice, the algorithm imitates assemblies' operation year distribution of the equilibrium pattern stochastically. The function of the imitation algorithm is to provide initial patterns quickly for the next optimization phase, which is performed either with the stochastic guided binary search algorithm or the deterministic burnup kernel method depending on the choice of the user. The former is a modified version of the standard binary search. The standard version goes through all possible swaps of the assemblies and chooses the best swap at each iteration round. The guided version chooses one assembly, tries to swap it with every other possible assembly and performs the best swap at each iteration round. The search is guided so that the algorithm chooses the assemblies at or near the most restrictive fuel assembly first. The kernel method creates burnup kernel functions to estimate burnup variations that are required to achieve desired changes in the power distribution of the reactor. The idea of the kernel method is first determine the optimal burnup distribution that minimizes the maximum relative assembly power using the created kernel functions and a common solver routine. Then, the burnups of the available fuel assemblies are matched with the obtained burnup distribution. (orig.)

Automatic loading pattern optimization tool for Loviisa VVER-440 reactors

International Nuclear Information System (INIS)

Kuopanportti, Jaakko

2013-01-01

An automatic loading pattern optimization tool called ALPOT has been developed for Loviisa VVER-440 reactors. The ALPOT code utilizes combination of three different optimization methods. The first method is the imitation of the equilibrium pattern that is the optimized pattern in case the cycle length and the operation conditions are constant and the same shuffling pattern is repeated from cycle to cycle. In practice, the algorithm imitates assemblies' operation year distribution of the equilibrium pattern stochastically. The function of the imitation algorithm is to provide initial patterns quickly for the next optimization phase, which is performed either with the stochastic guided binary search algorithm or the deterministic burnup kernel method depending on the choice of the user. The former is a modified version of the standard binary search. The standard version goes through all possible swaps of the assemblies and chooses the best swap at each iteration round. The guided version chooses one assembly, tries to swap it with every other possible assembly and performs the best swap at each iteration round. The search is guided so that the algorithm chooses the assemblies at or near the most restrictive fuel assembly first. The kernel method creates burnup kernel functions to estimate burnup variations that are required to achieve desired changes in the power distribution of the reactor. The idea of the kernel method is first determine the optimal burnup distribution that minimizes the maximum relative assembly power using the created kernel functions and a common solver routine. Then, the burnups of the available fuel assemblies are matched with the obtained burnup distribution. (orig.)

Magnetic safety matches

Science.gov (United States)

Lindén, J.; Lindberg, M.; Greggas, A.; Jylhävuori, N.; Norrgrann, H.; Lill, J. O.

2017-07-01

In addition to the main ingredients; sulfur, potassium chlorate and carbon, ordinary safety matches contain various dyes, glues etc, giving the head of the match an even texture and appealing color. Among the common reddish-brown matches there are several types, which after ignition can be attracted by a strong magnet. Before ignition the match head is generally not attracted by the magnet. An elemental analysis based on proton-induced x-ray emission was performed to single out iron as the element responsible for the observed magnetism. 57Fe Mössbauer spectroscopy was used for identifying the various types of iron-compounds, present before and after ignition, responsible for the macroscopic magnetism: Fe2O3 before and Fe3O4 after. The reaction was verified by mixing the main chemicals in the match-head with Fe2O3 in glue and mounting the mixture on a match stick. The ash residue after igniting the mixture was magnetic.

Relationship between oral status and maximum bite force in preschool children

Directory of Open Access Journals (Sweden)

Ching-Ming Su

2009-03-01

Conclusion: By combining the results of this study, it was concluded that associations of bite force with factors like age, maximum mouth opening and the number of teeth in contact were clearer than for other variables such as body height, body weight, occlusal pattern, and tooth decay or fillings.

Visual Localization across Seasons Using Sequence Matching Based on Multi-Feature Combination.

Science.gov (United States)

Qiao, Yongliang

2017-10-25

Visual localization is widely used in autonomous navigation system and Advanced Driver Assistance Systems (ADAS). However, visual-based localization in seasonal changing situations is one of the most challenging topics in computer vision and the intelligent vehicle community. The difficulty of this task is related to the strong appearance changes that occur in scenes due to weather or season changes. In this paper, a place recognition based visual localization method is proposed, which realizes the localization by identifying previously visited places using the sequence matching method. It operates by matching query image sequences to an image database acquired previously (video acquired during traveling period). In this method, in order to improve matching accuracy, multi-feature is constructed by combining a global GIST descriptor and local binary feature CSLBP (Center-symmetric local binary patterns) to represent image sequence. Then, similarity measurement according to Chi-square distance is used for effective sequences matching. For experimental evaluation, the relationship between image sequence length and sequences matching performance is studied. To show its effectiveness, the proposed method is tested and evaluated in four seasons outdoor environments. The results have shown improved precision-recall performance against the state-of-the-art SeqSLAM algorithm.

Automatic SIMD parallelization of embedded applications based on pattern recognition

NARCIS (Netherlands)

Manniesing, R.; Karkowski, I.P.; Corporaal, H.

2000-01-01

This paper investigates the potential for automatic mapping of typical embedded applications to architectures with multimedia instruction set extensions. For this purpose a (pattern matching based) code transformation engine is used, which involves a three-step process of matching, condition

An Efficient Algorithm for the Maximum Distance Problem

Directory of Open Access Journals (Sweden)

Gabrielle Assunta Grün

2001-12-01

Full Text Available Efficient algorithms for temporal reasoning are essential in knowledge-based systems. This is central in many areas of Artificial Intelligence including scheduling, planning, plan recognition, and natural language understanding. As such, scalability is a crucial consideration in temporal reasoning. While reasoning in the interval algebra is NP-complete, reasoning in the less expressive point algebra is tractable. In this paper, we explore an extension to the work of Gerevini and Schubert which is based on the point algebra. In their seminal framework, temporal relations are expressed as a directed acyclic graph partitioned into chains and supported by a metagraph data structure, where time points or events are represented by vertices, and directed edges are labelled with < or ≤. They are interested in fast algorithms for determining the strongest relation between two events. They begin by developing fast algorithms for the case where all points lie on a chain. In this paper, we are interested in a generalization of this, namely we consider the problem of finding the maximum ``distance'' between two vertices in a chain ; this problem arises in real world applications such as in process control and crew scheduling. We describe an O(n time preprocessing algorithm for the maximum distance problem on chains. It allows queries for the maximum number of < edges between two vertices to be answered in O(1 time. This matches the performance of the algorithm of Gerevini and Schubert for determining the strongest relation holding between two vertices in a chain.

Robust matching for voice recognition

Science.gov (United States)

Higgins, Alan; Bahler, L.; Porter, J.; Blais, P.

1994-10-01

This paper describes an automated method of comparing a voice sample of an unknown individual with samples from known speakers in order to establish or verify the individual's identity. The method is based on a statistical pattern matching approach that employs a simple training procedure, requires no human intervention (transcription, work or phonetic marketing, etc.), and makes no assumptions regarding the expected form of the statistical distributions of the observations. The content of the speech material (vocabulary, grammar, etc.) is not assumed to be constrained in any way. An algorithm is described which incorporates frame pruning and channel equalization processes designed to achieve robust performance with reasonable computational resources. An experimental implementation demonstrating the feasibility of the concept is described.

Using machine learning to assess covariate balance in matching studies.

Science.gov (United States)

Linden, Ariel; Yarnold, Paul R

2016-12-01

In order to assess the effectiveness of matching approaches in observational studies, investigators typically present summary statistics for each observed pre-intervention covariate, with the objective of showing that matching reduces the difference in means (or proportions) between groups to as close to zero as possible. In this paper, we introduce a new approach to distinguish between study groups based on their distributions of the covariates using a machine-learning algorithm called optimal discriminant analysis (ODA). Assessing covariate balance using ODA as compared with the conventional method has several key advantages: the ability to ascertain how individuals self-select based on optimal (maximum-accuracy) cut-points on the covariates; the application to any variable metric and number of groups; its insensitivity to skewed data or outliers; and the use of accuracy measures that can be widely applied to all analyses. Moreover, ODA accepts analytic weights, thereby extending the assessment of covariate balance to any study design where weights are used for covariate adjustment. By comparing the two approaches using empirical data, we are able to demonstrate that using measures of classification accuracy as balance diagnostics produces highly consistent results to those obtained via the conventional approach (in our matched-pairs example, ODA revealed a weak statistically significant relationship not detected by the conventional approach). Thus, investigators should consider ODA as a robust complement, or perhaps alternative, to the conventional approach for assessing covariate balance in matching studies. © 2016 John Wiley & Sons, Ltd.

A Vision Chip for Color Segmentation and Pattern Matching

Directory of Open Access Journals (Sweden)

Ralph Etienne-Cummings

2003-06-01

Full Text Available A 128(H × 64(V × RGB CMOS imager is integrated with region-of-interest selection, RGB-to-HSI transformation, HSI-based pixel segmentation, (36bins × 12bits-HSI histogramming, and sum-of-absolute-difference (SAD template matching. Thirty-two learned color templates are stored and compared to each image. The chip captures the R, G, and B images using in-pixel storage before passing the pixel content to a multiplying digital-to-analog converter (DAC for white balancing. The DAC can also be used to pipe in images for a PC. The color processing uses a biologically inspired color opponent representation and an analog lookup table to determine the Hue (H of each pixel. Saturation (S is computed using a loser-take-all circuit. Intensity (I is given by the sum of the color components. A histogram of the segments of the image, constructed by counting the number of pixels falling into 36 Hue intervals of 10 degrees, is stored on a chip and compared against the histograms of new segments using SAD comparisons. We demonstrate color-based image segmentation and object recognition with this chip. Running at 30 fps, it uses 1 mW. To our knowledge, this is the first chip that integrates imaging, color segmentation, and color-based object recognition at the focal plane.

Best matching theory & applications

CERN Document Server

Moghaddam, Mohsen

2017-01-01

Mismatch or best match? This book demonstrates that best matching of individual entities to each other is essential to ensure smooth conduct and successful competitiveness in any distributed system, natural and artificial. Interactions must be optimized through best matching in planning and scheduling, enterprise network design, transportation and construction planning, recruitment, problem solving, selective assembly, team formation, sensor network design, and more. Fundamentals of best matching in distributed and collaborative systems are explained by providing: § Methodical analysis of various multidimensional best matching processes § Comprehensive taxonomy, comparing different best matching problems and processes § Systematic identification of systems’ hierarchy, nature of interactions, and distribution of decision-making and control functions § Practical formulation of solutions based on a library of best matching algorithms and protocols, ready for direct applications and apps development. Design...

Regularized maximum correntropy machine

KAUST Repository

Wang, Jim Jing-Yan; Wang, Yunji; Jing, Bing-Yi; Gao, Xin

2015-01-01

In this paper we investigate the usage of regularized correntropy framework for learning of classifiers from noisy labels. The class label predictors learned by minimizing transitional loss functions are sensitive to the noisy and outlying labels of training samples, because the transitional loss functions are equally applied to all the samples. To solve this problem, we propose to learn the class label predictors by maximizing the correntropy between the predicted labels and the true labels of the training samples, under the regularized Maximum Correntropy Criteria (MCC) framework. Moreover, we regularize the predictor parameter to control the complexity of the predictor. The learning problem is formulated by an objective function considering the parameter regularization and MCC simultaneously. By optimizing the objective function alternately, we develop a novel predictor learning algorithm. The experiments on two challenging pattern classification tasks show that it significantly outperforms the machines with transitional loss functions.

Regularized maximum correntropy machine

KAUST Repository

Wang, Jim Jing-Yan

2015-02-12

In this paper we investigate the usage of regularized correntropy framework for learning of classifiers from noisy labels. The class label predictors learned by minimizing transitional loss functions are sensitive to the noisy and outlying labels of training samples, because the transitional loss functions are equally applied to all the samples. To solve this problem, we propose to learn the class label predictors by maximizing the correntropy between the predicted labels and the true labels of the training samples, under the regularized Maximum Correntropy Criteria (MCC) framework. Moreover, we regularize the predictor parameter to control the complexity of the predictor. The learning problem is formulated by an objective function considering the parameter regularization and MCC simultaneously. By optimizing the objective function alternately, we develop a novel predictor learning algorithm. The experiments on two challenging pattern classification tasks show that it significantly outperforms the machines with transitional loss functions.

Effects of a lighter, smaller football on Acute match injuries in adolescent female football

DEFF Research Database (Denmark)

Zebis, Mette K.; Thorborg, Kristian; Andersen, Lars L.

2018-01-01

BACKGROUND: The high injury incidence during match-play in female adolescent football is a major concern. In football, males and females play matches with the same football size. No studies have investigated the effect of football size on injury incidence in female adolescent football. Thus......, the aim of the present study was to investigate the effects of introducing a lighter, smaller football on the injury pattern in female adolescent football. METHODS We conducted a pilot cluster randomized controlled trial including 26 football teams representing 346 adolescent female football players (age...... 15-18 years). The teams were randomized to a new lighter, smaller football (INT, N.=12 teams) or a traditional FIFA size 5 football (CON, N.=14 teams) during a full match-season. Acute time-loss injuries and football-exposure during match-play were reported weekly by text-message questions...

The Nature, Function, and Impact of Inmate Communication Patterns in a Maximum Security Prison.

Science.gov (United States)

Van Voorhis, Patricia

To determine the areas in which communication affects prison environments and prison inmates, interviews were conducted with 21 adult male inmates shortly after their admission into a federal maximum security institution. The interviews were semistructured, addressing such issues as (1) perceptions of fellow inmates and staff; (2) additional…

A Quantitative Climate-Match Score for Risk-Assessment Screening of Reptile and Amphibian Introductions

Science.gov (United States)

van Wilgen, Nicola J.; Roura-Pascual, Núria; Richardson, David M.

2009-09-01

Assessing climatic suitability provides a good preliminary estimate of the invasive potential of a species to inform risk assessment. We examined two approaches for bioclimatic modeling for 67 reptile and amphibian species introduced to California and Florida. First, we modeled the worldwide distribution of the biomes found in the introduced range to highlight similar areas worldwide from which invaders might arise. Second, we modeled potentially suitable environments for species based on climatic factors in their native ranges, using three sources of distribution data. Performance of the three datasets and both approaches were compared for each species. Climate match was positively correlated with species establishment success (maximum predicted suitability in the introduced range was more strongly correlated with establishment success than mean suitability). Data assembled from the Global Amphibian Assessment through NatureServe provided the most accurate models for amphibians, while ecoregion data compiled by the World Wide Fund for Nature yielded models which described reptile climatic suitability better than available point-locality data. We present three methods of assigning a climate-match score for use in risk assessment using both the mean and maximum climatic suitabilities. Managers may choose to use different methods depending on the stringency of the assessment and the available data, facilitating higher resolution and accuracy for herpetofaunal risk assessment. Climate-matching has inherent limitations and other factors pertaining to ecological interactions and life-history traits must also be considered for thorough risk assessment.

The Specificity of Rugby Union Training Sessions in Preparation for Match Demands.

Science.gov (United States)

Campbell, Patrick G; Peake, Jonathan M; Minett, Geoffrey M

2018-04-01

Investigations into the specificity of rugby union training practices in preparation for competitive demands have predominantly focused on physical and physiological demands. The evaluation of the contextual variance in perceptual strain or skill requirements between training and matches in rugby union is unclear, yet holistic understanding may assist to optimize training design. This study evaluated the specificity of physical, physiological, perceptual, and skill demands of training sessions compared with competitive match play in preprofessional, elite club rugby union. Global positioning system devices, video capture, heart rate, and session ratings of perceived exertion were used to assess movement patterns, skill completions, physiologic, and perceptual responses, respectively. Data were collected across a season (training sessions n = 29; matches n = 14). Participants (n = 32) were grouped in playing positions as: outside backs, centers, halves, loose forwards, lock forwards, and front row forwards. Greater total distance, low-intensity activity, maximal speed, and meters per minute were apparent in matches compared with training in all positions (P  0.90). Similarly, match heart rate and session ratings of perceived exertion responses were higher than those recorded in training (P  0.8). Key skill completions for forwards (ie, scrums, rucks, and lineouts) and backs (ie, kicks) were greater under match conditions than in training (P  1.50). Considerable disparities exist between the perceptual, physiological, and key skill demands of competitive matches versus training sessions in preprofessional rugby union players. Practitioners should consider the specificity of training tasks for preprofessional rugby players to ensure the best preparation for match demands.

Officiating Role Influences the Physical Match Activity Profiles of Rugby League Touch Judges and Referees

Directory of Open Access Journals (Sweden)

Pearce Leesa

2017-08-01

Full Text Available This study investigated the effect of the officiating role on physical activity profiles of rugby league match officials during match-play. Physical performance indicators were collated from 23 match officials, resulting in 78 observations. Match officials were categorised into two groups: referees and touch judges. Microtechnology facilitated the quantification of total distance (m, relative distance (m⋅min-1, maximum velocity (m⋅s-1, the percentage of high intensity running distance (% total > 3.01 m⋅s-1, walking distance (5 m⋅s-1. Multivariate analysis modelled the main effect of the officiating role with follow up univariate analyses identifying significant differences. A significant effect was noted (V = 750; F(8, 66 = 24.71; p < 0.05 with referees covering a greater total distance (7767 ± 585 vs. 7022 ± 759 m, relative distance (90 ± 6 vs. 82 ± 8 m⋅min-1, jogging distance (3772 ± 752 vs. 3110 ± 553 m, and fast jogging distance (2565 ± 631 vs. 1816 ± 440 m compared to touch judges. Touch judges covered greater distances while sprinting (1012 ± 385 vs. 654 ± 241 m. Results provide important guidance in the development of training programs for match officials.

Self-Similar Spin Images for Point Cloud Matching

Science.gov (United States)

Pulido, Daniel

based on the concept of self-similarity to aid in the scale and feature matching steps. An open problem in fusion is how best to extract features from two point clouds and then perform feature-based matching. The proposed approach for this matching step is the use of local self-similarity as an invariant measure to match features. In particular, the proposed approach is to combine the concept of local self-similarity with a well-known feature descriptor, Spin Images, and thereby define "Self-Similar Spin Images". This approach is then extended to the case of matching two points clouds in very different coordinate systems (e.g., a geo-referenced Lidar point cloud and stereo-image derived point cloud without geo-referencing). The use of Self-Similar Spin Images is again applied to address this problem by introducing a "Self-Similar Keyscale" that matches the spatial scales of two point clouds. Another open problem is how best to detect changes in content between two point clouds. A method is proposed to find changes between two point clouds by analyzing the order statistics of the nearest neighbors between the two clouds, and thereby define the "Nearest Neighbor Order Statistic" method. Note that the well-known Hausdorff distance is a special case as being just the maximum order statistic. Therefore, by studying the entire histogram of these nearest neighbors it is expected to yield a more robust method to detect points that are present in one cloud but not the other. This approach is applied at multiple resolutions. Therefore, changes detected at the coarsest level will yield large missing targets and at finer levels will yield smaller targets.

Dinosaur Metabolism and the Allometry of Maximum Growth Rate.

Science.gov (United States)

Myhrvold, Nathan P

2016-01-01

The allometry of maximum somatic growth rate has been used in prior studies to classify the metabolic state of both extant vertebrates and dinosaurs. The most recent such studies are reviewed, and their data is reanalyzed. The results of allometric regressions on growth rate are shown to depend on the choice of independent variable; the typical choice used in prior studies introduces a geometric shear transformation that exaggerates the statistical power of the regressions. The maximum growth rates of extant groups are found to have a great deal of overlap, including between groups with endothermic and ectothermic metabolism. Dinosaur growth rates show similar overlap, matching the rates found for mammals, reptiles and fish. The allometric scaling of growth rate with mass is found to have curvature (on a log-log scale) for many groups, contradicting the prevailing view that growth rate allometry follows a simple power law. Reanalysis shows that no correlation between growth rate and basal metabolic rate (BMR) has been demonstrated. These findings drive a conclusion that growth rate allometry studies to date cannot be used to determine dinosaur metabolism as has been previously argued.

Dinosaur Metabolism and the Allometry of Maximum Growth Rate

Science.gov (United States)

Myhrvold, Nathan P.

2016-01-01

The allometry of maximum somatic growth rate has been used in prior studies to classify the metabolic state of both extant vertebrates and dinosaurs. The most recent such studies are reviewed, and their data is reanalyzed. The results of allometric regressions on growth rate are shown to depend on the choice of independent variable; the typical choice used in prior studies introduces a geometric shear transformation that exaggerates the statistical power of the regressions. The maximum growth rates of extant groups are found to have a great deal of overlap, including between groups with endothermic and ectothermic metabolism. Dinosaur growth rates show similar overlap, matching the rates found for mammals, reptiles and fish. The allometric scaling of growth rate with mass is found to have curvature (on a log-log scale) for many groups, contradicting the prevailing view that growth rate allometry follows a simple power law. Reanalysis shows that no correlation between growth rate and basal metabolic rate (BMR) has been demonstrated. These findings drive a conclusion that growth rate allometry studies to date cannot be used to determine dinosaur metabolism as has been previously argued. PMID:27828977

Outsourced pattern matching

DEFF Research Database (Denmark)

Faust, Sebastian; Hazay, Carmit; Venturi, Daniele

2013-01-01

In secure delegatable computation, computationally weak devices (or clients) wish to outsource their computation and data to an untrusted server in the cloud. While most earlier work considers the general question of how to securely outsource any computation to the cloud server, we focus...... that contain confidential data (e.g., health related data about patient history). Our constructions offer simulation-based security in the presence of semi-honest and malicious adversaries (in the random oracle model) and limit the communication in the query phase to O(m) bits plus the number of occurrences...

Novel transmission pricing scheme based on point-to-point tariff and transaction pair matching for pool market

International Nuclear Information System (INIS)

Chen, Qixin; Xia, Qing; Kang, Chongqing

2010-01-01

Transmission pricing scheme is a key component in the infrastructure of power market, and pool is an indispensable pattern of market organization; meanwhile, pay-as-bid (PAB) serves as a main option to determine market prices in pool. In this paper, a novel transmission pricing scheme is proposed for pool power market based on PAB. The new scheme is developed by utilizing point-to-point (PTP) tariff and introducing an approach of transaction pair matching (TPM). The model and procedure of the new scheme are presented in detail. Apart from the advantages of existing transmission pricing schemes, such as ensuing open, fair and non-discriminatory access, proper recovery for investment as well as transparency, the new scheme provides economic signals to promote the maximum use of the existing transmission network, encourages appropriate bidding behaviors in pool, and helps to reduce the possibility of the enforcement of market power and the appearing of price spikes; thus improves market operation efficiency and trading effects. In order to testify the effectiveness of the proposed scheme, a case based on IEEE 30-bus system is studied. (author)

Novel transmission pricing scheme based on point-to-point tariff and transaction pair matching for pool market

Energy Technology Data Exchange (ETDEWEB)

Chen, Qixin; Xia, Qing; Kang, Chongqing [State Key Lab. of Power System, Dept. of Electrical Engineering, Tsinghua University, Beijing 100084 (China)

2010-04-15

Transmission pricing scheme is a key component in the infrastructure of power market, and pool is an indispensable pattern of market organization; meanwhile, pay-as-bid (PAB) serves as a main option to determine market prices in pool. In this paper, a novel transmission pricing scheme is proposed for pool power market based on PAB. The new scheme is developed by utilizing point-to-point (PTP) tariff and introducing an approach of transaction pair matching (TPM). The model and procedure of the new scheme are presented in detail. Apart from the advantages of existing transmission pricing schemes, such as ensuing open, fair and non-discriminatory access, proper recovery for investment as well as transparency, the new scheme provides economic signals to promote the maximum use of the existing transmission network, encourages appropriate bidding behaviors in pool, and helps to reduce the possibility of the enforcement of market power and the appearing of price spikes; thus improves market operation efficiency and trading effects. In order to testify the effectiveness of the proposed scheme, a case based on IEEE 30-bus system is studied. (author)

Maximum entropy decomposition of quadrupole mass spectra

International Nuclear Information System (INIS)

Toussaint, U. von; Dose, V.; Golan, A.

2004-01-01

We present an information-theoretic method called generalized maximum entropy (GME) for decomposing mass spectra of gas mixtures from noisy measurements. In this GME approach to the noisy, underdetermined inverse problem, the joint entropies of concentration, cracking, and noise probabilities are maximized subject to the measured data. This provides a robust estimation for the unknown cracking patterns and the concentrations of the contributing molecules. The method is applied to mass spectroscopic data of hydrocarbons, and the estimates are compared with those received from a Bayesian approach. We show that the GME method is efficient and is computationally fast

Twenty-five years of maximum-entropy principle

Science.gov (United States)

Kapur, J. N.

1983-04-01

The strengths and weaknesses of the maximum entropy principle (MEP) are examined and some challenging problems that remain outstanding at the end of the first quarter century of the principle are discussed. The original formalism of the MEP is presented and its relationship to statistical mechanics is set forth. The use of MEP for characterizing statistical distributions, in statistical inference, nonlinear spectral analysis, transportation models, population density models, models for brand-switching in marketing and vote-switching in elections is discussed. Its application to finance, insurance, image reconstruction, pattern recognition, operations research and engineering, biology and medicine, and nonparametric density estimation is considered.

Maximum likelihood estimation for Cox's regression model under nested case-control sampling

DEFF Research Database (Denmark)

Scheike, Thomas Harder; Juul, Anders

2004-01-01

-like growth factor I was associated with ischemic heart disease. The study was based on a population of 3784 Danes and 231 cases of ischemic heart disease where controls were matched on age and gender. We illustrate the use of the MLE for these data and show how the maximum likelihood framework can be used......Nested case-control sampling is designed to reduce the costs of large cohort studies. It is important to estimate the parameters of interest as efficiently as possible. We present a new maximum likelihood estimator (MLE) for nested case-control sampling in the context of Cox's proportional hazards...... model. The MLE is computed by the EM-algorithm, which is easy to implement in the proportional hazards setting. Standard errors are estimated by a numerical profile likelihood approach based on EM aided differentiation. The work was motivated by a nested case-control study that hypothesized that insulin...

[Propensity score matching in SPSS].

Science.gov (United States)

Huang, Fuqiang; DU, Chunlin; Sun, Menghui; Ning, Bing; Luo, Ying; An, Shengli

2015-11-01

To realize propensity score matching in PS Matching module of SPSS and interpret the analysis results. The R software and plug-in that could link with the corresponding versions of SPSS and propensity score matching package were installed. A PS matching module was added in the SPSS interface, and its use was demonstrated with test data. Score estimation and nearest neighbor matching was achieved with the PS matching module, and the results of qualitative and quantitative statistical description and evaluation were presented in the form of a graph matching. Propensity score matching can be accomplished conveniently using SPSS software.

Genetic Algorithm with Maximum-Minimum Crossover (GA-MMC) Applied in Optimization of Radiation Pattern Control of Phased-Array Radars for Rocket Tracking Systems

Science.gov (United States)

Silva, Leonardo W. T.; Barros, Vitor F.; Silva, Sandro G.

2014-01-01

In launching operations, Rocket Tracking Systems (RTS) process the trajectory data obtained by radar sensors. In order to improve functionality and maintenance, radars can be upgraded by replacing antennas with parabolic reflectors (PRs) with phased arrays (PAs). These arrays enable the electronic control of the radiation pattern by adjusting the signal supplied to each radiating element. However, in projects of phased array radars (PARs), the modeling of the problem is subject to various combinations of excitation signals producing a complex optimization problem. In this case, it is possible to calculate the problem solutions with optimization methods such as genetic algorithms (GAs). For this, the Genetic Algorithm with Maximum-Minimum Crossover (GA-MMC) method was developed to control the radiation pattern of PAs. The GA-MMC uses a reconfigurable algorithm with multiple objectives, differentiated coding and a new crossover genetic operator. This operator has a different approach from the conventional one, because it performs the crossover of the fittest individuals with the least fit individuals in order to enhance the genetic diversity. Thus, GA-MMC was successful in more than 90% of the tests for each application, increased the fitness of the final population by more than 20% and reduced the premature convergence. PMID:25196013

Heterochrony and cross-species intersensory matching by infant vervet monkeys.

Directory of Open Access Journals (Sweden)

Shahin Zangenehpour

Full Text Available Understanding the evolutionary origins of a phenotype requires understanding the relationship between ontogenetic and phylogenetic processes. Human infants have been shown to undergo a process of perceptual narrowing during their first year of life, whereby their intersensory ability to match the faces and voices of another species declines as they get older. We investigated the evolutionary origins of this behavioral phenotype by examining whether or not this developmental process occurs in non-human primates as well.We tested the ability of infant vervet monkeys (Cercopithecus aethiops, ranging in age from 23 to 65 weeks, to match the faces and voices of another non-human primate species (the rhesus monkey, Macaca mulatta. Even though the vervets had no prior exposure to rhesus monkey faces and vocalizations, our findings show that infant vervets can, in fact, recognize the correspondence between rhesus monkey faces and voices (but indicate that they do so by looking at the non-matching face for a greater proportion of overall looking time, and can do so well beyond the age of perceptual narrowing in human infants. Our results further suggest that the pattern of matching by vervet monkeys is influenced by the emotional saliency of the Face+Voice combination. That is, although they looked at the non-matching screen for Face+Voice combinations, they switched to looking at the matching screen when the Voice was replaced with a complex tone of equal duration. Furthermore, an analysis of pupillary responses revealed that their pupils showed greater dilation when looking at the matching natural face/voice combination versus the face/tone combination.Because the infant vervets in the current study exhibited cross-species intersensory matching far later in development than do human infants, our findings suggest either that intersensory perceptual narrowing does not occur in Old World monkeys or that it occurs later in development. We argue that these

Matching Students to Schools

Directory of Open Access Journals (Sweden)

Dejan Trifunovic

2017-08-01

Full Text Available In this paper, we present the problem of matching students to schools by using different matching mechanisms. This market is specific since public schools are free and the price mechanism cannot be used to determine the optimal allocation of children in schools. Therefore, it is necessary to use different matching algorithms that mimic the market mechanism and enable us to determine the core of the cooperative game. In this paper, we will determine that it is possible to apply cooperative game theory in matching problems. This review paper is based on illustrative examples aiming to compare matching algorithms in terms of the incentive compatibility, stability and efficiency of the matching. In this paper we will present some specific problems that may occur in matching, such as improving the quality of schools, favoring minority students, the limited length of the list of preferences and generating strict priorities from weak priorities.

Compressed Subsequence Matching and Packed Tree Coloring

DEFF Research Database (Denmark)

Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li

2017-01-01

We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size n compressing a string of size N and a pattern string of size m over an alphabet of size \\(\\sigma \\), our algorithm uses \\(O(n+\\frac{n\\sigma }{w})\\) space and \\(O(n+\\frac{n\\sigma }{w}+m\\log N\\log...... w\\cdot occ)\\) or \\(O(n+\\frac{n\\sigma }{w}\\log w+m\\log N\\cdot occ)\\) time. Here w is the word size and occ is the number of minimal occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for \\(occ=o(\\frac{n}{\\log N})\\) occurrences. The algorithm uses...... a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings....

Match-play demands of elite youth Gaelic football using global positioning system tracking.

Science.gov (United States)

Reilly, Brian; Akubat, Ibrahim; Lyons, Mark; Collins, D Kieran

2015-04-01

Global positioning systems (GPS) technology has made athlete-tracking a convenient and accepted technique to specify movement patterns and physical demands in sport. The purpose of this study was to examine positional demands of elite youth Gaelic football match-play using portable GPS technology to examine movement patterns and heart rates across match periods. Fifty-six elite youth male Gaelic footballers (age, 15 ± 0.66 years) fitted with portable 4-Hz GPS units were observed during 6 competitive matches (60 minutes). Data provided from the GPS unit included total distance, high-intensity (≥17·km·h(-1)) distance, sprint (≥22 km·h(-1)) distance, and total number of sprints. Heart rate was monitored continuously throughout the games. Players covered a mean distance of 5732 ± 1047 m, and the mean intensity of match-play was 85% of the peak heart rate. There was a significant (p = 0.028) drop in the total distance covered in the second half (2783 ± 599 m) compared with the first half (2948 ± 580 m). In particular, there is a noticeable drop in the distance covered in the third quarter of the game (after half-time), which has implications for re-warming up at the end of the half-time interval. There was a highly significant (p < .001) difference in the distance traveled across the 5 positional groups with midfielders covering the greatest total distance (6740 ± 384 m). The significant differences found with respect to positional groups support the implementation of individual, position-specific strength and conditioning programs.

Characteristics of Plantar Loads in Maximum Forward Lunge Tasks in Badminton.

Science.gov (United States)

Hu, Xiaoyue; Li, Jing Xian; Hong, Youlian; Wang, Lin

2015-01-01

Badminton players often perform powerful and long-distance lunges during such competitive matches. The objective of this study is to compare the plantar loads of three one-step maximum forward lunges in badminton. Fifteen right-handed male badminton players participated in the study. Each participant performed five successful maximum lunges at three directions. For each direction, the participant wore three different shoe brands. Plantar loading, including peak pressure, maximum force, and contact area, was measured by using an insole pressure measurement system. Two-way ANOVA with repeated measures was employed to determine the effects of the different lunge directions and different shoes, as well as the interaction of these two variables, on the measurements. The maximum force (MF) on the lateral midfoot was lower when performing left-forward lunges than when performing front-forward lunges (p = 0.006, 95% CI = -2.88 to -0.04%BW). The MF and peak pressures (PP) on the great toe region were lower for the front-forward lunge than for the right-forward lunge (MF, p = 0.047, 95% CI = -3.62 to -0.02%BW; PP, p = 0.048, 95% CI = -37.63 to -0.16 KPa) and left-forward lunge (MF, p = 0.015, 95% CI = -4.39 to -0.38%BW; PP, p = 0.008, 95% CI = -47.76 to -5.91 KPa). These findings indicate that compared with the front-forward lunge, left and right maximum forward lunges induce greater plantar loads on the great toe region of the dominant leg of badminton players. The differences in the plantar loads of the different lunge directions may be potential risks for injuries to the lower extremities of badminton players.

Linear Time Local Approximation Algorithm for Maximum Stable Marriage

Directory of Open Access Journals (Sweden)

Zoltán Király

2013-08-01

Full Text Available We consider a two-sided market under incomplete preference lists with ties, where the goal is to find a maximum size stable matching. The problem is APX-hard, and a 3/2-approximation was given by McDermid [1]. This algorithm has a non-linear running time, and, more importantly needs global knowledge of all preference lists. We present a very natural, economically reasonable, local, linear time algorithm with the same ratio, using some ideas of Paluch [2]. In this algorithm every person make decisions using only their own list, and some information asked from members of these lists (as in the case of the famous algorithm of Gale and Shapley. Some consequences to the Hospitals/Residents problem are also discussed.

The calculation of maximum permissible exposure levels for laser radiation

International Nuclear Information System (INIS)

Tozer, B.A.

1979-01-01

The maximum permissible exposure data of the revised standard BS 4803 are presented as a set of decision charts which ensure that the user automatically takes into account such details as pulse length and pulse pattern, limiting angular subtense, combinations of multiple wavelength and/or multiple pulse lengths, etc. The two decision charts given are for the calculation of radiation hazards to skin and eye respectively. (author)

Variable resolution pattern generation for the Associative Memory of the ATLAS FTK project

CERN Document Server

Annovi, A; The ATLAS collaboration; Faulkner, G; Giannetti, P; Jiang, Z; Luongo, C; Pandini, C; Shochet, M; Tompkins, L; Volpi, G

2013-01-01

The Associative Memory (AM) chip is special device that allows to find coincidence patterns, or just patterns, between the incoming data in up to 8 parallel streams. The latest AM chip has been designed to receive silicon clusters generated in 8 layers of the ATLAS silicon detector sensor, to perform parallel track pattern matching at high rate and it will be the core of the FTK project. Data going through each of the busses are compared with a bank of patterns and AM chip looks for matches in each line, like commercial content addressable memory (CAM). The high density of hits expected in the ATLAS inner detector from 2015 put a challenge in the capability of the AM chip in rejecting random coincidences, requiring either an extremely high number of high precision patterns, with increasing costs and complexity of the system, or more flexible solutions. For this reason in the most recent prototype of the AM chip ternary cells have been added in the logic, allowing “don’t care” (DC) bits in the match. Hav...

Perspectives on Inmate Communication and Interpersonal Relations in the Maximum Security Prison.

Science.gov (United States)

Van Voorhis, Patricia; Meussling, Vonne

In recent years, scholarly and applied inquiry has addressed the importance of interpersonal communication patterns and problems in maximum security institutions for males. As a result of this research, the number of programs designed to improve the interpersonal effectiveness of prison inmates has increased dramatically. Research suggests that…

Visual Localization across Seasons Using Sequence Matching Based on Multi-Feature Combination

Directory of Open Access Journals (Sweden)

Yongliang Qiao

2017-10-01

Full Text Available Visual localization is widely used in autonomous navigation system and Advanced Driver Assistance Systems (ADAS. However, visual-based localization in seasonal changing situations is one of the most challenging topics in computer vision and the intelligent vehicle community. The difficulty of this task is related to the strong appearance changes that occur in scenes due to weather or season changes. In this paper, a place recognition based visual localization method is proposed, which realizes the localization by identifying previously visited places using the sequence matching method. It operates by matching query image sequences to an image database acquired previously (video acquired during traveling period. In this method, in order to improve matching accuracy, multi-feature is constructed by combining a global GIST descriptor and local binary feature CSLBP (Center-symmetric local binary patterns to represent image sequence. Then, similarity measurement according to Chi-square distance is used for effective sequences matching. For experimental evaluation, the relationship between image sequence length and sequences matching performance is studied. To show its effectiveness, the proposed method is tested and evaluated in four seasons outdoor environments. The results have shown improved precision–recall performance against the state-of-the-art SeqSLAM algorithm.

Type-safe pattern combinators

DEFF Research Database (Denmark)

Rhiger, Morten

2009-01-01

Macros still haven't made their way into typed higher-order programming languages such as Haskell and Standard ML. Therefore, to extend the expressiveness of Haskell or Standard ML, one must express new linguistic features in terms of functions that fit within the static type systems of these lan...... of these languages. This is particularly challenging when introducing features that span across multiple types and that bind variables. We address this challenge by developing, in a step by step manner, mechanisms for encoding patterns and pattern matching in Haskell in a type-safe way....

Approximate maximum parsimony and ancestral maximum likelihood.

Science.gov (United States)

Alon, Noga; Chor, Benny; Pardi, Fabio; Rapoport, Anat

2010-01-01

We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP-hard, so we seek approximate solutions. We formulate the two problems as Steiner tree problems under appropriate distances. The gist of our approach is the succinct characterization of Steiner trees for a small number of leaves for the two distances. This enables the use of known Steiner tree approximation algorithms. The approach leads to a 16/9 approximation ratio for AML and asymptotically to a 1.55 approximation ratio for MP.

Mining a database of single amplified genomes from Red Sea brine pool extremophiles—improving reliability of gene function prediction using a profile and pattern matching algorithm (PPMA)

Science.gov (United States)

Grötzinger, Stefan W.; Alam, Intikhab; Ba Alawi, Wail; Bajic, Vladimir B.; Stingl, Ulrich; Eppinger, Jörg

2014-01-01

Reliable functional annotation of genomic data is the key-step in the discovery of novel enzymes. Intrinsic sequencing data quality problems of single amplified genomes (SAGs) and poor homology of novel extremophile's genomes pose significant challenges for the attribution of functions to the coding sequences identified. The anoxic deep-sea brine pools of the Red Sea are a promising source of novel enzymes with unique evolutionary adaptation. Sequencing data from Red Sea brine pool cultures and SAGs are annotated and stored in the Integrated Data Warehouse of Microbial Genomes (INDIGO) data warehouse. Low sequence homology of annotated genes (no similarity for 35% of these genes) may translate into false positives when searching for specific functions. The Profile and Pattern Matching (PPM) strategy described here was developed to eliminate false positive annotations of enzyme function before progressing to labor-intensive hyper-saline gene expression and characterization. It utilizes InterPro-derived Gene Ontology (GO)-terms (which represent enzyme function profiles) and annotated relevant PROSITE IDs (which are linked to an amino acid consensus pattern). The PPM algorithm was tested on 15 protein families, which were selected based on scientific and commercial potential. An initial list of 2577 enzyme commission (E.C.) numbers was translated into 171 GO-terms and 49 consensus patterns. A subset of INDIGO-sequences consisting of 58 SAGs from six different taxons of bacteria and archaea were selected from six different brine pool environments. Those SAGs code for 74,516 genes, which were independently scanned for the GO-terms (profile filter) and PROSITE IDs (pattern filter). Following stringent reliability filtering, the non-redundant hits (106 profile hits and 147 pattern hits) are classified as reliable, if at least two relevant descriptors (GO-terms and/or consensus patterns) are present. Scripts for annotation, as well as for the PPM algorithm, are available

Mining a database of single amplified genomes from Red Sea brine pool extremophiles-improving reliability of gene function prediction using a profile and pattern matching algorithm (PPMA).

KAUST Repository

Grötzinger, Stefan W.

2014-04-07

Reliable functional annotation of genomic data is the key-step in the discovery of novel enzymes. Intrinsic sequencing data quality problems of single amplified genomes (SAGs) and poor homology of novel extremophile\\'s genomes pose significant challenges for the attribution of functions to the coding sequences identified. The anoxic deep-sea brine pools of the Red Sea are a promising source of novel enzymes with unique evolutionary adaptation. Sequencing data from Red Sea brine pool cultures and SAGs are annotated and stored in the Integrated Data Warehouse of Microbial Genomes (INDIGO) data warehouse. Low sequence homology of annotated genes (no similarity for 35% of these genes) may translate into false positives when searching for specific functions. The Profile and Pattern Matching (PPM) strategy described here was developed to eliminate false positive annotations of enzyme function before progressing to labor-intensive hyper-saline gene expression and characterization. It utilizes InterPro-derived Gene Ontology (GO)-terms (which represent enzyme function profiles) and annotated relevant PROSITE IDs (which are linked to an amino acid consensus pattern). The PPM algorithm was tested on 15 protein families, which were selected based on scientific and commercial potential. An initial list of 2577 enzyme commission (E.C.) numbers was translated into 171 GO-terms and 49 consensus patterns. A subset of INDIGO-sequences consisting of 58 SAGs from six different taxons of bacteria and archaea were selected from six different brine pool environments. Those SAGs code for 74,516 genes, which were independently scanned for the GO-terms (profile filter) and PROSITE IDs (pattern filter). Following stringent reliability filtering, the non-redundant hits (106 profile hits and 147 pattern hits) are classified as reliable, if at least two relevant descriptors (GO-terms and/or consensus patterns) are present. Scripts for annotation, as well as for the PPM algorithm, are available

Sprint profile of professional female soccer players during competitive matches: Female Athletes in Motion (FAiM) study.

Science.gov (United States)

Vescovi, Jason D

2012-01-01

The aim of this study was to determine sprint profiles of professional female soccer players and evaluate how various speed thresholds impact those outcomes. Seventy-one professional players competing in full matches were assessed repeatedly during 12 regular season matches using a Global Positioning System (GPS). Locomotion ≥18 km · h⁻¹ was defined as sprinting and each event was classified into: Zone 1: 18.0-20.9 km· h⁻¹; Zone 2: 21.0-22.9 km · h⁻¹; Zone 3: 23.0-24.9 km · h⁻¹ and Zone 4: >25 km · h⁻¹. Outcomes included: duration (s), distance (m), maximum speed (km · h⁻¹), duration since previous sprint (min) and proportion of total sprint distance. In total 5,019 events were analysed from 139 player-matches. Mean sprint duration, distance, maximum speed and time between sprints were 2.3 ± 1.5 s, 15.1 ± 9.4 m, 21.8 ± 2.3 km· h⁻¹, and 2.5 ± 2.5 min, respectively. Mean sprint distances were 657 ± 157, 447 ± 185, and 545 ± 217 m for forwards, midfielders and defenders, respectively (P ≤ 0.046). Midfielders had shorter sprint duration (P = 0.023), distance (P ≤ 0.003) and maximum speed (P professional female soccer players covered 5.3 ± 2.0% of total distance ≥18 km · h⁻¹ with positional differences and percent decrements distinct from other previously identified elite players. These data should guide the development of high intensity and sprint thresholds for elite-standard female soccer players.

Feature Matching for SAR and Optical Images Based on Gaussian-Gamma-shaped Edge Strength Map

Directory of Open Access Journals (Sweden)

CHEN Min

2016-03-01

Full Text Available A matching method for SAR and optical images, robust to pixel noise and nonlinear grayscale differences, is presented. Firstly, a rough correction to eliminate rotation and scale change between images is performed. Secondly, features robust to speckle noise of SAR image are detected by improving the original phase congruency based method. Then, feature descriptors are constructed on the Gaussian-Gamma-shaped edge strength map according to the histogram of oriented gradient pattern. Finally, descriptor similarity and geometrical relationship are combined to constrain the matching processing.The experimental results demonstrate that the proposed method provides significant improvement in correct matches number and image registration accuracy compared with other traditional methods.

An AUTONOMOUS STAR IDENTIFICATION ALGORITHM BASED ON THE DIRECTED CIRCULARITY PATTERN

Directory of Open Access Journals (Sweden)

J. Xie

2012-07-01

Full Text Available The accuracy of the angular distance may decrease due to lots of factors, such as the parameters of the stellar camera aren't calibrated on-orbit, or the location accuracy of the star image points is low, and so on, which can cause the low success rates of star identification. A robust directed circularity pattern algorithm is proposed in this paper, which is developed on basis of the matching probability algorithm. The improved algorithm retains the matching probability strategy to identify master star, and constructs a directed circularity pattern with the adjacent stars for unitary matching. The candidate matching group which has the longest chain will be selected as the final result. Simulation experiments indicate that the improved algorithm has high successful identification and reliability etc, compared with the original algorithm. The experiments with real data are used to verify it.

Transparent Electrochemical Gratings from a Patterned Bistable Silver Mirror.

Science.gov (United States)

Park, Chihyun; Na, Jongbeom; Han, Minsu; Kim, Eunkyoung

2017-07-25

Silver mirror patterns were formed reversibly on a polystyrene (PS)-patterned electrode to produce gratings through the electrochemical reduction of silver ions. The electrochemical gratings exhibited high transparency (T > 95%), similar to a see-through window, by matching the refractive index of the grating pattern with the surrounding medium. The gratings switch to a diffractive state upon the formation of a mirror pattern (T modulation, NIR light reflection, and on-demand heat transfer.

Discriminative Chemical Patterns: Automatic and Interactive Design.

Science.gov (United States)

Bietz, Stefan; Schomburg, Karen T; Hilbig, Matthias; Rarey, Matthias

2015-08-24

The classification of molecules with respect to their inhibiting, activating, or toxicological potential constitutes a central aspect in the field of cheminformatics. Often, a discriminative feature is needed to distinguish two different molecule sets. Besides physicochemical properties, substructures and chemical patterns belong to the descriptors most frequently applied for this purpose. As a commonly used example of this descriptor class, SMARTS strings represent a powerful concept for the representation and processing of abstract chemical patterns. While their usage facilitates a convenient way to apply previously derived classification rules on new molecule sets, the manual generation of useful SMARTS patterns remains a complex and time-consuming process. Here, we introduce SMARTSminer, a new algorithm for the automatic derivation of discriminative SMARTS patterns from preclassified molecule sets. Based on a specially adapted subgraph mining algorithm, SMARTSminer identifies structural features that are frequent in only one of the given molecule classes. In comparison to elemental substructures, it also supports the consideration of general and specific SMARTS features. Furthermore, SMARTSminer is integrated into an interactive pattern editor named SMARTSeditor. This allows for an intuitive visualization on the basis of the SMARTSviewer concept as well as interactive adaption and further improvement of the generated patterns. Additionally, a new molecular matching feature provides an immediate feedback on a pattern's matching behavior across the molecule sets. We demonstrate the utility of the SMARTSminer functionality and its integration into the SMARTSeditor software in several different classification scenarios.

A hierarchical graph neuron scheme for real-time pattern recognition.

Science.gov (United States)

Nasution, B B; Khan, A I

2008-02-01

The hierarchical graph neuron (HGN) implements a single cycle memorization and recall operation through a novel algorithmic design. The HGN is an improvement on the already published original graph neuron (GN) algorithm. In this improved approach, it recognizes incomplete/noisy patterns. It also resolves the crosstalk problem, which is identified in the previous publications, within closely matched patterns. To accomplish this, the HGN links multiple GN networks for filtering noise and crosstalk out of pattern data inputs. Intrinsically, the HGN is a lightweight in-network processing algorithm which does not require expensive floating point computations; hence, it is very suitable for real-time applications and tiny devices such as the wireless sensor networks. This paper describes that the HGN's pattern matching capability and the small response time remain insensitive to the increases in the number of stored patterns. Moreover, the HGN does not require definition of rules or setting of thresholds by the operator to achieve the desired results nor does it require heuristics entailing iterative operations for memorization and recall of patterns.

On the quirks of maximum parsimony and likelihood on phylogenetic networks.

Science.gov (United States)

Bryant, Christopher; Fischer, Mareike; Linz, Simone; Semple, Charles

2017-03-21

Maximum parsimony is one of the most frequently-discussed tree reconstruction methods in phylogenetic estimation. However, in recent years it has become more and more apparent that phylogenetic trees are often not sufficient to describe evolution accurately. For instance, processes like hybridization or lateral gene transfer that are commonplace in many groups of organisms and result in mosaic patterns of relationships cannot be represented by a single phylogenetic tree. This is why phylogenetic networks, which can display such events, are becoming of more and more interest in phylogenetic research. It is therefore necessary to extend concepts like maximum parsimony from phylogenetic trees to networks. Several suggestions for possible extensions can be found in recent literature, for instance the softwired and the hardwired parsimony concepts. In this paper, we analyze the so-called big parsimony problem under these two concepts, i.e. we investigate maximum parsimonious networks and analyze their properties. In particular, we show that finding a softwired maximum parsimony network is possible in polynomial time. We also show that the set of maximum parsimony networks for the hardwired definition always contains at least one phylogenetic tree. Lastly, we investigate some parallels of parsimony to different likelihood concepts on phylogenetic networks. Copyright © 2017 Elsevier Ltd. All rights reserved.

Matrix-Matching as an Improvement Strategy for the Detection of Pesticide Residues.

Science.gov (United States)

Giacinti, Géraldine; Raynaud, Christine; Capblancq, Sophie; Simon, Valérie

2016-05-01

More than 90% of the pesticides residues in apples are located in the peel. We developed a gas chromatography/ion trap tandem mass spectrometry method for investigating all detectable residues in the peel of 3 apple varieties. Sample preparation is based on the use of the Quick Easy Cheap Effective Rugged and Safe method on the whole fruit, the flesh, and the peel. Pesticide residues were quantified with solvent-matched and matrix-matched standards, by spiking apple sample extracts. Matrix effects dependent on the type of extract (fruit, flesh, or peel) and the apple variety were detected. The best data processing methods involved normalizing matrix effect rates by matrix-matched internal/external calibration. Boscalid, captan, chlorpyrifos, fludioxonil, and pyraclostrobin were the most frequently detected pesticides. However, their concentrations in the whole fruit were below European maximum residue levels. Despite negative matrix effects, the residues in peel were detected at concentrations up to 10 times higher than those in whole fruits. Consequently, other pesticide residues present at concentrations below the limit of quantification in the whole fruit were detected in the peel. © 2016 Institute of Food Technologists®

WMAXC: a weighted maximum clique method for identifying condition-specific sub-network.

Directory of Open Access Journals (Sweden)

Bayarbaatar Amgalan

Full Text Available Sub-networks can expose complex patterns in an entire bio-molecular network by extracting interactions that depend on temporal or condition-specific contexts. When genes interact with each other during cellular processes, they may form differential co-expression patterns with other genes across different cell states. The identification of condition-specific sub-networks is of great importance in investigating how a living cell adapts to environmental changes. In this work, we propose the weighted MAXimum clique (WMAXC method to identify a condition-specific sub-network. WMAXC first proposes scoring functions that jointly measure condition-specific changes to both individual genes and gene-gene co-expressions. It then employs a weaker formula of a general maximum clique problem and relates the maximum scored clique of a weighted graph to the optimization of a quadratic objective function under sparsity constraints. We combine a continuous genetic algorithm and a projection procedure to obtain a single optimal sub-network that maximizes the objective function (scoring function over the standard simplex (sparsity constraints. We applied the WMAXC method to both simulated data and real data sets of ovarian and prostate cancer. Compared with previous methods, WMAXC selected a large fraction of cancer-related genes, which were enriched in cancer-related pathways. The results demonstrated that our method efficiently captured a subset of genes relevant under the investigated condition.

Latent palmprint matching.

Science.gov (United States)

Jain, Anil K; Feng, Jianjiang

2009-06-01

The evidential value of palmprints in forensic applications is clear as about 30 percent of the latents recovered from crime scenes are from palms. While biometric systems for palmprint-based personal authentication in access control type of applications have been developed, they mostly deal with low-resolution (about 100 ppi) palmprints and only perform full-to-full palmprint matching. We propose a latent-to-full palmprint matching system that is needed in forensic applications. Our system deals with palmprints captured at 500 ppi (the current standard in forensic applications) or higher resolution and uses minutiae as features to be compatible with the methodology used by latent experts. Latent palmprint matching is a challenging problem because latent prints lifted at crime scenes are of poor image quality, cover only a small area of the palm, and have a complex background. Other difficulties include a large number of minutiae in full prints (about 10 times as many as fingerprints), and the presence of many creases in latents and full prints. A robust algorithm to reliably estimate the local ridge direction and frequency in palmprints is developed. This facilitates the extraction of ridge and minutiae features even in poor quality palmprints. A fixed-length minutia descriptor, MinutiaCode, is utilized to capture distinctive information around each minutia and an alignment-based minutiae matching algorithm is used to match two palmprints. Two sets of partial palmprints (150 live-scan partial palmprints and 100 latent palmprints) are matched to a background database of 10,200 full palmprints to test the proposed system. Despite the inherent difficulty of latent-to-full palmprint matching, rank-1 recognition rates of 78.7 and 69 percent, respectively, were achieved in searching live-scan partial palmprints and latent palmprints against the background database.

A maximum power point tracking algorithm for photovoltaic applications

Science.gov (United States)

Nelatury, Sudarshan R.; Gray, Robert

2013-05-01

The voltage and current characteristic of a photovoltaic (PV) cell is highly nonlinear and operating a PV cell for maximum power transfer has been a challenge for a long time. Several techniques have been proposed to estimate and track the maximum power point (MPP) in order to improve the overall efficiency of a PV panel. A strategic use of the mean value theorem permits obtaining an analytical expression for a point that lies in a close neighborhood of the true MPP. But hitherto, an exact solution in closed form for the MPP is not published. This problem can be formulated analytically as a constrained optimization, which can be solved using the Lagrange method. This method results in a system of simultaneous nonlinear equations. Solving them directly is quite difficult. However, we can employ a recursive algorithm to yield a reasonably good solution. In graphical terms, suppose the voltage current characteristic and the constant power contours are plotted on the same voltage current plane, the point of tangency between the device characteristic and the constant power contours is the sought for MPP. It is subject to change with the incident irradiation and temperature and hence the algorithm that attempts to maintain the MPP should be adaptive in nature and is supposed to have fast convergence and the least misadjustment. There are two parts in its implementation. First, one needs to estimate the MPP. The second task is to have a DC-DC converter to match the given load to the MPP thus obtained. Availability of power electronics circuits made it possible to design efficient converters. In this paper although we do not show the results from a real circuit, we use MATLAB to obtain the MPP and a buck-boost converter to match the load. Under varying conditions of load resistance and irradiance we demonstrate MPP tracking in case of a commercially available solar panel MSX-60. The power electronics circuit is simulated by PSIM software.

Maximum Parsimony on Phylogenetic networks

Science.gov (United States)

2012-01-01

Background Phylogenetic networks are generalizations of phylogenetic trees, that are used to model evolutionary events in various contexts. Several different methods and criteria have been introduced for reconstructing phylogenetic trees. Maximum Parsimony is a character-based approach that infers a phylogenetic tree by minimizing the total number of evolutionary steps required to explain a given set of data assigned on the leaves. Exact solutions for optimizing parsimony scores on phylogenetic trees have been introduced in the past. Results In this paper, we define the parsimony score on networks as the sum of the substitution costs along all the edges of the network; and show that certain well-known algorithms that calculate the optimum parsimony score on trees, such as Sankoff and Fitch algorithms extend naturally for networks, barring conflicting assignments at the reticulate vertices. We provide heuristics for finding the optimum parsimony scores on networks. Our algorithms can be applied for any cost matrix that may contain unequal substitution costs of transforming between different characters along different edges of the network. We analyzed this for experimental data on 10 leaves or fewer with at most 2 reticulations and found that for almost all networks, the bounds returned by the heuristics matched with the exhaustively determined optimum parsimony scores. Conclusion The parsimony score we define here does not directly reflect the cost of the best tree in the network that displays the evolution of the character. However, when searching for the most parsimonious network that describes a collection of characters, it becomes necessary to add additional cost considerations to prefer simpler structures, such as trees over networks. The parsimony score on a network that we describe here takes into account the substitution costs along the additional edges incident on each reticulate vertex, in addition to the substitution costs along the other edges which are

Characteristics of Plantar Loads in Maximum Forward Lunge Tasks in Badminton.

Directory of Open Access Journals (Sweden)

Xiaoyue Hu

Full Text Available Badminton players often perform powerful and long-distance lunges during such competitive matches. The objective of this study is to compare the plantar loads of three one-step maximum forward lunges in badminton.Fifteen right-handed male badminton players participated in the study. Each participant performed five successful maximum lunges at three directions. For each direction, the participant wore three different shoe brands. Plantar loading, including peak pressure, maximum force, and contact area, was measured by using an insole pressure measurement system. Two-way ANOVA with repeated measures was employed to determine the effects of the different lunge directions and different shoes, as well as the interaction of these two variables, on the measurements.The maximum force (MF on the lateral midfoot was lower when performing left-forward lunges than when performing front-forward lunges (p = 0.006, 95% CI = -2.88 to -0.04%BW. The MF and peak pressures (PP on the great toe region were lower for the front-forward lunge than for the right-forward lunge (MF, p = 0.047, 95% CI = -3.62 to -0.02%BW; PP, p = 0.048, 95% CI = -37.63 to -0.16 KPa and left-forward lunge (MF, p = 0.015, 95% CI = -4.39 to -0.38%BW; PP, p = 0.008, 95% CI = -47.76 to -5.91 KPa.These findings indicate that compared with the front-forward lunge, left and right maximum forward lunges induce greater plantar loads on the great toe region of the dominant leg of badminton players. The differences in the plantar loads of the different lunge directions may be potential risks for injuries to the lower extremities of badminton players.

Three-dimensional particle tracking in concave structures made by ultraviolet nanoimprint via total internal reflection fluorescence microscopy and refractive-index-matching method

Science.gov (United States)

Fujinami, Taku; Kigami, Hiroshi; Unno, Noriyuki; Taniguchi, Jun; Satake, Shin-ichi

2018-03-01

Total internal reflection fluorescence microscopy (TIRFM) is a promising method for measuring fluid flow close to a wall with nanoscale resolution in a process that is termed "multilayer nanoparticle image velocimetry" (MnPIV). TIRFM uses evanescent light that is generated on a substrate (typically a glass slide) by total internal reflection of light. Many researchers have previously studied x-y-z (3D) flows of water close to flat glass slides using MnPIV. On the other hand, a fluid flow close to a structured surface is also important. To measure flows of water near micro-patterns, we previously developed an MnPIV technique that uses a refractive-index-matching method. In previous study, the micropattern is made of a thermoplastic material with a refractive index that closely matches that of water. In this study, ultraviolet nanoimprint lithography was used for fabricating the appropriate micro-patterns because this technique can fabricate a pattern with a high resolution. As a result, we succeeded in performing MnPIV in water with a circular hole array pattern made by ultraviolet nanoimprint using a refractive-index-matching method. We believe that this technique will be helpful in elucidating fluid flows around microstructures.

Tensor GSVD of patient- and platform-matched tumor and normal DNA copy-number profiles uncovers chromosome arm-wide patterns of tumor-exclusive platform-consistent alterations encoding for cell transformation and predicting ovarian cancer survival.

Directory of Open Access Journals (Sweden)

Preethi Sankaranarayanan

Full Text Available The number of large-scale high-dimensional datasets recording different aspects of a single disease is growing, accompanied by a need for frameworks that can create one coherent model from multiple tensors of matched columns, e.g., patients and platforms, but independent rows, e.g., probes. We define and prove the mathematical properties of a novel tensor generalized singular value decomposition (GSVD, which can simultaneously find the similarities and dissimilarities, i.e., patterns of varying relative significance, between any two such tensors. We demonstrate the tensor GSVD in comparative modeling of patient- and platform-matched but probe-independent ovarian serous cystadenocarcinoma (OV tumor, mostly high-grade, and normal DNA copy-number profiles, across each chromosome arm, and combination of two arms, separately. The modeling uncovers previously unrecognized patterns of tumor-exclusive platform-consistent co-occurring copy-number alterations (CNAs. We find, first, and validate that each of the patterns across only 7p and Xq, and the combination of 6p+12p, is correlated with a patient's prognosis, is independent of the tumor's stage, the best predictor of OV survival to date, and together with stage makes a better predictor than stage alone. Second, these patterns include most known OV-associated CNAs that map to these chromosome arms, as well as several previously unreported, yet frequent focal CNAs. Third, differential mRNA, microRNA, and protein expression consistently map to the DNA CNAs. A coherent picture emerges for each pattern, suggesting roles for the CNAs in OV pathogenesis and personalized therapy. In 6p+12p, deletion of the p21-encoding CDKN1A and p38-encoding MAPK14 and amplification of RAD51AP1 and KRAS encode for human cell transformation, and are correlated with a cell's immortality, and a patient's shorter survival time. In 7p, RPA3 deletion and POLD2 amplification are correlated with DNA stability, and a longer survival

Quantity precommitment and price matching

DEFF Research Database (Denmark)

Tumennasan, Norovsambuu

We revisit the question of whether price matching is anti-competitive in a capacity constrained duopoly setting. We show that the effect of price matching depends on capacity. Specifically, price matching has no effect when capacity is relatively low, but it benefits the firms when capacity...... is relatively high. Interestingly, when capacity is in an intermediate range, price matching benefits only the small firm but does not affect the large firm in any way. Therefore, one has to consider capacity seriously when evaluating if price matching is anti-competitive. If the firms choose their capacities...... simultaneously before pricing decisions, then the effect of price matching is either pro-competitive or ambiguous. We show that if the cost of capacity is high, then price matching can only (weakly) decrease the market price. On the other hand, if the cost of capacity is low, then the effect of price matching...

Towards a Next-Generation Catalogue Cross-Match Service

Science.gov (United States)

Pineau, F.; Boch, T.; Derriere, S.; Arches Consortium

2015-09-01

We have been developing in the past several catalogue cross-match tools. On one hand the CDS XMatch service (Pineau et al. 2011), able to perform basic but very efficient cross-matches, scalable to the largest catalogues on a single regular server. On the other hand, as part of the European project ARCHES1, we have been developing a generic and flexible tool which performs potentially complex multi-catalogue cross-matches and which computes probabilities of association based on a novel statistical framework. Although the two approaches have been managed so far as different tracks, the need for next generation cross-match services dealing with both efficiency and complexity is becoming pressing with forthcoming projects which will produce huge high quality catalogues. We are addressing this challenge which is both theoretical and technical. In ARCHES we generalize to N catalogues the candidate selection criteria - based on the chi-square distribution - described in Pineau et al. (2011). We formulate and test a number of Bayesian hypothesis which necessarily increases dramatically with the number of catalogues. To assign a probability to each hypotheses, we rely on estimated priors which account for local densities of sources. We validated our developments by comparing the theoretical curves we derived with the results of Monte-Carlo simulations. The current prototype is able to take into account heterogeneous positional errors, object extension and proper motion. The technical complexity is managed by OO programming design patterns and SQL-like functionalities. Large tasks are split into smaller independent pieces for scalability. Performances are achieved resorting to multi-threading, sequential reads and several tree data-structures. In addition to kd-trees, we account for heterogeneous positional errors and object's extension using M-trees. Proper-motions are supported using a modified M-tree we developed, inspired from Time Parametrized R-trees (TPR

Patterns of perceptual performance in Developmental Prosopagnosia

DEFF Research Database (Denmark)

Starrfelt, Randi; Petersen, Anders; Gerlach, Christian

and Methods. 10 DPs and 20 matched controls participated in experimental tasks measuring recognition of faces, objects, letters, words, and scenes, as well as text reading, global-local processing (Navon’s paradigm), and visual attention / short-term memory. Performance was compared using both group...... and single case statistics. 3. Results. We find an intriguing pattern of preserved and impaired functions in DP: Letter and word recognition, text reading, and visual attention / short-term memory were normal. For geographical scenes, simultaneous matching was normal, while there was a group difference......1. Objective Developmental prosopagnosia (DP) is a life-long deficit in face recognition. The deficit is thought to be selective for faces, a hypothesis we tested by investigating patterns of associated and dissociated visuoperceptual and -attentional functions in a group of DPs. 2. Participants...

Multiwavelength Absolute Phase Retrieval from Noisy Diffractive Patterns: Wavelength Multiplexing Algorithm

Directory of Open Access Journals (Sweden)

Vladimir Katkovnik

2018-05-01

Full Text Available We study the problem of multiwavelength absolute phase retrieval from noisy diffraction patterns. The system is lensless with multiwavelength coherent input light beams and random phase masks applied for wavefront modulation. The light beams are formed by light sources radiating all wavelengths simultaneously. A sensor equipped by a Color Filter Array (CFA is used for spectral measurement registration. The developed algorithm targeted on optimal phase retrieval from noisy observations is based on maximum likelihood technique. The algorithm is specified for Poissonian and Gaussian noise distributions. One of the key elements of the algorithm is an original sparse modeling of the multiwavelength complex-valued wavefronts based on the complex-domain block-matching 3D filtering. Presented numerical experiments are restricted to noisy Poissonian observations. They demonstrate that the developed algorithm leads to effective solutions explicitly using the sparsity for noise suppression and enabling accurate reconstruction of absolute phase of high-dynamic range.

Using pattern analysis methods to do fast detection of manufacturing pattern failures

Science.gov (United States)

Zhao, Evan; Wang, Jessie; Sun, Mason; Wang, Jeff; Zhang, Yifan; Sweis, Jason; Lai, Ya-Chieh; Ding, Hua

2016-03-01

At the advanced technology node, logic design has become extremely complex and is getting more challenging as the pattern geometry size decreases. The small sizes of layout patterns are becoming very sensitive to process variations. Meanwhile, the high pressure of yield ramp is always there due to time-to-market competition. The company that achieves patterning maturity earlier than others will have a great advantage and a better chance to realize maximum profit margins. For debugging silicon failures, DFT diagnostics can identify which nets or cells caused the yield loss. But normally, a long time period is needed with many resources to identify which failures are due to one common layout pattern or structure. This paper will present a new yield diagnostic flow, based on preliminary EFA results, to show how pattern analysis can more efficiently detect pattern related systematic defects. Increased visibility on design pattern related failures also allows more precise yield loss estimation.

Mining a database of single amplified genomes from Red Sea brine pool extremophiles – Improving reliability of gene function prediction using a profile and pattern matching algorithm (PPMA

Directory of Open Access Journals (Sweden)

Stefan Wolfgang Grötzinger

2014-04-01

Full Text Available Reliable functional annotation of genomic data is the key-step in the discovery of novel enzymes. Intrinsic sequencing data quality problems of single amplified genomes (SAGs and poor homology of novel extremophile’s genomes pose significant challenges for the attribution of functions to the coding sequences identified. The anoxic deep-sea brine pools of the Red Sea are a promising source of novel enzymes with unique evolutionary adaptation. Sequencing data from Red Sea brine pool cultures and SAGs are annotated and stored in the INDIGO data warehouse. Low sequence homology of annotated genes (no similarity for 35% of these genes may translate into false positives when searching for specific functions. The Profile & Pattern Matching (PPM strategy described here was developed to eliminate false positive annotations of enzyme function before progressing to labor-intensive hyper-saline gene expression and characterization. It utilizes InterPro-derived Gene Ontology (GO-terms (which represent enzyme function profiles and annotated relevant PROSITE IDs (which are linked to an amino acid consensus pattern. The PPM algorithm was tested on 15 protein families, which were selected based on scientific and commercial potential. An initial list of 2,577 E.C. numbers was translated into 171 GO-terms and 49 consensus patterns. A subset of INDIGO-sequences consisting of 58 SAGs from six different taxons of bacteria and archaea were selected from 6 different brine pool environments. Those SAGs code for 74,516 genes, which were independently scanned for the GO-terms (profile filter and PROSITE IDs (pattern filter. Following stringent reliability filtering, the non-redundant hits (106 profile hits and 147 pattern hits are classified as reliable, if at least two relevant descriptors (GO-terms and/or consensus patterns are present. Scripts for annotation, as well as for the PPM algorithm, are available through the INDIGO website.

The Interaction Between Schema Matching and Record Matching in Data Integration

KAUST Repository

Gu, Binbin; Li, Zhixu; Zhang, Xiangliang; Liu, An; Liu, Guanfeng; Zheng, Kai; Zhao, Lei; Zhou, Xiaofang

2016-01-01

Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have

Matching Matched Filtering with Deep Networks for Gravitational-Wave Astronomy

Science.gov (United States)

Gabbard, Hunter; Williams, Michael; Hayes, Fergus; Messenger, Chris

2018-04-01

We report on the construction of a deep convolutional neural network that can reproduce the sensitivity of a matched-filtering search for binary black hole gravitational-wave signals. The standard method for the detection of well-modeled transient gravitational-wave signals is matched filtering. We use only whitened time series of measured gravitational-wave strain as an input, and we train and test on simulated binary black hole signals in synthetic Gaussian noise representative of Advanced LIGO sensitivity. We show that our network can classify signal from noise with a performance that emulates that of match filtering applied to the same data sets when considering the sensitivity defined by receiver-operator characteristics.

Matching Matched Filtering with Deep Networks for Gravitational-Wave Astronomy.

Science.gov (United States)

Gabbard, Hunter; Williams, Michael; Hayes, Fergus; Messenger, Chris

2018-04-06

We report on the construction of a deep convolutional neural network that can reproduce the sensitivity of a matched-filtering search for binary black hole gravitational-wave signals. The standard method for the detection of well-modeled transient gravitational-wave signals is matched filtering. We use only whitened time series of measured gravitational-wave strain as an input, and we train and test on simulated binary black hole signals in synthetic Gaussian noise representative of Advanced LIGO sensitivity. We show that our network can classify signal from noise with a performance that emulates that of match filtering applied to the same data sets when considering the sensitivity defined by receiver-operator characteristics.

Effects of musical training on sound pattern processing in high-school students.

Science.gov (United States)

Wang, Wenjung; Staffaroni, Laura; Reid, Errold; Steinschneider, Mitchell; Sussman, Elyse

2009-05-01

Recognizing melody in music involves detection of both the pitch intervals and the silence between sequentially presented sounds. This study tested the hypothesis that active musical training in adolescents facilitates the ability to passively detect sequential sound patterns compared to musically non-trained age-matched peers. Twenty adolescents, aged 15-18 years, were divided into groups according to their musical training and current experience. A fixed order tone pattern was presented at various stimulus rates while electroencephalogram was recorded. The influence of musical training on passive auditory processing of the sound patterns was assessed using components of event-related brain potentials (ERPs). The mismatch negativity (MMN) ERP component was elicited in different stimulus onset asynchrony (SOA) conditions in non-musicians than musicians, indicating that musically active adolescents were able to detect sound patterns across longer time intervals than age-matched peers. Musical training facilitates detection of auditory patterns, allowing the ability to automatically recognize sequential sound patterns over longer time periods than non-musical counterparts.

78 FR 42080 - Privacy Act of 1974; CMS Computer Match No. 2013-07; HHS Computer Match No. 1303; DoD-DMDC Match...

Science.gov (United States)

2013-07-15

... 1974; CMS Computer Match No. 2013-07; HHS Computer Match No. 1303; DoD-DMDC Match No. 18 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION... Act of 1974, as amended, this notice announces the establishment of a CMP that CMS plans to conduct...

PROCOV: maximum likelihood estimation of protein phylogeny under covarion models and site-specific covarion pattern analysis

Directory of Open Access Journals (Sweden)

Wang Huai-Chun

2009-09-01

Full Text Available Abstract Background The covarion hypothesis of molecular evolution holds that selective pressures on a given amino acid or nucleotide site are dependent on the identity of other sites in the molecule that change throughout time, resulting in changes of evolutionary rates of sites along the branches of a phylogenetic tree. At the sequence level, covarion-like evolution at a site manifests as conservation of nucleotide or amino acid states among some homologs where the states are not conserved in other homologs (or groups of homologs. Covarion-like evolution has been shown to relate to changes in functions at sites in different clades, and, if ignored, can adversely affect the accuracy of phylogenetic inference. Results PROCOV (protein covarion analysis is a software tool that implements a number of previously proposed covarion models of protein evolution for phylogenetic inference in a maximum likelihood framework. Several algorithmic and implementation improvements in this tool over previous versions make computationally expensive tree searches with covarion models more efficient and analyses of large phylogenomic data sets tractable. PROCOV can be used to identify covarion sites by comparing the site likelihoods under the covarion process to the corresponding site likelihoods under a rates-across-sites (RAS process. Those sites with the greatest log-likelihood difference between a 'covarion' and an RAS process were found to be of functional or structural significance in a dataset of bacterial and eukaryotic elongation factors. Conclusion Covarion models implemented in PROCOV may be especially useful for phylogenetic estimation when ancient divergences between sequences have occurred and rates of evolution at sites are likely to have changed over the tree. It can also be used to study lineage-specific functional shifts in protein families that result in changes in the patterns of site variability among subtrees.

Evaluation of goal kicking performance in international rugby union matches.

Science.gov (United States)

Quarrie, Kenneth L; Hopkins, Will G

2015-03-01

Goal kicking is an important element in rugby but has been the subject of minimal research. To develop and apply a method to describe the on-field pattern of goal-kicking and rank the goal kicking performance of players in international rugby union matches. Longitudinal observational study. A generalized linear mixed model was used to analyze goal-kicking performance in a sample of 582 international rugby matches played from 2002 to 2011. The model adjusted for kick distance, kick angle, a rating of the importance of each kick, and venue-related conditions. Overall, 72% of the 6769 kick attempts were successful. Forty-five percent of points scored during the matches resulted from goal kicks, and in 5.7% of the matches the result of the match hinged on the outcome of a kick attempt. There was an extremely large decrease in success with increasing distance (odds ratio for two SD distance 0.06, 90% confidence interval 0.05-0.07) and a small decrease with increasingly acute angle away from the mid-line of the goal posts (odds ratio for 2 SD angle, 0.44, 0.39-0.49). Differences between players were typically small (odds ratio for 2 between-player SD 0.53, 0.45-0.65). The generalized linear mixed model with its random-effect solutions provides a tool for ranking the performance of goal kickers in rugby. This modelling approach could be applied to other performance indicators in rugby and in other sports in which discrete outcomes are measured repeatedly on players or teams. Copyright © 2015. Published by Elsevier Ltd.

78 FR 48169 - Privacy Act of 1974; CMS Computer Match No. 2013-02; HHS Computer Match No. 1306; DoD-DMDC Match...

Science.gov (United States)

2013-08-07

... 1974; CMS Computer Match No. 2013-02; HHS Computer Match No. 1306; DoD-DMDC Match No. 12 AGENCY: Department of Health and Human Services (HHS), Centers for Medicare & Medicaid Services (CMS). ACTION: Notice... of 1974, as amended, this notice establishes a CMP that CMS plans to conduct with the Department of...

Experimental proof of a load resilient external matching solution for the ITER ICRH system

International Nuclear Information System (INIS)

Vervier, M.; Messiaen, A.; Dumortier, P.; Lamalle, P.

2005-01-01

A reliable load resilient external matching scheme for the ITER ICRH system has been successfully tested on the mock-up of the external matching system with variable plasma load simulation. To avoid the deleterious mutual coupling effects the power has been passively distributed among the upper half and the bottom half of the 24 radiating straps of the antenna plug. In this plug the straps are grouped in 8 triplets by 4-ports junctions. The 4 top and 4 bottom triplets are respectively put in parallel outside the antenna plug near a voltage anti-node by means of T junctions. The load resilient matching is then obtained by a 4 parameters single 'conjugate T' (CT) configuration. For an antenna loading variation of about 1 to 8 Ω/m the VSWR at the power source remains below 1.3. The maximum voltage along the line remains equal to the one in the antenna plug and there is a fair power share between the straps. A π0π0 toroidal phasing is easily obtained. The poloidal phasing between the top and bottom triplets is determined by the loading. A straightforward matching procedure is described. Good load resilience is also obtained by replacing the CT by one hybrid

Analysis of the Optimum Gain of a High-Pass L-Matching Network for Rectennas.

Science.gov (United States)

Gasulla, Manel; Jordana, Josep; Robert, Francesc-Josep; Berenguer, Jordi

2017-07-25

Rectennas, which mainly consist of an antenna, matching network, and rectifier, are used to harvest radiofrequency energy in order to power tiny sensor nodes, e.g., the nodes of the Internet of Things. This paper demonstrates for the first time, the existence of an optimum voltage gain for high-pass L-matching networks used in rectennas by deriving an analytical expression. The optimum gain is that which leads to maximum power efficiency of the rectenna. Here, apart from the L-matching network, a Schottky single-diode rectifier was used for the rectenna, which was optimized at 868 MHz for a power range from -30 dBm to -10 dBm. As the theoretical expression depends on parameters not very well-known a priori, an accurate search of the optimum gain for each power level was performed via simulations. Experimental results show remarkable power efficiencies ranging from 16% at -30 dBm to 55% at -10 dBm, which are for almost all the tested power levels the highest published in the literature for similar designs.

Analysis of the Optimum Gain of a High-Pass L-Matching Network for Rectennas

Directory of Open Access Journals (Sweden)

Manel Gasulla

2017-07-01

Full Text Available Rectennas, which mainly consist of an antenna, matching network, and rectifier, are used to harvest radiofrequency energy in order to power tiny sensor nodes, e.g., the nodes of the Internet of Things. This paper demonstrates for the first time, the existence of an optimum voltage gain for high-pass L-matching networks used in rectennas by deriving an analytical expression. The optimum gain is that which leads to maximum power efficiency of the rectenna. Here, apart from the L-matching network, a Schottky single-diode rectifier was used for the rectenna, which was optimized at 868 MHz for a power range from −30 dBm to −10 dBm. As the theoretical expression depends on parameters not very well-known a priori, an accurate search of the optimum gain for each power level was performed via simulations. Experimental results show remarkable power efficiencies ranging from 16% at −30 dBm to 55% at −10 dBm, which are for almost all the tested power levels the highest published in the literature for similar designs.

A nonlinear dynamics approach for incorporating wind-speed patterns into wind-power project evaluation.

Science.gov (United States)

Huffaker, Ray; Bittelli, Marco

2015-01-01

Wind-energy production may be expanded beyond regions with high-average wind speeds (such as the Midwest U.S.A.) to sites with lower-average speeds (such as the Southeast U.S.A.) by locating favorable regional matches between natural wind-speed and energy-demand patterns. A critical component of wind-power evaluation is to incorporate wind-speed dynamics reflecting documented diurnal and seasonal behavioral patterns. Conventional probabilistic approaches remove patterns from wind-speed data. These patterns must be restored synthetically before they can be matched with energy-demand patterns. How to accurately restore wind-speed patterns is a vexing problem spurring an expanding line of papers. We propose a paradigm shift in wind power evaluation that employs signal-detection and nonlinear-dynamics techniques to empirically diagnose whether synthetic pattern restoration can be avoided altogether. If the complex behavior of observed wind-speed records is due to nonlinear, low-dimensional, and deterministic system dynamics, then nonlinear dynamics techniques can reconstruct wind-speed dynamics from observed wind-speed data without recourse to conventional probabilistic approaches. In the first study of its kind, we test a nonlinear dynamics approach in an application to Sugarland Wind-the first utility-scale wind project proposed in Florida, USA. We find empirical evidence of a low-dimensional and nonlinear wind-speed attractor characterized by strong temporal patterns that match up well with regular daily and seasonal electricity demand patterns.

Matching energy sources to demand

International Nuclear Information System (INIS)

Hendry, A.

1979-01-01

Diagrams show the current pattern of energy usage in Scotland; primary energy inputs; the various classes of user; the disposition of input energy in terms of useful and waste energy; an energy flow diagram showing the proportions of primary fuels taken by the various user groups and the proportions of useful energy derived by each. Within the S.S.E.B. area, installed capacity and maximum demand are shown for the present and projected future to the year 2000. A possible energy flow diagram for Scotland in 1996 is shown. The more efficient use of energy is discussed, with particular reference to the use of electricity. The primary energy inputs considered are oil, coal, nuclear, hydro and gas. (U.K.)

Maximum permissible dose

International Nuclear Information System (INIS)

Anon.

1979-01-01

This chapter presents a historic overview of the establishment of radiation guidelines by various national and international agencies. The use of maximum permissible dose and maximum permissible body burden limits to derive working standards is discussed

Spatio-temporal dynamics of global H5N1 outbreaks match bird migration patterns

Directory of Open Access Journals (Sweden)

Yali Si

2009-11-01

Full Text Available The global spread of highly pathogenic avian influenza H5N1 in poultry, wild birds and humans, poses a significant pandemic threat and a serious public health risk. An efficient surveillance and disease control system relies on the understanding of the dispersion patterns and spreading mechanisms of the virus. A space-time cluster analysis of H5N1 outbreaks was used to identify spatio-temporal patterns at a global scale and over an extended period of time. Potential mechanisms explaining the spread of the H5N1 virus, and the role of wild birds, were analyzed. Between December 2003 and December 2006, three global epidemic phases of H5N1 influenza were identified. These H5N1 outbreaks showed a clear seasonal pattern, with a high density of outbreaks in winter and early spring (i.e., October to March. In phase I and II only the East Asia Australian flyway was affected. During phase III, the H5N1 viruses started to appear in four other flyways: the Central Asian flyway, the Black Sea Mediterranean flyway, the East Atlantic flyway and the East Africa West Asian flyway. Six disease cluster patterns along these flyways were found to be associated with the seasonal migration of wild birds. The spread of the H5N1 virus, as demonstrated by the space-time clusters, was associated with the patterns of migration of wild birds. Wild birds may therefore play an important role in the spread of H5N1 over long distances. Disease clusters were also detected at sites where wild birds are known to overwinter and at times when migratory birds were present. This leads to the suggestion that wild birds may also be involved in spreading the H5N1 virus over short distances.

Cache Locality-Centric Parallel String Matching on Many-Core Accelerator Chips

OpenAIRE

Tran, Nhat-Phuong; Lee, Myungho; Choi, Dong Hoon

2015-01-01

Aho-Corasick (AC) algorithm is a multiple patterns string matching algorithm commonly used in computer and network security and bioinformatics, among many others. In order to meet the highly demanding computational requirements imposed on these applications, achieving high performance for the AC algorithm is crucial. In this paper, we present a high performance parallelization of the AC on the many-core accelerator chips such as the Graphic Processing Unit (GPU) from Nvidia and...

Parallel algorithm for determining motion vectors in ice floe images by matching edge features

Science.gov (United States)

Manohar, M.; Ramapriyan, H. K.; Strong, J. P.

1988-01-01

A parallel algorithm is described to determine motion vectors of ice floes using time sequences of images of the Arctic ocean obtained from the Synthetic Aperture Radar (SAR) instrument flown on-board the SEASAT spacecraft. Researchers describe a parallel algorithm which is implemented on the MPP for locating corresponding objects based on their translationally and rotationally invariant features. The algorithm first approximates the edges in the images by polygons or sets of connected straight-line segments. Each such edge structure is then reduced to a seed point. Associated with each seed point are the descriptions (lengths, orientations and sequence numbers) of the lines constituting the corresponding edge structure. A parallel matching algorithm is used to match packed arrays of such descriptions to identify corresponding seed points in the two images. The matching algorithm is designed such that fragmentation and merging of ice floes are taken into account by accepting partial matches. The technique has been demonstrated to work on synthetic test patterns and real image pairs from SEASAT in times ranging from .5 to 0.7 seconds for 128 x 128 images.

MANTEL-HAENSZEL TYPE ESTIMATORS FOR THE COUNTER-MATCHED SAMPLING DESIGN IN NESTED CASE-CONTROL STUDY

OpenAIRE

Fujii, Yoshinori; Zhang, Zhong-Zhan; 藤井, 良宜

2001-01-01

We are concerned with a counter-matched nested case-control study. Assuming the proportional hazards model, the Mantel-Haenszel estimators of hazard rates are presented in two situations. The proposed estimators can be calculated without estimating the nuisance parameter. Consistent estimators of the variance of the proposed hazard rate estimators are also developed. We compare these estimators to the maximum partial likelihood estimators in the asymptotic variance. The methods are illustrate...

Matching Message Design and Depressed Cognition: An Exploration of Attention Patterns for Gain- and Loss-Framed Depression Help-Seeking Messages.

Science.gov (United States)

Lueck, Jennifer A

2017-07-01

Although disproportionally affected by depression, most depressed college students do not seek the help they need. Research has recently uncovered the potential negative effects of depression help-seeking messages if depressed cognition is not considered in the health message design process. It is unclear if depression determines whether and how individuals pay attention to gain- and loss-framed depression help-seeking messages-a mechanism that has significant implications for the strategic planning of health communication interventions. In order to enable the effective matching of message design and audience features, this study investigated attention patterns for gain (n = 75)- and loss (n = 78)-framed depression help-seeking messages using eye-tracking technology and self-report measures. The results confirmed that depression is a characteristic of risk avoidance and negative cognition. Depressed participants tended to pay more attention to disease information that was placed in a loss-framed rather than a gain-framed depression help-seeking message. Using negative message framing strategies for health messages seeking to educate about depression symptoms might therefore be a useful persuasive strategy-particularly when disseminated to vulnerable populations affected by depression. Furthermore, the present study emphasizes the effective use of eye-tracking technology in communication research.

How long do centenarians survive? Life expectancy and maximum lifespan.

Science.gov (United States)

Modig, K; Andersson, T; Vaupel, J; Rau, R; Ahlbom, A

2017-08-01

The purpose of this study was to explore the pattern of mortality above the age of 100 years. In particular, we aimed to examine whether Scandinavian data support the theory that mortality reaches a plateau at particularly old ages. Whether the maximum length of life increases with time was also investigated. The analyses were based on individual level data on all Swedish and Danish centenarians born from 1870 to 1901; in total 3006 men and 10 963 women were included. Birth cohort-specific probabilities of dying were calculated. Exact ages were used for calculations of maximum length of life. Whether maximum age changed over time was analysed taking into account increases in cohort size. The results confirm that there has not been any improvement in mortality amongst centenarians in the past 30 years and that the current rise in life expectancy is driven by reductions in mortality below the age of 100 years. The death risks seem to reach a plateau of around 50% at the age 103 years for men and 107 years for women. Despite the rising life expectancy, the maximum age does not appear to increase, in particular after accounting for the increasing number of individuals of advanced age. Mortality amongst centenarians is not changing despite improvements at younger ages. An extension of the maximum lifespan and a sizeable extension of life expectancy both require reductions in mortality above the age of 100 years. © 2017 The Association for the Publication of the Journal of Internal Medicine.

The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

OpenAIRE

Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

2013-01-01

Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are inve...

A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations.

Directory of Open Access Journals (Sweden)

ThienLuan Ho

Full Text Available Approximate string matching with k-differences has a number of practical applications, ranging from pattern recognition to computational biology. This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k-differences on Graphics Processing Units (GPUs. In the proposed algorithm, all threads in the same GPUs warp share data using warp-shuffle operation instead of accessing the shared memory. Moreover, we implement the proposed algorithm by exploiting the memory structure of GPUs to optimize its performance. Experiment results for real DNA packages revealed that the performance of the proposed algorithm and its implementation archived up to 122.64 and 1.53 times compared to that of sequential algorithm on CPU and previous parallel approximate string matching algorithm on GPUs, respectively.

Analytical maximum-likelihood method to detect patterns in real networks

International Nuclear Information System (INIS)

Squartini, Tiziano; Garlaschelli, Diego

2011-01-01

In order to detect patterns in real networks, randomized graph ensembles that preserve only part of the topology of an observed network are systematically used as fundamental null models. However, the generation of them is still problematic. Existing approaches are either computationally demanding and beyond analytic control or analytically accessible but highly approximate. Here, we propose a solution to this long-standing problem by introducing a fast method that allows one to obtain expectation values and standard deviations of any topological property analytically, for any binary, weighted, directed or undirected network. Remarkably, the time required to obtain the expectation value of any property analytically across the entire graph ensemble is as short as that required to compute the same property using the adjacency matrix of the single original network. Our method reveals that the null behavior of various correlation properties is different from what was believed previously, and is highly sensitive to the particular network considered. Moreover, our approach shows that important structural properties (such as the modularity used in community detection problems) are currently based on incorrect expressions, and provides the exact quantities that should replace them.

Best Practices for NPT Transit Matching

International Nuclear Information System (INIS)

Gilligan, Kimberly V.; Whitaker, J. Michael; Oakberg, John A.; Snow, Catherine

2016-01-01

Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.

Best Practices for NPT Transit Matching

Energy Technology Data Exchange (ETDEWEB)

Gilligan, Kimberly V. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Whitaker, J. Michael [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Oakberg, John A. [Tetra Tech, Inc., Oak Ridge, TN (United States); Snow, Catherine [Sno Consulting, LLC, Sandy, UT (United States)

2016-09-01

Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.

Sistem Pendukung Keputusan Penilaian Proposal Kegiatan PNPM MPd Menggunakan Metode Profile Matching dan Analytic Hierarchy Process (AHP

Directory of Open Access Journals (Sweden)

Ahmad Mufid

2016-01-01

Full Text Available Assessment of PNPM-MPd’s proposal not run quickly and objectively. The purpose of this research is to create software to help the verification team in conducting an objective assessment of the proposals using the profile matching method and the analytic hierarchy process (AHP. Profile matching method is used to provide an assessment, determination of the gap, and the weighting criteria. While the AHP method is used to calculate the pairwise comparison matrices, eigenvalues​​, priorities, maximum eigenvalues​​, consistency index (CI and consistency ratio (CR. CR values ​​are used to determine the order in which proposals will be funded by BLM. The final result of this research is decision support system software for assessment of PNPM-MPd’s proposal that can determine the rank of the highest value to lowest. Keywords : Assessment; Profile matching; Analytic Hierarchy Process (AHP

Privacy‐Preserving Friend Matching Protocol approach for Pre‐match in Social Networks

DEFF Research Database (Denmark)

Ople, Shubhangi S.; Deshmukh, Aaradhana A.; Mihovska, Albena Dimitrova

2016-01-01

Social services make the most use of the user profile matching to help the users to discover friends with similar social attributes (e.g. interests, location, age). However, there are many privacy concerns that prevent to enable this functionality. Privacy preserving encryption is not suitable...... for use in social networks due to its data sharing problems and information leakage. In this paper, we propose a novel framework for privacy–preserving profile matching. We implement both the client and server portion of the secure match and evaluate its performance network dataset. The results show...

Personality-matching habitat choice, rather than behavioural plasticity, is a likely driver of a phenotype-environment covariance.

Science.gov (United States)

Holtmann, Benedikt; Santos, Eduardo S A; Lara, Carlos E; Nakagawa, Shinichi

2017-10-11

An emerging hypothesis of animal personality posits that animals choose the habitat that best fits their personality, and that the match between habitat and personality can facilitate population differentiation, and eventually speciation. However, behavioural plasticity and the adjustment of behaviours to new environments have been a classical explanation for such matching patterns. Using a population of dunnocks ( Prunella modularis ), we empirically tested whether personality or behavioural plasticity is responsible for the non-random distribution of shy and bold individuals in a heterogeneous environment. We found evidence for bold individuals settling in areas with high human disturbance, but also that birds became bolder with increasing age. Importantly, personality primarily determines the distribution of individuals, and behavioural adjustment over time contributes very little to the observed patterns. We cannot, however, exclude a possibility of very early behavioural plasticity (a type of developmental plasticity) shaping what we refer to as 'personality'. Nonetheless, our findings highlight the role personality plays in shaping population structure, lending support to the theory of personality-mediated speciation. Moreover, personality-matching habitat choice has important implications for population management and conservation. © 2017 The Author(s).

Collective animal behavior from Bayesian estimation and probability matching.

Directory of Open Access Journals (Sweden)

Alfonso Pérez-Escudero

2011-11-01

Full Text Available Animals living in groups make movement decisions that depend, among other factors, on social interactions with other group members. Our present understanding of social rules in animal collectives is mainly based on empirical fits to observations, with less emphasis in obtaining first-principles approaches that allow their derivation. Here we show that patterns of collective decisions can be derived from the basic ability of animals to make probabilistic estimations in the presence of uncertainty. We build a decision-making model with two stages: Bayesian estimation and probabilistic matching. In the first stage, each animal makes a Bayesian estimation of which behavior is best to perform taking into account personal information about the environment and social information collected by observing the behaviors of other animals. In the probability matching stage, each animal chooses a behavior with a probability equal to the Bayesian-estimated probability that this behavior is the most appropriate one. This model derives very simple rules of interaction in animal collectives that depend only on two types of reliability parameters, one that each animal assigns to the other animals and another given by the quality of the non-social information. We test our model by obtaining theoretically a rich set of observed collective patterns of decisions in three-spined sticklebacks, Gasterosteus aculeatus, a shoaling fish species. The quantitative link shown between probabilistic estimation and collective rules of behavior allows a better contact with other fields such as foraging, mate selection, neurobiology and psychology, and gives predictions for experiments directly testing the relationship between estimation and collective behavior.

The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching

International Nuclear Information System (INIS)

Wadlinger, E.A.; Garnett, R.W.

1996-01-01

The issue involved in the simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ / 4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x = β y and α x = α y = 0 at the exit of the RFQ. This matching between the RFQ and DTL is described. (author)

The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching

International Nuclear Information System (INIS)

Wadlinger, E.A.; Garnett, R.W.

1996-01-01

The issue involved in simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ/4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x =β y and α x =α y =0 at the exit of the RFQ. This matching between the RFQ and DTL is described

Subtropical Arctic Ocean temperatures during the Palaeocene/Eocene thermal maximum

Science.gov (United States)

Sluijs, A.; Schouten, S.; Pagani, M.; Woltering, M.; Brinkhuis, H.; Damste, J.S.S.; Dickens, G.R.; Huber, M.; Reichart, G.-J.; Stein, R.; Matthiessen, J.; Lourens, L.J.; Pedentchouk, N.; Backman, J.; Moran, K.; Clemens, S.; Cronin, T.; Eynaud, F.; Gattacceca, J.; Jakobsson, M.; Jordan, R.; Kaminski, M.; King, J.; Koc, N.; Martinez, N.C.; McInroy, D.; Moore, T.C.; O'Regan, M.; Onodera, J.; Palike, H.; Rea, B.; Rio, D.; Sakamoto, T.; Smith, D.C.; St John, K.E.K.; Suto, I.; Suzuki, N.; Takahashi, K.; Watanabe, M. E.; Yamamoto, M.

2006-01-01

The Palaeocene/Eocene thermal maximum, ???55 million years ago, was a brief period of widespread, extreme climatic warming, that was associated with massive atmospheric greenhouse gas input. Although aspects of the resulting environmental changes are well documented at low latitudes, no data were available to quantify simultaneous changes in the Arctic region. Here we identify the Palaeocene/Eocene thermal maximum in a marine sedimentary sequence obtained during the Arctic Coring Expedition. We show that sea surface temperatures near the North Pole increased from ???18??C to over 23??C during this event. Such warm values imply the absence of ice and thus exclude the influence of ice-albedo feedbacks on this Arctic warming. At the same time, sea level rose while anoxic and euxinic conditions developed in the ocean's bottom waters and photic zone, respectively. Increasing temperature and sea level match expectations based on palaeoclimate model simulations, but the absolute polar temperatures that we derive before, during and after the event are more than 10??C warmer than those model-predicted. This suggests that higher-than-modern greenhouse gas concentrations must have operated in conjunction with other feedback mechanisms-perhaps polar stratospheric clouds or hurricane-induced ocean mixing-to amplify early Palaeogene polar temperatures. ?? 2006 Nature Publishing Group.

A tiger cannot change its stripes: using a three-dimensional model to match images of living tigers and tiger skins.

Science.gov (United States)

Hiby, Lex; Lovell, Phil; Patil, Narendra; Kumar, N Samba; Gopalaswamy, Arjun M; Karanth, K Ullas

2009-06-23

The tiger is one of many species in which individuals can be identified by surface patterns. Camera traps can be used to record individual tigers moving over an array of locations and provide data for monitoring and studying populations and devising conservation strategies. We suggest using a combination of algorithms to calculate similarity scores between pattern samples scanned from the images to automate the search for a match to a new image. We show how using a three-dimensional surface model of a tiger to scan the pattern samples allows comparison of images that differ widely in camera angles and body posture. The software, which is free to download, considerably reduces the effort required to maintain an image catalogue and we suggest it could be used to trace the origin of a tiger skin by searching a central database of living tigers' images for matches to an image of the skin.

Tensor GSVD of Patient- and Platform-Matched Tumor and Normal DNA Copy-Number Profiles Uncovers Chromosome Arm-Wide Patterns of Tumor-Exclusive Platform-Consistent Alterations Encoding for Cell Transformation and Predicting Ovarian Cancer Survival

Science.gov (United States)

Sankaranarayanan, Preethi; Schomay, Theodore E.; Aiello, Katherine A.; Alter, Orly

2015-01-01

The number of large-scale high-dimensional datasets recording different aspects of a single disease is growing, accompanied by a need for frameworks that can create one coherent model from multiple tensors of matched columns, e.g., patients and platforms, but independent rows, e.g., probes. We define and prove the mathematical properties of a novel tensor generalized singular value decomposition (GSVD), which can simultaneously find the similarities and dissimilarities, i.e., patterns of varying relative significance, between any two such tensors. We demonstrate the tensor GSVD in comparative modeling of patient- and platform-matched but probe-independent ovarian serous cystadenocarcinoma (OV) tumor, mostly high-grade, and normal DNA copy-number profiles, across each chromosome arm, and combination of two arms, separately. The modeling uncovers previously unrecognized patterns of tumor-exclusive platform-consistent co-occurring copy-number alterations (CNAs). We find, first, and validate that each of the patterns across only 7p and Xq, and the combination of 6p+12p, is correlated with a patient’s prognosis, is independent of the tumor’s stage, the best predictor of OV survival to date, and together with stage makes a better predictor than stage alone. Second, these patterns include most known OV-associated CNAs that map to these chromosome arms, as well as several previously unreported, yet frequent focal CNAs. Third, differential mRNA, microRNA, and protein expression consistently map to the DNA CNAs. A coherent picture emerges for each pattern, suggesting roles for the CNAs in OV pathogenesis and personalized therapy. In 6p+12p, deletion of the p21-encoding CDKN1A and p38-encoding MAPK14 and amplification of RAD51AP1 and KRAS encode for human cell transformation, and are correlated with a cell’s immortality, and a patient’s shorter survival time. In 7p, RPA3 deletion and POLD2 amplification are correlated with DNA stability, and a longer survival. In Xq

MATCH: An Atom- Typing Toolset for Molecular Mechanics Force Fields

Science.gov (United States)

Yesselman, Joseph D.; Price, Daniel J.; Knight, Jennifer L.; Brooks, Charles L.

2011-01-01

We introduce a toolset of program libraries collectively titled MATCH (Multipurpose Atom-Typer for CHARMM) for the automated assignment of atom types and force field parameters for molecular mechanics simulation of organic molecules. The toolset includes utilities for the conversion from multiple chemical structure file formats into a molecular graph. A general chemical pattern-matching engine using this graph has been implemented whereby assignment of molecular mechanics atom types, charges and force field parameters is achieved by comparison against a customizable list of chemical fragments. While initially designed to complement the CHARMM simulation package and force fields by generating the necessary input topology and atom-type data files, MATCH can be expanded to any force field and program, and has core functionality that makes it extendable to other applications such as fragment-based property prediction. In the present work, we demonstrate the accurate construction of atomic parameters of molecules within each force field included in CHARMM36 through exhaustive cross validation studies illustrating that bond increment rules derived from one force field can be transferred to another. In addition, using leave-one-out substitution it is shown that it is also possible to substitute missing intra and intermolecular parameters with ones included in a force field to complete the parameterization of novel molecules. Finally, to demonstrate the robustness of MATCH and the coverage of chemical space offered by the recent CHARMM CGENFF force field (Vanommeslaeghe, et al., JCC., 2010, 31, 671–690), one million molecules from the PubChem database of small molecules are typed, parameterized and minimized. PMID:22042689

On the Quirks of Maximum Parsimony and Likelihood on Phylogenetic Networks

OpenAIRE

Bryant, Christopher; Fischer, Mareike; Linz, Simone; Semple, Charles

2015-01-01

Maximum parsimony is one of the most frequently-discussed tree reconstruction methods in phylogenetic estimation. However, in recent years it has become more and more apparent that phylogenetic trees are often not sufficient to describe evolution accurately. For instance, processes like hybridization or lateral gene transfer that are commonplace in many groups of organisms and result in mosaic patterns of relationships cannot be represented by a single phylogenetic tree. This is why phylogene...

Matched-Filter Thermography

Directory of Open Access Journals (Sweden)

Nima Tabatabaei

2018-04-01

Full Text Available Conventional infrared thermography techniques, including pulsed and lock-in thermography, have shown great potential for non-destructive evaluation of broad spectrum of materials, spanning from metals to polymers to biological tissues. However, performance of these techniques is often limited due to the diffuse nature of thermal wave fields, resulting in an inherent compromise between inspection depth and depth resolution. Recently, matched-filter thermography has been introduced as a means for overcoming this classic limitation to enable depth-resolved subsurface thermal imaging and improving axial/depth resolution. This paper reviews the basic principles and experimental results of matched-filter thermography: first, mathematical and signal processing concepts related to matched-fileting and pulse compression are discussed. Next, theoretical modeling of thermal-wave responses to matched-filter thermography using two categories of pulse compression techniques (linear frequency modulation and binary phase coding are reviewed. Key experimental results from literature demonstrating the maintenance of axial resolution while inspecting deep into opaque and turbid media are also presented and discussed. Finally, the concept of thermal coherence tomography for deconvolution of thermal responses of axially superposed sources and creation of depth-selective images in a diffusion-wave field is reviewed.

Spatial competition with intermediated matching

NARCIS (Netherlands)

van Raalte, C.L.J.P.; Webers, H.M.

1995-01-01

This paper analyzes the spatial competition in commission fees between two match makers. These match makers serve as middlemen between buyers and sellers who are located uniformly on a circle. The profits of the match makers are determined by their respective market sizes. A limited willingness to

PREDICTING THE MATCH OUTCOME IN ONE DAY INTERNATIONAL CRICKET MATCHES, WHILE THE GAME IS IN PROGRESS

Directory of Open Access Journals (Sweden)

Michael Bailey

2006-12-01

Full Text Available Millions of dollars are wagered on the outcome of one day international (ODI cricket matches, with a large percentage of bets occurring after the game has commenced. Using match information gathered from all 2200 ODI matches played prior to January 2005, a range of variables that could independently explain statistically significant proportions of variation associated with the predicted run totals and match outcomes were created. Such variables include home ground advantage, past performances, match experience, performance at the specific venue, performance against the specific opposition, experience at the specific venue and current form. Using a multiple linear regression model, prediction variables were numerically weighted according to statistical significance and used to predict the match outcome. With the use of the Duckworth-Lewis method to determine resources remaining, at the end of each completed over, the predicted run total of the batting team could be updated to provide a more accurate prediction of the match outcome. By applying this prediction approach to a holdout sample of matches, the efficiency of the "in the run" wagering market could be assessed. Preliminary results suggest that the market is prone to overreact to events occurring throughout the course of the match, thus creating brief inefficiencies in the wagering market

Vortex lattice matching effects in a washboard pinning potential induced by Co nanostripe arrays

International Nuclear Information System (INIS)

Dobrovolskiy, Oleksandr V.; Begun, Evgeniya; Huth, Michael; Shklovskij, Valerij A.; Tsindlekht, Menachem I.

2011-01-01

We furnish superconducting Nb thin films with linearly-extended uniaxial pinning nanostructures. An array of Co stripes is deposited by focused electron beam-induced deposition. Nanostructures are designed to be commensurate with the vortex lattice at small magnetic fields. We investigate vortex lattice matching effects by magneto-transport measurements. Drops in ρ(B) are observed only when the vortex lattice parameter matches the nanostructure period. No matching effects corresponding to the Co stripe width have been observed. Drops in ρ(B) are more pronounced for the vortex motion perpendicular to the Co stripes. An advanced mask-less nanofabrication technique, focused electron beam-induced deposition (FEBID), has been employed on epitaxial Nb thin films to prepare ferromagnetic decorations in the form of an array of Co stripes. These substantially modify the non-patterned films' superconducting properties, providing a washboard-like pinning potential landscape for the vortex motion. At small magnetic fields B ≤ 0.1 T, vortex lattice matching effects have been investigated by magneto-transport measurements. Step-like drops in the field dependencies of the films resistivity ρ(B) have been observed in particular for the vortex motion perpendicular to the Co stripes. The field values, corresponding to the middle points of these drops in ρ(B), meet the vortex lattice parameter matching the pinning structure's period. These disagree with the results of Jaque et al. (2002) , who observed matching effects corresponding to the stripe width in Nb films grown on periodically distributed submicrometric lines of Ni.

Image Segmentation, Registration, Compression, and Matching

Science.gov (United States)

Yadegar, Jacob; Wei, Hai; Yadegar, Joseph; Ray, Nilanjan; Zabuawala, Sakina

2011-01-01

A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity

Optimizing the maximum reported cluster size in the spatial scan statistic for ordinal data.

Science.gov (United States)

Kim, Sehwi; Jung, Inkyung

2017-01-01

The spatial scan statistic is an important tool for spatial cluster detection. There have been numerous studies on scanning window shapes. However, little research has been done on the maximum scanning window size or maximum reported cluster size. Recently, Han et al. proposed to use the Gini coefficient to optimize the maximum reported cluster size. However, the method has been developed and evaluated only for the Poisson model. We adopt the Gini coefficient to be applicable to the spatial scan statistic for ordinal data to determine the optimal maximum reported cluster size. Through a simulation study and application to a real data example, we evaluate the performance of the proposed approach. With some sophisticated modification, the Gini coefficient can be effectively employed for the ordinal model. The Gini coefficient most often picked the optimal maximum reported cluster sizes that were the same as or smaller than the true cluster sizes with very high accuracy. It seems that we can obtain a more refined collection of clusters by using the Gini coefficient. The Gini coefficient developed specifically for the ordinal model can be useful for optimizing the maximum reported cluster size for ordinal data and helpful for properly and informatively discovering cluster patterns.

Approaches for Stereo Matching

Directory of Open Access Journals (Sweden)

Takouhi Ozanian

1995-04-01

Full Text Available This review focuses on the last decade's development of the computational stereopsis for recovering three-dimensional information. The main components of the stereo analysis are exposed: image acquisition and camera modeling, feature selection, feature matching and disparity interpretation. A brief survey is given of the well known feature selection approaches and the estimation parameters for this selection are mentioned. The difficulties in identifying correspondent locations in the two images are explained. Methods as to how effectively to constrain the search for correct solution of the correspondence problem are discussed, as are strategies for the whole matching process. Reasons for the occurrence of matching errors are considered. Some recently proposed approaches, employing new ideas in the modeling of stereo matching in terms of energy minimization, are described. Acknowledging the importance of computation time for real-time applications, special attention is paid to parallelism as a way to achieve the required level of performance. The development of trinocular stereo analysis as an alternative to the conventional binocular one, is described. Finally a classification based on the test images for verification of the stereo matching algorithms, is supplied.

Optical Characterization of Thick Growth Orientation-Patterned Gallium Arsenide

National Research Council Canada - National Science Library

Meyer, Joshua W

2006-01-01

.... Orientation patterned gallium arsenide (OPGaAs) is a promising nonlinear conversion material because it has broad transparency and can be engineered for specific pump laser and output wavelengths using quasi-phase matching techniques...

Stinging Insect Matching Game

Science.gov (United States)

... for Kids ▸ Stinging Insect Matching Game Share | Stinging Insect Matching Game Stinging insects can ruin summer fun for those who are ... the difference between the different kinds of stinging insects in order to keep your summer safe and ...

Neural-network-based system for recognition of partially occluded shapes and patterns

Science.gov (United States)

Mital, Dinesh P.; Teoh, Eam-Khwang; Amarasinghe, S. K.; Suganthan, P. N.

1996-10-01

The purpose of this paper is to demonstrate how a structural matching approach can be used to perfonn effective rotational invariant fingerprint identification. In this approach, each of the exiracted features is correlated with Live of its nearest neighbouring features to form a local feature gmup for a first-stage matching. After that, the feature with the highest match is used as a central feature whereby all the other features are correlated to form a global feature group for a second.stage matching. The correlation between the features is in terms of distance and relative angle. This approach actually make the matching method rotational invariant A substantial amount of testing was carried out and it shows that this matching technique is capable of matching the four basic fingerprint patterns with an average matching time of4 seconds on a 66Mhz, 486 DX personal computer.

Design Optimization and Site Matching of Direct-Drive Permanent Magnet Wind Generator Systems

DEFF Research Database (Denmark)

Li, H.; Chen, Zhe

2009-01-01

This paper investigates the possible site matching of the direct-drive wind turbine concepts based on the electromagnetic design optimization of permanent magnet (PM) generator systems. Firstly, the analytical models of a three-phase radial-flux PM generator with a back-to-back power converter...... of the maximum wind energy capture, the rotor diameter and the rated wind speed of a direct-drive wind turbine with the optimum PM generator are determined. The annual energy output (AEO) is also presented using the Weibull density function. Finally, the maximum AEO per cost (AEOPC) of the optimized wind...... are presented. The optimum design models of direct-drive PM wind generation system are developed with an improved genetic algorithm, and a 500-kW direct-drive PM generator for the minimal generator active material cost is compared to demonstrate the effectiveness of the design optimization. Forty-five PM...

Audit on the Efficient Use of Cross-Matched Blood in Elective Total Hip and Total Knee Replacement

Science.gov (United States)

Rogers, BA; Johnstone, DJ

2006-01-01

INTRODUCTION This prospective audit studies the use of cross-matched blood in 301 patients over a 1-year period undergoing total knee (TKR) and total hip replacement (THR) surgery in an orthopaedic unit. PATIENTS AND METHODS Analysis over the first 6 months revealed a high level of unnecessary cross-matched blood. The following interventions were introduced: (i) to cease routine cross-matching for THR; (ii) all patients to have a check full blood count on day 2 after surgery; and (iii) Hb < 8 g/dl to be considered as the trigger for transfusion in patients over 65 years and free from significant co-morbidity. These changes are in accordance with published national guidelines [Anon. Guidelines for the clinical use of red cell transfusions. Br J Haematol 2001; 113: 24–31]. RESULTS In the next 6 months, the number of units cross-matched but not transfused fell by 96% for THR, and the cross-match transfusion (C:T) ratio reduced from 3.21 to 1.62. Reductions were also observed for the TKR cohort. These results provide evidence of a substantial risk and cost benefit in the use of this limited resource. A telephone survey of 44 hospitals revealed that 20 hospitals routinely cross-matched blood for THR and 11 do so for TKR. CONCLUSIONS Changes can be made to the Maximum Surgical Blood Ordering Schedules (MSBOS) in other orthopaedic units according to national guidelines. PMID:16551419

Inferring Pairwise Interactions from Biological Data Using Maximum-Entropy Probability Models.

Directory of Open Access Journals (Sweden)

Richard R Stein

2015-07-01

Full Text Available Maximum entropy-based inference methods have been successfully used to infer direct interactions from biological datasets such as gene expression data or sequence ensembles. Here, we review undirected pairwise maximum-entropy probability models in two categories of data types, those with continuous and categorical random variables. As a concrete example, we present recently developed inference methods from the field of protein contact prediction and show that a basic set of assumptions leads to similar solution strategies for inferring the model parameters in both variable types. These parameters reflect interactive couplings between observables, which can be used to predict global properties of the biological system. Such methods are applicable to the important problems of protein 3-D structure prediction and association of gene-gene networks, and they enable potential applications to the analysis of gene alteration patterns and to protein design.

Career patterns : A twenty-year panel study

NARCIS (Netherlands)

Biemann, Torsten; Zacher, Hannes; Feldman, Daniel C.

2012-01-01

Using 20 years of employment and job mobility data from a representative German sample (N=1259), we employ optimal matching analysis (OMA) to identify six career patterns which deviate from the traditional career path of long-term, full-time employment in one organization. Then, in further analyses,

The relationship between the JobMatchTalent test and the NEO PI-R: construct validation of an instrument designed for recruitment of personnel.

Directory of Open Access Journals (Sweden)

Danilo Garcia

Full Text Available BACKGROUND: Personality measures in recruitment situations need to (1 cover the Big-Five model of personality and (2 focus on interpersonal requirements of jobs. We investigated the relationship between the JobMatchTalent test and the NEO Personality Inventory-Revised (NEO PI-R. The JobMatchTalent consists of three areas (i.e., Stability Patterns, Action Patterns, and Relation Patterns divided in 10 main scales providing a deeper picture of the employee (e.g., Work Structure, Tolerance. METHOD: The participants (N = 390 were recruited from the professional network LinkedIn and completed online versions of both instruments. We used correlation analysis to investigate the construct validity of the JobMatchTalent test by identifying significant correlation coefficients no lower than ±.30 (i.e., convergent validity and those with nonsignificant correlations (i.e., discriminant validity. Regression analyses were used to investigate the variance of the NEO PI-R dimensions that was explained by the JobMatchTalent test. RESULTS: Four of the NEO PI-R dimensions showed considerable overlap with the following JobMatchTalent main scales: (1 Work structure and Decision Characteristics, which both are measures of thoughtfulness, planning, and order (i.e., Conscientiousness; (2 Inner drive, Activity, Drive, Acting, and Communication, which represent different aspects of being outgoing and extrovert (i.e., Extraversion; (3 Tolerance and Social interest, which measure a person's interest and ability to create social relations (i.e., Agreeableness; and (4 Stress Index, a measure of emotional stability (i.e., the opposite of Neuroticism. All 5 NEO PI-R dimensions overlapped with the JobMatchTalent sub-scales. CONCLUSIONS: The study suggests that 4 of the NEO PI-R dimensions are logically categorized along the JobMatchTalent main scales: (1 Order and Thoughtfulness, (2 Energy and Extraversion, (3 Social Adaptation and Interest, and (4 Emotion Control. Hence

Multidetector computed tomography of the head in acute stroke: predictive value of different patterns of the dense artery sign revealed by maximum intensity projection reformations for location and extent of the infarcted area

Energy Technology Data Exchange (ETDEWEB)

Gadda, Davide; Vannucchi, Letizia; Niccolai, Franco; Neri, Anna T.; Carmignani, Luca; Pacini, Patrizio [Ospedale del Ceppo, U.O. Radiodiagnostica, Pistoia (Italy)

2005-12-01

Maximum intensity projections reconstructions from 2.5 mm unenhanced multidetector computed tomography axial slices were obtained from 49 patients within the first 6 h of anterior-circulation cerebral strokes to identify different patterns of the dense artery sign and their prognostic implications for location and extent of the infarcted areas. The dense artery sign was found in 67.3% of cases. Increased density of the whole M1 segment with extension to M2 of the middle cerebral artery was associated with a wider extension of cerebral infarcts in comparison to M1 segment alone or distal M1 and M2. A dense sylvian branch of the middle cerebral artery pattern was associated with a more restricted extension of infarct territory. We found 62.5% of patients without a demonstrable dense artery to have a limited peripheral cortical or capsulonuclear lesion. In patients with a 7-10 points on the Alberta Stroke Early Programme Computed Tomography Score and a dense proximal MCA in the first hours of ictus the mean decrease in the score between baseline and follow-up was 5.09{+-}1.92 points. In conclusion, maximum intensity projections from thin-slice images can be quickly obtained from standard computed tomography datasets using a multidetector scanner and are useful in identifying and correctly localizing the dense artery sign, with prognostic implications for the entity of cerebral damage. (orig.)

Gait impairment in cervical spondylotic myelopathy: comparison with age- and gender-matched healthy controls.

LENUS (Irish Health Repository)

Malone, Ailish

2012-12-01

Gait impairment is a primary symptom of cervical spondylotic myelopathy (CSM); however, little is known about specific kinetic and kinematic gait parameters. The objectives of the study were: (1) to compare gait patterns of people with untreated CSM to those of age- and gender-matched healthy controls; (2) to examine the effect of gait speed on kinematic and kinetic parameters.

A silicon pad shower maximum detector for a Shashlik calorimeter

International Nuclear Information System (INIS)

Alvsvaag, S.J.; Maeland, O.A.; Klovning, A.

1995-01-01

The new luminosity monitor of the DELPHI detector, STIC (Small angle TIle Calorimeter), was built using a Shashlik technique. This technique does not provide longitudinal sampling of the showers, which limits the measurement of the direction of the incident particles and the e-π separation. For these reasons STIC was equipped with a Silicon Pad Shower Maximum Detector (SPSMD). In order to match the silicon detectors to the Shashlick read out by wavelength shifter (WLS) fibers, the silicon wafers had to be drilled with a precision better than 10μm without damaging the active area of the detectors. This paper describes the SPSMD with emphasis on the fabrication techniques and on the components used. Some preliminary results of the detector performance from data taken with a 45GeV electron beam at CERN are presented. (orig.)

Optimizing electrical load pattern in Kuwait using grid connected photovoltaic systems

International Nuclear Information System (INIS)

Al-Hasan, A.Y.; Ghoneim, A.A.; Abdullah, A.H.

2004-01-01

Grid connected photovoltaic systems is one of the most promising applications of photovoltaic systems. These systems are employed in applications where utility service is already available. In this case, there is no need for battery storage because grid power may be used to supplement photovoltaic systems (PV) when the load exceeds available PV generation. The load receives electricity from both the photovoltaic array and the utility grid. In this system, the load is the total electrical energy consumption. The main objective of the present work is to optimize the electrical load pattern in Kuwait using grid connected PV systems. In this situation, the electric load demand can be satisfied from both the photovoltaic array and the utility grid. The performance of grid connected photovoltaic systems in the Kuwait climate has been evaluated. It was found that the peak load matches the maximum incident solar radiation in Kuwait, which would emphasize the role of using the PV station to minimize the electrical load demand. In addition, a significant reduction in peak load can be achieved with grid connected PV systems

Real-time eSports Match Result Prediction

OpenAIRE

Yang, Yifan; Qin, Tian; Lei, Yu-Heng

2016-01-01

In this paper, we try to predict the winning team of a match in the multiplayer eSports game Dota 2. To address the weaknesses of previous work, we consider more aspects of prior (pre-match) features from individual players' match history, as well as real-time (during-match) features at each minute as the match progresses. We use logistic regression, the proposed Attribute Sequence Model, and their combinations as the prediction models. In a dataset of 78362 matches where 20631 matches contai...

Boxed Permutation Pattern Matching

DEFF Research Database (Denmark)

Amit, Mika; Bille, Philip; Cording, Patrick Hagge

2016-01-01

the goal is to only find the boxed subsequences of T that are order-isomorphic to P. This problem was introduced by Bruner and Lackner who showed that it can be solved in O(n3) time. Cho et al. [CPM 2015] gave an O(n2m) time algorithm and improved it to O(n2 logm). In this paper we present a solution...

Superresolution with Seismic Arrays using Empirical Matched Field Processing

Energy Technology Data Exchange (ETDEWEB)

Harris, D B; Kvaerna, T

2010-03-24

Scattering and refraction of seismic waves can be exploited with empirical matched field processing of array observations to distinguish sources separated by much less than the classical resolution limit. To describe this effect, we use the term 'superresolution', a term widely used in the optics and signal processing literature to denote systems that break the diffraction limit. We illustrate superresolution with Pn signals recorded by the ARCES array in northern Norway, using them to identify the origins with 98.2% accuracy of 549 explosions conducted by closely-spaced mines in northwest Russia. The mines are observed at 340-410 kilometers range and are separated by as little as 3 kilometers. When viewed from ARCES many are separated by just tenths of a degree in azimuth. This classification performance results from an adaptation to transient seismic signals of techniques developed in underwater acoustics for localization of continuous sound sources. Matched field processing is a potential competitor to frequency-wavenumber and waveform correlation methods currently used for event detection, classification and location. It operates by capturing the spatial structure of wavefields incident from a particular source in a series of narrow frequency bands. In the rich seismic scattering environment, closely-spaced sources far from the observing array nonetheless produce distinct wavefield amplitude and phase patterns across the small array aperture. With observations of repeating events, these patterns can be calibrated over a wide band of frequencies (e.g. 2.5-12.5 Hertz) for use in a power estimation technique similar to frequency-wavenumber analysis. The calibrations enable coherent processing at high frequencies at which wavefields normally are considered incoherent under a plane wave model.

Maximized gust loads for a nonlinear airplane using matched filter theory and constrained optimization

Science.gov (United States)

Scott, Robert C.; Perry, Boyd, III; Pototzky, Anthony S.

1991-01-01

This paper describes and illustrates two matched-filter-theory based schemes for obtaining maximized and time-correlated gust-loads for a nonlinear airplane. The first scheme is computationally fast because it uses a simple one-dimensional search procedure to obtain its answers. The second scheme is computationally slow because it uses a more complex multidimensional search procedure to obtain its answers, but it consistently provides slightly higher maximum loads than the first scheme. Both schemes are illustrated with numerical examples involving a nonlinear control system.

Maximum entropy estimation of a Benzene contaminated plume using ecotoxicological assays

International Nuclear Information System (INIS)

Wahyudi, Agung; Bartzke, Mariana; Küster, Eberhard; Bogaert, Patrick

2013-01-01

Ecotoxicological bioassays, e.g. based on Danio rerio teratogenicity (DarT) or the acute luminescence inhibition with Vibrio fischeri, could potentially lead to significant benefits for detecting on site contaminations on qualitative or semi-quantitative bases. The aim was to use the observed effects of two ecotoxicological assays for estimating the extent of a Benzene groundwater contamination plume. We used a Maximum Entropy (MaxEnt) method to rebuild a bivariate probability table that links the observed toxicity from the bioassays with Benzene concentrations. Compared with direct mapping of the contamination plume as obtained from groundwater samples, the MaxEnt concentration map exhibits on average slightly higher concentrations though the global pattern is close to it. This suggest MaxEnt is a valuable method to build a relationship between quantitative data, e.g. contaminant concentrations, and more qualitative or indirect measurements, in a spatial mapping framework, which is especially useful when clear quantitative relation is not at hand. - Highlights: ► Ecotoxicological shows significant benefits for detecting on site contaminations. ► MaxEnt to rebuild qualitative link on concentration and ecotoxicological assays. ► MaxEnt shows similar pattern when compared with concentrations map of groundwater. ► MaxEnt is a valuable method especially when quantitative relation is not at hand. - A Maximum Entropy method to rebuild qualitative relationships between Benzene groundwater concentrations and their ecotoxicological effect.

Improving maximum power point tracking of partially shaded photovoltaic system by using IPSO-BELBIC

International Nuclear Information System (INIS)

El-Garhy, M. Abd Al-Alim; Mubarak, R.I.; El-Bably, M.

2017-01-01

Solar photovoltaic (PV) arrays in remote applications are often related to the rapid changes in the partial shading pattern. Rapid changes of the partial shading pattern make the tracking of maximum power point (MPP) of the global peak through the local ones too difficult. An essential need to make a fast and efficient algorithm to detect the peaks values which always vary as the sun irradiance changes. This paper presents two algorithms based on the improved particle swarm optimization technique one of them with PID controller (IPSO-PID), and the other one with Brain Emotional Learning Based Intelligent Controller (IPSO-BELBIC). These techniques improve the maximum power point (MPP) tracking capabilities for photovoltaic (PV) system under partial shading circumstances. The main aim of these improved algorithms is to accelerate the velocity of IPSO to reach to (MPP) and increase its efficiency. These algorithms also improve the tracking time under complex irradiance conditions. Based on these conditions, the tracking time of these presented techniques improves to 2 msec, with an efficiency of 100%.

Improving maximum power point tracking of partially shaded photovoltaic system by using IPSO-BELBIC

Science.gov (United States)

Al-Alim El-Garhy, M. Abd; Mubarak, R. I.; El-Bably, M.

2017-08-01

Solar photovoltaic (PV) arrays in remote applications are often related to the rapid changes in the partial shading pattern. Rapid changes of the partial shading pattern make the tracking of maximum power point (MPP) of the global peak through the local ones too difficult. An essential need to make a fast and efficient algorithm to detect the peaks values which always vary as the sun irradiance changes. This paper presents two algorithms based on the improved particle swarm optimization technique one of them with PID controller (IPSO-PID), and the other one with Brain Emotional Learning Based Intelligent Controller (IPSO-BELBIC). These techniques improve the maximum power point (MPP) tracking capabilities for photovoltaic (PV) system under partial shading circumstances. The main aim of these improved algorithms is to accelerate the velocity of IPSO to reach to (MPP) and increase its efficiency. These algorithms also improve the tracking time under complex irradiance conditions. Based on these conditions, the tracking time of these presented techniques improves to 2 msec, with an efficiency of 100%.

An Improvement on LSB Matching and LSB Matching Revisited Steganography Methods

OpenAIRE

Qazanfari, Kazem; Safabakhsh, Reza

2017-01-01

The aim of the steganography methods is to communicate securely in a completely undetectable manner. LSB Matching and LSB Matching Revisited steganography methods are two general and esiest methods to achieve this aim. Being secured against first order steganalysis methods is the most important feature of these methods. On the other hand, these methods don't consider inter pixel dependency. Therefore, recently, several steganalysis methods are proposed that by using co-occurrence matrix detec...

Application of a DC–DC boost converter with maximum power point tracking for low power thermoelectric generators

International Nuclear Information System (INIS)

Mamur, Hayati; Ahiska, Rasit

2015-01-01

Highlights: • Charges with direct and MPPT conditions have been compared. • Perturb and observation method has been practically tested on a new TEG. • Matched load condition has been experimentally investigated. • To increase the efficiency of a TEG, the charge with MPPT should be used. • The charge with MPPT provides twice-fold increase in efficiency. - Abstract: Thermoelectric generators (TEGs) directly generate electrical power from the geothermal/waste heat as well as contribute to efficient usage of the energy. TEGs cannot be operated at full capacity without additional electronic equipments, since the internal resistances of TEGs are not equal to the device resistances connected across TEGs. For this reason, in this paper, the application of a DC–DC boost converter with maximum power point tracking (MPPT) based on microcontroller embedded in perturb and observe (P&O) algorithm has been proposed to obtain maximum power from a newly designed portable TEG (pTEG) in a real TEG system. The matched condition load for the pTEG has been experimentally investigated. Firstly, the pTEG has been directly charged to the battery pack, secondly it has been charged through the improved convertor with MPPT. In the first one, the pTEG operated with less efficiency than half of its full capacity, whereas, in the second, the pTEG operated efficiency near its full capacity

A New Profile Shape Matching Stereovision Algorithm for Real-time Human Pose and Hand Gesture Recognition

Directory of Open Access Journals (Sweden)

Dong Zhang

2014-02-01

Full Text Available This paper presents a new profile shape matching stereovision algorithm that is designed to extract 3D information in real time. This algorithm obtains 3D information by matching profile intensity shapes of each corresponding row of the stereo image pair. It detects the corresponding matching patterns of the intensity profile rather than the intensity values of individual pixels or pixels in a small neighbourhood. This approach reduces the effect of the intensity and colour variations caused by lighting differences. As with all real-time vision algorithms, there is always a trade-off between accuracy and processing speed. This algorithm achieves a balance between the two to produce accurate results for real-time applications. To demonstrate its performance, the proposed algorithm is tested for human pose and hand gesture recognition to control a smart phone and an entertainment system.

Host specificity, phenotype matching and the evolution of reproductive isolation in a coevolved plant-pollinator mutualism.

Science.gov (United States)

Himler, Anna G; Machado, Carlos A

2009-12-01

Coevolutionary interactions between plants and their associated pollinators and seed dispersers are thought to have promoted the diversification of flowering plants (Raven 1977; Regal 1977; Stebbins 1981). The actual mechanisms by which pollinators could drive species diversification in plants are not fully understood. However, it is thought that pollinator host specialization can influence the evolution of reproductive isolation among plant populations because the pollinator's choice of host is what determines patterns of gene flow in its host plant, and host choice may also have important consequences on pollinator and host fitness (Grant 1949; Bawa 1992). In this issue of Molecular Ecology, Smith et al. (2009) present a very interesting study that addresses how host specialization affects pollinator fitness and patterns of gene flow in a plant host. Several aspects of this study match elements of a seminal mathematical model of plant-pollinator codivergence (Kiester et al. 1984) suggesting that reciprocal selection for matched plant and pollinator reproductive traits may lead to speciation in the host and its pollinator when there is strong host specialization and a pattern of geographic subdivision. Smith et al.'s study represents an important step to fill the gap in our understanding of how reciprocal selection may lead to speciation in coevolved plant-pollinator mutualisms.

Pattern of Primary Nocturnal Enuresis in Primary School Children ...

African Journals Online (AJOL)

Pattern of Primary Nocturnal Enuresis in Primary School Children (First Grade) in ... The control group consisting of 100 age-matched non-enuretic children ... was insignificantly associated with a positive family history, family size or birth rank.

Efficient line matching with homography

Science.gov (United States)

Shen, Yan; Dai, Yuxing; Zhu, Zhiliang

2018-03-01

In this paper, we propose a novel approach to line matching based on homography. The basic idea is to use cheaply obtainable matched points to boost the similarity between two images. Two types of homography method, which are estimated by direct linear transformation, transform images and extract their similar parts, laying a foundation for the use of optical flow tracking. The merit of the similarity is that rapid matching can be achieved by regionalizing line segments and local searching. For multiple homography estimation that can perform better than one global homography, we introduced the rank-one modification method of singular value decomposition to reduce the computation cost. The proposed approach results in point-to-point matches, which can be utilized with state-of-the-art point-match-based structures from motion (SfM) frameworks seamlessly. The outstanding performance and feasible robustness of our approach are demonstrated in this paper.

Holographic patterning of luminescent photopolymer nanocomposites

International Nuclear Information System (INIS)

Sakhno, Oksana V.; Smirnova, Tatiana N.; Goldenberg, Leonid M.; Stumpe, Joachim

2008-01-01

Volume phase gratings in the photopolymerisable composites, containing luminescent nanoparticles have been fabricated for the first time. Nanoparticles of LaPO 4 , doped by Ce 3+ and Tb 3+ ions (the trade name is REN-X-green) with high luminescence quantum yield were used as a luminescent inorganic additive. The holographic gratings in such materials are formed as a result of the diffusion distribution of the nanoparticles during exposure of photopolymerisable composites to interference pattern. The influence of the pre-polymer formulation and the holographic patterning parameters on the grating formation is comprehensively investigated. The use of the optimised pre-polymer syrup containing two monomers with sufficiently different polymerisation rates allows fabrication of gratings with diffraction efficiency up to 80% at low optical losses (< 5%) (20 μm film thickness). To obtain maximum diffraction efficiency the intensity and the period of the interference pattern were optimised for each formulation. In addition maximum diffraction efficiency was achieved with the nanocomposites containing 30-32 wt.% of nanoparticles. On the other hand the highest possible modulation of the nanoparticles' concentration was obtained for the concentration of about 20 wt.%. In this case maximum ordering of the nanoparticles in the polymer matrix is achieved. The photoluminescence of the nanoparticles within the homogeneous polymer film and within the grating has been measured. The example application of the photopolymerisable composite containing luminescence inorganic nanoparticles in holographic security technology has been demonstrated

Local Times of Galactic Cosmic Ray Intensity Maximum and Minimum in the Diurnal Variation

Directory of Open Access Journals (Sweden)

Su Yeon Oh

2006-06-01

Full Text Available The Diurnal variation of galactic cosmic ray (GCR flux intensity observed by the ground Neutron Monitor (NM shows a sinusoidal pattern with the amplitude of 1sim 2 % of daily mean. We carried out a statistical study on tendencies of the local times of GCR intensity daily maximum and minimum. To test the influences of the solar activity and the location (cut-off rigidity on the distribution in the local times of maximum and minimum GCR intensity, we have examined the data of 1996 (solar minimum and 2000 (solar maximum at the low-latitude Haleakala (latitude: 20.72 N, cut-off rigidity: 12.91 GeV and the high-latitude Oulu (latitude: 65.05 N, cut-off rigidity: 0.81 GeV NM stations. The most frequent local times of the GCR intensity daily maximum and minimum come later about 2sim3 hours in the solar activity maximum year 2000 than in the solar activity minimum year 1996. Oulu NM station whose cut-off rigidity is smaller has the most frequent local times of the GCR intensity maximum and minimum later by 2sim3 hours from those of Haleakala station. This feature is more evident at the solar maximum. The phase of the daily variation in GCR is dependent upon the interplanetary magnetic field varying with the solar activity and the cut-off rigidity varying with the geographic latitude.

Geographic Trends in the Plastic Surgery Match.

Science.gov (United States)

Silvestre, Jason; Lin, Ines C; Serletti, Joseph M; Chang, Benjamin

2016-01-01

The integrated plastic surgery match is among the most competitive residency matches in recent years. Although previous studies have correlated applicant characteristics with successful match outcomes, none have comprehensively investigated the role of geography in the match. This study elucidates regional biases in the match. Plastic surgery residents who matched during 2011-2015 were eligible for study inclusion. Names of residents were obtained from official residency program websites and cross-referenced with data obtained from the Student Doctor Network. For each resident, region of residency program and medical school were compared. From 67 programs, 622 residents were identified. Most graduated from US medical schools (97.9%). A total of 94 residents matched at a home institution (15.1%). Half of the residents matched in the same region as their medical school (48.9%). Programs in the South matched the greatest number of residents from the same region (60.8%), whereas West programs matched the least (30.8%, p < 0.001). No regional differences existed regarding residents matching at their home institution (p = 0.268). More women matched at West programs (43.1%) versus East programs (30.6%, p < 0.05). A significant number of residents matched at their home institution. Roughly, half matched at a program in the same region as their medical school. Whether this regional phenomenon stems from applicant or program factors remains unknown. Yet, given the limited number of interviews and the high costs of interviewing, applicants and programs can use these data to help optimize the match process. Copyright © 2015 Association of Program Directors in Surgery. Published by Elsevier Inc. All rights reserved.

Test Pattern Generator for Mixed Mode BIST

Energy Technology Data Exchange (ETDEWEB)

Kim, Hong Sik; Lee, Hang Kyu; Kang, Sung Ho [Yonsei University (Korea, Republic of)

1998-07-01

As the increasing integrity of VLSI, the BIST (Built-In Self Test) is used as an effective method to test chips. Generally the pseudo-random test pattern generation is used for BIST. But it requires lots of test patterns when there exist random resistant faults. Therefore deterministic testing is an interesting BIST technique due to the minimal number of test patterns and to its high fault coverage. However this is not applicable since the existing deterministic test pattern generators require too much area overhead despite their efficiency. Therefore we propose a mixed test scheme which applies to the circuit under test, a deterministic test sequence followed by a pseudo-random one. This scheme allows the maximum fault coverage detection to be achieved, furthermore the silicon area overhead of the mixed hardware generator can be reduced. The deterministic test generator is made with a finite state machine and a pseudo-random test generator is made with LFSR(linear feedback shift register). The results of ISCAS circuits show that the maximum fault coverage is guaranteed with small number of test set and little hardware overhead. (author). 15 refs., 10 figs., 4 tabs.

Cosmic shear measurement with maximum likelihood and maximum a posteriori inference

Science.gov (United States)

Hall, Alex; Taylor, Andy

2017-06-01

We investigate the problem of noise bias in maximum likelihood and maximum a posteriori estimators for cosmic shear. We derive the leading and next-to-leading order biases and compute them in the context of galaxy ellipticity measurements, extending previous work on maximum likelihood inference for weak lensing. We show that a large part of the bias on these point estimators can be removed using information already contained in the likelihood when a galaxy model is specified, without the need for external calibration. We test these bias-corrected estimators on simulated galaxy images similar to those expected from planned space-based weak lensing surveys, with promising results. We find that the introduction of an intrinsic shape prior can help with mitigation of noise bias, such that the maximum a posteriori estimate can be made less biased than the maximum likelihood estimate. Second-order terms offer a check on the convergence of the estimators, but are largely subdominant. We show how biases propagate to shear estimates, demonstrating in our simple set-up that shear biases can be reduced by orders of magnitude and potentially to within the requirements of planned space-based surveys at mild signal-to-noise ratio. We find that second-order terms can exhibit significant cancellations at low signal-to-noise ratio when Gaussian noise is assumed, which has implications for inferring the performance of shear-measurement algorithms from simplified simulations. We discuss the viability of our point estimators as tools for lensing inference, arguing that they allow for the robust measurement of ellipticity and shear.

In-Storage Embedded Accelerator for Sparse Pattern Processing

OpenAIRE

Jun, Sang-Woo; Nguyen, Huy T.; Gadepally, Vijay N.; Arvind

2016-01-01

We present a novel architecture for sparse pattern processing, using flash storage with embedded accelerators. Sparse pattern processing on large data sets is the essence of applications such as document search, natural language processing, bioinformatics, subgraph matching, machine learning, and graph processing. One slice of our prototype accelerator is capable of handling up to 1TB of data, and experiments show that it can outperform C/C++ software solutions on a 16-core system at a fracti...

Ontology Matching Across Domains

Science.gov (United States)

2010-05-01

matching include GMO [1], Anchor-Prompt [2], and Similarity Flooding [3]. GMO is an iterative structural matcher, which uses RDF bipartite graphs to...AFRL under contract# FA8750-09-C-0058. References [1] Hu, W., Jian, N., Qu, Y., Wang, Y., “ GMO : a graph matching for ontologies”, in: Proceedings of

Validation of single-plane fluoroscopy and 2D/3D shape-matching for quantifying shoulder complex kinematics.

Science.gov (United States)

Lawrence, Rebekah L; Ellingson, Arin M; Ludewig, Paula M

2018-02-01

Fluoroscopy and 2D/3D shape-matching has emerged as the standard for non-invasively quantifying kinematics. However, its accuracy has not been well established for the shoulder complex when using single-plane fluoroscopy. The purpose of this study was to determine the accuracy of single-plane fluoroscopy and 2D/3D shape-matching for quantifying full shoulder complex kinematics. Tantalum markers were implanted into the clavicle, humerus, and scapula of four cadaveric shoulders. Biplane radiographs were obtained with the shoulder in five humerothoracic elevation positions (arm at the side, 30°, 60°, 90°, maximum). Images from both systems were used to perform marker tracking, while only those images acquired with the primary fluoroscopy system were used to perform 2D/3D shape-matching. Kinematics errors due to shape-matching were calculated as the difference between marker tracking and 2D/3D shape-matching and expressed as root mean square (RMS) error, bias, and precision. Overall RMS errors for the glenohumeral joint ranged from 0.7 to 3.3° and 1.2 to 4.2 mm, while errors for the acromioclavicular joint ranged from 1.7 to 3.4°. Errors associated with shape-matching individual bones ranged from 1.2 to 3.2° for the humerus, 0.5 to 1.6° for the scapula, and 0.4 to 3.7° for the clavicle. The results of the study demonstrate that single-plane fluoroscopy and 2D/3D shape-matching can accurately quantify full shoulder complex kinematics in static positions. Copyright © 2017 IPEM. Published by Elsevier Ltd. All rights reserved.

Equation level matching: An extension of the method of matched asymptotic expansion for problems of wave propagation

Science.gov (United States)

Faria, Luiz; Rosales, Rodolfo

2017-11-01

We introduce an alternative to the method of matched asymptotic expansions. In the ``traditional'' implementation, approximate solutions, valid in different (but overlapping) regions are matched by using ``intermediate'' variables. Here we propose to match at the level of the equations involved, via a ``uniform expansion'' whose equations enfold those of the approximations to be matched. This has the advantage that one does not need to explicitly solve the asymptotic equations to do the matching, which can be quite impossible for some problems. In addition, it allows matching to proceed in certain wave situations where the traditional approach fails because the time behaviors differ (e.g., one of the expansions does not include dissipation). On the other hand, this approach does not provide the fairly explicit approximations resulting from standard matching. In fact, this is not even its aim, which to produce the ``simplest'' set of equations that capture the behavior. Ruben Rosales work was partially supported by NSF Grants DMS-1614043 and DMS-1719637.

Reducing the likelihood of long tennis matches.

Science.gov (United States)

Barnett, Tristan; Alan, Brown; Pollard, Graham

2006-01-01

Long matches can cause problems for tournaments. For example, the starting times of subsequent matches can be substantially delayed causing inconvenience to players, spectators, officials and television scheduling. They can even be seen as unfair in the tournament setting when the winner of a very long match, who may have negative aftereffects from such a match, plays the winner of an average or shorter length match in the next round. Long matches can also lead to injuries to the participating players. One factor that can lead to long matches is the use of the advantage set as the fifth set, as in the Australian Open, the French Open and Wimbledon. Another factor is long rallies and a greater than average number of points per game. This tends to occur more frequently on the slower surfaces such as at the French Open. The mathematical method of generating functions is used to show that the likelihood of long matches can be substantially reduced by using the tiebreak game in the fifth set, or more effectively by using a new type of game, the 50-40 game, throughout the match. Key PointsThe cumulant generating function has nice properties for calculating the parameters of distributions in a tennis matchA final tiebreaker set reduces the length of matches as currently being used in the US OpenA new 50-40 game reduces the length of matches whilst maintaining comparable probabilities for the better player to win the match.

Matching faces with emotional expressions

Directory of Open Access Journals (Sweden)

Wenfeng eChen

2011-08-01

Full Text Available There is some evidence that faces with a happy expression are recognized better than faces with other expressions. However, little is known about whether this happy face advantage also applies to perceptual face matching, and whether similar differences exist among other expressions. Using a sequential matching paradigm, we systematically compared the effects of seven basic facial expressions on identity recognition. Identity matching was quickest when a pair of faces had an identical happy/sad/neutral expression, poorer when they had a fearful/surprise/angry expression, and poorest when they had a disgust expression. Faces with a happy/sad/fear/surprise expression were matched faster than those with an anger/disgust expression when the second face in a pair had a neutral expression. These results demonstrate that effects of facial expression on identity recognition are not limited to happy faces when a learned face is immediately tested. The results suggest different influences of expression in perceptual matching and long-term recognition memory.

The Kent Face Matching Test.

Science.gov (United States)

Fysh, Matthew C; Bindemann, Markus

2018-05-01

This study presents the Kent Face Matching Test (KFMT), which comprises 200 same-identity and 20 different-identity pairs of unfamiliar faces. Each face pair consists of a photograph from a student ID card and a high-quality portrait that was taken at least three months later. The test is designed to complement existing resources for face-matching research, by providing a more ecologically valid stimulus set that captures the natural variability that can arise in a person's appearance over time. Two experiments are presented to demonstrate that the KFMT provides a challenging measure of face matching but correlates with established tests. Experiment 1 compares a short version of this test with the optimized Glasgow Face Matching Test (GFMT). In Experiment 2, a longer version of the KFMT, with infrequent identity mismatches, is correlated with performance on the Cambridge Face Memory Test (CFMT) and the Cambridge Face Perception Test (CFPT). The KFMT is freely available for use in face-matching research. © 2017 The British Psychological Society.

Probability matching and strategy availability

OpenAIRE

J. Koehler, Derek; Koehler, Derek J.; James, Greta

2010-01-01

Findings from two experiments indicate that probability matching in sequential choice arises from an asymmetry in strategy availability: The matching strategy comes readily to mind, whereas a superior alternative strategy, maximizing, does not. First, compared with the minority who spontaneously engage in maximizing, the majority of participants endorse maximizing as superior to matching in a direct comparison when both strategies are described. Second, when the maximizing strategy is brought...

An Incentive Theory of Matching

OpenAIRE

Brown, Alessio J. G.; Merkl, Christian; Snower, Dennis J.

2010-01-01

This paper examines the labour market matching process by distinguishing its two component stages: the contact stage, in which job searchers make contact with employers and the selection stage, in which they decide whether to match. We construct a theoretical model explaining two-sided selection through microeconomic incentives. Firms face adjustment costs in responding to heterogeneous variations in the characteristics of workers and jobs. Matches and separations are described through firms'...

The Interaction Between Schema Matching and Record Matching in Data Integration

KAUST Repository

Gu, Binbin

2016-09-20

Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have been thoroughly studied separately, but few attention has been paid to the interaction of SM and RM. In this work, we find that, even alternating them in a simple manner, SM and RM can benefit from each other to reach a better integration performance (i.e., in terms of precision and recall). Therefore, combining SM and RM is a promising solution for improving data integration. To this end, we define novel matching rules for SM and RM, respectively, that is, every SM decision is made based on intermediate RM results, and vice versa, such that SM and RM can be performed alternately. The quality of integration is guaranteed by a Matching Likelihood Estimation model and the control of semantic drift, which prevent the effect of mismatch magnification. To reduce the computational cost, we design an index structure based on q-grams and a greedy search algorithm that can reduce around 90 percent overhead of the interaction. Extensive experiments on three data collections show that the combination and interaction between SM and RM significantly outperforms previous works that conduct SM and RM separately.

Optimal Packed String Matching

DEFF Research Database (Denmark)

Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany

2011-01-01

In the packed string matching problem, each machine word accommodates – characters, thus an n-character text occupies n/– memory words. We extend the Crochemore-Perrin constantspace O(n)-time string matching algorithm to run in optimal O(n/–) time and even in real-time, achieving a factor – speed...

Pixelated camouflage patterns from the perspective of hyperspectral imaging

Science.gov (United States)

Racek, František; Jobánek, Adam; Baláž, Teodor; Krejčí, Jaroslav

2016-10-01

Pixelated camouflage patterns fulfill the role of both principles the matching and the disrupting that are exploited for blending the target into the background. It means that pixelated pattern should respect natural background in spectral and spatial characteristics embodied in micro and macro patterns. The HS imaging plays the similar, however the reverse role in the field of reconnaissance systems. The HS camera fundamentally records and extracts both the spectral and spatial information belonging to the recorded scenery. Therefore, the article deals with problems of hyperspectral (HS) imaging and subsequent processing of HS images of pixelated camouflage patterns which are among others characterized by their specific spatial frequency heterogeneity.

Pattern Classification in Kampo Medicine

Directory of Open Access Journals (Sweden)

S. Yakubo

2014-01-01

Full Text Available Pattern classification is very unique in traditional medicine. Kampo medical patterns have transformed over time during Japan’s history. In the 17th to 18th centuries, Japanese doctors advocated elimination of the Ming medical theory and followed the basic concepts put forth by Shang Han Lun and Jin Gui Yao Lue in the later Han dynasty (25–220 AD. The physician Todo Yoshimasu (1702–1773 emphasized that an appropriate treatment could be administered if a set of patterns could be identified. This principle is still referred to as “matching of pattern and formula” and is the basic concept underlying Kampo medicine today. In 1868, the Meiji restoration occurred, and the new government changed its policies to follow that of the European countries, adopting only Western medicine. Physicians trained in Western medicine played an important role in the revival of Kampo medicine, modernizing Kampo patterns to avoid confusion with Western biomedical terminology. In order to understand the Japanese version of traditional disorders and patterns, background information on the history of Kampo and its role in the current health care system in Japan is important. In this paper we overviewed the formation of Kampo patterns.

Letter and Colour Matching Tasks: Parametric Measures of Developmental Working Memory Capacity

Directory of Open Access Journals (Sweden)

Tamara L. Powell

2014-01-01

Full Text Available We investigated the mediating role of interference in developmental assessments of working memory (WM capacity across childhood, adolescence, and young adulthood. One hundred and forty-two participants completed two versions of visuospatial (colour matching task, CMT and verbal (letter matching task, LMT WM tasks, which systematically varied cognitive load in a high and low interference condition. Results showed similar developmental trajectories across high interference contexts (CMT- and LMT-Complex and divergent developmental growth patterns across low interference contexts (CMT- and LMT-Simple. Performance on tasks requiring greater cognitive control was in closer agreement with developmental predictions relative to simple recall guided tasks that rely solely on the storage components of WM. These findings suggest that developmental WM capacity, as measured by the CMT and LMT paradigms, can be better quantified using high interference contexts, in both content domains, and demonstrate steady increases in WM through to mid-adolescence.

Locomotion characteristics and match-induced impairments in physical performance in male elite team handball players.

Science.gov (United States)

Michalsik, L B; Aagaard, P; Madsen, K

2013-07-01

The purpose of this study was to determine the physical demands and match-induced impairments in physical performance in male elite Team Handball (TH) players in relation to playing position. Male elite TH field players were closely observed during 6 competitive seasons. Each player (wing players: WP, pivots: PV, backcourt players: BP) was evaluated during match-play using video recording and subsequently performing locomotion match analysis. A total distance of 3 627±568 m (group means±SD) was covered per match with a total effective playing time (TPT) of 53:51±5:52 min:s, while full-time players covered 3 945±538 m. The mean speed was 6.40±1.01 km · h - 1. High-intensity running constituted only 1.7±0.9% of TPT per match corresponding to 7.9±4.9% of the total distance covered. An average of 1 482.4±312.6 activity changes per player (n=82) with 53.2±14.1 high-intensity runs were observed per match. Total distance covered was greater in BP (3 765±532 m) and WP (3 641±501 m) than PV (3 295±495 m) (pteam sport that comprises several types of movement categories, which during match-play place moderate-to-high demands on intermittent endurance running capacity and where the amount of high-intensity running may be high during brief periods of the match. Signs of fatigue-related changes were observed in terms of temporary impaired physical performance, since the amount of high-intensity running was reduced in the second half. Notably, physical demands differed between playing positions, with WP demonstrating a more intensive activity pattern than BP and PV, respectively. © Georg Thieme Verlag KG Stuttgart · New York.

Maximally flat radiation patterns of a circular aperture

Science.gov (United States)

Minkovich, B. M.; Mints, M. Ia.

1989-08-01

The paper presents an explicit solution to the problems of maximizing the area utilization coefficient and of obtaining the best approximation (on the average) of a sectorial Pi-shaped radiation pattern of an antenna with a circular aperture when Butterworth conditions are imposed on the approximating pattern with the aim of flattening it. Constraints on the choice of admissible minimum and maximum antenna dimensions are determined which make possible the synthesis of maximally flat patterns with small sidelobes.

Modeling on bubbly to churn flow pattern transition in narrow rectangular channel

International Nuclear Information System (INIS)

Wang Yanlin; Chen Bingde; Huang Yanping; Wang Junfeng

2012-01-01

A theoretical model based on some reasonable concepts was developed to predict the bubbly flow to churn flow pattern transition in vertical narrow rectangular channel under flow boiling condition. The maximum size of ideal bubble in narrow rectangular channel was calculated based on previous literature. The thermal hydraulics boundary condition of bubbly to churn flow pattern transition was exported from Helmholtz and maximum size of ideal bubble. The theoretical model was validated by existent experimental data. (authors)

Inversion of convergent-beam electron diffraction patterns

International Nuclear Information System (INIS)

Bird, D.M.; Saunders, M.

1992-01-01

The problem of recovering the structure factors that contribute to a zone-axis convergent-beam diffraction pattern is discussed. It is shown that an automated matching procedure that minimizes the sum-of-squares difference between experimental and simulated patterns is effective whether one is refining accurate structure factors in a known crystal or attempting ab initio structure determination. The details of the minimization method are analysed and it is shown that a quasi-Newton method that uses analytically derived gradients is particulary effective when several structure factors are varied. The inversion method for ab initio structure determination is tested on the [110] axis of GaP, using simulated patterns as ideal 'experimental' data. (orig.)

Career Patterns: A Twenty-Year Panel Study

Science.gov (United States)

Biemann, Torsten; Zacher, Hannes; Feldman, Daniel C.

2012-01-01

Using 20years of employment and job mobility data from a representative German sample (N = 1259), we employ optimal matching analysis (OMA) to identify six career patterns which deviate from the traditional career path of long-term, full-time employment in one organization. Then, in further analyses, we examine which socio-demographic predictors…

Modeling Mediterranean Ocean climate of the Last Glacial Maximum

Directory of Open Access Journals (Sweden)

U. Mikolajewicz

2011-03-01

Full Text Available A regional ocean general circulation model of the Mediterranean is used to study the climate of the Last Glacial Maximum. The atmospheric forcing for these simulations has been derived from simulations with an atmospheric general circulation model, which in turn was forced with surface conditions from a coarse resolution earth system model. The model is successful in reproducing the general patterns of reconstructed sea surface temperature anomalies with the strongest cooling in summer in the northwestern Mediterranean and weak cooling in the Levantine, although the model underestimates the extent of the summer cooling in the western Mediterranean. However, there is a strong vertical gradient associated with this pattern of summer cooling, which makes the comparison with reconstructions complicated. The exchange with the Atlantic is decreased to roughly one half of its present value, which can be explained by the shallower Strait of Gibraltar as a consequence of lower global sea level. This reduced exchange causes a strong increase of salinity in the Mediterranean in spite of reduced net evaporation.

Improved algorithms for approximate string matching (extended abstract

Directory of Open Access Journals (Sweden)

Papamichail Georgios

2009-01-01

Full Text Available Abstract Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share. Results We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s - |n - m|·min(m, n, s + m + n and linear space, where s is the edit distance between the two strings. This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem. The implementation of our algorithm also excels in practice, especially in cases where the two strings compared differ significantly in length. Conclusion We have provided the design, analysis and implementation of a new algorithm for calculating the edit distance of two strings with both theoretical and practical implications. Source code of our algorithm is available online.

Caffeine-containing energy drink improves physical performance of elite rugby players during a simulated match.

Science.gov (United States)

Del Coso, Juan; Ramírez, Juan A; Muñoz, Gloria; Portillo, Javier; Gonzalez-Millán, Cristina; Muñoz, Víctor; Barbero-Álvarez, José C; Muñoz-Guerra, Jesús

2013-04-01

The purpose of this study was to investigate the effectiveness of a caffeine-containing energy drink in enhancing rugby players' physical performance during a simulated match. A second purpose was to determine the urinary caffeine excretion derived from the energy drink intake. In a randomized and counterbalanced order, 26 elite rugby players (mean ± SD for age and body mass, 25 ± 2 y and 93 ± 15 kg) played 2 simulated rugby games (2 × 30 min) 60 min after ingesting (i) 3 mg of caffeine per kilogram of body mass in the form of an energy drink (Fure, ProEnergetics) or (ii) the same drink without caffeine (placebo). During the matches, the individual running distance and the instantaneous speed were measured, and the number of running actions above 20 km·h(-1) (i.e., sprints) were determined, using global positioning system devices. The number of impacts above 5 g during the matches was determined by accelerometry. The ingestion of the energy drink, compared with the placebo, increased the total distance covered during the match (4749 ± 589 vs 5139 ± 475 m, p caffeine concentration (0.1 ± 0.1 vs 2.4 ± 0.9 μg·mL(-1), p caffeine dose equivalent to 3 mg·kg(-1) considerably enhanced the movement patterns of rugby players during a simulated match.

Fractional Order Element Based Impedance Matching

KAUST Repository

Radwan, Ahmed Gomaa

2014-06-24

Disclosed are various embodiments of methods and systems related to fractional order element based impedance matching. In one embodiment, a method includes aligning a traditional Smith chart (|.alpha.|=1) with a fractional order Smith chart (|.alpha.|.noteq.1). A load impedance is located on the traditional Smith chart and projected onto the fractional order Smith chart. A fractional order matching element is determined by transitioning along a matching circle of the fractional order Smith chart based at least in part upon characteristic line impedance. In another embodiment, a system includes a fractional order impedance matching application executed in a computing device. The fractional order impedance matching application includes logic that obtains a first set of Smith chart coordinates at a first order, determines a second set of Smith chart coordinates at a second order, and determines a fractional order matching element from the second set of Smith chart coordinates.

A mixture model for robust point matching under multi-layer motion.

Directory of Open Access Journals (Sweden)

Jiayi Ma

Full Text Available This paper proposes an efficient mixture model for establishing robust point correspondences between two sets of points under multi-layer motion. Our algorithm starts by creating a set of putative correspondences which can contain a number of false correspondences, or outliers, in addition to the true correspondences (inliers. Next we solve for correspondence by interpolating a set of spatial transformations on the putative correspondence set based on a mixture model, which involves estimating a consensus of inlier points whose matching follows a non-parametric geometrical constraint. We formulate this as a maximum a posteriori (MAP estimation of a Bayesian model with hidden/latent variables indicating whether matches in the putative set are outliers or inliers. We impose non-parametric geometrical constraints on the correspondence, as a prior distribution, in a reproducing kernel Hilbert space (RKHS. MAP estimation is performed by the EM algorithm which by also estimating the variance of the prior model (initialized to a large value is able to obtain good estimates very quickly (e.g., avoiding many of the local minima inherent in this formulation. We further provide a fast implementation based on sparse approximation which can achieve a significant speed-up without much performance degradation. We illustrate the proposed method on 2D and 3D real images for sparse feature correspondence, as well as a public available dataset for shape matching. The quantitative results demonstrate that our method is robust to non-rigid deformation and multi-layer/large discontinuous motion.

Generation Y and the Integrated Plastic Surgery Residency Match: A Cross-sectional Study of the 2011 Match Outcomes

Science.gov (United States)

Narayan, Deepak

2013-01-01

Background: Plastic surgery is the most competitive specialty in medicine. We sought to identify factors associated with the successful match of generation Y applicants into integrated plastic surgery residency. Methods: We utilized the most recent data from the Charting Outcomes in the Match published by the National Resident Matching Program in 2011. We had data on US senior or independent applicant status, Alpha Omega Alpha (AOA) status, attendance of top 40 medical schools, advanced degree status, and number of contiguous ranks within plastic surgery. Our main outcome measure was match status. Results: A total of 81 out of 197 applicants (41.1%) successfully matched into integrated plastic surgery in the 2011 main match. US seniors matched at a significantly higher rate compared to independent applicants (44.0% vs 24.1%, P = 0.044). Matched US seniors were more likely to have AOA membership compared to unmatched US seniors (45.9% vs 27.7%, P = 0.014) and attend a top 40 medical school (52.7% vs 35.1%, P = 0.022). There were no differences in terms of advanced degrees between matched and unmatched US seniors. Unmatched US seniors were more likely to have 3 or fewer contiguous ranks of plastic surgery residency programs than matched US seniors (86.2% vs 68.9%, P = 0.007). Conclusions: US senior status, AOA membership, and attendance at a top 40 medical school are predictors of matching into integrated plastic surgery. Program directors need to be aware of the background of the millennial applicants to recruit and maintain top residents. PMID:25289227

Sleep–wake and melatonin pattern in craniopharyngioma patients

DEFF Research Database (Denmark)

Pickering, Line; Jennum, Poul; Gammeltoft, Steen

2014-01-01

OBJECTIVE: To assess the influence of craniopharyngioma or consequent surgery on melatonin secretion, and the association with fatigue, sleepiness, sleep pattern and sleep quality. DESIGN: Cross-sectional study. METHODS: A total of 15 craniopharyngioma patients were individually matched to healthy......). Only patients with absent midnight peak had impaired sleep quality, increased daytime sleepiness and general and mental fatigue. CONCLUSION: Craniopharyngioma patients present with changes in circadian pattern and daytime symptoms, which may be due to the influence of the craniopharyngioma or its...

Distortion analysis on binary representation of minutiae based fingerprint matching for match-on-card

CSIR Research Space (South Africa)

Mlambo, CS

2016-12-01

Full Text Available The fingerprint matching on the smart card has long been developed and recognized faster method than fingerprint matching on a computer or large capacity systems. There has been much research and activities concerned with improving the accuracy...

Semantic Data Matching: Principles and Performance

Science.gov (United States)

Deaton, Russell; Doan, Thao; Schweiger, Tom

Automated and real-time management of customer relationships requires robust and intelligent data matching across widespread and diverse data sources. Simple string matching algorithms, such as dynamic programming, can handle typographical errors in the data, but are less able to match records that require contextual and experiential knowledge. Latent Semantic Indexing (LSI) (Berry et al. ; Deerwester et al. is a machine intelligence technique that can match data based upon higher order structure, and is able to handle difficult problems, such as words that have different meanings but the same spelling, are synonymous, or have multiple meanings. Essentially, the technique matches records based upon context, or mathematically quantifying when terms occur in the same record.

The influence of successive matches on match-running performance during an under-23 international soccer tournament: The necessity of individual analysis.

Science.gov (United States)

Varley, Matthew C; Di Salvo, Valter; Modonutti, Mattia; Gregson, Warren; Mendez-Villanueva, Alberto

2018-03-01

This study investigated the effects of successive matches on match-running in elite under-23 soccer players during an international tournament. Match-running data was collected using a semi-automated multi-camera tracking system during an international under-23 tournament from all participating outfield players. Players who played 100% of all group stage matches were included (3 matches separated by 72 h, n = 44). Differences in match-running performance between matches were identified using a generalised linear mixed model. There were no clear effects for total, walking, jogging, running, high-speed running and sprinting distance between matches 1 and 3 (effect size (ES); -0.32 to 0.05). Positional analysis found that sprint distance was largely maintained from matches 1 to 3 across all positions. Attackers had a moderate decrease in total, jogging and running distance between matches 1 and 3 (ES; -0.72 to -0.66). Classifying players as increasers or decreasers in match-running revealed that match-running changes are susceptible to individual differences. Sprint performance appears to be maintained over successive matches regardless of playing position. However, reductions in other match-running categories vary between positions. Changes in match-running over successive matches affect individuals differently; thus, players should be monitored on an individual basis.

Action verbs are processed differently in metaphorical and literal sentences depending on the semantic match of visual primes

Directory of Open Access Journals (Sweden)

Melissa eTroyer

2014-12-01

Full Text Available Language comprehension requires rapid and flexible access to information stored in long-term memory, likely influenced by activation of rich world knowledge and by brain systems that support the processing of sensorimotor content. We hypothesized that while literal language about biological motion might rely on neurocognitive representations of biological motion specific to the details of the actions described, metaphors rely on more generic representations of motion. In a priming and self-paced reading paradigm, participants saw video clips or images of (a an intact point-light walker or (b a scrambled control and read sentences containing literal or metaphoric uses of biological motion verbs either closely or distantly related to the depicted action (walking. We predicted that reading times for literal and metaphorical sentences would show differential sensitivity to the match between the verb and the visual prime. In Experiment 1, we observed interactions between the prime type (walker or scrambled video and the verb type (close or distant match for both literal and metaphorical sentences, but with strikingly different patterns. We found no difference in the verb region of literal sentences for Close-Match verbs after walker or scrambled motion primes, but Distant-Match verbs were read more quickly following walker primes. For metaphorical sentences, the results were roughly reversed, with Distant-Match verbs being read more slowly following a walker compared to scrambled motion. In Experiment 2, we observed a similar pattern following still image primes, though critical interactions emerged later in the sentence. We interpret these findings as evidence for shared recruitment of cognitive and neural mechanisms for processing visual and verbal biological motion information. Metaphoric language using biological motion verbs may recruit neurocognitive mechanisms similar to those used in processing literal language but be represented in a less

Maximum Acceleration Recording Circuit

Science.gov (United States)

Bozeman, Richard J., Jr.

1995-01-01

Coarsely digitized maximum levels recorded in blown fuses. Circuit feeds power to accelerometer and makes nonvolatile record of maximum level to which output of accelerometer rises during measurement interval. In comparison with inertia-type single-preset-trip-point mechanical maximum-acceleration-recording devices, circuit weighs less, occupies less space, and records accelerations within narrower bands of uncertainty. In comparison with prior electronic data-acquisition systems designed for same purpose, circuit simpler, less bulky, consumes less power, costs and analysis of data recorded in magnetic or electronic memory devices. Circuit used, for example, to record accelerations to which commodities subjected during transportation on trucks.

Hybrid-Based Dense Stereo Matching

Science.gov (United States)

Chuang, T. Y.; Ting, H. W.; Jaw, J. J.

2016-06-01

Stereo matching generating accurate and dense disparity maps is an indispensable technique for 3D exploitation of imagery in the fields of Computer vision and Photogrammetry. Although numerous solutions and advances have been proposed in the literature, occlusions, disparity discontinuities, sparse texture, image distortion, and illumination changes still lead to problematic issues and await better treatment. In this paper, a hybrid-based method based on semi-global matching is presented to tackle the challenges on dense stereo matching. To ease the sensitiveness of SGM cost aggregation towards penalty parameters, a formal way to provide proper penalty estimates is proposed. To this end, the study manipulates a shape-adaptive cross-based matching with an edge constraint to generate an initial disparity map for penalty estimation. Image edges, indicating the potential locations of occlusions as well as disparity discontinuities, are approved by the edge drawing algorithm to ensure the local support regions not to cover significant disparity changes. Besides, an additional penalty parameter 𝑃𝑒 is imposed onto the energy function of SGM cost aggregation to specifically handle edge pixels. Furthermore, the final disparities of edge pixels are found by weighting both values derived from the SGM cost aggregation and the U-SURF matching, providing more reliable estimates at disparity discontinuity areas. Evaluations on Middlebury stereo benchmarks demonstrate satisfactory performance and reveal the potency of the hybrid-based dense stereo matching method.

Neutron spectra unfolding with maximum entropy and maximum likelihood

International Nuclear Information System (INIS)

Itoh, Shikoh; Tsunoda, Toshiharu

1989-01-01

A new unfolding theory has been established on the basis of the maximum entropy principle and the maximum likelihood method. This theory correctly embodies the Poisson statistics of neutron detection, and always brings a positive solution over the whole energy range. Moreover, the theory unifies both problems of overdetermined and of underdetermined. For the latter, the ambiguity in assigning a prior probability, i.e. the initial guess in the Bayesian sense, has become extinct by virtue of the principle. An approximate expression of the covariance matrix for the resultant spectra is also presented. An efficient algorithm to solve the nonlinear system, which appears in the present study, has been established. Results of computer simulation showed the effectiveness of the present theory. (author)

Maximum Power from a Solar Panel

Directory of Open Access Journals (Sweden)

Michael Miller

2010-01-01

Full Text Available Solar energy has become a promising alternative to conventional fossil fuel sources. Solar panels are used to collect solar radiation and convert it into electricity. One of the techniques used to maximize the effectiveness of this energy alternative is to maximize the power output of the solar collector. In this project the maximum power is calculated by determining the voltage and the current of maximum power. These quantities are determined by finding the maximum value for the equation for power using differentiation. After the maximum values are found for each time of day, each individual quantity, voltage of maximum power, current of maximum power, and maximum power is plotted as a function of the time of day.

Relationships Between Internal and External Match-Load Indicators in Soccer Match Officials.

Science.gov (United States)

Castillo, Daniel; Weston, Matthew; McLaren, Shaun J; Cámara, Jesús; Yanci, Javier

2017-08-01

The aims of this study were to describe the internal and external match loads (ML) of refereeing activity during official soccer matches and to investigate the relationship among the methods of ML quantification across a competitive season. A further aim was to examine the usefulness of differential perceived exertion (dRPE) as a tool for monitoring internal ML in soccer referees. Twenty field referees (FRs) and 43 assistant referees (ARs) participated in the study. Data were collected from 30 competitive matches (FR = 20 observations, AR = 43 observations) and included measures of internal (Edwards' heart-rate-derived training impulse [TRIMP EDW ]) ML, external (total distance covered, distance covered at high speeds, and player load) ML, and ML differentiated ratings of perceived respiratory (sRPE res ) and leg-muscle (sRPE mus ) exertion. Internal and external ML were all greater for FRs than for ARs (-19.7 to -72.5), with differences ranging from very likely very large to most likely extremely large. The relationships between internal-ML and external-ML indicators were, in most cases, unclear for FR (r internal and external ML. Moreover, dRPE represents distinct dimensions of effort and may be useful in monitoring soccer referees' ML during official matches.

Stimulus-dependent maximum entropy models of neural population codes.

Directory of Open Access Journals (Sweden)

Einat Granot-Atedgi

Full Text Available Neural populations encode information about their stimulus in a collective fashion, by joint activity patterns of spiking and silence. A full account of this mapping from stimulus to neural activity is given by the conditional probability distribution over neural codewords given the sensory input. For large populations, direct sampling of these distributions is impossible, and so we must rely on constructing appropriate models. We show here that in a population of 100 retinal ganglion cells in the salamander retina responding to temporal white-noise stimuli, dependencies between cells play an important encoding role. We introduce the stimulus-dependent maximum entropy (SDME model-a minimal extension of the canonical linear-nonlinear model of a single neuron, to a pairwise-coupled neural population. We find that the SDME model gives a more accurate account of single cell responses and in particular significantly outperforms uncoupled models in reproducing the distributions of population codewords emitted in response to a stimulus. We show how the SDME model, in conjunction with static maximum entropy models of population vocabulary, can be used to estimate information-theoretic quantities like average surprise and information transmission in a neural population.

Preliminary Results on Uncertainty Quantification for Pattern Analytics

Energy Technology Data Exchange (ETDEWEB)

Stracuzzi, David John [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Brost, Randolph [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Chen, Maximillian Gene [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Malinas, Rebecca [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Peterson, Matthew Gregor [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Phillips, Cynthia A. [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Robinson, David G. [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Woodbridge, Diane [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)

2015-09-01

This report summarizes preliminary research into uncertainty quantification for pattern ana- lytics within the context of the Pattern Analytics to Support High-Performance Exploitation and Reasoning (PANTHER) project. The primary focus of PANTHER was to make large quantities of remote sensing data searchable by analysts. The work described in this re- port adds nuance to both the initial data preparation steps and the search process. Search queries are transformed from does the specified pattern exist in the data? to how certain is the system that the returned results match the query? We show example results for both data processing and search, and discuss a number of possible improvements for each.

Matching Supernovae to Galaxies

Science.gov (United States)

Kohler, Susanna

2016-12-01

developed a new automated algorithm for matching supernovae to their host galaxies. Their work builds on currently existing algorithms and makes use of information about the nearby galaxies, accounts for the uncertainty of the match, and even includes a machine learning component to improve the matching accuracy.Gupta and collaborators test their matching algorithm on catalogs of galaxies and simulated supernova events to quantify how well the algorithm is able to accurately recover the true hosts.Successful MatchingThe matching algorithms accuracy (purity) as a function of the true supernova-host separation, the supernova redshift, the true hosts brightness, and the true hosts size. [Gupta et al. 2016]The authors find that when the basic algorithm is run on catalog data, it matches supernovae to their hosts with 91% accuracy. Including the machine learning component, which is run after the initial matching algorithm, improves the accuracy of the matching to 97%.The encouraging results of this work which was intended as a proof of concept suggest that methods similar to this could prove very practical for tackling future survey data. And the method explored here has use beyond matching just supernovae to their host galaxies: it could also be applied to other extragalactic transients, such as gamma-ray bursts, tidal disruption events, or electromagnetic counterparts to gravitational-wave detections.CitationRavi R. Gupta et al 2016 AJ 152 154. doi:10.3847/0004-6256/152/6/154

California scrub-jays reduce visual cues available to potential pilferers by matching food colour to caching substrate.

Science.gov (United States)

Kelley, Laura A; Clayton, Nicola S

2017-07-01

Some animals hide food to consume later; however, these caches are susceptible to theft by conspecifics and heterospecifics. Caching animals can use protective strategies to minimize sensory cues available to potential pilferers, such as caching in shaded areas and in quiet substrate. Background matching (where object patterning matches the visual background) is commonly seen in prey animals to reduce conspicuousness, and caching animals may also use this tactic to hide caches, for example, by hiding coloured food in a similar coloured substrate. We tested whether California scrub-jays ( Aphelocoma californica ) camouflage their food in this way by offering them caching substrates that either matched or did not match the colour of food available for caching. We also determined whether this caching behaviour was sensitive to social context by allowing the birds to cache when a conspecific potential pilferer could be both heard and seen (acoustic and visual cues present), or unseen (acoustic cues only). When caching events could be both heard and seen by a potential pilferer, birds cached randomly in matching and non-matching substrates. However, they preferentially hid food in the substrate that matched the food colour when only acoustic cues were present. This is a novel cache protection strategy that also appears to be sensitive to social context. We conclude that studies of cache protection strategies should consider the perceptual capabilities of the cacher and potential pilferers. © 2017 The Author(s).

Matching theory for wireless networks

CERN Document Server

Han, Zhu; Saad, Walid

2017-01-01

This book provides the fundamental knowledge of the classical matching theory problems. It builds up the bridge between the matching theory and the 5G wireless communication resource allocation problems. The potentials and challenges of implementing the semi-distributive matching theory framework into the wireless resource allocations are analyzed both theoretically and through implementation examples. Academics, researchers, engineers, and so on, who are interested in efficient distributive wireless resource allocation solutions, will find this book to be an exceptional resource. .

Is dietary pattern of schizophrenia patients different from healthy subjects?

Directory of Open Access Journals (Sweden)

Amani Reza

2007-05-01

Full Text Available Abstract Background There are limited findings about dietary patterns and food preferences among patients suffering from schizophrenia. The main objective of this study was therefore to compare the nutritional pattern of schizophrenia patients with that of matched healthy subjects. Methods The dietary pattern of 30 hospitalized 16–67 years old schizophrenic patients (11 female was compared with that of 30 healthy age and sex matched individuals as control group. Subjects' anthropometric measurements including weight, height and body mass index (BMI, semi-quantitative food frequency (FFQ, medical and food history questionnaires were also collected and FFQs were then scored using Food Guide Pyramid to obtain the dietary scores. Percent body fat (%BF was measured using bioelectrical impedance analysis (BIA method. Results Female patients had more %BF and lower dietary pattern scores than that of their controls (32 ± 3.6 vs 27.7 ± 4.6 percent and 43.2 ± 11.9 vs 54.5 ± 10.7 points; respectively, p Conclusion Schizophrenia patients have poor nutritional patterns. In particular, female patients have more percent body fat and lower dietary pattern scores compared with their healthy controls. All patients used to consume more fats and sweet drinks frequently. The findings of this study suggest that schizophrenia patients need specific medical nutrition therapies through limiting dietary fats and sugars intakes and weight control. Whether obesity is the consequence of disease, dietary preference or medications used remains to be cleared.

Probabilistic seismic history matching using binary images

Science.gov (United States)

Davolio, Alessandra; Schiozer, Denis Jose

2018-02-01

Currently, the goal of history-matching procedures is not only to provide a model matching any observed data but also to generate multiple matched models to properly handle uncertainties. One such approach is a probabilistic history-matching methodology based on the discrete Latin Hypercube sampling algorithm, proposed in previous works, which was particularly efficient for matching well data (production rates and pressure). 4D seismic (4DS) data have been increasingly included into history-matching procedures. A key issue in seismic history matching (SHM) is to transfer data into a common domain: impedance, amplitude or pressure, and saturation. In any case, seismic inversions and/or modeling are required, which can be time consuming. An alternative to avoid these procedures is using binary images in SHM as they allow the shape, rather than the physical values, of observed anomalies to be matched. This work presents the incorporation of binary images in SHM within the aforementioned probabilistic history matching. The application was performed with real data from a segment of the Norne benchmark case that presents strong 4D anomalies, including softening signals due to pressure build up. The binary images are used to match the pressurized zones observed in time-lapse data. Three history matchings were conducted using: only well data, well and 4DS data, and only 4DS. The methodology is very flexible and successfully utilized the addition of binary images for seismic objective functions. Results proved the good convergence of the method in few iterations for all three cases. The matched models of the first two cases provided the best results, with similar well matching quality. The second case provided models presenting pore pressure changes according to the expected dynamic behavior (pressurized zones) observed on 4DS data. The use of binary images in SHM is relatively new with few examples in the literature. This work enriches this discussion by presenting a new

Near-maximum-power-point-operation (nMPPO) design of photovoltaic power generation system

Energy Technology Data Exchange (ETDEWEB)

Huang, B.J.; Sun, F.S.; Ho, R.W. [Department of Mechanical Engineering, National Taiwan University, Taipei 106, Taiwan (China)

2006-08-15

The present study proposes a PV system design, called 'near-maximum power-point-operation' (nMPPO) that can maintain the performance very close to PV system with MPPT (maximum-power-point tracking) but eliminate hardware of the MPPT. The concept of nMPPO is to match the design of battery bank voltage V{sub set} with the MPP (maximum-power point) of the PV module based on an analysis using meteorological data. Three design methods are used in the present study to determine the optimal V{sub set}. The analytical results show that nMPPO is feasible and the optimal V{sub set} falls in the range 13.2-15.0V for MSX60 PV module. The long-term performance simulation shows that the overall nMPPO efficiency {eta}{sub nMPPO} is higher than 94%. Two outdoor field tests were carried out in the present study to verify the design of nMPPO. The test results for a single PV module (60Wp) indicate that the nMPPO efficiency {eta}{sub nMPPO} is mostly higher than 93% at various PV temperature T{sub pv}. Another long-term field test of 1kWp PV array using nMPPO shows that the power generation using nMPPO is almost identical with MPPT at various weather conditions and T{sub pv} variation from 24{sup o}C to 70{sup o}C. (author)

The Gastroenterology Fellowship Match: A Decade Later.

Science.gov (United States)

Huang, Robert J; Triadafilopoulos, George; Limsui, David

2017-06-01

Following a period of uncertainty and disorganization, the gastroenterology (GI) national leadership decided to reinstitute the fellowship match (the Match) under the auspices of the National Residency Matching Program (NRMP) in 2006. Although it has now been a decade since the rebirth of the Match, there have been limited data published regarding progress made. In this piece, we discuss reasons for the original collapse of the GI Match, including most notably a perceived oversupply of GI physicians and a poor job market. We discuss the negative impacts the absence of the Match had on programs and on applicants, as well as the impetus to reorganize the Match under the NRMP. We then utilize data published annually by the NRMP to demonstrate that in the decade since its rebirth, the GI Match has been remarkably successful in terms of attracting the participation of applicants and programs. We show that previous misguided concerns of an oversupply of GI physicians were not realized, and that GI fellowship positions remain highly competitive for internal medicine applicants. Finally, we discuss possible implications of recent changes in the healthcare landscape on the GI Match.

MATCHING IN INFORMAL FINANCIAL INSTITUTIONS.

Science.gov (United States)

Eeckhout, Jan; Munshi, Kaivan

2010-09-01

This paper analyzes an informal financial institution that brings heterogeneous agents together in groups. We analyze decentralized matching into these groups, and the equilibrium composition of participants that consequently arises. We find that participants sort remarkably well across the competing groups, and that they re-sort immediately following an unexpected exogenous regulatory change. These findings suggest that the competitive matching model might have applicability and bite in other settings where matching is an important equilibrium phenomenon. (JEL: O12, O17, G20, D40).

75 FR 30839 - Privacy Act of 1974; CMS Computer Match No. 2010-03, HHS Computer Match No. 1003, SSA Computer...

Science.gov (United States)

2010-06-02

... 1974; CMS Computer Match No. 2010-03, HHS Computer Match No. 1003, SSA Computer Match No. 1048, IRS... Services (CMS). ACTION: Notice of renewal of an existing computer matching program (CMP) that has an...'' section below for comment period. DATES: Effective Dates: CMS filed a report of the Computer Matching...

Concussions and Head Injuries in English Community Rugby Union Match Play.

Science.gov (United States)

Roberts, Simon P; Trewartha, Grant; England, Michael; Goodison, William; Stokes, Keith A

2017-02-01

Previous research has described general injury patterns in community-level rugby union, but specific information on time-loss head injuries has not been reported. To establish the incidence and nature of significant time-loss head injuries in English community rugby match play, and to identify the injury risk for specific contact events. Descriptive epidemiology study. Over 6 seasons, injury information was collected from 46 (2009-2010), 67 (2010-2011), 76 (2011-2012), 50 (2012-2013), 67 (2013-2014), and 58 (2014-2015) English community rugby clubs (Rugby Football Union levels 3-9) over a total of 175,940 hours of player match exposure. Club injury management staff reported information for all head injuries sustained during match play whereby the player was absent for 8 days or greater. Clubs were subdivided into semiprofessional (mean player age, 24.6 ± 4.7 years), amateur (24.9 ± 5.1 years), and recreational (25.6 ± 6.1 years) playing levels. Contact events from a sample of 30 matches filmed over seasons 2009-2010, 2010-2011, and 2011-2012 provided mean values for the frequency of contact events. The overall incidence for time-loss head injuries was 2.43 injuries per 1000 player match hours, with a higher incidence for the amateur (2.78; 95% CI, 2.37-3.20) compared with recreational (2.20; 95% CI, 1.86-2.53) ( P = .032) playing level but not different to the semiprofessional (2.31; 95% CI, 1.83-2.79) playing level. Concussion was the most common time-loss head injury, with 1.46 per 1000 player match hours. The tackle event was associated with 64% of all head injuries and 74% of all concussions. There was also a higher risk of injuries per tackle (0.33 per 1000 events; 95% CI, 0.30-0.37) compared with all other contact events. Concussion was the most common head injury diagnosis, although it is likely that this injury was underreported. Continuing education programs for medical staff and players are essential for the improved identification and management of

The memory template in Drosophila pattern vision at the flight simulator.

Science.gov (United States)

Ernst, R; Heisenberg, M

1999-11-01

Pattern recognition is studied in flight orientation of fixed flying Drosophila melanogaster controlling the horizontal rotations of an arena. Earlier experiments had suggested a simple mechanism of pattern recognition in which a memory template and the actual image are retinotopically matched. In contrast, we now show that Drosophila extracts at least two and probably four pattern parameters: size, vertical position of the center of gravity and, presumably horizontal/vertical extent as well as vertical separatedness of pattern elements. Moreover, the fly treats isolated pattern elements as a compound figure. Retinal transfer is possible between training and test if the centers of gravity of the compound figures are retained.

Explaining Match Outcome During The Men’s Basketball Tournament at The Olympic Games

Science.gov (United States)

Leicht, Anthony S.; Gómez, Miguel A.; Woods, Carl T.

2017-01-01

In preparation for the Olympics, there is a limited opportunity for coaches and athletes to interact regularly with team performance indicators providing important guidance to coaches for enhanced match success at the elite level. This study examined the relationship between match outcome and team performance indicators during men’s basketball tournaments at the Olympic Games. Twelve team performance indicators were collated from all men’s teams and matches during the basketball tournament of the 2004-2016 Olympic Games (n = 156). Linear and non-linear analyses examined the relationship between match outcome and team performance indicator characteristics; namely, binary logistic regression and a conditional interference (CI) classification tree. The most parsimonious logistic regression model retained ‘assists’, ‘defensive rebounds’, ‘field-goal percentage’, ‘fouls’, ‘fouls against’, ‘steals’ and ‘turnovers’ (delta AIC winning (93.2%). Match outcome during the men’s basketball tournaments at the Olympic Games was identified by a unique combination of performance indicators. Despite the average model accuracy being marginally higher for the logistic regression analysis, the CI classification tree offered a greater practical utility for coaches through its resolution of non-linear phenomena to guide team success. Key points A unique combination of team performance indicators explained 93.2% of winning observations in men’s basketball at the Olympics. Monitoring of these team performance indicators may provide coaches with the capability to devise multiple game plans or strategies to enhance their likelihood of winning. Incorporation of machine learning techniques with team performance indicators may provide a valuable and strategic approach to explain patterns within multivariate datasets in sport science. PMID:29238245

Improving excellence in scoliosis rehabilitation: a controlled study of matched pairs.

Science.gov (United States)

Weiss, H-R; Klein, R

2006-01-01

Physiotherapy programmes so far mainly address the lateral deformity of scoliosis, a few aim at the correction of rotation and only very few address the sagittal profile. Meanwhile, there is evidence that correction forces applied in the sagittal plane are also able to correct the scoliotic deformity in the coronal and frontal planes. So it should be possible to improve excellence in scoliosis rehabilitation by the implementation of exercises to correct the sagittal deformity in scoliosis patients. An exercise programme (physio-logic exercises) aiming at a physiologic sagittal profile was developed to add to the programme applied at the centre or to replace certain exercises or exercising positions. To test the hypothesis that physio-logic exercises improve the outcome of Scoliosis Intensive Rehabilitation (SIR), the following study design was chosen: Prospective controlled trial of pairs of patients with idiopathic scoliosis matched by sex, age, Cobb angle and curve pattern. There were 18 patients in the treatment group (SIR + physio-logic exercises) and 18 patients in the control group (SIR only), all in matched pairs. Average Cobb angle in the treatment group was 34.5 degrees (SD 7.8) Cobb angle in the control group was 31.6 degrees (SD 5.8). Age in the treatment group was at average 15.3 years (SD 1.1) and in the control group 14.7 years (SD 1.3). Thirteen of the 18 patients in either group had a brace. Outcome parameter: average lateral deviation (mm), average surface rotation ( degrees ) and maximum Kyphosis angle ( degrees ) as evaluated with the help of surface topography (Formetric-system). Lateral deviation (mm) decreased significantly after the performance of the physio-logic programme and highly significantly in the physio-logic ADL posture; however, it was not significant after completion of the whole rehabilitation programme (2.3 vs 0.3 mm in the controls). Surface rotation improved at average 1.2 degrees in the treatment group and 0.8 degrees in the

The meteorological environment of the tropospheric ozone maximum over the tropical South Atlantic

Energy Technology Data Exchange (ETDEWEB)

Krishnamurti, T N; Fuelberg, H E; Bensman, E L; Sinha, M C; Oosterhof, D; Kumar, V B [Florida State University, Tallahassee, FL (United States). Department of Meteorology

1993-01-01

This paper examines atmospheric flow patterns over the Southern Atlantic Ocean, where a maximum of tropospheric ozone is observed just west of Southern Africa. The climatology of the South Atlantic basin is shown to favour flow off from South America and Africa converging into the area of high tropospheric ozone. This ozone is initially attributable to byproducts of biomass burning over both these continents. A case study, carried out over 6 days during October 1989, was used to determine the effect of a purely advective scheme (no photochemistry) on the distribution of ozone over the basin. The results showed a pattern in which ozone accumulated off the west coast of South Africa within 72 hours after beginning with an homogenous, zonally-symmetric distribution of ozone. 11 refs.

Citation Matching in Sanskrit Corpora Using Local Alignment

Science.gov (United States)

Prasad, Abhinandan S.; Rao, Shrisha

Citation matching is the problem of finding which citation occurs in a given textual corpus. Most existing citation matching work is done on scientific literature. The goal of this paper is to present methods for performing citation matching on Sanskrit texts. Exact matching and approximate matching are the two methods for performing citation matching. The exact matching method checks for exact occurrence of the citation with respect to the textual corpus. Approximate matching is a fuzzy string-matching method which computes a similarity score between an individual line of the textual corpus and the citation. The Smith-Waterman-Gotoh algorithm for local alignment, which is generally used in bioinformatics, is used here for calculating the similarity score. This similarity score is a measure of the closeness between the text and the citation. The exact- and approximate-matching methods are evaluated and compared. The methods presented can be easily applied to corpora in other Indic languages like Kannada, Tamil, etc. The approximate-matching method can in particular be used in the compilation of critical editions and plagiarism detection in a literary work.

Match-to-match variation in physical activity and technical skill measures in professional Australian Football.

Science.gov (United States)

Kempton, Thomas; Sullivan, Courtney; Bilsborough, Johann C; Cordy, Justin; Coutts, Aaron J

2015-01-01

To determine the match-to-match variability in physical activity and technical performance measures in Australian Football, and examine the influence of playing position, time of season, and different seasons on these measures of variability. Longitudinal observational study. Global positioning system, accelerometer and technical performance measures (total kicks, handballs, possessions and Champion Data rank) were collected from 33 players competing in the Australian Football League over 31 matches during 2011-2012 (N=511 observations). The global positioning system data were categorised into total distance, mean speed (mmin(-1)), high-speed running (>14.4 kmh(-1)), very high-speed running (>19.9 kmh(-1)), and sprint (>23.0 kmh(-1)) distance while player load was collected from the accelerometer. The data were log transformed to provide coefficient of variation and the between subject standard deviation (expressed as percentages). Match-to-match variability was increased for higher speed activities (high-speed running, very high-speed running, sprint distance, coefficient of variation %: 13.3-28.6%) compared to global measures (speed, total distance, player load, coefficient of variation %: 5.3-9.2%). The between-match variability was relativity stable for all measures between and within AFL seasons, with only few differences between positions. Higher speed activities (high-speed running, very high-speed running, sprint distance), but excluding mean speed, total distance and player load, were all higher in the final third phase of the season compared to the start of the season. While global measures of physical performance are relatively stable, higher-speed activities and technical measures exhibit a large degree of between-match variability in Australian Football. However, these measures remain relatively stable between positions, and within and between Australian Football League seasons. Copyright © 2013 Sports Medicine Australia. Published by Elsevier Ltd

Longer repetition duration increases muscle activation and blood lactate response in matched resistance training protocols

Directory of Open Access Journals (Sweden)

Hugo Cesar Martins-Costa

2016-03-01

Full Text Available Abstract This study analyzed the effect of different repetition durations on electromyographic and blood lactate responses of the bench press exercise. Fifteen recreationally trained male volunteers completed two training protocols, matched for intensity (% one-repetition maximum; 1RM, number of sets, number of repetitions, and rest intervals. One of the protocols was performed with a repetition duration of 4 s (2 s concentric: 2 s eccentric; 2:2 protocol, whereas the second protocol had a repetition duration of 6 s (2 s concentric: 4 s eccentric; 2:4 protocol. The results showed higher normalized integrated electromyography (pectoralis major and triceps brachii for the 2:4 protocol. Blood lactate concentration was also higher in the 2:4 protocol across all sets. These results show that adding 2 s to the eccentric action in matched training protocols increases muscle activation and blood lactate response, which reinforces the notion that increasing repetition duration is an alternative load progression in resistance training.

Applying Agrep to r-NSA to solve multiple sequences approximate matching.

Science.gov (United States)

Ni, Bing; Wong, Man-Hon; Lam, Chi-Fai David; Leung, Kwong-Sak

2014-01-01

This paper addresses the approximate matching problem in a database consisting of multiple DNA sequences, where the proposed approach applies Agrep to a new truncated suffix array, r-NSA. The construction time of the structure is linear to the database size, and the computations of indexing a substring in the structure are constant. The number of characters processed in applying Agrep is analysed theoretically, and the theoretical upper-bound can approximate closely the empirical number of characters, which is obtained through enumerating the characters in the actual structure built. Experiments are carried out using (synthetic) random DNA sequences, as well as (real) genome sequences including Hepatitis-B Virus and X-chromosome. Experimental results show that, compared to the straight-forward approach that applies Agrep to multiple sequences individually, the proposed approach solves the matching problem in much shorter time. The speed-up of our approach depends on the sequence patterns, and for highly similar homologous genome sequences, which are the common cases in real-life genomes, it can be up to several orders of magnitude.

Anomalous dispersion enhanced Cerenkov phase-matching

Energy Technology Data Exchange (ETDEWEB)

Kowalczyk, T.C.; Singer, K.D. [Case Western Reserve Univ., Cleveland, OH (United States). Dept. of Physics; Cahill, P.A. [Sandia National Labs., Albuquerque, NM (United States)

1993-11-01

The authors report on a scheme for phase-matching second harmonic generation in polymer waveguides based on the use of anomalous dispersion to optimize Cerenkov phase matching. They have used the theoretical results of Hashizume et al. and Onda and Ito to design an optimum structure for phase-matched conversion. They have found that the use of anomalous dispersion in the design results in a 100-fold enhancement in the calculated conversion efficiency. This technique also overcomes the limitation of anomalous dispersion phase-matching which results from absorption at the second harmonic. Experiments are in progress to demonstrate these results.

Dynamic Analysis of the Abnormal Isometric Strength Movement Pattern between Shoulder and Elbow Joint in Patients with Hemiplegia.

Science.gov (United States)

Liu, Yali; Hong, Yuezhen; Ji, Linhong

2018-01-01

Patients with hemiplegia usually have weak muscle selectivity and usually perform strength at a secondary joint (secondary strength) during performing a strength at one joint (primary strength). The abnormal strength pattern between shoulder and elbow joint has been analyzed by the maximum value while the performing process with strength changing from 0 to maximum then to 0 was a dynamic process. The objective of this study was to develop a method to dynamically analyze the strength changing process. Ten patients were asked to perform four group asks (maximum and 50% maximum voluntary strength in shoulder abduction, shoulder adduction, elbow flexion, and elbow extension). Strength and activities from seven muscles were measured. The changes of secondary strength had significant correlation with those of primary strength in all tasks ( R > 0.76, p strength ( R > 0.4, p strength pattern (all p strength pattern. The muscles, deltoid muscles, biceps brachii, triceps brachii, and brachioradialis, much influenced the stereotyped movement pattern between shoulder and elbow joint.

The Effect of Electrical Impedance Matching on the Electromechanical Characteristics of Sandwiched Piezoelectric Ultrasonic Transducers

Directory of Open Access Journals (Sweden)

Yuan Yang

2017-12-01

Full Text Available For achieving the power maximum transmission, the electrical impedance matching (EIM for piezoelectric ultrasonic transducers is highly required. In this paper, the effect of EIM networks on the electromechanical characteristics of sandwiched piezoelectric ultrasonic transducers is investigated in time and frequency domains, based on the PSpice model of single sandwiched piezoelectric ultrasonic transducer. The above-mentioned EIM networks include, series capacitance and parallel inductance (I type and series inductance and parallel capacitance (II type. It is shown that when I and II type EIM networks are used, the resonance and anti-resonance frequencies and the received signal tailing are decreased; II type makes the electro-acoustic power ratio and the signal tailing smaller whereas it makes the electro-acoustic gain ratio larger at resonance frequency. In addition, I type makes the effective electromechanical coupling coefficient increase and II type makes it decrease; II type make the power spectral density at resonance frequency more dramatically increased. Specially, the electro-acoustic power ratio has maximum value near anti-resonance frequency, while the electro-acoustic gain ratio has maximum value near resonance frequency. It can be found that the theoretically analyzed results have good consistency with the measured ones.

DOE Matching Grant Program; FINAL

International Nuclear Information System (INIS)

Dr Marvin Adams

2002-01-01

OAK 270 - The DOE Matching Grant Program provided$50,000.00 to the Dept of N.E. at TAMU, matching a gift of$50,000.00 from TXU Electric. The$100,000.00 total was spent on scholarships, departmental labs, and computing network

Statistical methods for history matching

DEFF Research Database (Denmark)

Johansen, Kent

Denne afhandling beskriver statistiske metoder til history matching af olieproduktion. History matching er en vigtig del af driften af et oliefelt og er ofte forbundet med problemer relateret til kompleksiteten af reservoiret og selve størrelsen af reservoirsimuleringsmodellen. Begrebet history m...

A comparative study between matched and mis-matched projection/back projection pairs used with ASIRT reconstruction method

International Nuclear Information System (INIS)

Guedouar, R.; Zarrad, B.

2010-01-01

For algebraic reconstruction techniques both forward and back projection operators are needed. The ability to perform accurate reconstruction relies fundamentally on the forward projection and back projection methods which are usually, the transpose of each other. Even though the mis-matched pairs may introduce additional errors during the iterative process, the usefulness of mis-matched projector/back projector pairs has been proved in image reconstruction. This work investigates the performance of matched and mis-matched reconstruction pairs using popular forward projectors and their transposes when used in reconstruction tasks with additive simultaneous iterative reconstruction techniques (ASIRT) in a parallel beam approach. Simulated noiseless phantoms are used to compare the performance of the investigated pairs in terms of the root mean squared errors (RMSE) which are calculated between reconstructed slices and the reference in different regions. Results show that mis-matched projection/back projection pairs can promise more accuracy of reconstructed images than matched ones. The forward projection operator performance seems independent of the choice of the back projection operator and vice versa.

A comparative study between matched and mis-matched projection/back projection pairs used with ASIRT reconstruction method

Energy Technology Data Exchange (ETDEWEB)

Guedouar, R., E-mail: raja_guedouar@yahoo.f [Higher School of Health Sciences and Techniques of Monastir, Av. Avicenne, 5060 Monastir, B.P. 128 (Tunisia); Zarrad, B., E-mail: boubakerzarrad@yahoo.f [Higher School of Health Sciences and Techniques of Monastir, Av. Avicenne, 5060 Monastir, B.P. 128 (Tunisia)

2010-07-21

For algebraic reconstruction techniques both forward and back projection operators are needed. The ability to perform accurate reconstruction relies fundamentally on the forward projection and back projection methods which are usually, the transpose of each other. Even though the mis-matched pairs may introduce additional errors during the iterative process, the usefulness of mis-matched projector/back projector pairs has been proved in image reconstruction. This work investigates the performance of matched and mis-matched reconstruction pairs using popular forward projectors and their transposes when used in reconstruction tasks with additive simultaneous iterative reconstruction techniques (ASIRT) in a parallel beam approach. Simulated noiseless phantoms are used to compare the performance of the investigated pairs in terms of the root mean squared errors (RMSE) which are calculated between reconstructed slices and the reference in different regions. Results show that mis-matched projection/back projection pairs can promise more accuracy of reconstructed images than matched ones. The forward projection operator performance seems independent of the choice of the back projection operator and vice versa.

Effects of international football matches on ambulance call profiles and volumes during the 2006 World Cup.

Science.gov (United States)

Deakin, Charles D; Thompson, Fizz; Gibson, Caroline; Green, Mark

2007-06-01

Prompt ambulance attendance is aimed at improving patient care. With finite resources struggling to meet performance targets, unforeseen demand precludes the ability to tailor resources to cope with increased call volumes, and can have a marked detrimental effect on performance and hence patient care. The effects of the 2006 World Cup football matches on call volumes and profiles were analysed to understand how public events can influence demands on the ambulance service. All emergency calls to the Hampshire Ambulance Service NHS Trust (currently the Hampshire Division of South Central Ambulance Service, Winchester, UK) during the first weekend of the 2006 World Cup football matches were analysed by call volume and classification of call (call type). On the day of the first football match, call volume was over 50% higher than that on a typical Saturday, with distinct peaks before and after the inaugural match. Call profile analysis showed increases in alcohol-related emergencies, including collapse, unconsciousness, assault and road traffic accidents. The increase in assaults was particularly marked at the end of each match and increased again into the late evening. A detailed mapping of call volumes and profiles during the World Cup football shows a significant increase in overall emergency calls, mostly alcohol related. Mapping of limited resources to these patterns will allow improved responses to emergency calls.

75 FR 68396 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of Labor (DOL))-Match...

Science.gov (United States)

2010-11-05

... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2010-0052] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Department of Labor (DOL))--Match Number 1003 AGENCY: Social Security... as shown above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection...

Probability matching and strategy availability.

Science.gov (United States)

Koehler, Derek J; James, Greta

2010-09-01

Findings from two experiments indicate that probability matching in sequential choice arises from an asymmetry in strategy availability: The matching strategy comes readily to mind, whereas a superior alternative strategy, maximizing, does not. First, compared with the minority who spontaneously engage in maximizing, the majority of participants endorse maximizing as superior to matching in a direct comparison when both strategies are described. Second, when the maximizing strategy is brought to their attention, more participants subsequently engage in maximizing. Third, matchers are more likely than maximizers to base decisions in other tasks on their initial intuitions, suggesting that they are more inclined to use a choice strategy that comes to mind quickly. These results indicate that a substantial subset of probability matchers are victims of "underthinking" rather than "overthinking": They fail to engage in sufficient deliberation to generate a superior alternative to the matching strategy that comes so readily to mind.

Maximum surgical blood ordering schedules for revision lower limb arthroplasty.

Science.gov (United States)

Mahadevan, Devendra; Challand, Christopher; Clarke, Andrew; Keenan, Jonathan

2011-05-01

Effective utilisation of blood products is fundamental. The introduction of maximum surgical blood ordering schedules (MSBOS) for operations has been shown to improve transfusion services. A retrospective analysis was undertaken to establish an evidence-based MSBOS for revision total hip replacement (THR) and total knee revision (TKR). The impact of this schedule on blood conservation was analysed. A retrospective analysis was undertaken on 397 patients who underwent revision THR and TKR over a 4-year period. The cross-match-to-transfusion ratio (CTR) and transfusion index (TI) were calculated. A MSBOS protocol was created based on the TIs and its' impact on transfusion services was assessed prospectively on 125 patients by comparing CTRs. In revision THR, TI was 1.19 for elective cases, 1.55 for emergency cases and 2.35 for infected cases. There was no difference in TI for revisions of cemented and uncemented components. Single component THR revision required less transfusion. In revision TKR, TI was 0.31 for elective cases, 2.0 for emergency cases and 1.23 for cases with infection. The introduction of the MSBOS protocol had resulted in a considerable improvement in blood ordering. Reductions in the CTR were seen for all types of revision surgery, but most evident in elective revision THR (3.24-2.18) and elective revision TKR (7.95-1.2). Analysis confirmed that excessive cross-matching occurred for revision lower limb arthroplasty. The introduction of our MSBOS protocol promoted blood conservation and compliance with established national guidelines.

Effect of different planting patterns on yield and it's components of maize

International Nuclear Information System (INIS)

Ahmad, M.; Chudhry, M.H.

2008-01-01

This study was conducted at Maize and Millets Research Institute, Yusafwala, district Sahiwal during spring and kharif 2001, to find out the best planting pattern for obtaining maximum grain yield of maize variety Sahiwal-2002. For the purpose five planting patterns Were studied in an experimental laid out in randomized complete block design with four replications having plot size of 5m x 6m, Maximum grain yield (5236 kg, ha-1) was obtained with P1 (Flat sowing with earthing up) that was statistically at per with ridge sowing giving 4343 kg, ha-1 grain yield in spring season, Similarly maximum grain yield of 6287 kg, ha-1 was achieved with the same planting pattern in kharif -2001 followed by P2 (Ridge sowing with single row), which gave 5270 kg, ha-1 grain yield. Minimum lodging percentage was observed P1 (Flat sowing with earthing up) in both the seasons i.e. 14.36% and 7.27 % and maximum lodging was recorded in P5 (Bed sowing with two rows 75 cm apart), i.e. 88.56% and 25.85 % during spring and kharif seasons 2001 respectively. Keeping in view the results of both the season it is suggested that both the planting patterns (Flat sowing with earthing up and Ridge sowing with single row) are equally good, because ridge sowing cannot be ignored due 10 less seed requirements, no need of intercultural practices and less delta of water per irrigation is needed. (author)

77 FR 24756 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of Labor (DOL))-Match...

Science.gov (United States)

2012-04-25

... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2011-0084] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Department of Labor (DOL))--Match Number 1003 AGENCY: Social Security... above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988...

Object-based connectedness facilitates matching

NARCIS (Netherlands)

Koning, A.R.; Lier, R.J. van

2003-01-01

In two matching tasks, participants had to match two images of object pairs. Image-based (113) connectedness refers to connectedness between the objects in an image. Object-based (OB) connectedness refers to connectedness between the interpreted objects. In Experiment 1, a monocular depth cue

Platform pricing in matching markets

NARCIS (Netherlands)

Goos, M.; van Cayseele, P.; Willekens, B.

2011-01-01

This paper develops a simple model of monopoly platform pricing accounting for two pertinent features of matching markets. 1) The trading process is characterized by search and matching frictions implying limits to positive cross-side network effects and the presence of own-side congestion.

Matching score based face recognition

NARCIS (Netherlands)

Boom, B.J.; Beumer, G.M.; Spreeuwers, Lieuwe Jan; Veldhuis, Raymond N.J.

2006-01-01

Accurate face registration is of vital importance to the performance of a face recognition algorithm. We propose a new method: matching score based face registration, which searches for optimal alignment by maximizing the matching score output of a classifier as a function of the different

Matching Organs

Science.gov (United States)

... to know FAQ Living donation What is living donation? Organs Types Being a living donor First steps Being ... brochures What Every Patient Needs to Know Living Donation Multiple Listing Visit UNOS Store Learn more How organs are matched How to become a living donor ...

Matching by Monotonic Tone Mapping.

Science.gov (United States)

Kovacs, Gyorgy

2018-06-01

In this paper, a novel dissimilarity measure called Matching by Monotonic Tone Mapping (MMTM) is proposed. The MMTM technique allows matching under non-linear monotonic tone mappings and can be computed efficiently when the tone mappings are approximated by piecewise constant or piecewise linear functions. The proposed method is evaluated in various template matching scenarios involving simulated and real images, and compared to other measures developed to be invariant to monotonic intensity transformations. The results show that the MMTM technique is a highly competitive alternative of conventional measures in problems where possible tone mappings are close to monotonic.

77 FR 24757 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of Labor (DOL))-Match...

Science.gov (United States)

2012-04-25

... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2011-0083] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Department of Labor (DOL))--Match Number 1015 AGENCY: Social Security... regarding protections for such persons. The Privacy Act, as amended, regulates the use of computer matching...

Maximum concentrations at work and maximum biologically tolerable concentration for working materials 1991

International Nuclear Information System (INIS)

1991-01-01

The meaning of the term 'maximum concentration at work' in regard of various pollutants is discussed. Specifically, a number of dusts and smokes are dealt with. The valuation criteria for maximum biologically tolerable concentrations for working materials are indicated. The working materials in question are corcinogeneous substances or substances liable to cause allergies or mutate the genome. (VT) [de

Image matching navigation based on fuzzy information

Institute of Scientific and Technical Information of China (English)

田玉龙; 吴伟仁; 田金文; 柳健

2003-01-01

In conventional image matching methods, the image matching process is mostly based on image statistic information. One aspect neglected by all these methods is that there is much fuzzy information contained in these images. A new fuzzy matching algorithm based on fuzzy similarity for navigation is presented in this paper. Because the fuzzy theory is of the ability of making good description of the fuzzy information contained in images, the image matching method based on fuzzy similarity would look forward to producing good performance results. Experimental results using matching algorithm based on fuzzy information also demonstrate its reliability and practicability.

Dietary patterns and colorectal cancer

OpenAIRE

Tayyem, Reema F.; Bawadi, Hiba A.; Shehadah, Ihab; Agraib, Lana M.; AbuMweis, Suhad S.; Al-Jaberi, Tareq; Al-Nusairr, Majed; Bani-Hani, Kamal E.; Heath, Dennis D.

2016-01-01

Summary Background & aimsDietary pattern and lifestyle have been reported to be important risk factors in the development of colorectal cancer (CRC). However, the mechanism of action of dietary factors in CRC disease is unclear. The aim of this study is the examination of several dietary choices and their potential association with the risk of developing CRC. MethodsDietary data was collected from 220 subjects who were previously diagnosed with CRC, and 281 control subjects (matched by age, g...

Role model and prototype matching

DEFF Research Database (Denmark)

Lykkegaard, Eva; Ulriksen, Lars

2016-01-01

’ meetings with the role models affected their thoughts concerning STEM students and attending university. The regular self-to-prototype matching process was shown in real-life role-models meetings to be extended to a more complex three-way matching process between students’ self-perceptions, prototype...

40 CFR 1042.140 - Maximum engine power, displacement, power density, and maximum in-use engine speed.

Science.gov (United States)

2010-07-01

... cylinders having an internal diameter of 13.0 cm and a 15.5 cm stroke length, the rounded displacement would... 40 Protection of Environment 32 2010-07-01 2010-07-01 false Maximum engine power, displacement... Maximum engine power, displacement, power density, and maximum in-use engine speed. This section describes...

Toward Practical Secure Stable Matching

Directory of Open Access Journals (Sweden)

Riazi M. Sadegh

2017-01-01

Full Text Available The Stable Matching (SM algorithm has been deployed in many real-world scenarios including the National Residency Matching Program (NRMP and financial applications such as matching of suppliers and consumers in capital markets. Since these applications typically involve highly sensitive information such as the underlying preference lists, their current implementations rely on trusted third parties. This paper introduces the first provably secure and scalable implementation of SM based on Yao’s garbled circuit protocol and Oblivious RAM (ORAM. Our scheme can securely compute a stable match for 8k pairs four orders of magnitude faster than the previously best known method. We achieve this by introducing a compact and efficient sub-linear size circuit. We even further decrease the computation cost by three orders of magnitude by proposing a novel technique to avoid unnecessary iterations in the SM algorithm. We evaluate our implementation for several problem sizes and plan to publish it as open-source.

Credal Networks under Maximum Entropy

OpenAIRE

Lukasiewicz, Thomas

2013-01-01

We apply the principle of maximum entropy to select a unique joint probability distribution from the set of all joint probability distributions specified by a credal network. In detail, we start by showing that the unique joint distribution of a Bayesian tree coincides with the maximum entropy model of its conditional distributions. This result, however, does not hold anymore for general Bayesian networks. We thus present a new kind of maximum entropy models, which are computed sequentially. ...

78 FR 39730 - Privacy Act of 1974; CMS Computer Match No. 2013-11; HHS Computer Match No. 1302

Science.gov (United States)

2013-07-02

... 1974; CMS Computer Match No. 2013-11; HHS Computer Match No. 1302 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION: Notice of Computer Matching... notice announces the establishment of a CMP that CMS intends to conduct with State-based Administering...

76 FR 14669 - Privacy Act of 1974; CMS Computer Match No. 2011-02; HHS Computer Match No. 1007

Science.gov (United States)

2011-03-17

... 1974; CMS Computer Match No. 2011-02; HHS Computer Match No. 1007 AGENCY: Department of Health and Human Services (HHS), Centers for Medicare & Medicaid Services (CMS). ACTION: Notice of computer... notice establishes a computer matching agreement between CMS and the Department of Defense (DoD). We have...

Design of a Front– End Amplifier for the Maximum Power Delivery and Required Noise by HBMO with Support Vector Microstrip Model

Directory of Open Access Journals (Sweden)

F. Guneş

2014-04-01

Full Text Available Honey Bee Mating Optimization (HBMO is a recent swarm-based optimization algorithm to solve highly nonlinear problems, whose based approach combines the powers of simulated annealing, genetic algorithms, and an effective local search heuristic to search for the best possible solution to the problem under investigation within a reasonable computing time. In this work, the HBMO- based design is carried out for a front-end amplifier subject to be a subunit of a radar system in conjunction with a cost effective 3-D SONNET-based Support Vector Regression Machine (SVRM microstrip model. All the matching microstrip widths, lengths are obtained on a chosen substrate to satisfy the maximum power delivery and the required noise over the required bandwidth of a selected transistor. The proposed HBMO- based design is applied to the design of a typical ultra-wide-band low noise amplifier with NE3512S02 on a substrate of Rogers 4350 for the maximum output power and the noise figure F(f=1dB within the 5-12 GHz using the T- type of microstrip matching circuits. Furthermore, the effectiveness and efficiency of the proposed HBMO based design are manifested by comparing it with the Genetic Algorithm (GA, Particle Swarm Optimization (PSO and the simple HBMO based designs.

Image Correlation Pattern Optimization for Micro-Scale In-Situ Strain Measurements

Science.gov (United States)

Bomarito, G. F.; Hochhalter, J. D.; Cannon, A. H.

2016-01-01

The accuracy and precision of digital image correlation (DIC) is a function of three primary ingredients: image acquisition, image analysis, and the subject of the image. Development of the first two (i.e. image acquisition techniques and image correlation algorithms) has led to widespread use of DIC; however, fewer developments have been focused on the third ingredient. Typically, subjects of DIC images are mechanical specimens with either a natural surface pattern or a pattern applied to the surface. Research in the area of DIC patterns has primarily been aimed at identifying which surface patterns are best suited for DIC, by comparing patterns to each other. Because the easiest and most widespread methods of applying patterns have a high degree of randomness associated with them (e.g., airbrush, spray paint, particle decoration, etc.), less effort has been spent on exact construction of ideal patterns. With the development of patterning techniques such as microstamping and lithography, patterns can be applied to a specimen pixel by pixel from a patterned image. In these cases, especially because the patterns are reused many times, an optimal pattern is sought such that error introduced into DIC from the pattern is minimized. DIC consists of tracking the motion of an array of nodes from a reference image to a deformed image. Every pixel in the images has an associated intensity (grayscale) value, with discretization depending on the bit depth of the image. Because individual pixel matching by intensity value yields a non-unique scale-dependent problem, subsets around each node are used for identification. A correlation criteria is used to find the best match of a particular subset of a reference image within a deformed image. The reader is referred to references for enumerations of typical correlation criteria. As illustrated by Schreier and Sutton and Lu and Cary systematic errors can be introduced by representing the underlying deformation with under-matched

Fast image matching algorithm based on projection characteristics

Science.gov (United States)

Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun

2011-06-01

Based on analyzing the traditional template matching algorithm, this paper identified the key factors restricting the speed of matching and put forward a brand new fast matching algorithm based on projection. Projecting the grayscale image, this algorithm converts the two-dimensional information of the image into one-dimensional one, and then matches and identifies through one-dimensional correlation, meanwhile, because of normalization has been done, when the image brightness or signal amplitude increasing in proportion, it could also perform correct matching. Experimental results show that the projection characteristics based image registration method proposed in this article could greatly improve the matching speed, which ensuring the matching accuracy as well.

Maximum Entropy in Drug Discovery

Directory of Open Access Journals (Sweden)

Chih-Yuan Tseng

2014-07-01

Full Text Available Drug discovery applies multidisciplinary approaches either experimentally, computationally or both ways to identify lead compounds to treat various diseases. While conventional approaches have yielded many US Food and Drug Administration (FDA-approved drugs, researchers continue investigating and designing better approaches to increase the success rate in the discovery process. In this article, we provide an overview of the current strategies and point out where and how the method of maximum entropy has been introduced in this area. The maximum entropy principle has its root in thermodynamics, yet since Jaynes’ pioneering work in the 1950s, the maximum entropy principle has not only been used as a physics law, but also as a reasoning tool that allows us to process information in hand with the least bias. Its applicability in various disciplines has been abundantly demonstrated. We give several examples of applications of maximum entropy in different stages of drug discovery. Finally, we discuss a promising new direction in drug discovery that is likely to hinge on the ways of utilizing maximum entropy.

Analysis of matches and partial-matches in a Danish STR data set

DEFF Research Database (Denmark)

Tvedebrink, Torben; Eriksen, Poul Svante; Curan, James Michael

2012-01-01

Over the recent years, the national databases of STR profiles have grown in size due to the success of forensic DNA analysis in solving crimes. The accumulation of DNA profiles implies that the probability of a random match or near match of two randomly selected DNA profiles in the database...... increases. We analysed 53,295 STR profiles from individuals investigated in relation to crime case investigations at the Department of Forensic Medicine, Faculty of Health Sciences, University of Copenhagen, Denmark. Incomplete STR profiles (437 circa 0.8% of the total), 48 redundant STR profiles from...

78 FR 50419 - Privacy Act of 1974; CMS Computer Match No. 2013-10; HHS Computer Match No. 1310

Science.gov (United States)

2013-08-19

... 1974; CMS Computer Match No. 2013-10; HHS Computer Match No. 1310 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION: Notice of Computer Matching... notice announces the establishment of a CMP that CMS plans to conduct with the Department of Homeland...

Maximum Quantum Entropy Method

OpenAIRE

Sim, Jae-Hoon; Han, Myung Joon

2018-01-01

Maximum entropy method for analytic continuation is extended by introducing quantum relative entropy. This new method is formulated in terms of matrix-valued functions and therefore invariant under arbitrary unitary transformation of input matrix. As a result, the continuation of off-diagonal elements becomes straightforward. Without introducing any further ambiguity, the Bayesian probabilistic interpretation is maintained just as in the conventional maximum entropy method. The applications o...

Camouflaging in a complex environment--octopuses use specific features of their surroundings for background matching.

Directory of Open Access Journals (Sweden)

Noam Josef

Full Text Available Living under intense predation pressure, octopuses evolved an effective and impressive camouflaging ability that exploits features of their surroundings to enable them to "blend in." To achieve such background matching, an animal may use general resemblance and reproduce characteristics of its entire surroundings, or it may imitate a specific object in its immediate environment. Using image analysis algorithms, we examined correlations between octopuses and their backgrounds. Field experiments show that when camouflaging, Octopus cyanea and O. vulgaris base their body patterns on selected features of nearby objects rather than attempting to match a large field of view. Such an approach enables the octopus to camouflage in partly occluded environments and to solve the problem of differences in appearance as a function of the viewing inclination of the observer.

Foundations for a syntatic pattern recognition system for genomic DNA sequences

Energy Technology Data Exchange (ETDEWEB)

Searles, D.B.

1993-03-01

The goal of the proposed work is the creation of a software system that will perform sophisticated pattern recognition and related functions at a level of abstraction and with expressive power beyond current general-purpose pattern-matching systems for biological sequences; and with a more uniform language, environment, and graphical user interface, and with greater flexibility, extensibility, embeddability, and ability to incorporate other algorithms, than current special-purpose analytic software.

DESIGN OF WIRE-WRAPPED ROD BUNDLE MATCHED INDEX-OF-REFRACTION EXPERIMENTS

Energy Technology Data Exchange (ETDEWEB)

Hugh McIlroy; Hongbin Zhang; Kurt Hamman

2008-05-01

Experiments will be conducted in the Idaho National Laboratory (INL) Matched Index-of-Refraction (MIR) Flow Facility [1] to characterize the three-dimensional velocity and turbulence fields in a wire-wrapped rod bundle typically employed in liquid-metal cooled fast reactors and to provide benchmark data for computer code validation. Sodium cooled fast reactors are under consideration for use in the U.S. Department of Energy (DOE) Global Nuclear Energy Partnership (GNEP) program. The experiment model will be constructed of quartz components and the working fluid will be mineral oil. Accurate temperature control (to within 0.05 oC) matches the index-of-refraction of mineral oil with that of quartz and renders the model transparent to the wavelength of laser light employed for optical measurements. The model will be a scaled 7-pin rod bundle enclosed in a hexagonal canister. Flow field measurements will be obtained with a LaVision 3-D particle image velocimeter (PIV) and complimented by near-wall velocity measurements obtained from a 2-D laser Doppler velocimeter (LDV). These measurements will be used as benchmark data for computational fluid dynamics (CFD) validation. The rod bundle model dimensions will be scaled up from the typical dimensions of a fast reactor fuel assembly to provide the maximum Reynolds number achievable in the MIR flow loop. A range of flows from laminar to fully-turbulent will be available with a maximum Reynolds number, based on bundle hydraulic diameter, of approximately 22,000. The fuel pins will be simulated by 85 mm diameter quartz tubes (closed on the inlet ends) and the wire-wrap will be simulated by 25 mm diameter quartz rods. The canister walls will be constructed from quartz plates. The model will be approximately 2.13 m in length. Bundle pressure losses will also be measured and the data recorded for code comparisons. The experiment design and preliminary CFD calculations, which will be used to provide qualitative hydrodynamic

Football officials activities during matches: a comparison of activity of referees and linesmen in European, Premiership and Championship matches

OpenAIRE

Di Salvo, Valter; Carmont, Michael R; Maffulli, Nicola

2012-01-01

We compared the notational activity of 68 referees and 170 referee’s assistants or linesmen officiating European matches from UEFA and the Champions League together with matches from the English Premiership and the English Championship competitions during the 2005/2006 football season using a computerised video system. We studied 328 games (14 European matches, UEFA and Champions league, 202 matches from the English Premiership and 112 from the English Championship).

Fingerprint match-on-card: review and outlook

CSIR Research Space (South Africa)

Shabalala, MB

2015-03-01

Full Text Available the statistics on identity theft. This has been achieved by predominantly implementing biometrics matching algorithms inside smart card technology. The biometric matching inside a smart card is known as Match-on-Card/On-Card comparison. However compared...