Hierarchical model of matching
Pedrycz, Witold; Roventa, Eugene
1992-01-01
The issue of matching two fuzzy sets becomes an essential design aspect of many algorithms including fuzzy controllers, pattern classifiers, knowledge-based systems, etc. This paper introduces a new model of matching. Its principal features involve the following: (1) matching carried out with respect to the grades of membership of fuzzy sets as well as some functionals defined on them (like energy, entropy,transom); (2) concepts of hierarchies in the matching model leading to a straightforward distinction between 'local' and 'global' levels of matching; and (3) a distributed character of the model realized as a logic-based neural network.
Circular block matching based video stabilization
Xu, Lidong; Fu, Fangwen; Lin, Xinggang
2005-07-01
Video sequences captured by handheld digital camera need to be stabilized to eliminate the tiresome effects caused by camera"s undesirable shake or jiggle. The key issue of video stabilization is to estimate the global motion parameters between two successive frames. In this paper, a novel circular block matching algorithm is proposed to estimate the global motion parameters. This algorithm can deal with not only translational motion but even large rotational motion. For an appointed circular block in current frame, a four-dimensional rotation invariant feature vector is firstly extracted from it and used to judge if it is an effective block. Then the rotation invariant features based circular block matching process is performed to find the best matching blocks in reference frame for those effective blocks. With the matching results of any two effective blocks, a two-dimensional motion model is constructed to produce one group of frame motion parameters. A statistical method is proposed to calculate the estimated global motion parameters with all groups of global motion parameters. Finally, using the estimated motion parameters as the initial values, an iteration algorithm is introduced to obtain the refined global motion parameters. The experimental results show that the proposed algorithm is excellent in stabilizing frames with even burst global translational and rotational motions.
Impedance Matched Absorptive Thermal Blocking Filters
Wollack, E J; Rostem, K; U-Yen, K
2014-01-01
We have designed, fabricated and characterized absorptive thermal blocking filters for cryogenic microwave applications. The transmission line filter's input characteristic impedance is designed to match $50\\,\\Omega$ and its response has been validated from 0-to-50\\,GHz. The observed return loss in the 0-to-20\\,GHz design band is greater than $20\\,$dB and shows graceful degradation with frequency. Design considerations and equations are provided that enable this approach to be scaled and modified for use in other applications.
Hierarchical Template Matching for Robust Visual Tracking with Severe Occlusions
Institute of Scientific and Technical Information of China (English)
Lizuo Jin; Tirui Wu; Feng Liu; Gang Zeng
2012-01-01
To tackle the problem of severe occlusions in visual tracking, we propose a hierarchical template-matching method based on a layered appearance model. This model integrates holistic- and part-region matching in order to locate an object in a coarse-to-fine manner. Furthermore, in order to reduce ambiguity in object localization, only the discriminative parts of an object' s appearance template are chosen for similarity computing with respect to their cornerness measurements. The similarity between parts is computed in a layer-wise manner, and from this, occlusions can be evaluated. When the object is partly occluded, it can be located accurately by matching candidate regions with the appearance template. When it is completely occluded, its location can be predicted from its historical motion information using a Kalman filter. The proposed tracker is tested on several practical image sequences, and the experimental results show that it can consistently provide accurate object location for stable tracking, even for severe occlusions.
Hierarchical minutiae matching for fingerprint and palmprint identification.
Chen, Fanglin; Huang, Xiaolin; Zhou, Jie
2013-12-01
Fingerprints and palmprints are the most common authentic biometrics for personal identification, especially for forensic security. Previous research have been proposed to speed up the searching process in fingerprint and palmprint identification systems, such as those based on classification or indexing, in which the deterioration of identification accuracy is hard to avert. In this paper, a novel hierarchical minutiae matching algorithm for fingerprint and palmprint identification systems is proposed. This method decomposes the matching step into several stages and rejects many false fingerprints or palmprints on different stages, thus it can save much time while preserving a high identification rate. Experimental results show that the proposed algorithm can save almost 50% searching time compared with traditional methods and illustrate its effectiveness.
An Efficient Block Matching Algorithm Using Logical Image
Directory of Open Access Journals (Sweden)
Manisha Pal
2014-12-01
Full Text Available Motion estimation, which has been widely used in various image sequence coding schemes, plays a key role in the transmission and storage of video signals at reduced bit rates. There are two classes of motion estimation methods, Block matching algorithms (BMA and Pel-recursive algorithms (PRA. Due to its implementation simplicity, block matching algorithms have been widely adopted by various video coding standards such as CCITT H.261, ITU-T H.263, and MPEG. In BMA, the current image frame is partitioned into fixed-size rectangular blocks. The motion vector for each block is estimated by finding the best matching block of pixels within the search window in the previous frame according to matching criteria. The goal of this work is to find a fast method for motion estimation and motion segmentation using proposed model. Recent day Communication between ends is facilitated by the development in the area of wired and wireless networks. And it is a challenge to transmit large data file over limited bandwidth channel. Block matching algorithms are very useful in achieving the efficient and acceptable compression. Block matching algorithm defines the total computation cost and effective bit budget. To efficiently obtain motion estimation different approaches can be followed but above constraints should be kept in mind. This paper presents a novel method using three step and diamond algorithms with modified search pattern based on logical image for the block based motion estimation. It has been found that, the improved PSNR value obtained from proposed algorithm shows a better computation time (faster as compared to original Three step Search (3SS/TSS method .The experimental results based on the number of video sequences were presented to demonstrate the advantages of proposed motion estimation technique.
Motion estimation based on an improved block matching technique
Institute of Scientific and Technical Information of China (English)
Tangfei Tao; Chongzhao Han; Yanqi Wu; Xin Kang
2006-01-01
@@ An improved block-matching algorithm for fast motion estimation is proposed. The matching criterion is the sum of absolute difference. The basic idea is to obtain the best estimation of motion vectors by an optimization of the search process which can terminate the time-consuming computation of matching evaluation between the current block and the ineligible candidate block as early as possible and eliminate the search positions as many as possible in the search area. The performance of this algorithm is evaluated by theoretic analysis and compared with the full search algorithm (FSA). The simulation results demonstrate that the computation load of this algorithm is much less than that of FSA, and the motion vectors obtained by this algorithm are identical to those of FSA.
Support agnostic Bayesian matching pursuit for block sparse signals
Masood, Mudassir
2013-05-01
A fast matching pursuit method using a Bayesian approach is introduced for block-sparse signal recovery. This method performs Bayesian estimates of block-sparse signals even when the distribution of active blocks is non-Gaussian or unknown. It is agnostic to the distribution of active blocks in the signal and utilizes a priori statistics of additive noise and the sparsity rate of the signal, which are shown to be easily estimated from data and no user intervention is required. The method requires a priori knowledge of block partition and utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean square error (MMSE) estimate of the block-sparse signal. Simulation results demonstrate the power and robustness of our proposed estimator. © 2013 IEEE.
ADAPTIVE HIERARCHICAL DENSE MATCHING OF MULTI-VIEW AIRBORNE OBLIQUE IMAGERY
Directory of Open Access Journals (Sweden)
Z. C. Zhang
2015-03-01
Full Text Available Traditional single-lens vertical photogrammetry can obtain object images from the air with rare lateral information of tall buildings. Multi-view airborne photogrammetry can get rich lateral texture of buildings, while the common area-based matching for oblique images may lose efficacy because of serious geometric distortion. A hierarchical dense matching algorithm is put forward here to match two oblique airborne images of different perspectives. Based on image hierarchical strategy and matching constraints, this algorithm delivers matching results from the upper layer of the pyramid to the below and implements per-pixel dense matching in the local Delaunay triangles between the original images. Experimental results show that the algorithm can effectively overcome the geometric distortion between different perspectives and achieve pixel-level dense matching entirely based on the image space.
Seismic random noise attenuation via 3D block matching
Amani, Sajjad; Gholami, Ali; Javaheri Niestanak, Alireza
2017-01-01
The lack of signal to noise ratio increases the final errors of seismic interpretation. In the present study, we apply a new non-local transform domain method called "3 Dimensional Block Matching (3DBM)" for seismic random noise attenuation. Basically, 3DBM uses the similarities through the data for retrieving the amplitude of signal in a specific point in the f-x domain, and because of this, it is able to preserve discontinuities in the data such as fractures and faults. 3DBM considers each seismic profile as an image and thus it can be applied to both pre-stack and post-stack seismic data. It uses the block matching clustering method to gather similar blocks contained in 2D data into 3D groups in order to enhance the level of correlation in each 3D array. By applying a 2D transform and 1D transform (instead of a 3D transform) on each array, we can effectively attenuate the noise by shrinkage of the transform coefficients. The subsequent inverse 2D transform and inverse 1D transform yield estimates of all matched blocks. Finally, the random noise attenuated data is computed using the weighted average of all block estimates. We applied 3DBM on both synthetic and real pre-stack and post-stack seismic data and compared it with a Curvelet transform based denoising method which is one of the most powerful methods in this area. The results show that 3DBM method eventuates in higher signal to noise ratio, lower execution time and higher visual quality.
Luo, Dehai; Cha, Jing; Zhong, Linhao; Dai, Aiguo
2014-05-01
In this paper, a nonlinear multi-scale interaction (NMI) model is used to propose an eddy-blocking matching (EBM) mechanism to account for how synoptic eddies reinforce or suppress a blocking flow. It is shown that the spatial structure of the eddy vorticity forcing (EVF) arising from upstream synoptic eddies determines whether an incipient block can grow into a meandering blocking flow through its interaction with the transient synoptic eddies from the west. Under certain conditions, the EVF exhibits a low-frequency oscillation on timescales of 2-3 weeks. During the EVF phase with a negative-over- positive dipole structure, a blocking event can be resonantly excited through the transport of eddy energy into the incipient block by the EVF. As the EVF changes into an opposite phase, the blocking decays. The NMI model produces life cycles of blocking events that resemble observations. Moreover, it is shown that the eddy north-south straining is a response of the eddies to a dipole- or Ω-type block. In our model, as in observations, two synoptic anticyclones (cyclones) can attract and merge with one another as the blocking intensifies, but only when the feedback of the blocking on the eddies is included. Thus, we attribute the eddy straining and associated vortex interaction to the feedback of the intensified blocking on synoptic eddies. The results illustrate the concomitant nature of the eddy deformation, whose role as a PV source for the blocking flow becomes important only during the mature stage of a block. Our EBM mechanism suggests that an incipient block flow is amplified (or suppressed) under certain conditions by the EVF coming from the upstream of the blocking region.
Directory of Open Access Journals (Sweden)
Prof. Nar Singh
2016-05-01
Full Text Available In area of video compression, Motion Estimation is one of the most important modules and play an important role to design and implementation of any the video encoder. It consumes more than 85% of video encoding time due to searching of a candidate block in the search window of the reference frame. Various block matching methods have been developed to minimize the search time. In this context, Adaptive Rood Pattern Search is one of the less expensive block matching methods, which is widely acceptable for better Motion Estimation in video data processing. In this paper we have proposed to optimize the macro block size used in adaptive rood pattern search method for improvement in motion estimation.
Thinking beyond the block: block matching for copy-move forgery detection revisited
Kirchner, Matthias; Schöttle, Pascal; Riess, Christian
2015-03-01
Detection of copy{move forgeries is one of the most actively researched topics in image forensics. It has been shown that so-called block-based methods give the highest pixel-wise accuracy for detecting copy{move forgeries. However, matching of block-based features can be computationally extremely demanding. Hence, the current predominant line of thought is that block-based algorithms are too slow to be applicable in practice. In this paper, we revisit the matching stage of block-based copy{move forgery detection methods. We propose an efficient approach for finding duplicate patterns of a given size in integer-valued input data. By design, we focus on the spatial relation of potentially duplicated elements. This allows us to locate copy{move forgeries via bit-wise operations, without expensive block comparisons in the feature space. Experimental investigation of different matching strategies shows that the proposed method has its benefits. However, on a broader scale, our experiments demonstrate that the performance of matching by lexicographic sorting might have been underestimated in previous work, despite its remarkable speed benefit on large images. In fact, in a practical setting, where accuracy and computational efficiency have to be balanced, lexicographic sorting may be considered the method of choice.
Hierarchical Approximate Matching for Retrieval of Chinese Historical Calligraphy Character
Institute of Scientific and Technical Information of China (English)
Xia-Fen Zhang; Yue-Ting Zhuang; Jiang-Qin Wu; Fei Wu
2007-01-01
As historical Chinese calligraphy works are being digitized, the problem of retrieval becomes a new challenge. But, currently no OCR technique can convert calligraphy character images into text, nor can the existing Handwriting Character Recognition approach does not work for it. This paper proposes a novel approach to efficiently retrieving Chinese calligraphy characters on the basis of similarity: calligraphy character image is represented by a collection of discriminative features, and high retrieval speed with reasonable effectiveness is achieved. First, calligraphy characters that have no possibility similar to the query are filtered out step by step by comparing the character complexity, stroke density and stroke protrusion. Then, similar calligraphy characters are retrieved and ranked according to their matching cost produced by approximate shape match. In order to speed up the retrieval, we employed high dimensional data structure-PK-tree. Finally, the efficiency of the algorithm is demonstrated by a preliminary experiment with 3012 calligraphy character images.
Hierarchical partial matching and segmentation of interacting cells.
Wu, Zheng; Gurari, Danna; Wong, Joyce Y; Betke, Margrit
2012-01-01
We propose a method that automatically tracks and segments living cells in phase-contrast image sequences, especially for cells that deform and interact with each other or clutter. We formulate the problem as a many-to-one elastic partial matching problem between closed curves. We introduce Double Cyclic Dynamic Time Warping for the scenario where a collision event yields a single boundary that encloses multiple touching cells and that needs to be cut into separate cell boundaries. The resulting individual boundaries may consist of segments to be connected to produce closed curves that match well with the individual cell boundaries before the collision event. We show how to convert this partial-curve matching problem into a shortest path problem that we then solve efficiently by reusing the computed shortest path tree. We also use our shortest path algorithm to fill the gaps between the segments of the target curves. Quantitative results demonstrate the benefit of our method by showing maintained accurate recognition of individual cell boundaries across 8068 images containing multiple cell interactions.
Hierarchical Matching and Regression with Application to Photometric Redshift Estimation
Murtagh, Fionn
2017-06-01
This work emphasizes that heterogeneity, diversity, discontinuity, and discreteness in data is to be exploited in classification and regression problems. A global a priori model may not be desirable. For data analytics in cosmology, this is motivated by the variety of cosmological objects such as elliptical, spiral, active, and merging galaxies at a wide range of redshifts. Our aim is matching and similarity-based analytics that takes account of discrete relationships in the data. The information structure of the data is represented by a hierarchy or tree where the branch structure, rather than just the proximity, is important. The representation is related to p-adic number theory. The clustering or binning of the data values, related to the precision of the measurements, has a central role in this methodology. If used for regression, our approach is a method of cluster-wise regression, generalizing nearest neighbour regression. Both to exemplify this analytics approach, and to demonstrate computational benefits, we address the well-known photometric redshift or `photo-z' problem, seeking to match Sloan Digital Sky Survey (SDSS) spectroscopic and photometric redshifts.
Hierarchical structure formation in supramolecular comb-shaped block copolymers
Hofman, Anton; ten Brinke, Gerrit; Loos, Katja
2016-01-01
Block copolymers are known to spontaneously form ordered structures at the nano-to mesoscale. Although the number of different morphologies is rather limited in diblock copolymer systems, their phase behavior becomes increasingly more complex with each additional building block. Synthesis of such al
Hierarchical supramolecules and organization using boronic acid building blocks.
Kubo, Yuji; Nishiyabu, Ryuhei; James, Tony D
2015-02-07
Current progress on hierarchical supramolecules using boronic acids has been highlighted in this feature article. Boronic acids can participate in "click reactions" with diols and their congeners with dynamic covalent functionality. By comprehensively exploring versatile sequential boronate esterification linkages between plural boronic acid-appended molecules and multiple hydroxyl counterparts, not only versatile supramolecular polymers but also structurally well-defined network nanostructures have been developed. In addition orthogonal interactions such as dative bonds of the boron center with Lewis bases have led to the formation of hierarchical nano/microstructures. Boronate systems have the potential to be used as materials for smart gels, chemosensors, active architectures for electronics, heterogeneous catalysts, chemical-stimulus responsive systems for drug delivery, etc. Here, we fully discuss the feasibility of the structure-directing ability of boronic acids from the standpoint of the generation of new smart materials.
Energy Technology Data Exchange (ETDEWEB)
Gorentla Venkata, Manjunath [ORNL; Shamis, Pavel [ORNL; Graham, Richard L [ORNL; Ladd, Joshua S [ORNL; Sampath, Rahul S [ORNL
2013-01-01
Many scientific simulations, using the Message Passing Interface (MPI) programming model, are sensitive to the performance and scalability of reduction collective operations such as MPI Allreduce and MPI Reduce. These operations are the most widely used abstractions to perform mathematical operations over all processes that are part of the simulation. In this work, we propose a hierarchical design to implement the reduction operations on multicore systems. This design aims to improve the efficiency of reductions by 1) tailoring the algorithms and customizing the implementations for various communication mechanisms in the system 2) providing the ability to configure the depth of hierarchy to match the system architecture, and 3) providing the ability to independently progress each of this hierarchy. Using this design, we implement MPI Allreduce and MPI Reduce operations (and its nonblocking variants MPI Iallreduce and MPI Ireduce) for all message sizes, and evaluate on multiple architectures including InfiniBand and Cray XT5. We leverage and enhance our existing infrastructure, Cheetah, which is a framework for implementing hierarchical collective operations to implement these reductions. The experimental results show that the Cheetah reduction operations outperform the production-grade MPI implementations such as Open MPI default, Cray MPI, and MVAPICH2, demonstrating its efficiency, flexibility and portability. On Infini- Band systems, with a microbenchmark, a 512-process Cheetah nonblocking Allreduce and Reduce achieves a speedup of 23x and 10x, respectively, compared to the default Open MPI reductions. The blocking variants of the reduction operations also show similar performance benefits. A 512-process nonblocking Cheetah Allreduce achieves a speedup of 3x, compared to the default MVAPICH2 Allreduce implementation. On a Cray XT5 system, a 6144-process Cheetah Allreduce outperforms the Cray MPI by 145%. The evaluation with an application kernel, Conjugate
Identifying rock blocks based on hierarchical rock-mass structure model
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
Rock-masses are divided into many closed blocks by deterministic and stochastic discontinuities and engineering interfaces in complex rock-mass engineering. Determining the sizes, shapes, and adjacent relations of blocks is important for stability analysis of fractured rock masses. Here we propose an algorithm for identifying spatial blocks based on a hierarchical 3D Rock-mass Structure Model (RSM). First, a model is built composed of deterministic discontinuities, engineering interfaces, and the earth’s surface, and the deterministic blocks surrounded by these interfaces are traced. Then, in each deter-ministic block, a network model of stochastic discontinuities is built and the stochastic blocks are traced. Building a unitary wire frame that connects all interfaces seamlessly is the key for our algorithm to identify the above two kinds of blocks. Using this algorithm, geometric models can be built for block theory, discrete element method, and discontinuous deformation analysis.
Yu, H.
2016-09-14
Membranes with a hierarchical porous structure could be manufactured from a block copolymer blend by pure solvent evaporation. Uniform pores in a 30 nm thin skin layer supported by a macroporous structure were formed. This new process is attractive for membrane production because of its simplicity and the lack of liquid waste.
Dettmer, Jan; Dosso, Stan E
2012-10-01
This paper develops a trans-dimensional approach to matched-field geoacoustic inversion, including interacting Markov chains to improve efficiency and an autoregressive model to account for correlated errors. The trans-dimensional approach and hierarchical seabed model allows inversion without assuming any particular parametrization by relaxing model specification to a range of plausible seabed models (e.g., in this case, the number of sediment layers is an unknown parameter). Data errors are addressed by sampling statistical error-distribution parameters, including correlated errors (covariance), by applying a hierarchical autoregressive error model. The well-known difficulty of low acceptance rates for trans-dimensional jumps is addressed with interacting Markov chains, resulting in a substantial increase in efficiency. The trans-dimensional seabed model and the hierarchical error model relax the degree of prior assumptions required in the inversion, resulting in substantially improved (more realistic) uncertainty estimates and a more automated algorithm. In particular, the approach gives seabed parameter uncertainty estimates that account for uncertainty due to prior model choice (layering and data error statistics). The approach is applied to data measured on a vertical array in the Mediterranean Sea.
Yao, Li; Watkins, James
2013-03-01
Segregation strength in hybrid materials can be increased through selective hydrogen bonding between organic or nanoparticle additives and one block of weakly segregated block copolymers to generate well ordered hybrid materials. Here, we report the use of enantiopure tartaric acid as the additive to dramatically improve ordering in poly(ethylene oxide-block-tert-butyl acrylate) (PEO-b-PtBA) copolymers. Phase behavior and morphologies within both bulk and thin films were studied by TEM, AFM and X-ray scattering. Suppression of PEO crystallization by the interaction between tartaric acid and the PEO block enables the formation of well ordered smooth thin films. With the addition of a photo acid generator, photo-induced disorder in PEO-b-PtBA/tartaric acid composite system can be achieved upon UV exposure to deprotect PtBA block to yield poly(acrylic acid) (PAA), which is phase-miscible with PEO. Due to the strong interaction of tartaric acid with both blocks, the system undergoes a disordering transition within seconds during a post-exposure baking. With the assistance of trace-amounts of base quencher, high resolution, hierarchical patterns of sub-micron regions of ordered and disordered domains were achieved in thin films through area-selective UV exposure using a photo-mask. Funding from Center for Hierarchical Manufacturing (CHM); Facility support from Materials Research Science and Engineering Center at UMass Amherst and Cornell High Energy Synchrotron Source
The Statistical Power of the Cluster Randomized Block Design with Matched Pairs--A Simulation Study
Dong, Nianbo; Lipsey, Mark
2010-01-01
This study uses simulation techniques to examine the statistical power of the group- randomized design and the matched-pair (MP) randomized block design under various parameter combinations. Both nearest neighbor matching and random matching are used for the MP design. The power of each design for any parameter combination was calculated from…
Recovery of Block-Sparse Representations from Noisy Observations via Orthogonal Matching Pursuit
Fang, Jun
2011-01-01
We study the problem of recovering the sparsity pattern of block-sparse signals from noise-corrupted measurements. A simple, efficient recovery method, namely, a block-version of the orthogonal matching pursuit (OMP) method, is considered in this paper and its behavior for recovering the block-sparsity pattern is analyzed. We provide sufficient conditions under which the block-version of the OMP can successfully recover the block-sparse representations in the presence of noise. Our analysis reveals that exploiting block-sparsity can improve the recovery ability and lead to a guaranteed recovery for a higher sparsity level. Numerical results are presented to corroborate our theoretical claim.
Method of airborne SAR image match integrating multi-information for block adjustment
Yang, S. C.; Huang, G. M.; Zhao, Z.; Lu, L. J.
2015-06-01
For the automation of SAR image Block Adjustment, this paper proposed a method of SAR image matching integrating multiinformation. It takes full advantage of SAR image geometric information, feature information, gray-related information and external auxiliary terrain information for SAR image matching. And then Image Tie Points (ITPs) of Block Adjustment can be achieved automatically. The main parts of extracting ITPs automatically include: First, SAR images were rectified geometrically based on the geometric information and external auxiliary terrain information (existed DEM) before match. Second, ground grid points with a certain interval can be get in the block area and approximate ITPs were acquired based on external auxiliary terrain information. Then match reference point was extracted for homologous image blocks with Harris feature detection operator and ITPs were obtained with pyramid matching based on gray-related information. At last, ITPs were transferred from rectified images to original SAR images and used in block adjustment. In the experiment, X band airborne SAR images acquired by Chinese airborne SAR system - CASMSAR system were used to make up the block. The result had showed that the method is effective for block adjustment of SAR data.
Simplified Block Matching Algorithm for Fast Motion Estimation in Video Compression
Directory of Open Access Journals (Sweden)
M. Ezhilarasan
2008-01-01
Full Text Available Block matching motion estimation was one of the most important modules in the design of any video encoder. It consumed more than 85% of video encoding time due to searching of a candidate block in the search window of the reference frame. To minimize the search time on block matching, a simplified and efficient Block Matching Algorithm for Fast Motion Estimation was proposed. It had two steps such as prediction and refinement. The temporal correlation among successive frames and the direction of the previously processed frame for predicting the motion vector of the candidate block was considered during prediction step. Different combination of search points was considered in the refinement step of the algorithm which subsequently minimize the search time. Experiments were conducted on various SIF and CIF video sequences. The performance of the algorithm was compared with existing fast block matching motion estimation algorithms which were used in recent video coding standards. The experimental results were shown that the algorithm provided a faster search with minimum distortion when compared to the optimal fast block matching motion estimation algorithms.
Energy Technology Data Exchange (ETDEWEB)
Hirai, Tomoyasu; Leolukman, Melvina; Jin, Sangwoo; Goseki, Raita; Ishida, Yoshihito; Kakimoto, Masa-aki; Hayakawa, Teruaki; Ree, Moonhor; Gopalan, Padma; (Tokyo Inst. Tech.); (UW); (POSTECH)
2010-03-16
Two kinds of polyhedral oligomeric silsesquioxane (POSS)-containing block copolymers (BCPs), namely PS-b-PMAPOSS and PMMA-b-PMAPOSS, were synthesized by living anionic polymerization. A wide range of molecular weights were obtained with a very narrow polydispersity index of less than 1.09. The bulk samples prepared by slow evaporation from a polymer solution in chloroform exhibit well-defined microphase-separated structures with long-range order. Thermal annealing induced hierarchical structures consisting of a smaller length scale ordered crystalline POSS domains within the larger microphase-separated structures. We report detailed structural characterization of these hierarchical structures in bulk and thin films by transmission electron microscopy and grazing incidence wide-angle X-ray scattering (GIWAXS). On the basis of this structural analysis, we propose a model for the formation of an orthorhombic lattice structure through the aggregation of POSS segments which formed a helix-like structure.
Hierarchical self-assembly of spider silk-like block copolymers
Krishnaji, Sreevidhya; Huang, Wenwen; Cebe, Peggy; Kaplan, David
2011-03-01
Block copolymers provide an attractive venue to study well-defined nano-structures that self-assemble to generate functionalized nano- and mesoporous materials. In the present study, a novel family of spider silk-like block copolymers was designed, bioengineered and characterized to study the impact of sequence chemistry, secondary structure and block length on assembled morphology. Genetic variants of native spider dragline silk (major ampullate spidroin I, Nephila clavipes) were used as polymer building blocks. Characterization by FTIR revealed increased ?-sheet content with increasing hydrophobic A blocks; SEM revealed spheres, rod-like structures, bowl-shaped and giant compound micelles. Langmuir Blodgett monolayers were prepared at the air-water interface at different surface pressures and monolayer films analyzed by AFM revealed oblate to prolate structures. Circular micelles, rod-like, densely packed circular structures were observed for HBA6 at increasing surface pressure. Exploiting hierarchical assembly provide a promising approach to rationale designs of protein block copolymer systems, allowing comparison to traditional synthetic systems.
Hierarchical rule-based monitoring and fuzzy logic control for neuromuscular block.
Shieh, J S; Fan, S Z; Chang, L W; Liu, C C
2000-01-01
The important task for anaesthetists is to provide an adequate degree of neuromuscular block during surgical operations, so that it should not be difficult to antagonize at the end of surgery. Therefore, this study examined the application of a simple technique (i.e., fuzzy logic) to an almost ideal muscle relaxant (i.e., rocuronium) at general anaesthesia in order to control the system more easily, efficiently, intelligently and safely during an operation. The characteristics of neuromuscular blockade induced by rocuronium were studied in 10 ASA I or II adult patients anaesthetized with inhalational (i.e., isoflurane) anaesthesia. A Datex Relaxograph was used to monitor neuromuscular block. And, ulnar nerve was stimulated supramaximally with repeated train-of-four via surface electrodes at the wrist. Initially a notebook personal computer was linked to a Datex Relaxograph to monitor electromyogram (EMG) signals which had been pruned by a three-level hierarchical structure of filters in order to design a controller for administering muscle relaxants. Furthermore, a four-level hierarchical fuzzy logic controller using the fuzzy logic and rule of thumb concept has been incorporated into the system. The Student's test was used to compare the variance between the groups. p control of muscle relaxation with a mean T1% error of -0.19 (SD 0.66) % accommodating a range in mean infusion rate (MIR) of 0.21-0.49 mg x kg(-1) x h(-1). When these results were compared with our previous ones using the same hierarchical structure applied to mivacurium, less variation in the T1% error (p controller activity of these two drugs showed no significant difference (p > 0.5). However, the consistent medium coefficient variance (CV) of the MIR of both rocuronium (i.e., 36.13 (SD 9.35) %) and mivacurium (i.e., 34.03 (SD 10.76) %) indicated a good controller activity. The results showed that a hierarchical rule-based monitoring and fuzzy logic control architecture can provide stable control
Reduction of snapshots for MIMO radar detection by block/group orthogonal matching pursuit
Ali, Hussain El Hosiny
2014-10-01
Multiple-input multiple-output (MIMO) radar works on the principle of transmission of independent waveforms at each element of its antenna array and is widely used for surveillance purposes. In this work, we investigate MIMO radar target localization problem with compressive sensing. Specifically, we try to solve the problem of estimation of target location in MIMO radar by group and block sparsity algorithms. It will lead us to a reduced number of snapshots required and also we can achieve better radar resolution. We will use group orthogonal matching pursuit (GOMP) and block orthogonal matching pursuit (BOMP) for our problem. © 2014 IEEE.
Directory of Open Access Journals (Sweden)
Nsiri Benayad
2010-01-01
Full Text Available This article investigates a new method of motion estimation based on block matching criterion through the modeling of image blocks by a mixture of two and three Gaussian distributions. Mixture parameters (weights, means vectors, and covariance matrices are estimated by the Expectation Maximization algorithm (EM which maximizes the log-likelihood criterion. The similarity between a block in the current image and the more resembling one in a search window on the reference image is measured by the minimization of Extended Mahalanobis distance between the clusters of mixture. Performed experiments on sequences of real images have given good results, and PSNR reached 3 dB.
Ruotsalainen, Teemu; Turku, Jani; Hiekkataipale, Panu; Vainio, Ulla; Serimaa, Ritva; Brinke, Gerrit ten; Harlin, Ali; Ruokolainen, Janne; Ikkala, Olli
2007-01-01
Previously we demonstrated hierarchical self- assembly and mesoporosity in electrospun fibers using selected polystyrene- block- poly(4- vinylpyridine) (PS- b- P4VP) diblock copolymers with hydrogen- bonded 3- n- pentadecylphenol (PDP), which rendered distorted spherical P4VP(PDP)(1.0) domains
Video Image Block-matching Motion Estimation Algorithm Based on Two-step Search
Institute of Scientific and Technical Information of China (English)
Wei-qi JIN; Yan CHEN; Ling-xue WANG; Bin LIU; Chong-liang LIU; Ya-zhong SHEN; Gui-qing ZHANG
2010-01-01
Aiming at the shortcoming that certain existing blocking-matching algorithms, such as full search, three-step search, and diamond search algorithms, usually can not keep a good balance between high accuracy and low computational complexity, a block-matching motion estimation algorithm based on two-step search is proposed in this paper. According to the fact that the gray values of adjacent pixels will not vary fast, the algorithm employs an interlaced search pattern in the search window to estimate the motion vector of the object-block. Simulation and actual experiments demonstrate that the proposed algorithm greatly outperforms the well-known three-step search and diamond search algorithms, no matter the motion vector is large or small. Compared with the full search algorithm, the proposed one achieves similar performance but requires much less computation, therefore, the algorithm is well qualified for real-time video image processing.
DEFF Research Database (Denmark)
Ayoubi, Mehran Asad; Zhu, Kaizheng; Nyström, Bo
2013-01-01
show simultaneous microphase (between Linear and AmphComb blocks) and nanophase (within the AmphComb blocks) separations. This leads to the formation of various structure-in-structure two-scale hierarchical self-assemblies, including S-in-SLL, S-in-SBCC, S-in-C, S-in-L and C-in-L, where S, SLL, SBCC, C...... block), a class of ionic supramolecules are successfully synthesized whose molecular architecture consists of a poly(styrene) PS block (Linear block) covalently connected to a strongly amphiphilic comb-like block (AmphComb block), i.e. Linear-b-AmphComb. In the melt state, these ionic supramolecules can...... and L stand for spherical, spherical in liquid-like state, spherical in body-centered-cubic arrangement, cylindrical and lamellar, respectively. Synchrotron small angle X-ray scattering (SAXS) and crossed polarizers, together with SAXS modelling analysis, were used for a detailed structural study...
Directory of Open Access Journals (Sweden)
Alireza Safdarinezhad
2016-06-01
Full Text Available The automatic registration of LiDAR data and optical images, which are heterogeneous data sources, has been a major research challenge in recent years. In this paper, a novel hierarchical method is proposed in which the least amount of interaction of a skilled operator is required. Thereby, two shadow extraction schemes, one from LiDAR and the other from high-resolution satellite images, were used, and the obtained 2D shadow maps were then considered as prospective matching entities. Taken as the base, the reconstructed LiDAR shadows were transformed to image shadows using a four-step hierarchical method starting from a coarse 2D registration model and leading to a fine 3D registration model. In the first step, a general matching was performed in the frequency domain that yielded a rough 2D similarity model that related the LiDAR and image shadow masks. This model was further improved by modeling and compensating for the local geometric distortions that existed between the two heterogeneous data sources. In the third step, shadow masks, which were organized as segmented matched patches, were the subjects of a coinciding procedure that resulted in a coarse 3D registration model. In the last hierarchical step, that model was ultimately reinforced via a precise matching between the LiDAR and image edges. The evaluation results, which were conducted on six datasets and from different relative and absolute aspects, demonstrated the efficiency of the proposed method, which had a very promising accuracy on the order of one pixel.
A fast block-matching algorithm based on variable shape search
Institute of Scientific and Technical Information of China (English)
LIU Hao; ZHANG Wen-jun; CAI Jun
2006-01-01
Block-matching motion estimation plays an important role in video coding. The simple and efficient fast block-matching algorithm using Variable Shape Search (VSS) proposed in this paper is based on diamond search and hexagon search. The initial big diamond search is designed to fit the directional centre-biased characteristics of the real-world video sequence, and the directional hexagon search is designed to identify a small region where the best motion vector is expected to locate.Finally, the small diamond search is used to select the best motion vector in the located small region. Experimental results showed that the proposed VSS algorithm can significantly reduce the computational complexity, and provide competitive computational speedup with similar distortion performance as compared with the popular Diamond-based Search (DS) algorithm in the MPEG-4 Simple Profile.
Directory of Open Access Journals (Sweden)
Sheng Bi
2016-03-01
Full Text Available Compressive sensing (CS theory has opened up new paths for the development of signal processing applications. Based on this theory, a novel single pixel camera architecture has been introduced to overcome the current limitations and challenges of traditional focal plane arrays. However, video quality based on this method is limited by existing acquisition and recovery methods, and the method also suffers from being time-consuming. In this paper, a multi-frame motion estimation algorithm is proposed in CS video to enhance the video quality. The proposed algorithm uses multiple frames to implement motion estimation. Experimental results show that using multi-frame motion estimation can improve the quality of recovered videos. To further reduce the motion estimation time, a block match algorithm is used to process motion estimation. Experiments demonstrate that using the block match algorithm can reduce motion estimation time by 30%.
GPU-accelerated Block Matching Algorithm for Deformable Registration of Lung CT Images.
Li, Min; Xiang, Zhikang; Xiao, Liang; Castillo, Edward; Castillo, Richard; Guerrero, Thomas
2015-12-01
Deformable registration (DR) is a key technology in the medical field. However, many of the existing DR methods are time-consuming and the registration accuracy needs to be improved, which prevents their clinical applications. In this study, we propose a parallel block matching algorithm for lung CT image registration, in which the sum of squared difference metric is modified as the cost function and the moving least squares approach is used to generate the full displacement field. The algorithm is implemented on Graphic Processing Unit (GPU) with the Compute Unified Device Architecture (CUDA). Results show that the proposed parallel block matching method achieves a fast runtime while maintaining an average registration error (standard deviation) of 1.08 (0.69) mm.
Švanda, Jan; Siegel, Jakub; Švorčík, Vaclav; Lyutakov, Oleksiy
2016-05-01
We report fabrication of the varied range of hierarchical structures by combining bottom-up self-assembly of block copolymer poly(styrene-block-vinylpyridine) (PS-b-P4VP) with top-down excimer laser patterning method. Different procedures were tested, where laser treatment was applied before phase separation and after phase separation or phase separation and surface reconstruction. Laser treatment was performed using either polarized laser light with the aim to create periodical pattern on polymer surface or non-polarized light for preferential removing of polystyrene (PS) part from PS-b-P4VP. Additionally, dye was introduced into one part of block copolymer (P4VP) with the aim to modify its response to laser light. Resulting structures were analyzed by XPS, UV-vis and AFM techniques. Application of polarized laser light leads to creation of structures with hierarchical, recessed or hybrid geometries. Non-polarized laser beam allows pronouncing the block copolymer phase separated structure. Tuning the order of steps or individual step conditions enables the efficient reorientation of block-copolymer domain at large scale, fabrication of hierarchical, hybrid or recessed structures. The obtained structures can find potential applications in nanotechnology, photonics, plasmonics, information storage, optical devices, sensors and smart surfaces.
An improved implementation of block matching for motion estimation in ultrasound imaging
Cardoso, Fernando M.; Furuie, Sergio S.
2017-03-01
Ultrasound elastography has become an important procedure that provides information about the tissue dynamics and may help on the detection of tissue abnormalities. Therefore, motion estimation in a sequence of ultrasound acquisition is crucial to the quality of this information. We propose a novel algorithm to perform speckle tracking, which consists in an implementation of 2D Block Matching with two enhancements: sub-pixel linear interpolation and displacement propagation, which are able to increase resolution, reduce computation time and prevent kernel mismatching errors. This method does not require any additional hardware and provide real-time information. The proposed technique was evaluated using four different numerical phantoms and its results were compared with the results from standard 2D block matching and optical flow. The proposed method outperformed the other two methods, providing an average error of 0.98 pixels, while standard 2D block matching and optical flow presented an average error of 2.50 and 10.03 pixels, respectively. The proposed algorithm was also assessed with four different physical phantoms and a qualitative comparison showed that the proposed technique presented results that were compatible to the results from the built-in elastography mode of the ultrasound equipment (Ultrasonix Touch).
A Sub-block Based Image Retrieval Using Modified Integrated Region Matching
Directory of Open Access Journals (Sweden)
E R Vimina
2013-01-01
Full Text Available This paper proposes a content based image retrieval (CBIR system using the local colour and texture features of selected image sub-blocks and global colour and shape features of the image. The image sub-blocks are roughly identified by segmenting the image into partitions of different configuration, finding the edge density in each partition using edge thresholding followed by morphological dilation. The colour and texture features of the identified regions are computed from the histograms of the quantized HSV colour space and Gray Level Co- occurrence Matrix (GLCM respectively. The colour and texture feature vectors is computed for each region. The shape features are computed from the Edge Histogram Descriptor (EHD. A modified Integrated Region Matching (IRM algorithm is used for finding the minimum distance between the sub-blocks of the query and target image. Experimental results show that the proposed method provides better retrieving result than retrieval using some of the existing methods.
A block matching-based registration algorithm for localization of locally advanced lung tumors
Robertson, Scott P.; Weiss, Elisabeth; Hugo, Geoffrey D.
2014-01-01
Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm3), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%; p < 0.001). Left
Directory of Open Access Journals (Sweden)
D.V.MANJUNATHA
2011-10-01
Full Text Available In Digital video communication it is not practical, to store the full digital video without processing, because of the problems encountered in storage and transmission, so the processing technique called videocompression is essential. In video compression, one of the computationally expensive and resource hungry key element is the Motion Estimation. The Motion estimation is a process which determines the motion between two or more frames of video. In this paper, Four block matching motion estimation algorithms, namely Exhaustive Search (ES, Three Step Search (TSS, New Three Step Search (NTSS, and Diamond Search (DS algorithms are compared and implemented for different distances between the frames of the video by exploiting the temporal correlation between successive frames of mristack and foreman slow motion videos and proved that Diamond Search (DS algorithm is the best matching motion estimation algorithm that achieve best tradeoff between search speed (number of computations and reconstructed picture quality with extensive simulation results and comparative analysis.
Hierarchical adaptive stereo matching algorithm for obstacle detection with dynamic programming
Institute of Scientific and Technical Information of China (English)
Ming BAI; Yan ZHUANG; Wei WANG
2009-01-01
An adaptive weighted stereo matching algorithm with multilevel and bidirectional dynamic programming based on ground control points(GCPs) is presented.To decrease time complexity without losing matching precision,using a multilevel search scheme,the coarse matching is processed in typical disparity space image,while the fine matching is processed in disparity-offset space image.In the upper level,GCPs are obtained by enhanced volumetric iterative algorithm enforcing the mutual constraint and the threshold constraint.Under the supervision of the highly reliable GCPs,bidirec-tional dynamic programming framework is employed to solve the inconsistency in the optimization path.In the lower level,to reduce running time,disparity-offset space is proposed to efficiently achieve the dense disparity image.In addition,an adaptive dual support-weight strategy is presented to aggregate matching cost,which considers photometric and geomet-ric information.Further,post-processing algorithm can ameliorate disparity results in areas with depth discontinuities and related by occlusions using dual threshold algorithm,where missing stereo information is substituted from surrounding re-gions.To demonstrate the effectiveness of the algorithm,we present the two groups of experimental results for four widely used standard stereo data sets,including discussion on performance and comparison with other methods,which show that the algorithm has not only a fast speed,but also significantly improves the efficiency of holistic optimization.
Institute of Scientific and Technical Information of China (English)
马嵩华; 田凌
2014-01-01
A hierarchical scheme of feature-based model similarity measurement was proposed, named CSG_D2, in which both geometry similarity and topology similarity were applied. The features of 3D mechanical part were constructed by a series of primitive features with tree structure, as a form of constructive solid geometry (CSG) tree. The D2 shape distributions of these features were extracted for geometry similarity measurement, and the pose vector and non-disappeared proportion of each leaf node were gained for topology similarity measurement. Based on these, the dissimilarity between the query and the candidate was accessed by level-by-level CSG tree comparisons. With the adjustable weights, our scheme satisfies different comparison emphasis on the geometry or topology similarity. The assessment results from CSG_D2 demonstrate more discriminative than those from D2 in the analysis of precision-recall and similarity matrix. Finally, an experimental search engine is applied for mechanical parts reuse by using CSG_D2, which is convenient for the mechanical design process.
Congestion analysis of pilgrims in Hajj and Umrah congregation using block matching and optical flow
Farooq, Sumaiyya; Khan, Shoab A.; Usman Akram, M.
2017-01-01
A novel method has been proposed to classify the motion of pilgrims with respect to congestion level in the holy mosque of Makkah. Millions of Muslims visit this mosque during Hajj and Umrah every year. A large number of security personnel is required to maintain the smooth flow of pilgrims in order to avert any catastrophe. Therefore, it is inevitable to design a computer aided system to reduce human effort. The proposed system pre-processes input images to segregate the moving shadows and pilgrims in order to nullify the false motion due to moving shadows. A hybrid method consisting of block matching and optical flow techniques has been used for the computation of motion vectors. Decision tree classifier is used on the number of motion vectors having non-zero magnitude. Experiments show that the proposed system has promising results yielding an accuracy of 90.58% for the congestion classification of pilgrims.
A Fast Block-Matching Algorithm Using Smooth Motion Vector Field Adaptive Search Technique
Institute of Scientific and Technical Information of China (English)
LI Bo(李波); LI Wei(李炜); TU YaMing(涂亚明)
2003-01-01
In many video standards based on inter-frame compression such as H.26x and MPEG, block-matching algorithm has been widely adopted as the method for motion estimation because of its simplicity and effectiveness. Nevertheless, since motion estimation is very complex in computing. Fast algorithm for motion estimation has always been an important and attractive topic in video compression. From the viewpoint of making motion vector field smoother, this paper proposes a new algorithm SMVFAST. On the basis of motion correlation, it predicts the starting point by neighboring motion vectors according to their SADs. Adaptive search modes are usedin its search process through simply classifying motion activity. After discovering the ubiquitous ratio between the SADs of the collocated blocks in the consecutive frames, the paper proposes an effective half-stop criterion that can quickly stop the search process with good enough results.Experiments show that SMVFAST obtains almost the same results as the full search at very low computation cost, and outperforms MVFAST and PMVFAST in speed and quality, which are adopted by MPEG-4.
Fast and robust 3D ultrasound registration--block and game theoretic matching.
Banerjee, Jyotirmoy; Klink, Camiel; Peters, Edward D; Niessen, Wiro J; Moelker, Adriaan; van Walsum, Theo
2015-02-01
Real-time 3D US has potential for image guidance in minimally invasive liver interventions. However, motion caused by patient breathing makes it hard to visualize a localized area, and to maintain alignment with pre-operative information. In this work we develop a fast affine registration framework to compensate in real-time for liver motion/displacement due to breathing. The affine registration of two consecutive ultrasound volumes in time is performed using block-matching. For a set of evenly distributed points in one volume and their correspondences in the other volume, we propose a robust outlier rejection method to reject false matches. The inliers are then used to determine the affine transformation. The approach is evaluated on 13 4D ultrasound sequences acquired from 8 subjects. For 91 pairs of 3D ultrasound volumes selected from these sequences, a mean registration error of 1.8mm is achieved. A graphics processing unit (GPU) implementation runs the 3D US registration at 8 Hz.
Hahn, Uwe; Hirst, Andrew R; Delgado, Juan Luis; Kaeser, Adrien; Delavaux-Nicot, Béatrice; Nierengarten, Jean-Francois; Smith, David K
2007-12-14
Mixtures of an appropriate carboxylic acid and n-butylstannoic acid constitute modular gelation systems, in which the formation of a well-defined 'tin-drum' nanocluster subsequently underpins the hierarchical assembly of nanostructured fibres, which form self-supporting gel-phase networks in organic solvents.
A novel 300 kW arc plasma inverter system based on hierarchical controlled building block structure
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
To date, the high power arc plasma technology is widely used. A next generation high power arc plasma system based on building block structure is presented. The whole arc plasma inverter system is composed of 12 paralleled units to increase the system output capability. The hierarchical control system is adopted to improve the reliability and flexibility of the high power arc plasma inverter. To ensure the reliable turn on and off of the IGBT module in each building block unit, a special pulse drive circuit is designed by using pulse transformer. The experimental result indicates that the high power arc plasma inverter system can transfer 300 kW arc plasma energy reliably with high efficiency.
Space-Frequency Block Code with Matched Rotation for MIMO-OFDM System with Limited Feedback
Directory of Open Access Journals (Sweden)
Thushara D. Abhayapala
2009-01-01
Full Text Available This paper presents a novel matched rotation precoding (MRP scheme to design a rate one space-frequency block code (SFBC and a multirate SFBC for MIMO-OFDM systems with limited feedback. The proposed rate one MRP and multirate MRP can always achieve full transmit diversity and optimal system performance for arbitrary number of antennas, subcarrier intervals, and subcarrier groupings, with limited channel knowledge required by the transmit antennas. The optimization process of the rate one MRP is simple and easily visualized so that the optimal rotation angle can be derived explicitly, or even intuitively for some cases. The multirate MRP has a complex optimization process, but it has a better spectral efficiency and provides a relatively smooth balance between system performance and transmission rate. Simulations show that the proposed SFBC with MRP can overcome the diversity loss for specific propagation scenarios, always improve the system performance, and demonstrate flexible performance with large performance gain. Therefore the proposed SFBCs with MRP demonstrate flexibility and feasibility so that it is more suitable for a practical MIMO-OFDM system with dynamic parameters.
MOTION ESTIMATION IN MPEG-4 VIDEO SEQUENCE USING BLOCK MATCHING ALGORITHM
Directory of Open Access Journals (Sweden)
KISHORE PINNINTI
2011-12-01
Full Text Available Now a day, MPEG-4 is the most apparent multimedia standard which combines natural interactivity, synthetic digital videos and computer graphics. It has a wide variety of applications such as video conferencing, computer games and mobile phones etc. All the applications need portable video communicators, so low power VLSIimplementations are required. In addition to the required portable devices, a care must be taken for the band width limitations. To perform an effective transmission of video sequences using the limited Bandwidth, the input data must be compressed and coded to fit these limited resources .This paper aims towards the realizationof an efficient estimation of moving components in a video image sequences to isolate moving image from the static background. The architecture developed in this paper uses LMS algorithm for estimating the noise components and also uses Block Matching Algorithm for the detection of moving components in the frame sequences. Further Huffman decoder is used for decoding the compressed data in the video codec. The proposed task is implemented in VHDL Language and the results are analyzed in XILINX Spartan-III.
Block matching 3D random noise filtering for absorption optical projection tomography
Energy Technology Data Exchange (ETDEWEB)
Fumene Feruglio, P; Vinegoni, C; Weissleder, R [Center for Systems Biology, Massachusetts General Hospital, Harvard Medical School, 185 Cambridge Street, Boston, MA 02114 (United States); Gros, J [Department of Genetics, Harvard Medical School, 77 Avenue Louis Pasteur, Boston MA 02115 (United States); Sbarbati, A, E-mail: cvinegoni@mgh.harvard.ed [Department of Morphological and Biomedical Sciences, University of Verona, Strada Le Grazie 8, 37134 Verona (Italy)
2010-09-21
Absorption and emission optical projection tomography (OPT), alternatively referred to as optical computed tomography (optical-CT) and optical-emission computed tomography (optical-ECT), are recently developed three-dimensional imaging techniques with value for developmental biology and ex vivo gene expression studies. The techniques' principles are similar to the ones used for x-ray computed tomography and are based on the approximation of negligible light scattering in optically cleared samples. The optical clearing is achieved by a chemical procedure which aims at substituting the cellular fluids within the sample with a cell membranes' index matching solution. Once cleared the sample presents very low scattering and is then illuminated with a light collimated beam whose intensity is captured in transillumination mode by a CCD camera. Different projection images of the sample are subsequently obtained over a 360{sup 0} full rotation, and a standard backprojection algorithm can be used in a similar fashion as for x-ray tomography in order to obtain absorption maps. Because not all biological samples present significant absorption contrast, it is not always possible to obtain projections with a good signal-to-noise ratio, a condition necessary to achieve high-quality tomographic reconstructions. Such is the case for example, for early stage's embryos. In this work we demonstrate how, through the use of a random noise removal algorithm, the image quality of the reconstructions can be considerably improved even when the noise is strongly present in the acquired projections. Specifically, we implemented a block matching 3D (BM3D) filter applying it separately on each acquired transillumination projection before performing a complete three-dimensional tomographical reconstruction. To test the efficiency of the adopted filtering scheme, a phantom and a real biological sample were processed. In both cases, the BM3D filter led to a signal-to-noise ratio
Blocking Probability Based Hierarchical Storage Design in VoD Systems
Institute of Scientific and Technical Information of China (English)
无
2003-01-01
In this paper, we discuss the relationship between the blocking probability and the configuration of storage hierarchy in a Video on Demand (VoD) server using the queueing model we propose. With this model , the optimal configuration of the storage system can be obtained.
DEFF Research Database (Denmark)
Ayoubi, Mehran Asad; Almdal, Kristoffer; Zhu, Kaizheng;
2014-01-01
Based on a parent diblock copolymer of poly(styrene)-b-poly(methacrylic acid), PS-b-PMAA, linear-b-amphiphilic comb (L-b-AC) ionic supramolecules [Soft Matter 2013, 9, 1540-1555] are synthesized in which the poly(methacrylate) backbone of the ionic supramolecular AC-block is neutralized by alkyl ...
Energy Technology Data Exchange (ETDEWEB)
Kuchibhatla, Satyanarayana V N T [Advanced Materials Processing and Analysis Center, University of Central Florida, Orlando, FL-32816 (United States); Karakoti, Ajay S [Advanced Materials Processing and Analysis Center, University of Central Florida, Orlando, FL-32816 (United States); Seal, Sudipta [Advanced Materials Processing and Analysis Center, University of Central Florida, Orlando, FL-32816 (United States)
2007-02-21
A room temperature, template-free, wet chemical synthesis of ceria nanoparticles and their long term ageing characteristics are reported. High resolution transmission electron microscopy and UV-visible spectroscopy techniques are used to observe the variation in size, structure and oxidation state, respectively as a function of time. The morphology variation and the hierarchical assembly (octahedral superstructure) of nanostructures are imputed to the inherent structural aspects of cerium oxide. It is hypothesized that the 3-5 nm individual building blocks will undergo an intra-agglomerate re-orientation to attain the low energy configuration. This communication also emphasizes the need for long term ageing studies of nanomaterials in various solvents for multiple functionalities.
Directory of Open Access Journals (Sweden)
Mamta Malik
2011-09-01
Full Text Available Cluster detection is a tool employed by GIS scientists who specialize in the field of spatial analysis. This study employed a combination of GIS, RS and a novel 3DCCOM spatial data clustering algorithm to assess the rural demographic development strategies of Sonepat block, Haryana, India. This Study is undertaken in the rural and rural-based district in India to demonstrate the integration of village-level spatial and non-spatial data in GIS environment using Hierarchical Clustering. Spatial clusters of living standard parameters, including family members, male and female population, sex ratio, total male and female education ratio etc. The paper also envisages future development and usefulness of this community GIS, Spatial data clustering tool for grass-root level planning. Any data that showsgeographic (spatial variability can be subject to cluster analysis.
2009-12-30
replicated in metal oxides. The process involves the supercritical CO2-assisted infusion and phase selective condensation of silica precursors within one...cell biology of silica biomineralization . Protist 1998, 149, (3), 213-219. 19. Poulsen, N.; Sumper, M.; Kroger, N., Biosilica formation in diatoms...energy applications [electronic resource] : fabrication of mesoporous metal oxide films by 3-D replication of block copolymers. University of
Huebner, Claudia S.
2016-10-01
As a consequence of fluctuations in the index of refraction of the air, atmospheric turbulence causes scintillation, spatial and temporal blurring as well as global and local image motion creating geometric distortions. To mitigate these effects many different methods have been proposed. Global as well as local motion compensation in some form or other constitutes an integral part of many software-based approaches. For the estimation of motion vectors between consecutive frames simple methods like block matching are preferable to more complex algorithms like optical flow, at least when challenged with near real-time requirements. However, the processing power of commercially available computers continues to increase rapidly and the more powerful optical flow methods have the potential to outperform standard block matching methods. Therefore, in this paper three standard optical flow algorithms, namely Horn-Schunck (HS), Lucas-Kanade (LK) and Farnebäck (FB), are tested for their suitability to be employed for local motion compensation as part of a turbulence mitigation system. Their qualitative performance is evaluated and compared with that of three standard block matching methods, namely Exhaustive Search (ES), Adaptive Rood Pattern Search (ARPS) and Correlation based Search (CS).
Cosmic queuing: galaxy satellites, building blocks and the hierarchical clustering paradigm
Lagos, Claudia del P; Cora, Sofia A
2009-01-01
We study the properties of building blocks (BBs, i.e. accreted satellites) and surviving satellites of present-day galaxies using the SAG semi-analytic model of galaxy formation in the context of a concordance Lambda Cold Dark Matter (LCDM) cosmology. We find higher metallicities for BBs, an effect produced by the same processes behind the build-up of the mass-metallicity relation, namely, the higher peak height in the density fluctuation field occupied by BBs and central galaxies which have collapsed into a single object earlier than surviving satellites. A detailed analysis shows that BBs start to form stars earlier, and build-up half of their final stellar mass (measured at the moment of disruption) up to four times faster than surviving satellites. We show that this effect is a consequence of the epoch in which this occurs; BBs assemble their stellar mass mostly during the peak of the merger activity in the LCDM cosmology, whereas surviving satellites keep increasing their stellar masses down to z=1. The ...
Long-Term Interference at the Semantic Level: Evidence from Blocked-Cyclic Picture Matching
Wei, Tao; Schnur, Tatiana T.
2016-01-01
Processing semantically related stimuli creates interference across various domains of cognition, including language and memory. In this study, we identify the locus and mechanism of interference when retrieving meanings associated with words and pictures. Subjects matched a probe stimulus (e.g., cat) to its associated target picture (e.g., yarn)…
A Novel Hexagonal Search Algorithm for Fast Block Matching Motion Estimation
Directory of Open Access Journals (Sweden)
Anastasios Hamosfakidis
2002-06-01
Full Text Available Based on real-world image sequence characteristics of center-biased motion vector distribution, a Hexagonal (HS algorithm with center-biased checking point pattern for fast block motion estimation is proposed. The HS is compared with full search (FS, four-step search (4SS, new three-step search (NTSS, and recently proposed diamond search (DS methods. Experimental results show that the proposed technique provides competitive performance with reduced computational complexity.
Comparison of 2 modifications of the twin-block appliance in matched Class II samples.
Parkin, N A; McKeown, H F; Sandler, P J
2001-06-01
The purpose of this study was to compare the skeletal and dental changes contributing to Class II correction with 2 modifications of the Twin-block appliance: Twin-block appliances that use a labial bow (TB1) and Twin-block appliances that incorporate high-pull headgear and torquing spurs on the maxillary central incisors (TB2). After pretreatment equivalence was established, a total of 36 consecutively treated patients with the TB1 modification were compared with 27 patients treated with the TB2 modification. Both samples were treated in the same hospital department and the same technician made all the appliances. The cephalostat, digitizing package, and statistical methods were common to both groups. The results demonstrated that the addition of headgear to the appliance resulted in effective vertical and sagittal control of the maxillary complex and thus maximized the Class II skeletal correction in the TB2 sample. Use of the torquing springs resulted in less retroclination of the maxillary incisors in the TB2 sample when compared with the TB1 sample; however, this difference did not reach the level of statistical significance.
Grosse-Sundrup, Martina; Henneman, Justin P; Sandberg, Warren S; Bateman, Brian T; Uribe, Jose Villa; Nguyen, Nicole Thuy; Ehrenfeld, Jesse M; Martinez, Elizabeth A; Kurth, Tobias
2012-01-01
Objective To determine whether use of intermediate acting neuromuscular blocking agents during general anesthesia increases the incidence of postoperative respiratory complications. Design Prospective, propensity score matched cohort study. Setting General teaching hospital in Boston, Massachusetts, United States, 2006-10. Participants 18 579 surgical patients who received intermediate acting neuromuscular blocking agents during surgery were matched by propensity score to 18 579 reference patients who did not receive such agents. Main outcome measures The main outcome measures were oxygen desaturation after extubation (hemoglobin oxygen saturation 3%) and reintubations requiring unplanned admission to an intensive care unit within seven days of surgery. We also evaluated effects on these outcome variables of qualitative monitoring of neuromuscular transmission (train-of-four ratio) and reversal of neuromuscular blockade with neostigmine to prevent residual postoperative neuromuscular blockade. Results The use of intermediate acting neuromuscular blocking agents was associated with an increased risk of postoperative desaturation less than 90% after extubation (odds ratio 1.36, 95% confidence interval 1.23 to 1.51) and reintubation requiring unplanned admission to an intensive care unit (1.40, 1.09 to 1.80). Qualitative monitoring of neuromuscular transmission did not decrease this risk and neostigmine reversal increased the risk of postoperative desaturation to values less than 90% (1.32, 1.20 to 1.46) and reintubation (1.76, 1.38 to 2.26). Conclusion The use of intermediate acting neuromuscular blocking agents during anesthesia was associated with an increased risk of clinically meaningful respiratory complications. Our data suggest that the strategies used in our trial to prevent residual postoperative neuromuscular blockade should be revisited. PMID:23077290
Massanes, Francesc; Cadennes, Marie; Brankov, Jovan G.
2011-07-01
We describe and evaluate a fast implementation of a classical block-matching motion estimation algorithm for multiple graphical processing units (GPUs) using the compute unified device architecture computing engine. The implemented block-matching algorithm uses summed absolute difference error criterion and full grid search (FS) for finding optimal block displacement. In this evaluation, we compared the execution time of a GPU and CPU implementation for images of various sizes, using integer and noninteger search grids. The results show that use of a GPU card can shorten computation time by a factor of 200 times for integer and 1000 times for a noninteger search grid. The additional speedup for a noninteger search grid comes from the fact that GPU has built-in hardware for image interpolation. Further, when using multiple GPU cards, the presented evaluation shows the importance of the data splitting method across multiple cards, but an almost linear speedup with a number of cards is achievable. In addition, we compared the execution time of the proposed FS GPU implementation with two existing, highly optimized nonfull grid search CPU-based motion estimations methods, namely implementation of the Pyramidal Lucas Kanade Optical flow algorithm in OpenCV and simplified unsymmetrical multi-hexagon search in H.264/AVC standard. In these comparisons, FS GPU implementation still showed modest improvement even though the computational complexity of FS GPU implementation is substantially higher than non-FS CPU implementation. We also demonstrated that for an image sequence of 720 × 480 pixels in resolution commonly used in video surveillance, the proposed GPU implementation is sufficiently fast for real-time motion estimation at 30 frames-per-second using two NVIDIA C1060 Tesla GPU cards.
A New Cross Based Gradient Descent Search Algorithm for Block Matching in MPEG-4 Encoder
Institute of Scientific and Technical Information of China (English)
WANGZhenzhou; LIGuiling
2003-01-01
Motion estimation is an important part of the Moving pictures expert group-4 (MPEG-4) encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature occupies a significant part of the encoding time especially when using the straightforward Full Search algorithm. For frame based video encoding, a lot of fast algorithms have been proposed, which have proved to be efficient in encoding In this paper We proposed a new algorithm named Cross based gradient descent search (CBGDS) algorithm, which is significantly faster than FS and gives similar quality of the output sequence. At the same time, We compare our algorithm with some other algorithms, such as Three step search (TSS), Improved three step search (ITSS), New three step search (NTSS), Four step search (4SS), Diamond search (DS), Block based gradient descent search (BBGDS) and Cellular search (CS). As the experimental results show, our algorithm has its advantage over the others. For objects based video encoding, most of the existing fast algorithms are not suitable because the arbitrarily shaped objects have more local minima. So we incorporate the alpha information and propose a new algorithm, which is compatible with the previously proposed efficient motion estimation method for arbitrarily shaped video objects.
Xu, Shaoping; Hu, Lingyan; Yang, Xiaohui
2016-01-01
The performance of conventional denoising algorithms is usually controlled by one or several parameters whose optimal settings depend on the contents of the processed images and the characteristics of the noises. Among these parameters, noise level is a fundamental parameter that is always assumed to be known by most of the existing denoising algorithms (so-called nonblind denoising algorithms), which largely limits the applicability of these nonblind denoising algorithms in many applications. Moreover, these nonblind algorithms do not always achieve the best denoised images in visual quality even when fed with the actual noise level parameter. To address these shortcomings, in this paper we propose a new quality-aware features-based noise level estimator (NLE), which consists of quality-aware features extraction and optimal noise level parameter prediction. First, considering that image local contrast features convey important structural information that is closely related to image perceptual quality, we utilize the marginal statistics of two local contrast operators, i.e., the gradient magnitude and the Laplacian of Gaussian (LOG), to extract quality-aware features. The proposed quality-aware features have very low computational complexity, making them well suited for time-constrained applications. Then we propose a learning-based framework where the noise level parameter is estimated based on the quality-aware features. Based on the proposed NLE, we develop a blind block matching and three-dimensional filtering (BBM3D) denoising algorithm which is capable of effectively removing additive white Gaussian noise, even coupled with impulse noise. The noise level parameter of the BBM3D algorithm is automatically tuned according to the quality-aware features, guaranteeing the best performance. As such, the classical block matching and three-dimensional algorithm can be transformed into a blind one in an unsupervised manner. Experimental results demonstrate that the
Direct hierarchical assembly of nanoparticles
Xu, Ting; Zhao, Yue; Thorkelsson, Kari
2014-07-22
The present invention provides hierarchical assemblies of a block copolymer, a bifunctional linking compound and a nanoparticle. The block copolymers form one micro-domain and the nanoparticles another micro-domain.
Institute of Scientific and Technical Information of China (English)
孙琰玥; 何小海; 宋海英; 陈为龙
2011-01-01
图像配准是超分辨率重建中的一个关键问题,直接影响超分辨率重建图像的质量.本文在自适应十字搜索(Adaptive rood pattern search,ARPS)块匹配算法的基础上,根据小波域中各图像之间的相关性,提出一种分层块匹配算法-基于小波变换的改进的自适应十字模式搜索算法(Improved adaptive rood pattern search algorithm based on wavelet transform,W-IARPS),该方法在小波变换域完成匹配宏块的搜索,有效地减少了匹配点的搜索个数,且配准图像的峰值信噪比相比全搜索算法下降不到0.1dB,保持了较高的配准精度.最后采用凸集投影(Projections onto convex sets,POCS)算法对配准后的图像进行超分辨率重建,取得了较好的视觉效果.实验结果表明,该方法具有较高的配准精度和重建效果,算法稳健可靠.%Image registration is one of the key components in super-resolution reconstruction, and it directly affects the quality of the reconstructed image. On the basis of adaptive rood pattern search (ARPS) block-matching algorithm,and according to the correlation between various images in wavelet domain, an hierarchical block-matching algorithm - improved adaptive rood pattern search algorithm based on wavelet transform (W-IARPS) is proposed. Searching matched-macroblocks in wavelet domain can effectively reduce the number of search points, and the ratio of peak signal to noise of registered images decreases less than 0.1 dB compared to the exhaustive-search algorithm. It means that the high registration accuracy is guaranteed. Finally, the projections onto convex sets (POCS) method is used to reconstruct the super-resolution image from the registered images, and it can achieve better visual effects. The simulation results show that the algorithm has a high registration accuracy and reliable reconstruction results.
三角网约束下的层次匹配方法%Hierarchical Matching Method with Triangle Network Constraint
Institute of Scientific and Technical Information of China (English)
郑顺义; 马电; 王晓南
2014-01-01
Focusing on dense matching in photogrammetry ,an image matching method by combing the triangle network constraint with pyramid strategy has been proposed in this paper .Firstly ,feature points are extracted in each layer ,and then image matching is done under the constraint of a Delaunay triangle network ,which has been constructed by the matching result of a higher layer .The pyramid strategy itself shows a coarse‐to‐fine process and meanwhile Delaunay triangle network can pass a powerful match control from the higher layer to the lower layer .Experiments shows that the proposed method can get a reliable ,high‐accuracy and dense match result and the generated point cloud can describe the topography well .%针对数字摄影测量中密集匹配问题，提出一种三角网约束与金字塔策略相结合的影像匹配方法。该方法在每层金字塔影像中提取特征点，利用金字塔上层影像的匹配结果构建Delaunay三角网，约束和指导金字塔下层影像的匹配；金字塔策略本身体现由粗到精的匹配过程，而Delaunay三角网能有效地将上层匹配结果作为约束传递到下层影像。实验结果证明，文中方法生成的密集匹配点云密度大、误匹配少、精度高，能有效地反映地貌特征。
Hachay, Olga; Khachay, Andrey
2017-04-01
Geological medium is an open system which is influenced by outer and inner factors that can lead it to an unstable state. Such non stability usually occurred locally in zones, which we name as dynamically active elements. They can be indicators of potential catastrophic events. These zones differ from the surrounding geological medium by their structural forms, which are often of hierarchical type. The process of their activization can be researched with use of wave fields monitoring. For that purpose we had earlier developed algorithms of modeling wave field propagation through the local objects with hierarchical structure. This paper concerns a new approach for interpretation of the distribution of wave fields for determining of the contours of these local hierarchical objects. In this work we consider an algorithm for constructing of two equations of theoretical inverse problem for 2D linear polarized transverse elastic wave and transverse electromagnetic field by excitation of the N-layered elastic and conductive medium with hierarchic elastic, anomaly stressed and magnetic inclusion located in the ν-th layer with the density and conductivity equal to the density and conductivity of the layer. An iteration process of solving the inverse problem for the case of certain configurations of hierarchical 2-D inclusions of k-th rank is elaborated. When interpreting the results of the monitoring it is needed to use the data of such systems that are configured to study the hierarchical structure of the medium. Findings. From the theory it is obviously that for such complicated medium each wave field contains its own information about the inner structure of the hierarchical inclusion. Therefore it is needed to interpret the monitoring data for each wave field apart, and not mixes the data base. Practical value/implications. These results will be the base for constructing new systems of monitoring observations of dynamical geological systems. Especially it is needed to
Oehlschlägel, Jens
2007-01-01
Cluster matching by permuting cluster labels is important in many clustering contexts such as cluster validation and cluster ensemble techniques. The classic approach is to minimize the euclidean distance between two cluster solutions which induces inappropriate stability in certain settings. Therefore, we present the truematch algorithm that introduces two improvements best explained in the crisp case. First, instead of maximizing the trace of the cluster crosstable, we propose to maximize a chi-square transformation of this crosstable. Thus, the trace will not be dominated by the cells with the largest counts but by the cells with the most non-random observations, taking into account the marginals. Second, we suggest a probabilistic component in order to break ties and to make the matching algorithm truly random on random data. The truematch algorithm is designed as a building block of the truecluster framework and scales in polynomial time. First simulation results confirm that the truematch algorithm give...
Institute of Scientific and Technical Information of China (English)
田昊; 李国辉; 廉蔺; 贾立
2011-01-01
This paper proposes a kernel function - hierarchical log-polar matching kernel which making use of the feature spatial information for building classification in remote sensing images. It extracts image local features, uses traditional clustering methods to quantize all feature vectors into several different types, and then partitions the image into multi-level increasingly fine log-polar "sub-regions (bins)". By computing histograms of local features found inside each sub-region in each level, the weighted multi-scale histograms are formulated. By summing all weighted multi-level histograms of each feature vector, the final hierarchical log-polar kernel is established. The building classification is done with a support vector machine (SVM) trained by using the "one-versus-all" rule. The experimental results on Caltech-256 database and real remote sensing images demonstrate the efficiency and effectiveness of the proposed kernel.%提出了一种利用图像特征空间信息的核函数——层次对数极坐标匹配核，用于遥感图像建筑物目标的分类。对图像进行特征提取，并将特征映射到已聚类好的“码本”中，量化为有限个类别。将图像由粗到细划分为多个层次的对数极坐标系下的“子区域(单元格)”。比对落入同一层次、同一“子区域(单元格)”的每类特征的直方图交集，建立加权的多尺度直方图，将多个特征多尺度直方图合并，得到最终的核函数，并利用“一对多”的支持向量机(support vector machine，SVM)完成建筑物的分类。对标准数据库Caltech-256和自建遥感图像数据集进行实验，结果证明了该核函数的有效性。
Xiao, Qijun
This thesis discusses the full scope of a project exploring the physics of hierarchical clusters of interacting nanomagnets. These clusters may be relevant for novel applications such as multilevel data storage devices. The work can be grouped into three main activities: micromagnetic simulation, fabrication and characterization of proof-of-concept prototype devices, and efforts to scale down the structures by creating the hierarchical structures with the aid of diblock copolymer self assembly. Theoretical micromagnetic studies and simulations based on Landau-Lifshitz-Gilbert (LLG) equation were conducted on nanoscale single domain magnetic entities. For the simulated nanomagnet clusters with perpendicular uniaxial anisotropy, the simulation showed the switching field distributions, the stability of the magnetostatic states with distinctive total cluster perpendicular moments, and the stepwise magnetic switching curves. For simulated nanomagnet clusters with in-plane shape anisotropy, the simulation showed the stepwise switching behaviors governed by thermal agitation and cluster configurations. Proof-of-concept cluster devices with three interacting Co nanomagnets were fabricated by e-beam lithography (EBL) and pulse-reverse electrochemical deposition (PRECD). EBL patterning on a suspended 100 nm SiN membrane showed improved lateral lithography resolution to 30 nm. The Co nanomagnets deposited using the PRECD method showed perpendicular anisotropy. The switching experiments with external applied fields were able to switch the Co nanomagnets through the four magnetostatic states with distinctive total perpendicular cluster magnetization, and proved the feasibility of multilevel data storage devices based on the cluster concept. Shrinking the structures size was experimented by the aid of diblock copolymer. Thick poly(styrene)-b-poly(methyl methacrylate) (PS-b-PMMA) diblock copolymer templates aligned with external electrical field were used to fabricate long Ni
Li, Xin; Yu, Jiaguo; Jaroniec, Mietek
2016-05-01
As a green and sustainable technology, semiconductor-based heterogeneous photocatalysis has received much attention in the last few decades because it has potential to solve both energy and environmental problems. To achieve efficient photocatalysts, various hierarchical semiconductors have been designed and fabricated at the micro/nanometer scale in recent years. This review presents a critical appraisal of fabrication methods, growth mechanisms and applications of advanced hierarchical photocatalysts. Especially, the different synthesis strategies such as two-step templating, in situ template-sacrificial dissolution, self-templating method, in situ template-free assembly, chemically induced self-transformation and post-synthesis treatment are highlighted. Finally, some important applications including photocatalytic degradation of pollutants, photocatalytic H2 production and photocatalytic CO2 reduction are reviewed. A thorough assessment of the progress made in photocatalysis may open new opportunities in designing highly effective hierarchical photocatalysts for advanced applications ranging from thermal catalysis, separation and purification processes to solar cells.
Collaborative Hierarchical Sparse Modeling
Sprechmann, Pablo; Sapiro, Guillermo; Eldar, Yonina C
2010-01-01
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is done by solving an l_1-regularized linear regression problem, usually called Lasso. In this work we first combine the sparsity-inducing property of the Lasso model, at the individual feature level, with the block-sparsity property of the group Lasso model, where sparse groups of features are jointly encoded, obtaining a sparsity pattern hierarchically structured. This results in the hierarchical Lasso, which shows important practical modeling advantages. We then extend this approach to the collaborative case, where a set of simultaneously coded signals share the same sparsity pattern at the higher (group) level but not necessarily at the lower one. Signals then share the same active groups, or classes, but not necessarily the same active set. This is very well suited for applications such as source separation. An efficient optimization procedure, which guarantees convergence to the global opt...
改进块匹配宏块的快速传感器电子稳像方法%Improved Fast Block-matching Algorithm for Sensor Electronic Image Stabilization
Institute of Scientific and Technical Information of China (English)
王鹏; 赵跃进; 孔令琴; 董立泉; 戴璐
2012-01-01
提出了一种改进块匹配宏块分布排列的快速传感器电子稳像算法,通过陀螺传感器测量摄像系统的抖动,利用小范围快速块匹配算法估计局部运动矢量,再运用最小二乘法解算全局运动矢量.小范围快速块匹配算法得到的局部运动矢量准确度高,仅需部分局部运动矢量即可准确解算出全局运动矢量.基于此在保证运动矢量准确度情况下,对块匹配宏块的分布排列进行了改进,从而减少匹配宏块数量加快算法速度.通过对宏块网,格模型的分析,得出对小范围快速块匹配算法进行宏块分布改进的方案,进而设计出快速传感器电子稳像算法.仿真及实验表明:运算时间提高89％左右,且算法准确度略高于改进前算法.%An improved block density fast algorithm for steadying shaking image was presented. The jitter of camera system was measured by gyro, while the local motion vectors was estimated by the small area fast block-matching algorithm, and the global motion vector was calculated by least square method. Small area fast block-matching algorithm, which has high calculating precision, is good at calculating the local motion vectors. So the least square method can exactly calculate global motion vector by using parts of the local motion vectors. For this reason, the black density can be improved to speed up the algorithm and retain the precision of the global motion vector at the same time. The small area fast block-matching algorithm was optimized by analyzing the block gridding, and then the fast sensor electronic stabilization algorithm was designed. The simulation and experiment show that the algorithm is slightly more accurate and about 89% faster than the small afea fast algorithm.
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.
A. Hak (Tony); J. Dul (Jan)
2009-01-01
textabstractPattern matching is comparing two patterns in order to determine whether they match (i.e., that they are the same) or do not match (i.e., that they differ). Pattern matching is the core procedure of theory-testing with cases. Testing consists of matching an “observed pattern” (a pattern
Fu, Yuanfang; Li, Pinghua; Cao, Yimei; Wang, Na; Sun, Pu; Shi, Qian; Ji, Xincheng; Bao, Huifang; Li, Dong; Chen, Yingli; Bai, Xingwen; Ma, Xueqing; Zhang, Jing; Lu, Zengjun; Liu, Zaixin
2017-01-01
Foot-and-mouth disease (FMD) is a devastating animal disease. Strategies for differentiation of infected from vaccinated animals (DIVA) remain very important for controlling disease. Development of an epitope-deleted marker vaccine and accompanying diagnostic method will improve the efficiency of DIVA. Here, a monoclonal antibody (Mab) was found to recognize a conserved “AEKNPLE” epitope spanning amino acids 109–115 of non-structural protein (NSP) 3A of foot-and-mouth disease virus (FMDV; O/Tibet/CHA/99 strain), which could be deleted by a reverse-genetic procedure. In addition, a blocking ELISA was developed based on this Mab against NSP 3A, which could serve as a matching test for a negative-marker vaccine. The criterion of this blocking ELISA was determined by detecting panels of sera from different origins. The serum samples with a percentage inhibition (PI) equal or greater than 50% were considered to be from infected animals, and those with <50% PI were considered to be from non-infected animals. This test showed similar performance when compared with other 2 blocking ELISAs based on an anti-NSP 3B Mab. This is the first report of the DIVA test for an NSP antibody based on an Mab against the conserved and predominant “AEKNPLE” epitope in NSP 3A of FMDV. PMID:28107470
Hak, Tony; Dul, Jan
2009-01-01
textabstractPattern matching is comparing two patterns in order to determine whether they match (i.e., that they are the same) or do not match (i.e., that they differ). Pattern matching is the core procedure of theory-testing with cases. Testing consists of matching an “observed pattern” (a pattern of measured values) with an “expected pattern” (a hypothesis), and deciding whether these patterns match (resulting in a confirmation of the hypothesis) or do not match (resulting in a disconfirmat...
Approximate Matching of Hierarchial Data
DEFF Research Database (Denmark)
Augsten, Nikolaus
The goal of this thesis is to design, develop, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard...... as in addition to the data values also the structure must be considered. A well-known measure for comparing trees is the tree edit distance. It is computationally expensive and leads to a prohibitively high run time. Our solution for the approximate matching of hierarchical data are pq-grams. The pq...... formally proof that the pq-gram index can be incrementally updated based on the log of edit operations without reconstructing intermediate tree versions. The incremental update is independent of the data size and scales to a large number of changes in the data. We introduce windowed pq...
Institute of Scientific and Technical Information of China (English)
熊旭辉; 余胜生; 周敬利
2006-01-01
A structure of logical hierarchical cluster for the distributed multimedia on demand server is proposed. The architecture is mainly composed of the network topology and the resource management of all server nodes. Instead of the physical network hierarchy or the independent management hierarchy, the nodes are organized into a logically hierarchical cluster according to the multimedia block they caches in the midderware layer. The process of a member joining/leaving or the structure adjustment cooperatively implemented by all members is concerned with decentralized maintenance of the logical cluster hierarchy. As the root of each logically hierarchical cluster is randomly mapped into the system, the logical structure of a multimedia block is dynamically expanded across some regions by the two replication policies in different load state respectively. The local load diversion is applied to fine-tune the load of nodes within a local region but belongs to different logical hierarchies. Guaranteed by the dynamic expansion of a logical structure and the load diversion of a local region, the users always select a closest idle node from the logical hierarchy under the condition of topology integration with resource management.
Emergence of hierarchical structural complexities in nanoparticles and their assembly
Zeng, Chenjie; Chen, Yuxiang; Kirschbaum, Kristin; Lambright, Kelly J.; Jin, Rongchao
2016-12-01
We demonstrate that nanoparticle self-assembly can reach the same level of hierarchy, complexity, and accuracy as biomolecules. The precise assembly structures of gold nanoparticles (246 gold core atoms with 80 p-methylbenzenethiolate surface ligands) at the atomic, molecular, and nanoscale levels were determined from x-ray diffraction studies. We identified the driving forces and rules that guide the multiscale assembly behavior. The protecting ligands self-organize into rotational and parallel patterns on the nanoparticle surface via C-Hṡṡṡπ interaction, and the symmetry and density of surface patterns dictate directional packing of nanoparticles into crystals with orientational, rotational, and translational orders. Through hierarchical interactions and symmetry matching, the simple building blocks evolve into complex structures, representing an emergent phenomenon in the nanoparticle system.
Institute of Scientific and Technical Information of China (English)
赵志强; 陈盈
2011-01-01
针对视频图像序列的不稳定性,结合灰度投影算法与块匹配法各自的特点,提出了一种可以快速消除图像序列间平移和旋转抖动的新型电子稳像算法.该算法首先采用灰度投影法估计与补偿图像序列间的平移运动,然后用拉普拉斯算子在图像边缘处选取灰度信息比较丰富的小块模板,利用块匹配法计算模板的平移运动,再结合模板在图像上的位置估计图像的旋转运动,最后通过运动补偿得到稳定的视频图像序列.实验结果表明,该算法可以明显地减轻图像序列间的抖动现象,对于提高动态图像的稳定性具有很好的效果.%In allusion to the instability of video sequences, a new electronic image stabilization algorithm, based on different features of gray projection algorithm and block matching algorithm, is proposed to fast eliminate the shift,dithering and rotation of video sequences. This algorithm first adopts gray projection algorithm to reckon and compensate the translational motion between video sequences, and then adopts Laplace operator to select small templates with abundant gray-scale information near the edge of the image. Next, it uses block matching algorithm to calculate the translational motion of templates. Moreover, it reckons the image rotation according to where the templates locate on the image. In the end, it uses motion compensation to attain stable video sequences. Experimental results show that, the algorithm can obviously eliminate the dithering between video sequences, which will have a salutary effect on improving the stability of dynamic image.
DEFF Research Database (Denmark)
Thomadsen, Tommy
2005-01-01
of different types of hierarchical networks. This is supplemented by a review of ring network design problems and a presentation of a model allowing for modeling most hierarchical networks. We use methods based on linear programming to design the hierarchical networks. Thus, a brief introduction to the various....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...... linear programming based methods is included. The thesis is thus suitable as a foundation for study of design of hierarchical networks. The major contribution of the thesis consists of seven papers which are included in the appendix. The papers address hierarchical network design and/or ring network...
Hierarchical Multiagent Reinforcement Learning
2004-01-25
In this paper, we investigate the use of hierarchical reinforcement learning (HRL) to speed up the acquisition of cooperative multiagent tasks. We...introduce a hierarchical multiagent reinforcement learning (RL) framework and propose a hierarchical multiagent RL algorithm called Cooperative HRL. In
Architecture of the parallel hierarchical network for fast image recognition
Timchenko, Leonid; Wójcik, Waldemar; Kokriatskaia, Natalia; Kutaev, Yuriy; Ivasyuk, Igor; Kotyra, Andrzej; Smailova, Saule
2016-09-01
Multistage integration of visual information in the brain allows humans to respond quickly to most significant stimuli while maintaining their ability to recognize small details in the image. Implementation of this principle in technical systems can lead to more efficient processing procedures. The multistage approach to image processing includes main types of cortical multistage convergence. The input images are mapped into a flexible hierarchy that reflects complexity of image data. Procedures of the temporal image decomposition and hierarchy formation are described in mathematical expressions. The multistage system highlights spatial regularities, which are passed through a number of transformational levels to generate a coded representation of the image that encapsulates a structure on different hierarchical levels in the image. At each processing stage a single output result is computed to allow a quick response of the system. The result is presented as an activity pattern, which can be compared with previously computed patterns on the basis of the closest match. With regard to the forecasting method, its idea lies in the following. In the results synchronization block, network-processed data arrive to the database where a sample of most correlated data is drawn using service parameters of the parallel-hierarchical network.
DEFF Research Database (Denmark)
Thomadsen, Tommy
2005-01-01
Communication networks are immensely important today, since both companies and individuals use numerous services that rely on them. This thesis considers the design of hierarchical (communication) networks. Hierarchical networks consist of layers of networks and are well-suited for coping...... the clusters. The design of hierarchical networks involves clustering of nodes, hub selection, and network design, i.e. selection of links and routing of ows. Hierarchical networks have been in use for decades, but integrated design of these networks has only been considered for very special types of networks....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...
Freitas, Ayres; Plehn, Tilman
2016-01-01
Effective Lagrangians are a useful tool for a data-driven approach to physics beyond the Standard Model at the LHC. However, for the new physics scales accessible at the LHC, the effective operator expansion is only relatively slowly converging at best. For tree-level processes, it has been found that the agreement between the effective Lagrangian and a range of UV-complete models depends sensitively on the appropriate definition of the matching. We extend this analysis to the one-loop level, which is relevant for electroweak precision data and Higgs decay to photons. We show that near the scale of electroweak symmetry breaking the validity of the effective theory description can be systematically improved through an appropriate matching procedure. In particular, we find a significant increase in accuracy when including suitable terms suppressed by the Higgs vacuum expectation value in the matching.
Turner, W.
2007-01-01
Consider representation theory associated to symmetric groups, or to Hecke algebras in type A, or to q-Schur algebras, or to finite general linear groups in non-describing characteristic. Rock blocks are certain combinatorially defined blocks appearing in such a representation theory, first observed by R. Rouquier. Rock blocks are much more symmetric than general blocks, and every block is derived equivalent to a Rock block. Motivated by a theorem of J. Chuang and R. Kessar in the case of sym...
侧扫声呐图像的3维块匹配降斑方法%Side-scan sonar image despeckling based on block-matching and 3D filtering
Institute of Scientific and Technical Information of China (English)
范习健; 李庆武; 黄河; 王敏
2012-01-01
斑点噪声是影响侧扫声呐图像质量的主要因素,降斑处理对侧扫声呐图像的判别与分析非常重要.针对侧扫声呐图像自身特性和斑点噪声分布特点,提出一种基于3维块匹配(BM3D)的降斑方法.根据海底散射模型,得到侧扫声呐图像斑点噪声的瑞利分布模型,然后通过高斯光滑函数幂变换将瑞利分布的噪声转化为高斯分布,通过对数变换将乘性噪声转变为加性噪声,再进行自适应的BM3D滤波,最后采用逆变换得到降斑图像.实验结果表明,该方法在降噪、边缘和纹理保持等方面均优于空间域、小波域、Curvelet域的一些降斑方法.%Speckle noise is the major factor affecting the quality of side-scan sonar images. Side-scan sonar image despeckling has therefore a great significance to object identification and image processing. According to side-scan sonar image characteristic and distribution of speckle noise, a despeckling method based on block-matching and 3D filtering (BM3D) is proposed in this paper. A Rayleigh distributed multiplicative speckle noise model is established according to a seabed scattering model. Rayleigh distributed of speckle noise is changed into Gaussian distribution by the Gaussian smooth function power transform. The multiplicative noise is changed into additive noise by a logarithmic transform. Then, the transformed images are filtered by an efficient BM3D algorithm. Last,the final images are achieved by inverse transform. The experimental results show that the new algorithm has a better performance in terms of edge preserving and demising than other spatial filtering,wavelet and Curvelet domain filtering methods.
Static and dynamic friction of hierarchical surfaces
Costagliola, Gianluca; Bosia, Federico; Pugno, Nicola M.
2016-12-01
Hierarchical structures are very common in nature, but only recently have they been systematically studied in materials science, in order to understand the specific effects they can have on the mechanical properties of various systems. Structural hierarchy provides a way to tune and optimize macroscopic mechanical properties starting from simple base constituents and new materials are nowadays designed exploiting this possibility. This can be true also in the field of tribology. In this paper we study the effect of hierarchical patterned surfaces on the static and dynamic friction coefficients of an elastic material. Our results are obtained by means of numerical simulations using a one-dimensional spring-block model, which has previously been used to investigate various aspects of friction. Despite the simplicity of the model, we highlight some possible mechanisms that explain how hierarchical structures can significantly modify the friction coefficients of a material, providing a means to achieve tunability.
Micromechanics of hierarchical materials
DEFF Research Database (Denmark)
Mishnaevsky, Leon, Jr.
2012-01-01
A short overview of micromechanical models of hierarchical materials (hybrid composites, biomaterials, fractal materials, etc.) is given. Several examples of the modeling of strength and damage in hierarchical materials are summarized, among them, 3D FE model of hybrid composites...... with nanoengineered matrix, fiber bundle model of UD composites with hierarchically clustered fibers and 3D multilevel model of wood considered as a gradient, cellular material with layered composite cell walls. The main areas of research in micromechanics of hierarchical materials are identified, among them......, the investigations of the effects of load redistribution between reinforcing elements at different scale levels, of the possibilities to control different material properties and to ensure synergy of strengthening effects at different scale levels and using the nanoreinforcement effects. The main future directions...
Hierarchical auxetic mechanical metamaterials.
Gatt, Ruben; Mizzi, Luke; Azzopardi, Joseph I; Azzopardi, Keith M; Attard, Daphne; Casha, Aaron; Briffa, Joseph; Grima, Joseph N
2015-02-11
Auxetic mechanical metamaterials are engineered systems that exhibit the unusual macroscopic property of a negative Poisson's ratio due to sub-unit structure rather than chemical composition. Although their unique behaviour makes them superior to conventional materials in many practical applications, they are limited in availability. Here, we propose a new class of hierarchical auxetics based on the rotating rigid units mechanism. These systems retain the enhanced properties from having a negative Poisson's ratio with the added benefits of being a hierarchical system. Using simulations on typical hierarchical multi-level rotating squares, we show that, through design, one can control the extent of auxeticity, degree of aperture and size of the different pores in the system. This makes the system more versatile than similar non-hierarchical ones, making them promising candidates for industrial and biomedical applications, such as stents and skin grafts.
Introduction into Hierarchical Matrices
Litvinenko, Alexander
2013-12-05
Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.
Hierarchical Auxetic Mechanical Metamaterials
Gatt, Ruben; Mizzi, Luke; Azzopardi, Joseph I.; Azzopardi, Keith M.; Attard, Daphne; Casha, Aaron; Briffa, Joseph; Grima, Joseph N.
2015-02-01
Auxetic mechanical metamaterials are engineered systems that exhibit the unusual macroscopic property of a negative Poisson's ratio due to sub-unit structure rather than chemical composition. Although their unique behaviour makes them superior to conventional materials in many practical applications, they are limited in availability. Here, we propose a new class of hierarchical auxetics based on the rotating rigid units mechanism. These systems retain the enhanced properties from having a negative Poisson's ratio with the added benefits of being a hierarchical system. Using simulations on typical hierarchical multi-level rotating squares, we show that, through design, one can control the extent of auxeticity, degree of aperture and size of the different pores in the system. This makes the system more versatile than similar non-hierarchical ones, making them promising candidates for industrial and biomedical applications, such as stents and skin grafts.
Applied Bayesian Hierarchical Methods
Congdon, Peter D
2010-01-01
Bayesian methods facilitate the analysis of complex models and data structures. Emphasizing data applications, alternative modeling specifications, and computer implementation, this book provides a practical overview of methods for Bayesian analysis of hierarchical models.
Programming with Hierarchical Maps
DEFF Research Database (Denmark)
Ørbæk, Peter
This report desribes the hierarchical maps used as a central data structure in the Corundum framework. We describe its most prominent features, ague for its usefulness and briefly describe some of the software prototypes implemented using the technology....
Catalysis with hierarchical zeolites
DEFF Research Database (Denmark)
Holm, Martin Spangsberg; Taarning, Esben; Egeblad, Kresten
2011-01-01
Hierarchical (or mesoporous) zeolites have attracted significant attention during the first decade of the 21st century, and so far this interest continues to increase. There have already been several reviews giving detailed accounts of the developments emphasizing different aspects of this research...... topic. Until now, the main reason for developing hierarchical zeolites has been to achieve heterogeneous catalysts with improved performance but this particular facet has not yet been reviewed in detail. Thus, the present paper summaries and categorizes the catalytic studies utilizing hierarchical...... zeolites that have been reported hitherto. Prototypical examples from some of the different categories of catalytic reactions that have been studied using hierarchical zeolite catalysts are highlighted. This clearly illustrates the different ways that improved performance can be achieved with this family...
Smith, Martin H.
1992-01-01
Describes an educational game called "Population Blocks" that is designed to illustrate the concept of exponential growth of the human population and some potential effects of overpopulation. The game material consists of wooden blocks; 18 blocks are painted green (representing land), 7 are painted blue (representing water); and the remaining…
Smith, Martin H.
1992-01-01
Describes an educational game called "Population Blocks" that is designed to illustrate the concept of exponential growth of the human population and some potential effects of overpopulation. The game material consists of wooden blocks; 18 blocks are painted green (representing land), 7 are painted blue (representing water); and the remaining…
2010-07-01
... 28 Judicial Administration 1 2010-07-01 2010-07-01 false Match. 33.21 Section 33.21 Judicial Administration DEPARTMENT OF JUSTICE BUREAU OF JUSTICE ASSISTANCE GRANT PROGRAMS Criminal Justice Block Grants Allocation of Funds § 33.21 Match. (a) Funds may be used to pay up to 50 percent of the cost of a program...
Parallel hierarchical radiosity rendering
Energy Technology Data Exchange (ETDEWEB)
Carter, M.
1993-07-01
In this dissertation, the step-by-step development of a scalable parallel hierarchical radiosity renderer is documented. First, a new look is taken at the traditional radiosity equation, and a new form is presented in which the matrix of linear system coefficients is transformed into a symmetric matrix, thereby simplifying the problem and enabling a new solution technique to be applied. Next, the state-of-the-art hierarchical radiosity methods are examined for their suitability to parallel implementation, and scalability. Significant enhancements are also discovered which both improve their theoretical foundations and improve the images they generate. The resultant hierarchical radiosity algorithm is then examined for sources of parallelism, and for an architectural mapping. Several architectural mappings are discussed. A few key algorithmic changes are suggested during the process of making the algorithm parallel. Next, the performance, efficiency, and scalability of the algorithm are analyzed. The dissertation closes with a discussion of several ideas which have the potential to further enhance the hierarchical radiosity method, or provide an entirely new forum for the application of hierarchical methods.
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ The Zitongdong Block (Eastern Zitong Block) is located in the northwest of the Sichuan Basin. Tectonically, it is situated in the east part of Zitong Depression, southeast of mid-Longmenshan folded and faulted belt( as shown on Fig. 8 ), covering an area of 1 730 km2. The traffic is very convenient, the No. 108 national highway passes through the north of the block. Topographically, the area belongs to low hilly land at the elevation of 500-700 m.
Neutrosophic Hierarchical Clustering Algoritms
Directory of Open Access Journals (Sweden)
Rıdvan Şahin
2014-03-01
Full Text Available Interval neutrosophic set (INS is a generalization of interval valued intuitionistic fuzzy set (IVIFS, whose the membership and non-membership values of elements consist of fuzzy range, while single valued neutrosophic set (SVNS is regarded as extension of intuitionistic fuzzy set (IFS. In this paper, we extend the hierarchical clustering techniques proposed for IFSs and IVIFSs to SVNSs and INSs respectively. Based on the traditional hierarchical clustering procedure, the single valued neutrosophic aggregation operator, and the basic distance measures between SVNSs, we define a single valued neutrosophic hierarchical clustering algorithm for clustering SVNSs. Then we extend the algorithm to classify an interval neutrosophic data. Finally, we present some numerical examples in order to show the effectiveness and availability of the developed clustering algorithms.
Assembling hierarchical cluster solids with atomic precision.
Turkiewicz, Ari; Paley, Daniel W; Besara, Tiglet; Elbaz, Giselle; Pinkard, Andrew; Siegrist, Theo; Roy, Xavier
2014-11-12
Hierarchical solids created from the binary assembly of cobalt chalcogenide and iron oxide molecular clusters are reported. Six different molecular clusters based on the octahedral Co6E8 (E = Se or Te) and the expanded cubane Fe8O4 units are used as superatomic building blocks to construct these crystals. The formation of the solid is driven by the transfer of charge between complementary electron-donating and electron-accepting clusters in solution that crystallize as binary ionic compounds. The hierarchical structures are investigated by single-crystal X-ray diffraction, providing atomic and superatomic resolution. We report two different superstructures: a superatomic relative of the CsCl lattice type and an unusual packing arrangement based on the double-hexagonal close-packed lattice. Within these superstructures, we demonstrate various compositions and orientations of the clusters.
Hierarchical Porous Structures
Energy Technology Data Exchange (ETDEWEB)
Grote, Christopher John [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-06-07
Materials Design is often at the forefront of technological innovation. While there has always been a push to generate increasingly low density materials, such as aero or hydrogels, more recently the idea of bicontinuous structures has gone more into play. This review will cover some of the methods and applications for generating both porous, and hierarchically porous structures.
Reduction of Transmitted Information Using Similarities between Range Blocks in Fractal Image Coding
Hu, Xiaotong; Qiu, Shuping; Kuroda, Hideo
2007-01-01
Fractal image coding uses the similarities between the best matching domain blocks and range blocks to reconstruct image. In the transmitted information, the information about the best matching domain blocks occupies a large percentage, so the reduction of information about the best matching domain blocks is the most effective method to reduce the quality of transmitted information. On the other hand, there are similarities between range blocks from each other. So, when range blocks are simil...
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ Zitongxi Block (Western Zitong Block), is located in Zitong County, northwest of Sichuan Province (as shown on Fig. 8 ). Geologically. it is situated in the Zitong Depression, southwest of the middle Longmenshan faulted and folded belt, covering an area of 1 830 km2. Transportation is very convenient. A crisscross network of highways run through the block and the Baocheng railway is nearby. The climate is moderate. Most area belongs to hilly land with the elevation of 500-600 m.The Tongjiang River runs across the area.
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ Chengzikou Block is located in the north of Hekou district, Dongying City, Shandong Province, adjacent to Bohai Bay. It can be geographically divided into three units: onshore, transitional zone and offshore ultrashallow zone, totally covering an area of 470 km2. The southern onshore area is low and gentle in topography;the northern shallow sea is at water depths of 2-8 m below sea level, and the transitional zone occupies more than 60% of the whole block. The climate belongs to temperate zone with seasonal wind. Highways are welldeveloped here, and the traffic is very convenient. The Chengzikou Block is about 80 km away from Dongying City and 290 km from Jinan City in the south. The northern offshore area of the block is 160 km away from Longkou port in the east and only 38 km away in the west from Zhuangxi port.
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ Longmenshan Block is located in Jiange County of Jiangyou City in the northwest of Sichuan Basin. covering an area of 2 628 km2. Geologically, it is situated in the Mid-Longmenshan fault and fold belt, neighbouring Zitong Depression in its southeast. There are mountains surrounding its northwest , the rest area being hilly land,with the elevation of 500-700 m. The BaoCheng railway and the No. 108 highway run through the block, the traffic is very convenient.
Electronic Properties in a Hierarchical Multilayer Structure
Institute of Scientific and Technical Information of China (English)
ZHU Chen-Ping; XIONG Shi-Jie
2001-01-01
We investigate electronic properties of a hierarchical multilayer structure consisting of stacking of barriers and wells. The structure is formed in a sequence of generations, each of which is constructed with the same pattern but with the previous generation as the basic building blocks. We calculate the transmission spectrum which shows the multifractal behavior for systems with large generation index. From the analysis of the average resistivity and the multifractal structure of the wavefunctions, we show that there exist different types of states exhibiting extended, localized and intermediate characteristics. The degree of localization is sensitive to the variation of the structural parameters.Suggestion of the possible experimental realization is discussed.
Institute of Scientific and Technical Information of China (English)
Yu-Qiong Wu; Yu- Qiang Gou; Jing Han; Ying-Yan Bi; Shi-Lan Feng; Fang-Di Hu; Chun- Ming Wang
2011-01-01
An approach was proposed to evaluate preparation technology by means of fingerprint-peak matching technology of high performance liquid chromatography with diode array detector （HPLC-DAD）. Similarity and hierarchical clustering analysis （HCA） were applied
Hierarchical manifold learning.
Bhatia, Kanwal K; Rao, Anil; Price, Anthony N; Wolz, Robin; Hajnal, Jo; Rueckert, Daniel
2012-01-01
We present a novel method of hierarchical manifold learning which aims to automatically discover regional variations within images. This involves constructing manifolds in a hierarchy of image patches of increasing granularity, while ensuring consistency between hierarchy levels. We demonstrate its utility in two very different settings: (1) to learn the regional correlations in motion within a sequence of time-resolved images of the thoracic cavity; (2) to find discriminative regions of 3D brain images in the classification of neurodegenerative disease,
Impact of hierarchical memory systems on linear algebra algorithm design
Energy Technology Data Exchange (ETDEWEB)
Gallivan, K.; Jalby, W.; Meier, U.; Sameh, A.H.
1988-01-01
Linear algebra algorithms based on the BLAS or extended BLAS do not achieve high performance on multivector processors with a hierarchical memory system because of a lack of data locality. For such machines, block linear algebra algorithms must be implemented in terms of matrix-matrix primitives (BLAS3). Designing efficient linear algebra algorithms for these architectures requires analysis of the behavior of the matrix-matrix primitives and the resulting block algorithms as a function of certain system parameters. The analysis must identify the limits of performance improvement possible via blocking and any contradictory trends that require trade-off consideration. The authors propose a methodology that facilitates such an analysis and use it to analyze the performance of the BLAS3 primitives used in block methods. A similar analysis of the block size-performance relationship is also performed at the algorithm level for block versions of the LU decomposition and the Gram-Schmidt orthogonalization procedures.
Hierarchically Structured Electrospun Fibers
Directory of Open Access Journals (Sweden)
Nicole E. Zander
2013-01-01
Full Text Available Traditional electrospun nanofibers have a myriad of applications ranging from scaffolds for tissue engineering to components of biosensors and energy harvesting devices. The generally smooth one-dimensional structure of the fibers has stood as a limitation to several interesting novel applications. Control of fiber diameter, porosity and collector geometry will be briefly discussed, as will more traditional methods for controlling fiber morphology and fiber mat architecture. The remainder of the review will focus on new techniques to prepare hierarchically structured fibers. Fibers with hierarchical primary structures—including helical, buckled, and beads-on-a-string fibers, as well as fibers with secondary structures, such as nanopores, nanopillars, nanorods, and internally structured fibers and their applications—will be discussed. These new materials with helical/buckled morphology are expected to possess unique optical and mechanical properties with possible applications for negative refractive index materials, highly stretchable/high-tensile-strength materials, and components in microelectromechanical devices. Core-shell type fibers enable a much wider variety of materials to be electrospun and are expected to be widely applied in the sensing, drug delivery/controlled release fields, and in the encapsulation of live cells for biological applications. Materials with a hierarchical secondary structure are expected to provide new superhydrophobic and self-cleaning materials.
Pearce, Dave; Walter, Anton; Lupton, W. F.; Warren-Smith, Rodney F.; Lawden, Mike; McIlwrath, Brian; Peden, J. C. M.; Jenness, Tim; Draper, Peter W.
2015-02-01
The Hierarchical Data System (HDS) is a file-based hierarchical data system designed for the storage of a wide variety of information. It is particularly suited to the storage of large multi-dimensional arrays (with their ancillary data) where efficient access is needed. It is a key component of the Starlink software collection (ascl:1110.012) and is used by the Starlink N-Dimensional Data Format (NDF) library (ascl:1411.023). HDS organizes data into hierarchies, broadly similar to the directory structure of a hierarchical filing system, but contained within a single HDS container file. The structures stored in these files are self-describing and flexible; HDS supports modification and extension of structures previously created, as well as functions such as deletion, copying, and renaming. All information stored in HDS files is portable between the machines on which HDS is implemented. Thus, there are no format conversion problems when moving between machines. HDS can write files in a private binary format (version 4), or be layered on top of HDF5 (version 5).
Hierarchical video summarization
Ratakonda, Krishna; Sezan, M. Ibrahim; Crinon, Regis J.
1998-12-01
We address the problem of key-frame summarization of vide in the absence of any a priori information about its content. This is a common problem that is encountered in home videos. We propose a hierarchical key-frame summarization algorithm where a coarse-to-fine key-frame summary is generated. A hierarchical key-frame summary facilitates multi-level browsing where the user can quickly discover the content of the video by accessing its coarsest but most compact summary and then view a desired segment of the video with increasingly more detail. At the finest level, the summary is generated on the basis of color features of video frames, using an extension of a recently proposed key-frame extraction algorithm. The finest level key-frames are recursively clustered using a novel pairwise K-means clustering approach with temporal consecutiveness constraint. We also address summarization of MPEG-2 compressed video without fully decoding the bitstream. We also propose efficient mechanisms that facilitate decoding the video when the hierarchical summary is utilized in browsing and playback of video segments starting at selected key-frames.
Hierarchical matrix techniques for the solution of elliptic equations
Chávez, Gustavo
2014-05-04
Hierarchical matrix approximations are a promising tool for approximating low-rank matrices given the compactness of their representation and the economy of the operations between them. Integral and differential operators have been the major applications of this technology, but they can be applied into other areas where low-rank properties exist. Such is the case of the Block Cyclic Reduction algorithm, which is used as a direct solver for the constant-coefficient Poisson quation. We explore the variable-coefficient case, also using Block Cyclic reduction, with the addition of Hierarchical Matrices to represent matrix blocks, hence improving the otherwise O(N2) algorithm, into an efficient O(N) algorithm.
Free-Energy Bounds for Hierarchical Spin Models
Castellana, Michele; Barra, Adriano; Guerra, Francesco
2014-04-01
In this paper we study two non-mean-field (NMF) spin models built on a hierarchical lattice: the hierarchical Edward-Anderson model (HEA) of a spin glass, and Dyson's hierarchical model (DHM) of a ferromagnet. For the HEA, we prove the existence of the thermodynamic limit of the free energy and the replica-symmetry-breaking (RSB) free-energy bounds previously derived for the Sherrington-Kirkpatrick model of a spin glass. These RSB mean-field bounds are exact only if the order-parameter fluctuations (OPF) vanish: given that such fluctuations are not negligible in NMF models, we develop a novel strategy to tackle part of OPF in hierarchical models. The method is based on absorbing part of OPF of a block of spins into an effective Hamiltonian of the underlying spin blocks. We illustrate this method for DHM and show that, compared to the mean-field bound for the free energy, it provides a tighter NMF bound, with a critical temperature closer to the exact one. To extend this method to the HEA model, a suitable generalization of Griffith's correlation inequalities for Ising ferromagnets is needed: since correlation inequalities for spin glasses are still an open topic, we leave the extension of this method to hierarchical spin glasses as a future perspective.
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ The Chadong Block, located in the east of Qaidam Basin, Qinghai Province, covers an area of 12 452 km2. It is bounded by Kunlum Mountains in the south and the northwest is closely adjacent to Aimunike Mountain.Rivers are widely distributed, which always run in NWSE direction, including the Sulunguole, Qaidam and Haluwusu Rivers. The traffic condition is good, the Qinghai-Tibet highway stretching through the whole area and the Lan-Qing railway, 20-50 km away from the block, passing from north to west. A lot of Mongolia minority people have settled there, of which herdsmen always live nearby the Qaidam River drainage area.
Detecting Hierarchical Structure in Networks
DEFF Research Database (Denmark)
Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard;
2012-01-01
a generative Bayesian model that is able to infer whether hierarchies are present or not from a hypothesis space encompassing all types of hierarchical tree structures. For efficient inference we propose a collapsed Gibbs sampling procedure that jointly infers a partition and its hierarchical structure......Many real-world networks exhibit hierarchical organization. Previous models of hierarchies within relational data has focused on binary trees; however, for many networks it is unknown whether there is hierarchical structure, and if there is, a binary tree might not account well for it. We propose....... On synthetic and real data we demonstrate that our model can detect hierarchical structure leading to better link-prediction than competing models. Our model can be used to detect if a network exhibits hierarchical structure, thereby leading to a better comprehension and statistical account the network....
Context updates are hierarchical
Directory of Open Access Journals (Sweden)
Anton Karl Ingason
2016-10-01
Full Text Available This squib studies the order in which elements are added to the shared context of interlocutors in a conversation. It focuses on context updates within one hierarchical structure and argues that structurally higher elements are entered into the context before lower elements, even if the structurally higher elements are pronounced after the lower elements. The crucial data are drawn from a comparison of relative clauses in two head-initial languages, English and Icelandic, and two head-final languages, Korean and Japanese. The findings have consequences for any theory of a dynamic semantics.
Understanding dwarf galaxies as galactic building blocks
Tosi, M P
2003-01-01
This is a summary of a general discussion held during the third EuroConference on galaxy evolution. Various observational features of the stellar populations in present--day dwarf galaxies were presented to introduce the discussion on the possibility that these systems be the main building blocks of spiral and elliptical galaxies. Many people in the audience turned out to think that the inconsistencies among the observed properties of large and dwarf galaxies are too many to believe that the former are built up only by means of successive accretions of the latter. However, theorists of hierarchical galaxy formation suggested that present--day dwarfs are not representative of the galactic building blocks, which may be completely invisible nowadays. Some of them suggested that, contrary to what is usually assumed in hierarchical modelling, the actual building blocks were still fully gaseous systems when their major mergers occurred. If this is the case, then most of the inconsistencies can be overcome, and the ...
Fingerprint Recognition Using Minutia Score Matching
J, Ravi; R, Venugopal K
2010-01-01
The popular Biometric used to authenticate a person is Fingerprint which is unique and permanent throughout a person's life. A minutia matching is widely used for fingerprint recognition and can be classified as ridge ending and ridge bifurcation. In this paper we projected Fingerprint Recognition using Minutia Score Matching method (FRMSM). For Fingerprint thinning, the Block Filter is used, which scans the image at the boundary to preserves the quality of the image and extract the minutiae from the thinned image. The false matching ratio is better compared to the existing algorithm.
Statistics of polarisation matching
Naus, H.W.L.; Zwamborn, A.P.M.
2014-01-01
The reception of electromagnetic signals depends on the polarisation matching of the transmitting and receiving antenna. The practical matching differs from the theoretical one because of the noise deterioration of the transmitted and eventually received electromagnetic field. In other applications,
Hierarchical partial order ranking.
Carlsen, Lars
2008-09-01
Assessing the potential impact on environmental and human health from the production and use of chemicals or from polluted sites involves a multi-criteria evaluation scheme. A priori several parameters are to address, e.g., production tonnage, specific release scenarios, geographical and site-specific factors in addition to various substance dependent parameters. Further socio-economic factors may be taken into consideration. The number of parameters to be included may well appear to be prohibitive for developing a sensible model. The study introduces hierarchical partial order ranking (HPOR) that remedies this problem. By HPOR the original parameters are initially grouped based on their mutual connection and a set of meta-descriptors is derived representing the ranking corresponding to the single groups of descriptors, respectively. A second partial order ranking is carried out based on the meta-descriptors, the final ranking being disclosed though average ranks. An illustrative example on the prioritization of polluted sites is given.
Trees and Hierarchical Structures
Haeseler, Arndt
1990-01-01
The "raison d'etre" of hierarchical dustering theory stems from one basic phe nomenon: This is the notorious non-transitivity of similarity relations. In spite of the fact that very often two objects may be quite similar to a third without being that similar to each other, one still wants to dassify objects according to their similarity. This should be achieved by grouping them into a hierarchy of non-overlapping dusters such that any two objects in ~ne duster appear to be more related to each other than they are to objects outside this duster. In everyday life, as well as in essentially every field of scientific investigation, there is an urge to reduce complexity by recognizing and establishing reasonable das sification schemes. Unfortunately, this is counterbalanced by the experience of seemingly unavoidable deadlocks caused by the existence of sequences of objects, each comparatively similar to the next, but the last rather different from the first.
Hierarchical Affinity Propagation
Givoni, Inmar; Frey, Brendan J
2012-01-01
Affinity propagation is an exemplar-based clustering algorithm that finds a set of data-points that best exemplify the data, and associates each datapoint with one exemplar. We extend affinity propagation in a principled way to solve the hierarchical clustering problem, which arises in a variety of domains including biology, sensor networks and decision making in operational research. We derive an inference algorithm that operates by propagating information up and down the hierarchy, and is efficient despite the high-order potentials required for the graphical model formulation. We demonstrate that our method outperforms greedy techniques that cluster one layer at a time. We show that on an artificial dataset designed to mimic the HIV-strain mutation dynamics, our method outperforms related methods. For real HIV sequences, where the ground truth is not available, we show our method achieves better results, in terms of the underlying objective function, and show the results correspond meaningfully to geographi...
Optimisation by hierarchical search
Zintchenko, Ilia; Hastings, Matthew; Troyer, Matthias
2015-03-01
Finding optimal values for a set of variables relative to a cost function gives rise to some of the hardest problems in physics, computer science and applied mathematics. Although often very simple in their formulation, these problems have a complex cost function landscape which prevents currently known algorithms from efficiently finding the global optimum. Countless techniques have been proposed to partially circumvent this problem, but an efficient method is yet to be found. We present a heuristic, general purpose approach to potentially improve the performance of conventional algorithms or special purpose hardware devices by optimising groups of variables in a hierarchical way. We apply this approach to problems in combinatorial optimisation, machine learning and other fields.
How hierarchical is language use?
Frank, Stefan L.; Bod, Rens; Christiansen, Morten H.
2012-01-01
It is generally assumed that hierarchical phrase structure plays a central role in human language. However, considerations of simplicity and evolutionary continuity suggest that hierarchical structure should not be invoked too hastily. Indeed, recent neurophysiological, behavioural and computational studies show that sequential sentence structure has considerable explanatory power and that hierarchical processing is often not involved. In this paper, we review evidence from the recent literature supporting the hypothesis that sequential structure may be fundamental to the comprehension, production and acquisition of human language. Moreover, we provide a preliminary sketch outlining a non-hierarchical model of language use and discuss its implications and testable predictions. If linguistic phenomena can be explained by sequential rather than hierarchical structure, this will have considerable impact in a wide range of fields, such as linguistics, ethology, cognitive neuroscience, psychology and computer science. PMID:22977157
How hierarchical is language use?
Frank, Stefan L; Bod, Rens; Christiansen, Morten H
2012-11-22
It is generally assumed that hierarchical phrase structure plays a central role in human language. However, considerations of simplicity and evolutionary continuity suggest that hierarchical structure should not be invoked too hastily. Indeed, recent neurophysiological, behavioural and computational studies show that sequential sentence structure has considerable explanatory power and that hierarchical processing is often not involved. In this paper, we review evidence from the recent literature supporting the hypothesis that sequential structure may be fundamental to the comprehension, production and acquisition of human language. Moreover, we provide a preliminary sketch outlining a non-hierarchical model of language use and discuss its implications and testable predictions. If linguistic phenomena can be explained by sequential rather than hierarchical structure, this will have considerable impact in a wide range of fields, such as linguistics, ethology, cognitive neuroscience, psychology and computer science.
Associative Hierarchical Random Fields.
Ladický, L'ubor; Russell, Chris; Kohli, Pushmeet; Torr, Philip H S
2014-06-01
This paper makes two contributions: the first is the proposal of a new model-The associative hierarchical random field (AHRF), and a novel algorithm for its optimization; the second is the application of this model to the problem of semantic segmentation. Most methods for semantic segmentation are formulated as a labeling problem for variables that might correspond to either pixels or segments such as super-pixels. It is well known that the generation of super pixel segmentations is not unique. This has motivated many researchers to use multiple super pixel segmentations for problems such as semantic segmentation or single view reconstruction. These super-pixels have not yet been combined in a principled manner, this is a difficult problem, as they may overlap, or be nested in such a way that the segmentations form a segmentation tree. Our new hierarchical random field model allows information from all of the multiple segmentations to contribute to a global energy. MAP inference in this model can be performed efficiently using powerful graph cut based move making algorithms. Our framework generalizes much of the previous work based on pixels or segments, and the resulting labelings can be viewed both as a detailed segmentation at the pixel level, or at the other extreme, as a segment selector that pieces together a solution like a jigsaw, selecting the best segments from different segmentations as pieces. We evaluate its performance on some of the most challenging data sets for object class segmentation, and show that this ability to perform inference using multiple overlapping segmentations leads to state-of-the-art results.
Matching Through Position Auctions
Terence Johnson
2009-01-01
This paper studies how an intermediary should design two-sided matching markets when agents are privately informed about their quality as a partner and can make payments to the intermediary. Using a mechanism design approach, I derive sufficient conditions for assortative matching to be profit- or welfare-maximizing, and then show how to implement the optimal match and payments through two-sided position auctions. This sharpens our understanding of intermediated matching markets by clarifying...
Modeling hierarchical structures - Hierarchical Linear Modeling using MPlus
Jelonek, M
2006-01-01
The aim of this paper is to present the technique (and its linkage with physics) of overcoming problems connected to modeling social structures, which are typically hierarchical. Hierarchical Linear Models provide a conceptual and statistical mechanism for drawing conclusions regarding the influence of phenomena at different levels of analysis. In the social sciences it is used to analyze many problems such as educational, organizational or market dilemma. This paper introduces the logic of modeling hierarchical linear equations and estimation based on MPlus software. I present my own model to illustrate the impact of different factors on school acceptation level.
Study on Hierarchical Structure of Detailed Control Planning
Institute of Scientific and Technical Information of China (English)
2010-01-01
Using case studies,this paper analyzes the characteristics of detailed control planning and its hierarchical controls,the form and composition of plan content,and methodological innovations.It then suggests improvements to the planning structure that are oriented at adaptability,fairness,centrality,and scientific principles with regard to the content,methods,and results of the planning.Regarding the hierarchical control system,the paper suggests that the detailed control plan should be composed of "block planning" and "plot planning".It is believed that through a combination of block and plot planning,the problem of joining long-term and short-term planning will be solved and it will be possible to address the need for adjustment and revision of detailed control plan.
Hierarchical Resource Allocation in Femtocell Networks using Graph Algorithms
Sadr, Sanam
2012-01-01
This paper presents a hierarchical approach to resource allocation in open-access femtocell networks. The major challenge in femtocell networks is interference management which in our system, based on the Long Term Evolution (LTE) standard, translates to which user should be allocated which physical resource block (or fraction thereof) from which femtocell access point (FAP). The globally optimal solution requires integer programming and is mathematically intractable. We propose a hierarchical three-stage solution: first, the load of each FAP is estimated considering the number of users connected to the FAP, their average channel gain and required data rates. Second, based on each FAP's load, the physical resource blocks (PRBs) are allocated to FAPs in a manner that minimizes the interference by coloring the modified interference graph. Finally, the resource allocation is performed at each FAP considering users' instantaneous channel gain. The two major advantages of this suboptimal approach are the significa...
Best matching theory & applications
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...
Hierarchical Picture Coding Using Quadtree Decomposition
Buhler, Yves; Fortier, Michel
1987-10-01
A new hierarchical encoding scheme for grey-level pictures is presented here. The picture field is split by a modified quadtree algorithm into blocks of size 32 x 32, 16 x 16, 8 x 8 and 4 x 4 pels, according to their subjective importance in the picture. The larger cells, of size 32 x 32, 16 x 16 and 8 x 8 pels, corresponding to uniform or low-detailed areas, are coded at a very low rates by block truncation in the Discrete Cosine Transform field. The smallest blocks, representing mainly high-detailed areas of the like edges or textures are coded with a multi-codebook vector quantization scheme. Due to its structure, such an encoding scheme is especially well adapted for coding "head and shoulders" pictures, mostly encountered in videophone or videoconference application, where large areas of background may appear. Concerning the vector quantization, several techniques were investigated in order to improve the subjective quality and to reduce the search time through the codebooks. This permits a faster elaboration of the codebooks. Results are presented with bit-rates ranging from 0.4 to 0.8 bits/pel depending on the picture complexity.
3D Printing of Hierarchical Silk Fibroin Structures.
Sommer, Marianne R; Schaffner, Manuel; Carnelli, Davide; Studart, André R
2016-12-21
Like many other natural materials, silk is hierarchically structured from the amino acid level up to the cocoon or spider web macroscopic structures. Despite being used industrially in a number of applications, hierarchically structured silk fibroin objects with a similar degree of architectural control as in natural structures have not been produced yet due to limitations in fabrication processes. In a combined top-down and bottom-up approach, we exploit the freedom in macroscopic design offered by 3D printing and the template-guided assembly of ink building blocks at the meso- and nanolevel to fabricate hierarchical silk porous materials with unprecedented structural control. Pores with tunable sizes in the range 40-350 μm are generated by adding sacrificial organic microparticles as templates to a silk fibroin-based ink. Commercially available wax particles or monodisperse polycaprolactone made by microfluidics can be used as microparticle templates. Since closed pores are generated after template removal, an ultrasonication treatment can optionally be used to achieve open porosity. Such pore templating particles can be further modified with nanoparticles to create a hierarchical template that results in porous structures with a defined nanotopography on the pore walls. The hierarchically porous silk structures obtained with this processing technique can potentially be utilized in various application fields from structural materials to thermal insulation to tissue engineering scaffolds.
Wavelet based hierarchical coding scheme for radar image compression
Sheng, Wen; Jiao, Xiaoli; He, Jifeng
2007-12-01
This paper presents a wavelet based hierarchical coding scheme for radar image compression. Radar signal is firstly quantized to digital signal, and reorganized as raster-scanned image according to radar's repeated period frequency. After reorganization, the reformed image is decomposed to image blocks with different frequency band by 2-D wavelet transformation, each block is quantized and coded by the Huffman coding scheme. A demonstrating system is developed, showing that under the requirement of real time processing, the compression ratio can be very high, while with no significant loss of target signal in restored radar image.
Modeling hierarchical structures - Hierarchical Linear Modeling using MPlus
Jelonek, Magdalena
2006-01-01
The aim of this paper is to present the technique (and its linkage with physics) of overcoming problems connected to modeling social structures, which are typically hierarchical. Hierarchical Linear Models provide a conceptual and statistical mechanism for drawing conclusions regarding the influence of phenomena at different levels of analysis. In the social sciences it is used to analyze many problems such as educational, organizational or market dilemma. This paper introduces the logic of m...
Hierarchical Parallelization of Gene Differential Association Analysis
Directory of Open Access Journals (Sweden)
Dwarkadas Sandhya
2011-09-01
Full Text Available Abstract Background Microarray gene differential expression analysis is a widely used technique that deals with high dimensional data and is computationally intensive for permutation-based procedures. Microarray gene differential association analysis is even more computationally demanding and must take advantage of multicore computing technology, which is the driving force behind increasing compute power in recent years. In this paper, we present a two-layer hierarchical parallel implementation of gene differential association analysis. It takes advantage of both fine- and coarse-grain (with granularity defined by the frequency of communication parallelism in order to effectively leverage the non-uniform nature of parallel processing available in the cutting-edge systems of today. Results Our results show that this hierarchical strategy matches data sharing behavior to the properties of the underlying hardware, thereby reducing the memory and bandwidth needs of the application. The resulting improved efficiency reduces computation time and allows the gene differential association analysis code to scale its execution with the number of processors. The code and biological data used in this study are downloadable from http://www.urmc.rochester.edu/biostat/people/faculty/hu.cfm. Conclusions The performance sweet spot occurs when using a number of threads per MPI process that allows the working sets of the corresponding MPI processes running on the multicore to fit within the machine cache. Hence, we suggest that practitioners follow this principle in selecting the appropriate number of MPI processes and threads within each MPI process for their cluster configurations. We believe that the principles of this hierarchical approach to parallelization can be utilized in the parallelization of other computationally demanding kernels.
Petrov, Romain G; Boskri, Abdelkarim; Folcher, Jean-Pierre; Lagarde, Stephane; Bresson, Yves; Benkhaldoum, Zouhair; Lazrek, Mohamed; Rakshit, Suvendu
2014-01-01
The limiting magnitude is a key issue for optical interferometry. Pairwise fringe trackers based on the integrated optics concepts used for example in GRAVITY seem limited to about K=10.5 with the 8m Unit Telescopes of the VLTI, and there is a general "common sense" statement that the efficiency of fringe tracking, and hence the sensitivity of optical interferometry, must decrease as the number of apertures increases, at least in the near infrared where we are still limited by detector readout noise. Here we present a Hierarchical Fringe Tracking (HFT) concept with sensitivity at least equal to this of a two apertures fringe trackers. HFT is based of the combination of the apertures in pairs, then in pairs of pairs then in pairs of groups. The key HFT module is a device that behaves like a spatial filter for two telescopes (2TSF) and transmits all or most of the flux of a cophased pair in a single mode beam. We give an example of such an achromatic 2TSF, based on very broadband dispersed fringes analyzed by g...
Tunesi, Luca; Armbruster, Philippe
2004-02-01
The objective of this paper is to demonstrate a suitable hierarchical networking solution to improve capabilities and performances of space systems, with significant recurrent costs saving and more efficient design & manufacturing flows. Classically, a satellite can be split in two functional sub-systems: the platform and the payload complement. The platform is in charge of providing power, attitude & orbit control and up/down-link services, whereas the payload represents the scientific and/or operational instruments/transponders and embodies the objectives of the mission. One major possibility to improve the performance of payloads, by limiting the data return to pertinent information, is to process data on board thanks to a proper implementation of the payload data system. In this way, it is possible to share non-recurring development costs by exploiting a system that can be adopted by the majority of space missions. It is believed that the Modular and Scalable Payload Data System, under development by ESA, provides a suitable solution to fulfil a large range of future mission requirements. The backbone of the system is the standardised high data rate SpaceWire network http://www.ecss.nl/. As complement, a lower speed command and control bus connecting peripherals is required. For instance, at instrument level, there is a need for a "local" low complexity bus, which gives the possibility to command and control sensors and actuators. Moreover, most of the connections at sub-system level are related to discrete signals management or simple telemetry acquisitions, which can easily and efficiently be handled by a local bus. An on-board hierarchical network can therefore be defined by interconnecting high-speed links and local buses. Additionally, it is worth stressing another important aspect of the design process: Agencies and ESA in particular are frequently confronted with a big consortium of geographically spread companies located in different countries, each one
Hierarchical Reverberation Mapping
Brewer, Brendon J
2013-01-01
Reverberation mapping (RM) is an important technique in studies of active galactic nuclei (AGN). The key idea of RM is to measure the time lag $\\tau$ between variations in the continuum emission from the accretion disc and subsequent response of the broad line region (BLR). The measurement of $\\tau$ is typically used to estimate the physical size of the BLR and is combined with other measurements to estimate the black hole mass $M_{\\rm BH}$. A major difficulty with RM campaigns is the large amount of data needed to measure $\\tau$. Recently, Fine et al (2012) introduced a new approach to RM where the BLR light curve is sparsely sampled, but this is counteracted by observing a large sample of AGN, rather than a single system. The results are combined to infer properties of the sample of AGN. In this letter we implement this method using a hierarchical Bayesian model and contrast this with the results from the previous stacked cross-correlation technique. We find that our inferences are more precise and allow fo...
Hierarchical Subtopic Segmentation of Web Document
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
The paper proposes a novel method for subtopics segmentation of Web document. An effective retrieval results may be obtained by using subtopics segmentation. The proposed method can segment hierarchically subtopics and identify the boundary of each subtopic. Based on the term frequency matrix, the method measures the similarity between adjacent blocks, such as paragraphs, passages. In the real-world sample experiment, the macro-averaged precision and recall reach 73.4% and 82.5%, and the micro-averaged precision and recall reach 72.9% and 83.1%. Moreover, this method is equally efficient to other Asian languages such as Japanese and Korean, as well as other western languages.
Bimodal Color Distribution in Hierarchical Galaxy Formation
Menci, N; Giallongo, E; Salimbeni, S
2005-01-01
We show how the observed bimodality in the color distribution of galaxies can be explained in the framework of the hierarchical clustering picture in terms of the interplay between the properties of the merging histories and the feedback/star-formation processes in the progenitors of local galaxies. Using a semi-analytic model of hierarchical galaxy formation, we compute the color distributions of galaxies with different luminosities and compare them with the observations. Our fiducial model matches the fundamental properties of the observed distributions, namely: 1) the distribution of objects brighter than M_r = -18 is clearly bimodal, with a fraction of red objects increasing with luminosity; 2) for objects brighter than M_r = -21 the color distribution is dominated by red objects with color u-r = 2.2-2.4; 3) the spread on the distribution of the red population is smaller than that of the blue population; 4) the fraction of red galaxies is larger in denser environments, even for low-luminosity objects; 5) ...
A hierarchical algorithm for molecular similarity (H-FORMS).
Ramirez-Manzanares, Alonso; Peña, Joaquin; Azpiroz, Jon M; Merino, Gabriel
2015-07-15
A new hierarchical method to determine molecular similarity is introduced. The goal of this method is to detect if a pair of molecules has the same structure by estimating a rigid transformation that aligns the molecules and a correspondence function that matches their atoms. The algorithm firstly detect similarity based on the global spatial structure. If this analysis is not sufficient, the algorithm computes novel local structural rotation-invariant descriptors for the atom neighborhood and uses this information to match atoms. Two strategies (deterministic and stochastic) on the matching based alignment computation are tested. As a result, the atom-matching based on local similarity indexes decreases the number of testing trials and significantly reduces the dimensionality of the Hungarian assignation problem. The experiments on well-known datasets show that our proposal outperforms state-of-the-art methods in terms of the required computational time and accuracy. © 2015 Wiley Periodicals, Inc.
Hierarchical materials: Background and perspectives
DEFF Research Database (Denmark)
2016-01-01
Hierarchical design draws inspiration from analysis of biological materials and has opened new possibilities for enhancing performance and enabling new functionalities and extraordinary properties. With the development of nanotechnology, the necessary technological requirements for the manufactur...
Hierarchical clustering for graph visualization
Clémençon, Stéphan; Rossi, Fabrice; Tran, Viet Chi
2012-01-01
This paper describes a graph visualization methodology based on hierarchical maximal modularity clustering, with interactive and significant coarsening and refining possibilities. An application of this method to HIV epidemic analysis in Cuba is outlined.
Gal, Avigdor
2011-01-01
Schema matching is the task of providing correspondences between concepts describing the meaning of data in various heterogeneous, distributed data sources. Schema matching is one of the basic operations required by the process of data and schema integration, and thus has a great effect on its outcomes, whether these involve targeted content delivery, view integration, database integration, query rewriting over heterogeneous sources, duplicate data elimination, or automatic streamlining of workflow activities that involve heterogeneous data sources. Although schema matching research has been o
Functional annotation of hierarchical modularity.
Directory of Open Access Journals (Sweden)
Kanchana Padmanabhan
Full Text Available In biological networks of molecular interactions in a cell, network motifs that are biologically relevant are also functionally coherent, or form functional modules. These functionally coherent modules combine in a hierarchical manner into larger, less cohesive subsystems, thus revealing one of the essential design principles of system-level cellular organization and function-hierarchical modularity. Arguably, hierarchical modularity has not been explicitly taken into consideration by most, if not all, functional annotation systems. As a result, the existing methods would often fail to assign a statistically significant functional coherence score to biologically relevant molecular machines. We developed a methodology for hierarchical functional annotation. Given the hierarchical taxonomy of functional concepts (e.g., Gene Ontology and the association of individual genes or proteins with these concepts (e.g., GO terms, our method will assign a Hierarchical Modularity Score (HMS to each node in the hierarchy of functional modules; the HMS score and its p-value measure functional coherence of each module in the hierarchy. While existing methods annotate each module with a set of "enriched" functional terms in a bag of genes, our complementary method provides the hierarchical functional annotation of the modules and their hierarchically organized components. A hierarchical organization of functional modules often comes as a bi-product of cluster analysis of gene expression data or protein interaction data. Otherwise, our method will automatically build such a hierarchy by directly incorporating the functional taxonomy information into the hierarchy search process and by allowing multi-functional genes to be part of more than one component in the hierarchy. In addition, its underlying HMS scoring metric ensures that functional specificity of the terms across different levels of the hierarchical taxonomy is properly treated. We have evaluated our
Directory of Open Access Journals (Sweden)
E. J. Farrell
1987-01-01
Full Text Available Explicit recurrences are derived for the matching polynomials of the basic types of hexagonal cacti, the linear cactus and the star cactus and also for an associated graph, called the hexagonal crown. Tables of the polynomials are given for each type of graph. Explicit formulae are then obtained for the number of defect-d matchings in the graphs, for various values of d. In particular, formulae are derived for the number of perfect matchings in all three types of graphs. Finally, results are given for the total number of matchings in the graphs.
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.
Hierarchical architecture of active knits
Abel, Julianna; Luntz, Jonathan; Brei, Diann
2013-12-01
Nature eloquently utilizes hierarchical structures to form the world around us. Applying the hierarchical architecture paradigm to smart materials can provide a basis for a new genre of actuators which produce complex actuation motions. One promising example of cellular architecture—active knits—provides complex three-dimensional distributed actuation motions with expanded operational performance through a hierarchically organized structure. The hierarchical structure arranges a single fiber of active material, such as shape memory alloys (SMAs), into a cellular network of interlacing adjacent loops according to a knitting grid. This paper defines a four-level hierarchical classification of knit structures: the basic knit loop, knit patterns, grid patterns, and restructured grids. Each level of the hierarchy provides increased architectural complexity, resulting in expanded kinematic actuation motions of active knits. The range of kinematic actuation motions are displayed through experimental examples of different SMA active knits. The results from this paper illustrate and classify the ways in which each level of the hierarchical knit architecture leverages the performance of the base smart material to generate unique actuation motions, providing necessary insight to best exploit this new actuation paradigm.
Advanced hierarchical distance sampling
Royle, Andy
2016-01-01
In this chapter, we cover a number of important extensions of the basic hierarchical distance-sampling (HDS) framework from Chapter 8. First, we discuss the inclusion of “individual covariates,” such as group size, in the HDS model. This is important in many surveys where animals form natural groups that are the primary observation unit, with the size of the group expected to have some influence on detectability. We also discuss HDS integrated with time-removal and double-observer or capture-recapture sampling. These “combined protocols” can be formulated as HDS models with individual covariates, and thus they have a commonality with HDS models involving group structure (group size being just another individual covariate). We cover several varieties of open-population HDS models that accommodate population dynamics. On one end of the spectrum, we cover models that allow replicate distance sampling surveys within a year, which estimate abundance relative to availability and temporary emigration through time. We consider a robust design version of that model. We then consider models with explicit dynamics based on the Dail and Madsen (2011) model and the work of Sollmann et al. (2015). The final major theme of this chapter is relatively newly developed spatial distance sampling models that accommodate explicit models describing the spatial distribution of individuals known as Point Process models. We provide novel formulations of spatial DS and HDS models in this chapter, including implementations of those models in the unmarked package using a hack of the pcount function for N-mixture models.
Renormalization of Hierarchically Interacting Isotropic Diffusions
den Hollander, F.; Swart, J. M.
1998-10-01
We study a renormalization transformation arising in an infinite system of interacting diffusions. The components of the system are labeled by the N-dimensional hierarchical lattice ( N≥2) and take values in the closure of a compact convex set bar D subset {R}^d (d ≥slant 1). Each component starts at some θ ∈ D and is subject to two motions: (1) an isotropic diffusion according to a local diffusion rate g: bar D to [0,infty ] chosen from an appropriate class; (2) a linear drift toward an average of the surrounding components weighted according to their hierarchical distance. In the local mean-field limit N→∞, block averages of diffusions within a hierarchical distance k, on an appropriate time scale, are expected to perform a diffusion with local diffusion rate F ( k) g, where F^{(k)} g = (F_{c_k } circ ... circ F_{c_1 } ) g is the kth iterate of renormalization transformations F c ( c>0) applied to g. Here the c k measure the strength of the interaction at hierarchical distance k. We identify F c and study its orbit ( F ( k) g) k≥0. We show that there exists a "fixed shape" g* such that lim k→∞ σk F ( k) g = g* for all g, where the σ k are normalizing constants. In terms of the infinite system, this property means that there is complete universal behavior on large space-time scales. Our results extend earlier work for d = 1 and bar D = [0,1], resp. [0, ∞). The renormalization transformation F c is defined in terms of the ergodic measure of a d-dimensional diffusion. In d = 1 this diffusion allows a Yamada-Watanabe-type coupling, its ergodic measure is reversible, and the renormalization transformation F c is given by an explicit formula. All this breaks down in d≥2, which complicates the analysis considerably and forces us to new methods. Part of our results depend on a certain martingale problem being well-posed.
Topological structures of boundary value problems in block elements
Babeshko, V. A.; Evdokimova, O. V.; Babeshko, O. M.
2016-10-01
Block structures are considered; a boundary value problem for a system of inhomogeneous partial differential equations with constant coefficients is formulated in each block of a structure. The problem of matching solutions to boundary value problems in blocks with each other by topological study of the properties of solutions in the block structure is examined in the conditions of correct solvability of boundary value problems in blocks of the block structure. Some new properties of solutions to boundary value problems in block structures are found that are important for applications.
A sliding coherence window technique for hierarchical detection of continuous gravitational waves
Pletsch, Holger J
2011-01-01
A novel hierarchical semicoherent technique is presented for all-sky surveys for continuous gravitational-wave sources, such as rapidly spinning non-axisymmetric neutron stars. Analyzing year-long detector data sets over realistic ranges of parameter space using fully-coherent matched-filtering is computationally prohibitive. Thus more efficient, so-called hierarchical techniques are essential. Traditionally, the standard hierarchical approach consists of dividing the data into non-overlapping segments of which each is coherently analyzed and subsequently the matched-filter outputs from all segments are combined incoherently. The present work proposes to break the data into subsegments being shorter than the desired maximum coherence time span (size of the coherence window). Then matched-filter outputs from the different subsegments are efficiently combined by "sliding" the coherence window in time: Subsegments whose time-stamps are closer than coherence window size are combined coherently, otherwise incohere...
Guided hierarchical co-assembly of soft patchy nanoparticles
Gröschel, André H.; Walther, Andreas; Löbling, Tina I.; Schacher, Felix H.; Schmalz, Holger; Müller, Axel H. E.
2013-11-01
The concept of hierarchical bottom-up structuring commonly encountered in natural materials provides inspiration for the design of complex artificial materials with advanced functionalities. Natural processes have achieved the orchestration of multicomponent systems across many length scales with very high precision, but man-made self-assemblies still face obstacles in realizing well-defined hierarchical structures. In particle-based self-assembly, the challenge is to program symmetries and periodicities of superstructures by providing monodisperse building blocks with suitable shape anisotropy or anisotropic interaction patterns (`patches'). Irregularities in particle architecture are intolerable because they generate defects that amplify throughout the hierarchical levels. For patchy microscopic hard colloids, this challenge has been approached by using top-down methods (such as metal shading or microcontact printing), enabling molecule-like directionality during aggregation. However, both top-down procedures and particulate systems based on molecular assembly struggle to fabricate patchy particles controllably in the desired size regime (10-100nm). Here we introduce the co-assembly of dynamic patchy nanoparticles--that is, soft patchy nanoparticles that are intrinsically self-assembled and monodisperse--as a modular approach for producing well-ordered binary and ternary supracolloidal hierarchical assemblies. We bridge up to three hierarchical levels by guiding triblock terpolymers (length scale ~10nm) to form soft patchy nanoparticles (20-50nm) of different symmetries that, in combination, co-assemble into substructured, compartmentalized materials (>10μm) with predictable and tunable nanoscale periodicities. We establish how molecular control over polymer composition programs the building block symmetries and regulates particle positioning, offering a route to well-ordered mixed mesostructures of high complexity.
Ontology Matching Across Domains
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
Caetano, Tiberio S; Cheng, Li; Le, Quoc V; Smola, Alex J
2008-01-01
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the `labels' are ma...
Energy Technology Data Exchange (ETDEWEB)
Theiler, James P [Los Alamos National Laboratory
2009-01-01
Following an analogous distinction in statistical hypothesis testing, we investigate variants of machine learning where the training set comes in matched pairs. We demonstrate that even conventional classifiers can exhibit improved performance when the input data has a matched-pair structure. Online algorithms, in particular, converge quicker when the data is presented in pairs. In some scenarios (such as the weak signal detection problem), matched pairs can be generated from independent samples, with the effect not only doubling the nominal size of the training set, but of providing the structure that leads to better learning. A family of 'dipole' algorithms is introduced that explicitly takes advantage of matched-pair structure in the input data and leads to further performance gains. Finally, we illustrate the application of matched-pair learning to chemical plume detection in hyperspectral imagery.
Batched QR and SVD Algorithms on GPUs with Applications in Hierarchical Matrix Compression
Halim Boukaram, Wajih
2017-09-14
We present high performance implementations of the QR and the singular value decomposition of a batch of small matrices hosted on the GPU with applications in the compression of hierarchical matrices. The one-sided Jacobi algorithm is used for its simplicity and inherent parallelism as a building block for the SVD of low rank blocks using randomized methods. We implement multiple kernels based on the level of the GPU memory hierarchy in which the matrices can reside and show substantial speedups against streamed cuSOLVER SVDs. The resulting batched routine is a key component of hierarchical matrix compression, opening up opportunities to perform H-matrix arithmetic efficiently on GPUs.
Hierarchical topic modeling with nested hierarchical Dirichlet process
Institute of Scientific and Technical Information of China (English)
Yi-qun DING; Shan-ping LI; Zhen ZHANG; Bin SHEN
2009-01-01
This paper deals with the statistical modeling of latent topic hierarchies in text corpora. The height of the topic tree is assumed as fixed, while the number of topics on each level as unknown a priori and to be inferred from data. Taking a nonparametric Bayesian approach to this problem, we propose a new probabilistic generative model based on the nested hierarchical Dirichlet process (nHDP) and present a Markov chain Monte Carlo sampling algorithm for the inference of the topic tree structure as welt as the word distribution of each topic and topic distribution of each document. Our theoretical analysis and experiment results show that this model can produce a more compact hierarchical topic structure and captures more free-grained topic relationships compared to the hierarchical latent Dirichlet allocation model.
Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J
2009-06-01
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.
Jain, Anil K; Feng, Jianjiang
2011-01-01
Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and rolled fingerprint matching, latent fingerprint matching continues to be a difficult problem. Poor quality of ridge impressions, small finger area, and large nonlinear distortion are the main difficulties in latent fingerprint matching compared to plain or rolled fingerprint matching. We propose a system for matching latent fingerprints found at crime scenes to rolled fingerprints enrolled in law enforcement databases. In addition to minutiae, we also use extended features, including singularity, ridge quality map, ridge flow map, ridge wavelength map, and skeleton. We tested our system by matching 258 latents in the NIST SD27 database against a background database of 29,257 rolled fingerprints obtained by combining the NIST SD4, SD14, and SD27 databases. The minutiae-based baseline rank-1 identification rate of 34.9 percent was improved to 74 percent when extended features were used. In order to evaluate the relative importance of each extended feature, these features were incrementally used in the order of their cost in marking by latent experts. The experimental results indicate that singularity, ridge quality map, and ridge flow map are the most effective features in improving the matching accuracy.
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 – speedup...... over traditional algorithms that examine each character individually. Our solution can be efficiently implemented, unlike prior theoretical packed string matching work. We adapt the standard RAM model and only use its AC0 instructions (i.e., no multiplication) plus two specialized AC0 packed string...
Nearest Neighbour Corner Points Matching Detection Algorithm
Directory of Open Access Journals (Sweden)
Zhang Changlong
2015-01-01
Full Text Available Accurate detection towards the corners plays an important part in camera calibration. To deal with the instability and inaccuracies of present corner detection algorithm, the nearest neighbour corners match-ing detection algorithms was brought forward. First, it dilates the binary image of the photographed pictures, searches and reserves quadrilateral outline of the image. Second, the blocks which accord with chess-board-corners are classified into a class. If too many blocks in class, it will be deleted; if not, it will be added, and then let the midpoint of the two vertex coordinates be the rough position of corner. At last, it precisely locates the position of the corners. The Experimental results have shown that the algorithm has obvious advantages on accuracy and validity in corner detection, and it can give security for camera calibration in traffic accident measurement.
Flexible Hardware-Based Stereo Matching
Directory of Open Access Journals (Sweden)
2009-02-01
Full Text Available To enable adaptive stereo vision for hardware-based embedded stereo vision systems, we propose a novel technique for implementing a flexible block size, disparity range, and frame rate. By reusing existing resources of a static architecture, rather than dynamic reconfiguration, our technique is compatible with application specific integrated circuit (ASIC as well as field programmable gate array (FPGA implementations. We present the corresponding block diagrams and their implementation in our hardware-based stereo matching architecture. Furthermore, we show the impact of flexible stereo matching on the generated disparity maps for the sum of absolute differences (SADs, rank, and census transform algorithms. Finally, we discuss the resource usage and achievable performance when synthesized for an Altera Stratix II FPGA.
Flexible Hardware-Based Stereo Matching
Directory of Open Access Journals (Sweden)
Steininger Andreas
2008-01-01
Full Text Available Abstract To enable adaptive stereo vision for hardware-based embedded stereo vision systems, we propose a novel technique for implementing a flexible block size, disparity range, and frame rate. By reusing existing resources of a static architecture, rather than dynamic reconfiguration, our technique is compatible with application specific integrated circuit (ASIC as well as field programmable gate array (FPGA implementations. We present the corresponding block diagrams and their implementation in our hardware-based stereo matching architecture. Furthermore, we show the impact of flexible stereo matching on the generated disparity maps for the sum of absolute differences (SADs, rank, and census transform algorithms. Finally, we discuss the resource usage and achievable performance when synthesized for an Altera Stratix II FPGA.
Deliberate change without hierarchical influence?
DEFF Research Database (Denmark)
Nørskov, Sladjana; Kesting, Peter; Ulhøi, John Parm
2017-01-01
Purpose This paper aims to present that deliberate change is strongly associated with formal structures and top-down influence. Hierarchical configurations have been used to structure processes, overcome resistance and get things done. But is deliberate change also possible without formal...... reveals that deliberate change is indeed achievable in a non-hierarchical collaborative OSS community context. However, it presupposes the presence and active involvement of informal change agents. The paper identifies and specifies four key drivers for change agents’ influence. Originality....../value The findings contribute to organisational analysis by providing a deeper understanding of the importance of leadership in making deliberate change possible in non-hierarchical settings. It points to the importance of “change-by-conviction”, essentially based on voluntary behaviour. This can open the door...
Static Correctness of Hierarchical Procedures
DEFF Research Database (Denmark)
Schwartzbach, Michael Ignatieff
1990-01-01
A system of hierarchical, fully recursive types in a truly imperative language allows program fragments written for small types to be reused for all larger types. To exploit this property to enable type-safe hierarchical procedures, it is necessary to impose a static requirement on procedure calls....... We introduce an example language and prove the existence of a sound requirement which preserves static correctness while allowing hierarchical procedures. This requirement is further shown to be optimal, in the sense that it imposes as few restrictions as possible. This establishes the theoretical...... basis for a general type hierarchy with static type checking, which enables first-order polymorphism combined with multiple inheritance and specialization in a language with assignments. We extend the results to include opaque types. An opaque version of a type is different from the original but has...
Infographic explaining NCI-COG Pediatric MATCH, a cancer treatment clinical trial for children and adolescents, from 1 to 21 years of age, that is testing the use of precision medicine for pediatric cancers.
Data Matching Imputation System
National Oceanic and Atmospheric Administration, Department of Commerce — The DMIS dataset is a flat file record of the matching of several data set collections. Primarily it consists of VTRs, dealer records, Observer data in conjunction...
Brooks, Martin; And Others
1983-01-01
The Cognitive Levels Matching Project trains teachers to guide students' skill acquisition and problem-solving processes by assessing students' cognitive levels and adapting their teaching materials accordingly. (MLF)
BLOCKS List - DB-SPIRE | LSDB Archive [Life Science Database Archive metadata
Lifescience Database Archive (English)
Full Text Available his entry blocks3dSeqChainFamilySize Number of PDB chains whose SEQRES matches this entry blocks3dAtomIdFami...lySize Number of PDB entries whose ATOM matches this entry blocks3dAtomChainFamilySize Number of PDB chains
Hierarchical CodeBook for background subtraction in MRF
Shao, Quan; Tang, Zhixing; Han, Songchen
2013-11-01
Foreground detection is the key low-level fundamental work in intelligent video surveillance. This paper proposed a hierarchical background subtraction algorithm consisted of block-based stage and pixel-based stage for it. In block-based stage, obvious backgrounds got detected via block-based CodeBook, leaving spatial relations among suspicious foreground pixels undestroyed. Pixel-based stage further eliminated the left background pixels with the introduction of spatial and temporal relations in a MRF-MAP framework. Then comparative experiments were conducted to evaluate the performance of the scheme in three dimensions - detection accuracy, update speed and memory consumption. Proposed approach possesses the highest detection precision and consumes the second least memories. And the update speed is of real-time level.
Directory of Open Access Journals (Sweden)
Zhu Yi-Sheng
2003-01-01
Full Text Available An adaptive hierarchical lapped orthogonal transform (HLOT exciser is proposed for tracking, localizing, and rejecting the nonstationary interference in direct sequence spread spectrum (DSSS communications. The method is based on HLOT. It utilizes a fast dynamic programming algorithm to search for the best basis, which matches the interference structure best, in a library of lapped orthogonal bases. The adaptive HLOT differs from conventional block transform and the more advanced modulated lapped transform (MLT in that the former produces arbitrary time-frequency tiling, which can be adapted to the signal structure, while the latter yields fixed tilings. The time-frequency tiling of the adaptive HLOT can be time varying, so it is also able to track the variations of the signal time-frequency structure. Simulation results show that the proposed exciser brings significant performance improvement in the presence of nonstationary time-localized interference with or without instantaneous frequency (IF information compared with the existing block transform domain excisers. Also, the proposed exciser is effective in suppressing narrowband interference and combined narrowband and time-localized impulsive interference.
Structural integrity of hierarchical composites
Directory of Open Access Journals (Sweden)
Marco Paggi
2012-01-01
Full Text Available Interface mechanical problems are of paramount importance in engineering and materials science. Traditionally, due to the complexity of modelling their mechanical behaviour, interfaces are often treated as defects and their features are not explored. In this study, a different approach is illustrated, where the interfaces play an active role in the design of innovative hierarchical composites and are fundamental for their structural integrity. Numerical examples regarding cutting tools made of hierarchical cellular polycrystalline materials are proposed, showing that tailoring of interface properties at the different scales is the way to achieve superior mechanical responses that cannot be obtained using standard materials
Bagci, Hakan
2014-11-11
We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.
deepBlockAlign: a tool for aligning RNA-seq profiles of read block patterns
Ekstrøm, Claus T.; Stadler, Peter F.; Hoffmann, Steve; Gorodkin, Jan
2012-01-01
Motivation: High-throughput sequencing methods allow whole transcriptomes to be sequenced fast and cost-effectively. Short RNA sequencing provides not only quantitative expression data but also an opportunity to identify novel coding and non-coding RNAs. Many long transcripts undergo post-transcriptional processing that generates short RNA sequence fragments. Mapped back to a reference genome, they form distinctive patterns that convey information on both the structure of the parent transcript and the modalities of its processing. The miR-miR* pattern from microRNA precursors is the best-known, but by no means singular, example. Results: deepBlockAlign introduces a two-step approach to align RNA-seq read patterns with the aim of quickly identifying RNAs that share similar processing footprints. Overlapping mapped reads are first merged to blocks and then closely spaced blocks are combined to block groups, each representing a locus of expression. In order to compare block groups, the constituent blocks are first compared using a modified sequence alignment algorithm to determine similarity scores for pairs of blocks. In the second stage, block patterns are compared by means of a modified Sankoff algorithm that takes both block similarities and similarities of pattern of distances within the block groups into account. Hierarchical clustering of block groups clearly separates most miRNA and tRNA, and also identifies about a dozen tRNAs clustering together with miRNA. Most of these putative Dicer-processed tRNAs, including eight cases reported to generate products with miRNA-like features in literature, exhibit read blocks distinguished by precise start position of reads. Availability: The program deepBlockAlign is available as source code from http://rth.dk/resources/dba/. Contact: gorodkin@rth.dk; studla@bioinf.uni-leipzig.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:22053076
Han, Xu; Zheng, Yeting; Munro, Catherine J; Ji, Yiwen; Braunschweig, Adam B
2015-08-01
Despite their central role in directing some of the most complex biological processes, carbohydrates--nature's other information carrying biopolymer--have been largely ignored as building blocks for synthetic hierarchical assemblies. The non-stoichiometric binding and astronomical diversity characteristic of carbohydrates could lead to tantalizingly complex assembly algorithms, but these attributes simultaneously increase the difficulty of preparing carbohydrate assemblies and anticipating their behavior. Convergences in biotechnology, nanotechnology, polymer chemistry, surface science, and supramolecular chemistry have led to many recent important breakthroughs in glycan microarrays and synthetic carbohydrate receptors, where the idiosyncrasies of carbohydrate structure and binding are increasingly considered. We hope to inspire more researchers to consider carbohydrate structure, diversity, and binding as attractive tools for constructing synthetic hierarchical assemblies.
The structure of dust aggregates in hierarchical coagulation
Dominik, Carsten; Borel, Herman
2016-01-01
Dust coagulation in interstellar space and protoplanetary disks is usually treated as one of 2 extreme cases: Particle-Cluster Aggregation and Cluster-Cluster Aggregation. In this paper we study the process of hierarchical growth, where aggregates are built from significantly smaller aggregates (but not monomers). We show that this process can be understood as a modified, PCA-like process that produces porous, but non-fractal particles whose filling factor is chiefly determined by the porosity of the building blocks. We also show that in a coagulation environment where relative velocities are driven by turbulence, a logarithmically flat mass distribution (equal mass per mass decade) as it is typically found in environments where fragmentation replenishes small grains, leads to a situation where small particles and aggregates dominate the growth of large ones. Therefore, in such environments, hierarchical growth should be seen as the norm. Consequently, we predict that the aggregates in such environments are n...
Ultrasound guided supraclavicular block.
LENUS (Irish Health Repository)
Hanumanthaiah, Deepak
2013-09-01
Ultrasound guided regional anaesthesia is becoming increasingly popular. The supraclavicular block has been transformed by ultrasound guidance into a potentially safe superficial block. We reviewed the techniques of performing supraclavicular block with special focus on ultrasound guidance.
Sensory Hierarchical Organization and Reading.
Skapof, Jerome
The purpose of this study was to judge the viability of an operational approach aimed at assessing response styles in reading using the hypothesis of sensory hierarchical organization. A sample of 103 middle-class children from a New York City public school, between the ages of five and seven, took part in a three phase experiment. Phase one…
Memory Stacking in Hierarchical Networks.
Westö, Johan; May, Patrick J C; Tiitinen, Hannu
2016-02-01
Robust representations of sounds with a complex spectrotemporal structure are thought to emerge in hierarchically organized auditory cortex, but the computational advantage of this hierarchy remains unknown. Here, we used computational models to study how such hierarchical structures affect temporal binding in neural networks. We equipped individual units in different types of feedforward networks with local memory mechanisms storing recent inputs and observed how this affected the ability of the networks to process stimuli context dependently. Our findings illustrate that these local memories stack up in hierarchical structures and hence allow network units to exhibit selectivity to spectral sequences longer than the time spans of the local memories. We also illustrate that short-term synaptic plasticity is a potential local memory mechanism within the auditory cortex, and we show that it can bring robustness to context dependence against variation in the temporal rate of stimuli, while introducing nonlinearities to response profiles that are not well captured by standard linear spectrotemporal receptive field models. The results therefore indicate that short-term synaptic plasticity might provide hierarchically structured auditory cortex with computational capabilities important for robust representations of spectrotemporal 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.
A multicast dynamic wavelength assignment algorithm based on matching degree
Institute of Scientific and Technical Information of China (English)
WU Qi-wu; ZHOU Xian-wei; WANG Jian-ping; YIN Zhi-hong; ZHANG Long
2009-01-01
The wavelength assignment with multiple multicast requests in fixed routing WDM network is studied. A new multicast dynamic wavelength assignment algorithm is presented based on matching degree. First, the wavelength matching degree between available wavelengths and multicast routing trees is introduced into the algorithm. Then, the wavelength assign-ment is translated into the maximum weight matching in bipartite graph, and this matching problem is solved by using an extended Kuhn-Munkres algorithm. The simulation results prove that the overall optimal wavelength assignment scheme is obtained in polynomial time. At the same time, the proposed algorithm can reduce the connecting blocking probability and improve the system resource utilization.
Coarse-to-fine region selection and matching
Yang, Yanchao
2015-10-15
We present a new approach to wide baseline matching. We propose to use a hierarchical decomposition of the image domain and coarse-to-fine selection of regions to match. In contrast to interest point matching methods, which sample salient regions to reduce the cost of comparing all regions in two images, our method eliminates regions systematically to achieve efficiency. One advantage of our approach is that it is not restricted to covariant salient regions, which is too restrictive under large viewpoint and leads to few corresponding regions. Affine invariant matching of regions in the hierarchy is achieved efficiently by a coarse-to-fine search of the affine space. Experiments on two benchmark datasets shows that our method finds more correct correspondence of the image (with fewer false alarms) than other wide baseline methods on large viewpoint change. © 2015 IEEE.
Genton, Marc G.
2017-09-07
We present a hierarchical decomposition scheme for computing the n-dimensional integral of multivariate normal probabilities that appear frequently in statistics. The scheme exploits the fact that the formally dense covariance matrix can be approximated by a matrix with a hierarchical low rank structure. It allows the reduction of the computational complexity per Monte Carlo sample from O(n2) to O(mn+knlog(n/m)), where k is the numerical rank of off-diagonal matrix blocks and m is the size of small diagonal blocks in the matrix that are not well-approximated by low rank factorizations and treated as dense submatrices. This hierarchical decomposition leads to substantial efficiencies in multivariate normal probability computations and allows integrations in thousands of dimensions to be practical on modern workstations.
Bellahsene, Zohra; Rahm, Erhard
2011-01-01
Requiring heterogeneous information systems to cooperate and communicate has now become crucial, especially in application areas like e-business, Web-based mash-ups and the life sciences. Such cooperating systems have to automatically and efficiently match, exchange, transform and integrate large data sets from different sources and of different structure in order to enable seamless data exchange and transformation. The book edited by Bellahsene, Bonifati and Rahm provides an overview of the ways in which the schema and ontology matching and mapping tools have addressed the above requirements
DEFF Research Database (Denmark)
Hartelius, Karsten; Carstensen, Jens Michael
2003-01-01
A method for locating distorted grid structures in images is presented. The method is based on the theories of template matching and Bayesian image restoration. The grid is modeled as a deformable template. Prior knowledge of the grid is described through a Markov random field (MRF) model which...... nodes and the arc prior models variations in row and column spacing across the grid. Grid matching is done by placing an initial rough grid over the image and applying an ensemble annealing scheme to maximize the posterior distribution of the grid. The method can be applied to noisy images with missing...
Middle matching mining algorithm
Institute of Scientific and Technical Information of China (English)
GUO Ping; CHEN Li
2003-01-01
A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets.
Hierarchical flexural strength of enamel: transition from brittle to damage-tolerant behaviour.
Bechtle, Sabine; Özcoban, Hüseyin; Lilleodden, Erica T; Huber, Norbert; Schreyer, Andreas; Swain, Michael V; Schneider, Gerold A
2012-06-07
Hard, biological materials are generally hierarchically structured from the nano- to the macro-scale in a somewhat self-similar manner consisting of mineral units surrounded by a soft protein shell. Considerable efforts are underway to mimic such materials because of their structurally optimized mechanical functionality of being hard and stiff as well as damage-tolerant. However, it is unclear how different hierarchical levels interact to achieve this performance. In this study, we consider dental enamel as a representative, biological hierarchical structure and determine its flexural strength and elastic modulus at three levels of hierarchy using focused ion beam (FIB) prepared cantilevers of micrometre size. The results are compared and analysed using a theoretical model proposed by Jäger and Fratzl and developed by Gao and co-workers. Both properties decrease with increasing hierarchical dimension along with a switch in mechanical behaviour from linear-elastic to elastic-inelastic. We found Gao's model matched the results very well.
Matching Speaking to Singing Voices and the Influence of Content.
Peynircioğlu, Zehra F; Rabinovitz, Brian E; Repice, Juliana
2017-03-01
We tested whether speaking voices of unfamiliar people could be matched to their singing voices, and, if so, whether the content of the utterances would influence this matching performance. Our hypothesis was that enough acoustic features would remain the same between speaking and singing voices such that their identification as belonging to the same or different individuals would be possible even upon a single hearing. We also hypothesized that the contents of the utterances would influence this identification process such that voices uttering words would be easier to match than those uttering vowels. We used a within-participant design with blocked stimuli that were counterbalanced using a Latin square design. In one block, mode (speaking vs singing) was manipulated while content was held constant; in another block, content (word vs syllable) was manipulated while mode was held constant, and in the control block, both mode and content were held constant. Participants indicated whether the voices in any given pair of utterances belonged to the same person or to different people. Cross-mode matching was above chance level, although mode-congruent performance was better. Further, only speaking voices were easier to match when uttering words. We can identify speaking and singing voices as the same or different even on just a single hearing. However, content interacts with mode such that words benefit matching of speaking voices but not of singing voices. Results are discussed within an attentional framework. Copyright © 2017 The Voice Foundation. Published by Elsevier Inc. All rights reserved.
Spectral characterization of hierarchical network modularity and limits of modularity detection.
Directory of Open Access Journals (Sweden)
Somwrita Sarkar
Full Text Available Many real world networks are reported to have hierarchically modular organization. However, there exists no algorithm-independent metric to characterize hierarchical modularity in a complex system. The main results of the paper are a set of methods to address this problem. First, classical results from random matrix theory are used to derive the spectrum of a typical stochastic block model hierarchical modular network form. Second, it is shown that hierarchical modularity can be fingerprinted using the spectrum of its largest eigenvalues and gaps between clusters of closely spaced eigenvalues that are well separated from the bulk distribution of eigenvalues around the origin. Third, some well-known results on fingerprinting non-hierarchical modularity in networks automatically follow as special cases, threreby unifying these previously fragmented results. Finally, using these spectral results, it is found that the limits of detection of modularity can be empirically established by studying the mean values of the largest eigenvalues and the limits of the bulk distribution of eigenvalues for an ensemble of networks. It is shown that even when modularity and hierarchical modularity are present in a weak form in the network, they are impossible to detect, because some of the leading eigenvalues fall within the bulk distribution. This provides a threshold for the detection of modularity. Eigenvalue distributions of some technological, social, and biological networks are studied, and the implications of detecting hierarchical modularity in real world networks are discussed.
Zhou, Feng; de la Torre, Fernando
2015-11-19
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the use of a path-following optimization algorithm, that leads to improved optimization strategies and matching performance; (3) Given the factorization, it becomes straight-forward to incorporate geometric transformations (rigid and non-rigid) to the GM problem. (4) Using a matrix formulation for the GM problem and the factorization, it is easy to reveal commonalities and differences between different GM methods. The factorization also provides a clean connection with other matching algorithms such as iterative closest point; Experimental results on synthetic and real databases illustrate how FGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.
Institute of Scientific and Technical Information of China (English)
彭硕
2002-01-01
It was a Saturday morning, our school football team was going to have a match with the No. 28 Middle Schooh They were really a strong team. But we weren't afraid of them. We had many mare good players on our team, so we were stronger than ever before.
Herrnstein, R. J.
1979-01-01
The matching law for reinforced behavior solves a differential equation relating infinitesimal changes in behavior to infinitesimal changes in reinforcement. The equation expresses plausible conceptions of behavior and reinforcement, yields a simple nonlinear operator model for acquisition, and suggests a alternative to the economic law of…
Claesson, Anders
2010-01-01
We show that there are n! matchings on 2n points without, so called, left (neighbor) nestings. We also define a set of naturally labeled (2+2)-free posets, and show that there are n! such posets on n elements. Our work was inspired by Bousquet-M\\'elou, Claesson, Dukes and Kitaev [arXiv:0806.0666]. They gave bijections between four classes of combinatorial objects: matchings with no neighbor nestings (due to Stoimenow), unlabeled (2+2)-free posets, permutations avoiding a specific pattern, and so called ascent sequences. We believe that certain statistics on our matchings and posets could generalize the work of Bousquet-M\\'elou et al.\\ and we make a conjecture to that effect. We also identify natural subsets of matchings and posets that are equinumerous to the class of unlabeled (2+2)-free posets. We give bijections that show the equivalence of (neighbor) restrictions on nesting arcs with (neighbor) restrictions on crossing arcs. These bijections are thought to be of independent interest. One of the bijections...
'Wiggle matching' radiocarbon dates
Ramsey, CB; van der Plicht, J; Weninger, B
2001-01-01
This paper covers three different methods of matching radiocarbon dates to the 'wiggles' of the calibration curve in those situations where the age difference between the C-14 dates is known. These methods are most often applied to tree-ring sequences. The simplest approach is to use a classical Chi
Jeuring, J.T.
2007-01-01
The pattern matching problem can be informally specified as follows: given a pattern and a text, find all occurrences of the pattern in the text. The pattern and the text may both be lists, or they may both be trees, or they may both be multi-dimensional arrays, etc. This paper describes a general p
Hierarchical Prisoner's Dilemma in Hierarchical Public-Goods Game
Fujimoto, Yuma; Kaneko, Kunihiko
2016-01-01
The dilemma in cooperation is one of the major concerns in game theory. In a public-goods game, each individual pays a cost for cooperation, or to prevent defection, and receives a reward from the collected cost in a group. Thus, defection is beneficial for each individual, while cooperation is beneficial for the group. Now, groups (say, countries) consisting of individual players also play games. To study such a multi-level game, we introduce a hierarchical public-goods (HPG) game in which two groups compete for finite resources by utilizing costs collected from individuals in each group. Analyzing this HPG game, we found a hierarchical prisoner's dilemma, in which groups choose the defection policy (say, armaments) as a Nash strategy to optimize each group's benefit, while cooperation optimizes the total benefit. On the other hand, for each individual within a group, refusing to pay the cost (say, tax) is a Nash strategy, which turns to be a cooperation policy for the group, thus leading to a hierarchical d...
Matching Supernovae to Galaxies
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
[Propensity score matching in SPSS].
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.
Image Segmentation by Hierarchical Spatial and Color Spaces Clustering
Institute of Scientific and Technical Information of China (English)
YU Wei
2005-01-01
Image segmentation, as a basic building block for many high-level image analysis problems, has attracted many research attentions over years. Existing approaches, however, are mainly focusing on the clustering analysis in the single channel information, i.e., either in color or spatial space, which may lead to unsatisfactory segmentation performance. Considering the spatial and color spaces jointly, this paper proposes a new hierarchical image segmentation algorithm, which alternately clusters the image regions in color and spatial spaces in a fine to coarse manner. Without losing the perceptual consistence, the proposed algorithm achieves the segmentation result using only very few number of colors according to user specification.
Hierarchical structure of biological systems
Alcocer-Cuarón, Carlos; Rivera, Ana L; Castaño, Victor M
2014-01-01
A general theory of biological systems, based on few fundamental propositions, allows a generalization of both Wierner and Berthalanffy approaches to theoretical biology. Here, a biological system is defined as a set of self-organized, differentiated elements that interact pair-wise through various networks and media, isolated from other sets by boundaries. Their relation to other systems can be described as a closed loop in a steady-state, which leads to a hierarchical structure and functioning of the biological system. Our thermodynamical approach of hierarchical character can be applied to biological systems of varying sizes through some general principles, based on the exchange of energy information and/or mass from and within the systems. PMID:24145961
Automatic Hierarchical Color Image Classification
Directory of Open Access Journals (Sweden)
Jing Huang
2003-02-01
Full Text Available Organizing images into semantic categories can be extremely useful for content-based image retrieval and image annotation. Grouping images into semantic classes is a difficult problem, however. Image classification attempts to solve this hard problem by using low-level image features. In this paper, we propose a method for hierarchical classification of images via supervised learning. This scheme relies on using a good low-level feature and subsequently performing feature-space reconfiguration using singular value decomposition to reduce noise and dimensionality. We use the training data to obtain a hierarchical classification tree that can be used to categorize new images. Our experimental results suggest that this scheme not only performs better than standard nearest-neighbor techniques, but also has both storage and computational advantages.
Intuitionistic fuzzy hierarchical clustering algorithms
Institute of Scientific and Technical Information of China (English)
Xu Zeshui
2009-01-01
Intuitionistic fuzzy set (IFS) is a set of 2-tuple arguments, each of which is characterized by a mem-bership degree and a nonmembership degree. The generalized form of IFS is interval-valued intuitionistic fuzzy set (IVIFS), whose components are intervals rather than exact numbers. IFSs and IVIFSs have been found to be very useful to describe vagueness and uncertainty. However, it seems that little attention has been focused on the clus-tering analysis of IFSs and IVIFSs. An intuitionistic fuzzy hierarchical algorithm is introduced for clustering IFSs, which is based on the traditional hierarchical clustering procedure, the intuitionistic fuzzy aggregation operator, and the basic distance measures between IFSs: the Hamming distance, normalized Hamming, weighted Hamming, the Euclidean distance, the normalized Euclidean distance, and the weighted Euclidean distance. Subsequently, the algorithm is extended for clustering IVIFSs. Finally the algorithm and its extended form are applied to the classifications of building materials and enterprises respectively.
Hierarchical Formation of Galactic Clusters
Elmegreen, B G
2006-01-01
Young stellar groupings and clusters have hierarchical patterns ranging from flocculent spiral arms and star complexes on the largest scale to OB associations, OB subgroups, small loose groups, clusters and cluster subclumps on the smallest scales. There is no obvious transition in morphology at the cluster boundary, suggesting that clusters are only the inner parts of the hierarchy where stars have had enough time to mix. The power-law cluster mass function follows from this hierarchical structure: n(M_cl) M_cl^-b for b~2. This value of b is independently required by the observation that the summed IMFs from many clusters in a galaxy equals approximately the IMF of each cluster.
Hierarchical matrices algorithms and analysis
Hackbusch, Wolfgang
2015-01-01
This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix. The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition. Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchical matrices is of interest to scientists ...
Hierarchical Cont-Bouchaud model
Paluch, Robert; Holyst, Janusz A
2015-01-01
We extend the well-known Cont-Bouchaud model to include a hierarchical topology of agent's interactions. The influence of hierarchy on system dynamics is investigated by two models. The first one is based on a multi-level, nested Erdos-Renyi random graph and individual decisions by agents according to Potts dynamics. This approach does not lead to a broad return distribution outside a parameter regime close to the original Cont-Bouchaud model. In the second model we introduce a limited hierarchical Erdos-Renyi graph, where merging of clusters at a level h+1 involves only clusters that have merged at the previous level h and we use the original Cont-Bouchaud agent dynamics on resulting clusters. The second model leads to a heavy-tail distribution of cluster sizes and relative price changes in a wide range of connection densities, not only close to the percolation threshold.
Hierarchical Clustering and Active Galaxies
Hatziminaoglou, E; Manrique, A
2000-01-01
The growth of Super Massive Black Holes and the parallel development of activity in galactic nuclei are implemented in an analytic code of hierarchical clustering. The evolution of the luminosity function of quasars and AGN will be computed with special attention paid to the connection between quasars and Seyfert galaxies. One of the major interests of the model is the parallel study of quasar formation and evolution and the History of Star Formation.
Hybrid and hierarchical composite materials
Kim, Chang-Soo; Sano, Tomoko
2015-01-01
This book addresses a broad spectrum of areas in both hybrid materials and hierarchical composites, including recent development of processing technologies, structural designs, modern computer simulation techniques, and the relationships between the processing-structure-property-performance. Each topic is introduced at length with numerous and detailed examples and over 150 illustrations. In addition, the authors present a method of categorizing these materials, so that representative examples of all material classes are discussed.
Treatment Protocols as Hierarchical Structures
Ben-Bassat, Moshe; Carlson, Richard W.; Puri, Vinod K.; Weil, Max Harry
1978-01-01
We view a treatment protocol as a hierarchical structure of therapeutic modules. The lowest level of this structure consists of individual therapeutic actions. Combinations of individual actions define higher level modules, which we call routines. Routines are designed to manage limited clinical problems, such as the routine for fluid loading to correct hypovolemia. Combinations of routines and additional actions, together with comments, questions, or precautions organized in a branching logic, in turn, define the treatment protocol for a given disorder. Adoption of this modular approach may facilitate the formulation of treatment protocols, since the physician is not required to prepare complex flowcharts. This hierarchical approach also allows protocols to be updated and modified in a flexible manner. By use of such a standard format, individual components may be fitted together to create protocols for multiple disorders. The technique is suited for computer implementation. We believe that this hierarchical approach may facilitate standarization of patient care as well as aid in clinical teaching. A protocol for acute pancreatitis is used to illustrate this technique.
Directory of Open Access Journals (Sweden)
Amanda R Bolbecker
2016-01-01
Full Text Available Evidence of cerebellar dysfunction in schizophrenia has mounted over the past several decades, emerging from neuroimaging, neuropathological, and behavioral studies. Consistent with these findings, cerebellar-dependent delay eyeblink conditioning (dEBC deficits have been identified in schizophrenia. While repeated measures analysis of variance (ANOVA is traditionally used to analyze dEBC data, hierarchical linear modeling (HLM more reliably describes change over time by accounting for the dependence in repeated measures data. This analysis approach is well suited to dEBC data analysis because it has less restrictive assumptions and allows unequal variances. The current study examined dEBC measured with electromyography in a single-cue tone paradigm in an age-matched sample of schizophrenia participants and healthy controls (N=56 per group using HLM. Subjects participated in 90 trials (10 blocks of dEBC, during which a 400 ms tone co-terminated with a 50 ms air puff delivered to the left eye. Each block also contained 1 tone-alone trial. The resulting block averages of dEBC data were fitted to a 3-parameter logistic model in HLM, revealing significant differences between schizophrenia and control groups on asymptote and inflection point, but not slope. These findings suggest that while the learning rate is not significantly different compared to controls, associative learning begins to level off later and a lower ultimate level of associative learning is achieved in schizophrenia. Given the large sample size in the present study, HLM may provide a more nuanced and definitive analysis of differences between schizophrenia and controls on dEBC.
Bolbecker, Amanda R; Petersen, Isaac T; Kent, Jerillyn S; Howell, Josselyn M; O'Donnell, Brian F; Hetrick, William P
2016-01-01
Evidence of cerebellar dysfunction in schizophrenia has mounted over the past several decades, emerging from neuroimaging, neuropathological, and behavioral studies. Consistent with these findings, cerebellar-dependent delay eyeblink conditioning (dEBC) deficits have been identified in schizophrenia. While repeated-measures analysis of variance is traditionally used to analyze dEBC data, hierarchical linear modeling (HLM) more reliably describes change over time by accounting for the dependence in repeated-measures data. This analysis approach is well suited to dEBC data analysis because it has less restrictive assumptions and allows unequal variances. The current study examined dEBC measured with electromyography in a single-cue tone paradigm in an age-matched sample of schizophrenia participants and healthy controls (N = 56 per group) using HLM. Subjects participated in 90 trials (10 blocks) of dEBC, during which a 400 ms tone co-terminated with a 50 ms air puff delivered to the left eye. Each block also contained 1 tone-alone trial. The resulting block averages of dEBC data were fitted to a three-parameter logistic model in HLM, revealing significant differences between schizophrenia and control groups on asymptote and inflection point, but not slope. These findings suggest that while the learning rate is not significantly different compared to controls, associative learning begins to level off later and a lower ultimate level of associative learning is achieved in schizophrenia. Given the large sample size in the present study, HLM may provide a more nuanced and definitive analysis of differences between schizophrenia and controls on dEBC.
Effects of 4X4 Block Scheduling
Directory of Open Access Journals (Sweden)
R. Brian Cobb
1999-02-01
Full Text Available The effects of a 4 X 4 block scheduling program in a middle school on a variety of student measures were investigated. These measures included standardized achievement tests in mathematics, reading, and writing, cumulative and semester grades in middle school and high school, attendance rates, and enrollment rates in advanced high school courses (in mathematics only. The block scheduling program had been in effect for four years allowing analyses of current middle and high school students who had experienced a minimum of one and one-half years of block scheduling while in middle school. The primary research design was a post-test only, matched pairs design. Students were matched on school characteristics, gender, ethnicity, grade level, and 5th grade standardized reading scores. Results were relatively consistent with the extant literature and generally positive.
Automatic Construction of Hierarchical Road Networks
Yang, Weiping
2016-06-01
This paper describes an automated method of constructing a hierarchical road network given a single dataset, without the presence of thematic attributes. The method is based on a pattern graph which maintains nodes and paths as junctions and through-traffic roads. The hierarchy is formed incrementally in a top-down fashion for highways, ramps, and major roads directly connected to ramps; and bottom-up for the rest of major and minor roads. Through reasoning and analysis, ramps are identified as unique characteristics for recognizing and assembling high speed roads. The method makes distinctions on the types of ramps by articulating their connection patterns with highways. Major and minor roads will be identified by both quantitative and qualitative analysis of spatial properties and by discovering neighbourhood patterns revealed in the data. The result of the method would enrich data description and support comprehensive queries on sorted exit or entry points on highways and their related roads. The enrichment on road network data is important to a high successful rate of feature matching for road networks and to geospatial data integration.
Resurgence matches quantization
Couso-Santamaría, Ricardo; Mariño, Marcos; Schiappa, Ricardo
2017-04-01
The quest to find a nonperturbative formulation of topological string theory has recently seen two unrelated developments. On the one hand, via quantization of the mirror curve associated to a toric Calabi–Yau background, it has been possible to give a nonperturbative definition of the topological-string partition function. On the other hand, using techniques of resurgence and transseries, it has been possible to extend the string (asymptotic) perturbative expansion into a transseries involving nonperturbative instanton sectors. Within the specific example of the local {{{P}}2} toric Calabi–Yau threefold, the present work shows how the Borel–Padé–Écalle resummation of this resurgent transseries, alongside occurrence of Stokes phenomenon, matches the string-theoretic partition function obtained via quantization of the mirror curve. This match is highly non-trivial, given the unrelated nature of both nonperturbative frameworks, signaling at the existence of a consistent underlying structure.
Resurgence Matches Quantization
Couso-Santamaría, Ricardo; Schiappa, Ricardo
2016-01-01
The quest to find a nonperturbative formulation of topological string theory has recently seen two unrelated developments. On the one hand, via quantization of the mirror curve associated to a toric Calabi-Yau background, it has been possible to give a nonperturbative definition of the topological-string partition function. On the other hand, using techniques of resurgence and transseries, it has been possible to extend the string (asymptotic) perturbative expansion into a transseries involving nonperturbative instanton sectors. Within the specific example of the local P2 toric Calabi-Yau threefold, the present work shows how the Borel-Pade-Ecalle resummation of this resurgent transseries, alongside occurrence of Stokes phenomenon, matches the string-theoretic partition function obtained via quantization of the mirror curve. This match is highly non-trivial, given the unrelated nature of both nonperturbative frameworks, signaling at the existence of a consistent underlying structure.
Bordenave, Charles; Salez, Justin
2011-01-01
We prove that the local weak convergence of a sequence of graphs is enough to guarantee the convergence of their normalized matching numbers. The limiting quantity is described by a local recursion defined on the weak limit of the graph sequence. However, this recursion may admit several solutions, implying non-trivial long-range dependencies between the edges of a largest matching. We overcome this lack of correlation decay by introducing a perturbative parameter called the temperature, which we let progressively go to zero. When the local weak limit is a unimodular Galton-Watson tree, the recursion simplifies into a distributional equation, resulting into an explicit formula that considerably extends the well-known one by Karp and Sipser for Erd\\"os-R\\'enyi random graphs.
Characteristic Evolution and Matching
Directory of Open Access Journals (Sweden)
Winicour Jeffrey
2005-12-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. A prime application of characteristic evolution is to compute waveforms via Cauchy-characteristic matching, which is also reviewed.
Sun, Xinglong; Xu, Tingfa; Zhang, Jizhou; Li, Xiangmin
2017-01-01
In this paper, we propose a novel hierarchical framework that combines motion and feature information to implement infrared-visible video registration on nearly planar scenes. In contrast to previous approaches, which involve the direct use of feature matching to find the global homography, the framework adds coarse registration based on the motion vectors of targets to estimate scale and rotation prior to matching. In precise registration based on keypoint matching, the scale and rotation are used in re-location to eliminate their impact on targets and keypoints. To strictly match the keypoints, first, we improve the quality of keypoint matching by using normalized location descriptors and descriptors generated by the histogram of edge orientation. Second, we remove most mismatches by counting the matching directions of correspondences. We tested our framework on a public dataset, where our proposed framework outperformed two recently-proposed state-of-the-art global registration methods in almost all tested videos. PMID:28212350
Bengtsson, Håkan; Ekstrand, Jan; Waldén, Markus; Hägglund, Martin
2013-07-01
Player activities in soccer matches are influenced by the match result and match venue. It is not known whether injury rates are influenced by these factors. To investigate whether there are associations between injury rates and the match result, venue, and type of competition in male soccer. Cohort study; Level of evidence, 3. Twenty-six professional clubs from 10 countries were followed prospectively during 9 seasons (2001-2002 to 2009-2010). All matches, and injuries occurring in these matches, were registered by the team's medical staff. An injury was registered if it resulted in player absence from training or matches. Information about match result, venue, and type of competition for all reported matches was gathered by the authors from online databases. Injury rates in matches with varying match characteristics were compared by use of generalized estimating equations. Odds ratios (ORs) with 95% confidence intervals (CIs) were calculated. A total of 2738 injuries during 6010 matches were registered. There were no associations between odds of 1 injury occurrence and match result or type of competition, whereas the odds were decreased in matches played away compared with home matches (OR, 0.89; 95% CI, 0.80-0.99). The odds of 2 or more injury occurrences in a match were increased in matches resulting in a draw (OR, 1.39; 95% CI, 1.15-1.69) or loss (OR, 1.66; 95% CI, 1.38-1.98) compared with matches won and were decreased in other cup matches compared with league matches (OR, 0.57; 95% CI, 0.39-0.84) and in matches played away compared with home matches (OR, 0.70; 95% CI, 0.60-0.82). Finally, injuries with more than 1 week's absence occurred more frequently in Champions League matches compared with league matches both for matches with 1 injury (OR, 1.26; 95% CI, 1.09-1.45) and matches with 2 or more injuries (OR, 1.57; 95% CI, 1.13-2.20). The odds of 2 or more injury occurrences in professional soccer were higher in matches resulting in a loss or a draw compared
A Fast Algorithm for Matching Remote Scene Images%一种新型遥感影像快速匹配算法
Institute of Scientific and Technical Information of China (English)
刘进; 闫利
2008-01-01
An iterative algorithm to calculate mutual correlation using hierarchical key points and the search space mark principle is proposed. An effective algorithm is designed to improve the matching speed. By hierarchical key point algorithm and mutual correlation coefficients of the matching images, the important points can be iteratively calculated in the images hierarchically, and the correlation coefficient can be obtained with satisfactory precision. Massive spots in the parameter space which are impossible to match can be removed by the search space mark principle. Two approximate continuities in the correlation image matching process, the image gray level distribution continuity and the correlation coefficient value in the parameter space continuity, are considered in the method. The experiments show that the new algorithm can greatly enhance matching speed and achieve accurate matching results
One-Match and All-Match Categories for Keywords Matching in Chatbot
Directory of Open Access Journals (Sweden)
Abbas S. Lokman
2010-01-01
Full Text Available Problem statement: Artificial intelligence chatbot is a technology that makes interactions between men and machines using natural language possible. From literature of chatbots keywords/pattern matching techniques, potential issues for improvement had been discovered. The discovered issues are in the context of keywords arrangement for matching precedence and keywords variety for matching flexibility. Approach: Combining previous techniques/mechanisms with some additional adjustment, new technique to be used for keywords matching process is proposed. Using newly developed chatbot named ViDi (abbreviation for Virtual Diabetes physician which is a chatbot for diabetes education activity as a testing medium, the proposed technique named One-Match and All-Match Categories (OMAMC is being used to test the creation of possible keywords surrounding one sample input sentence. The result for possible keywords created by this technique then being compared to possible keywords created by previous chatbots techniques surrounding the same sample sentence in matching precedence and matching flexibility context. Results: OMAMC technique is found to be improving previous matching techniques in matching precedence and flexibility context. This improvement is seen to be useful for shortening matching time and widening matching flexibility within the chatbots keywords matching process. Conclusion: OMAMC for keywords matching in chatbot is shown to be an improvement over previous techniques in the context of keywords arrangement for matching precedence and keywords variety for matching flexibility.
Directory of Open Access Journals (Sweden)
Cristian GEORGESCU
2005-01-01
Full Text Available The goal of this paper is to investigate how such a pattern matching could be performed on models,including the definition of the input language as well as the elaboration of efficient matchingalgorithms. Design patterns can be considered reusable micro-architectures that contribute to anoverall system architecture. Frameworks are also closely related to design patterns. Componentsoffer the possibility to radically change the behaviors and services offered by an application bysubstitution or addition of new components, even a long time after deployment. Software testing isanother aspect of reliable development. Testing activities mainly consist in ensuring that a systemimplementation conforms to its specifications.
1997-01-01
Apfel's excellent match: This series of photos shows a water drop containing a surfactant (Triton-100) as it experiences a complete cycle of superoscillation on U.S. Microgravity Lab-2 (USML-2; October 1995). The time in seconds appears under the photos. The figures above the photos are the oscillation shapes predicted by a numerical model. The time shown with the predictions is nondimensional. Robert Apfel (Yale University) used the Drop Physics Module on USML-2 to explore the effect of surfactants on liquid drops. Apfel's research of surfactants may contribute to improvements in a variety of industrial processes, including oil recovery and environmental cleanup.
Alba Avilés, Manuel
2015-01-01
WhereIsTheMatch is a very ambitious project that consists of developing my own social network mobile app for Android. This app is focused on easily finding people and places to play sports. The main idea of this project is create a first step to a final product and my own developing style. I knew from the beginning that this would be a very hard and a very demanding task because of the several areas that are involved in the development of a mobile app, such as database implementation, interfa...
DEFF Research Database (Denmark)
Faust, Sebastian; Hazay, Carmit; Venturi, Daniele
2013-01-01
on concrete and important functionalities and give the first protocol for the pattern matching problem in the cloud. Loosely speaking, this problem considers a text T that is outsourced to the cloud S by a client C T . In a query phase, clients C 1, …, C l run an efficient protocol with the server S...... 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...
Stopping Condition for Greedy Block Sparse Signal Recovery
Luo, Yu; Xie, Ronggui; Yin, Huarui; Wang, Weidong
2016-01-01
For greedy block sparse recovery where the sparsity level is unknown, we derive a stopping condition to stop the iteration process. Focused on the block orthogonal matching pursuit (BOMP) algorithm, we model the energy of residual signals at each iteration from a probabilistic perspective. At the iteration when the last supporting block is detected, the resulting energy of residual signals is supposed to suffer an obvious decrease. Based on this, we stop the iteration process when the energy ...
Hierarchical Control for Smart Grids
DEFF Research Database (Denmark)
Trangbæk, K; Bendtsen, Jan Dimon; Stoustrup, Jakob
2011-01-01
This paper deals with hierarchical model predictive control (MPC) of smart grid systems. The design consists of a high level MPC controller, a second level of so-called aggregators, which reduces the computational and communication-related load on the high-level control, and a lower level...... of autonomous consumers. The control system is tasked with balancing electric power production and consumption within the smart grid, and makes active use of the ﬂexibility of a large number of power producing and/or power consuming units. The objective is to accommodate the load variation on the grid, arising...
Generalized Orthogonal Matching Pursuit
Wang, Jian; Shim, Byonghyo
2011-01-01
As a greedy algorithm to recover sparse signals from compressed measurements, the orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the orthogonal matching pursuit (gOMP) for pursuing efficiency in reconstructing sparse signals. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple indices are identified per iteration. Owing to the selection of multiple "correct" indices, the gOMP algorithm is finished with much smaller number of iterations compared to the OMP. We show that the gOMP can perfectly reconstruct any $K$-sparse signals ($K > 1$), provided that the sensing matrix satisfies the RIP with $\\delta_{NK} < \\frac{\\sqrt{N}}{\\sqrt{K} + 2 \\sqrt{N}}$. We also demonstrate by empirical simulations that the gOMP has excellent recovery performance comparable to $\\ell_1$-minimization technique with fast processing speed and competitive computational com...
Hierarchical Structures in Hypertext Learning Environments
Bezdan, Eniko; Kester, Liesbeth; Kirschner, Paul A.
2011-01-01
Bezdan, E., Kester, L., & Kirschner, P. A. (2011, 9 September). Hierarchical Structures in Hypertext Learning Environments. Presentation for the visit of KU Leuven, Open University, Heerlen, The Netherlands.
Total Spinal Block after Thoracic Paravertebral Block.
Beyaz, Serbülent Gökhan; Özocak, Hande; Ergönenç, Tolga; Erdem, Ali Fuat; Palabıyık, Onur
2014-02-01
Thoracic paravertebral block (TPVB) can be performed with or without general anaesthesia for various surgical procedures. TPVB is a popular anaesthetic technique due to its low side effect profile and high analgesic potency. We used 20 mL of 0.5% levobupivacaine for a single injection of unilateral TPVB at the T7 level with neurostimulator in a 63 year old patient with co-morbid disease who underwent cholecystectomy. Following the application patient lost consciousness, and was intubated. Haemodynamic instability was normalised with rapid volume replacement and vasopressors. Anaesthetic drugs were stopped at the end of the surgery and muscle relaxant was antagonised. Return of mucle strenght was shown with neuromuscular block monitoring. Approximately three hours after TPVB, spontaneous breathing started and consciousness returned. A total spinal block is a rare and life-threatening complication. A total spinal block is a complication of spinal anaesthesia, and it can also occur after peripheral blocks. Clinical presentation is characterised by hypotension, bradicardia, apnea, and cardiac arrest. An early diagnosis and appropriate treatment is life saving. In this case report, we want to present total spinal block after TPVB.
Dynamic Organization of Hierarchical Memories.
Kurikawa, Tomoki; Kaneko, Kunihiko
2016-01-01
In the brain, external objects are categorized in a hierarchical way. Although it is widely accepted that objects are represented as static attractors in neural state space, this view does not take account interaction between intrinsic neural dynamics and external input, which is essential to understand how neural system responds to inputs. Indeed, structured spontaneous neural activity without external inputs is known to exist, and its relationship with evoked activities is discussed. Then, how categorical representation is embedded into the spontaneous and evoked activities has to be uncovered. To address this question, we studied bifurcation process with increasing input after hierarchically clustered associative memories are learned. We found a "dynamic categorization"; neural activity without input wanders globally over the state space including all memories. Then with the increase of input strength, diffuse representation of higher category exhibits transitions to focused ones specific to each object. The hierarchy of memories is embedded in the transition probability from one memory to another during the spontaneous dynamics. With increased input strength, neural activity wanders over a narrower state space including a smaller set of memories, showing more specific category or memory corresponding to the applied input. Moreover, such coarse-to-fine transitions are also observed temporally during transient process under constant input, which agrees with experimental findings in the temporal cortex. These results suggest the hierarchy emerging through interaction with an external input underlies hierarchy during transient process, as well as in the spontaneous activity.
Minutia Tensor Matrix: A New Strategy for Fingerprint Matching
Fu, Xiang; Feng, Jufu
2015-01-01
Establishing correspondences between two minutia sets is a fundamental issue in fingerprint recognition. This paper proposes a new tensor matching strategy. First, the concept of minutia tensor matrix (simplified as MTM) is proposed. It describes the first-order features and second-order features of a matching pair. In the MTM, the diagonal elements indicate similarities of minutia pairs and non-diagonal elements indicate pairwise compatibilities between minutia pairs. Correct minutia pairs are likely to establish both large similarities and large compatibilities, so they form a dense sub-block. Minutia matching is then formulated as recovering the dense sub-block in the MTM. This is a new tensor matching strategy for fingerprint recognition. Second, as fingerprint images show both local rigidity and global nonlinearity, we design two different kinds of MTMs: local MTM and global MTM. Meanwhile, a two-level matching algorithm is proposed. For local matching level, the local MTM is constructed and a novel local similarity calculation strategy is proposed. It makes full use of local rigidity in fingerprints. For global matching level, the global MTM is constructed to calculate similarities of entire minutia sets. It makes full use of global compatibility in fingerprints. Proposed method has stronger description ability and better robustness to noise and nonlinearity. Experiments conducted on Fingerprint Verification Competition databases (FVC2002 and FVC2004) demonstrate the effectiveness and the efficiency. PMID:25822489
Minutia tensor matrix: a new strategy for fingerprint matching.
Fu, Xiang; Feng, Jufu
2015-01-01
Establishing correspondences between two minutia sets is a fundamental issue in fingerprint recognition. This paper proposes a new tensor matching strategy. First, the concept of minutia tensor matrix (simplified as MTM) is proposed. It describes the first-order features and second-order features of a matching pair. In the MTM, the diagonal elements indicate similarities of minutia pairs and non-diagonal elements indicate pairwise compatibilities between minutia pairs. Correct minutia pairs are likely to establish both large similarities and large compatibilities, so they form a dense sub-block. Minutia matching is then formulated as recovering the dense sub-block in the MTM. This is a new tensor matching strategy for fingerprint recognition. Second, as fingerprint images show both local rigidity and global nonlinearity, we design two different kinds of MTMs: local MTM and global MTM. Meanwhile, a two-level matching algorithm is proposed. For local matching level, the local MTM is constructed and a novel local similarity calculation strategy is proposed. It makes full use of local rigidity in fingerprints. For global matching level, the global MTM is constructed to calculate similarities of entire minutia sets. It makes full use of global compatibility in fingerprints. Proposed method has stronger description ability and better robustness to noise and nonlinearity. Experiments conducted on Fingerprint Verification Competition databases (FVC2002 and FVC2004) demonstrate the effectiveness and the efficiency.
Institute of Scientific and Technical Information of China (English)
Yung-Chung Wang; Li-Hsin Chiang; Hung-Pin Lin
2014-01-01
Hierarchical mobile IPv6 (HMIPv6) introduces a mobility anchor point to reduce the signaling overhead and handoff latency. In this paper, we apply the matrix-analytical approach to explore the performance measures of the ongoing mobile nodes (MNs) drop and new MNs block probabilities of mobility anchor point with a guard bandwidth reservation scheme. We apply the Markovian arrival process (MAP) to model ongoing MNs and new MNs. Five related performance measures are derived, including the long-term new MN block and ongoing MN drop probabilities, and the three short-term measures of average length of a block period and a non-block period, as well as the conditional ongoing MN drop probability during a block period. These performance measures greatly assist the guard bandwidth reservation mechanism in determining a proper threshold guard bandwidth. The results presented in this paper can provide guidelines for designing adaptive algorithms to adjust the threshold in the guard bandwidth reservation scheme.
Characteristic Evolution and Matching
Directory of Open Access Journals (Sweden)
Winicour Jeffrey
2009-04-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to eliminate the role of this artificial outer boundary via Cauchy-characteristic matching, by which the radiated waveform can be computed at null infinity. Progress in this direction is discussed.
Costello, Kevin; Tripathi, Pushkar
2012-01-01
We consider the following stochastic optimization problem first introduced by Chen et al. in \\cite{chen}. We are given a vertex set of a random graph where each possible edge is present with probability p_e. We do not know which edges are actually present unless we scan/probe an edge. However whenever we probe an edge and find it to be present, we are constrained to picking the edge and both its end points are deleted from the graph. We wish to find the maximum matching in this model. We compare our results against the optimal omniscient algorithm that knows the edges of the graph and present a 0.573 factor algorithm using a novel sampling technique. We also prove that no algorithm can attain a factor better than 0.898 in this model.
Directory of Open Access Journals (Sweden)
Naama Goren-Inbar
Full Text Available Cylindrical objects made usually of fired clay but sometimes of stone were found at the Yarmukian Pottery Neolithic sites of Sha'ar HaGolan and Munhata (first half of the 8(th millennium BP in the Jordan Valley. Similar objects have been reported from other Near Eastern Pottery Neolithic sites. Most scholars have interpreted them as cultic objects in the shape of phalli, while others have referred to them in more general terms as "clay pestles," "clay rods," and "cylindrical clay objects." Re-examination of these artifacts leads us to present a new interpretation of their function and to suggest a reconstruction of their technology and mode of use. We suggest that these objects were components of fire drills and consider them the earliest evidence of a complex technology of fire ignition, which incorporates the cylindrical objects in the role of matches.
Goren-Inbar, Naama; Freikman, Michael; Garfinkel, Yosef; Goring-Morris, A Nigel; Goring-Morris, Nigel A; Grosman, Leore
2012-01-01
Cylindrical objects made usually of fired clay but sometimes of stone were found at the Yarmukian Pottery Neolithic sites of Sha'ar HaGolan and Munhata (first half of the 8(th) millennium BP) in the Jordan Valley. Similar objects have been reported from other Near Eastern Pottery Neolithic sites. Most scholars have interpreted them as cultic objects in the shape of phalli, while others have referred to them in more general terms as "clay pestles," "clay rods," and "cylindrical clay objects." Re-examination of these artifacts leads us to present a new interpretation of their function and to suggest a reconstruction of their technology and mode of use. We suggest that these objects were components of fire drills and consider them the earliest evidence of a complex technology of fire ignition, which incorporates the cylindrical objects in the role of matches.
DEFF Research Database (Denmark)
Jönsson, Jeppe
2015-01-01
Block tearing is considered in several codes as a pure block tension or a pure block shear failure mechanism. However in many situations the load acts eccentrically and involves the transfer of a substantial moment in combination with the shear force and perhaps a normal force. A literature study...... yield lines around the block leads to simple interaction formulas similar to other interaction formulas in the codes.......Block tearing is considered in several codes as a pure block tension or a pure block shear failure mechanism. However in many situations the load acts eccentrically and involves the transfer of a substantial moment in combination with the shear force and perhaps a normal force. A literature study...
Optimizing Transmission Line Matching Circuits
Novak, S.
1996-01-01
When designing transmission line matching circuits, there exist often overlooked, additional, not much used, degree of choice in the selection of the transmission line impedance. In this work are presented results of CAD analysis for the two element transmission line matching networks, demonstrating that selecting matching circuits transmission lines with higher impedance, than usually used 50 or 75 ohms, can in most cases substantially decrease the physical dimension of the final matching ci...
A cost effective base-matching assay with low backgrounds.
SU, X.; Mushinsky, G; Comeau, A.M.
1996-01-01
Base-matching or so-called mini-sequencing is a powerful technique for genotyping and mutation identification. However, its application is often hampered by high background and high cost. We have decreased the background by approximately 5-fold by incorporating an end-blocking step and using only 1/10 of the usual nucleotide concentrations.
Tolerating Correlated Failures for Generalized Cartesian Distributions via Bipartite Matching
Energy Technology Data Exchange (ETDEWEB)
Ali, Nawab; Krishnamoorthy, Sriram; Halappanavar, Mahantesh; Daily, Jeffrey A.
2011-05-05
Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale systems. A key ingredient of any approach to fault tolerance is effective support for fault tolerant data storage. A typical application execution consists of phases in which certain data structures are modified while others are read-only. Often, read-only data structures constitute a large fraction of total memory consumed. Fault tolerance for read-only data can be ensured through the use of checksums or parities, without resorting to expensive in-memory duplication or checkpointing to secondary storage. In this paper, we present a graph-matching approach to compute and store parity data for read-only matrices that are compatible with fault tolerant linear algebra (FTLA). Typical approaches only support blocked data distributions with each process holding one block with the parity located on additional processes. The matrices are assumed to be blocked by a cartesian grid with each block assigned to a process. We consider a generalized distribution in which each process can be assigned arbitrary blocks. We also account for the fact that multiple processes might be part of the same failure unit, say an SMP node. The flexibility enabled by our novel application of graph matching extends fault tolerance support to data distributions beyond those supported by prior work. We evaluate the matching implementations and cost to compute the parity and recover lost data, demonstrating the low overhead incurred by our approach.
Discovering hierarchical structure in normal relational data
DEFF Research Database (Denmark)
Schmidt, Mikkel Nørgaard; Herlau, Tue; Mørup, Morten
2014-01-01
Hierarchical clustering is a widely used tool for structuring and visualizing complex data using similarity. Traditionally, hierarchical clustering is based on local heuristics that do not explicitly provide assessment of the statistical saliency of the extracted hierarchy. We propose a non-param...
Discursive Hierarchical Patterning in Economics Cases
Lung, Jane
2011-01-01
This paper attempts to apply Lung's (2008) model of the discursive hierarchical patterning of cases to a closer and more specific study of Economics cases and proposes a model of the distinct discursive hierarchical patterning of the same. It examines a corpus of 150 Economics cases with a view to uncovering the patterns of discourse construction.…
A Model of Hierarchical Key Assignment Scheme
Institute of Scientific and Technical Information of China (English)
ZHANG Zhigang; ZHAO Jing; XU Maozhi
2006-01-01
A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme will be defined in this paper. Also, our scheme model will meet this property.
BLOCK H-MATRICES AND SPECTRUM OF BLOCK MATRICES
Institute of Scientific and Technical Information of China (English)
黄廷祝; 黎稳
2002-01-01
The block H-matrices are studied by the concept of G-functions, several concepts of block matrices are introduced. Equivalent characters of block H-matrices are obtained. Spectrum localizations claracterized by Gfunctions for block matrices are got.
Hierarchical Self-Assembly of Cellulose Nanocrystals in a Confined Geometry.
Parker, Richard M; Frka-Petesic, Bruno; Guidetti, Giulia; Kamita, Gen; Consani, Gioele; Abell, Chris; Vignolini, Silvia
2016-09-27
Complex hierarchical architectures are ubiquitous in nature. By designing and controlling the interaction between elementary building blocks, nature is able to optimize a large variety of materials with multiple functionalities. Such control is, however, extremely challenging in man-made materials, due to the difficulties in controlling their interaction at different length scales simultaneously. Here, hierarchical cholesteric architectures are obtained by the self-assembly of cellulose nanocrystals within shrinking, micron-sized aqueous droplets. This confined, spherical geometry drastically affects the colloidal self-assembly process, resulting in concentric ordering within the droplet, as confirmed by simulation. This provides a quantitative tool to study the interactions of cellulose nanocrystals beyond what has been achieved in a planar geometry. Our developed methodology allows us to fabricate truly hierarchical solid-state architectures from the nanometer to the macroscopic scale using a renewable and sustainable biopolymer.
Block TERM factorization of block matrices
Institute of Scientific and Technical Information of China (English)
SHE Yiyuan; HAO Pengwei
2004-01-01
Reversible integer mapping (or integer transform) is a useful way to realize Iossless coding, and this technique has been used for multi-component image compression in the new international image compression standard JPEG 2000. For any nonsingular linear transform of finite dimension, its integer transform can be implemented by factorizing the transform matrix into 3 triangular elementary reversible matrices (TERMs) or a series of single-row elementary reversible matrices (SERMs). To speed up and parallelize integer transforms, we study block TERM and SERM factorizations in this paper. First, to guarantee flexible scaling manners, the classical determinant (det) is generalized to a matrix function, DET, which is shown to have many important properties analogous to those of det. Then based on DET, a generic block TERM factorization,BLUS, is presented for any nonsingular block matrix. Our conclusions can cover the early optimal point factorizations and provide an efficient way to implement integer transforms for large matrices.
Galaxy formation through hierarchical clustering
White, Simon D. M.; Frenk, Carlos S.
1991-01-01
Analytic methods for studying the formation of galaxies by gas condensation within massive dark halos are presented. The present scheme applies to cosmogonies where structure grows through hierarchical clustering of a mixture of gas and dissipationless dark matter. The simplest models consistent with the current understanding of N-body work on dissipationless clustering, and that of numerical and analytic work on gas evolution and cooling are adopted. Standard models for the evolution of the stellar population are also employed, and new models for the way star formation heats and enriches the surrounding gas are constructed. Detailed results are presented for a cold dark matter universe with Omega = 1 and H(0) = 50 km/s/Mpc, but the present methods are applicable to other models. The present luminosity functions contain significantly more faint galaxies than are observed.
Groups possessing extensive hierarchical decompositions
Januszkiewicz, T; Leary, I J
2009-01-01
Kropholler's class of groups is the smallest class of groups which contains all finite groups and is closed under the following operator: whenever $G$ admits a finite-dimensional contractible $G$-CW-complex in which all stabilizer groups are in the class, then $G$ is itself in the class. Kropholler's class admits a hierarchical structure, i.e., a natural filtration indexed by the ordinals. For example, stage 0 of the hierarchy is the class of all finite groups, and stage 1 contains all groups of finite virtual cohomological dimension. We show that for each countable ordinal $\\alpha$, there is a countable group that is in Kropholler's class which does not appear until the $\\alpha+1$st stage of the hierarchy. Previously this was known only for $\\alpha= 0$, 1 and 2. The groups that we construct contain torsion. We also review the construction of a torsion-free group that lies in the third stage of the hierarchy.
Quantum transport through hierarchical structures.
Boettcher, S; Varghese, C; Novotny, M A
2011-04-01
The transport of quantum electrons through hierarchical lattices is of interest because such lattices have some properties of both regular lattices and random systems. We calculate the electron transmission as a function of energy in the tight-binding approximation for two related Hanoi networks. HN3 is a Hanoi network with every site having three bonds. HN5 has additional bonds added to HN3 to make the average number of bonds per site equal to five. We present a renormalization group approach to solve the matrix equation involved in this quantum transport calculation. We observe band gaps in HN3, while no such band gaps are observed in linear networks or in HN5. We provide a detailed scaling analysis near the edges of these band gaps.
Hierarchical networks of scientific journals
Palla, Gergely; Mones, Enys; Pollner, Péter; Vicsek, Tamás
2015-01-01
Scientific journals are the repositories of the gradually accumulating knowledge of mankind about the world surrounding us. Just as our knowledge is organised into classes ranging from major disciplines, subjects and fields to increasingly specific topics, journals can also be categorised into groups using various metrics. In addition to the set of topics characteristic for a journal, they can also be ranked regarding their relevance from the point of overall influence. One widespread measure is impact factor, but in the present paper we intend to reconstruct a much more detailed description by studying the hierarchical relations between the journals based on citation data. We use a measure related to the notion of m-reaching centrality and find a network which shows the level of influence of a journal from the point of the direction and efficiency with which information spreads through the network. We can also obtain an alternative network using a suitably modified nested hierarchy extraction method applied ...
Adaptive Sampling in Hierarchical Simulation
Energy Technology Data Exchange (ETDEWEB)
Knap, J; Barton, N R; Hornung, R D; Arsenlis, A; Becker, R; Jefferson, D R
2007-07-09
We propose an adaptive sampling methodology for hierarchical multi-scale simulation. The method utilizes a moving kriging interpolation to significantly reduce the number of evaluations of finer-scale response functions to provide essential constitutive information to a coarser-scale simulation model. The underlying interpolation scheme is unstructured and adaptive to handle the transient nature of a simulation. To handle the dynamic construction and searching of a potentially large set of finer-scale response data, we employ a dynamic metric tree database. We study the performance of our adaptive sampling methodology for a two-level multi-scale model involving a coarse-scale finite element simulation and a finer-scale crystal plasticity based constitutive law.
Multicollinearity in hierarchical linear models.
Yu, Han; Jiang, Shanhe; Land, Kenneth C
2015-09-01
This study investigates an ill-posed problem (multicollinearity) in Hierarchical Linear Models from both the data and the model perspectives. We propose an intuitive, effective approach to diagnosing the presence of multicollinearity and its remedies in this class of models. A simulation study demonstrates the impacts of multicollinearity on coefficient estimates, associated standard errors, and variance components at various levels of multicollinearity for finite sample sizes typical in social science studies. We further investigate the role multicollinearity plays at each level for estimation of coefficient parameters in terms of shrinkage. Based on these analyses, we recommend a top-down method for assessing multicollinearity in HLMs that first examines the contextual predictors (Level-2 in a two-level model) and then the individual predictors (Level-1) and uses the results for data collection, research problem redefinition, model re-specification, variable selection and estimation of a final model.
Hierarchically Nanostructured Materials for Sustainable Environmental Applications
Ren, Zheng; Guo, Yanbing; Liu, Cai-Hong; Gao, Pu-Xian
2013-11-01
This article presents a comprehensive overview of the hierarchical nanostructured materials with either geometry or composition complexity in environmental applications. The hierarchical nanostructures offer advantages of high surface area, synergistic interactions and multiple functionalities towards water remediation, environmental gas sensing and monitoring as well as catalytic gas treatment. Recent advances in synthetic strategies for various hierarchical morphologies such as hollow spheres and urchin-shaped architectures have been reviewed. In addition to the chemical synthesis, the physical mechanisms associated with the materials design and device fabrication have been discussed for each specific application. The development and application of hierarchical complex perovskite oxide nanostructures have also been introduced in photocatalytic water remediation, gas sensing and catalytic converter. Hierarchical nanostructures will open up many possibilities for materials design and device fabrication in environmental chemistry and technology.
A neural signature of hierarchical reinforcement learning.
Ribas-Fernandes, José J F; Solway, Alec; Diuk, Carlos; McGuire, Joseph T; Barto, Andrew G; Niv, Yael; Botvinick, Matthew M
2011-07-28
Human behavior displays hierarchical structure: simple actions cohere into subtask sequences, which work together to accomplish overall task goals. Although the neural substrates of such hierarchy have been the target of increasing research, they remain poorly understood. We propose that the computations supporting hierarchical behavior may relate to those in hierarchical reinforcement learning (HRL), a machine-learning framework that extends reinforcement-learning mechanisms into hierarchical domains. To test this, we leveraged a distinctive prediction arising from HRL. In ordinary reinforcement learning, reward prediction errors are computed when there is an unanticipated change in the prospects for accomplishing overall task goals. HRL entails that prediction errors should also occur in relation to task subgoals. In three neuroimaging studies we observed neural responses consistent with such subgoal-related reward prediction errors, within structures previously implicated in reinforcement learning. The results reported support the relevance of HRL to the neural processes underlying hierarchical behavior.
Hierarchical Identity-Based Lossy Trapdoor Functions
Escala, Alex; Libert, Benoit; Rafols, Carla
2012-01-01
Lossy trapdoor functions, introduced by Peikert and Waters (STOC'08), have received a lot of attention in the last years, because of their wide range of applications in theoretical cryptography. The notion has been recently extended to the identity-based scenario by Bellare et al. (Eurocrypt'12). We provide one more step in this direction, by considering the notion of hierarchical identity-based lossy trapdoor functions (HIB-LTDFs). Hierarchical identity-based cryptography generalizes identitybased cryptography in the sense that identities are organized in a hierarchical way; a parent identity has more power than its descendants, because it can generate valid secret keys for them. Hierarchical identity-based cryptography has been proved very useful both for practical applications and to establish theoretical relations with other cryptographic primitives. In order to realize HIB-LTDFs, we first build a weakly secure hierarchical predicate encryption scheme. This scheme, which may be of independent interest, is...
Hierarchically nanostructured materials for sustainable environmental applications
Ren, Zheng; Guo, Yanbing; Liu, Cai-Hong; Gao, Pu-Xian
2013-01-01
This review presents a comprehensive overview of the hierarchical nanostructured materials with either geometry or composition complexity in environmental applications. The hierarchical nanostructures offer advantages of high surface area, synergistic interactions, and multiple functionalities toward water remediation, biosensing, environmental gas sensing and monitoring as well as catalytic gas treatment. Recent advances in synthetic strategies for various hierarchical morphologies such as hollow spheres and urchin-shaped architectures have been reviewed. In addition to the chemical synthesis, the physical mechanisms associated with the materials design and device fabrication have been discussed for each specific application. The development and application of hierarchical complex perovskite oxide nanostructures have also been introduced in photocatalytic water remediation, gas sensing, and catalytic converter. Hierarchical nanostructures will open up many possibilities for materials design and device fabrication in environmental chemistry and technology. PMID:24790946
Hierarchically Nanostructured Materials for Sustainable Environmental Applications
Directory of Open Access Journals (Sweden)
Zheng eRen
2013-11-01
Full Text Available This article presents a comprehensive overview of the hierarchical nanostructured materials with either geometry or composition complexity in environmental applications. The hierarchical nanostructures offer advantages of high surface area, synergistic interactions and multiple functionalities towards water remediation, environmental gas sensing and monitoring as well as catalytic gas treatment. Recent advances in synthetic strategies for various hierarchical morphologies such as hollow spheres and urchin-shaped architectures have been reviewed. In addition to the chemical synthesis, the physical mechanisms associated with the materials design and device fabrication have been discussed for each specific application. The development and application of hierarchical complex perovskite oxide nanostructures have also been introduced in photocatalytic water remediation, gas sensing and catalytic converter. Hierarchical nanostructures will open up many possibilities for materials design and device fabrication in environmental chemistry and technology.
Hierarchical structure graphitic-like/MoS2 film as superlubricity material
Gong, Zhenbin; Jia, Xiaolong; Ma, Wei; Zhang, Bin; Zhang, Junyan
2017-08-01
Friction and wear result in a great amount of energy loss and the invalidation of mechanical parts, thus it is necessary to minimize friction in practical application. In this study, the graphitic-like/MoS2 films with hierarchical structure were synthesized by the combination of pulse current plasma chemical-vapor deposition and medium frequency unbalanced magnetron sputtering in preheated environment. This hierarchical structure composite with multilayer nano sheets endows the films excellent tribological performance, which easily achieves macro superlubricity (friction coefficient ∼0.004) under humid air. Furthermore, it is expected that hierarchical structure of graphitic-like/MoS2 films could match the requirements of large scale, high bear-capacity and wear-resistance of actual working conditions, which could be widely used in the industrial production as a promising superlubricity material.
An HLA matched donor! An HLA matched donor? What do you mean by: HLA matched donor?
van Rood, J J; Oudshoorn, M
1998-07-01
The term 'an HLA matched donor' is in general used without giving exact information on the level of resolution of the HLA typing. This can lead to misunderstandings. A proposal is formulated to agree on using six match categories according to the HLA typing technique used to indicate the level of confidence of the matching.
Hierarchically Nanoporous Bioactive Glasses for High Efficiency Immobilization of Enzymes
DEFF Research Database (Denmark)
He, W.; Min, D.D.; Zhang, X.D.
2014-01-01
Bioactive glasses with hierarchical nanoporosity and structures have been heavily involved in immobilization of enzymes. Because of meticulous design and ingenious hierarchical nanostructuration of porosities from yeast cell biotemplates, hierarchically nanostructured porous bioactive glasses can...
Perotti, Juan Ignacio; Caldarelli, Guido
2015-01-01
The quest for a quantitative characterization of community and modular structure of complex networks produced a variety of methods and algorithms to classify different networks. However, it is not clear if such methods provide consistent, robust and meaningful results when considering hierarchies as a whole. Part of the problem is the lack of a similarity measure for the comparison of hierarchical community structures. In this work we give a contribution by introducing the {\\it hierarchical mutual information}, which is a generalization of the traditional mutual information, and allows to compare hierarchical partitions and hierarchical community structures. The {\\it normalized} version of the hierarchical mutual information should behave analogously to the traditional normalized mutual information. Here, the correct behavior of the hierarchical mutual information is corroborated on an extensive battery of numerical experiments. The experiments are performed on artificial hierarchies, and on the hierarchical ...
Characteristic Evolution and Matching
Directory of Open Access Journals (Sweden)
Jeffrey Winicour
2012-01-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial-value problem. Progress in characteristic evolution is traced from the early stage of 1D feasibility studies to 2D-axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black-hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black-hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to extend such simulations to null infinity where the waveform from the binary inspiral and merger can be unambiguously computed. This has now been accomplished by Cauchy-characteristic extraction, where data for the characteristic evolution is supplied by Cauchy data on an extraction worldtube inside the artificial outer boundary. The ultimate application of characteristic evolution is to eliminate the role of this outer boundary by constructing a global solution via Cauchy-characteristic matching. Progress in this direction is discussed.
Jiang, Nan; Dang, Yijie; Wang, Jian
2016-09-01
Quantum image processing (QIP) means the quantum-based methods to speed up image processing algorithms. Many quantum image processing schemes claim that their efficiency is theoretically higher than their corresponding classical schemes. However, most of them do not consider the problem of measurement. As we all know, measurement will lead to collapse. That is to say, executing the algorithm once, users can only measure the final state one time. Therefore, if users want to regain the results (the processed images), they must execute the algorithms many times and then measure the final state many times to get all the pixels' values. If the measurement process is taken into account, whether or not the algorithms are really efficient needs to be reconsidered. In this paper, we try to solve the problem of measurement and give a quantum image matching algorithm. Unlike most of the QIP algorithms, our scheme interests only one pixel (the target pixel) instead of the whole image. It modifies the probability of pixels based on Grover's algorithm to make the target pixel to be measured with higher probability, and the measurement step is executed only once. An example is given to explain the algorithm more vividly. Complexity analysis indicates that the quantum scheme's complexity is O(2n) in contradistinction to the classical scheme's complexity O(2^{2n+2m}), where m and n are integers related to the size of images.
Lesson Thirteen Trifascicular Block
Institute of Scientific and Technical Information of China (English)
鲁端; 王劲
2005-01-01
@@ A complete trifascicular block would result in complete AV block. The idio ventricular rhythm has a slower rate and a wide QRS complex because the pacemaker is located at the peripheral part of the conduction system distal to the sites of the block1. Such a rhythm may be difficult to differentiate from bifascicular or bundle branch block combined with complete block at a higher level such as the AV node or His bundle2. Besides a slower ventricular rate, a change in the morphology of the QRS complex from a previous known bifascicular pattern would be strongly suggestive of a trifascicular origin of the complete AV block3. A His bundle recording is required for a definitive diagnosis, however.
Stabilization and controlled association of superparamagnetic nanoparticles using block copolymers
Energy Technology Data Exchange (ETDEWEB)
Frka-Petesic, Bruno [UPMC Univ Paris 6, Lab. des Liquides Ioniques et Interfaces Chargees (LI2C), CNRS-ESPCI UMR 7612 case 51, 4 place Jussieu, F-75252 Paris Cedex 05 (France); Fresnais, Jerome; Berret, Jean-Francois [Laboratoire Matiere et Systemes Complexes (MSC), UMR 7057 CNRS and Universite Paris Diderot, Batiment Condorcet 10 rue Alice Domon et Leonie Duquet, F-75205 Paris Codex 13 (France); Dupuis, Vincent [UPMC Univ Paris 6, Lab. des Liquides Ioniques et Interfaces Chargees (LI2C), CNRS-ESPCI UMR 7612 case 51, 4 place Jussieu, F-75252 Paris Cedex 05 (France); Perzynski, Regine [UPMC Univ Paris 6, Lab. des Liquides Ioniques et Interfaces Chargees (LI2C), CNRS-ESPCI UMR 7612 case 51, 4 place Jussieu, F-75252 Paris Cedex 05 (France)], E-mail: regine.perzynski@upmc.fr; Sandre, Olivier [UPMC Univ Paris 6, Lab. des Liquides Ioniques et Interfaces Chargees (LI2C), CNRS-ESPCI UMR 7612 case 51, 4 place Jussieu, F-75252 Paris Cedex 05 (France)
2009-04-15
Mixing in aqueous solutions polyelectrolyte-neutral block copolymers with oppositely charged species, spontaneously forms stable core-shell complexes, which are electrostatically driven. We report here on the structural and orientational properties of such mixed magnetic nanoclusters made of magnetic iron oxide nanoparticles (MNPs) and polyelectrolyte-neutral block copolymers. Small angle neutron scattering and transmission electron microscopy experiments allows to probe the inner-core nanoparticle organization, leading to an average interparticle distance and confirming the hierarchical internal structure of the clusters. Thanks to the MNP optical anisotropy, we also probe the under-magnetic field orientational properties of the core-shell clusters and their dynamical rotational relaxation.
Tian, Qinghua; Luo, Dong; Li, Xiaowei; Zhang, Zhengxi; Yang, Li; Hirano, Shin-ichi
2016-05-01
Titanium dioxide (TiO2) has been considered to be a promisingly alternative anode material for lithium-ion batteries and thus attracted wide research interest. But, its practical application in lithium-ion batteries is seriously impeded by low capacity and poor rate capability. In the present work, the electrochemical performance of TiO2 is significantly improved by elaborately fabricating hierarchical structures. These as-prepared four hierarchical structure TiO2 assembled by different building blocks (TO2-2 h, TO2-6 h, TO2-18 h and TO2-24 h) all exhibit impressed performance. More importantly, the TO2-6 h constructed by curved nanosheets exhibits the best performance, delivering a capacity of 231.6 mAh g-1 at 0.2C after 200 cycles, and capacities of 187.1 and 129.3 mAh g-1 at 1 and 10C after even 1200 cycles, respectively. The results indicated that design and fabrication of hierarchical structure is an effective strategy for significantly improving the electrochemical performance of TiO2 electrodes, and the electrochemical performance of hierarchical structure TiO2 is heavily dependent on its building blocks. It is suggested that thus excellent electrochemical performance may make TiO2-6 h a promising anode material for advanced lithium-ion batteries with high capacity, good rate capability and long life.
Image Segmentation, Registration, Compression, and Matching
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
A novel method for a multi-level hierarchical composite with brick-and-mortar structure.
Brandt, Kristina; Wolff, Michael F H; Salikov, Vitalij; Heinrich, Stefan; Schneider, Gerold A
2013-01-01
The fascination for hierarchically structured hard tissues such as enamel or nacre arises from their unique structure-properties-relationship. During the last decades this numerously motivated the synthesis of composites, mimicking the brick-and-mortar structure of nacre. However, there is still a lack in synthetic engineering materials displaying a true hierarchical structure. Here, we present a novel multi-step processing route for anisotropic 2-level hierarchical composites by combining different coating techniques on different length scales. It comprises polymer-encapsulated ceramic particles as building blocks for the first level, followed by spouted bed spray granulation for a second level, and finally directional hot pressing to anisotropically consolidate the composite. The microstructure achieved reveals a brick-and-mortar hierarchical structure with distinct, however not yet optimized mechanical properties on each level. It opens up a completely new processing route for the synthesis of multi-level hierarchically structured composites, giving prospects to multi-functional structure-properties relationships.
A Hierarchically Micro-Meso-Macroporous Zeolite CaA for Methanol Conversion to Dimethyl Ether
Directory of Open Access Journals (Sweden)
Yan Wang
2016-11-01
Full Text Available A hierarchical zeolite CaA with microporous, mesoporous and macroporous structure was hydrothermally synthesized by a ”Bond-Blocking” method using organo-functionalized mesoporous silica (MS as a silica source. The characterization by XRD, SEM/TEM and N2 adsorption/desorption techniques showed that the prepared material had well-crystalline zeolite Linde Type A (LTA topological structure, microspherical particle morphologies, and hierarchically intracrystalline micro-meso-macropores structure. With the Bond-Blocking principle, the external surface area and macro-mesoporosity of the hierarchical zeolite CaA can be adjusted by varying the organo-functionalized degree of the mesoporous silica surface. Similarly, the distribution of the micro-meso-macroporous structure in the zeolite CaA can be controlled purposely. Compared with the conventional microporous zeolite CaA, the hierarchical zeolite CaA as a catalyst in the conversion of methanol to dimethyl ether (DME, exhibited complete DME selectivity and stable catalytic activity with high methanol conversion. The catalytic performances of the hierarchical zeolite CaA results clearly from the micro-meso-macroporous structure, improving diffusion properties, favoring the access to the active surface and avoiding secondary reactions (no hydrocarbon products were detected after 3 h of reaction.
2011-06-01
36(1), 19–30. Barron, F. H. (1992). Selecting a best multiattribute alternative with partial information about attribute weights. Acta Psychologica ...1988). Systematic research into human behavior in multi-attribute object classification problems. Acta Psychologica , 68, 171–182. León, O. G
An Exactly Soluble Hierarchical Clustering Model Inverse Cascades, Self-Similarity, and Scaling
Gabrielov, A; Turcotte, D L
1999-01-01
We show how clustering as a general hierarchical dynamical process proceeds via a sequence of inverse cascades to produce self-similar scaling, as an intermediate asymptotic, which then truncates at the largest spatial scales. We show how this model can provide a general explanation for the behavior of several models that has been described as ``self-organized critical,'' including forest-fire, sandpile, and slider-block models.
Topology of the correlation networks among major currencies using hierarchical structure methods
Keskin, Mustafa; Deviren, Bayram; Kocakaplan, Yusuf
2011-02-01
We studied the topology of correlation networks among 34 major currencies using the concept of a minimal spanning tree and hierarchical tree for the full years of 2007-2008 when major economic turbulence occurred. We used the USD (US Dollar) and the TL (Turkish Lira) as numeraires in which the USD was the major currency and the TL was the minor currency. We derived a hierarchical organization and constructed minimal spanning trees (MSTs) and hierarchical trees (HTs) for the full years of 2007, 2008 and for the 2007-2008 period. We performed a technique to associate a value of reliability to the links of MSTs and HTs by using bootstrap replicas of data. We also used the average linkage cluster analysis for obtaining the hierarchical trees in the case of the TL as the numeraire. These trees are useful tools for understanding and detecting the global structure, taxonomy and hierarchy in financial data. We illustrated how the minimal spanning trees and their related hierarchical trees developed over a period of time. From these trees we identified different clusters of currencies according to their proximity and economic ties. The clustered structure of the currencies and the key currency in each cluster were obtained and we found that the clusters matched nicely with the geographical regions of corresponding countries in the world such as Asia or Europe. As expected the key currencies were generally those showing major economic activity.
Hierarchical ensemble of background models for PTZ-based video surveillance.
Liu, Ning; Wu, Hefeng; Lin, Liang
2015-01-01
In this paper, we study a novel hierarchical background model for intelligent video surveillance with the pan-tilt-zoom (PTZ) camera, and give rise to an integrated system consisting of three key components: background modeling, observed frame registration, and object tracking. First, we build the hierarchical background model by separating the full range of continuous focal lengths of a PTZ camera into several discrete levels and then partitioning the wide scene at each level into many partial fixed scenes. In this way, the wide scenes captured by a PTZ camera through rotation and zoom are represented by a hierarchical collection of partial fixed scenes. A new robust feature is presented for background modeling of each partial scene. Second, we locate the partial scenes corresponding to the observed frame in the hierarchical background model. Frame registration is then achieved by feature descriptor matching via fast approximate nearest neighbor search. Afterwards, foreground objects can be detected using background subtraction. Last, we configure the hierarchical background model into a framework to facilitate existing object tracking algorithms under the PTZ camera. Foreground extraction is used to assist tracking an object of interest. The tracking outputs are fed back to the PTZ controller for adjusting the camera properly so as to maintain the tracked object in the image plane. We apply our system on several challenging scenarios and achieve promising results.
... Blocked Urethral Valves Health Issues Listen Español Text Size Email Print Share Blocked Urethral Valves Page Content Article Body Urine leaves the bladder through a tube called the urethra, which in boys passes through the penis. Rarely, small membranes form across the urethra in ...
Van der Vegt, Wim
2010-01-01
Related Drupal Nodes Block This module exposes a block that uses Latent Semantic Analysis (Lsa) internally to suggest three nodes that are relevant to the node a user is viewing. This module performs three tasks. 1) It periodically indexes a Drupal site and generates a Lsa Term Document Matrix. Inde
... P wave as it normally would. If an electrical signal is blocked before it reaches the ventricles, they won't contract and pump blood to the lungs and the rest of the body. Second-degree heart block is divided into two ...
Van der Vegt, Wim
2010-01-01
Related Drupal Nodes Block This module exposes a block that uses Latent Semantic Analysis (Lsa) internally to suggest three nodes that are relevant to the node a user is viewing. This module performs three tasks. 1) It periodically indexes a Drupal site and generates a Lsa Term Document Matrix. Inde
Matching theory for wireless networks
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. .
Hierarchically structured, nitrogen-doped carbon membranes
Wang, Hong
2017-08-03
The present invention is a structure, method of making and method of use for a novel macroscopic hierarchically structured, nitrogen-doped, nano-porous carbon membrane (HNDCMs) with asymmetric and hierarchical pore architecture that can be produced on a large-scale approach. The unique HNDCM holds great promise as components in separation and advanced carbon devices because they could offer unconventional ﬂuidic transport phenomena on the nanoscale. Overall, the invention set forth herein covers a hierarchically structured, nitrogen-doped carbon membranes and methods of making and using such a membranes.
A Model for Slicing JAVA Programs Hierarchically
Institute of Scientific and Technical Information of China (English)
Bi-Xin Li; Xiao-Cong Fan; Jun Pang; Jian-Jun Zhao
2004-01-01
Program slicing can be effectively used to debug, test, analyze, understand and maintain objectoriented software. In this paper, a new slicing model is proposed to slice Java programs based on their inherent hierarchical feature. The main idea of hierarchical slicing is to slice programs in a stepwise way, from package level, to class level, method level, and finally up to statement level. The stepwise slicing algorithm and the related graph reachability algorithms are presented, the architecture of the Java program Analyzing Tool (JATO) based on hierarchical slicing model is provided, the applications and a small case study are also discussed.
Hierarchical analysis of acceptable use policies
Directory of Open Access Journals (Sweden)
P. A. Laughton
2008-01-01
Full Text Available Acceptable use policies (AUPs are vital tools for organizations to protect themselves and their employees from misuse of computer facilities provided. A well structured, thorough AUP is essential for any organization. It is impossible for an effective AUP to deal with every clause and remain readable. For this reason, some sections of an AUP carry more weight than others, denoting importance. The methodology used to develop the hierarchical analysis is a literature review, where various sources were consulted. This hierarchical approach to AUP analysis attempts to highlight important sections and clauses dealt with in an AUP. The emphasis of the hierarchal analysis is to prioritize the objectives of an AUP.
Hierarchical modeling and analysis for spatial data
Banerjee, Sudipto; Gelfand, Alan E
2003-01-01
Among the many uses of hierarchical modeling, their application to the statistical analysis of spatial and spatio-temporal data from areas such as epidemiology And environmental science has proven particularly fruitful. Yet to date, the few books that address the subject have been either too narrowly focused on specific aspects of spatial analysis, or written at a level often inaccessible to those lacking a strong background in mathematical statistics.Hierarchical Modeling and Analysis for Spatial Data is the first accessible, self-contained treatment of hierarchical methods, modeling, and dat
Posterior Probability Matching and Human Perceptual Decision Making.
Directory of Open Access Journals (Sweden)
Richard F Murray
2015-06-01
Full Text Available Probability matching is a classic theory of decision making that was first developed in models of cognition. Posterior probability matching, a variant in which observers match their response probabilities to the posterior probability of each response being correct, is being used increasingly often in models of perception. However, little is known about whether posterior probability matching is consistent with the vast literature on vision and hearing that has developed within signal detection theory. Here we test posterior probability matching models using two tools from detection theory. First, we examine the models' performance in a two-pass experiment, where each block of trials is presented twice, and we measure the proportion of times that the model gives the same response twice to repeated stimuli. We show that at low performance levels, posterior probability matching models give highly inconsistent responses across repeated presentations of identical trials. We find that practised human observers are more consistent across repeated trials than these models predict, and we find some evidence that less practised observers more consistent as well. Second, we compare the performance of posterior probability matching models on a discrimination task to the performance of a theoretical ideal observer that achieves the best possible performance. We find that posterior probability matching is very inefficient at low-to-moderate performance levels, and that human observers can be more efficient than is ever possible according to posterior probability matching models. These findings support classic signal detection models, and rule out a broad class of posterior probability matching models for expert performance on perceptual tasks that range in complexity from contrast discrimination to symmetry detection. However, our findings leave open the possibility that inexperienced observers may show posterior probability matching behaviour, and our methods
Posterior Probability Matching and Human Perceptual Decision Making
Murray, Richard F.; Patel, Khushbu; Yee, Alan
2015-01-01
Probability matching is a classic theory of decision making that was first developed in models of cognition. Posterior probability matching, a variant in which observers match their response probabilities to the posterior probability of each response being correct, is being used increasingly often in models of perception. However, little is known about whether posterior probability matching is consistent with the vast literature on vision and hearing that has developed within signal detection theory. Here we test posterior probability matching models using two tools from detection theory. First, we examine the models’ performance in a two-pass experiment, where each block of trials is presented twice, and we measure the proportion of times that the model gives the same response twice to repeated stimuli. We show that at low performance levels, posterior probability matching models give highly inconsistent responses across repeated presentations of identical trials. We find that practised human observers are more consistent across repeated trials than these models predict, and we find some evidence that less practised observers more consistent as well. Second, we compare the performance of posterior probability matching models on a discrimination task to the performance of a theoretical ideal observer that achieves the best possible performance. We find that posterior probability matching is very inefficient at low-to-moderate performance levels, and that human observers can be more efficient than is ever possible according to posterior probability matching models. These findings support classic signal detection models, and rule out a broad class of posterior probability matching models for expert performance on perceptual tasks that range in complexity from contrast discrimination to symmetry detection. However, our findings leave open the possibility that inexperienced observers may show posterior probability matching behaviour, and our methods provide new tools
Arrighi, Pablo
2010-01-01
We define the block neighborhood of a reversible CA, which is related both to its decomposition into a product of block permutations and to quantum computing. We give a purely combinatorial characterization of the block neighborhood, which helps in two ways. First, it makes the computation of the block neighborhood of a given CA relatively easy. Second, it allows us to derive upper bounds on the block neighborhood: for a single CA as function of the classical and inverse neighborhoods, and for the composition of several CAs. One consequence of that is a characterization of a class of "elementary" CAs that cannot be written as the composition of two simpler parts whose neighborhoods and inverse neighborhoods would be reduced by one half.
Category theoretic analysis of hierarchical protein materials and social networks.
Directory of Open Access Journals (Sweden)
David I Spivak
Full Text Available Materials in biology span all the scales from Angstroms to meters and typically consist of complex hierarchical assemblies of simple building blocks. Here we describe an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs. An olog is like a "concept web" or "semantic network" except that it follows a rigorous mathematical formulation based on category theory. This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other olog. We consider simple cases of beta-helical and amyloid-like protein filaments subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties. We also construct a representation of a social network in which people send text-messages to their nearest neighbors and act as a team to perform a task. We show that the olog for the protein and the olog for the social network feature identical category-theoretic representations, and we proceed to precisely explicate the analogy or isomorphism between them. The examples presented here demonstrate that the intrinsic nature of a complex system, which in particular includes a precise relationship between structure and function at different hierarchical levels, can be effectively represented by an olog. This, in turn, allows for comparative studies between disparate materials or fields of application, and results in novel approaches to derive functionality in the design of de novo hierarchical systems. We discuss opportunities and challenges associated with the description of complex biological materials by using ologs as a powerful tool for analysis and design in the context of materiomics, and we present the potential impact of this approach for engineering, life sciences, and medicine.
Ruso, Juan M; Sartuqui, Javier; Messina, Paula V
2015-01-01
Bone is a biologically and structurally sophisticated multifunctional tissue. It dynamically responds to biochemical, mechanical and electrical clues by remodelling itself and accordingly the maximum strength and toughness are along the lines of the greatest applied stress. The challenge is to develop an orthopaedic biomaterial that imitates the micro- and nano-structural elements and compositions of bone to locally match the properties of the host tissue resulting in a biologically fixed implant. Looking for the ideal implant, the convergence of life and materials sciences occurs. Researchers in many different fields apply their expertise to improve implantable devices and regenerative medicine. Materials of all kinds, but especially hierarchical nano-materials, are being exploited. The application of nano-materials with hierarchical design to calcified tissue reconstructive medicine involve intricate systems including scaffolds with multifaceted shapes that provides temporary mechanical function; materials with nano-topography modifications that guarantee their integration to tissues and that possesses functionalized surfaces to transport biologic factors to stimulate tissue growth in a controlled, safe, and rapid manner. Furthermore materials that should degrade on a timeline coordinated to the time that takes the tissues regrow, are prepared. These implantable devices are multifunctional and for its construction they involve the use of precise strategically techniques together with specific material manufacturing processes that can be integrated to achieve in the design, the required multifunctionality. For such reasons, even though the idea of displacement from synthetic implants and tissue grafts to regenerative-medicine-based tissue reconstruction has been guaranteed for well over a decade, the reality has yet to emerge. In this paper, we examine the recent approaches to create enhanced bioactive materials. Their design and manufacturing procedures as well
Sparsey™: event recognition via deep hierarchical sparse distributed codes.
Rinkus, Gerard J
2014-01-01
The visual cortex's hierarchical, multi-level organization is captured in many biologically inspired computational vision models, the general idea being that progressively larger scale (spatially/temporally) and more complex visual features are represented in progressively higher areas. However, most earlier models use localist representations (codes) in each representational field (which we equate with the cortical macrocolumn, "mac"), at each level. In localism, each represented feature/concept/event (hereinafter "item") is coded by a single unit. The model we describe, Sparsey, is hierarchical as well but crucially, it uses sparse distributed coding (SDC) in every mac in all levels. In SDC, each represented item is coded by a small subset of the mac's units. The SDCs of different items can overlap and the size of overlap between items can be used to represent their similarity. The difference between localism and SDC is crucial because SDC allows the two essential operations of associative memory, storing a new item and retrieving the best-matching stored item, to be done in fixed time for the life of the model. Since the model's core algorithm, which does both storage and retrieval (inference), makes a single pass over all macs on each time step, the overall model's storage/retrieval operation is also fixed-time, a criterion we consider essential for scalability to the huge ("Big Data") problems. A 2010 paper described a nonhierarchical version of this model in the context of purely spatial pattern processing. Here, we elaborate a fully hierarchical model (arbitrary numbers of levels and macs per level), describing novel model principles like progressive critical periods, dynamic modulation of principal cells' activation functions based on a mac-level familiarity measure, representation of multiple simultaneously active hypotheses, a novel method of time warp invariant recognition, and we report results showing learning/recognition of spatiotemporal patterns.
Image meshing via hierarchical optimization
Institute of Scientific and Technical Information of China (English)
Hao XIE; Ruo-feng TONG‡
2016-01-01
Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., defi nition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to fi nd a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it diﬃcult to fi nd a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to fi ner ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.
Image meshing via hierarchical optimization＊
Institute of Scientific and Technical Information of China (English)
Hao XIE; Ruo-feng TONGS
2016-01-01
Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., definition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to find a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it difficult to find a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to finer ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.
Hierarchical Bayes Ensemble Kalman Filtering
Tsyrulnikov, Michael
2015-01-01
Ensemble Kalman filtering (EnKF), when applied to high-dimensional systems, suffers from an inevitably small affordable ensemble size, which results in poor estimates of the background error covariance matrix ${\\bf B}$. The common remedy is a kind of regularization, usually an ad-hoc spatial covariance localization (tapering) combined with artificial covariance inflation. Instead of using an ad-hoc regularization, we adopt the idea by Myrseth and Omre (2010) and explicitly admit that the ${\\bf B}$ matrix is unknown and random and estimate it along with the state (${\\bf x}$) in an optimal hierarchical Bayes analysis scheme. We separate forecast errors into predictability errors (i.e. forecast errors due to uncertainties in the initial data) and model errors (forecast errors due to imperfections in the forecast model) and include the two respective components ${\\bf P}$ and ${\\bf Q}$ of the ${\\bf B}$ matrix into the extended control vector $({\\bf x},{\\bf P},{\\bf Q})$. Similarly, we break the traditional backgrou...
C-HiLasso: A Collaborative Hierarchical Sparse Modeling Framework
Sprechmann, Pablo; Sapiro, Guillermo; Eldar, Yonina
2010-01-01
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an L1-regularized linear regression problem, commonly referred to as Lasso or Basis Pursuit. In this work we combine the sparsity-inducing property of the Lasso model at the individual feature level, with the block-sparsity property of the Group Lasso model, where sparse groups of features are jointly encoded, obtaining a sparsity pattern hierarchically structured. This results in the Hierarchical Lasso (HiLasso), which shows important practical modeling advantages. We then extend this approach to the collaborative case, where a set of simultaneously coded signals share the same sparsity pattern at the higher (group) level, but not necessarily at the lower (inside the group) level, obtaining the collaborative HiLasso model (C-HiLasso). Such signals then share the same active groups, or classes, but not necessarily the same active set. This model is very well suited for ap...
Biomimetic Hierarchical Assembly of Helical Supraparticles from Chiral Nanoparticles.
Zhou, Yunlong; Marson, Ryan L; van Anders, Greg; Zhu, Jian; Ma, Guanxiang; Ercius, Peter; Sun, Kai; Yeom, Bongjun; Glotzer, Sharon C; Kotov, Nicholas A
2016-03-22
Chiroptical materials found in butterflies, beetles, stomatopod crustaceans, and other creatures are attributed to biocomposites with helical motifs and multiscale hierarchical organization. These structurally sophisticated materials self-assemble from primitive nanoscale building blocks, a process that is simpler and more energy efficient than many top-down methods currently used to produce similarly sized three-dimensional materials. Here, we report that molecular-scale chirality of a CdTe nanoparticle surface can be translated to nanoscale helical assemblies, leading to chiroptical activity in the visible electromagnetic range. Chiral CdTe nanoparticles coated with cysteine self-organize around Te cores to produce helical supraparticles. D-/L-Form of the amino acid determines the dominant left/right helicity of the supraparticles. Coarse-grained molecular dynamics simulations with a helical pair-potential confirm the assembly mechanism and the origin of its enantioselectivity, providing a framework for engineering three-dimensional chiral materials by self-assembly. The helical supraparticles further self-organize into lamellar crystals with liquid crystalline order, demonstrating the possibility of hierarchical organization and with multiple structural motifs and length scales determined by molecular-scale asymmetry of nanoparticle interactions.
Fault Tolerant Distributed and Fixed Hierarchical Mobile IP
Directory of Open Access Journals (Sweden)
Paramesh C. Upadhyay
2010-04-01
Full Text Available To several mobility management protocols proposed for IP-based mobile networks, faulttolerance aspect of mobility agents is a primary requirement to sustain continuous service availability to themobile hosts. For a localized or micro- mobility management solution, the local mobility agent i.e. gateway isa single point of failure because it is responsible for enforcing the signaling and data packets in its domain.Such failures may severely disrupt the communications among the failure-affected users. The problembecomes even more severe for mobility agents in a distributed mobility management scheme with overlappingregistration areas.This paper proposes a fault tolerance scheme for Distributed and Fixed Hierarchical Mobile IP(DFHMIP and evaluates its performance in terms of data transmission cost and blocking probability.
Mesopore quality determines the lifetime of hierarchically structured zeolite catalysts
Milina, Maria; Mitchell, Sharon; Crivelli, Paolo; Cooke, David; Pérez-Ramírez, Javier
2014-05-01
Deactivation due to coking limits the lifetime of zeolite catalysts in the production of chemicals and fuels. Superior performance can be achieved through hierarchically structuring the zeolite porosity, yet no relation has been established between the mesopore architecture and the catalyst lifetime. Here we introduce a top-down demetallation strategy to locate mesopores in different regions of MFI-type crystals with identical bulk porous and acidic properties. In contrast, well-established bottom-up strategies as carbon templating and seed silanization fail to yield materials with matching characteristics. Advanced characterization tools capable of accurately discriminating the mesopore size, distribution and connectivity are applied to corroborate the concept of mesopore quality. Positron annihilation lifetime spectroscopy proves powerful to quantify the global connectivity of the intracrystalline pore network, which, as demonstrated in the conversions of methanol or of propanal to hydrocarbons, is closely linked to the lifetime of zeolite catalysts. The findings emphasize the need to aptly tailor hierarchical materials for maximal catalytic advantage.
An Automatic Hierarchical Delay Analysis Tool
Institute of Scientific and Technical Information of China (English)
FaridMheir－El－Saadi; BozenaKaminska
1994-01-01
The performance analysis of VLSI integrated circuits(ICs) with flat tools is slow and even sometimes impossible to complete.Some hierarchical tools have been developed to speed up the analysis of these large ICs.However,these hierarchical tools suffer from a poor interaction with the CAD database and poorly automatized operations.We introduce a general hierarchical framework for performance analysis to solve these problems.The circuit analysis is automatic under the proposed framework.Information that has been automatically abstracted in the hierarchy is kept in database properties along with the topological information.A limited software implementation of the framework,PREDICT,has also been developed to analyze the delay performance.Experimental results show that hierarchical analysis CPU time and memory requirements are low if heuristics are used during the abstraction process.
Packaging glass with hierarchically nanostructured surface
He, Jr-Hau
2017-08-03
An optical device includes an active region and packaging glass located on top of the active region. A top surface of the packaging glass includes hierarchical nanostructures comprised of honeycombed nanowalls (HNWs) and nanorod (NR) structures extending from the HNWs.
Generation of hierarchically correlated multivariate symbolic sequences
Tumminello, Mi; Mantegna, R N
2008-01-01
We introduce an algorithm to generate multivariate series of symbols from a finite alphabet with a given hierarchical structure of similarities. The target hierarchical structure of similarities is arbitrary, for instance the one obtained by some hierarchical clustering procedure as applied to an empirical matrix of Hamming distances. The algorithm can be interpreted as the finite alphabet equivalent of the recently introduced hierarchically nested factor model (M. Tumminello et al. EPL 78 (3) 30006 (2007)). The algorithm is based on a generating mechanism that is different from the one used in the mutation rate approach. We apply the proposed methodology for investigating the relationship between the bootstrap value associated with a node of a phylogeny and the probability of finding that node in the true phylogeny.
Hierarchical modularity in human brain functional networks
Meunier, D; Fornito, A; Ersche, K D; Bullmore, E T; 10.3389/neuro.11.037.2009
2010-01-01
The idea that complex systems have a hierarchical modular organization originates in the early 1960s and has recently attracted fresh support from quantitative studies of large scale, real-life networks. Here we investigate the hierarchical modular (or "modules-within-modules") decomposition of human brain functional networks, measured using functional magnetic resonance imaging (fMRI) in 18 healthy volunteers under no-task or resting conditions. We used a customized template to extract networks with more than 1800 regional nodes, and we applied a fast algorithm to identify nested modular structure at several hierarchical levels. We used mutual information, 0 < I < 1, to estimate the similarity of community structure of networks in different subjects, and to identify the individual network that is most representative of the group. Results show that human brain functional networks have a hierarchical modular organization with a fair degree of similarity between subjects, I=0.63. The largest 5 modules at ...
HIERARCHICAL ORGANIZATION OF INFORMATION, IN RELATIONAL DATABASES
Directory of Open Access Journals (Sweden)
Demian Horia
2008-05-01
Full Text Available In this paper I will present different types of representation, of hierarchical information inside a relational database. I also will compare them to find the best organization for specific scenarios.
Hierarchical Network Design Using Simulated Annealing
DEFF Research Database (Denmark)
Thomadsen, Tommy; Clausen, Jens
2002-01-01
The hierarchical network problem is the problem of finding the least cost network, with nodes divided into groups, edges connecting nodes in each groups and groups ordered in a hierarchy. The idea of hierarchical networks comes from telecommunication networks where hierarchies exist. Hierarchical...... networks are described and a mathematical model is proposed for a two level version of the hierarchical network problem. The problem is to determine which edges should connect nodes, and how demand is routed in the network. The problem is solved heuristically using simulated annealing which as a sub......-algorithm uses a construction algorithm to determine edges and route the demand. Performance for different versions of the algorithm are reported in terms of runtime and quality of the solutions. The algorithm is able to find solutions of reasonable quality in approximately 1 hour for networks with 100 nodes....
When to Use Hierarchical Linear Modeling
National Research Council Canada - National Science Library
Veronika Huta
2014-01-01
Previous publications on hierarchical linear modeling (HLM) have provided guidance on how to perform the analysis, yet there is relatively little information on two questions that arise even before analysis...
An introduction to hierarchical linear modeling
National Research Council Canada - National Science Library
Woltman, Heather; Feldstain, Andrea; MacKay, J. Christine; Rocchi, Meredith
2012-01-01
This tutorial aims to introduce Hierarchical Linear Modeling (HLM). A simple explanation of HLM is provided that describes when to use this statistical technique and identifies key factors to consider before conducting this analysis...
Conservation Laws in the Hierarchical Model
Beijeren, H. van; Gallavotti, G.; Knops, H.
1974-01-01
An exposition of the renormalization-group equations for the hierarchical model is given. Attention is drawn to some properties of the spin distribution functions which are conserved under the action of the renormalization group.
Hierarchical DSE for multi-ASIP platforms
DEFF Research Database (Denmark)
Micconi, Laura; Corvino, Rosilde; Gangadharan, Deepak;
2013-01-01
This work proposes a hierarchical Design Space Exploration (DSE) for the design of multi-processor platforms targeted to specific applications with strict timing and area constraints. In particular, it considers platforms integrating multiple Application Specific Instruction Set Processors (ASIPs...
Hierarchical organization versus self-organization
Busseniers, Evo
2014-01-01
In this paper we try to define the difference between hierarchical organization and self-organization. Organization is defined as a structure with a function. So we can define the difference between hierarchical organization and self-organization both on the structure as on the function. In the next two chapters these two definitions are given. For the structure we will use some existing definitions in graph theory, for the function we will use existing theory on (self-)organization. In the t...
Hierarchical decision making for flood risk reduction
DEFF Research Database (Denmark)
Custer, Rocco; Nishijima, Kazuyoshi
2013-01-01
. In current practice, structures are often optimized individually without considering benefits of having a hierarchy of protection structures. It is here argued, that the joint consideration of hierarchically integrated protection structures is beneficial. A hierarchical decision model is utilized to analyze...... and compare the benefit of large upstream protection structures and local downstream protection structures in regard to epistemic uncertainty parameters. Results suggest that epistemic uncertainty influences the outcome of the decision model and that, depending on the magnitude of epistemic uncertainty...
Hierarchical self-organization of tectonic plates
2010-01-01
The Earth's surface is subdivided into eight large tectonic plates and many smaller ones. We reconstruct the plate tessellation history and demonstrate that both large and small plates display two distinct hierarchical patterns, described by different power-law size-relationships. While small plates display little organisational change through time, the structure of the large plates oscillate between minimum and maximum hierarchical tessellations. The organization of large plates rapidly chan...
Angelic Hierarchical Planning: Optimal and Online Algorithms
2008-12-06
restrict our attention to plans in I∗(Act, s0). Definition 2. ( Parr and Russell , 1998) A plan ah∗ is hierarchically optimal iff ah∗ = argmina∈I∗(Act,s0):T...Murdock, Dan Wu, and Fusun Yaman. SHOP2: An HTN planning system. JAIR, 20:379–404, 2003. Ronald Parr and Stuart Russell . Reinforcement Learning with...Angelic Hierarchical Planning: Optimal and Online Algorithms Bhaskara Marthi Stuart J. Russell Jason Wolfe Electrical Engineering and Computer
Hierarchical Needs, Income Comparisons and Happiness Levels
Drakopoulos, Stavros
2011-01-01
The cornerstone of the hierarchical approach is that there are some basic human needs which must be satisfied before non-basic needs come into the picture. The hierarchical structure of needs implies that the satisfaction of primary needs provides substantial increases to individual happiness compared to the subsequent satisfaction of secondary needs. This idea can be combined with the concept of comparison income which means that individuals compare rewards with individuals with similar char...
Pattern recognition and string matching
Cheng, Xiuzhen
2002-01-01
The research and development of pattern recognition have proven to be of importance in science, technology, and human activity. Many useful concepts and tools from different disciplines have been employed in pattern recognition. Among them is string matching, which receives much theoretical and practical attention. String matching is also an important topic in combinatorial optimization. This book is devoted to recent advances in pattern recognition and string matching. It consists of twenty eight chapters written by different authors, addressing a broad range of topics such as those from classifica tion, matching, mining, feature selection, and applications. Each chapter is self-contained, and presents either novel methodological approaches or applications of existing theories and techniques. The aim, intent, and motivation for publishing this book is to pro vide a reference tool for the increasing number of readers who depend upon pattern recognition or string matching in some way. This includes student...
Matching conditions in relativistic astrophysics
Quevedo, Hernando
2012-01-01
We present an exact electrovacuum solution of Einstein-Maxwell equations with infinite sets of multipole moments which can be used to describe the exterior gravitational field of a rotating charged mass distribution. We show that in the special case of a slowly rotating and slightly deformed body, the exterior solution can be matched to an interior solution belonging to the Hartle-Thorne family of approximate solutions. To search for exact interior solutions, we propose to use the derivatives of the curvature eigenvalues to formulate a $C^3-$matching condition from which the minimum radius can be derived at which the matching of interior and exterior spacetimes can be carried out. We prove the validity of the $C^3-$matching in the particular case of a static mass with a quadrupole moment. The corresponding interior solution is obtained numerically and the matching with the exterior solution gives as a result the minimum radius of the mass configuration.
Evaluating Hierarchical Structure in Music Annotations.
McFee, Brian; Nieto, Oriol; Farbood, Morwaread M; Bello, Juan Pablo
2017-01-01
Music exhibits structure at multiple scales, ranging from motifs to large-scale functional components. When inferring the structure of a piece, different listeners may attend to different temporal scales, which can result in disagreements when they describe the same piece. In the field of music informatics research (MIR), it is common to use corpora annotated with structural boundaries at different levels. By quantifying disagreements between multiple annotators, previous research has yielded several insights relevant to the study of music cognition. First, annotators tend to agree when structural boundaries are ambiguous. Second, this ambiguity seems to depend on musical features, time scale, and genre. Furthermore, it is possible to tune current annotation evaluation metrics to better align with these perceptual differences. However, previous work has not directly analyzed the effects of hierarchical structure because the existing methods for comparing structural annotations are designed for "flat" descriptions, and do not readily generalize to hierarchical annotations. In this paper, we extend and generalize previous work on the evaluation of hierarchical descriptions of musical structure. We derive an evaluation metric which can compare hierarchical annotations holistically across multiple levels. sing this metric, we investigate inter-annotator agreement on the multilevel annotations of two different music corpora, investigate the influence of acoustic properties on hierarchical annotations, and evaluate existing hierarchical segmentation algorithms against the distribution of inter-annotator agreement.
Evaluating Hierarchical Structure in Music Annotations
Directory of Open Access Journals (Sweden)
Brian McFee
2017-08-01
Full Text Available Music exhibits structure at multiple scales, ranging from motifs to large-scale functional components. When inferring the structure of a piece, different listeners may attend to different temporal scales, which can result in disagreements when they describe the same piece. In the field of music informatics research (MIR, it is common to use corpora annotated with structural boundaries at different levels. By quantifying disagreements between multiple annotators, previous research has yielded several insights relevant to the study of music cognition. First, annotators tend to agree when structural boundaries are ambiguous. Second, this ambiguity seems to depend on musical features, time scale, and genre. Furthermore, it is possible to tune current annotation evaluation metrics to better align with these perceptual differences. However, previous work has not directly analyzed the effects of hierarchical structure because the existing methods for comparing structural annotations are designed for “flat” descriptions, and do not readily generalize to hierarchical annotations. In this paper, we extend and generalize previous work on the evaluation of hierarchical descriptions of musical structure. We derive an evaluation metric which can compare hierarchical annotations holistically across multiple levels. sing this metric, we investigate inter-annotator agreement on the multilevel annotations of two different music corpora, investigate the influence of acoustic properties on hierarchical annotations, and evaluate existing hierarchical segmentation algorithms against the distribution of inter-annotator agreement.
Hierarchical Nanoceramics for Industrial Process Sensors
Energy Technology Data Exchange (ETDEWEB)
Ruud, James, A.; Brosnan, Kristen, H.; Striker, Todd; Ramaswamy, Vidya; Aceto, Steven, C.; Gao, Yan; Willson, Patrick, D.; Manoharan, Mohan; Armstrong, Eric, N., Wachsman, Eric, D.; Kao, Chi-Chang
2011-07-15
This project developed a robust, tunable, hierarchical nanoceramics materials platform for industrial process sensors in harsh-environments. Control of material structure at multiple length scales from nano to macro increased the sensing response of the materials to combustion gases. These materials operated at relatively high temperatures, enabling detection close to the source of combustion. It is anticipated that these materials can form the basis for a new class of sensors enabling widespread use of efficient combustion processes with closed loop feedback control in the energy-intensive industries. The first phase of the project focused on materials selection and process development, leading to hierarchical nanoceramics that were evaluated for sensing performance. The second phase focused on optimizing the materials processes and microstructures, followed by validation of performance of a prototype sensor in a laboratory combustion environment. The objectives of this project were achieved by: (1) synthesizing and optimizing hierarchical nanostructures; (2) synthesizing and optimizing sensing nanomaterials; (3) integrating sensing functionality into hierarchical nanostructures; (4) demonstrating material performance in a sensing element; and (5) validating material performance in a simulated service environment. The project developed hierarchical nanoceramic electrodes for mixed potential zirconia gas sensors with increased surface area and demonstrated tailored electrocatalytic activity operable at high temperatures enabling detection of products of combustion such as NOx close to the source of combustion. Methods were developed for synthesis of hierarchical nanostructures with high, stable surface area, integrated catalytic functionality within the structures for gas sensing, and demonstrated materials performance in harsh lab and combustion gas environments.
HIERARCHICAL OPTIMIZATION MODEL ON GEONETWORK
Directory of Open Access Journals (Sweden)
Z. Zha
2012-07-01
Full Text Available In existing construction experience of Spatial Data Infrastructure (SDI, GeoNetwork, as the geographical information integrated solution, is an effective way of building SDI. During GeoNetwork serving as an internet application, several shortcomings are exposed. The first one is that the time consuming of data loading has been considerately increasing with the growth of metadata count. Consequently, the efficiency of query and search service becomes lower. Another problem is that stability and robustness are both ruined since huge amount of metadata. The final flaw is that the requirements of multi-user concurrent accessing based on massive data are not effectively satisfied on the internet. A novel approach, Hierarchical Optimization Model (HOM, is presented to solve the incapability of GeoNetwork working with massive data in this paper. HOM optimizes the GeoNetwork from these aspects: internal procedure, external deployment strategies, etc. This model builds an efficient index for accessing huge metadata and supporting concurrent processes. In this way, the services based on GeoNetwork can maintain stable while running massive metadata. As an experiment, we deployed more than 30 GeoNetwork nodes, and harvest nearly 1.1 million metadata. From the contrast between the HOM-improved software and the original one, the model makes indexing and retrieval processes more quickly and keeps the speed stable on metadata amount increasing. It also shows stable on multi-user concurrent accessing to system services, the experiment achieved good results and proved that our optimization model is efficient and reliable.
Block copolymer battery separator
Energy Technology Data Exchange (ETDEWEB)
Wong, David; Balsara, Nitash Pervez
2016-04-26
The invention herein described is the use of a block copolymer/homopolymer blend for creating nanoporous materials for transport applications. Specifically, this is demonstrated by using the block copolymer poly(styrene-block-ethylene-block-styrene) (SES) and blending it with homopolymer polystyrene (PS). After blending the polymers, a film is cast, and the film is submerged in tetrahydrofuran, which removes the PS. This creates a nanoporous polymer film, whereby the holes are lined with PS. Control of morphology of the system is achieved by manipulating the amount of PS added and the relative size of the PS added. The porous nature of these films was demonstrated by measuring the ionic conductivity in a traditional battery electrolyte, 1M LiPF.sub.6 in EC/DEC (1:1 v/v) using AC impedance spectroscopy and comparing these results to commercially available battery separators.
U.S. Environmental Protection Agency — This data layer represents Census 2000 demographic data derived from the PL94-171 redistricting files and SF3. Census geographic entities include blocks, blockgroups...
Stern, Margaret
1987-01-01
Extracts from "Experimenting with Numbers" by Margaret Stern demonstrate the use of Stern Blocks to develop the conceptual base on which learning disabled students can build further mathematical skills. (DB)
Steroidal neuromuscular blocking agents
Wierda, JMKH; Mori, K; Ohmura, A; Toyooka, H; Hatano, Y; Shingu, K; Fukuda, K
1998-01-01
Since 1964 approximately 20 steroidal neuromuscular blocking agents have been evaluated clinically. Pancuronium, a bisquaternary compound designed on the drawingboard, was the first steroidal relaxant introduced into clinical practice worldwide in the 1970's. Although a major improvement, pancuroniu
Block copolymer battery separator
Wong, David; Balsara, Nitash Pervez
2016-04-26
The invention herein described is the use of a block copolymer/homopolymer blend for creating nanoporous materials for transport applications. Specifically, this is demonstrated by using the block copolymer poly(styrene-block-ethylene-block-styrene) (SES) and blending it with homopolymer polystyrene (PS). After blending the polymers, a film is cast, and the film is submerged in tetrahydrofuran, which removes the PS. This creates a nanoporous polymer film, whereby the holes are lined with PS. Control of morphology of the system is achieved by manipulating the amount of PS added and the relative size of the PS added. The porous nature of these films was demonstrated by measuring the ionic conductivity in a traditional battery electrolyte, 1M LiPF.sub.6 in EC/DEC (1:1 v/v) using AC impedance spectroscopy and comparing these results to commercially available battery separators.
Recipient block TMA technique.
Mirlacher, Martina; Simon, Ronald
2010-01-01
New high-throughput screening technologies have led to the identification of hundreds of genes with a potential role in cancer or other diseases. One way to prioritize the leads obtained in such studies is to analyze a large number of tissues for candidate gene expression. The TMA methodology is now an established and frequently used tool for high-throughput tissue analysis. The recipient block technology is the "classical" method of TMA making. In this method, minute cylindrical tissue punches typically measuring 0.6 mm in diameter are removed from donor tissue blocks and are transferred into empty "recipient" paraffin blocks. Up to 1,000 different tissues can be analyzed in one TMA block. The equipment is affordable and easy to use in places where basic skills in histology are available.
Superalloy Lattice Block Structures
Nathal, M. V.; Whittenberger, J. D.; Hebsur, M. G.; Kantzos, P. T.; Krause, D. L.
2004-01-01
Initial investigations of investment cast superalloy lattice block suggest that this technology will yield a low cost approach to utilize the high temperature strength and environmental resistance of superalloys in lightweight, damage tolerant structural configurations. Work to date has demonstrated that relatively large superalloy lattice block panels can be successfully investment cast from both IN-718 and Mar-M247. These castings exhibited mechanical properties consistent with the strength of the same superalloys measured from more conventional castings. The lattice block structure also accommodates significant deformation without failure, and is defect tolerant in fatigue. The potential of lattice block structures opens new opportunities for the use of superalloys in future generations of aircraft applications that demand strength and environmental resistance at elevated temperatures along with low weight.
DEFF Research Database (Denmark)
Miolane, Charlotte Vikkelsø
ensurethat no attack violatesthe securitybounds specifiedbygeneric attack namely exhaustivekey search and table lookup attacks. This thesis contains a general introduction to cryptography with focus on block ciphers and important block cipher designs, in particular the Advanced Encryption Standard...... by an analytic and systematic approach that allows insight to the techniques. Moreover a new procedure of generating and applying probabilistic equations in algebraic attacks on block cipher is proposed and examined. Also, we present practical results, which to our knowledge are the best algebraic results...... on small scale variants of AES. In the final part of the thesis we present a new block cipher proposal Present and examine its security against algebraic and differential cryptanalysis in particular....
Chain exchange in block copolymer micelles
Lu, Jie; Bates, Frank; Lodge, Timothy
2014-03-01
Block copolymer micelles are aggregates formed by self-assembly of amphiphilic copolymers dispersed in a selective solvent, driven by unfavorable interactions between the solvent and the core-forming block. Due to the relatively long chains being subject to additional thermodynamic and dynamic constraints (e.g., entanglements, crystallinity, vitrification), block copolymer micelles exhibit significantly slower equilibration kinetics than small molecule surfactants. As a result, details of the mechanism(s) of equilibration in block copolymer micelles remain unclear. This present works focuses on the chain exchange kinetics of poly(styrene-b-ethylenepropylene) block copolymers in squalane (C30H62) using time-resolved small angle neutron scattering (TR-SANS). A mixture of h-squalane and d-squalane is chosen so that it contrast matches a mixed 50/50 h/d polystyrene micelle core. When the temperature is appropriate and isotopically labeled chains undergo mixing, the mean core contrast with respect to the solvent decreases, and the scattering intensity is therefore reduced. This strategy allows direct probing of chain exchange rate from the time dependent scattering intensity I(q, t).
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...... history matching metode. Den foreslåede metode forsøger at forbedre konvergensen af traditionel probability perturbation ved at inkludere kvalitativ gradient information.......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...... matching dækker over arbejdsprocessen, hvor de fysiske parametre i en reservoirsimuleringsmodel bliver justeret således, at en simulering af olieproduktionen stemmer overens med egentlige målte produktionsdata. Mange history matching metoder er baseret på et geostatistisk fundament, hvilket også gør sig...
Pattern Matching in Multiple Streams
Clifford, Raphael; Porat, Ely; Sach, Benjamin
2012-01-01
We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in the streaming context, the goal is to use as little space as possible while still reporting matches quickly. We give almost matching upper and lower space bounds for three distinct pattern matching problems. For exact matching we show that the problem can be solved in constant time per arriving symbol and O(m+s) words of space. For the k-mismatch and k-differences problems we give O(k) time solutions that require O(m+ks) words of space. In all three cases we also give space lower bounds which show our methods are optimal up to a single logarithmic factor. Finally we set out a number of open problems related to this new model for pattern matching.
Multi-image matching for DSM generation from IKONOS imagery
Zhang, Li; Gruen, Armin
High-resolution satellite images at sub-5-m footprint, such as IKONOS and SPOT5 HRG/HRS images, are becoming increasingly available to the earth observation community and their respective clients. The related cameras all use linear array CCD technology for image sensing. The processing of these kinds of images provides a challenge for algorithmic redesign and this offers the possibility of reconsidering and improving many photogrammetric processing components. This contribution presents an advanced matching approach for automatic DSM generation from high-resolution satellite images. It can provide dense, precise and reliable results. The method matches multiple (more than two) images simultaneously and it uses a coarse-to-fine hierarchical solution with an effective combination of several image matching algorithms and automatic quality control. The DSMs are generated by a combination of matching results of feature points, grid points and edges. The proposed approach has been applied to IKONOS images over a testfield in Thun, Switzerland with accurate ground control points, a 1600-m height range and variable land cover, but with sub-optimal imaging conditions (snow, long shadows). The accuracy tests are based on the comparison between the reference data from an airborne laser scanner and the automatically extracted DSMs. The RMS errors for the whole area, excluding trees and bushes, are 2-3 m, while for bare ground the accuracy is about 1 m or even better.
2010-10-01
...) Wax “Vesta” matches are matches that can be ignited by friction either on a prepared surface or on a solid surface. (c) Safety matches and wax “Vesta” matches must be tightly packed in securely closed... packaging with any material other than safety matches or wax “Vesta” matches, which must be packed...
MATCHING IN INFORMAL FINANCIAL INSTITUTIONS.
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).
History Matching in Parallel Computational Environments
Energy Technology Data Exchange (ETDEWEB)
Steven Bryant; Sanjay Srinivasan; Alvaro Barrera; Sharad Yadav
2005-10-01
A novel methodology for delineating multiple reservoir domains for the purpose of history matching in a distributed computing environment has been proposed. A fully probabilistic approach to perturb permeability within the delineated zones is implemented. The combination of robust schemes for identifying reservoir zones and distributed computing significantly increase the accuracy and efficiency of the probabilistic approach. The information pertaining to the permeability variations in the reservoir that is contained in dynamic data is calibrated in terms of a deformation parameter rD. This information is merged with the prior geologic information in order to generate permeability models consistent with the observed dynamic data as well as the prior geology. The relationship between dynamic response data and reservoir attributes may vary in different regions of the reservoir due to spatial variations in reservoir attributes, well configuration, flow constrains etc. The probabilistic approach then has to account for multiple r{sub D} values in different regions of the reservoir. In order to delineate reservoir domains that can be characterized with different rD parameters, principal component analysis (PCA) of the Hessian matrix has been done. The Hessian matrix summarizes the sensitivity of the objective function at a given step of the history matching to model parameters. It also measures the interaction of the parameters in affecting the objective function. The basic premise of PC analysis is to isolate the most sensitive and least correlated regions. The eigenvectors obtained during the PCA are suitably scaled and appropriate grid block volume cut-offs are defined such that the resultant domains are neither too large (which increases interactions between domains) nor too small (implying ineffective history matching). The delineation of domains requires calculation of Hessian, which could be computationally costly and as well as restricts the current approach to
Hierarchical linear regression models for conditional quantiles
Institute of Scientific and Technical Information of China (English)
TIAN Maozai; CHEN Gemai
2006-01-01
The quantile regression has several useful features and therefore is gradually developing into a comprehensive approach to the statistical analysis of linear and nonlinear response models,but it cannot deal effectively with the data with a hierarchical structure.In practice,the existence of such data hierarchies is neither accidental nor ignorable,it is a common phenomenon.To ignore this hierarchical data structure risks overlooking the importance of group effects,and may also render many of the traditional statistical analysis techniques used for studying data relationships invalid.On the other hand,the hierarchical models take a hierarchical data structure into account and have also many applications in statistics,ranging from overdispersion to constructing min-max estimators.However,the hierarchical models are virtually the mean regression,therefore,they cannot be used to characterize the entire conditional distribution of a dependent variable given high-dimensional covariates.Furthermore,the estimated coefficient vector (marginal effects)is sensitive to an outlier observation on the dependent variable.In this article,a new approach,which is based on the Gauss-Seidel iteration and taking a full advantage of the quantile regression and hierarchical models,is developed.On the theoretical front,we also consider the asymptotic properties of the new method,obtaining the simple conditions for an n1/2-convergence and an asymptotic normality.We also illustrate the use of the technique with the real educational data which is hierarchical and how the results can be explained.
Energy Technology Data Exchange (ETDEWEB)
Yan, Kun [State Key Laboratory of Advanced Processing and Recycling of Non-ferrous Metals, Lanzhou University of Technology, Lanzhou 730050 (China); Kong, Ling-Bin, E-mail: konglb@lut.cn [State Key Laboratory of Advanced Processing and Recycling of Non-ferrous Metals, Lanzhou University of Technology, Lanzhou 730050 (China); School of Materials Science and Engineering, Lanzhou University of Technology, Lanzhou 730050 (China); Shen, Kui-Wen; Dai, Yan-Hua; Shi, Ming; Hu, Bing [State Key Laboratory of Advanced Processing and Recycling of Non-ferrous Metals, Lanzhou University of Technology, Lanzhou 730050 (China); Luo, Yong-Chun; Kang, Long [School of Materials Science and Engineering, Lanzhou University of Technology, Lanzhou 730050 (China)
2016-02-28
Graphical abstract: Preparing and activating process of nitrogen-doped hierarchical porous carbon (NHPC). - Highlights: • The well-defined PAN-b-PMMA copolymer was synthesized by atom transfer radical polymerization with narrow molecular weight distribution. • Nitrogen-doped hierarchical porous structure (NHPC) was prepared through a simple carbonization procedure of PAN-b-PMMA precursor. • NHPC possessed hierarchical porous structure with high BET surface area of 257 m{sup 2} g{sup −1} and DFT mesopore size of 14.61 nm. • Effects of activation conditions on supercapacitive behavior were systematically studied. - Abstract: The nitrogen-doped hierarchical porous carbon (NHPC) material was successfully prepared through a simple carbonization procedure of well-defined diblock copolymer precursor containing nitrogen-enriched carbon source, i.e., polyacrylonitrile (PAN), and asacrificial block, i.e., polymethylmethacrylate (PMMA). PAN-b-PMMA diblock copolymer was synthesized by atom transfer radical polymeriation (ATRP) with narrow molecular weight distribution. The as-obtained NHPC possessed nitrogen-doped hierarchical porous structure with high BET surface area of 257 m{sup 2} g{sup −1} and Nonlocal density functional theory (NLDFT) mesopore size of 14.61 nm. Surface activated nitrogen-doped hierarchical porous carbon (A-NHPC) materials were obtained by subsequent surface activation with HNO{sub 3} solution. The effects of activation conditions on supercapacitive behavior were systematically studied, a maximum specific capacitance of 314 F g{sup −1} at a current density of 0.5 A g{sup −1} was achieved in 2 M KOH aqueous electrolyte. Simultaneously, it exhibited excellent rate capability of 67.8% capacitance retention as the current density increased from 0.5 to 20 A g{sup −1} and superior cycling performance of 90% capacitance retention after 10,000 cycles at the current density of 2 A g{sup −1}.
Robust and Adaptive Block Tracking Method Based on Particle Filter
Directory of Open Access Journals (Sweden)
Bin Sun
2015-10-01
Full Text Available In the field of video analysis and processing, object tracking is attracting more and more attention especially in traffic management, digital surveillance and so on. However problems such as objects’ abrupt motion, occlusion and complex target structures would bring difficulties to academic study and engineering application. In this paper, a fragmentsbased tracking method using the block relationship coefficient is proposed. In this method, we use particle filter algorithm and object region is divided into blocks initially. The contribution of this method is that object features are not extracted just from a single block, the relationship between current block and its neighbor blocks are extracted to describe the variation of the block. Each block is weighted according to the block relationship coefficient when the block is voted on the most matched region in next frame. This method can make full use of the relationship between blocks. The experimental results demonstrate that our method can provide good performance in condition of occlusion and abrupt posture variation.
Matched Spectral Filter Imager Project
National Aeronautics and Space Administration — OPTRA proposes the development of an imaging spectrometer for greenhouse gas and volcanic gas imaging based on matched spectral filtering and compressive imaging....
Improved bounds for stochastic matching
Li, Jian
2010-01-01
In this paper we study stochastic matching problems that are motivated by applications in online dating and kidney exchange programs. We consider two probing models: edge probing and matching probing. Our main result is an algorithm that finds a matching-probing strategy attaining a small constant approximation ratio. An interesting aspect of our approach is that we compare the cost our solution to the best edge-probing strategy. Thus, we indirectly show that the best matching-probing strategy is only a constant factor away from the best edge-probing strategy. Even though our algorithm has a slightly worse approximation ratio than a greedy algorithm for edge-probing strategies, we show that the two algorithms can be combined to get improved approximations.
The impact of hierarchical memory systems on linear algebra algorithm design
Energy Technology Data Exchange (ETDEWEB)
Gallivan, K.; Jalby, W.; Meier, U.; Sameh, A.
1987-09-14
Performing an extremely detailed performance optimization analysis is counterproductive when the concern is performance behavior on a class of architecture, since general trends are obscured by the overwhelming number of machine-specific considerations required. Instead, in this paper, a methodology is used which identifies the effects of a hierarchical memory system on the performance of linear algebra algorithms on multivector processors; provides a means of producing a set of algorithm parameters, i.e., blocksizes, as functions of system parameters which yield near-optimal performance; and provides guidelines for algorithm designers which reduce the influence of the hierarchical memory system on algorithm performance to negligible levels and thereby allow them to concentrate on machine-specific optimizations. The remainder of this paper comprises five major discussions. First, the methodology and the attendant architectural model are discussed. Next, an analysis of the basic BLAS3 matrix-matrix primitive is presented. This is followed by a discussion of three block algorithms: a block LU decomposition, a block LDL/sup T/ decomposition and a block Gram-Schmidt algorithm. 22 refs., 9 figs.
An Efficient Pattern Matching Algorithm
Sleit, Azzam; Almobaideen, Wesam; Baarah, Aladdin H.; Abusitta, Adel H.
In this study, we present an efficient algorithm for pattern matching based on the combination of hashing and search trees. The proposed solution is classified as an offline algorithm. Although, this study demonstrates the merits of the technique for text matching, it can be utilized for various forms of digital data including images, audio and video. The performance superiority of the proposed solution is validated analytically and experimentally.
Review og pattern matching approaches
DEFF Research Database (Denmark)
Manfaat, D.; Duffy, Alex; Lee, B. S.
1996-01-01
This paper presents a review of pattern matching techniques. The application areas for pattern matching are extensive, ranging from CAD systems to chemical analysis and from manufacturing to image processing. Published techniques and methods are classified and assessed within the context of three...... key issues: pattern classes, similiarity types and mathing methods. It has been shown that the techniques and approaches are as diverse and varied as the applications....
Self-assembled biomimetic superhydrophobic hierarchical arrays.
Yang, Hongta; Dou, Xuan; Fang, Yin; Jiang, Peng
2013-09-01
Here, we report a simple and inexpensive bottom-up technology for fabricating superhydrophobic coatings with hierarchical micro-/nano-structures, which are inspired by the binary periodic structure found on the superhydrophobic compound eyes of some insects (e.g., mosquitoes and moths). Binary colloidal arrays consisting of exemplary large (4 and 30 μm) and small (300 nm) silica spheres are first assembled by a scalable Langmuir-Blodgett (LB) technology in a layer-by-layer manner. After surface modification with fluorosilanes, the self-assembled hierarchical particle arrays become superhydrophobic with an apparent water contact angle (CA) larger than 150°. The throughput of the resulting superhydrophobic coatings with hierarchical structures can be significantly improved by templating the binary periodic structures of the LB-assembled colloidal arrays into UV-curable fluoropolymers by a soft lithography approach. Superhydrophobic perfluoroether acrylate hierarchical arrays with large CAs and small CA hysteresis can be faithfully replicated onto various substrates. Both experiments and theoretical calculations based on the Cassie's dewetting model demonstrate the importance of the hierarchical structure in achieving the final superhydrophobic surface states. Copyright © 2013 Elsevier Inc. All rights reserved.
Analysis hierarchical model for discrete event systems
Ciortea, E. M.
2015-11-01
The This paper presents the hierarchical model based on discrete event network for robotic systems. Based on the hierarchical approach, Petri network is analysed as a network of the highest conceptual level and the lowest level of local control. For modelling and control of complex robotic systems using extended Petri nets. Such a system is structured, controlled and analysed in this paper by using Visual Object Net ++ package that is relatively simple and easy to use, and the results are shown as representations easy to interpret. The hierarchical structure of the robotic system is implemented on computers analysed using specialized programs. Implementation of hierarchical model discrete event systems, as a real-time operating system on a computer network connected via a serial bus is possible, where each computer is dedicated to local and Petri model of a subsystem global robotic system. Since Petri models are simplified to apply general computers, analysis, modelling, complex manufacturing systems control can be achieved using Petri nets. Discrete event systems is a pragmatic tool for modelling industrial systems. For system modelling using Petri nets because we have our system where discrete event. To highlight the auxiliary time Petri model using transport stream divided into hierarchical levels and sections are analysed successively. Proposed robotic system simulation using timed Petri, offers the opportunity to view the robotic time. Application of goods or robotic and transmission times obtained by measuring spot is obtained graphics showing the average time for transport activity, using the parameters sets of finished products. individually.
Hierarchical models and chaotic spin glasses
Berker, A. Nihat; McKay, Susan R.
1984-09-01
Renormalization-group studies in position space have led to the discovery of hierarchical models which are exactly solvable, exhibiting nonclassical critical behavior at finite temperature. Position-space renormalization-group approximations that had been widely and successfully used are in fact alternatively applicable as exact solutions of hierarchical models, this realizability guaranteeing important physical requirements. For example, a hierarchized version of the Sierpiriski gasket is presented, corresponding to a renormalization-group approximation which has quantitatively yielded the multicritical phase diagrams of submonolayers on graphite. Hierarchical models are now being studied directly as a testing ground for new concepts. For example, with the introduction of frustration, chaotic renormalization-group trajectories were obtained for the first time. Thus, strong and weak correlations are randomly intermingled at successive length scales, and a new microscopic picture and mechanism for a spin glass emerges. An upper critical dimension occurs via a boundary crisis mechanism in cluster-hierarchical variants developed to have well-behaved susceptibilities.
Borisagar, Viral H; Zaveri, Mukesh A
2014-01-01
A novel hierarchical stereo matching algorithm is presented which gives disparity map as output from illumination variant stereo pair. Illumination difference between two stereo images can lead to undesirable output. Stereo image pair often experience illumination variations due to many factors like real and practical situation, spatially and temporally separated camera positions, environmental illumination fluctuation, and the change in the strength or position of the light sources. Window matching and dynamic programming techniques are employed for disparity map estimation. Good quality disparity map is obtained with the optimized path. Homomorphic filtering is used as a preprocessing step to lessen illumination variation between the stereo images. Anisotropic diffusion is used to refine disparity map to give high quality disparity map as a final output. The robust performance of the proposed approach is suitable for real life circumstances where there will be always illumination variation between the images. The matching is carried out in a sequence of images representing the same scene, however in different resolutions. The hierarchical approach adopted decreases the computation time of the stereo matching problem. This algorithm can be helpful in applications like robot navigation, extraction of information from aerial surveys, 3D scene reconstruction, and military and security applications. Similarity measure SAD is often sensitive to illumination variation. It produces unacceptable disparity map results for illumination variant left and right images. Experimental results show that our proposed algorithm produces quality disparity maps for both wide range of illumination variant and invariant stereo image pair.
Directory of Open Access Journals (Sweden)
Viral H. Borisagar
2014-01-01
Full Text Available A novel hierarchical stereo matching algorithm is presented which gives disparity map as output from illumination variant stereo pair. Illumination difference between two stereo images can lead to undesirable output. Stereo image pair often experience illumination variations due to many factors like real and practical situation, spatially and temporally separated camera positions, environmental illumination fluctuation, and the change in the strength or position of the light sources. Window matching and dynamic programming techniques are employed for disparity map estimation. Good quality disparity map is obtained with the optimized path. Homomorphic filtering is used as a preprocessing step to lessen illumination variation between the stereo images. Anisotropic diffusion is used to refine disparity map to give high quality disparity map as a final output. The robust performance of the proposed approach is suitable for real life circumstances where there will be always illumination variation between the images. The matching is carried out in a sequence of images representing the same scene, however in different resolutions. The hierarchical approach adopted decreases the computation time of the stereo matching problem. This algorithm can be helpful in applications like robot navigation, extraction of information from aerial surveys, 3D scene reconstruction, and military and security applications. Similarity measure SAD is often sensitive to illumination variation. It produces unacceptable disparity map results for illumination variant left and right images. Experimental results show that our proposed algorithm produces quality disparity maps for both wide range of illumination variant and invariant stereo image pair.
Mobile Robot Hierarchical Simultaneous Localization and Mapping Using Monocular Vision
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
A hierarchical mobile robot simultaneous localization and mapping (SLAM) method that allows us to obtain accurate maps was presented. The local map level is composed of a set of local metric feature maps that are guaranteed to be statistically independent. The global level is a topological graph whose arcs are labeled with the relative location between local maps. An estimation of these relative locations is maintained with local map alignment algorithm, and more accurate estimation is calculated through a global minimization procedure using the loop closure constraint. The local map is built with Rao-Blackwellised particle filter (RBPF), where the particle filter is used to extending the path posterior by sampling new poses. The landmark position estimation and update is implemented through extended Kalman filter (EKF). Monocular vision mounted on the robot tracks the 3D natural point landmarks, which are structured with matching scale invariant feature transform (SIFT) feature pairs. The matching for multi-dimension SIFT features is implemented with a KD-tree in the time cost of O(lbN). Experiment results on Pioneer mobile robot in a real indoor environment show the superior performance of our proposed method.
DEFF Research Database (Denmark)
Bussink, Barbara E; Holst, Anders Gaarsdal; Jespersen, Lasse
2013-01-01
AimsTo determine the prevalence, predictors of newly acquired, and the prognostic value of right bundle branch block (RBBB) and incomplete RBBB (IRBBB) on a resting 12-lead electrocardiogram in men and women from the general population.Methods and resultsWe followed 18 441 participants included.......5%/2.3% in women, P Right bundle branch block was associated with significantly...... increased all-cause and cardiovascular mortality in both genders with age-adjusted hazard ratios (HR) of 1.31 [95% confidence interval (CI), 1.11-1.54] and 1.87 (95% CI, 1.48-2.36) in the gender pooled analysis with little attenuation after multiple adjustment. Right bundle branch block was associated...
31 CFR 547.302 - Blocked account; blocked property.
2010-07-01
.... 547.302 Section 547.302 Money and Finance: Treasury Regulations Relating to Money and Finance... SANCTIONS REGULATIONS General Definitions § 547.302 Blocked account; blocked property. The terms blocked account and blocked property shall mean any account or property subject to the prohibitions in § 547.201...
Huang, Qiang; Cun, Tangxiang; Zuo, Wenbin; Liu, Jianping
2015-03-01
We report the fabrication of hierarchically microstructured flower-like ZnO by a facile and single-step procedure involving poly(2-acrylamido-2-methyl-1-propanesulfonic acid) (PAMPSA) assisted aqueous chemical method. The shapes and sizes can be controlled just by varying the concentrations of the water-soluble polymer. When a suitable PAMPAS concentration was utilized, uniform well-defined and mono-dispersed chrysanthemum-like ZnO microstructures based on nanorod building blocks were obtained. The formation mechanism of the hierarchical structure was presented. The structured studies using XRD, HRTEM and SAED reveal these ZnO nanorods are composed of a single phase nature with wurtzite structure and grow along with the c-axis. FTIR spectrum indicated the incorporation of a trace of PAMPSA into ZnO crystals. HRTEM, Raman and XPS analyses showed that the hierarchical ZnO microstructures contain high concentration of oxygen vacancies which enable them exhibiting a significant intense deep-level emission centered at green luminescence in its photoluminescence spectra. They also show enhanced photocatalytic efficiency in degradation of methylene blue. It is hoped that the present work may provide a simple method to fabricate ZnO hierarchical microstructures and a positive relationship among polar plane, oxygen vacancy and green emission.
Directory of Open Access Journals (Sweden)
Linxia Wang
2012-01-01
Full Text Available Flower-like NiO hierarchical structures with 2–5 μm diameter assembled from nanosheet building blocks have been successfully fabricated via a wet-chemical method combined with thermodecomposition technology. The template-free method is facile and effective in preparing flower-like NiO superstructures in high yield. The intermediate product and final hierarchical structures are characterized by transmission electron microscopy (TEM, scanning electron microscopy (SEM, X-ray diffraction (XRD, Fourier transform IR (FTIR, and thermogravimetric analysis (TGA. The effects of growth temperature and reaction time on the morphologies of the as-prepared structures were investigated by SEM characterization and a possible mechanism for the formation of flower-like NiO is proposed. Based on the nitrogen adsorption and desorption measurements, the BET surface area of the as-obtained sample is 55.7 m2/g and the pore-size distribution plot indicates a bimodal mesopore distribution, with pore sizes of ca. 2.6 nm and 7.4 nm, respectively. In comparison with sphere-like and rod-like structures, the flower-like NiO hierarchical structures show an excellent ability to rapidly remove various pollutants when used as adsorbent and photocatalyst in waste-water treatment, which may be attributed to its unique hierarchical and porous surface structures.
Biased trapping issue on weighted hierarchical networks
Indian Academy of Sciences (India)
Meifeng Dai; Jie Liu; Feng Zhu
2014-10-01
In this paper, we present trapping issues of weight-dependent walks on weighted hierarchical networks which are based on the classic scale-free hierarchical networks. Assuming that edge’s weight is used as local information by a random walker, we introduce a biased walk. The biased walk is that a walker, at each step, chooses one of its neighbours with a probability proportional to the weight of the edge. We focus on a particular case with the immobile trap positioned at the hub node which has the largest degree in the weighted hierarchical networks. Using a method based on generating functions, we determine explicitly the mean first-passage time (MFPT) for the trapping issue. Let parameter (0 < < 1) be the weight factor. We show that the efficiency of the trapping process depends on the parameter a; the smaller the value of a, the more efficient is the trapping process.
Improving broadcast channel rate using hierarchical modulation
Meric, Hugo; Arnal, Fabrice; Lesthievent, Guy; Boucheret, Marie-Laure
2011-01-01
We investigate the design of a broadcast system where the aim is to maximise the throughput. This task is usually challenging due to the channel variability. Forty years ago, Cover introduced and compared two schemes: time sharing and superposition coding. The second scheme was proved to be optimal for some channels. Modern satellite communications systems such as DVB-SH and DVB-S2 mainly rely on time sharing strategy to optimize throughput. They consider hierarchical modulation, a practical implementation of superposition coding, but only for unequal error protection or backward compatibility purposes. We propose in this article to combine time sharing and hierarchical modulation together and show how this scheme can improve the performance in terms of available rate. We present the gain on a simple channel modeling the broadcasting area of a satellite. Our work is applied to the DVB-SH standard, which considers hierarchical modulation as an optional feature.
Incentive Mechanisms for Hierarchical Spectrum Markets
Iosifidis, George; Alpcan, Tansu; Koutsopoulos, Iordanis
2011-01-01
We study spectrum allocation mechanisms in hierarchical multi-layer markets which are expected to proliferate in the near future based on the current spectrum policy reform proposals. We consider a setting where a state agency sells spectrum to Primary Operators (POs) and in turn these resell it to Secondary Operators (SOs) through auctions. We show that these hierarchical markets do not result in a socially efficient spectrum allocation which is aimed by the agency, due to lack of coordination among the entities in different layers and the inherently selfish revenue-maximizing strategy of POs. In order to reconcile these opposing objectives, we propose an incentive mechanism which aligns the strategy and the actions of the POs with the objective of the agency, and thus it leads to system performance improvement in terms of social welfare. This pricing based mechanism constitutes a method for hierarchical market regulation and requires the feedback provision from SOs. A basic component of the proposed incenti...
Hierarchical self-organization of tectonic plates
Morra, Gabriele; Müller, R Dietmar
2010-01-01
The Earth's surface is subdivided into eight large tectonic plates and many smaller ones. We reconstruct the plate tessellation history and demonstrate that both large and small plates display two distinct hierarchical patterns, described by different power-law size-relationships. While small plates display little organisational change through time, the structure of the large plates oscillate between minimum and maximum hierarchical tessellations. The organization of large plates rapidly changes from a weak hierarchy at 120-100 million years ago (Ma) towards a strong hierarchy, which peaked at 65-50, Ma subsequently relaxing back towards a minimum hierarchical structure. We suggest that this fluctuation reflects an alternation between top and bottom driven plate tectonics, revealing a previously undiscovered tectonic cyclicity at a timescale of 100 million years.
Towards a sustainable manufacture of hierarchical zeolites.
Verboekend, Danny; Pérez-Ramírez, Javier
2014-03-01
Hierarchical zeolites have been established as a superior type of aluminosilicate catalysts compared to their conventional (purely microporous) counterparts. An impressive array of bottom-up and top-down approaches has been developed during the last decade to design and subsequently exploit these exciting materials catalytically. However, the sustainability of the developed synthetic methods has rarely been addressed. This paper highlights important criteria to ensure the ecological and economic viability of the manufacture of hierarchical zeolites. Moreover, by using base leaching as a promising case study, we verify a variety of approaches to increase reactor productivity, recycle waste streams, prevent the combustion of organic compounds, and minimize separation efforts. By reducing their synthetic footprint, hierarchical zeolites are positioned as an integral part of sustainable chemistry. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Classification using Hierarchical Naive Bayes models
DEFF Research Database (Denmark)
Langseth, Helge; Dyhre Nielsen, Thomas
2006-01-01
Classification problems have a long history in the machine learning literature. One of the simplest, and yet most consistently well-performing set of classifiers is the Naïve Bayes models. However, an inherent problem with these classifiers is the assumption that all attributes used to describe...... an instance are conditionally independent given the class of that instance. When this assumption is violated (which is often the case in practice) it can reduce classification accuracy due to “information double-counting” and interaction omission. In this paper we focus on a relatively new set of models......, termed Hierarchical Naïve Bayes models. Hierarchical Naïve Bayes models extend the modeling flexibility of Naïve Bayes models by introducing latent variables to relax some of the independence statements in these models. We propose a simple algorithm for learning Hierarchical Naïve Bayes models...
Hierarchical Neural Network Structures for Phoneme Recognition
Vasquez, Daniel; Minker, Wolfgang
2013-01-01
In this book, hierarchical structures based on neural networks are investigated for automatic speech recognition. These structures are evaluated on the phoneme recognition task where a Hybrid Hidden Markov Model/Artificial Neural Network paradigm is used. The baseline hierarchical scheme consists of two levels each which is based on a Multilayered Perceptron. Additionally, the output of the first level serves as a second level input. The computational speed of the phoneme recognizer can be substantially increased by removing redundant information still contained at the first level output. Several techniques based on temporal and phonetic criteria have been investigated to remove this redundant information. The computational time could be reduced by 57% whilst keeping the system accuracy comparable to the baseline hierarchical approach.
Universal hierarchical behavior of citation networks
Mones, Enys; Vicsek, Tamás
2014-01-01
Many of the essential features of the evolution of scientific research are imprinted in the structure of citation networks. Connections in these networks imply information about the transfer of knowledge among papers, or in other words, edges describe the impact of papers on other publications. This inherent meaning of the edges infers that citation networks can exhibit hierarchical features, that is typical of networks based on decision-making. In this paper, we investigate the hierarchical structure of citation networks consisting of papers in the same field. We find that the majority of the networks follow a universal trend towards a highly hierarchical state, and i) the various fields display differences only concerning their phase in life (distance from the "birth" of a field) or ii) the characteristic time according to which they are approaching the stationary state. We also show by a simple argument that the alterations in the behavior are related to and can be understood by the degree of specializatio...
Analysis of ground state in random bipartite matching
Shi, Gui-Yuan; Liao, Hao; Zhang, Yi-Cheng
2015-01-01
In human society, a lot of social phenomena can be concluded into a mathematical problem called the bipartite matching, one of the most well known model is the marriage problem proposed by Gale and Shapley. In this article, we try to find out some intrinsic properties of the ground state of this model and thus gain more insights and ideas about the matching problem. We apply Kuhn-Munkres Algorithm to find out the numerical ground state solution of the system. The simulation result proves the previous theoretical analysis using replica method. In the result, we also find out the amount of blocking pairs which can be regarded as a representative of the system stability. Furthermore, we discover that the connectivity in the bipartite matching problem has a great impact on the stability of the ground state, and the system will become more unstable if there were more connections between men and women.
Complexity of major UK companies between 2006 and 2010: Hierarchical structure method approach
Ulusoy, Tolga; Keskin, Mustafa; Shirvani, Ayoub; Deviren, Bayram; Kantar, Ersin; Çaǧrı Dönmez, Cem
2012-11-01
This study reports on topology of the top 40 UK companies that have been analysed for predictive verification of markets for the period 2006-2010, applying the concept of minimal spanning tree and hierarchical tree (HT) analysis. Construction of the minimal spanning tree (MST) and the hierarchical tree (HT) is confined to a brief description of the methodology and a definition of the correlation function between a pair of companies based on the London Stock Exchange (LSE) index in order to quantify synchronization between the companies. A derivation of hierarchical organization and the construction of minimal-spanning and hierarchical trees for the 2006-2008 and 2008-2010 periods have been used and the results validate the predictive verification of applied semantics. The trees are known as useful tools to perceive and detect the global structure, taxonomy and hierarchy in financial data. From these trees, two different clusters of companies in 2006 were detected. They also show three clusters in 2008 and two between 2008 and 2010, according to their proximity. The clusters match each other as regards their common production activities or their strong interrelationship. The key companies are generally given by major economic activities as expected. This work gives a comparative approach between MST and HT methods from statistical physics and information theory with analysis of financial markets that may give new valuable and useful information of the financial market dynamics.
Directory of Open Access Journals (Sweden)
A. J. Perez-Diaz
2010-08-01
Full Text Available Fingerprint verification is the most important step in the fingerprint-based biometric systems. The matching score islinked to the chance of identifying a person. Nowadays, two fingerprint matching methods are the most popular: thecorrelation-based method and the minutiae-based method. In this work, three biometric systems were evaluated:Neurotechnology Verifinger 6.0 Extended, Innovatrics IDKit SDK and Griaule Fingerprint SDK 2007. The evaluationwas performed according to the experiments of the Fingerprint Verification Competition (FVC. The influence of thefingerprint rotation degrees on false match rate (FMR and false non-match rate (FNMR was evaluated. The resultsshowed that the FMR values increase as rotation degrees increase too, meanwhile, the FNMR values decrease.Experimental results demonstrate that Verifinger SDK shows good performance on false non-match testing, with anFNMR mean of 7%, followed by IDKit SDK (6.71% ~ 13.66% and Fingerprint SDK (50%. However, Fingerprint SDKdemonstrates a better performance on false match testing, with an FMR mean of ~0%, followed by Verifinger SDK(7.62% - 9% and IDKit SDK (above 28%. As result of the experiments, Verifinger SDK had, in general, the bestperformance. Subsequently, we calculated the regression functions to predict the behavior of FNMR and FMR fordifferent threshold values with different rotation degrees.
Hierarchical control of electron-transfer
DEFF Research Database (Denmark)
Westerhoff, Hans V.; Jensen, Peter Ruhdal; Egger, Louis;
1997-01-01
In this chapter the role of electron transfer in determining the behaviour of the ATP synthesising enzyme in E. coli is analysed. It is concluded that the latter enzyme lacks control because of special properties of the electron transfer components. These properties range from absence of a strong...... back pressure by the protonmotive force on the rate of electron transfer to hierarchical regulation of the expression of the gens that encode the electron transfer proteins as a response to changes in the bioenergetic properties of the cell.The discussion uses Hierarchical Control Analysis...
Genetic Algorithm for Hierarchical Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Sajid Hussain
2007-09-01
Full Text Available Large scale wireless sensor networks (WSNs can be used for various pervasive and ubiquitous applications such as security, health-care, industry automation, agriculture, environment and habitat monitoring. As hierarchical clusters can reduce the energy consumption requirements for WSNs, we investigate intelligent techniques for cluster formation and management. A genetic algorithm (GA is used to create energy efficient clusters for data dissemination in wireless sensor networks. The simulation results show that the proposed intelligent hierarchical clustering technique can extend the network lifetime for different network deployment environments.
DC Hierarchical Control System for Microgrid Applications
Lu, Xiaonan; Sun, Kai; Guerrero, Josep M.; Huang, Lipei
2013-01-01
In order to enhance the DC side performance of AC-DC hybrid microgrid,a DC hierarchical control system is proposed in this paper.To meet the requirement of DC load sharing between the parallel power interfaces,droop method is adopted.Meanwhile,DC voltage secondary control is employed to restore the deviation in the DC bus voltage.The hierarchical control system is composed of two levels.DC voltage and AC current controllers are achieved in the primary control level.
Hierarchical social networks and information flow
López, Luis; F. F. Mendes, Jose; Sanjuán, Miguel A. F.
2002-12-01
Using a simple model for the information flow on social networks, we show that the traditional hierarchical topologies frequently used by companies and organizations, are poorly designed in terms of efficiency. Moreover, we prove that this type of structures are the result of the individual aim of monopolizing as much information as possible within the network. As the information is an appropriate measurement of centrality, we conclude that this kind of topology is so attractive for leaders, because the global influence each actor has within the network is completely determined by the hierarchical level occupied.
Analyzing security protocols in hierarchical networks
DEFF Research Database (Denmark)
Zhang, Ye; Nielson, Hanne Riis
2006-01-01
Validating security protocols is a well-known hard problem even in a simple setting of a single global network. But a real network often consists of, besides the public-accessed part, several sub-networks and thereby forms a hierarchical structure. In this paper we first present a process calculus...... capturing the characteristics of hierarchical networks and describe the behavior of protocols on such networks. We then develop a static analysis to automate the validation. Finally we demonstrate how the technique can benefit the protocol development and the design of network systems by presenting a series...
Hierarchic Models of Turbulence, Superfluidity and Superconductivity
Kaivarainen, A
2000-01-01
New models of Turbulence, Superfluidity and Superconductivity, based on new Hierarchic theory, general for liquids and solids (physics/0102086), have been proposed. CONTENTS: 1 Turbulence. General description; 2 Mesoscopic mechanism of turbulence; 3 Superfluidity. General description; 4 Mesoscopic scenario of fluidity; 5 Superfluidity as a hierarchic self-organization process; 6 Superfluidity in 3He; 7 Superconductivity: General properties of metals and semiconductors; Plasma oscillations; Cyclotron resonance; Electroconductivity; 8. Microscopic theory of superconductivity (BCS); 9. Mesoscopic scenario of superconductivity: Interpretation of experimental data in the framework of mesoscopic model of superconductivity.
Hierarchical Analysis of the Omega Ontology
Energy Technology Data Exchange (ETDEWEB)
Joslyn, Cliff A.; Paulson, Patrick R.
2009-12-01
Initial delivery for mathematical analysis of the Omega Ontology. We provide an analysis of the hierarchical structure of a version of the Omega Ontology currently in use within the US Government. After providing an initial statistical analysis of the distribution of all link types in the ontology, we then provide a detailed order theoretical analysis of each of the four main hierarchical links present. This order theoretical analysis includes the distribution of components and their properties, their parent/child and multiple inheritance structure, and the distribution of their vertical ranks.
Understanding Y haplotype matching probability.
Brenner, Charles H
2014-01-01
The Y haplotype population-genetic terrain is better explored from a fresh perspective rather than by analogy with the more familiar autosomal ideas. For haplotype matching probabilities, versus for autosomal matching probabilities, explicit attention to modelling - such as how evolution got us where we are - is much more important while consideration of population frequency is much less so. This paper explores, extends, and explains some of the concepts of "Fundamental problem of forensic mathematics - the evidential strength of a rare haplotype match". That earlier paper presented and validated a "kappa method" formula for the evidential strength when a suspect matches a previously unseen haplotype (such as a Y-haplotype) at the crime scene. Mathematical implications of the kappa method are intuitive and reasonable. Suspicions to the contrary raised in rest on elementary errors. Critical to deriving the kappa method or any sensible evidential calculation is understanding that thinking about haplotype population frequency is a red herring; the pivotal question is one of matching probability. But confusion between the two is unfortunately institutionalized in much of the forensic world. Examples make clear why (matching) probability is not (population) frequency and why uncertainty intervals on matching probabilities are merely confused thinking. Forensic matching calculations should be based on a model, on stipulated premises. The model inevitably only approximates reality, and any error in the results comes only from error in the model, the inexactness of the approximation. Sampling variation does not measure that inexactness and hence is not helpful in explaining evidence and is in fact an impediment. Alternative haplotype matching probability approaches that various authors have considered are reviewed. Some are based on no model and cannot be taken seriously. For the others, some evaluation of the models is discussed. Recent evidence supports the adequacy of
Matching illumination of solid objects.
Pont, Sylvia C; Koenderink, Jan J
2007-04-01
The appearance of objects is determined by their surface reflectance and roughness and by the light field. Conversely, human observers might derive properties of the light field from the appearance of objects. The inverse problem has no unique solution, so perceptual interactions between reflectance, roughness, and lightfield are to be expected. In two separate experiments, we tested whether observers are able to match the illumination of spheres under collimated illumination only (matching of illumination direction) and under more or less diffuse illumination (matching of illumination direction and directedness of the beam). We found that observers are quite able to match collimated illumination directions of two rendered Lambertian spheres. Matching of the collimated beam directions of a Lambertian sphere and that of a real object with arbitrary reflectance and roughness properties resulted in similar results for the azimuthal angle, but in higher variance for the polar angle. Translucent objects and a tennis ball were found to be systematic outliers. If the directedness of the beam was also varied, the direction settings showed larger variance for more diffuse illumination. The directedness settings showed an overall quite large variance and, interestingly, interacted with the polar angle settings. We discuss possible photometrical mechanisms behind these effects.
Osmosis and thermodynamics explained by solute blocking
Nelson, Peter Hugo
2016-01-01
A solute-blocking model is presented that provides a kinetic explanation of osmosis and ideal solution thermodynamics. It validates a diffusive model of osmosis that is distinct from the traditional convective flow model of osmosis. Osmotic equilibrium occurs when the fraction of water molecules in solution matches the fraction of pure water molecules that have enough energy to overcome the pressure difference. Solute-blocking also provides a kinetic explanation for why Raoult's law and the other colligative properties depend on the mole fraction (but not the size) of the solute particles, resulting in a novel kinetic explanation for the entropy of mixing and chemical potential of ideal solutions. Some of its novel predictions have been confirmed, others can be tested experimentally or by simulation.
Osmosis and thermodynamics explained by solute blocking.
Nelson, Peter Hugo
2017-01-01
A solute-blocking model is presented that provides a kinetic explanation of osmosis and ideal solution thermodynamics. It validates a diffusive model of osmosis that is distinct from the traditional convective flow model of osmosis. Osmotic equilibrium occurs when the fraction of water molecules in solution matches the fraction of pure water molecules that have enough energy to overcome the pressure difference. Solute-blocking also provides a kinetic explanation for why Raoult's law and the other colligative properties depend on the mole fraction (but not the size) of the solute particles, resulting in a novel kinetic explanation for the entropy of mixing and chemical potential of ideal solutions. Some of its novel predictions have been confirmed; others can be tested experimentally or by simulation.
Gauge Blocks – A Zombie Technology
Doiron, Ted
2008-01-01
Gauge blocks have been the primary method for disseminating length traceability for over 100 years. Their longevity was based on two things: the relatively low cost of delivering very high accuracy to users, and the technical limitation that the range of high precision gauging systems was very small. While the first reason is still true, the second factor is being displaced by changes in measurement technology since the 1980s. New long range sensors do not require master gauges that are nearly the same length as the part being inspected, and thus one of the primary attributes of gauge blocks, wringing stacks to match the part, is no longer needed. Relaxing the requirement that gauges wring presents an opportunity to develop new types of end standards that would increase the accuracy and usefulness of gauging systems. PMID:27096119
... along with the National Institute of Dental and Craniofacial Research (NIDCR) and the National Institute of General Medical Sciences (NIGMS). This finding shows that a specific combination of two molecules can block only pain-related neurons. It holds the promise of major ...
1983-03-01
1967, Cedergren 1974, Federal Highway .’,U .. V,47 -’":: 37 Administration 1980). Block pavements have essentially the same prob- lems with moisture...Vicksburg, Miss. Cedergren , H. R. 1974. Drainage of Highway and Airfield Pavements, John Wiley and Sons, New VOk. I Cement and Concrete Association
Directory of Open Access Journals (Sweden)
Evie Lamtiur
2015-08-01
Full Text Available Young patients with class II skeletal malocclusion are often found. To avoid further discrepancy of this case, myofunctional therapy is one of the options. Functional appliance often used for such treatment. Functional appliance has been modified since activator was introduced by Andresen. With its bulky shape, activator makes difficulty for patient to speak and eat. Patient unable to wear it full time due to uncomfortness and negative facial appearance. In 1977, Clark developed twin block to overcome the weakness of previous appliances. A more simple design allows patient to be more comfortable and willing to wear it longer. Twin block is myofunctional appliance to reposition the mandible forward for skeletal class II correction with retruded mandible. This paper describes the design, clinical management effects of twin block treatment and brief case presentation using twin block appliance. Similar to the study reports found, this case revealed improvement of facial appearance, decrease overjet and overbite, improvement of molar relationship and good compliance of patient.
Contaminated soil concrete blocks
Korte, de A.C.J.; Brouwers, H.J.H.; Limbachiya, Mukesh C.; Kew, Hsein Y.
2009-01-01
According to Dutch law the contaminated soil needs to be remediated or immobilised. The main focus in this article is the design of concrete blocks, containing contaminated soil, that are suitable for large production, financial feasible and meets all technical and environmental requirements. In ord
Directory of Open Access Journals (Sweden)
William R. Veal
1999-09-01
Full Text Available This study examined the effects of a tri-schedule on the academic achievement of students in a high school. The tri-schedule consists of traditional, 4x4 block, and hybrid schedules running at the same time in the same high school. Effectiveness of the schedules was determined from the state mandated test of basic skills in reading, language, and mathematics. Students who were in a particular schedule their freshman year were tested at the beginning of their sophomore year. A statistical ANCOVA test was performed using the schedule types as independent variables and cognitive skill index and GPA as covariates. For reading and language, there was no statistically significant difference in test results. There was a statistical difference mathematics-computation. Block mathematics is an ideal format for obtaining more credits in mathematics, but the block format does little for mathematics achievement and conceptual understanding. The results have content specific implications for schools, administrations, and school boards who are considering block scheduling adoption.
Approximating Graphic TSP by Matchings
Mömke, Tobias
2011-01-01
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost. For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the conjectured ratio 4/3. The framework allows for generalizations in a natural way and also leads to a 1.586-approximation algorithm for the traveling salesman path problem on graphic metrics where the start and end vertices are prespecified.
Oflazer, K
1996-01-01
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree approximately, that is, within a certain error tolerance. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. The algorithm has been implemented on SparcStations, and for large randomly generated synthetic tree databases (some having tens of thousands of trees) it can associatively search for trees with a small error, in a matter of tenths of a second to few seconds.
Memristor-based pattern matching
Klimo, Martin; Such, Ondrej; Skvarek, Ondrej; Fratrik, Milan
2014-10-01
Pattern matching is a machine learning area that requires high-performance hardware. It has been hypothesized that massively parallel designs, which avoid von Neumann architecture, could provide a significant performance boost. Such designs can advantageously use memristive switches. This paper discusses a two-stage design that implements the induced ordered weighted average (IOWA) method for pattern matching. We outline the circuit structure and discuss how a functioning circuit can be achieved using metal oxide devices. We describe our simulations of memristive circuits and illustrate their performance on a vowel classification task.
Rethinking the Match: A Proposal for Modern Match-Making.
Ray, Chris; Bishop, Steven E; Dow, Alan W
2017-06-27
Since the 1950s, the National Resident Matching Program, or "the Match," has governed the placement of medical students into residencies. The Match was created to protect students in an era when residency positions outnumbered applicants and hospitals pressured students early in their academic careers to commit to a residency position. Now, however, applicants outnumber positions, applicants are applying to increasing numbers of programs, and the costs of the Match for applicants and programs are high. Meanwhile, medical education is evolving toward a competency-based approach, a U.S. physician shortage is predicted, and some researchers describe a "July effect"-worse clinical outcomes correlated with the mass entry of new residents.Against this background, the authors argue for adopting a more modern, free-market approach to residency match-making that might better suit the needs of applicants, programs, and the public. They propose allowing students who have been identified by their medical schools as having achieved graduation-level competency to apply to residency programs at any point during the year. Residency programs would set their own application timetables and extend offers in an ongoing fashion. Students, counseled by their schools, would accept or decline offers as desired. The authors argue this approach would better support competency-based education while allowing applicants and programs more choice regarding how they engage and adapt within the selection process. The approach's staggered start times for new residents might attenuate the July effect and improve outcomes for patients. Medical students might also enter and thereby complete residency earlier, increasing the physician workforce.
Fabrication of hierarchical -Co(OH)2 microspheres via hydrothermal process
Indian Academy of Sciences (India)
Guang Sheng Cao; Xiao Juan Zhang; Ling Su
2011-07-01
Hierarchical -Co(OH)2 microspheres with 20–50 m diameter assembled from nanoplate building blocks were successfully fabricated via a hydrothermal process in the presence of a cation surfactant cetyltrimethylammonium bromide (CTAB). The products are characterized in detail by multiform techniques: X-ray diffraction, scanning electron microscopy, energy-dispersive X-ray analysis. The effect of CTAB and pH value on the -Co(OH)2 morphology was also investigated. When pH value is maintained at 9, an appropriate added amount of CTAB (3 g) is the crucial prerequisite for the formation of this interesting morphology. In this experiment, pH value of the solution and the cation surfactant CTAB together results in the formation of hierarchical -Co(OH)2 microsphere structures assembled from nanoplates.
Spinning Hierarchical Gold Nanowire Microfibers by Shear Alignment and Intermolecular Self-Assembly.
Reiser, Beate; Gerstner, Dominik; Gonzalez-Garcia, Lola; Maurer, Johannes H M; Kanelidis, Ioannis; Kraus, Tobias
2017-05-23
Hierarchical structures lend strength to natural fibers made of soft nanoscale building blocks. Intermolecular interactions connect the components at different levels of hierarchy, distribute stresses, and guarantee structural integrity under load. Here, we show that synthetic ultrathin gold nanowires with interacting ligand shells can be spun into biomimetic, free-standing microfibers. A solution spinning process first aligns the wires, then lets their ligand shells interact, and finally converts them into a hierarchical superstructure. The resulting fiber contained 80 vol % organic ligand but was strong enough to be removed from the solution, dried, and mechanically tested. Fiber strength depended on the wire monomer alignment. Shear in the extrusion nozzle was systematically changed to obtain process-structure-property relations. The degree of nanowire alignment changed breaking stresses by a factor of 1.25 and the elongation at break by a factor of 2.75. Plasma annealing of the fiber to form a solid metal shell decreased the breaking stress by 65%.
Hierarchical porous bioactive glasses/PLGA-magnetic SBA-15 for dual-drug release.
Ma, Jie; Lin, Huiming; Li, Xiaofeng; Bian, Chunhui; Xiang, Di; Han, Xiao; Wu, Xiaodan; Qu, Fengyu
2014-06-01
The hierarchical porous bioglass combined with magnetic SBA-15 was synthesized. The bioactive glass materials possess a hierarchical porous structure with the macroporous (50μm) and the mesoporous (3.86nm) structures derived from the plant template (cattail stem) and triblock polyethylene oxide-propylene oxide block copolymer (P123), respectively. Magnetic SBA-15 was synthesized by adopting the post assembly method using Fe(NO3)3 as iron source and ethylene glycol as reduction. After coating PLGA, PLGA-IBU-magnetic SBA-15 also possessed super-paramagnetism and the corresponding saturation magnetizations (Ms) could reach 2.6emug(-1). Metformin HCl (MH) and ibuprofen (IBU) were used as model drugs, and the drug release kinetics was studied. MH and IBU could release 60% and 85% from the sample respectively. The system shows excellent dual-drug controlled delivery performance and good bioactivity in vitro that leads to good potential application on bone regeneration.
A Direct Elliptic Solver Based on Hierarchically Low-Rank Schur Complements
Chávez, Gustavo
2017-03-17
A parallel fast direct solver for rank-compressible block tridiagonal linear systems is presented. Algorithmic synergies between Cyclic Reduction and Hierarchical matrix arithmetic operations result in a solver with O(Nlog2N) arithmetic complexity and O(NlogN) memory footprint. We provide a baseline for performance and applicability by comparing with well-known implementations of the $$\\\\mathcal{H}$$ -LU factorization and algebraic multigrid within a shared-memory parallel environment that leverages the concurrency features of the method. Numerical experiments reveal that this method is comparable with other fast direct solvers based on Hierarchical Matrices such as $$\\\\mathcal{H}$$ -LU and that it can tackle problems where algebraic multigrid fails to converge.
Hybrid Direct Write Lithographic Strategies for Complex Hierarchical Structures
Singer, Jonathan P.
With the number of alternative lithographic techniques for high resolution and 3D patterning rapidly increasing, there is a need to identify a set of scalable techniques which balances the ability to arbitrarily control every detail of a target pattern and to produce these complex patterns at a high rate. It is in this way that metamaterial devices put forward on a lab scale for applications such as phononics, photonics, and plasmonics can be realized in the industrial scale. This thesis, in approaching this challenge, utilizes combinations of patterning techniques, leveraging the ability for "large" scale alternative lithographic techniques, such as interference lithography or self-assembly, to create the same nanostructured morphology over a large area combined with laser direct write. The process of drawing a single line or isolated voxel can result in a hierarchical pattern defined by the latent motif of the larger-scale technique. The net resuh is to shift the burden of high resolution patterning from the direct write to the large scale technique, effectively decoupling the correlation between the level of detail and the patterning speed and control. More specifically, the following combinations with laser direct writing were investigated: (1) proximity field nanopatterning for the predefinition of diffraction-order-defined 3D resonators which were applied as "stand-up" plasmodic microresonators, (2) dewetting to conduct development-free 2D patterning of isolated sub-micron lines, and, via overlap effects, nanoscale ( <1 00 nm) gratings, (3) block copolymer self-assembly to initiate the simultaneous annealing and alignment of near-equilibrium microdomains from a metastable starting morphology, and (4) interference lithography to fabricate 3D sub-micron periodic and quasiperiodic hierarchical structures with controllable positioning and tunable fill fraction that has potential for applications to microphotonics. In conjunction with the experimental components
Hierarchical machining materials and their performance
DEFF Research Database (Denmark)
Sidorenko, Daria; Loginov, Pavel; Levashov, Evgeny
2016-01-01
as nanoparticles in the binder, or polycrystalline, aggregate-like reinforcements, also at several scale levels). Such materials can ensure better productivity, efficiency, and lower costs of drilling, cutting, grinding, and other technological processes. This article reviews the main groups of hierarchical...
Hierarchical Optimization of Material and Structure
DEFF Research Database (Denmark)
Rodrigues, Helder C.; Guedes, Jose M.; Bendsøe, Martin P.
2002-01-01
This paper describes a hierarchical computational procedure for optimizing material distribution as well as the local material properties of mechanical elements. The local properties are designed using a topology design approach, leading to single scale microstructures, which may be restricted...... in various ways, based on design and manufacturing criteria. Implementation issues are also discussed and computational results illustrate the nature of the procedure....
Hierarchical structure of nanofibers by bubbfil spinning
Directory of Open Access Journals (Sweden)
Liu Chang
2015-01-01
Full Text Available A polymer bubble is easy to be broken under a small external force, various different fragments are formed, which can be produced to different morphologies of products including nanofibers and plate-like strip. Polyvinyl-alcohol/honey solution is used in the experiment to show hierarchical structure by the bubbfil spinning.
Sharing the proceeds from a hierarchical venture
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Moreno-Ternero, Juan D.; Tvede, Mich;
2017-01-01
We consider the problem of distributing the proceeds generated from a joint venture in which the participating agents are hierarchically organized. We introduce and characterize a family of allocation rules where revenue ‘bubbles up’ in the hierarchy. The family is flexible enough to accommodate...
Metal oxide nanostructures with hierarchical morphology
Ren, Zhifeng; Lao, Jing Yu; Banerjee, Debasish
2007-11-13
The present invention relates generally to metal oxide materials with varied symmetrical nanostructure morphologies. In particular, the present invention provides metal oxide materials comprising one or more metallic oxides with three-dimensionally ordered nanostructural morphologies, including hierarchical morphologies. The present invention also provides methods for producing such metal oxide materials.
Hierarchical Scaling in Systems of Natural Cities
Chen, Yanguang
2016-01-01
Hierarchies can be modeled by a set of exponential functions, from which we can derive a set of power laws indicative of scaling. These scaling laws are followed by many natural and social phenomena such as cities, earthquakes, and rivers. This paper is devoted to revealing the scaling patterns in systems of natural cities by reconstructing the hierarchy with cascade structure. The cities of America, Britain, France, and Germany are taken as examples to make empirical analyses. The hierarchical scaling relations can be well fitted to the data points within the scaling ranges of the size and area of the natural cities. The size-number and area-number scaling exponents are close to 1, and the allometric scaling exponent is slightly less than 1. The results suggest that natural cities follow hierarchical scaling laws and hierarchical conservation law. Zipf's law proved to be one of the indications of the hierarchical scaling, and the primate law of city-size distribution represents a local pattern and can be mer...
Semiparametric Quantile Modelling of Hierarchical Data
Institute of Scientific and Technical Information of China (English)
Mao Zai TIAN; Man Lai TANG; Ping Shing CHAN
2009-01-01
The classic hierarchical linear model formulation provides a considerable flexibility for modelling the random effects structure and a powerful tool for analyzing nested data that arise in various areas such as biology, economics and education. However, it assumes the within-group errors to be independently and identically distributed (i.i.d.) and models at all levels to be linear. Most importantly, traditional hierarchical models (just like other ordinary mean regression methods) cannot characterize the entire conditional distribution of a dependent variable given a set of covariates and fail to yield robust estimators. In this article, we relax the aforementioned and normality assumptions, and develop a so-called Hierarchical Semiparametric Quantile Regression Models in which the within-group errors could be heteroscedastic and models at some levels are allowed to be nonparametric. We present the ideas with a 2-level model. The level-l model is specified as a nonparametric model whereas level-2 model is set as a parametric model. Under the proposed semiparametric setting the vector of partial derivatives of the nonparametric function in level-1 becomes the response variable vector in level 2. The proposed method allows us to model the fixed effects in the innermost level (i.e., level 2) as a function of the covariates instead of a constant effect. We outline some mild regularity conditions required for convergence and asymptotic normality for our estimators. We illustrate our methodology with a real hierarchical data set from a laboratory study and some simulation studies.
Hierarchical Context Modeling for Video Event Recognition.
Wang, Xiaoyang; Ji, Qiang
2016-10-11
Current video event recognition research remains largely target-centered. For real-world surveillance videos, targetcentered event recognition faces great challenges due to large intra-class target variation, limited image resolution, and poor detection and tracking results. To mitigate these challenges, we introduced a context-augmented video event recognition approach. Specifically, we explicitly capture different types of contexts from three levels including image level, semantic level, and prior level. At the image level, we introduce two types of contextual features including the appearance context features and interaction context features to capture the appearance of context objects and their interactions with the target objects. At the semantic level, we propose a deep model based on deep Boltzmann machine to learn event object representations and their interactions. At the prior level, we utilize two types of prior-level contexts including scene priming and dynamic cueing. Finally, we introduce a hierarchical context model that systematically integrates the contextual information at different levels. Through the hierarchical context model, contexts at different levels jointly contribute to the event recognition. We evaluate the hierarchical context model for event recognition on benchmark surveillance video datasets. Results show that incorporating contexts in each level can improve event recognition performance, and jointly integrating three levels of contexts through our hierarchical model achieves the best performance.
Managing Clustered Data Using Hierarchical Linear Modeling
Warne, Russell T.; Li, Yan; McKyer, E. Lisako J.; Condie, Rachel; Diep, Cassandra S.; Murano, Peter S.
2012-01-01
Researchers in nutrition research often use cluster or multistage sampling to gather participants for their studies. These sampling methods often produce violations of the assumption of data independence that most traditional statistics share. Hierarchical linear modeling is a statistical method that can overcome violations of the independence…
Strategic games on a hierarchical network model
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
Among complex network models, the hierarchical network model is the one most close to such real networks as world trade web, metabolic network, WWW, actor network, and so on. It has not only the property of power-law degree distribution, but growth based on growth and preferential attachment, showing the scale-free degree distribution property. In this paper, we study the evolution of cooperation on a hierarchical network model, adopting the prisoner's dilemma (PD) game and snowdrift game (SG) as metaphors of the interplay between connected nodes. BA model provides a unifying framework for the emergence of cooperation. But interestingly, we found that on hierarchical model, there is no sign of cooperation for PD game, while the frequency of cooperation decreases as the common benefit decreases for SG. By comparing the scaling clustering coefficient properties of the hierarchical network model with that of BA model, we found that the former amplifies the effect of hubs. Considering different performances of PD game and SG on complex network, we also found that common benefit leads to cooperation in the evolution. Thus our study may shed light on the emergence of cooperation in both natural and social environments.
Endogenous Effort Norms in Hierarchical Firms
J. Tichem (Jan)
2013-01-01
markdownabstract__Abstract__ This paper studies how a three-layer hierarchical firm (principal-supervisor-agent) optimally creates effort norms for its employees. The key assumption is that effort norms are affected by the example of superiors. In equilibrium, norms are eroded as one moves down
Complex Evaluation of Hierarchically-Network Systems
Polishchuk, Dmytro; Yadzhak, Mykhailo
2016-01-01
Methods of complex evaluation based on local, forecasting, aggregated, and interactive evaluation of the state, function quality, and interaction of complex system's objects on the all hierarchical levels is proposed. Examples of analysis of the structural elements of railway transport system are used for illustration of efficiency of proposed approach.
A Hierarchical Grouping of Great Educators
Barker, Donald G.
1977-01-01
Great educators of history were categorized on the basis of their: aims of education, fundamental ideas, and educational theories. They were classed by Ward's method of hierarchical analysis into six groupings: Socrates, Ausonius, Jerome, Abelard; Quintilian, Origen, Melanchthon, Ascham, Loyola; Alciun, Comenius; Vittorino, Basedow, Pestalozzi,…
Ultrafast Hierarchical OTDM/WDM Network
Directory of Open Access Journals (Sweden)
Hideyuki Sotobayashi
2003-12-01
Full Text Available Ultrafast hierarchical OTDM/WDM network is proposed for the future core-network. We review its enabling technologies: C- and L-wavelength-band generation, OTDM-WDM mutual multiplexing format conversions, and ultrafast OTDM wavelengthband conversions.
Hierarchical fuzzy identification of MR damper
Wang, Hao; Hu, Haiyan
2009-07-01
Magneto-rheological (MR) dampers, recently, have found many successful applications in civil engineering and numerous area of mechanical engineering. When an MR damper is to be used for vibration suppression, an inevitable problem is to determine the input voltage so as to gain the desired restoring force determined from the control law. This is the so-called inverse problem of MR dampers and is always an obstacle in the application of MR dampers to vibration control. It is extremely difficult to get the inverse model of MR damper because MR dampers are highly nonlinear and hysteretic. When identifying the inverse model of MR damper with simple fuzzy system, there maybe exists curse of dimensionality of fuzzy system. Therefore, it will take much more time, and even the inverse model may not be identifiable. The paper presents two-layer hierarchical fuzzy system, that is, two-layer hierarchical ANFIS to deal with the curse of dimensionality of the fuzzy identification of MR damper and to identify the inverse model of MR damper. Data used for training the model are generated from numerical simulation of nonlinear differential equations. The numerical simulation proves that the proposed hierarchical fuzzy system can model the inverse model of MR damper much more quickly than simple fuzzy system without any reduction of identification precision. Such hierarchical ANFIS shows the higher priority for the complicated system, and can also be used in system identification and system control for the complicated system.
Statistical theory of hierarchical avalanche ensemble
Olemskoi, Alexander I.
1999-01-01
The statistical ensemble of avalanche intensities is considered to investigate diffusion in ultrametric space of hierarchically subordinated avalanches. The stationary intensity distribution and the steady-state current are obtained. The critical avalanche intensity needed to initiate the global avalanche formation is calculated depending on noise intensity. The large time asymptotic for the probability of the global avalanche appearance is derived.
Managing Clustered Data Using Hierarchical Linear Modeling
Warne, Russell T.; Li, Yan; McKyer, E. Lisako J.; Condie, Rachel; Diep, Cassandra S.; Murano, Peter S.
2012-01-01
Researchers in nutrition research often use cluster or multistage sampling to gather participants for their studies. These sampling methods often produce violations of the assumption of data independence that most traditional statistics share. Hierarchical linear modeling is a statistical method that can overcome violations of the independence…
Equivalence Checking of Hierarchical Combinational Circuits
DEFF Research Database (Denmark)
Williams, Poul Frederick; Hulgaard, Henrik; Andersen, Henrik Reif
1999-01-01
This paper presents a method for verifying that two hierarchical combinational circuits implement the same Boolean functions. The key new feature of the method is its ability to exploit the modularity of circuits to reuse results obtained from one part of the circuits in other parts. We demonstrate...... our method on large adder and multiplier circuits....
Improved intra-block copy and motion search methods for screen content coding
Rapaka, Krishna; Pang, Chao; Sole, Joel; Karczewicz, Marta; Li, Bin; Xu, Jizheng
2015-09-01
Screen content video coding extension of HEVC (SCC) is being developed by Joint Collaborative Team on Video Coding (JCT-VC) of ISO/IEC MPEG and ITU-T VCEG. Screen content usually features a mix of camera captured content and a significant proportion of rendered graphics, text, or animation. These two types of content exhibit distinct characteristics requiring different compression scheme to achieve better coding efficiency. This paper presents an efficient block matching schemes for coding screen content to better capture the spatial and temporal characteristics. The proposed schemes are mainly categorized as a) hash based global region block matching for intra block copy b) selective search based local region block matching for inter frame prediction c) hash based global region block matching for inter frame prediction. In the first part, a hash-based full frame block matching algorithm is designed for intra block copy to handle the repeating patterns and large motions when the reference picture constituted already decoded samples of the current picture. In the second part, a selective local area block matching algorithm is designed for inter motion estimation to handle sharp edges, high spatial frequencies and non-monotonic error surface. In the third part, a hash based full frame block matching algorithm is designed for inter motion estimation to handle repeating patterns and large motions across the temporal reference picture. The proposed schemes are compared against HM-13.0+RExt-6.0, which is the state-of-art screen content coding. The first part provides a luma BD-rate gains of -26.6%, -15.6%, -11.4% for AI, RA and LD TGM configurations. The second part provides a luma BD-rate gains of -10.1%, -12.3% for RA and LD TGM configurations. The third part provides a luma BD-rate gains of -12.2%, -11.5% for RA and LD TGM configurations.
Relaxation matching algorithm for moving photogrammetry
Guo, Lei; Liu, Ke; Miao, Yinxiao; Zhu, Jigui
2015-02-01
Moving photogrammetry is an application of close range photogrammetry in industrial measurement to realize threedimensional coordinate measurement within large-scale volume. This paper describes an approach of relaxation matching algorithm applicable to moving photogrammetry according to the characteristics of accurate matching result of different measuring images. This method uses neighborhood matching support to improve the matching rate after coarse matching based on epipolar geometry constraint and precise matching using three images. It reflects the overall matching effect of all points, that means when a point is matched correctly, the matching results of those points round it must be correct. So for one point considered, the matching results of points round it are calculated to judge whether its result is correct. Analysis indicates that relaxation matching can eliminate the mismatching effectively and acquire 100% rate of correct matching. It will play a very important role in moving photogrammetry to ensure the following implement of ray bundle adjustment.
Liu, Yong; Gao, Yuan; Lu, Qinghua; Zhou, Yongfeng; Yan, Deyue
2011-12-01
As inspired from nature's strategy to prepare collagen, herein we report a hierarchical solution self-assembly method to prepare multi-dimensional and multi-scale supra-structures from the building blocks of pristine titanate nanotubes (TNTs) around 10 nm. With the help of amylose, the nanotubes was continuously self-assembled into helically wrapped TNTs, highly aligned fibres, large bundles, 2D crystal facets and 3D core-shell hybrid crystals. The amyloses work as the glue molecules to drive and direct the hierarchical self-assembly process extending from microscopic to macroscopic scale. The whole self-assembly process as well as the self-assembly structures were carefully characterized by the combination methods of 1H NMR, CD, Hr-SEM, AFM, Hr-TEM, SAED pattern and EDX measurements. A hierarchical self-assembly mechanism was also proposed.As inspired from nature's strategy to prepare collagen, herein we report a hierarchical solution self-assembly method to prepare multi-dimensional and multi-scale supra-structures from the building blocks of pristine titanate nanotubes (TNTs) around 10 nm. With the help of amylose, the nanotubes was continuously self-assembled into helically wrapped TNTs, highly aligned fibres, large bundles, 2D crystal facets and 3D core-shell hybrid crystals. The amyloses work as the glue molecules to drive and direct the hierarchical self-assembly process extending from microscopic to macroscopic scale. The whole self-assembly process as well as the self-assembly structures were carefully characterized by the combination methods of 1H NMR, CD, Hr-SEM, AFM, Hr-TEM, SAED pattern and EDX measurements. A hierarchical self-assembly mechanism was also proposed. Electronic supplementary information (ESI) available: Characterization of the A/TNTs and TNT crystals. See DOI: 10.1039/c1nr11151e
Towards optimal packed string matching
DEFF Research Database (Denmark)
Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany
2014-01-01
In the packed string matching problem, it is assumed that each machine word can accommodate up to α characters, thus an n-character string occupies n/α memory words.(a) We extend the Crochemore–Perrin constant-space O(n)-time string-matching algorithm to run in optimal O(n/α) time and even in real......-time, achieving a factor α speedup over traditional algorithms that examine each character individually. Our macro-level algorithm only uses the standard AC0 instructions of the word-RAM model (i.e. no integer multiplication) plus two specialized micro-level AC0 word-size packed-string instructions. The main word...... matching work.(b) We also consider the complexity of the packed string matching problem in the classical word-RAM model in the absence of the specialized micro-level instructions wssm and wslm. We propose micro-level algorithms for the theoretically efficient emulation using parallel algorithms techniques...
Matchings with Externalities and Attitudes
DEFF Research Database (Denmark)
Branzei, Simina; Michalak, Tomasz; Rahwan, Talal;
2013-01-01
Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real-life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas ...
Fuzzy private matching (extended abstract)
Chmielewski, L.; Hoepman, J.H.
2008-01-01
In the private matching problem, a client and a server each hold a set of n input elements. The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all. In certain
An Implementation of Bigraph Matching
DEFF Research Database (Denmark)
Glenstrup, Arne John; Damgaard, Troels Christoffer; Birkedal, Lars
We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model...
2012-06-08
dendrimers have been used as templates to prepare zerovalent metal NPs encapsulated within the dendrimer. 17 However, the synthesis of dendrimers... encapsulation of its precursors (e.g., FeCl2·4H2O:FeCl3·6H2O:ammonium hydroxide = 1:1:1 by mole for Fe3O4) within the innermost P4VP regime, followed...radical polymerization (ATRP), in which β- cyclodextrin (β-CD)-based star-like 21-Br--CD with 21 initiating sites was used as macroinitiator 16
Hierarchical block structures and high-resolution model selection in large networks
Peixoto, Tiago P
2013-01-01
Discovering the large-scale topological features in empirical networks is a crucial tool in understanding how complex systems function. However most existing methods used to obtain the modular structure of networks suffer from serious problems, such as the resolution limit on the size of communities, where smaller but well-defined clusters are not detectable when the network becomes large. This phenomenon occurs for the very popular approach of modularity optimization, but also for more principled ones based on statistical inference and model selection. Here we construct a nested generative model which, through a complete description of the entire network hierarchy at multiple scales, is capable of avoiding this limitation, and enables the detection of modular structure at levels far beyond those possible by current approaches. Even with this increased resolution, the method is based on the principle of parsimony, and is capable of separating signal from noise, and thus will not lead to the identification of ...
Generic hierarchical engine for mask data preparation
Kalus, Christian K.; Roessl, Wolfgang; Schnitker, Uwe; Simecek, Michal
2002-07-01
Electronic layouts are usually flattened on their path from the hierarchical source downstream to the wafer. Mask data preparation has certainly been identified as a severe bottleneck since long. Data volumes are not only doubling every year along the ITRS roadmap. With the advent of optical proximity correction and phase-shifting masks data volumes are escalating up to non-manageable heights. Hierarchical treatment is one of the most powerful means to keep memory and CPU consumption in reasonable ranges. Only recently, however, has this technique acquired more public attention. Mask data preparation is the most critical area calling for a sound infrastructure to reduce the handling problem. Gaining more and more attention though, are other applications such as large area simulation and manufacturing rule checking (MRC). They all would profit from a generic engine capable to efficiently treat hierarchical data. In this paper we will present a generic engine for hierarchical treatment which solves the major problem, steady transitions along cell borders. Several alternatives exist how to walk through the hierarchy tree. They have, to date, not been thoroughly investigated. One is a bottom-up attempt to treat cells starting with the most elementary cells. The other one is a top-down approach which lends itself to creating a new hierarchy tree. In addition, since the variety, degree of hierarchy and quality of layouts extends over a wide range a generic engine has to take intelligent decisions when exploding the hierarchy tree. Several applications will be shown, in particular how far the limits can be pushed with the current hierarchical engine.
Hierarchical organisation in perception of orientation.
Spinelli, D; Antonucci, G; Daini, R; Martelli, M L; Zoccolotti, P
1999-01-01
According to Rock [1990, in The Legacy of Solomon Asch (Hillsdale, NJ: Lawrence Erlbaum Associates)], hierarchical organisation of perception describes cases in which the orientation of an object is affected by the immediately surrounding elements in the visual field. Various experiments were performed to study the hierarchical organisation of orientation perception. In most of them the rod-and-frame-illusion (RFI: change of the apparent vertical measured on a central rod surrounded by a tilted frame) was measured in the presence/absence of a second inner frame. The first three experiments showed that, when the inner frame is vertical, the direction and size of the illusion are consistent with expectancies based on the hierarchical organisation hypothesis. An analysis of published and unpublished data collected on a large number of subjects showed that orientational hierarchical effects are independent from the absolute size of the RFI. In experiments 4 to 7 we examined the perceptual conditions of the inner stimulus (enclosure, orientation, and presence of luminance borders) critical for obtaining a hierarchical organisation effect. Although an inner vertical square was effective in reducing the illusion (experiment 3), an inner circle enclosing the rod was ineffective (experiment 4). This indicates that definite orientation is necessary to modulate the illusion. However, orientational information provided by a vertical or horizontal rectangle presented near the rod, but not enclosing it, did not modulate the RFI (experiment 5). This suggests that the presence of a figure with oriented contours enclosing the rod is critical. In experiments 6 and 7 we studied whether the presence of luminance borders is important or whether the inner upright square might be effective also if made of subjective contours. When the subjective contour figure was salient and the observers perceived it clearly, its effectiveness in modulating the RFI was comparable to that observed with
Abdominal wall blocks in adults
DEFF Research Database (Denmark)
Børglum, Jens; Gögenür, Ismail; Bendtsen, Thomas F
2016-01-01
Purpose of review Abdominal wall blocks in adults have evolved much during the last decade; that is, particularly with the introduction of ultrasound-guided (USG) blocks. This review highlights recent advances of block techniques within this field and proposes directions for future research....... Recent findings Ultrasound guidance is now considered the golden standard for abdominal wall blocks in adults, even though some landmark-based blocks are still being investigated. The efficiency of USG transversus abdominis plane blocks in relation to many surgical procedures involving the abdominal wall...... been introduced with success. Future research should also investigate the effect of specific abdominal wall blocks on neuroendocrine and inflammatory stress response after surgery. Summary USG abdominal wall blocks in adults are commonplace techniques today. Most abdominal wall blocks are assigned...
Recovery from blocking between outcomes.
Wheeler, Daniel S; Miller, Ralph R
2005-10-01
Contemporary associative learning research largely focuses on cue competition phenomena that occur when 2 cues are paired with a common outcome. Little research has been conducted to investigate similar phenomena occurring when a single cue is trained with 2 outcomes. Three conditioned lick suppression experiments with rats assessed whether treatments known to alleviate blocking between cues would also attenuate blocking between outcomes. In Experiment 1, conditioned responding recovered from blocking between outcomes when a long retention interval was interposed between training and testing. Experiment 2 obtained recovery from blocking between outcomes when the blocking outcome was extinguished after the blocking treatment. In Experiment 3, a recovery from blocking between outcomes occurred when a reminder stimulus was presented in a novel context prior to testing. Collectively, these studies demonstrate that blocking of outcomes, like blocking of cues, appears to be caused by a deficit in the expression of an acquired association.
Elbow matching accuracy in young and elderly humans under unusual mechanical constraints
Directory of Open Access Journals (Sweden)
Vera Talis
2016-11-01
Full Text Available Experiment was carried out to study the proprioception accuracy of elderly (61-83 years old and young (22-36 years old subjects during contralateral elbow matching in sagittal plane. The subjects performed the task under ordinary condition and under experimental condition (matching forearm attached to the rocking cylindrical platform of low (LS, or high (HS height, so that the elbow flexion was associated with tilting movement of the support and with backward movement of the upper arm. Control matching of young and elderly subjects does not differ significantly in terms of constant and absolute error. First block of LS and HS induced absolute error increase and matching arm velocity decrease in both groups, but in the second block of matching on rocking supports both arms velocity of elderly subject decreased and absolute error of elderly subjects towards the second block of rocking condition appeared lower than those of young subjects. Aftereffect of the restricted matching could be observed in elderly as a significant increase of matching arm velocity and corresponding constant error increase. It could be concluded that under unusual mechanical constraints elderly subjects tended to use conservative strategy followed by significant aftereffect towards the final ordinary support condition.
SUPERFICIAL CERVICAL PLEXUS BLOCK
Directory of Open Access Journals (Sweden)
Komang Mega Puspadisari
2014-01-01
Full Text Available Superficial cervical plexus block is one of the regional anesthesia in neck were limited to thesuperficial fascia. Anesthesia is used to relieve pain caused either during or after the surgery iscompleted. This technique can be done by landmark or with ultrasound guiding. The midpointof posterior border of the Sternocleidomastoid was identified and the prosedure done on thatplace or on the level of cartilage cricoid.
Energy Technology Data Exchange (ETDEWEB)
Paik, Taejong; Yun, Hongseok; Fleury, Blaise; Hong, Sung-Hoon; Jo, Pil Sung; Wu, Yaoting; Oh, Soong-Ju; Cargnello, Matteo; Yang, Haoran; Murray, Christopher B.; Kagan, Cherie R.
2017-02-08
We demonstrate the fabrication of hierarchical materials by controlling the structure of highly ordered binary nanocrystal superlattices (BNSLs) on multiple length scales. Combinations of magnetic, plasmonic, semiconducting, and insulating colloidal nanocrystal (NC) building blocks are self-assembled into BNSL membranes via the liquid–interfacial assembly technique. Free-standing BNSL membranes are transferred onto topographically structured poly(dimethylsiloxane) molds via the Langmuir–Schaefer technique and then deposited in patterns onto substrates via transfer printing. BNSLs with different structural motifs are successfully patterned into various meso- and microstructures such as lines, circles, and even three-dimensional grids across large-area substrates. A combination of electron microscopy and grazing incidence small-angle X-ray scattering (GISAXS) measurements confirm the ordering of NC building blocks in meso- and micropatterned BNSLs. This technique demonstrates structural diversity in the design of hierarchical materials by assembling BNSLs from NC building blocks of different composition and size by patterning BNSLs into various size and shape superstructures of interest for a broad range of applications.
Paik, Taejong; Yun, Hongseok; Fleury, Blaise; Hong, Sung-Hoon; Jo, Pil Sung; Wu, Yaoting; Oh, Soong-Ju; Cargnello, Matteo; Yang, Haoran; Murray, Christopher B; Kagan, Cherie R
2017-03-08
We demonstrate the fabrication of hierarchical materials by controlling the structure of highly ordered binary nanocrystal superlattices (BNSLs) on multiple length scales. Combinations of magnetic, plasmonic, semiconducting, and insulating colloidal nanocrystal (NC) building blocks are self-assembled into BNSL membranes via the liquid-interfacial assembly technique. Free-standing BNSL membranes are transferred onto topographically structured poly(dimethylsiloxane) molds via the Langmuir-Schaefer technique and then deposited in patterns onto substrates via transfer printing. BNSLs with different structural motifs are successfully patterned into various meso- and microstructures such as lines, circles, and even three-dimensional grids across large-area substrates. A combination of electron microscopy and grazing incidence small-angle X-ray scattering (GISAXS) measurements confirm the ordering of NC building blocks in meso- and micropatterned BNSLs. This technique demonstrates structural diversity in the design of hierarchical materials by assembling BNSLs from NC building blocks of different composition and size by patterning BNSLs into various size and shape superstructures of interest for a broad range of applications.
Cameron, Peter; Scown, Paul; Campbell, Donald
2002-01-01
There is pessimism regarding the ability of the Acute Health Sector to manage access block for emergency and elective patients. Melbourne Health suffered an acute bed crisis in 2001 resulting in record ambulance diversions and emergency department (ED) delays. We conducted an observational study to reduce access block for emergency patients whilst maintaining elective throughput at Melbourne Health. This involved a clinician-led taskforce using previously proven principles for organisational change to implement 51 actions to improve patient access over a three-month period. The primary outcome measures were ambulance diversion, emergency patients waiting more than 12 hours for an inpatient bed, elective throughput and theatre cancellations. Despite a reduction in multi-day bed numbers all primary objectives were met, ambulance diversion decreased to minimal levels, 12-hour waits decreased by 40% and elective throughput was maintained. Theatre cancellations were also minimised. We conclude that access block can be improved by clinician-led implementation of proven process improvements over a short time frame. The ability to sustain change over the longer term requires further study.
Directory of Open Access Journals (Sweden)
Marín Ignacio
2007-11-01
Full Text Available Abstract Background Classification procedures are widely used in phylogenetic inference, the analysis of expression profiles, the study of biological networks, etc. Many algorithms have been proposed to establish the similarity between two different classifications of the same elements. However, methods to determine significant coincidences between hierarchical and non-hierarchical partitions are still poorly developed, in spite of the fact that the search for such coincidences is implicit in many analyses of massive data. Results We describe a novel strategy to compare a hierarchical and a dichotomic non-hierarchical classification of elements, in order to find clusters in a hierarchical tree in which elements of a given "flat" partition are overrepresented. The key improvement of our strategy respect to previous methods is using permutation analyses of ranked clusters to determine whether regions of the dendrograms present a significant enrichment. We show that this method is more sensitive than previously developed strategies and how it can be applied to several real cases, including microarray and interactome data. Particularly, we use it to compare a hierarchical representation of the yeast mitochondrial interactome and a catalogue of known mitochondrial protein complexes, demonstrating a high level of congruence between those two classifications. We also discuss extensions of this method to other cases which are conceptually related. Conclusion Our method is highly sensitive and outperforms previously described strategies. A PERL script that implements it is available at http://www.uv.es/~genomica/treetracker.
Patterns of Movement in Foster Care: An Optimal Matching Analysis
Havlicek, Judy
2011-01-01
Placement instability remains a vexing problem for child welfare agencies across the country. This study uses child welfare administrative data to retrospectively follow the entire placement histories (birth to age 17.5) of 474 foster youth who reached the age of majority in the state of Illinois and to search for patterns in their movement through the child welfare system. Patterns are identified through optimal matching and hierarchical cluster analyses. Multiple logistic regression is used to analyze administrative and survey data in order to examine covariates related to patterns. Five distinct patterns of movement are differentiated: Late Movers, Settled with Kin, Community Care, Institutionalized, and Early Entry. These patterns suggest high but variable rates of movement. Implications for child welfare policy and service provision are discussed. PMID:20873020
Commentary on Bayesian coincidence assessment (cross-matching)
Loredo, Thomas J
2012-01-01
This paper is an invited commentary on Tamas Budavari's presentation, "On statistical cross-identification in astronomy," for the Statistical Challenges in Modern Astronomy V conference held at Pennsylvania State University in June 2011. I begin with a brief review of previous work on probabilistic (Bayesian) assessment of directional and spatio-temporal coincidences in astronomy (e.g., cross-matching or cross-identification of objects across multiple catalogs). Then I discuss an open issue in the recent innovative work of Budavari and his colleagues on large-scale probabilistic cross-identification: how to assign prior probabilities that play an important role in the analysis. With a simple toy problem, I show how Bayesian multilevel modeling (hierarchical Bayes) provides a principled framework that justifies and generalizes pragmatic rules of thumb that have been successfully used by Budavari's team to assign priors.
E-Block: A Tangible Programming Tool with Graphical Blocks
Directory of Open Access Journals (Sweden)
Danli Wang
2013-01-01
Full Text Available This paper designs a tangible programming tool, E-Block, for children aged 5 to 9 to experience the preliminary understanding of programming by building blocks. With embedded artificial intelligence, the tool defines the programming blocks with the sensors as the input and enables children to write programs to complete the tasks in the computer. The symbol on the programming block's surface is used to help children understanding the function of each block. The sequence information is transferred to computer by microcomputers and then translated into semantic information. The system applies wireless and infrared technologies and provides user with feedbacks on both screen and programming blocks. Preliminary user studies using observation and user interview methods are shown for E-Block's prototype. The test results prove that E-Block is attractive to children and easy to learn and use. The project also highlights potential advantages of using single chip microcomputer (SCM technology to develop tangible programming tools for children.
Fan, Deliang; Sharad, Mrigank; Sengupta, Abhronil; Roy, Kaushik
2014-01-01
Hierarchical temporal memory (HTM) tries to mimic the computing in cerebral-neocortex. It identifies spatial and temporal patterns in the input for making inferences. This may require large number of computationally expensive tasks like, dot-product evaluations. Nano-devices that can provide direct mapping for such primitives are of great interest. In this work we show that the computing blocks for HTM can be mapped using low-voltage, fast-switching, magneto-metallic spin-neurons combined wit...
On the geostatistical characterization of hierarchical media
Neuman, Shlomo P.; Riva, Monica; Guadagnini, Alberto
2008-02-01
The subsurface consists of porous and fractured materials exhibiting a hierarchical geologic structure, which gives rise to systematic and random spatial and directional variations in hydraulic and transport properties on a multiplicity of scales. Traditional geostatistical moment analysis allows one to infer the spatial covariance structure of such hierarchical, multiscale geologic materials on the basis of numerous measurements on a given support scale across a domain or "window" of a given length scale. The resultant sample variogram often appears to fit a stationary variogram model with constant variance (sill) and integral (spatial correlation) scale. In fact, some authors, who recognize that hierarchical sedimentary architecture and associated log hydraulic conductivity fields tend to be nonstationary, nevertheless associate them with stationary "exponential-like" transition probabilities and variograms, respectively, the latter being a consequence of the former. We propose that (1) the apparent ability of stationary spatial statistics to characterize the covariance structure of nonstationary hierarchical media is an artifact stemming from the finite size of the windows within which geologic and hydrologic variables are ubiquitously sampled, and (2) the artifact is eliminated upon characterizing the covariance structure of such media with the aid of truncated power variograms, which represent stationary random fields obtained upon sampling a nonstationary fractal over finite windows. To support our opinion, we note that truncated power variograms arise formally when a hierarchical medium is sampled jointly across all geologic categories and scales within a window; cite direct evidence that geostatistical parameters (variance and integral scale) inferred on the basis of traditional variograms vary systematically with support and window scales; demonstrate the ability of truncated power models to capture these variations in terms of a few scaling parameters
Matching of equivalent field regions
DEFF Research Database (Denmark)
Appel-Hansen, Jørgen; Rengarajan, S.B.
2005-01-01
screen, having the same homogeneous medium on both sides and an impressed current on one aide, an alternative procedure is relevant. We make use of the fact that in the aperture the tangential component of the magnetic field due to the induced currents in the screen is zero. The use of such a procedure......In aperture problems, integral equations for equivalent currents are often found by enforcing matching of equivalent fields. The enforcement is made in the aperture surface region adjoining the two volumes on each side of the aperture. In the case of an aperture in a planar perfectly conducting...... shows that equivalent currents can be found by a consideration of only one of the two volumes into which the aperture plane divides the space. Furthermore, from a consideration of an automatic matching at the aperture, additional information about tangential as well as normal field components...
COMPUTER-AIDED BLOCK ASSEMBLY PROCESS PLANNING IN SHIPBUILD-ING BASED ON RULE-REASONING
Institute of Scientific and Technical Information of China (English)
ZHANG Zhiying; LI Zhen; JIANG Zhibin
2008-01-01
Computer-aided block assembly process planning based on rule-reasoning are developed in order to improve the assembly efficiency and implement the automated block assembly process planning generation in shipbuilding. First, weighted directed liaison graph (WDLG) is proposed to represent the model of block assembly process according to the characteristics of assembly relation, and edge list (EL) is used to describe assembly sequences. Shapes and assembly attributes of block parts are analyzed to determine the assembly position and matched parts of parts used frequently. Then, a series of assembly rules are generalized, and assembly sequences for block are obtained by means of rule reasoning. Final, a prototype system of computer-aided block assembly process planning is built. The system has been tested on actual block, and the results were found to be quite efficiency. Meanwhile, the fundament for the automation of block assembly process generation and integration with other systems is established.
Template Matching on Parallel Architectures,
1985-07-01
memory. The processors run asynchronously. Thus according to Hynn’s categories the Butterfl . is a MIMD machine. The processors of the Butterfly are...Generalized Butterfly Architecture This section describes timings for pattern matching on the generalized Butterfl .. Ihe implementations on the Butterfly...these algorithms. Thus the best implementation of the techniques on the generalized Butterfl % are the same as the implementation on the real Butterfly
Monetary Exchange with Multilateral Matching
DEFF Research Database (Denmark)
Julien, Benoît; Kennes, John; King, Ian
the results with Kiyotaki and Wright (1993), Trejos and Wright (1995), and Lagos and Wright (2005) respectively. We find that the multilateral matching setting generates very simple and intuitive equilibrium allocations that are similar to those in the other papers, but which have important differences....... Finally, analysis of the case of divisible goods and money can be performed without the assumption of large families (as in Shi (1997)) or the day and night structure of Lagos and Wright (2005)....
Duplicate-based Schema Matching
Bilke, Alexander
2007-01-01
Die Integration unabhängig voneinander entwickelter Datenquellen stellt uns vor viele Probleme, die das Ergebnis verschiedener Arten von Heterogenität sind. Eine der größten Herausforderungen ist Schema Matching: der halb-automatische Prozess, in dem semantische Beziehungen zwischen Attributen in heterogenen Schemata erkannt werden. Verschiedene Lösungen, die Schemainformationen ausnutzen oder spezifische Eigenschaften aus Attributwerten extrahieren, wurden in der Literatur beschrieben. In di...
Spurring Innovation with Matching Grants
2015-01-01
Matching grants are one of the most common tools used in private sector development programs in developing countries and have been included in more than 60 World Bank projects totaling over US$1.2 billion, funding over 100,000 micro, small and medium enterprises. The Enterprise Revitalization and Employment Pilot (EREP) was designed as a two year pilot project aimed at improving firm capab...
Matching Games with Additive Externalities
DEFF Research Database (Denmark)
Branzei, Simina; Michalak, Tomasz; Rahwan, Talal
2012-01-01
Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas......, optimistic, and pessimistic behaviour, and provide both computational hardness results and polynomial-time algorithms for computing stable outcomes....
NSGIC GIS Inventory (aka Ramona) — A polygon feature class of Miami-Dade Census 2000 Blocks. Census blocks are areas bounded on all sides by visible and/or invisible features shown on a map prepared...
NSGIC Local Govt | GIS Inventory — A polygon feature class of Miami-Dade Census 2000 Blocks. Census blocks are areas bounded on all sides by visible and/or invisible features shown on a map prepared...
Ear - blocked at high altitudes
High altitudes and blocked ears; Flying and blocked ears; Eustachian tube dysfunction - high altitude ... eustachian tube is a connection between the middle ear (the space deep to the eardrum) and the ...
Habitat Blocks and Wildlife Corridors
Vermont Center for Geographic Information — Habitat blocks are areas of contiguous forest and other natural habitats that are unfragmented by roads, development, or agriculture. Vermonts habitat blocks are...
On String Matching with Mismatches
Directory of Open Access Journals (Sweden)
Marius Nicolae
2015-05-01
Full Text Available In this paper, we consider several variants of the pattern matching with mismatches problem. In particular, given a text \\(T=t_1 t_2\\cdots t_n\\ and a pattern \\(P=p_1p_2\\cdots p_m\\, we investigate the following problems: (1 pattern matching with mismatches: for every \\(i, 1\\leq i \\leq n-m+1\\ output, the distance between \\(P\\ and \\(t_i t_{i+1}\\cdots t_{i+m-1}\\; and (2 pattern matching with \\(k\\ mismatches: output those positions \\(i\\ where the distance between \\(P\\ and \\(t_i t_{i+1}\\cdots t_{i+m-1}\\ is less than a given threshold \\(k\\. The distance metric used is the Hamming distance. We present some novel algorithms and techniques for solving these problems. We offer deterministic, randomized and approximation algorithms. We consider variants of these problems where there could be wild cards in either the text or the pattern or both. We also present an experimental evaluation of these algorithms. The source code is available at http://www.engr.uconn.edu/\\(\\sim\\man09004/kmis.zip.
Incremental pattern matching for regular expressions
Jalali, Arash; Ghamarian, Amir Hossein; Rensink, Arend; Fish, Andrew; Lambers, Leen
2012-01-01
Graph pattern matching lies at the heart of any graph transformation-based system. Incremental pattern matching is one approach proposed for reducingthe overall cost of pattern matching over successive transformations by preserving the matches that stay relevant after a rule application. An importan
32 CFR 806b.50 - Computer matching.
2010-07-01
... 32 National Defense 6 2010-07-01 2010-07-01 false Computer matching. 806b.50 Section 806b.50... PROGRAM Disclosing Records to Third Parties § 806b.50 Computer matching. Computer matching programs... on forms used in applying for benefits. Coordinate computer matching statements on forms with...
Appropriate schemata and building blocks
Institute of Scientific and Technical Information of China (English)
Yang Haijun; Li Minqiang
2005-01-01
Appropriate schemata as a novel concept to characterize building blocks are introduced, and then, the traits of appropriate schemata are presented. The effects of building blocks by search operators are analyzed. Hence, the experiments on RR-8X8 are employed to verify that appropriate schemata construct the building blocks. The validity of appropriate schemata and building blocks from the views of theory and practice is presented.
Properties of blocked linear systems.
Chen, Weitian; Anderson, Brian D O; Deistler, Manfred; Filler, Alexander
2012-10-01
This paper presents a systematic study on the properties of blocked linear systems that have resulted from blocking discrete-time linear time invariant systems. The main idea is to explore the relationship between the blocked and the unblocked systems. Existing results are reviewed and a number of important new results are derived. Focus is given particularly on the zero properties of the blocked system as no such study has been found in the literature.
Porous block nanofiber composite filters
Energy Technology Data Exchange (ETDEWEB)
Ginley, David S.; Curtis, Calvin J.; Miedaner, Alexander; Weiss, Alan J.; Paddock, Arnold
2016-08-09
Porous block nano-fiber composite (110), a filtration system (10) and methods of using the same are disclosed. An exemplary porous block nano-fiber composite (110) includes a porous block (100) having one or more pores (200). The porous block nano-fiber composite (110) also includes a plurality of inorganic nano-fibers (211) formed within at least one of the pores (200).
Real-Time Pricing-Based Scheduling Strategy in Smart Grids: A Hierarchical Game Approach
Directory of Open Access Journals (Sweden)
Jie Yang
2014-01-01
Full Text Available This paper proposes a scheduling strategy based on real-time pricing in smart grids. A hierarchical game is employed to analyze the decision-making process of generators and consumers. We prove the existence and uniqueness of Nash equilibrium and utilize a backward induction method to obtain the generation and consumption strategies. Then, we propose two dynamic algorithms for the generators and consumers to search for the equilibrium in a distributed fashion. Simulation results demonstrate that the proposed scheduling strategy can match supply with demand and shift load away from peak time.
Application of hierarchical matrices for partial inverse
Litvinenko, Alexander
2013-11-26
In this work we combine hierarchical matrix techniques (Hackbusch, 1999) and domain decomposition methods to obtain fast and efficient algorithms for the solution of multiscale problems. This combination results in the hierarchical domain decomposition (HDD) method, which can be applied for solution multi-scale problems. Multiscale problems are problems that require the use of different length scales. Using only the finest scale is very expensive, if not impossible, in computational time and memory. Domain decomposition methods decompose the complete problem into smaller systems of equations corresponding to boundary value problems in subdomains. Then fast solvers can be applied to each subdomain. Subproblems in subdomains are independent, much smaller and require less computational resources as the initial problem.
First-passage phenomena in hierarchical networks
Tavani, Flavia
2016-01-01
In this paper we study Markov processes and related first passage problems on a class of weighted, modular graphs which generalize the Dyson hierarchical model. In these networks, the coupling strength between two nodes depends on their distance and is modulated by a parameter $\\sigma$. We find that, in the thermodynamic limit, ergodicity is lost and the "distant" nodes can not be reached. Moreover, for finite-sized systems, there exists a threshold value for $\\sigma$ such that, when $\\sigma$ is relatively large, the inhomogeneity of the coupling pattern prevails and "distant" nodes are hardly reached. The same analysis is carried on also for generic hierarchical graphs, where interactions are meant to involve $p$-plets ($p>2$) of nodes, finding that ergodicity is still broken in the thermodynamic limit, but no threshold value for $\\sigma$ is evidenced, ultimately due to a slow growth of the network diameter with the size.
An Hierarchical Approach to Big Data
Allen, M G; Boch, T; Durand, D; Oberto, A; Merin, B; Stoehr, F; Genova, F; Pineau, F-X; Salgado, J
2016-01-01
The increasing volumes of astronomical data require practical methods for data exploration, access and visualisation. The Hierarchical Progressive Survey (HiPS) is a HEALPix based scheme that enables a multi-resolution approach to astronomy data from the individual pixels up to the whole sky. We highlight the decisions and approaches that have been taken to make this scheme a practical solution for managing large volumes of heterogeneous data. Early implementors of this system have formed a network of HiPS nodes, with some 250 diverse data sets currently available, with multiple mirror implementations for important data sets. This hierarchical approach can be adapted to expose Big Data in different ways. We describe how the ease of implementation, and local customisation of the Aladin Lite embeddable HiPS visualiser have been keys for promoting collaboration on HiPS.
Non-homogeneous fractal hierarchical weighted networks.
Dong, Yujuan; Dai, Meifeng; Ye, Dandan
2015-01-01
A model of fractal hierarchical structures that share the property of non-homogeneous weighted networks is introduced. These networks can be completely and analytically characterized in terms of the involved parameters, i.e., the size of the original graph Nk and the non-homogeneous weight scaling factors r1, r2, · · · rM. We also study the average weighted shortest path (AWSP), the average degree and the average node strength, taking place on the non-homogeneous hierarchical weighted networks. Moreover the AWSP is scrupulously calculated. We show that the AWSP depends on the number of copies and the sum of all non-homogeneous weight scaling factors in the infinite network order limit.
Noise enhances information transfer in hierarchical networks.
Czaplicka, Agnieszka; Holyst, Janusz A; Sloot, Peter M A
2013-01-01
We study the influence of noise on information transmission in the form of packages shipped between nodes of hierarchical networks. Numerical simulations are performed for artificial tree networks, scale-free Ravasz-Barabási networks as well for a real network formed by email addresses of former Enron employees. Two types of noise are considered. One is related to packet dynamics and is responsible for a random part of packets paths. The second one originates from random changes in initial network topology. We find that the information transfer can be enhanced by the noise. The system possesses optimal performance when both kinds of noise are tuned to specific values, this corresponds to the Stochastic Resonance phenomenon. There is a non-trivial synergy present for both noisy components. We found also that hierarchical networks built of nodes of various degrees are more efficient in information transfer than trees with a fixed branching factor.
Design of Hierarchical Structures for Synchronized Deformations
Seifi, Hamed; Javan, Anooshe Rezaee; Ghaedizadeh, Arash; Shen, Jianhu; Xu, Shanqing; Xie, Yi Min
2017-01-01
In this paper we propose a general method for creating a new type of hierarchical structures at any level in both 2D and 3D. A simple rule based on a rotate-and-mirror procedure is introduced to achieve multi-level hierarchies. These new hierarchical structures have remarkably few degrees of freedom compared to existing designs by other methods. More importantly, these structures exhibit synchronized motions during opening or closure, resulting in uniform and easily-controllable deformations. Furthermore, a simple analytical formula is found which can be used to avoid collision of units of the structure during the closing process. The novel design concept is verified by mathematical analyses, computational simulations and physical experiments.
Hierarchical model of vulnerabilities for emotional disorders.
Norton, Peter J; Mehta, Paras D
2007-01-01
Clark and Watson's (1991) tripartite model of anxiety and depression has had a dramatic impact on our understanding of the dispositional variables underlying emotional disorders. More recently, calls have been made to examine not simply the influence of negative affectivity (NA) but also mediating factors that might better explain how NA influences anxious and depressive syndromes (e.g. Taylor, 1998; Watson, 2005). Extending preliminary projects, this study evaluated two hierarchical models of NA, mediating factors of anxiety sensitivity and intolerance of uncertainty, and specific emotional manifestations. Data provided a very good fit to a model elaborated from preliminary studies, lending further support to hierarchical models of emotional vulnerabilities. Implications for classification and diagnosis are discussed.
Hierarchical Self-organization of Complex Systems
Institute of Scientific and Technical Information of China (English)
CHAI Li-he; WEN Dong-sheng
2004-01-01
Researches on organization and structure in complex systems are academic and industrial fronts in modern sciences. Though many theories are tentatively proposed to analyze complex systems, we still lack a rigorous theory on them. Complex systems possess various degrees of freedom, which means that they should exhibit all kinds of structures. However, complex systems often show similar patterns and structures. Then the question arises why such similar structures appear in all kinds of complex systems. The paper outlines a theory on freedom degree compression and the existence of hierarchical self-organization for all complex systems is found. It is freedom degree compression and hierarchical self-organization that are responsible for the existence of these similar patterns or structures observed in the complex systems.
Bayesian hierarchical modeling of drug stability data.
Chen, Jie; Zhong, Jinglin; Nie, Lei
2008-06-15
Stability data are commonly analyzed using linear fixed or random effect model. The linear fixed effect model does not take into account the batch-to-batch variation, whereas the random effect model may suffer from the unreliable shelf-life estimates due to small sample size. Moreover, both methods do not utilize any prior information that might have been available. In this article, we propose a Bayesian hierarchical approach to modeling drug stability data. Under this hierarchical structure, we first use Bayes factor to test the poolability of batches. Given the decision on poolability of batches, we then estimate the shelf-life that applies to all batches. The approach is illustrated with two example data sets and its performance is compared in simulation studies with that of the commonly used frequentist methods. (c) 2008 John Wiley & Sons, Ltd.
Hierarchical Boltzmann simulations and model error estimation
Torrilhon, Manuel; Sarna, Neeraj
2017-08-01
A hierarchical simulation approach for Boltzmann's equation should provide a single numerical framework in which a coarse representation can be used to compute gas flows as accurately and efficiently as in computational fluid dynamics, but a subsequent refinement allows to successively improve the result to the complete Boltzmann result. We use Hermite discretization, or moment equations, for the steady linearized Boltzmann equation for a proof-of-concept of such a framework. All representations of the hierarchy are rotationally invariant and the numerical method is formulated on fully unstructured triangular and quadrilateral meshes using a implicit discontinuous Galerkin formulation. We demonstrate the performance of the numerical method on model problems which in particular highlights the relevance of stability of boundary conditions on curved domains. The hierarchical nature of the method allows also to provide model error estimates by comparing subsequent representations. We present various model errors for a flow through a curved channel with obstacles.
Hierarchical State Machines as Modular Horn Clauses
Directory of Open Access Journals (Sweden)
Pierre-Loïc Garoche
2016-07-01
Full Text Available In model based development, embedded systems are modeled using a mix of dataflow formalism, that capture the flow of computation, and hierarchical state machines, that capture the modal behavior of the system. For safety analysis, existing approaches rely on a compilation scheme that transform the original model (dataflow and state machines into a pure dataflow formalism. Such compilation often result in loss of important structural information that capture the modal behaviour of the system. In previous work we have developed a compilation technique from a dataflow formalism into modular Horn clauses. In this paper, we present a novel technique that faithfully compile hierarchical state machines into modular Horn clauses. Our compilation technique preserves the structural and modal behavior of the system, making the safety analysis of such models more tractable.
Hierarchical community structure in complex (social) networks
Massaro, Emanuele
2014-01-01
The investigation of community structure in networks is a task of great importance in many disciplines, namely physics, sociology, biology and computer science where systems are often represented as graphs. One of the challenges is to find local communities from a local viewpoint in a graph without global information in order to reproduce the subjective hierarchical vision for each vertex. In this paper we present the improvement of an information dynamics algorithm in which the label propagation of nodes is based on the Markovian flow of information in the network under cognitive-inspired constraints \\cite{Massaro2012}. In this framework we have introduced two more complex heuristics that allow the algorithm to detect the multi-resolution hierarchical community structure of networks from a source vertex or communities adopting fixed values of model's parameters. Experimental results show that the proposed methods are efficient and well-behaved in both real-world and synthetic networks.
Object tracking with hierarchical multiview learning
Yang, Jun; Zhang, Shunli; Zhang, Li
2016-09-01
Building a robust appearance model is useful to improve tracking performance. We propose a hierarchical multiview learning framework to construct the appearance model, which has two layers for tracking. On the top layer, two different views of features, grayscale value and histogram of oriented gradients, are adopted for representation under the cotraining framework. On the bottom layer, for each view of each feature, three different random subspaces are generated to represent the appearance from multiple views. For each random view submodel, the least squares support vector machine is employed to improve the discriminability for concrete and efficient realization. These two layers are combined to construct the final appearance model for tracking. The proposed hierarchical model assembles two types of multiview learning strategies, in which the appearance can be described more accurately and robustly. Experimental results in the benchmark dataset demonstrate that the proposed method can achieve better performance than many existing state-of-the-art algorithms.
Hierarchical Robot Control In A Multisensor Environment
Bhanu, Bir; Thune, Nils; Lee, Jih Kun; Thune, Mari
1987-03-01
Automatic recognition, inspection, manipulation and assembly of objects will be a common denominator in most of tomorrow's highly automated factories. These tasks will be handled by intelligent computer controlled robots with multisensor capabilities which contribute to desired flexibility and adaptability. The control of a robot in such a multisensor environment becomes of crucial importance as the complexity of the problem grows exponentially with the number of sensors, tasks, commands and objects. In this paper we present an approach which uses CAD (Computer-Aided Design) based geometric and functional models of objects together with action oriented neuroschemas to recognize and manipulate objects by a robot in a multisensor environment. The hierarchical robot control system is being implemented on a BBN Butterfly multi processor. Index terms: CAD, Hierarchical Control, Hypothesis Generation and Verification, Parallel Processing, Schemas
Property Blocks: Games and Activities.
Humphreys, Alan, Ed.; Dailey, Jean, Ed.
This pamphlet describes the property blocks produced by MINNEMAST, and discusses their use in the development of thinking processes. Classification systems, including block diagrams and tree diagrams, are discussed. Sixteen classroom activities and eleven games which use the blocks are described. Suggestions to the teacher for further reading are…
TRANSIMS and the hierarchical data format
Energy Technology Data Exchange (ETDEWEB)
Bush, B.W.
1997-06-12
The Hierarchical Data Format (HDF) is a general-purposed scientific data format developed at the National Center for Supercomputing Applications. It supports metadata, compression, and a variety of data structures (multidimensional arrays, raster images, tables). FORTRAN 77 and ANSI C programming interfaces are available for it and a wide variety of visualization tools read HDF files. The author discusses the features of this file format and its possible uses in TRANSIMS.
Modular, Hierarchical Learning By Artificial Neural Networks
Baldi, Pierre F.; Toomarian, Nikzad
1996-01-01
Modular and hierarchical approach to supervised learning by artificial neural networks leads to neural networks more structured than neural networks in which all neurons fully interconnected. These networks utilize general feedforward flow of information and sparse recurrent connections to achieve dynamical effects. The modular organization, sparsity of modular units and connections, and fact that learning is much more circumscribed are all attractive features for designing neural-network hardware. Learning streamlined by imitating some aspects of biological neural networks.
The Infinite Hierarchical Factor Regression Model
Rai, Piyush
2009-01-01
We propose a nonparametric Bayesian factor regression model that accounts for uncertainty in the number of factors, and the relationship between factors. To accomplish this, we propose a sparse variant of the Indian Buffet Process and couple this with a hierarchical model over factors, based on Kingman's coalescent. We apply this model to two problems (factor analysis and factor regression) in gene-expression data analysis.
Superhydrophobicity of Hierarchical and ZNO Nanowire Coatings
2014-01-01
KOH (3 wt%), distilled water and isopropyl alcohol (10% vol%) at 95 C for 50 min. Subsequently, a 10 nm ZnO seed layer wasThis journal is © The Royal...ZnO have been widely used in sensors, piezo-nanogenerators, and solar cells. The hierarchical structures of ZnO nanowires grown on Si pyramid surfaces...exhibiting superhydrophobicity in this work will have promising applications in the next generation photovoltaic devices and solar cells
Hierarchical Parallel Evaluation of a Hamming Code
Directory of Open Access Journals (Sweden)
Shmuel T. Klein
2017-04-01
Full Text Available The Hamming code is a well-known error correction code and can correct a single error in an input vector of size n bits by adding logn parity checks. A new parallel implementation of the code is presented, using a hierarchical structure of n processors in logn layers. All the processors perform similar simple tasks, and need only a few bytes of internal memory.
Hierarchical mixture models for assessing fingerprint individuality
Dass, Sarat C.; Li, Mingfei
2009-01-01
The study of fingerprint individuality aims to determine to what extent a fingerprint uniquely identifies an individual. Recent court cases have highlighted the need for measures of fingerprint individuality when a person is identified based on fingerprint evidence. The main challenge in studies of fingerprint individuality is to adequately capture the variability of fingerprint features in a population. In this paper hierarchical mixture models are introduced to infer the extent of individua...
Learning a hierarchical deformable template for rapid deformable object parsing.
Zhu, Long Leo; Chen, Yuanhao; Yuille, Alan
2010-06-01
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical deformable template (HDT). The HDT represents the object by state variables defined over a hierarchy (with typically five levels). The hierarchy is built recursively by composing elementary structures to form more complex structures. A probability distribution--a parameterized exponential model--is defined over the hierarchy to quantify the variability in shape and appearance of the object at multiple scales. To perform inference--to estimate the most probable states of the hierarchy for an input image--we use a bottom-up algorithm called compositional inference. This algorithm is an approximate version of dynamic programming where approximations are made (e.g., pruning) to ensure that the algorithm is fast while maintaining high performance. We adapt the structure-perceptron algorithm to estimate the parameters of the HDT in a discriminative manner (simultaneously estimating the appearance and shape parameters). More precisely, we specify an exponential distribution for the HDT using a dictionary of potentials, which capture the appearance and shape cues. This dictionary can be large and so does not require handcrafting the potentials. Instead, structure-perceptron assigns weights to the potentials so that less important potentials receive small weights (this is like a "soft" form of feature selection). Finally, we provide experimental evaluation of HDTs on different visual tasks, including detection, segmentation, matching (alignment), and parsing. We show that HDTs achieve state-of-the-art performance for these different tasks when evaluated on data sets with groundtruth (and when compared to alternative algorithms, which are typically specialized to each task).
Metal hierarchical patterning by direct nanoimprint lithography.
Radha, Boya; Lim, Su Hui; Saifullah, Mohammad S M; Kulkarni, Giridhar U
2013-01-01
Three-dimensional hierarchical patterning of metals is of paramount importance in diverse fields involving photonics, controlling surface wettability and wearable electronics. Conventionally, this type of structuring is tedious and usually involves layer-by-layer lithographic patterning. Here, we describe a simple process of direct nanoimprint lithography using palladium benzylthiolate, a versatile metal-organic ink, which not only leads to the formation of hierarchical patterns but also is amenable to layer-by-layer stacking of the metal over large areas. The key to achieving such multi-faceted patterning is hysteretic melting of ink, enabling its shaping. It undergoes transformation to metallic palladium under gentle thermal conditions without affecting the integrity of the hierarchical patterns on micro- as well as nanoscale. A metallic rice leaf structure showing anisotropic wetting behavior and woodpile-like structures were thus fabricated. Furthermore, this method is extendable for transferring imprinted structures to a flexible substrate to make them robust enough to sustain numerous bending cycles.
Hierarchical unilamellar vesicles of controlled compositional heterogeneity.
Directory of Open Access Journals (Sweden)
Maik Hadorn
Full Text Available Eukaryotic life contains hierarchical vesicular architectures (i.e. organelles that are crucial for material production and trafficking, information storage and access, as well as energy production. In order to perform specific tasks, these compartments differ among each other in their membrane composition and their internal cargo and also differ from the cell membrane and the cytosol. Man-made structures that reproduce this nested architecture not only offer a deeper understanding of the functionalities and evolution of organelle-bearing eukaryotic life but also allow the engineering of novel biomimetic technologies. Here, we show the newly developed vesicle-in-water-in-oil emulsion transfer preparation technique to result in giant unilamellar vesicles internally compartmentalized by unilamellar vesicles of different membrane composition and internal cargo, i.e. hierarchical unilamellar vesicles of controlled compositional heterogeneity. The compartmentalized giant unilamellar vesicles were subsequently isolated by a separation step exploiting the heterogeneity of the membrane composition and the encapsulated cargo. Due to the controlled, efficient, and technically straightforward character of the new preparation technique, this study allows the hierarchical fabrication of compartmentalized giant unilamellar vesicles of controlled compositional heterogeneity and will ease the development of eukaryotic cell mimics that resemble their natural templates as well as the fabrication of novel multi-agent drug delivery systems for combination therapies and complex artificial microreactors.
A New Metrics for Hierarchical Clustering
Institute of Scientific and Technical Information of China (English)
YANGGuangwen; SHIShuming; WANGDingxing
2003-01-01
Hierarchical clustering is a popular method of performing unsupervised learning. Some metric must be used to determine the similarity between pairs of clusters in hierarchical clustering. Traditional similarity metrics either can deal with simple shapes (i.e. spherical shapes) only or are very sensitive to outliers (the chaining effect). The main contribution of this paper is to propose some potential-based similarity metrics (APES and AMAPES) between clusters in hierarchical clustering, inspired by the concepts of the electric potential and the gravitational potential in electromagnetics and astronomy. The main features of these metrics are: the first, they have strong antijamming capability; the second, they are capable of finding clusters of different shapes such as spherical, spiral, chain, circle, sigmoid, U shape or other complex irregular shapes; the third, existing algorithms and research fruits for classical metrics can be adopted to deal with these new potential-based metrics with no or little modification. Experiments showed that the new metrics are more superior to traditional ones. Different potential functions are compared, and the sensitivity to parameters is also analyzed in this paper.
A secure solution on hierarchical access control
Wei, Chuan-Sheng; Huang, Tone-Yau; Ong, Yao Lin
2011-01-01
Hierarchical access control is an important and traditional problem in information security. In 2001, Wu et.al. proposed an elegant solution for hierarchical access control by the secure-filter. Jeng and Wang presented an improvement of Wu et. al.'s method by the ECC cryptosystem. However, secure-filter method is insecure in dynaminc access control. Lie, Hsu and Tripathy, Paul pointed out some secure leaks on the secure-filter and presented some improvements to eliminate these secure flaws. In this paper, we revise the secure-filter in Jeng-Wang method and propose another secure solutions in hierarchical access control problem. CA is a super security class (user) in our proposed method and the secure-filter of $u_i$ in our solutions is a polynomial of degree $n_i+1$ in $\\mathbb{Z}_p^*$, $f_i(x)=(x-h_i)(x-a_1)...(x-a_{n_i})+L_{l_i}(K_i)$. Although the degree of our secure-filter is larger than others solutions, our solution is secure and efficient in dynamics access control.
SORM applied to hierarchical parallel system
DEFF Research Database (Denmark)
Ditlevsen, Ove Dalager
2006-01-01
The old hierarchical stochastic load combination model of Ferry Borges and Castanheta and the corresponding problem of determining the distribution of the extreme random load effect is the inspiration to this paper. The evaluation of the distribution function of the extreme value by use of a part......The old hierarchical stochastic load combination model of Ferry Borges and Castanheta and the corresponding problem of determining the distribution of the extreme random load effect is the inspiration to this paper. The evaluation of the distribution function of the extreme value by use...... of a particular first order reliability method (FORM) was first described in a celebrated paper by Rackwitz and Fiessler more than a quarter of a century ago. The method has become known as the Rackwitz-Fiessler algorithm. The original RF-algorithm as applied to a hierarchical random variable model...... is recapitulated so that a simple but quite effective accuracy improving calculation can be explained. A limit state curvature correction factor on the probability approximation is obtained from the final stop results of the RF-algorithm. This correction factor is based on Breitung’s asymptotic formula for second...
Anisotropic and Hierarchical Porosity in Multifunctional Ceramics
Lichtner, Aaron Zev
The performance of multifunctional porous ceramics is often hindered by the seemingly contradictory effects of porosity on both mechanical and non-structural properties and yet a sufficient body of knowledge linking microstructure to these properties does not exist. Using a combination of tailored anisotropic and hierarchical materials, these disparate effects may be reconciled. In this project, a systematic investigation of the processing, characterization and properties of anisotropic and isotropic hierarchically porous ceramics was conducted. The system chosen was a composite ceramic intended as the cathode for a solid oxide fuel cell (SOFC). Comprehensive processing investigations led to the development of approaches to make hierarchical, anisotropic porous microstructures using directional freeze-casting of well dispersed slurries. The effect of all the important processing parameters was investigated. This resulted in an ability to tailor and control the important microstructural features including the scale of the microstructure, the macropore size and total porosity. Comparable isotropic porous ceramics were also processed using fugitive pore formers. A suite of characterization techniques including x-ray tomography and 3-D sectional scanning electron micrographs (FIB-SEM) was used to characterize and quantify the green and partially sintered microstructures. The effect of sintering temperature on the microstructure was quantified and discrete element simulations (DEM) were used to explain the experimental observations. Finally, the comprehensive mechanical properties, at room temperature, were investigated, experimentally and using DEM, for the different microstructures.
Resilient 3D hierarchical architected metamaterials.
Meza, Lucas R; Zelhofer, Alex J; Clarke, Nigel; Mateos, Arturo J; Kochmann, Dennis M; Greer, Julia R
2015-09-15
Hierarchically designed structures with architectural features that span across multiple length scales are found in numerous hard biomaterials, like bone, wood, and glass sponge skeletons, as well as manmade structures, like the Eiffel Tower. It has been hypothesized that their mechanical robustness and damage tolerance stem from sophisticated ordering within the constituents, but the specific role of hierarchy remains to be fully described and understood. We apply the principles of hierarchical design to create structural metamaterials from three material systems: (i) polymer, (ii) hollow ceramic, and (iii) ceramic-polymer composites that are patterned into self-similar unit cells in a fractal-like geometry. In situ nanomechanical experiments revealed (i) a nearly theoretical scaling of structural strength and stiffness with relative density, which outperforms existing nonhierarchical nanolattices; (ii) recoverability, with hollow alumina samples recovering up to 98% of their original height after compression to ≥ 50% strain; (iii) suppression of brittle failure and structural instabilities in hollow ceramic hierarchical nanolattices; and (iv) a range of deformation mechanisms that can be tuned by changing the slenderness ratios of the beams. Additional levels of hierarchy beyond a second order did not increase the strength or stiffness, which suggests the existence of an optimal degree of hierarchy to amplify resilience. We developed a computational model that captures local stress distributions within the nanolattices under compression and explains some of the underlying deformation mechanisms as well as validates the measured effective stiffness to be interpreted as a metamaterial property.
The Hourglass Effect in Hierarchical Dependency Networks
Sabrin, Kaeser M
2016-01-01
Many hierarchically modular systems are structured in a way that resembles a bow-tie or hourglass. This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system (the waist of the hourglass). We investigate the hourglass effect in general (not necessarily layered) hierarchical dependency networks. Our analysis focuses on the number of source-to-target dependency paths that traverse each vertex, and it identifies the core of a dependency network as the smallest set of vertices that collectively cover almost all dependency paths. We then examine if a given network exhibits the hourglass property or not, comparing its core size with a "flat" (i.e., non-hierarchical) network that preserves the source dependencies of each target in the original network. As a possible explanation for the hourglass effect, we propose the Reuse Preference (RP) model that captures the bias of new mo...
Semantic Image Segmentation with Contextual Hierarchical Models.
Seyedhosseini, Mojtaba; Tasdizen, Tolga
2016-05-01
Semantic segmentation is the problem of assigning an object label to each pixel. It unifies the image segmentation and object recognition problems. The importance of using contextual information in semantic segmentation frameworks has been widely realized in the field. We propose a contextual framework, called contextual hierarchical model (CHM), which learns contextual information in a hierarchical framework for semantic segmentation. At each level of the hierarchy, a classifier is trained based on downsampled input images and outputs of previous levels. Our model then incorporates the resulting multi-resolution contextual information into a classifier to segment the input image at original resolution. This training strategy allows for optimization of a joint posterior probability at multiple resolutions through the hierarchy. Contextual hierarchical model is purely based on the input image patches and does not make use of any fragments or shape examples. Hence, it is applicable to a variety of problems such as object segmentation and edge detection. We demonstrate that CHM performs at par with state-of-the-art on Stanford background and Weizmann horse datasets. It also outperforms state-of-the-art edge detection methods on NYU depth dataset and achieves state-of-the-art on Berkeley segmentation dataset (BSDS 500).
Genetic algorithm applied to hierarchically coupled associative memories.
Gomes, Rogério Martins; Braga, Antônio Pádua; Borges, Henrique E
2010-01-01
Inspired by the theory of neuronal group selection (TNGS), we have carried out an analysis of the capacity of convergence of a multi-level associative memory based on coupled generalized-brain-state-in-a-box (GBSB) networks through evolutionary computation. The TNGS establishes that a memory process can be described as being organized functionally in hierarchical levels where higher levels coordinate sets of functions of lower levels. According to this theory, the most basic units in the cortical area of the brain are called neuronal groups or first-level blocks of memories and the higher-level memories are formed through selective strengthening or weakening of the synapses amongst the neuronal groups. In order to analyse this effect, we propose that the higher levels should emerge through a learning mechanism as correlations of lower level memories. According to this proposal, this paper describes a method of acquiring the inter-group synapses based on a genetic algorithm. Thus the results show that genetic algorithms are feasible as they allow the emergence of complex behaviours which could be potentially excluded in other learning process.
Spontaneous Motion in Hierarchically Assembled Active Cellular Materials
Chen, Daniel
2013-03-01
With exquisite precision and reproducibility, cells orchestrate the cooperative action of thousands of nanometer-sized molecular motors to carry out mechanical tasks at much larger length scales, such as cell motility, division and replication. Besides their biological importance, such inherently far-from-equilibrium processes are an inspiration for the development of soft materials with highly sought after biomimetic properties such as autonomous motility and self-healing. I will describe our exploration of such a class of biologically inspired soft active materials. Starting from extensile bundles comprised of microtubules and kinesin, we hierarchically assemble active analogs of polymeric gels, liquid crystals and emulsions. At high enough concentration, microtubule bundles form an active gel network capable of generating internally driven chaotic flows that enhance transport and fluid mixing. When confined to emulsion droplets, these 3D networks buckle onto the water-oil interface forming a dense thin film of bundles exhibiting cascades of collective buckling, fracture, and self-healing driven by internally generated stresses from the kinesin clusters. When compressed against surfaces, this active nematic cortex exerts traction stresses that propel the locomotion of the droplet. Taken together, these observations exemplify how assemblies of animate microscopic objects exhibit collective biomimetic properties that are fundamentally distinct from those found in materials assembled from inanimate building blocks. These assemblies, in turn, enable the generation of a new class of materials that exhibit macroscale flow phenomena emerging from nanoscale components.
Category theoretic analysis of hierarchical protein materials and social networks
Spivak, David I; Buehler, Markus J
2011-01-01
Materials in biology span all the scales from Angstroms to meters and typically consist of complex hierarchical assemblies of simple building blocks. Here we review an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs. An olog is like a "concept web" or "semantic network" except that it follows a rigorous mathematical formulation based on category theory. This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other ologs. We consider a simple example of an alpha-helical and an amyloid-like protein filament subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties. We also construct a representation of a social network in which people send text-messages to their nearest neighbors and act as a team to perform a task. We show that the olog for the protein and the olog f...
Bayesian structural equation modeling method for hierarchical model validation
Energy Technology Data Exchange (ETDEWEB)
Jiang Xiaomo [Department of Civil and Environmental Engineering, Vanderbilt University, Box 1831-B, Nashville, TN 37235 (United States)], E-mail: xiaomo.jiang@vanderbilt.edu; Mahadevan, Sankaran [Department of Civil and Environmental Engineering, Vanderbilt University, Box 1831-B, Nashville, TN 37235 (United States)], E-mail: sankaran.mahadevan@vanderbilt.edu
2009-04-15
A building block approach to model validation may proceed through various levels, such as material to component to subsystem to system, comparing model predictions with experimental observations at each level. Usually, experimental data becomes scarce as one proceeds from lower to higher levels. This paper presents a structural equation modeling approach to make use of the lower-level data for higher-level model validation under uncertainty, integrating several components: lower-level data, higher-level data, computational model, and latent variables. The method proposed in this paper uses latent variables to model two sets of relationships, namely, the computational model to system-level data, and lower-level data to system-level data. A Bayesian network with Markov chain Monte Carlo simulation is applied to represent the two relationships and to estimate the influencing factors between them. Bayesian hypothesis testing is employed to quantify the confidence in the predictive model at the system level, and the role of lower-level data in the model validation assessment at the system level. The proposed methodology is implemented for hierarchical assessment of three validation problems, using discrete observations and time-series data.
Modeling diurnal hormone profiles by hierarchical state space models.
Liu, Ziyue; Guo, Wensheng
2015-10-30
Adrenocorticotropic hormone (ACTH) diurnal patterns contain both smooth circadian rhythms and pulsatile activities. How to evaluate and compare them between different groups is a challenging statistical task. In particular, we are interested in testing (1) whether the smooth ACTH circadian rhythms in chronic fatigue syndrome and fibromyalgia patients differ from those in healthy controls and (2) whether the patterns of pulsatile activities are different. In this paper, a hierarchical state space model is proposed to extract these signals from noisy observations. The smooth circadian rhythms shared by a group of subjects are modeled by periodic smoothing splines. The subject level pulsatile activities are modeled by autoregressive processes. A functional random effect is adopted at the pair level to account for the matched pair design. Parameters are estimated by maximizing the marginal likelihood. Signals are extracted as posterior means. Computationally efficient Kalman filter algorithms are adopted for implementation. Application of the proposed model reveals that the smooth circadian rhythms are similar in the two groups but the pulsatile activities in patients are weaker than those in the healthy controls. Copyright © 2015 John Wiley & Sons, Ltd.
Hierarchical segmentation-assisted multimodal registration for MR brain images.
Lu, Huanxiang; Beisteiner, Roland; Nolte, Lutz-Peter; Reyes, Mauricio
2013-04-01
Information theory-based metric such as mutual information (MI) is widely used as similarity measurement for multimodal registration. Nevertheless, this metric may lead to matching ambiguity for non-rigid registration. Moreover, maximization of MI alone does not necessarily produce an optimal solution. In this paper, we propose a segmentation-assisted similarity metric based on point-wise mutual information (PMI). This similarity metric, termed SPMI, enhances the registration accuracy by considering tissue classification probabilities as prior information, which is generated from an expectation maximization (EM) algorithm. Diffeomorphic demons is then adopted as the registration model and is optimized in a hierarchical framework (H-SPMI) based on different levels of anatomical structure as prior knowledge. The proposed method is evaluated using Brainweb synthetic data and clinical fMRI images. Both qualitative and quantitative assessment were performed as well as a sensitivity analysis to the segmentation error. Compared to the pure intensity-based approaches which only maximize mutual information, we show that the proposed algorithm provides significantly better accuracy on both synthetic and clinical data.
A Framework for Hierarchical Clustering Based Indexing in Search Engines
Directory of Open Access Journals (Sweden)
Parul Gupta
2011-01-01
Full Text Available Granting efficient and fast accesses to the index is a key issuefor performances of Web Search Engines. In order to enhancememory utilization and favor fast query resolution, WSEs useInverted File (IF indexes that consist of an array of theposting lists where each posting list is associated with a termand contains the term as well as the identifiers of the documentscontaining the term. Since the document identifiers are stored insorted order, they can be stored as the difference between thesuccessive documents so as to reduce the size of the index. Thispaper describes a clustering algorithm that aims atpartitioning the set of documents into ordered clusters so thatthe documents within the same cluster are similar and are beingassigned the closer document identifiers. Thus the averagevalue of the differences between the successive documents willbe minimized and hence storage space would be saved. Thepaper further presents the extension of this clustering algorithmto be applied for the hierarchical clustering in which similarclusters are clubbed to form a mega cluster and similar megaclusters are then combined to form super cluster. Thus thepaper describes the different levels of clustering whichoptimizes the search process by directing the searchto a specific path from higher levels of clustering to the lowerlevels i.e. from super clusters to mega clusters, then to clustersand finally to the individual documents so that the user gets thebest possible matching results in minimum possible time.
Niimi, Hirofumi; Koike, Minoru; Takeuchi, Seiichi; Douhara, Noriyoshi
2007-12-01
Humanoid by ROBO-BLOCK (robot block system) and the rational formula of robots were proposed. ROBO-BLOCK is composed of servo motors, the parts for servomotor rotor, the brackets for servomotor fixation, the board parts and the controllers. A robot can be assembled easily by ROBO-BLOCK. Meanwhile, it is convenient when the structure of the robot can be described easily as a character. The whole structure of the robot is expressed as rational formula of the robot to show molecule structure in chemistry. ROBO-BLOCK can be useful for not only the research but also the education. Creative student experiment was done in the college of industrial technology.
Dynamics and sensitivity analysis of high-frequency conduction block
Ackermann, D. Michael; Bhadra, Niloy; Gerges, Meana; Thomas, Peter J.
2011-10-01
The local delivery of extracellular high-frequency stimulation (HFS) has been shown to be a fast acting and quickly reversible method of blocking neural conduction and is currently being pursued for several clinical indications. However, the mechanism for this type of nerve block remains unclear. In this study, we investigate two hypotheses: (1) depolarizing currents promote conduction block via inactivation of sodium channels and (2) the gating dynamics of the fast sodium channel are the primary determinate of minimal blocking frequency. Hypothesis 1 was investigated using a combined modeling and experimental study to investigate the effect of depolarizing and hyperpolarizing currents on high-frequency block. The results of the modeling study show that both depolarizing and hyperpolarizing currents play an important role in conduction block and that the conductance to each of three ionic currents increases relative to resting values during HFS. However, depolarizing currents were found to promote the blocking effect, and hyperpolarizing currents were found to diminish the blocking effect. Inward sodium currents were larger than the sum of the outward currents, resulting in a net depolarization of the nodal membrane. Our experimental results support these findings and closely match results from the equivalent modeling scenario: intra-peritoneal administration of the persistent sodium channel blocker ranolazine resulted in an increase in the amplitude of HFS required to produce conduction block in rats, confirming that depolarizing currents promote the conduction block phenomenon. Hypothesis 2 was investigated using a spectral analysis of the channel gating variables in a single-fiber axon model. The results of this study suggested a relationship between the dynamical properties of specific ion channel gating elements and the contributions of corresponding conductances to block onset. Specifically, we show that the dynamics of the fast sodium inactivation gate are
Matching polytopes and Specht modules
Liu, Ricky Ini
2009-01-01
We prove that the dimension of the Specht module of a forest $G$ is the same as the normalized volume of the matching polytope of $G$. We also associate to $G$ a symmetric function $s_G$ (analogous to the Schur symmetric function $s_\\lambda$ for a partition $\\lambda$) and investigate its combinatorial and representation-theoretic properties in relation to the Specht module and Schur module of $G$. We then use this to define notions of standard and semistandard tableaux for forests.
Speeding up 3D speckle tracking using PatchMatch
Zontak, Maria; O'Donnell, Matthew
2016-03-01
Echocardiography provides valuable information to diagnose heart dysfunction. A typical exam records several minutes of real-time cardiac images. To enable complete analysis of 3D cardiac strains, 4-D (3-D+t) echocardiography is used. This results in a huge dataset and requires effective automated analysis. Ultrasound speckle tracking is an effective method for tissue motion analysis. It involves correlation of a 3D kernel (block) around a voxel with kernels in later frames. The search region is usually confined to a local neighborhood, due to biomechanical and computational constraints. For high strains and moderate frame-rates, however, this search region will remain large, leading to a considerable computational burden. Moreover, speckle decorrelation (due to high strains) leads to errors in tracking. To solve this, spatial motion coherency between adjacent voxels should be imposed, e.g., by averaging their correlation functions.1 This requires storing correlation functions for neighboring voxels, thus increasing memory demands. In this work, we propose an efficient search using PatchMatch, 2 a powerful method to find correspondences between images. Here we adopt PatchMatch for 3D volumes and radio-frequency signals. As opposed to an exact search, PatchMatch performs random sampling of the search region and propagates successive matches among neighboring voxels. We show that: 1) Inherently smooth offset propagation in PatchMatch contributes to spatial motion coherence without any additional processing or memory demand. 2) For typical scenarios, PatchMatch is at least 20 times faster than the exact search, while maintaining comparable tracking accuracy.