New code match strategy for wideband code division multiple access code tree management
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Orthogonal variable spreading factor channelization codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. A new code match scheme for WCDMA code tree management was proposed. The code match scheme is similar to the existing crowed-first scheme. When choosing a code for a user, the code match scheme only compares the one up layer of the allocated codes, unlike the crowed-first scheme which perhaps compares all up layers. So the operation of code match scheme is simple, and the average time delay is decreased by 5.1%. The simulation results also show that the code match strategy can decrease the average code blocking probability by 8.4%.
Second Order Mode Selective Phase-Matching
DEFF Research Database (Denmark)
Lassen, Mikael Østergaard; Delaubert, Vincent; Bachor, Hans. A-
2006-01-01
We exploit second order (χ(2)) nonlinear optical phase matching for the selection of individual high order transverse modes. The ratio between the generated components can be adjusted continuously via changes in the phase-matching condition. ©2007 Optical Society of America...
Turbo Codes with Hybrid Interleaving Mode
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
In the investigation of turbo codes, either random interleavers or structured interleavers are used. Combined two kinds of interleavers in one turbo encoder, a hybrid interleaving mode is proposed in this paper. Computer simulations show that the performance of turbo codes with the hybrid interleaving mode is better than that with the typical interleaving mode.
Mode matching in second order susceptibility metamaterials
Héron, Sébastien; Haïdar, Riad
2016-01-01
We present an effective model for a subwavelength periodically patterned metallic layer, its cavities being filled with a nonlinear dielectric material, which accounts for both the linear and second order behavior. The effective non linear susceptibility for the homogenized layer is driven by the nonlinearity of the dielectric material and by the geometrical parameters, thus leading to much higher susceptibility than existing materials. This leads to a huge enhancement of non linear processes when used together with resonances. Furthermore, multiple resonances are taking place in the metallic cavities, and we investigate the mode matching situations for frequency conversion processes and show how it enhances further their efficiency.
Mode matching for optimal plasmonic nonlinear generation
O'Brien, Kevin; Suchowski, Haim; Rho, Jun Suk; Kante, Boubacar; Yin, Xiaobo; Zhang, Xiang
2013-03-01
Nanostructures and metamaterials have attracted interest in the nonlinear optics community due to the possibility of engineering their nonlinear responses; however, the underlying physics to describe nonlinear light generation in nanostructures and the design rules to maximize the emission are still under debate. We study the geometry dependence of the second harmonic and third harmonic emission from gold nanostructures, by designing arrays of nanostructures whose geometry varies from bars to split ring resonators. We fix the length (and volume) of the nanostructure on one axis, and change the morphology from a split ring resonator on the other axis. We observed that the optimal second harmonic generation does not occur at the morphology indicated by a nonlinear oscillator model with parameters derived from the far field transmission and is not maximized by a spectral overlap of the plasmonic modes; however, we find a near field overlap integral and mode matching considerations accurately predict the optimal geometry.
Application of Inertia Ellipse in Code Marker Matching
Institute of Scientific and Technical Information of China (English)
XU Fang; JIANG Weiwei; HE Qing; HU Xiaobin
2010-01-01
In close-range photogrammetry, 3D information acquisition is based on image matching. The application of code marker helps to improve the level of automatic matching and the matching accuracy. This paper inyestigates the application of inertia ellipse algorithm to code marker matching. We can calculate the inertia ellipse of a target with a certain boundary. First, the method is applied to a single code marker; the angle and scaling are valid. Then, the paper introduces the multi code markers matching method by the inertia ellipse. Rotation and scaling changes of homonymy images can be calculated by inertia ellipse algorithm. These parameters can be used for code marker matching in arbitrary attitude close-range photogrammetry.
AUTOMATED IMAGE MATCHING WITH CODED POINTS IN STEREOVISION MEASUREMENT
Institute of Scientific and Technical Information of China (English)
Dong Mingli; Zhou Xiaogang; Zhu Lianqing; Lü Naiguang; Sun Yunan
2005-01-01
A coding-based method to solve the image matching problems in stereovision measurement is presented. The solution is to add and append an identity ID to the retro-reflect point, so it can be identified efficiently under the complicated circumstances and has the characteristics of rotation, zooming, and deformation independence. Its design architecture and implementation process in details based on the theory of stereovision measurement are described. The method is effective on reducing processing data time, improving accuracy of image matching and automation of measuring system through experiments.
Optimal Grouping and Matching for Network-Coded Cooperative Communications
Energy Technology Data Exchange (ETDEWEB)
Sharma, S; Shi, Y; Hou, Y T; Kompella, S; Midkiff, S F
2011-11-01
Network-coded cooperative communications (NC-CC) is a new advance in wireless networking that exploits network coding (NC) to improve the performance of cooperative communications (CC). However, there remains very limited understanding of this new hybrid technology, particularly at the link layer and above. This paper fills in this gap by studying a network optimization problem that requires joint optimization of session grouping, relay node grouping, and matching of session/relay groups. After showing that this problem is NP-hard, we present a polynomial time heuristic algorithm to this problem. Using simulation results, we show that our algorithm is highly competitive and can produce near-optimal results.
Segmented gray-code kernels for fast pattern matching.
Ouyang, Wanli; Zhang, Renqi; Cham, Wai-Kuen
2013-04-01
The gray-code kernels (GCK) family, which has Walsh Hadamard transform on sliding windows as a member, is a family of kernels that can perform image analysis efficiently using a fast algorithm, such as the GCK algorithm. The GCK has been successfully used for pattern matching. In this paper, we propose that the G4-GCK algorithm is more efficient than the previous algorithm in computing GCK. The G4-GCK algorithm requires four additions per pixel for three basis vectors independent of transform size and dimension. Based on the G4-GCK algorithm, we then propose the segmented GCK. By segmenting input data into L(s) parts, the SegGCK requires only four additions per pixel for 3L(s) basis vectors. Experimental results show that the proposed algorithm can significantly accelerate the full-search equivalent pattern matching process and outperforms state-of-the-art methods.
ANALYSIS OF MONOPOLE ANTENNA ON CIRCULAR DISC BY MODE MATCHING
Institute of Scientific and Technical Information of China (English)
Sun Baohua; Zhang Fushun; Liu Qizhong
2001-01-01
Mode matching is used for the analysis of monopole antenna on circular disc, which is achieved by developing a novel model consisting of two artificial ground planes above and bellow the monopole antenna. Using this model, the input impedance is computed and compared with measured data reported in literatures, and excellent agreement is observed.
Local coding based matching kernel method for image classification.
Directory of Open Access Journals (Sweden)
Yan Song
Full Text Available This paper mainly focuses on how to effectively and efficiently measure visual similarity for local feature based representation. Among existing methods, metrics based on Bag of Visual Word (BoV techniques are efficient and conceptually simple, at the expense of effectiveness. By contrast, kernel based metrics are more effective, but at the cost of greater computational complexity and increased storage requirements. We show that a unified visual matching framework can be developed to encompass both BoV and kernel based metrics, in which local kernel plays an important role between feature pairs or between features and their reconstruction. Generally, local kernels are defined using Euclidean distance or its derivatives, based either explicitly or implicitly on an assumption of Gaussian noise. However, local features such as SIFT and HoG often follow a heavy-tailed distribution which tends to undermine the motivation behind Euclidean metrics. Motivated by recent advances in feature coding techniques, a novel efficient local coding based matching kernel (LCMK method is proposed. This exploits the manifold structures in Hilbert space derived from local kernels. The proposed method combines advantages of both BoV and kernel based metrics, and achieves a linear computational complexity. This enables efficient and scalable visual matching to be performed on large scale image sets. To evaluate the effectiveness of the proposed LCMK method, we conduct extensive experiments with widely used benchmark datasets, including 15-Scenes, Caltech101/256, PASCAL VOC 2007 and 2011 datasets. Experimental results confirm the effectiveness of the relatively efficient LCMK method.
Phase Matching of Diverse Modes in a WGM Resonator
Savchenkov, Anatoliy; Strekalov, Dmitry; Yu, Nan; Matsko, Andrey; Mohageg, Makan; Maleki, Lute
2008-01-01
Phase matching of diverse electromagnetic modes (specifically, coexisting optical and microwave modes) in a whispering-gallery-mode (WGM) resonator has been predicted theoretically and verified experimentally. Such phase matching is necessary for storage of microwave/terahertz and optical electromagnetic energy in the same resonator, as needed for exploitation of nonlinear optical phenomena. WGM resonators are used in research on nonlinear optical phenomena at low optical intensities and as a basis for design and fabrication of novel optical devices. Examples of nonlinear optical phenomena recently demonstrated in WGM resonators include low-threshold Raman lasing, optomechanical oscillations, frequency doubling, and hyperparametric oscillations. The present findings regarding phase matching were made in research on low-threshold, strongly nondegenerate parametric oscillations in lithium niobate WGM resonators. The principle of operation of such an oscillator is rooted in two previously observed phenomena: (1) stimulated Raman scattering by polaritons in lithium niobate and (2) phase matching of nonlinear optical processes via geometrical confinement of light. The oscillator is partly similar to terahertz oscillators based on lithium niobate crystals, the key difference being that a novel geometrical configuration of this oscillator supports oscillation in the regime. The high resonance quality factors (Q values) typical of WGM resonators make it possible to achieve oscillation at a threshold signal level much lower than that in a non-WGM-resonator lithium niobate crystal.
Rapid cavity prototyping using mode matching and globalised scattering matrix
Shinton, I
2009-01-01
Cavity design using traditional mesh based numerical means (such as the finite element or finite difference methods) require large mesh calculations in order to obtain accurate values and cavity optimisation is often not achieved. Here we present a mode matching scheme which utilises a globalised scattering matrix approach that allows cavities with curved surfaces (i.e. cavities with elliptical irises and or equators) to be accurately simulated allowing rapid cavity prototyping and optimisation to be achieved. Results on structures in the CLIC main
The Role of Mode Match in Asymmetric Fiber Cavities
Bick, Andreas; Christoph, Philipp; Hellmig, Ortwin; Heinze, Jannes; Sengstock, Klaus; Becker, Christoph
2015-01-01
We study and realize asymmetric fiber-based cavities with optimized mode match to achieve high reflectivity on resonance. This is especially important for mutually coupling two physical systems via light fields, e.g. in quantum hybrid systems. Our detailed theoretical and experimental analysis reveals that on resonance the interference effect between the directly reflected non-modematched light and the light leaking back out of the cavity can lead to large unexpected losses due to the mode filtering of the incoupling fiber. Strong restrictions for the cavity design result out of this effect and we show that planar-concave cavities are clearly best suited. We validate our analytical model using numerical calculations and demonstrate an experimental realization of an asymmetric fiber Fabry-P\\'erot cavity with optimized parameters.
The role of mode match in fiber cavities
Energy Technology Data Exchange (ETDEWEB)
Bick, A.; Staarmann, C.; Christoph, P. [ZOQ (Zentrum für Optische Quantentechnologien) Universität Hamburg, Luruper Chaussee 149, 22761 Hamburg (Germany); Hellmig, O.; Heinze, J. [ILP (Institut für Laserphysik) Universität Hamburg, Luruper Chaussee 149, 22761 Hamburg (Germany); Sengstock, K.; Becker, C., E-mail: cbecker@physnet.uni-hamburg.de [ZOQ (Zentrum für Optische Quantentechnologien) Universität Hamburg, Luruper Chaussee 149, 22761 Hamburg (Germany); ILP (Institut für Laserphysik) Universität Hamburg, Luruper Chaussee 149, 22761 Hamburg (Germany)
2016-01-15
We study and realize asymmetric fiber-based cavities with optimized mode match to achieve high reflectivity on resonance. This is especially important for mutually coupling two physical systems via light fields, e.g., in quantum hybrid systems. Our detailed theoretical and experimental analysis reveals that on resonance, the interference effect between the directly reflected non-modematched light and the light leaking back out of the cavity can lead to large unexpected losses due to the mode filtering of the incoupling fiber. Strong restrictions for the cavity design result out of this effect and we show that planar-concave cavities are clearly best suited. We validate our analytical model using numerical calculations and demonstrate an experimental realization of an asymmetric fiber Fabry-Pérot cavity with optimized parameters.
Analysis of oversized sliding waveguide by mode matching and multi-mode network theory
Energy Technology Data Exchange (ETDEWEB)
Ohkubo, K.; Kubo, S.; Idei, H.; Shimozuma, T.; Yoshimura, Y.; Sato, M.; Takita, Y. [National Inst. for Fusion Science, Toki, Gifu (Japan); Leuterer, F. [Max-Planck Institut fuer Plasmaphysik, Garching (Germany)
2000-12-01
Transmission and reflection coefficients of HE{sub 11} hybrid modes in the sliding waveguide are discussed on the basis of mode matching method and multi-mode network theory. The sliding waveguide is composed of the corrugated waveguide with 88.9 mm{phi} and the smooth-wall waveguide with 110 mm{phi} in inner diameter. It is confirmed that the decrease in power of <0.2% at 84 GHz is obtained for 2 cm in gap of the sliding waveguide. At the sliding length near multi-half-wavelength in vacuum, transmission and reflection powers in the sliding waveguide change slightly, because the very small amount of standing wave of higher-order TE or TM modes is produced resonantly. (author)
Multiview coding mode decision with hybrid optimal stopping model.
Zhao, Tiesong; Kwong, Sam; Wang, Hanli; Wang, Zhou; Pan, Zhaoqing; Kuo, C-C Jay
2013-04-01
In a generic decision process, optimal stopping theory aims to achieve a good tradeoff between decision performance and time consumed, with the advantages of theoretical decision-making and predictable decision performance. In this paper, optimal stopping theory is employed to develop an effective hybrid model for the mode decision problem, which aims to theoretically achieve a good tradeoff between the two interrelated measurements in mode decision, as computational complexity reduction and rate-distortion degradation. The proposed hybrid model is implemented and examined with a multiview encoder. To support the model and further promote coding performance, the multiview coding mode characteristics, including predicted mode probability and estimated coding time, are jointly investigated with inter-view correlations. Exhaustive experimental results with a wide range of video resolutions reveal the efficiency and robustness of our method, with high decision accuracy, negligible computational overhead, and almost intact rate-distortion performance compared to the original encoder.
Evaluating Open-Source Full-Text Search Engines for Matching ICD-10 Codes.
Jurcău, Daniel-Alexandru; Stoicu-Tivadar, Vasile
2016-01-01
This research presents the results of evaluating multiple free, open-source engines on matching ICD-10 diagnostic codes via full-text searches. The study investigates what it takes to get an accurate match when searching for a specific diagnostic code. For each code the evaluation starts by extracting the words that make up its text and continues with building full-text search queries from the combinations of these words. The queries are then run against all the ICD-10 codes until a match indicates the code in question as a match with the highest relative score. This method identifies the minimum number of words that must be provided in order for the search engines choose the desired entry. The engines analyzed include a popular Java-based full-text search engine, a lightweight engine written in JavaScript which can even execute on the user's browser, and two popular open-source relational database management systems.
Low-bit-rate subband image coding with matching pursuits
Rabiee, Hamid; Safavian, S. R.; Gardos, Thomas R.; Mirani, A. J.
1998-01-01
In this paper, a novel multiresolution algorithm for low bit-rate image compression is presented. High quality low bit-rate image compression is achieved by first decomposing the image into approximation and detail subimages with a shift-orthogonal multiresolution analysis. Then, at the coarsest resolution level, the coefficients of the transformation are encoded by an orthogonal matching pursuit algorithm with a wavelet packet dictionary. Our dictionary consists of convolutional splines of up to order two for the detail and approximation subbands. The intercorrelation between the various resolutions is then exploited by using the same bases from the dictionary to encode the coefficients of the finer resolution bands at the corresponding spatial locations. To further exploit the spatial correlation of the coefficients, the zero trees of wavelets (EZW) algorithm was used to identify the potential zero trees. The coefficients of the presentation are then quantized and arithmetic encoded at each resolution, and packed into a scalable bit stream structure. Our new algorithm is highly bit-rate scalable, and performs better than the segmentation based matching pursuit and EZW encoders at lower bit rates, based on subjective image quality and peak signal-to-noise ratio.
A fast block mode selection approach for H. Visual coding
Institute of Scientific and Technical Information of China (English)
LIN Wei-yao; Fang Xiang-zhong; HUANG Xiu-chao; LI Dian; LIU Xiao-feng
2006-01-01
In this paper,a new fast mode-selection approach is proposed.This algorithm combines the proposed approaches of mode pre-decision and precise large-small mode decision,by selecting the best mode efficiently.Experimental results show that the proposed approach can reduce the computational cost of full search and fast multi-block motion estimation by 8% and 45%,respectively,with similar visual quality and bit rate.The proposed algorithm also reduces by 75% the computational cost of the large-small mode isolation algorithm for low-motion sequence coding,and with 0.06 PSNR gain and 3.7% reduction in bit rate.
REVERSE DESIGN APPROACH FOR MECHANISM TRAJECTORY BASED ON CODE-CHAINS MATCHING
Institute of Scientific and Technical Information of China (English)
ZHANG Shuyou; YI Guodong; XU Xiaofeng
2007-01-01
Aiming at the problem of reverse-design of mechanism, a method based on the matching of trajectory code-chains is presented. The motion trajectory of mechanism is described with code-chain,which is normalized to simplify the operation of geometric transformation. The geometric transformation formulas of scale, mirror and rotation for trajectory code-chain are defined, and the reverse design for mechanism trajectory is realized through the analysis and solution of similarity matching between the desired trajectory and the predefined trajectory. The algorithm program and prototype system of reverse design for mechanism trajectory are developed. Application samples show that the method can break the restriction of trajectory patterns in matching, meet the demand of partial matching, and overcome the influence of geometric transformation of trajectory on the reverse design for mechanism.
Motion-compensated wavelet video coding using adaptive mode selection
Zhai, Fan; Pappas, Thrasyvoulos N.
2004-01-01
A motion-compensated wavelet video coder is presented that uses adaptive mode selection (AMS) for each macroblock (MB). The block-based motion estimation is performed in the spatial domain, and an embedded zerotree wavelet coder (EZW) is employed to encode the residue frame. In contrast to other motion-compensated wavelet video coders, where all the MBs are forced to be in INTER mode, we construct the residue frame by combining the prediction residual of the INTER MBs with the coding residual of the INTRA and INTER_ENCODE MBs. Different from INTER MBs that are not coded, the INTRA and INTER_ENCODE MBs are encoded separately by a DCT coder. By adaptively selecting the quantizers of the INTRA and INTER_ENCODE coded MBs, our goal is to equalize the characteristics of the residue frame in order to improve the overall coding efficiency of the wavelet coder. The mode selection is based on the variance of the MB, the variance of the prediction error, and the variance of the neighboring MBs' residual. Simulations show that the proposed motion-compensated wavelet video coder achieves a gain of around 0.7-0.8dB PSNR over MPEG-2 TM5, and a comparable PSNR to other 2D motion-compensated wavelet-based video codecs. It also provides potential visual quality improvement.
Advanced coding techniques for few mode transmission systems.
Okonkwo, Chigo; van Uden, Roy; Chen, Haoshuo; de Waardt, Huug; Koonen, Ton
2015-01-26
We experimentally verify the advantage of employing advanced coding schemes such as space-time coding and 4 dimensional modulation formats to enhance the transmission performance of a 3-mode transmission system. The performance gain of space-time block codes for extending the optical signal-to-noise ratio tolerance in multiple-input multiple-output optical coherent spatial division multiplexing transmission systems with respect to single-mode transmission performance are evaluated. By exploiting the spatial diversity that few-mode-fibers offer, with respect to single mode fiber back-to-back performance, significant OSNR gains of 3.2, 4.1, 4.9, and 6.8 dB at the hard-decision forward error correcting limit are demonstrated for DP-QPSK 8, 16 and 32 QAM, respectively. Furthermore, by employing 4D constellations, 6 × 28Gbaud 128 set partitioned quadrature amplitude modulation is shown to outperform conventional 8 QAM transmission performance, whilst carrying an additional 0.5 bit/symbol.
FDNS CFD Code Benchmark for RBCC Ejector Mode Operation
Holt, James B.; Ruf, Joe
1999-01-01
Computational Fluid Dynamics (CFD) analysis results are compared with benchmark quality test data from the Propulsion Engineering Research Center's (PERC) Rocket Based Combined Cycle (RBCC) experiments to verify fluid dynamic code and application procedures. RBCC engine flowpath development will rely on CFD applications to capture the multi-dimensional fluid dynamic interactions and to quantify their effect on the RBCC system performance. Therefore, the accuracy of these CFD codes must be determined through detailed comparisons with test data. The PERC experiments build upon the well-known 1968 rocket-ejector experiments of Odegaard and Stroup by employing advanced optical and laser based diagnostics to evaluate mixing and secondary combustion. The Finite Difference Navier Stokes (FDNS) code was used to model the fluid dynamics of the PERC RBCC ejector mode configuration. Analyses were performed for both Diffusion and Afterburning (DAB) and Simultaneous Mixing and Combustion (SMC) test conditions. Results from both the 2D and the 3D models are presented.
Fast Macroblock Mode Selection Algorithm for Multiview Video Coding
Directory of Open Access Journals (Sweden)
Qionghai Dai
2009-01-01
Full Text Available Multiview video coding (MVC plays an important role in three-dimensional video applications. Joint Video Team developed a joint multiview video model (JMVM in which full-search algorithm is employed in macroblock mode selection to provide the best rate distortion performance for MVC. However, it results in a considerable increase in encoding complexity. We propose a hybrid fast macroblock mode selection algorithm after analyzing the full-search algorithm of JMVM. For nonanchor frames of the base view, the proposed algorithm halfway stops the macroblock mode search process by designing three dynamic thresholds. When nonanchor frames of the other views are being encoded, the macroblock modes can be predicted from the frames of the neighboring views due to the strong correlations of the macroblock modes. Experimental results show that the proposed hybrid fast macroblock mode selection algorithm promotes the encoding speed by 2.37Ã¢Â€Â‰Ã¢ÂˆÂ¼Ã¢Â€Â‰9.97 times without noticeable quality degradation compared with the JMVM.
Batch Mode Active Sampling based on Marginal Probability Distribution Matching.
Chattopadhyay, Rita; Wang, Zheng; Fan, Wei; Davidson, Ian; Panchanathan, Sethuraman; Ye, Jieping
2012-01-01
Active Learning is a machine learning and data mining technique that selects the most informative samples for labeling and uses them as training data; it is especially useful when there are large amount of unlabeled data and labeling them is expensive. Recently, batch-mode active learning, where a set of samples are selected concurrently for labeling, based on their collective merit, has attracted a lot of attention. The objective of batch-mode active learning is to select a set of informative samples so that a classifier learned on these samples has good generalization performance on the unlabeled data. Most of the existing batch-mode active learning methodologies try to achieve this by selecting samples based on varied criteria. In this paper we propose a novel criterion which achieves good generalization performance of a classifier by specifically selecting a set of query samples that minimizes the difference in distribution between the labeled and the unlabeled data, after annotation. We explicitly measure this difference based on all candidate subsets of the unlabeled data and select the best subset. The proposed objective is an NP-hard integer programming optimization problem. We provide two optimization techniques to solve this problem. In the first one, the problem is transformed into a convex quadratic programming problem and in the second method the problem is transformed into a linear programming problem. Our empirical studies using publicly available UCI datasets and a biomedical image dataset demonstrate the effectiveness of the proposed approach in comparison with the state-of-the-art batch-mode active learning methods. We also present two extensions of the proposed approach, which incorporate uncertainty of the predicted labels of the unlabeled data and transfer learning in the proposed formulation. Our empirical studies on UCI datasets show that incorporation of uncertainty information improves performance at later iterations while our studies on 20
Quadratic B-mode (QB-Mode) Ultrasonic Imaging with Coded Transmit Waveforms.
Cecchini, Daniele; Yao, Hui; Phukpattaranont, Pornchai; Ebbini, Emad
2005-01-01
In this paper, the use of coded transmit waveforms with post-beamforming nonlinear filtering of echo data in diagnostic ultrasound is presented. The nonlinear filter based on the second-order Volterra filter (SoVF) model separates the linear and quadratic echo components. The grayscale representation of the latter results in a new mode of imaging we refer to as quadratic B-mode (QB-mode). The use of chirp transmit waveforms in imaging contrast agents allows for nonlinear excitation of microbubble contrast agents (UCA) at a range of frequencies throughout the bandwidth of the transducer. The QB-mode image is shown to produce significant increase in UCA contrast over standard B-mode images from conventional and chirp excitation with and without compression. This contrast enhancement is achieved without loss in spatial resolution.
Hash-Based Line-by-Line Template Matching for Lossless Screen Image Coding.
Xiulian Peng; Jizheng Xu
2016-12-01
Template matching (TM) was proposed in the literature a decade ago to efficiently remove non-local redundancies within an image without transmitting any overhead of displacement vectors. However, the large computational complexity introduced at both the encoder and the decoder, especially for a large search range, limits its widespread use. This paper proposes a hash-based line-by-line template matching (hLTM) for lossless screen image coding, where the non-local redundancy commonly exists in text and graphics parts. By hash-based search, it can largely reduce the search complexity of template matching without an accuracy degradation. Besides, the line-by-line template matching increases prediction accuracy by using a fine granularity. Experimental results show that the hLTM can significantly reduce both the encoding and decoding complexities by 68 and 23 times, respectively, compared with the traditional TM with a search radius of 128. Moreover, when compared with High Efficiency Video Coding screen content coding test model SCM-1.0, it can largely improve coding efficiency by up to 12.68% bits saving on screen contents with rich texts/graphics.
The NEST Dry-Run Mode: Efficient Dynamic Analysis of Neuronal Network Simulation Code
Directory of Open Access Journals (Sweden)
Susanne Kunkel
2017-06-01
Full Text Available NEST is a simulator for spiking neuronal networks that commits to a general purpose approach: It allows for high flexibility in the design of network models, and its applications range from small-scale simulations on laptops to brain-scale simulations on supercomputers. Hence, developers need to test their code for various use cases and ensure that changes to code do not impair scalability. However, running a full set of benchmarks on a supercomputer takes up precious compute-time resources and can entail long queuing times. Here, we present the NEST dry-run mode, which enables comprehensive dynamic code analysis without requiring access to high-performance computing facilities. A dry-run simulation is carried out by a single process, which performs all simulation steps except communication as if it was part of a parallel environment with many processes. We show that measurements of memory usage and runtime of neuronal network simulations closely match the corresponding dry-run data. Furthermore, we demonstrate the successful application of the dry-run mode in the areas of profiling and performance modeling.
The mode matching technology for MEMS gyroscopes with mutually spaced eigenfrequencies
Morozov, O.; Postnikov, A.; Kozin, I.; Soloviev, A.; Tarasov, A.
2013-01-01
Paper presents a new technology for silicon micromachined gyroscope mode matching with mutually spaced eigenfrequencies. The fabrication of gyroscope sensing element is based on double-sided deep reactive ion etching (DRIE) of standard silicon wafer and allows full 3D control of the gimbals and flexures geometry. The developed finite element model allows predicting dynamic characteristics of sensing element versus geometry of flexible suspension beams. Oxidation and successive wet etching of SiO2 layer lead to flexure geometry change (thinning). One-to-one correspondence of measured resonant frequencies and flexures geometry defines the oxidation depth. The mode matching condition is achieved by repeated oxidation-wet etching cycles.
Mode-matching without root-finding: Application to a dissipative silencer
Lawrie, JB; Kirby, R.
2006-01-01
This article presents an analytic mode-matching approach suitable for modelling the propagation of sound in a two-dimensional, three-part, ducting system. The approach avoids the need to the find roots of the characteristic equation for the middle section of the duct (the component) and is readily applicable to a broad class of problems. It is demonstrated that the system of equations, derived via analytic mode-matching, exhibits certain features which ensure that they can be re-cast into a ...
Nennig, Benoit; Perrey-Debain, Emmanuel; Ben Tahar, Mabrouk
2010-12-01
A mode matching method for predicting the transmission loss of a cylindrical shaped dissipative silencer partially filled with a poroelastic foam is developed. The model takes into account the solid phase elasticity of the sound-absorbing material, the mounting conditions of the foam, and the presence of a uniform mean flow in the central airway. The novelty of the proposed approach lies in the fact that guided modes of the silencer have a composite nature containing both compressional and shear waves as opposed to classical mode matching methods in which only acoustic pressure waves are present. Results presented demonstrate good agreement with finite element calculations provided a sufficient number of modes are retained. In practice, it is found that the time for computing the transmission loss over a large frequency range takes a few minutes on a personal computer. This makes the present method a reliable tool for tackling dissipative silencers lined with poroelastic materials.
Adaptive mode decision with residual motion compensation for distributed video coding
DEFF Research Database (Denmark)
Luong, Huynh Van; Forchhammer, Søren; Slowack, Jurgen;
2015-01-01
Distributed video coding (DVC) is a coding paradigm that entails low complexity encoding by exploiting the source statistics at the decoder. To improve the DVC coding efficiency, this paper proposes a novel adaptive technique for mode decision to control and take advantage of skip mode and intra...
El-Shafai, Walid
2015-09-01
3D multi-view video (MVV) is multiple video streams shot by several cameras around a single scene simultaneously. Therefore it is an urgent task to achieve high 3D MVV compression to meet future bandwidth constraints while maintaining a high reception quality. 3D MVV coded bit-streams that are transmitted over wireless network can suffer from error propagation in the space, time and view domains. Error concealment (EC) algorithms have the advantage of improving the received 3D video quality without any modifications in the transmission rate or in the encoder hardware or software. To improve the quality of reconstructed 3D MVV, we propose an efficient adaptive EC algorithm with multi-hypothesis modes to conceal the erroneous Macro-Blocks (MBs) of intra-coded and inter-coded frames by exploiting the spatial, temporal and inter-view correlations between frames and views. Our proposed algorithm adapts to 3D MVV motion features and to the error locations. The lost MBs are optimally recovered by utilizing motion and disparity matching between frames and views on pixel-by-pixel matching basis. Our simulation results show that the proposed adaptive multi-hypothesis EC algorithm can significantly improve the objective and subjective 3D MVV quality.
Benchmark studies of the gyro-Landau-fluid code and gyro-kinetic codes on kinetic ballooning modes
Tang, T. F.; Xu, X. Q.; Ma, C. H.; Bass, E. M.; Holland, C.; Candy, J.
2016-03-01
A Gyro-Landau-Fluid (GLF) 3 + 1 model has been recently implemented in BOUT++ framework, which contains full Finite-Larmor-Radius effects, Landau damping, and toroidal resonance [Ma et al., Phys. Plasmas 22, 055903 (2015)]. A linear global beta scan has been conducted using the JET-like circular equilibria (cbm18 series), showing that the unstable modes are kinetic ballooning modes (KBMs). In this work, we use the GYRO code, which is a gyrokinetic continuum code widely used for simulation of the plasma microturbulence, to benchmark with GLF 3 + 1 code on KBMs. To verify our code on the KBM case, we first perform the beta scan based on "Cyclone base case parameter set." We find that the growth rate is almost the same for two codes, and the KBM mode is further destabilized as beta increases. For JET-like global circular equilibria, as the modes localize in peak pressure gradient region, a linear local beta scan using the same set of equilibria has been performed at this position for comparison. With the drift kinetic electron module in the GYRO code by including small electron-electron collision to damp electron modes, GYRO generated mode structures and parity suggest that they are kinetic ballooning modes, and the growth rate is comparable to the GLF results. However, a radial scan of the pedestal for a particular set of cbm18 equilibria, using GYRO code, shows different trends for the low-n and high-n modes. The low-n modes show that the linear growth rate peaks at peak pressure gradient position as GLF results. However, for high-n modes, the growth rate of the most unstable mode shifts outward to the bottom of pedestal and the real frequency of what was originally the KBMs in ion diamagnetic drift direction steadily approaches and crosses over to the electron diamagnetic drift direction.
Benchmark studies of the gyro-Landau-fluid code and gyro-kinetic codes on kinetic ballooning modes
Energy Technology Data Exchange (ETDEWEB)
Tang, T. F. [Dalian University of Technology, Dalian 116024 (China); Lawrence Livermore National Laboratory, Livermore, California 94550 (United States); Xu, X. Q. [Lawrence Livermore National Laboratory, Livermore, California 94550 (United States); Ma, C. H. [Fusion Simulation Center, School of Physics, Peking University, Beijing (China); Bass, E. M.; Candy, J. [General Atomics, P.O. Box 85608, San Diego, California 92186-5608 (United States); Holland, C. [University of California San Diego, La Jolla, California 92093-0429 (United States)
2016-03-15
A Gyro-Landau-Fluid (GLF) 3 + 1 model has been recently implemented in BOUT++ framework, which contains full Finite-Larmor-Radius effects, Landau damping, and toroidal resonance [Ma et al., Phys. Plasmas 22, 055903 (2015)]. A linear global beta scan has been conducted using the JET-like circular equilibria (cbm18 series), showing that the unstable modes are kinetic ballooning modes (KBMs). In this work, we use the GYRO code, which is a gyrokinetic continuum code widely used for simulation of the plasma microturbulence, to benchmark with GLF 3 + 1 code on KBMs. To verify our code on the KBM case, we first perform the beta scan based on “Cyclone base case parameter set.” We find that the growth rate is almost the same for two codes, and the KBM mode is further destabilized as beta increases. For JET-like global circular equilibria, as the modes localize in peak pressure gradient region, a linear local beta scan using the same set of equilibria has been performed at this position for comparison. With the drift kinetic electron module in the GYRO code by including small electron-electron collision to damp electron modes, GYRO generated mode structures and parity suggest that they are kinetic ballooning modes, and the growth rate is comparable to the GLF results. However, a radial scan of the pedestal for a particular set of cbm18 equilibria, using GYRO code, shows different trends for the low-n and high-n modes. The low-n modes show that the linear growth rate peaks at peak pressure gradient position as GLF results. However, for high-n modes, the growth rate of the most unstable mode shifts outward to the bottom of pedestal and the real frequency of what was originally the KBMs in ion diamagnetic drift direction steadily approaches and crosses over to the electron diamagnetic drift direction.
Suite of Standards for Electromagnetic Material Characterization Using Mode Matching Theory
2009-03-01
debt of gratitude to Dr. Michael Havrilla for all of the guidance and physical insight he provided. Secondly, a great debt of gratitude is owed to Dr...an effective standard. material measurement, mode matching technique, uncertainty U U U UU 114 Dr. Michael J. Havrilla (937)255-3636 ext 4582; michael.havrilla@afit.edu
Analytical modelling of waveguide mode launchers for matched feed reflector systems
DEFF Research Database (Denmark)
Palvig, Michael Forum; Breinbjerg, Olav; Meincke, Peter
2016-01-01
Matched feed horns aim to cancel cross polarization generated in offset reflector systems. An analytical method for predicting the mode spectrum generated by inclusions in such horns, e.g. stubs and pins, is presented. The theory is based on the reciprocity theorem with the inclusions represented...
General forms of elastic-plastic matching equations for mode-Ⅲ cracks near crack line
Institute of Scientific and Technical Information of China (English)
Zhi-jian YI; Chao-hua ZHAO; Qing-guo YANG; Kai PENG; Zong-ming HUANG
2009-01-01
Crack line analysis is an effective way to solve elastic-plastic crack problems.Application of the method does not need the traditional small-scale yielding conditions and can obtain sufficiently accurate solutions near the crack line. To address mode-Ⅲ crack problems under the perfect elastic-plastic condition,matching procedures of the crack line analysis method are summarized and refined to give general forms and formulation steps of plastic field,elastic-plastic boundary,and elastic-plastic matching equations near the crack line. The research unifies mode-Ⅲ crack problems under different conditions into a problem of determining four integral constants with four matching equations.An example is given to verify correctness,conciseness,and generality of the procedure.
Data-based matched-mode source localization for a moving source.
Yang, T C
2014-03-01
A data-based matched-mode source localization method is proposed in this paper for a moving source, using mode wavenumbers and depth functions estimated directly from the data, without requiring any environmental acoustic information and assuming any propagation model. The method is in theory free of the environmental mismatch problem because the mode replicas are estimated from the same data used to localize the source. Besides the estimation error due to the approximations made in deriving the data-based algorithms, the method has some inherent drawbacks: (1) It uses a smaller number of modes than theoretically possible because some modes are not resolved in the measurements, and (2) the depth search is limited to the depth covered by the receivers. Using simulated data, it is found that the performance degradation due to the afore-mentioned approximation/limitation is marginal compared with the original matched-mode source localization method. The proposed method has a potential to estimate the source range and depth for real data and be free of the environmental mismatch problem, noting that certain aspects of the (estimation) algorithms have previously been tested against data. The key issues are discussed in this paper.
Detailed phase matching characterization of inter-modal four-wave mixing in a two-mode fiber
DEFF Research Database (Denmark)
Friis, Søren Michael Mørk; Jung, Y.; Begleris, I.
2016-01-01
We experimentally characterize the phase matching properties of two inter-modal four-wave mixing processes in a graded index fiber guiding the LP01 and LP11 mode-groups.......We experimentally characterize the phase matching properties of two inter-modal four-wave mixing processes in a graded index fiber guiding the LP01 and LP11 mode-groups....
Alippi, A.; Biagioni, A.; Germano, M.; Passeri, D.
2008-06-01
Local probing of nonlinear generation of harmonic vibrations has been done on bone plate samples and the evaluation of the nonlinear term is derived from a limited number of cases of bovine thigh bones, that shows that a low level of nonlinearity is present in bone structures. This is consistent with the assumption that in low level nonlinear samples the distribution of harmonic vibrations matches the corresponding power distribution of the fundamental mode.
High-Q lattice mode matched structural resonances in terahertz metasurfaces
Energy Technology Data Exchange (ETDEWEB)
Xu, Ningning; Zhang, Weili, E-mail: weili.zhang@okstate.edu [School of Electrical and Computer Engineering, Oklahoma State University, Stillwater, Oklahoma 74078 (United States); Singh, Ranjan, E-mail: ranjans@ntu.edu.sg [Division of Physics and Applied Physics, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637371 (Singapore); Centre for Disruptive Photonic Technologies, The Photonics Institute, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798 (Singapore)
2016-07-11
The quality (Q) factor of metamaterial resonances is limited by the radiative and non-radiative losses. At terahertz frequencies, the dominant loss channel is radiative in nature since the non-radiative losses are low due to high conductivity of metals. Radiative losses could be suppressed by engineering the meta-atom structure. However, such suppression usually occurs at the fundamental resonance mode which is typically a closed mode resonance such as an inductive-capacitive resonance or a Fano resonance. Here, we report an order of magnitude enhancement in Q factor of all the structural eigenresonances of a split-ring resonator fueled by the lattice mode matching. We match the fundamental order diffractive mode to each of the odd and even eigenresonances, thus leading to a tremendous line-narrowing of all the resonances. Such precise tailoring and control of the structural resonances in a metasurface lattice could have potential applications in low-loss devices, sensing, and design of high-Q metamaterial cavities.
Albelda, J.; Denia, F. D.; Torres, M. I.; Fuenmayor, F. J.
2007-06-01
To carry out the acoustic analysis of dissipative silencers with uniform cross-section, the application of the mode matching method at the geometrical discontinuities is an attractive option from a computational point of view. The consideration of this methodology assumes, in general, that the modes associated with the transversal geometry of each element with uniform cross-section are known for the excitation frequencies considered in the analysis. The calculation of the transversal modes is not, however, a simple task when the acoustic system involves perforated elements and absorbent materials. The current work presents a modal approach to calculate the transversal modes and the corresponding axial wavenumbers for dissipative mufflers of uniform (but arbitrary) cross-section. The proposed technique is based on the division of the transversal section into subdomains and the subsequent use of a substructuring procedure with two sets of modes to improve the convergence. The former set of modes fulfils the condition of zero pressure at the common boundary between transversal subdomains while the latter satisfies the condition of zero derivative in the direction normal to the boundary. The approach leads to a versatile methodology with a moderate computational effort that can be applied to mufflers commonly found in real applications. To validate the procedure presented in this work, comparisons are provided with finite element predictions and results available in the literature, showing a good agreement. In addition, the procedure is applied to an example of practical interest.
Mode-dependent templates and scan order for H.264/AVC-based intra lossless coding.
Gu, Zhouye; Lin, Weisi; Lee, Bu-Sung; Lau, Chiew Tong; Sun, Ming-Ting
2012-09-01
In H.264/advanced video coding (AVC), lossless coding and lossy coding share the same entropy coding module. However, the entropy coders in the H.264/AVC standard were original designed for lossy video coding and do not yield adequate performance for lossless video coding. In this paper, we analyze the problem with the current lossless coding scheme and propose a mode-dependent template (MD-template) based method for intra lossless coding. By exploring the statistical redundancy of the prediction residual in the H.264/AVC intra prediction modes, more zero coefficients are generated. By designing a new scan order for each MD-template, the scanned coefficients sequence fits the H.264/AVC entropy coders better. A fast implementation algorithm is also designed. With little computation increase, experimental results confirm that the proposed fast algorithm achieves about 7.2% bit saving compared with the current H.264/AVC fidelity range extensions high profile.
Narrowband impedance matching layer for high efficiency thickness mode ultrasonic transducers.
Toda, Minoru
2002-03-01
A new matching layer design concept has been proposed for narrowband continuous wave (CW) devices. Analysis has shown that the mechanical impedance of a resonant-type transducer in thickness mode CW operation does not equal its acoustic impedance rhoVs but roughly equals rhoVs/Q, where p is density, Vs is acoustic velocity, and Q is the mechanical quality factor. The value of rhoVs/Q is much lower than the acoustic impedance of water for any transducer material, including lead zirconium titanate (PZT), single crystals, or polyvinylidene fluoride (PVDF). With this new approach, the impedance of the matching layer must also be between water and pVs/Q, but there are few such practical low impedance materials. To realize equivalent low impedance structure, a novel double layer design is presented: a relatively low impedance material (such as polyethylene or polyurethane) on the inside and a relatively high impedance material (such as polyester or metal) on the outside. A high power CW transducer structure was designed and fabricated with PVDF-TrFE (polyvinylidene fluoride trifluoroethylene) to operate at 1.4 MHz. The basic quarter wavelength resonator structure is 0.7-mm alumina/0.2-mm piezo-polymer/0.25-mm polyester, and the matching section is 0.2-mm polyurethane and 0.25-mm polyester. A maximum power output of 6 to 9 W/cm2 with conversion efficiency of 30 to 35% was observed. For the transducer without matching section, the observed power was 3 to 4 W/cm2. Mason's model analyses (1) predict that the traditional matching layer is for broadband purposes and reduces output power both for PZT and PVDF-TrFE (2); this new matching scheme can be applied to PZT high power transducer. This high efficiency technique has application in various CW systems, such as Doppler sensors, interferometry, phase-sensitive imaging, or high energy focused beam systems.
A flux-matched gyrokinetic analysis of DIII-D L-mode turbulence
Görler, T.; White, A. E.; Told, D.; Jenko, F.; Holland, C.; Rhodes, T. L.
2014-12-01
Previous nonlinear gyrokinetic simulations of specific DIII-D L-mode cases have been found to significantly underpredict the ion heat transport and associated density and temperature fluctuation levels by up to almost one of order of magnitude in the outer-core domain, i.e., roughly in the last third of the minor radius. Since then, this so-called shortfall issue has been subject to various speculations on possible reasons and furthermore motivation for a number of dedicated comparisons for L-mode plasmas in comparable machines. However, only a rather limited number of simulations and gyrokinetic codes has been applied to the original scenario, thus calling for further dedicated investigations in order to broaden the scientific basis. The present work contributes along these lines by employing another well-established gyrokinetic code in a numerically and physically comprehensive manner. Contrary to the previous studies, only a mild underprediction is observed at the outer radial positions which can furthermore be overcome by varying the ion temperature gradient within the error bars associated with the experimental measurement. The significance and reliability of these simulations are demonstrated by benchmarks, numerical convergence tests, and furthermore by extensive validation studies. The latter involve cross-phase and cross-power spectra analyses of various fluctuating quantities and confirm a high degree of realism. The code discrepancies come as a surprise since the involved software packages had been benchmarked repeatedly and very successfully in the past. Further collaborative effort in identifying the underlying difference is hence required.
Wohlbrandt, Attila; Guérin, Sébastien
2015-01-01
Time-periodic CFD simulations are widely used to investigate turbomachinery components. The triple-plane pressure mode matching method (TPP) developed by Ovenden and Rienstra extracts the acoustic part in such simulations. Experience shows that this method is subject to significant errors when the amplitude of pseudo-sound is high compared to sound. Pseudo-sound are unsteady pressure fluctuations with a convective character. The presented extension to the TPP improves the splitting between acoustics and the rest of the unsteady flow field. The method is simple: i) the acoustic eigenmodes are analytically determined for a uniform mean flow as in the original TPP; ii) the suggested model for convective pressure perturbations uses the convective wavenumber as axial wavenumber and the same orthogonal radial shape functions as for the acoustic modes. The reliability is demonstrated on the simulation data of a low-pressure fan. As acoustic and convective perturbations are separated, the accuracy of the results incr...
Tagalog-English Code Switching as a Mode of Discourse
Bautista, Maria Lourdes S.
2004-01-01
The alternation of Tagalog and English in informal discourse is a feature of the linguistic repertoire of educated, middle- and upper-class Filipinos. This paper describes the linguistic structure and sociolinguistic functions of Tagalog-English code switching (Taglish) as provided by various researchers through the years. It shows that the…
New Class of Quantum Error-Correcting Codes for a Bosonic Mode
Michael, Marios H.; Silveri, Matti; Brierley, R. T.; Albert, Victor V.; Salmilehto, Juha; Jiang, Liang; Girvin, S. M.
2016-07-01
We construct a new class of quantum error-correcting codes for a bosonic mode, which are advantageous for applications in quantum memories, communication, and scalable computation. These "binomial quantum codes" are formed from a finite superposition of Fock states weighted with binomial coefficients. The binomial codes can exactly correct errors that are polynomial up to a specific degree in bosonic creation and annihilation operators, including amplitude damping and displacement noise as well as boson addition and dephasing errors. For realistic continuous-time dissipative evolution, the codes can perform approximate quantum error correction to any given order in the time step between error detection measurements. We present an explicit approximate quantum error recovery operation based on projective measurements and unitary operations. The binomial codes are tailored for detecting boson loss and gain errors by means of measurements of the generalized number parity. We discuss optimization of the binomial codes and demonstrate that by relaxing the parity structure, codes with even lower unrecoverable error rates can be achieved. The binomial codes are related to existing two-mode bosonic codes, but offer the advantage of requiring only a single bosonic mode to correct amplitude damping as well as the ability to correct other errors. Our codes are similar in spirit to "cat codes" based on superpositions of the coherent states but offer several advantages such as smaller mean boson number, exact rather than approximate orthonormality of the code words, and an explicit unitary operation for repumping energy into the bosonic mode. The binomial quantum codes are realizable with current superconducting circuit technology, and they should prove useful in other quantum technologies, including bosonic quantum memories, photonic quantum communication, and optical-to-microwave up- and down-conversion.
Mode-matching without root-finding: application to a dissipative silencer.
Lawrie, Jane B; Kirby, Ray
2006-04-01
This article presents an analytic mode-matching approach suitable for modelling the propagation of sound in a two-dimensional, three-part, ducting system. The approach avoids the need to find roots of the characteristic equation for the middle section of the duct (the component) and is readily applicable to a broad class of problems. It is demonstrated that the system of equations, derived via analytic mode-matching, exhibits certain features which ensure that they can be recast into a form that is independent of the roots of the characteristic equation for the component. The precise details of the component are irrelevant to the procedure; it is required only that there exists an orthogonality relation, or similar, for the eigenmodes corresponding to the propagating wave forms in this region. The method is applied here to a simple problem involving acoustic transmission through a dissipative silencer of the type commonly found in heating ventilation and air-conditioning ducts. With reference to this example, the silencer transmission loss is computed, and the power balance for the silencer is investigated and is shown to be an identity that is necessarily satisfied by the system of equations, regardless of the level of truncation.
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.
DEFF Research Database (Denmark)
Parmigiani, F.; Jung, Y.; Friis, Søren Michael Mørk
2016-01-01
We experimentally study inter-modal four-wave mixing (FWM) in few-mode fibres with different phase matching properties. The possibility of transmitting two spatial modes without intermodal FWM cross-talk in the C-band is presented....
Comparison of results between the ballooning-modes codes BLOON and BALOON
Energy Technology Data Exchange (ETDEWEB)
Munro, J.K. Jr.
1981-08-01
Ballooning mode equation eigenvalues calculated by two different codes, BLOON (written at General Atomic) and BALOON (written at Oak Ridge National Laboratory) have been compared for a sequence of equilibria having a range of ..beta.. values. The results agree for marginal stability only. Differences away from marginal stability may be due to differences in the coordinate systems used for the analysis in the two codes. Equilibria were generated using the ISLAND code of D. Stevens of New York University. Results of various convergence studies made with the codes are presented together with recommendations for their use.
Effect of perfectly matched layer reflection coefficient on modal analysis of leaky waveguide modes.
Lai, Chih-Hsien; Chang, Hung-chun
2011-01-17
The reflection coefficient is one important parameter of the perfectly matched layer (PML). Here we investigate its effect on the modal analysis of leaky waveguide modes by examining three different leaky waveguide structures, i.e., the holey fiber, the air-core terahertz pipe waveguide, and the gain-guided and index-antiguided slab waveguide. Numerical results reveal that the typical values 10(-8) ~10(-12) are inadequate for obtaining the imaginary part of the complex propagation constant, and the suggested reflection coefficient would be much smaller, for example, 10(-50) or 10(-100). With such a small coefficient, both the computational window size and the PML thickness can be significantly reduced without loss of stability. Moreover, in some cases, the modal field profiles can only be accurately obtained with such a small coefficient.
High Finesse Fiber Fabry-Perot Cavities: Stabilization and Mode Matching Analysis
Gallego, Jose; Alavi, Seyed Khalil; Alt, Wolfgang; Martinez-Dorantes, Miguel; Meschede, Dieter; Ratschbacher, Lothar
2015-01-01
Fiber Fabry-Perot cavities, formed by micro-machined mirrors on the end-facets of optical fibers, are used in an increasing number of technical and scientific applications, where they typically require precise stabilization of their optical resonances. Here, we study two different approaches to construct fiber Fabry-Perot resonators and stabilize their length for experiments in cavity quantum electrodynamics with neutral atoms. A piezo-mechanically actuated cavity with feedback based on the Pound-Drever-Hall locking technique is compared to a novel rigid cavity design that makes use of the high passive stability of a monolithic cavity spacer and employs thermal self-locking and external temperature tuning. Furthermore, we present a general analysis of the mode matching problem in fiber Fabry-Perot cavities, which explains the asymmetry in their reflective line shapes and has important implications for the optimal alignment of the fiber resonators. Finally, we discuss the issue of fiber-generated background ph...
Hellwig, Tim; Schnack, Martin; Boller, Klaus -J; Fallnich, Carsten
2015-01-01
We demonstrate the potential of birefringence-based, all-optical, ultrafast conversion between the transverse modes in integrated optical waveguides by modelling the conversion process by numerically solving the multi-mode coupled nonlinear Schroedinger equations. The observed conversion is induced by a control beam and due to the Kerr effect, resulting in a transient index grating which coherently scatters probe light from one transverse waveguide mode into another. We introduce birefringent phase matching to enable efficient all-optically induced mode conversion at different wavelengths of the control and probe beam. It is shown that tailoring the waveguide geometry can be exploited to explicitly minimize intermodal group delay as well as to maximize the nonlinear coefficient, under the constraint of a phase matching condition. The waveguide geometries investigated here, allow for mode conversion with over two orders of magnitude reduced control pulse energy compared to previous schemes and thereby promise ...
Directory of Open Access Journals (Sweden)
Aswathi D
2016-10-01
Full Text Available An efficient architecture is introduced for the matching of data encoded with error correcting code using a cache memory is presented in brief. Using cache memory it reduces latency and complexity to an fine level. And this architecture further reduces the dynamic power without affecting the time. For the comparison of data, hamming distance along used to check whether the data match the data kept in main memory. Instead of butterfly formed weight accumulator(previous work here no other mechanism is presented for calculating hamming distance.
Mode matching in multiresonant plasmonic nanoantennas for enhanced second harmonic generation.
Celebrano, Michele; Wu, Xiaofei; Baselli, Milena; Großmann, Swen; Biagioni, Paolo; Locatelli, Andrea; De Angelis, Costantino; Cerullo, Giulio; Osellame, Roberto; Hecht, Bert; Duò, Lamberto; Ciccacci, Franco; Finazzi, Marco
2015-05-01
Boosting nonlinear frequency conversion in extremely confined volumes remains a challenge in nano-optics research, but can enable applications in nanomedicine, photocatalysis and background-free biosensing. To obtain brighter nonlinear nanoscale sources, approaches that enhance the electromagnetic field intensity and counter the lack of phase matching in nanoplasmonic systems are often employed. However, the high degree of symmetry in the crystalline structure of plasmonic materials (metals in particular) and in nanoantenna designs strongly quenches second harmonic generation. Here, we describe doubly-resonant single-crystalline gold nanostructures with no axial symmetry displaying spatial mode overlap at both the excitation and second harmonic wavelengths. The combination of these features allows the attainment of a nonlinear coefficient for second harmonic generation of ∼5 × 10(-10) W(-1), enabling a second harmonic photon yield higher than 3 × 10(6) photons per second. Theoretical estimations point toward the use of our nonlinear plasmonic nanoantennas as efficient platforms for label-free molecular sensing.
Mode matching in multiresonant plasmonic nanoantennas for enhanced second harmonic generation
Celebrano, Michele; Wu, Xiaofei; Baselli, Milena; Großmann, Swen; Biagioni, Paolo; Locatelli, Andrea; de Angelis, Costantino; Cerullo, Giulio; Osellame, Roberto; Hecht, Bert; Duò, Lamberto; Ciccacci, Franco; Finazzi, Marco
2015-05-01
Boosting nonlinear frequency conversion in extremely confined volumes remains a challenge in nano-optics research, but can enable applications in nanomedicine, photocatalysis and background-free biosensing. To obtain brighter nonlinear nanoscale sources, approaches that enhance the electromagnetic field intensity and counter the lack of phase matching in nanoplasmonic systems are often employed. However, the high degree of symmetry in the crystalline structure of plasmonic materials (metals in particular) and in nanoantenna designs strongly quenches second harmonic generation. Here, we describe doubly-resonant single-crystalline gold nanostructures with no axial symmetry displaying spatial mode overlap at both the excitation and second harmonic wavelengths. The combination of these features allows the attainment of a nonlinear coefficient for second harmonic generation of ˜5 × 10-10 W-1, enabling a second harmonic photon yield higher than 3 × 106 photons per second. Theoretical estimations point toward the use of our nonlinear plasmonic nanoantennas as efficient platforms for label-free molecular sensing.
Energy Technology Data Exchange (ETDEWEB)
Goekcek, Murat [Department of Mechanical Engineering, Faculty of Engineering, Nigde University, Campus, 51100 Nigde (Turkey)
2010-10-15
This study presents a techno-economic evaluation on hydrogen generation from a small-scale wind-powered electrolysis system in different power matching modes. For the analysis, wind speed data, which measured as hourly time series in Kirklareli, Turkey, were used to predict the electrical energy and hydrogen produced by the wind-hydrogen energy system and their variation according to the height of the wind turbine. The system considered in this study is primarily consisted of a 6 kW wind-energy conversion system and a 2 kW PEM electrolyzer. The calculation of energy production was made by means of the levelized cost method by considering two different systems that are the grid-independent system and the grid-integrated system. Annual production of electrical energy and hydrogen was calculated as 15,148.26 kWh/year and 102.37 kg/year, respectively. The highest hydrogen production is obtained in January. The analyses showed that both electrical energy and hydrogen production depend strongly on the hub height of wind turbine in addition to the economic indicators. In the grid-integrated system, the calculated levelized cost of hydrogen changes in the range of 0.3485-4.4849 US$/kg for 36 m hub height related to the specific turbine cost. The grid-integrated system can be considered as profitable when the excess electrical energy delivered by system sold to the grid. (author)
Institute of Scientific and Technical Information of China (English)
罗骥; 张曦林; 袁东风
2005-01-01
提出了一种改进型的Code-Matched交织器,它能减少低重量码的数量,从而提高Turbo码的性能.这种改进型的Code-Matched交织器可以适用于多种不同生成矩阵产生的Turbo码,而且不会影响Turbo码在中高信噪比处的性能.同时,在Rayleigh信道下,这种交织器能降低错误平台.%A novel Code-Matched interleaver is proposed which decreases the number of the low weight codewords to improve the performance of the Turbo code. The modified design can adapt more kinds of Turbo codes determined by the generator matrix, while it doesn't decrease the bit error rate performance of Turbo codes at moderate to high signal to noise ratio. At the same time, in Rayleigh fading channel, the new Code-Matched interleaver can also debase the error floor.
Hellwig, Tim; Epping, Jörn P; Schnack, Martin; Boller, Klaus-J; Fallnich, Carsten
2015-07-27
We demonstrate the potential of birefringence-based, all-optical, ultrafast conversion between the transverse modes in integrated optical waveguides by modelling the conversion process by numerically solving the multi-mode coupled nonlinear Schroedinger equations. The observed conversion is induced by a control beam and due to the Kerr effect, resulting in a transient index grating which coherently scatters probe light from one transverse waveguide mode into another. We introduce birefringent phase matching to enable efficient all-optically induced mode conversion at different wavelengths of the control and probe beam. It is shown that tailoring the waveguide geometry can be exploited to explicitly minimize intermodal group delay as well as to maximize the nonlinear coefficient, under the constraint of a phase matching condition. The waveguide geometries investigated here, allow for mode conversion with over two orders of magnitude reduced control pulse energy compared to previous schemes and thereby promise nonlinear mode switching exceeding efficiencies of 90% at switching energies below 1 nJ.
Minutia Cylinder-Code: a new representation and matching technique for fingerprint recognition.
Cappelli, Raffaele; Ferrara, Matteo; Maltoni, Davide
2010-12-01
In this paper, we introduce the Minutia Cylinder-Code (MCC): a novel representation based on 3D data structures (called cylinders), built from minutiae distances and angles. The cylinders can be created starting from a subset of the mandatory features (minutiae position and direction) defined by standards like ISO/IEC 19794-2 (2005). Thanks to the cylinder invariance, fixed-length, and bit-oriented coding, some simple but very effective metrics can be defined to compute local similarities and to consolidate them into a global score. Extensive experiments over FVC2006 databases prove the superiority of MCC with respect to three well-known techniques and demonstrate the feasibility of obtaining a very effective (and interoperable) fingerprint recognition implementation for light architectures.
Vasserman, Genadiy; Schneidman, Elad; Segev, Ronen
2013-01-01
The visual system continually adjusts its sensitivity to the statistical properties of the environment through an adaptation process that starts in the retina. Colour perception and processing is commonly thought to occur mainly in high visual areas, and indeed most evidence for chromatic colour contrast adaptation comes from cortical studies. We show that colour contrast adaptation starts in the retina where ganglion cells adjust their responses to the spectral properties of the environment. We demonstrate that the ganglion cells match their responses to red-blue stimulus combinations according to the relative contrast of each of the input channels by rotating their functional response properties in colour space. Using measurements of the chromatic statistics of natural environments, we show that the retina balances inputs from the two (red and blue) stimulated colour channels, as would be expected from theoretical optimal behaviour. Our results suggest that colour is encoded in the retina based on the efficient processing of spectral information that matches spectral combinations in natural scenes on the colour processing level. PMID:24205373
Directory of Open Access Journals (Sweden)
Genadiy Vasserman
Full Text Available The visual system continually adjusts its sensitivity to the statistical properties of the environment through an adaptation process that starts in the retina. Colour perception and processing is commonly thought to occur mainly in high visual areas, and indeed most evidence for chromatic colour contrast adaptation comes from cortical studies. We show that colour contrast adaptation starts in the retina where ganglion cells adjust their responses to the spectral properties of the environment. We demonstrate that the ganglion cells match their responses to red-blue stimulus combinations according to the relative contrast of each of the input channels by rotating their functional response properties in colour space. Using measurements of the chromatic statistics of natural environments, we show that the retina balances inputs from the two (red and blue stimulated colour channels, as would be expected from theoretical optimal behaviour. Our results suggest that colour is encoded in the retina based on the efficient processing of spectral information that matches spectral combinations in natural scenes on the colour processing level.
FDNS CFD Code Benchmark for RBCC Ejector Mode Operation: Continuing Toward Dual Rocket Effects
West, Jeff; Ruf, Joseph H.; Turner, James E. (Technical Monitor)
2000-01-01
Computational Fluid Dynamics (CFD) analysis results are compared with benchmark quality test data from the Propulsion Engineering Research Center's (PERC) Rocket Based Combined Cycle (RBCC) experiments to verify fluid dynamic code and application procedures. RBCC engine flowpath development will rely on CFD applications to capture the multi -dimensional fluid dynamic interactions and to quantify their effect on the RBCC system performance. Therefore, the accuracy of these CFD codes must be determined through detailed comparisons with test data. The PERC experiments build upon the well-known 1968 rocket-ejector experiments of Odegaard and Stroup by employing advanced optical and laser based diagnostics to evaluate mixing and secondary combustion. The Finite Difference Navier Stokes (FDNS) code [2] was used to model the fluid dynamics of the PERC RBCC ejector mode configuration. Analyses were performed for the Diffusion and Afterburning (DAB) test conditions at the 200-psia thruster operation point, Results with and without downstream fuel injection are presented.
Zhao, Pengfei; Ni, Ran; Wang, Kexin; Hong, Xia; Ding, Yadan; Cong, Tie; Liu, Junping; Zhao, Huiying
2017-07-01
Silica nanorods were synthesized through a simple one-pot emulsion-droplet-based growth method, in which tetraethylorthosilicate (TEOS) was used as the silica source, ammonia as the catalyst, and polyvinylpyrrolidone (PVP) as the structure-directing agent and stabilizer. By controlling hydrolysis and condensation in the reaction process, we regulated the aspect ratios and the infrared (IR) absorption fingerprint signals (the transverse optical and the longitudinal optical phonon modes) of the silica nanorods. Based on this, a dual-mode immunoassay was performed for detecting model target analyte, human IgG. The shape code of the silica nanorods was used for simple, rapid qualitative, and sensitive semi-quantitative immunoassay by using a conventional optical microscope. The characteristic IR absorption fingerprint signals of the silica nanorods allowed for reliable quantitative immunoassay with good selectivity and high specificity. The detection limit and the linear range were found out to be 0.5 pM and 1 pM-10 nM, respectively. We expect that such dual-mode immunoassay could be applied for the detection of other analytes, such as protein, nucleic acids, bacteria, viruses, explosives, toxins, and so on. Graphical abstract A simple dual-mode immunoassay was performed using the shape code and infrared absorption fingerprint signals of silica nanorods as detection signals.
Xia, Dunzhu; Kong, Lun; Gao, Haiyu
2015-01-01
We present in this paper a novel fully decoupled silicon micromachined tri-axis linear vibratory gyroscope. The proposed gyroscope structure is highly symmetrical and can be limited to an area of about 8.5 mm × 8.5 mm. It can differentially detect three axes' angular velocities at the same time. By elaborately arranging different beams, anchors and sensing frames, the drive and sense modes are fully decoupled from each other. Moreover, the quadrature error correction and frequency tuning functions are taken into consideration in the structure design for all the sense modes. Since there exists an unwanted in-plane rotational mode, theoretical analysis is implemented to eliminate it. To accelerate the mode matching process, the particle swam optimization (PSO) algorithm is adopted and a frequency split of 149 Hz is first achieved by this method. Then, after two steps of manual adjustment of the springs' dimensions, the frequency gap is further decreased to 3 Hz. With the help of the finite element method (FEM) software ANSYS, the natural frequencies of drive, yaw, and pitch/roll modes are found to be 14,017 Hz, 14,018 Hz and 14,020 Hz, respectively. The cross-axis effect and scale factor of each mode are also simulated. All the simulation results are in good accordance with the theoretical analysis, which means the design is effective and worthy of further investigation on the integration of tri-axis accelerometers on the same single chip to form an inertial measurement unit.
Using a local gyrokinetic code to study global ITG modes in tokamaks
Abdoul, P A; Roach, C M; Wilson, H R
2015-01-01
In this paper the global mode structures of linear ion-temperature-gradient (ITG) modes in tokamak plasmas are obtained by combining results from the local gyrokinetic code GS2 with analytical theory. Local gyrokinetic calculations, using GS2, are performed for a range of radial flux surfaces, ${x}$, and ballooning phase angles, ${p}$, to map out the local complex mode frequency, ${\\Omega_{0}(x,p)=\\omega_{0}(x,p)+i\\gamma_{0}(x,p)}$ for a single toroidal mode number, ${n}$. Taylor expanding ${\\Omega_{0}}$ about ${x=0}$, and employing the Fourier-ballooning representation leads to a second order ODE for the amplitude envelope, ${A\\left(p\\right)}$ , which describes how the local results are combined to form the global mode. We employ the so-called CYCLONE base case for circular Miller equilibrium model. Assuming radially varying profiles of ${a/L_{T}}$ and ${a/L_{n}}$, peaked at ${x=0}$, and with all other equilibrium profiles held constant, ${\\Omega_{0}(x,p)}$ is found to have a stationary point. The reconstruc...
Edge-preserving Intra mode for efficient depth map coding based on H.264/AVC
DEFF Research Database (Denmark)
Zamarin, Marco; Forchhammer, Søren
2014-01-01
Depth-image-based-rendering (DIBR) algorithms for 3D video communication systems based on the “multi-view video plus depth” format are very sensitive to the accuracy of depth information. Specifically, edge regions in the depth data should be preserved in the coding/decoding process to ensure good...... targeted to depth macroblocks with arbitrarily shaped edges, which are typically not predicted well by the standard Intra modes of H.264/AVC and result in high rate–distortion costs. The proposed algorithm segments edge macroblocks into two regions each approximated by a flat surface. A binary mask...... texture plus depth rate–distortion performance....
Sajjad, Muhammad; Mehmood, Irfan; Baik, Sung Wook
2015-01-01
Image super-resolution (SR) plays a vital role in medical imaging that allows a more efficient and effective diagnosis process. Usually, diagnosing is difficult and inaccurate from low-resolution (LR) and noisy images. Resolution enhancement through conventional interpolation methods strongly affects the precision of consequent processing steps, such as segmentation and registration. Therefore, we propose an efficient sparse coded image SR reconstruction technique using a trained dictionary. We apply a simple and efficient regularized version of orthogonal matching pursuit (ROMP) to seek the coefficients of sparse representation. ROMP has the transparency and greediness of OMP and the robustness of the L1-minization that enhance the dictionary learning process to capture feature descriptors such as oriented edges and contours from complex images like brain MRIs. The sparse coding part of the K-SVD dictionary training procedure is modified by substituting OMP with ROMP. The dictionary update stage allows simultaneously updating an arbitrary number of atoms and vectors of sparse coefficients. In SR reconstruction, ROMP is used to determine the vector of sparse coefficients for the underlying patch. The recovered representations are then applied to the trained dictionary, and finally, an optimization leads to high-resolution output of high-quality. Experimental results demonstrate that the super-resolution reconstruction quality of the proposed scheme is comparatively better than other state-of-the-art schemes.
Malo, Sergio; Fateri, Sina; Livadas, Makis; Mares, Cristinel; Gan, Tat-Hean
2017-07-01
Ultrasonic guided waves testing is a technique successfully used in many industrial scenarios worldwide. For many complex applications, the dispersive nature and multimode behavior of the technique still poses a challenge for correct defect detection capabilities. In order to improve the performance of the guided waves, a 2-D compressed pulse analysis is presented in this paper. This novel technique combines the use of pulse compression and dispersion compensation in order to improve the signal-to-noise ratio (SNR) and temporal-spatial resolution of the signals. The ability of the technique to discriminate different wave modes is also highlighted. In addition, an iterative algorithm is developed to identify the wave modes of interest using adaptive peak detection to enable automatic wave mode discrimination. The employed algorithm is developed in order to pave the way for further in situ applications. The performance of Barker-coded and chirp waveforms is studied in a multimodal scenario where longitudinal and flexural wave packets are superposed. The technique is tested in both synthetic and experimental conditions. The enhancements in SNR and temporal resolution are quantified as well as their ability to accurately calculate the propagation distance for different wave modes.
Muscular contraction mode differently affects autonomic control during heart rate matched exercise.
Weippert, Matthias; Behrens, Martin; Gonschorek, Ray; Bruhn, Sven; Behrens, Kristin
2015-01-01
The precise contributions of afferent feedback to cardiovascular and respiratory responses to exercise are still unclear. The aim of this crossover study was to assess whether and how autonomic cardiovascular and respiratory control differed in response to dynamic (DYN) and isometric contractions (ISO) at a similar, low heart rate (HR) level. Therefore, 22 healthy males (26.7 ± 3.6 yrs) performed two kinds of voluntary exercises at similar HR: ISO and DYN of the right quadriceps femoris muscle. Although HR was eqivalent (82 ± 8 bpm for DYN and ISO, respectively), rating of exertion, blood pressures, and rate pressure product were higher, whereas breathing frequency, minute ventilation, oxygen uptake and carbon dioxide output were significantly lower during ISO. Tidal volume, end-tidal partial pressures of O2 and CO2, respiratory exchange ratio and capillary blood lactate concentration were comparable between both contraction modes. Heart rate variability (HRV) indicators, SDNN, HF-Power and LF-Power, representing both vagal and sympathetic influences, were significantly higher during ISO. Sample entropy, a non-linear measure of HRV was also significantly affected by contraction mode. It can be concluded that, despite the same net effect on HR, the quality of cardiovascular control during low intensity exercise is significantly different between DYN and ISO. HRV analysis indicated a sympatho-vagal coactivation during ISO. Whether mechanoreceptor feedback alone, a change in central command, or the interaction of both mechanisms is the main contributor of the distinct autonomic responses to the different exercise modes remains to be elucidated.
Muscular Contraction Mode Differently Affects Autonomic Control During Heart Rate Matched Exercise
Directory of Open Access Journals (Sweden)
Matthias eWeippert
2015-05-01
Full Text Available The precise contributions of afferent feedback to cardiovascular and respiratory responses to exercise are still unclear. Aim of this crossover study was to assess whether and how autonomic cardiovascular and respiratory control differed in response to dynamic (DYN and isometric contractions (ISO at a similar, low heart rate (HR level. Therefore, 22 healthy males (26.7 ± 3.6 yrs performed two kinds of voluntary exercises at similar HR: ISO and DYN of the right quadriceps femoris muscle. Although HR was eqivalent (82 ± 8 bpm for DYN and ISO, respectively, rating of exertion, blood pressures, and rate pressure product were higher, whereas breathing frequency, minute ventilation, oxygen uptake and carbon dioxide output were significantly lower during ISO. Tidal volume, end-tidal partial pressures of O2 and CO2, respiratory exchange ratio and capillary blood lactate concentration were comparable between both contraction modes. Heart rate variability (HRV indicators, SDNN, HF-Power and LF-Power, representing both vagal and sympathetic influences, were significantly higher during ISO. Sample entropy, a nonlinear measure of HRV was also significantly affected by contraction mode. It can be concluded that, despite the same net effect on HR, the quality of cardiovascular control during low intensity exercise is significantly different between DYN and ISO. HRV analysis indicated a sympatho-vagal coactivation during ISO. Whether mechanoreceptor feedback alone, a change in central command, or the interaction of both mechanisms is the main contributor of the distinct autonomic responses to the different exercise modes remains to be elucidated.
Wang, Yajun; Yang, Wenhai; Li, Zhixiu; Zheng, Yaohui
2017-02-01
Non-classical squeezed states of light at a compatible atomic wavelength have a potential application in quantum information protocols for quantum states delaying or storaging. An optical parametric oscillator (OPO) with periodically poled potassium titanyl phosphate (PPKTP) is the most effective method for generating this squeezed state. However, it is a challege for the nonlinear interaction in PPKTP crystal at the D1 line of rubidium atomic, due to a strong blue-light-induced infrared absorption (BLIIRA). In this paper, we report an indirect measurement method for the BLIIRA through measuring the mode-matching efficiency in an optical parametric oscillator. In contrast to previous works, our method is not limited by the absolute power variation induced from the change of frequency conversion loss and the impedance matching originated from the change of absorption loss. Therefore, the measurement process is performed at the phase-matching condition. The measured results show that BLIIRA coefficient is quadratic dependence of blue light intensity below 1 kW per square centimeter in our PPKTP device, which will provide important basis for optimizing squeezed state generation at 795 nm.
Togura, Kenji; Kubota, Koji; Nakase, Hiroyuki; Masu, Kazuya; Tsubouchi, Kazuo
2000-04-01
We have proposed the current-cut switched-current matched filter (CC-SIMF) with a low power consumption of less than 10 mW for mobile terminals in direct-sequence code-division-multiple-access. The parallel SIMF configuration is proposed for the reduction of the current transfer error accumulation in the conventional serial SIMF@. In order to evaluate the fundamental operation of the parallel SIMF, we have designed and fabricated a 32-chip parallel SIMF using 0.8-μm complementary-metal-oxide-semiconductor (CMOS) technology. The autocorrelation performance of a 32-chip orthogonal m-sequence has been clearly observed to be more than 5 Mcps. The measured dynamic range is improved to 12 dB as compared with that of the conventional SIMF, even though each current memory cell has a current transfer error of over 10% per chip. Since the current sources in the parallel SIMF can be reduced to be one-third of those in the serial SIMF, the power consumption of the parallel SIMF can be reduced to one-third of that of the serial SIMF.
Obstetric mode of delivery and attention-deficit/hyperactivity disorder: a sibling-matched study.
Curran, Eileen A; Khashan, Ali S; Dalman, Christina; Kenny, Louise C; Cryan, John F; Dinan, Timothy G; Kearney, Patricia M
2016-04-01
It has been suggested that birth by caesarean section (CS) may affect psychological development through changes in microbiota or stress response. We assessed the impact of mode of delivery, specifically CS, on the development of attention-deficit/hyperactivity disorder (ADHD), using a large, population-based cohort. The study cohort consisted of all singleton live births in Sweden from 1990 to 2008 using data from Swedish national registers. Mode of delivery included: unassisted vaginal delivery(VD), assisted VD, elective CS or emergency CS. ADHD was determined using International Classification of Diseases version 10 (F90 or F98.8), or prescription for ADHD medication. We used Cox regression to assess the association between birth by CS and ADHD in the total study population, adjusting for perinatal and sociodemographic factors, then stratified Cox regression analysis on maternal identification number to assess the association among siblings. Our cohort consisted of 1 722 548 children, and among these 47 778 cases of ADHD. The hazard ratio (HR) of the association between elective CS, compared with unassisted VD, and ADHD was 1.15 [95% confidence interval (CI): 1.11-1.20] in the cohort, and 1.05 (95% CI: 0.93-1.18) in the stratified analysis. The HR of the association between emergency CS and ADHD was 1.16 (95% CI: 1.12-1.20])in the cohort and 1.13 (95% CI: 1.01-1.26) in the stratified analysis. Birth by CS is associated with a small increased risk of ADHD. However among siblings the association only remained for emergency CS. If this were a causal effect by CS, the association would be expected to persist for both types of CS, suggesting the observed association is due to confounding. © The Author 2016; all rights reserved. Published by Oxford University Press on behalf of the International Epidemiological Association.
On parsing the neural code in the prefrontal cortex of primates using principal dynamic modes.
Marmarelis, V Z; Shin, D C; Song, D; Hampson, R E; Deadwyler, S A; Berger, T W
2014-06-01
Nonlinear modeling of multi-input multi-output (MIMO) neuronal systems using Principal Dynamic Modes (PDMs) provides a novel method for analyzing the functional connectivity between neuronal groups. This paper presents the PDM-based modeling methodology and initial results from actual multi-unit recordings in the prefrontal cortex of non-human primates. We used the PDMs to analyze the dynamic transformations of spike train activity from Layer 2 (input) to Layer 5 (output) of the prefrontal cortex in primates performing a Delayed-Match-to-Sample task. The PDM-based models reduce the complexity of representing large-scale neural MIMO systems that involve large numbers of neurons, and also offer the prospect of improved biological/physiological interpretation of the obtained models. PDM analysis of neuronal connectivity in this system revealed "input-output channels of communication" corresponding to specific bands of neural rhythms that quantify the relative importance of these frequency-specific PDMs across a variety of different tasks. We found that behavioral performance during the Delayed-Match-to-Sample task (correct vs. incorrect outcome) was associated with differential activation of frequency-specific PDMs in the prefrontal cortex.
A critical interpersonal distance switches between two coordination modes in kendo matches.
Okumura, Motoki; Kijima, Akifumi; Kadota, Koji; Yokoyama, Keiko; Suzuki, Hiroo; Yamamoto, Yuji
2012-01-01
In many competitive sports, players need to quickly and continuously execute movements that co-adapt to various movements executed by their opponents and physical objects. In a martial art such as kendo, players must be able to skillfully change interpersonal distance in order to win. However, very little information about the task and expertise properties of the maneuvers affecting interpersonal distance is available. This study investigated behavioral dynamics underlying opponent tasks by analyzing changes in interpersonal distance made by expert players in kendo matches. Analysis of preferred interpersonal distances indicated that players tended to step toward and away from their opponents based on two distances. The most preferred distance enabled the players to execute both striking and defensive movements immediately. The relative phase analysis of the velocities at which players executed steps toward and away revealed that players developed anti-phase synchronizations at near distances to maintain safe distances from their opponents. Alternatively, players shifted to in-phase synchronization to approach their opponents from far distances. This abrupt phase-transition phenomenon constitutes a characteristic bifurcation dynamics that regularly and instantaneously occurs between in- and anti-phase synchronizations at a critical interpersonal distance. These dynamics are profoundly affected by the task constraints of kendo and the physical constraints of the players. Thus, the current study identifies the clear behavioral dynamics that emerge in a sport setting.
A critical interpersonal distance switches between two coordination modes in kendo matches.
Directory of Open Access Journals (Sweden)
Motoki Okumura
Full Text Available In many competitive sports, players need to quickly and continuously execute movements that co-adapt to various movements executed by their opponents and physical objects. In a martial art such as kendo, players must be able to skillfully change interpersonal distance in order to win. However, very little information about the task and expertise properties of the maneuvers affecting interpersonal distance is available. This study investigated behavioral dynamics underlying opponent tasks by analyzing changes in interpersonal distance made by expert players in kendo matches. Analysis of preferred interpersonal distances indicated that players tended to step toward and away from their opponents based on two distances. The most preferred distance enabled the players to execute both striking and defensive movements immediately. The relative phase analysis of the velocities at which players executed steps toward and away revealed that players developed anti-phase synchronizations at near distances to maintain safe distances from their opponents. Alternatively, players shifted to in-phase synchronization to approach their opponents from far distances. This abrupt phase-transition phenomenon constitutes a characteristic bifurcation dynamics that regularly and instantaneously occurs between in- and anti-phase synchronizations at a critical interpersonal distance. These dynamics are profoundly affected by the task constraints of kendo and the physical constraints of the players. Thus, the current study identifies the clear behavioral dynamics that emerge in a sport setting.
Cascade trailing-edge noise modeling using a mode-matching technique and the edge-dipole theory
Roger, Michel; François, Benjamin; Moreau, Stéphane
2016-11-01
An original analytical approach is proposed to model the broadband trailing-edge noise produced by high-solidity outlet guide vanes in an axial turbomachine. The model is formulated in the frequency domain and first in two dimensions for a preliminary assessment of the method. In a first step the trailing-edge noise sources of a single vane are shown to be equivalent to the onset of a so-called edge dipole, the direct field of which is expanded in a series of plane-wave modes. A criterion for the distance of the dipole to the trailing-edge and a scaling of its amplitude is defined to yield a robust model. In a second step the diffraction of each plane-wave mode is derived considering the cascade as an array of bifurcated waveguides and using a mode-matching technique. The cascade response is finally synthesized by summing the diffracted fields of all cut-on modes to yield upstream and downstream sound power spectral densities. The obtained spectral shapes are physically consistent and the present results show that upstream radiation is typically 3 dB higher than downstream radiation, which has been experimentally observed previously. Even though the trailing-edge noise sources are not vane-to-vane correlated their radiation is strongly determined by a cascade effect that consequently must be accounted for. The interest of the approach is that it can be extended to a three-dimensional annular configuration without resorting to a strip theory approach. As such it is a promising and versatile alternative to previously published methods.
Performance Analysis of Video Frame Transmission on DVB-H 4K Mode System for different code rates
Directory of Open Access Journals (Sweden)
Mitul Prajapati
2012-03-01
Full Text Available DVB-H (Digital Video Broadcasting for Handheld terminals is a digital transmission standard developed by the international DVB-Project. It was standardized in 2004 and enables small battery powered handheld devices to receive IP data services such as low definition TV services. The DVB-H standard is derived from the DVB-T standard which is used to broadcast TV services in Europe. The convolution code is used as error correction code. In this paper, we have implemented physical layer of DVB-H for 4K mode system. Here we had transmitted a JPEG format of frame of movie through AWGN channel and observed the image quality for different code rates used for convolution coding. The code rates used are 1/2, 2/3, 3/4, 5/6 and 7/8.
Profiling of fine- and coarse-mode particles with LIRIC (LIdar/Radiometer Inversion Code
Directory of Open Access Journals (Sweden)
M. R. Perrone
2014-08-01
Full Text Available The paper investigates numerical procedures that allow determining the dependence on altitude of aerosol properties from multi wavelength elastic lidar signals. In particular, the potential of the LIdar/Radiometer Inversion Code (LIRIC to retrieve the vertical profiles of fine and coarse-mode particles by combining 3-wavelength lidar measurements and collocated AERONET (AErosol RObotic NETwork sun/sky photometer measurements is investigated. The used lidar signals are at 355, 532 and 1064 nm. Aerosol extinction coefficient (αL, lidar ratio (LRL, and Ångstrom exponent (ÅL profiles from LIRIC are compared with the corresponding profiles (α, LR, and Å retrieved from a Constrained Iterative Inversion (CII procedure to investigate the LIRIC retrieval ability. Then, an aerosol classification framework which relies on the use of a graphical framework and on the combined analysis of the Ångstrom exponent (at the 355 and 1064 nm wavelength pair, Å(355, 1064 and its spectral curvature (ΔÅ = Å(355, 532–Å(532, 1064 is used to investigate the ability of LIRIC to retrieve vertical profiles of fine and coarse-mode particles. The Å-ΔÅ aerosol classification framework allows estimating the dependence on altitude of the aerosol fine modal radius and of the fine mode contribution to the whole aerosol optical thickness, as discussed in Perrone et al. (2014. The application of LIRIC to three different aerosol scenarios dealing with aerosol properties dependent on altitude has revealed that the differences between αL and α vary with the altitude and on average increase with the decrease of the lidar signal wavelength. It has also been found that the differences between ÅL and corresponding Å values vary with the altitude and the wavelength pair. The sensitivity of Ångstrom exponents to the aerosol size distribution which vary with the wavelength pair was responsible for these last results. The aerosol classification framework has revealed that
Institute of Scientific and Technical Information of China (English)
LEE Tien-hsu; WANG Jong-tzy; CHEN Jhih-bin; CHANG Pao-chi
2006-01-01
Although H.264 video coding standard provides several error resilience tools, the damage caused by error propagation may still be tremendous. This work is aimed at developing a robust and standard-compliant error resilient coding scheme for H.264and uses techniques of mode decision, data hiding, and error concealment to reduce the damage from error propagation. This paper proposes a system with two error resilience techniques that can improve the robustness of H.264 in noisy channels. The first technique is Nearest Neighbor motion compensated Error Concealment (NNEC) that chooses the nearest neighbors in the reference frames for error concealment. The second technique is Distortion Estimated Mode Decision (DEMD) that selects an optimal mode based on stochastically distorted frames. Observed simulation results showed that the rate-distortion performances of the proposed algorithms are better than those of the compared algorithms.
基于相关匹配的QR码识别方法%QR code recognition method based on correlation match
Institute of Scientific and Technical Information of China (English)
熊用; 汪鲁才; 艾琼龙
2011-01-01
QR码图像识别是QR码应用中的关键技术.Hough变换、曲面拟合去背景、控制点变换等方法为QR码识别过程中图像预处理的基本方法,针对图像预处理后图像识别率低的缺点,提出了一种基于相关匹配法的QR码识别方法.基于曲面拟合的改进自适应阈值法分割图像.采用Hough变换和控制点变换方法校正图像的几何失真变形.利用模板对QR码进行相关匹配,对相干系数阈值处理得出取样网格.实验表明,本文算法能有效提高QR码识别效率和效果.%QR code recognition is the key technology in QR code application. Hough transformation, surface-fitting background removing and control point transformation are the essential methods of image preprocessing in QR code recognition. An improved QR code recognition method based on correlation match is proposed in this paper, which improves the low efficiency of the image recognition after image preprocessing. An improved adaptive threshold value method based on surface fitting is used to segment the QR code image. Hough transform and control point transformation methods are used to correct the geometric distortion deformation of the image. A template is used to carry out the match of the QR code image; and the coherent coefficient image is obtained easily. Then, a selected coherent coefficient threshold is processed and the sample grid image is obtained. Simulated results prove that the proposed method can greatly improve the QR code recognition efficiency and effect.
Elter, Zs.; Jammes, C.; Pázsit, I.; Pál, L.; Filliatre, P.
2015-02-01
The detectors of the neutron flux monitoring system of the foreseen French GEN-IV sodium-cooled fast reactor (SFR) will be high temperature fission chambers placed in the reactor vessel in the vicinity of the core. The operation of a fission chamber over a wide-range neutron flux will be feasible provided that the overlap of the applicability of its pulse and Campbelling operational modes is ensured. This paper addresses the question of the linearity of these two modes and it also presents our recent efforts to develop a specific code for the simulation of fission chamber pulse trains. Our developed simulation code is described and its overall verification is shown. An extensive quantitative investigation was performed to explore the applicability limits of these two standard modes. It was found that for short pulses the overlap between the pulse and Campbelling modes can be guaranteed if the standard deviation of the background noise is not higher than 5% of the pulse amplitude. It was also shown that the Campbelling mode is sensitive to parasitic noise, while the performance of the pulse mode is affected by the stochastic amplitude distributions.
Ding, Cong; Sang, Xinzhu; Zhao, Tianqi; Yan, Binbin; Leng, Junmin; Yuan, Jinhui; Zhang, Ying
2012-11-01
Multiview video coding (MVC) is essential for applications of the auto-stereoscopic three-dimensional displays. However, the computational complexity of MVC encoders is tremendously huge. Fast algorithms are very desirable for the practical applications of MVC. Based on joint early termination , the selection of inter-view prediction and the optimization of the process of Inter8×8 modes by comparison, a fast macroblock(MB) mode selection algorithm is presented. Comparing with the full mode decision in MVC, the experimental results show that the proposed algorithm can reduce up to 78.13% on average and maximum 90.21% encoding time with a little increase in bit rates and loss in PSNR.
P-Code-Enhanced Encryption-Mode Processing of GPS Signals
Young, Lawrence; Meehan, Thomas; Thomas, Jess B.
2003-01-01
A method of processing signals in a Global Positioning System (GPS) receiver has been invented to enable the receiver to recover some of the information that is otherwise lost when GPS signals are encrypted at the transmitters. The need for this method arises because, at the option of the military, precision GPS code (P-code) is sometimes encrypted by a secret binary code, denoted the A code. Authorized users can recover the full signal with knowledge of the A-code. However, even in the absence of knowledge of the A-code, one can track the encrypted signal by use of an estimate of the A-code. The present invention is a method of making and using such an estimate. In comparison with prior such methods, this method makes it possible to recover more of the lost information and obtain greater accuracy.
Institute of Scientific and Technical Information of China (English)
LI Yan-Ping; YU Jin-Zhong; XIA Jin-Song; Chen Shao-Wu
2004-01-01
@@ Imaginary-distance beam propagation method under the perfectly matched layer boundary condition is applied to judge single-mode behaviour of optical waveguides, for the first time to our knowledge. A new kind of siliconon-insulator-based rib structures with half-circle cross-section is presented. The single-mode behaviour of this kind of waveguide with radius 2μm is investigated by this method. It is single-mode when the slab height is not smaller than the radius.
Adaptive mode decision with residual motion compensation for distributed video coding
DEFF Research Database (Denmark)
Luong, Huynh Van; Forchhammer, Søren; Slowack, Jurgen
2013-01-01
mode in DVC. The adaptive mode decision is not only based on quality of key frames but also the rate of Wyner-Ziv (WZ) frames. To improve noise distribution estimation for a more accurate mode decision, a residual motion compensation is proposed to estimate a current noise residue based on a previously...
Wan, X.; Tse, P. W.; Xu, G. H.; Tao, T. F.; Zhang, Q.
2016-04-01
Most previous studies on nonlinear Lamb waves are conducted using mode pairs that satisfying strict phase velocity matching and non-zero power flux criteria. However, there are some limitations in existence. First, strict phase velocity matching is not existed in the whole frequency bandwidth; Second, excited center frequency is not always exactly equal to the true phase-velocity-matching frequency; Third, mode pairs are isolated and quite limited in number; Fourth, exciting a single desired primary mode is extremely difficult in practice and the received signal is quite difficult to process and interpret. And few attention has been paid to solving these shortcomings. In this paper, nonlinear S0 mode Lamb waves at low-frequency range satisfying approximate phase velocity matching is proposed for the purpose of overcoming these limitations. In analytical studies, the secondary amplitudes with the propagation distance considering the fundamental frequency, the maximum cumulative propagation distance (MCPD) with the fundamental frequency and the maximum linear cumulative propagation distance (MLCPD) using linear regression analysis are investigated. Based on analytical results, approximate phase velocity matching is quantitatively characterized as the relative phase velocity deviation less than a threshold value of 1%. Numerical studies are also conducted using tone burst as the excitation signal. The influences of center frequency and frequency bandwidth on the secondary amplitudes and MCPD are investigated. S1-S2 mode with the fundamental frequency at 1.8 MHz, the primary S0 mode at the center frequencies of 100 and 200 kHz are used respectively to calculate the ratios of nonlinear parameter of Al 6061-T6 to Al 7075-T651. The close agreement of the computed ratios to the actual value verifies the effectiveness of nonlinear S0 mode Lamb waves satisfying approximate phase velocity matching for characterizing the material nonlinearity. Moreover, the ratios derived from
Directory of Open Access Journals (Sweden)
Robert D Hyldahl
2014-12-01
Full Text Available Optimal repair and adaptation of skeletal muscle is facilitated by resident stem cells (satellite cells. To understand how different exercise modes influence satellite cell dynamics, we measured satellite cell activity in conjunction with markers of muscle damage and inflammation in human skeletal muscle following a single work- and intensity-matched bout of eccentric (ECC or concentric contractions (CON. Participants completed a single bout of ECC (n=7 or CON (n=7 of the knee extensors. A muscle biopsy was obtained before and 24 h after exercise. Functional measures and immunohistochemical analyses were used to determine the extent of muscle damage and indices of satellite cell activity. Cytokine concentrations were measured using a multiplexed magnetic bead assay. Isokinetic peak torque decreased following ECC (p<0.05 but not CON. Greater histological staining of the damage marker Xin was observed in muscle samples of ECC vs CON. Tenasin C immunoreactivity increased 15 fold (P<0.01 following ECC and was unchanged following CON. The inflammatory cytokines interferon gamma-induced protein 10 (IP-10 and monocyte chemotactic protein 1 (MCP-1 increased pre- to post-ECC (4.26 ± 1.4 vs. 10.49 ± 5.8 pg/ml, and 3.06 ± 0.7 vs. 6.25 ± 4.6 pg/ml, respectively; p<0.05. There was no change in any cytokine post-CON. Satellite cell content increased 27% pre- to post-ECC (0.10 ± 0.031 vs. 0.127 ± 0.041, respectively; p<0.05. There was no change in satellite cell number in CON (0.099 ± 0.027 vs. 0.102 ± 0.029, respectively. There was no fiber type-specific satellite cell response following either exercise mode. ECC but not CON resulted in an increase in MyoD positive nuclei per myofiber pre- to post-exercise (p<0.05, but there was no change in MyoD DNA binding activity in either condition. In conclusion, ECC but not CON results in functional and histological evidence of muscle damage that is accompanied by increased satellite cell activity 24 h post-exercise.
Fogaccia, G.; Vlad, G.; Briguglio, S.
2016-11-01
Resonant interaction between energetic particles (EPs), produced by fusion reactions and/or additional heating systems, and shear Alfvén modes can destabilize global Alfvénic modes enhancing the EP transport. In order to investigate the EP transport in present and next generation fusion devices, numerical simulations are recognized as a very important tool. Among the various numerical models, the hybrid MHD gyrokinetic one has shown to be a valid compromise between a sufficiently accurate wave-particle interaction description and affordable computational resource requirements. This paper presents a linear benchmark between the hybrid codes HYMAGYC and HMGC. The HYMAGYC code solves the full, linear MHD equations in general curvilinear geometry for the bulk plasma and describes the EP population by the nonlinear gyrokinetic Vlasov equation. On the other side, HMGC solves the nonlinear, reduced O≤ft(ε 03\\right) , pressureless MHD equations ({ε0} being the inverse aspect ratio) for the bulk plasma and the drift kinetic Vlasov equation for the EPs. The results of the HYMAGYC and HMGC codes have been compared both in the MHD limit and in a wide range of the EP parameter space for two test cases (one of which being the so-called TAE n = 6 ITPA Energetic Particle Group test case), both characterized by {ε0}\\ll 1 . In the first test case (test case A), good qualitative agreement is found w.r.t. real frequencies, growth rates and spatial structures of the most unstable modes, with some quantitative differences for the growth rates. For the so-called ITPA test case (test case B), at the nominal energetic particle density value, the disagreement between the two codes is, on the contrary, also qualitative, as a different mode is found as the most unstable one.
Adaptive Zero-Coefficient Distribution Scan for Inter Block Mode Coding of H.264/AVC
Wang, Jing-Xin; Su, Alvin W. Y.
Scanning quantized transform coefficients is an important tool for video coding. For example, the MPEG-4 video coder adopts three different scans to get better coding efficiency. This paper proposes an adaptive zero-coefficient distribution scan in inter block coding. The proposed method attempts to improve H.264/AVC zero coefficient coding by modifying the scan operation. Since the zero-coefficient distribution is changed by the proposed scan method, new VLC tables for syntax elements used in context-adaptive variable length coding (CAVLC) are also provided. The savings in bit-rate range from 2.2% to 5.1% in the high bit-rate cases, depending on different test sequences.
Voss, Clifford I.; Simmons, Craig T.; Robinson, Neville I.
2010-01-01
This benchmark for three-dimensional (3D) numerical simulators of variable-density groundwater flow and solute or energy transport consists of matching simulation results with the semi-analytical solution for the transition from one steady-state convective mode to another in a porous box. Previous experimental and analytical studies of natural convective flow in an inclined porous layer have shown that there are a variety of convective modes possible depending on system parameters, geometry and inclination. In particular, there is a well-defined transition from the helicoidal mode consisting of downslope longitudinal rolls superimposed upon an upslope unicellular roll to a mode consisting of purely an upslope unicellular roll. Three-dimensional benchmarks for variable-density simulators are currently (2009) lacking and comparison of simulation results with this transition locus provides an unambiguous means to test the ability of such simulators to represent steady-state unstable 3D variable-density physics.
QR code sampling method based on adaptive match%基于自适应匹配的QR码取样方法
Institute of Scientific and Technical Information of China (English)
宋贤媛; 张多英
2015-01-01
The QR code acquired by camera always comes with some distortion, so it needs to be recognised to the standard QR code before decode. Aimming at the QR coderecognition, distortion and correction is analyzed and studied in this paper. Some inevitable distortion still existed based on the tilt correction and geometric correction;the traditional method can’t sample the QR code accurately. According to the problem, this paper proposes the adaptive match method, acquire the effective sampling region of QRcode by the matching rate of two adjacent pixel row(column). Experiment shows that the method is real-time with good stability, it can sampling the QR code fast and accurately.%通常由相机获取的QR码图像都带有一些失真，所以在译码前需要对获取的QR码图像进行识别以得到标准规格的QR码。针对QR码识别中的失真和校正进行了分析研究，解决了某些QR码经过倾斜校正和几何校正后仍存在一些无法避免的失真而无法被传统方法准确取样的问题，提出了一种自适应匹配取样法，根据相邻行（列）像素的匹配度准确获取QR码的模块有效取样区域。实验证明该方法稳定性好，能够快速准确地对QR码进行取样。
Anil Kumar Sharma; Dipankar Pal
2010-01-01
In this paper the current mode approach called “Current Conveyor (CCII+)” has been incorporated to design and simulate the circuit for producing two amplitude matched anti-phase sine waveforms which are frequently used in various communication and instrumentation systems. PSpice simulation has been used to depict the output waveforms. The power supply used is ±2.5 V which can be easily incorporated with CMOS IC technology. The designed circuit has been simulated at variousfrequency ranges and...
Munzarova, Helena; Plomerova, Jaroslava; Kissling, Edi
2015-04-01
necessary step before AniTomo is applied to real datasets. We examine various aspects coming along with anisotropic tomography such as setting a starting anisotropic model and parameters controlling the inversion, and particularly influence of a ray coverage on resolvability of individual anisotropic parameters. Synthetic testing also allows investigation of the well-known trade-off between effects of P-wave anisotropy and isotropic heterogeneities. Therefore, the target synthetic models are designed to represent schematically different heterogeneous anisotropic structures of the upper mantle. Testing inversion mode of the AniTomo code, considering an azimuthally quasi-equal distribution of rays and teleseismic P-wave incidences, shows that a separation of seismic anisotropy and isotropic velocity heterogeneities is plausible and that the correct orientation of the symmetry axes in a model can be found within three iterations for well-tuned damping factors.
Clinical use and evaluation of coded excitation in B-mode images
DEFF Research Database (Denmark)
Misaridis, Athanasios; Pedersen, M. H.; Jensen, Jørgen Arendt
2000-01-01
on a predistorted FM excitation and a mismatched compression filter designed for medical ultrasonic applications. The attenuation effect, analyzed in this paper using the ambiguity function and simulations, dictated the choice of the coded waveform. In this study clinical images, images of wire phantoms...... was programmed to allow alternating excitation on every second frame. That offers the possibility of direct comparison of the same set of image pairs; one with pulsed and one with encoded excitation. Abdominal clinical images from healthy volunteers were acquired and statistically analyzed by means of the auto......Use of long encoded waveforms can be advantageous in ultrasound imaging, as long as the pulse compression mechanism ensures low range sidelobes and preserves both axial resolution and contrast. A coded excitation/compression scheme was previously presented by our group, which is based...
Study of ITG modes in RFX-mod using TRB code
Sattin, F; Guo, S C
2010-01-01
We present here a study about the stability of Ion-Temperature-Gradient drift turbulence in the Quasi-Single-Helicity regime of RFX-mod Reversed Field Pinch (RFP) using the TRB fluid electrostatic turbulence code. Our results suggest that present-days RFP plasmas are marginally stable against this kind of turbulence. The onset of the instability may be envisaged for close future regimes, in the presence of hotter plasmas with sharper internal transport barriers.
Directory of Open Access Journals (Sweden)
Szathmáry Eörs
2009-01-01
Full Text Available Abstract Background The genetic code is brought into action by 20 aminoacyl-tRNA synthetases. These enzymes are evenly divided into two classes (I and II that recognize tRNAs from the minor and major groove sides of the acceptor stem, respectively. We have reported recently that: (1 ribozymic precursors of the synthetases seem to have used the same two sterically mirror modes of tRNA recognition, (2 having these two modes might have helped in preventing erroneous aminoacylation of ancestral tRNAs with complementary anticodons, yet (3 the risk of confusion for the presumably earliest pairs of complementarily encoded amino acids had little to do with anticodons. Accordingly, in this communication we focus on the acceptor stem. Results Our main result is the emergence of a palindrome structure for the acceptor stem's common ancestor, reconstructed from the phylogenetic trees of Bacteria, Archaea and Eukarya. In parallel, for pairs of ancestral tRNAs with complementary anticodons, we present updated evidence of concerted complementarity of the second bases in the acceptor stems. These two results suggest that the first pairs of "complementary" amino acids that were engaged in primordial coding, such as Gly and Ala, could have avoided erroneous aminoacylation if and only if the acceptor stems of their adaptors were recognized from the same, major groove, side. The class II protein synthetases then inherited this "primary preference" from isofunctional ribozymes. Conclusion Taken together, our results support the hypothesis that the genetic code per se (the one associated with the anticodons and the operational code of aminoacylation (associated with the acceptor diverged from a common ancestor that probably began developing before translation. The primordial advantage of linking some amino acids (most likely glycine and alanine to the ancestral acceptor stem may have been selective retention in a protocell surrounded by a leaky membrane for use in
Directory of Open Access Journals (Sweden)
Qin Jiang
2010-01-01
Full Text Available Mismatch problem has been one of important issues of matched field processing for underwater source detection. Experimental use of MFP has shown that robust range and depth localization is difficult to achieve. In many cases this is due to uncertainty in the environmental inputs required by acoustic propagation models. The paper presents that EMD (Empirical mode decomposition processing underwater acoustic signals is motivated because it is well suited for removing specific unwanted signal components that may vary spectrally. And the Karhunen-Loève expansion is applied on sample covariance matrix to gain a relatively uncorrupted signal. The EMD denoising scheme is combined with Karhunen-Loève expansion to improve underwater target localization performance of matched field processing (MFP. The robustness and effectiveness of the proposed method is tested by the benchmark cases numerical simulation when there had large environmental parameter uncertainties of the acoustic waveguide.
Directory of Open Access Journals (Sweden)
Delva Rizal
2016-10-01
Full Text Available Studio foto Aura photography merupakan suatu usaha yang bergerak di berbagai bidang seperti studio foto, fotocopy dan warnet. Studio ini memiliki satu komputer server dan delapan komputer client (warnet, dimana komputer server digunakan untuk menyimpan berbagai file penting, khususnya file gambar berekstensi .jpg dan .jpeg. Namun penggunaan komputer server tidak hanya karyawan saja, sehingga dalam pengaksesan data penting yang disimpan mudah diakses oleh orang lain yang tidak memiliki hak atas data tersebut. Oleh karena itu, untuk mengamankan file tersebut dibutuhkan pemanfaatan kriptografi dengan mengkombinasikan algoritma Elgamal dan mode operasi ECB dalam melakukan enkripsi dan dekripsi. Penelitian ini memilih kedua algoritma tersebut karena Elgamal merupakan algoritma asimetris serta menitik beratkan kekuatan kuncinya pada pemecahan masalah logaritma diskrit sedangkan ECB adalah mode operasi yang digunakan dengan kemampuan dekripsi dan enkripsi yang tepat. Sehingga dalam menggunakan kedua algoritma ini dapat memperkuat pengamanan file gambar dan menyulitkan kriptanalis dalam memecahkan file yang terenkripsi. Namun untuk file gambar yang sudah diserang seperti penambahan Brightness atau contrass, noise, blurring dan cropping tidak dapat di dekripsi karena intesitas nilai piksel pada chipertext berubah. Hasil pengujian dari gambar sebelum enkripsi dan sesudah enkripsi dekripsi yaitu MSE 0 dan PSNR inf. Kata kunci: Kriptografi, Elgamal, ECB, File Gambar.
Directory of Open Access Journals (Sweden)
Anil Kumar Sharma,
2010-08-01
Full Text Available In this paper the current mode approach called “Current Conveyor (CCII+” has been incorporated to design and simulate the circuit for producing two amplitude matched anti-phase sine waveforms which are frequently used in various communication and instrumentation systems. PSpice simulation has been used to depict the output waveforms. The power supply used is ±2.5 V which can be easily incorporated with CMOS IC technology. The designed circuit has been simulated at variousfrequency ranges and the waveforms are obtained after the circuit is optimized.
Beyer, Paul; Breuer, Tobias; Ndiaye, Saliou; Zykov, Anton; Viertel, Andreas; Gensler, Manuel; Rabe, Jürgen P; Hecht, Stefan; Witte, Gregor; Kowarik, Stefan
2014-12-10
The microstructure, morphology, and growth dynamics of hexa-peri-hexabenzocoronene (HBC, C42H18) thin films deposited on inert substrates of similar surface energies are studied with particular emphasis on the influence of substrate symmetry and substrate-molecule lattice matching on the resulting films of this material. By combining atomic force microscopy (AFM) with X-ray diffraction (XRD), X-ray absorption spectroscopy (NEXAFS), and in situ X-ray reflectivity (XRR) measurements, it is shown that HBC forms polycrystalline films on SiO2, where molecules are oriented in an upright fashion and adopt the known bulk structure. Remarkably, HBC films deposited on highly oriented pyrolytic graphite (HOPG) exhibit a new, substrate-induced polymorph, where all molecules adopt a recumbent orientation with planar π-stacking. Formation of this new phase, however, depends critically on the coherence of the underlying graphite lattice since HBC grown on defective HOPG reveals the same orientation and phase as on SiO2. These results therefore demonstrate that the resulting film structure and morphology are not solely governed by the adsorption energy but also by the presence or absence of symmetry- and lattice-matching between the substrate and admolecules. Moreover, it highlights that weakly interacting substrates of high quality and coherence can be useful to induce new polymorphs with distinctly different molecular arrangements than the bulk structure.
Institute of Scientific and Technical Information of China (English)
MA Qingyu; GONG Xiufen; ZHANG Dong; MA Yong
2006-01-01
In this paper, a phase-coded pulse technique is proposed to improve the signal-to-noise ratio (SNR) in the 3rd harmonic imaging in transmission mode, where three pulses with initial phases of 0°, 120° and 240° are transmitted and their corresponding received signals are linearly summed. By means of simulations and measurements, we show that the 3rd harmonic is enhanced by 9.5 dB, whereas the fundamental or the 2nd harmonic components are suppressed; the axial and lateral beam profiles of the processed 3rd harmonics are superior to those of the fundamental or 2nd harmonic components. In addition, this technique is applied to obtain the 3rd harmonic images for two normal and pathological biological tissues in transmission mode. This technique yields a dramatically cleaner and sharper contrast than the images obtained by the traditional fundamental imaging and the 2nd harmonic imaging, which helps distinguish the normal and pathological states of tissues.
Bouley, Simon; François, Benjamin; Roger, Michel; Posson, Hélène; Moreau, Stéphane
2017-09-01
The present work deals with the analytical modeling of two aspects of outlet guide vane aeroacoustics in axial-flow fan and compressor rotor-stator stages. The first addressed mechanism is the downstream transmission of rotor noise through the outlet guide vanes, the second one is the sound generation by the impingement of the rotor wakes on the vanes. The elementary prescribed excitation of the stator is an acoustic wave in the first case and a hydrodynamic gust in the second case. The solution for the response of the stator is derived using the same unified approach in both cases, within the scope of a linearized and compressible inviscid theory. It is provided by a mode-matching technique: modal expressions are written in the various sub-domains upstream and downstream of the stator as well as inside the inter-vane channels, and matched according to the conservation laws of fluid dynamics. This quite simple approach is uniformly valid in the whole range of subsonic Mach numbers and frequencies. It is presented for a two-dimensional rectilinear-cascade of zero-staggered flat-plate vanes and completed by the implementation of a Kutta condition. It is then validated in sound generation and transmission test cases by comparing with a previously reported model based on the Wiener-Hopf technique and with reference numerical simulations. Finally it is used to analyze the tonal rotor-stator interaction noise in a typical low-speed fan architecture. The interest of the mode-matching technique is that it could be easily transposed to a three-dimensional annular cascade in cylindrical coordinates in a future work. This makes it an attractive alternative to the classical strip-theory approach.
Enhanced motion coding in MC-EZBC
Chen, Junhua; Zhang, Wenjun; Wang, Yingkun
2005-07-01
Since hierarchical variable size block matching and bidirectional motion compensation are used in the motioncompensated embedded zero block coding (MC-EZBC), the motion information consists of motion vector quadtree map and motion vectors. In the conventional motion coding scheme, the quadtree structure is coded directly, the motion vector modes are coded with Huffman codes, and the motion vector differences are coded by an m-ary arithmetic coder with 0-order models. In this paper we propose a new motion coding scheme which uses an extension of the CABAC algorithm and new context modeling for quadtree structure coding and mode coding. In addition, we use a new scalable motion coding method which scales the motion vector quadtrees according to the rate-distortion slope of the tree nodes. Experimental results show that the new coding scheme increases the efficiency of the motion coding by more than 25%. The performance of the system is improved accordingly, especially in low bit rates. Moreover, with the scalable motion coding, the subjective and objective coding performance is further enhanced in low bit rate scenarios.
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.
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
Weng, Yi; He, Xuan; Wang, Junyi; Pan, Zhongqi
2017-01-01
Spatial-division multiplexing (SDM) techniques have been purposed to increase the capacity of optical fiber transmission links by utilizing multicore fibers or few-mode fibers (FMF). The most challenging impairments of SDMbased long-haul optical links mainly include modal dispersion and mode-dependent loss (MDL), whereas MDL arises from inline component imperfections, and breaks modal orthogonality thus degrading the capacity of multiple-inputmultiple- output (MIMO) receivers. To reduce MDL, optical approaches include mode scramblers and specialty fiber designs, yet these methods were burdened with high cost, yet cannot completely remove the accumulated MDL in the link. Besides, space-time trellis codes (STTC) were purposed to lessen MDL, but suffered from high complexity. In this work, we investigated the performance of space-time block-coding (STBC) scheme to mitigate MDL in SDM-based optical communication by exploiting space and delay diversity, whereas weight matrices of frequency-domain equalization (FDE) were updated heuristically using decision-directed recursive-least-squares (RLS) algorithm for convergence and channel estimation. The STBC was evaluated in a six-mode multiplexed system over 30-km FMF via 6×6 MIMO FDE, with modal gain offset 3 dB, core refractive index 1.49, numerical aperture 0.5. Results show that optical-signal-to-noise ratio (OSNR) tolerance can be improved via STBC by approximately 3.1, 4.9, 7.8 dB for QPSK, 16- and 64-QAM with respective bit-error-rates (BER) and minimum-mean-square-error (MMSE). Besides, we also evaluate the complexity optimization of STBC decoding scheme with zero-forcing decision feedback (ZFDF) equalizer by shortening the coding slot length, which is robust to frequency-selective fading channels, and can be scaled up for SDM systems with more dynamic channels.
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...
Energy Technology Data Exchange (ETDEWEB)
Testa, D. [CRPP, Switzerland; Spong, Donald A [ORNL; Panis, T. [CRPP, Switzerland; Blanchard, P. [CRPP, Switzerland; Fasoli, A. [CRPP, Switzerland
2011-01-01
This paper reports the results of recent experiments performed on the JET tokamak on Alfven eigenmodes (AEs) with toroidal mode number (n) in the range n = 3-15. The stability properties of these medium-n AEs are investigated experimentally using a new set of compact in-vessel antennas, providing a direct and real-time measurement of the frequency, damping rate and amplitude for each individual toroidal mode number. We report here the quantitative analysis of the measurements of the damping rate for stable n = 3 toroidal AEs as a function of the edge plasma elongation, and the theoretical analysis of these data with the TAEFL code. The TAEFL results are in excellent qualitative agreement with the measurements, reproducing well the experimental scaling of increasing damping rate versus increasing edge elongation, and in many cases are also quantitatively correct, with a difference with respect to the measurements below 30%, particularly for magnetic configurations that have a larger edge magnetic shear.
Energy Technology Data Exchange (ETDEWEB)
Lore, J. D., E-mail: lorejd@ornl.gov [Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831 (United States); Reinke, M. L.; Lipschultz, B. [York Plasma Institute, Department of Physics, University of York, Heslington, York YO10 5DD (United Kingdom); Brunner, D.; LaBombard, B.; Terry, J. [Plasma Science and Fusion Center, MIT, Cambridge, Massachusetts 02139 (United States); Pitts, R. A. [ITER Organization, Route de Vinon-sur-Verdon, CS 90046 - 13067 Saint Paul Lez Durance Cedex (France); Feng, Y. [Max Planck Institute for Plasma Physics, Greifswald (Germany)
2015-05-15
Experiments in Alcator C-Mod to assess the level of toroidal asymmetry in divertor conditions resulting from poloidally and toroidally localized extrinsic impurity gas seeding show a weak toroidal peaking (∼1.1) in divertor electron temperatures for high-power enhanced D-alpha H-mode plasmas. This is in contrast to similar experiments in Ohmically heated L-mode plasmas, which showed a clear toroidal modulation in the divertor electron temperature. Modeling of these experiments using the 3D edge transport code EMC3-EIRENE [Y. Feng et al., J. Nucl. Mater. 241, 930 (1997)] qualitatively reproduces these trends, and indicates that the different response in the simulations is due to the ionization location of the injected nitrogen. Low electron temperatures in the private flux region (PFR) in L-mode result in a PFR plasma that is nearly transparent to neutral nitrogen, while in H-mode the impurities are ionized in close proximity to the injection location, with this latter case yielding a largely axisymmetric radiation pattern in the scrape-off-layer. The consequences for the ITER gas injection system are discussed. Quantitative agreement with the experiment is lacking in some areas, suggesting potential areas for improving the physics model in EMC3-EIRENE.
Konorov, S O; Serebryannikov, E E; Akimov, D A; Ivanov, A A; Alfimov, M V; Zheltikov, A M
2004-12-01
Hollow-core photonic-crystal fibers are shown to allow propagation and nonlinear-optical frequency conversion of high-intensity ultrashort laser pulses in the regime of isolated guided modes confined in the hollow gas-filled fiber core. With a specially designed dispersion of such modes, the 3omega=2omega+2omega-omega four-wave mixing of fundamental (omega) and second-harmonic (2omega) sub-100- TW/ cm(2) femtosecond pulses of a Cr:forsterite laser can be phase matched in a hollow photonic-crystal fiber within a spectral band of more than 10 nm, resulting in the efficient generation of femtosecond pulses in a well-resolved higher-order air-guided mode of 417-nm radiation.
Fairy tales mode in"the Da Vinci code"%《达·芬奇密码》中的童话模式
Institute of Scientific and Technical Information of China (English)
苏芳
2014-01-01
小说《达·芬奇密码》是美国著名作家丹·布朗的代表作。《纽约时报》畅销书作者克莱夫·库斯勒称赞小说《达·芬奇密码》为一部神话。小说《达·芬奇密码》不仅是一部神话，也是一部童话。小说《达·芬奇密码》中的童话模式也给读者留下了深刻的印象。在丹·布朗用文字编写的美丽童话中，索菲·奈芙是一名美丽而聪明的公主。而罗伯特·兰登则是一名机智的王子。罗伯特·兰登冒着生命危险去保护索菲·奈芙。%"The Da Vinci code"is a famous American author Dan brown's masterpiece. The New York times best-selling author Clive, le praised the novel"the Da Vinci code"is a myth."The Da Vinci code"is a myth, not only is a fairy tale."The Da Vinci code"in the fairy tale mode also left a deep impression on the readers. Dan brown's beautiful fairy tale written in words, Sophie Neveu fu is a clever and beautiful princess. And Robert Langdon is a wit of the prince. Robert Langdon, risking his life to protect Sophie Neveu.
GPS M码信号压制干扰样式效能分析%Effectiveness Analysis of the Blanket Jamming Mode to GPS M Code Signal
Institute of Scientific and Technical Information of China (English)
毛虎; 吴德伟; 卢虎; 白盟亮
2015-01-01
Aiming at the feature and superiority on anti-jamming of global position system (GPS) M code signal, in order to find an effective jamming mode for M code signal, the jamming efficiency of three types of typical blanket jamming, single frequency, band-limited Gaussian noise, and pseudo code with the same rate, are analyzed. In the analysis, the power spectral density change of GPS receiver cross-correlation filtering output is taken as the qualitative evaluation bases;the code tracking error and the ephemeris bit error rate (BER) are taken as the quantitative evaluation indexes. The influence process of jamming to evaluation factor and the oneness of each evaluation factor are derived theoretically by modeling M code signal receiving system. The simulation results show that single frequency jamming exhibits the best jamming effect while band-limited Gaussian noise jamming is the worst, the second comes pseudo code with the same rate jamming when the influence of sub-carrier modulation was eliminated. Considering the complexity of smart jamming implementation, it is suggested to choose the pseudo code with the same rate as M code signal jamming since single frequency jamming needs strict frequency setting and it is easily eliminated by frequency domain filtering.%针对GPS M码信号的特点和在抗干扰方面的优越性，为实现对其有效干扰，以接收机相关滤波输出功率谱变化情况作为定性评估依据，以码跟踪误差和星历误码率作为定量评估指标，对单频、带限高斯噪声和同速率伪码3种典型压制干扰样式的干扰效能进行分析。通过建立M码信号的接收系统模型，从理论上推导了干扰对各具体评估要素的影响过程以及各要素之间的统一性。仿真结果表明，单频干扰效果最好，消除副载波调制影响的同速率伪码干扰次之，带限高斯噪声干扰效果较差。考虑到单频干扰对干扰频偏设置的较高要求以及容易被接收
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.
Institute of Scientific and Technical Information of China (English)
郭钢; 沈磊; 杨联星; 徐建萍
2012-01-01
To solve the problems of outsourcing planning matching with outsourcing resource and outsourcing process monitoring, outsourcing parts of collaborative manufacture mode based on project manufacturing management mode is put forward. The mode involved collaborative manufacturing resource capacity model,outsourcing plans and promises resources matching matrices based on constraints of time and resource,outsourcing planning and resource conflict resolution model can improve the feasibility of the outsourcing planning, resource matching and execution effectively and guarantee the outsourcing plans completed on time.%针对装备类产品在零件外协加工过程中计划与外协资源匹配、外协过程进度监控等方面存在的问题，基于装备类产品项目制造（Project Manufacturing，PJM）管理模式，提出了外协件协同制造模式、协同制造资源能力模型、基于时段和资源约束条件下外协计划与契约可用资源能力匹配矩阵、外协计划与资源冲突消解模型，有效提高了装备类产品项目制造中外协计划编制、资源匹配与执行的可行性，保证外协计划的按期完工。
Institute of Scientific and Technical Information of China (English)
陈航; 张允孟; 李志舜
2001-01-01
The article study widening band of longitudinal mode piezoelectric transducers.The non-single resonance characteristics appear by forming proper impedance matching layers on the radiative surface of longitudinal mode piezoelectric transducer.The places of resonance points can be adjusted,and the radiated characteristic of transducer with single matching layers was improved by choosing the length of matching layer reasonably.The research on the transducer having mechanical quality factor Qm＝6,bandwidth of transmitting sensitivity △f＝4kHz presents that,using quarter matching layer,two times bandwidth was achieved in same transmitting sensitivity.%本文研究纵向振动压电换能器的频带展宽问题。在复合棒纵向换能器的辐射端加上适当材料的阻抗匹配层，可以使其工作在非单谐振状态下。在单层阻抗匹配层的情况下，合理地选择匹配层的厚度可以调整其谐振点之间的位置，从而改善换能器的辐射特性。本研究结果表明，对于机械品质因素Qm＝6，发射响应带宽△f＝4kHz的纵向振子，采用四分之一波长厚度的匹配层，在不降低发射响应的条件下，可展宽频带一倍以上。
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.
双模毁伤元EFP和JPC结构匹配研究%Study on Configuration Parameters Matching Dual Mode Penetrators EFP and JPC
Institute of Scientific and Technical Information of China (English)
陈奎; 李伟兵; 王晓鸣
2011-01-01
The influence of configuration parameters of arc-cone liner on dual mode penetrators' formation was researched by LS-DYNA software. Through changing the cone angle, arc curvature radius and thickness of arc-cone liner, the performance of penetrators was analyzed, and the law that the formation parameters of EFP and JPC, such as length, length-diameter ratio, velocity and so on, influenced by the configuration parameters of liner were educed. The results show that cone angle, arc curvature radius and thickness of arc-cone liner have optimization combination. When cone angle is between 140°and 150°, arc curvature radius is between 40 mm and 50 mm, and liner thickness is between 3.6mm and 4.0mm, the formation effect of dual mode penetrators is the best The simulation results can offer references for the further study of dual mode shaped charge.%运用LS-DYNA仿真软件研究了弧锥结合罩的结构参数对双模毁伤元EFP和JPC形成的影响规律.通过改变弧锥结合罩的锥角、圆弧曲率半径和药型罩壁厚,对比分析形成的毁伤元性能规律,得出药型罩结构参数对EFP和JPC长度、长径比、速度等成型参数的影响规律.结果表明:弧锥结合罩的圆弧曲率半径、锥角和壁厚存在最优值,锥角在140～150°、圆弧曲率半径在40～50mm、药型罩厚度在3.6～4.0mm范围内取值较好.该数值模拟结果可为进一步研究双模成型装药提供参考依据.
Rewrite Systems, Pattern Matching, and Code Generation
1988-06-09
iii 2 5 7 17 23 28 29 29 30 34 47 49 50 51 52 55 56 58 61 63 66 70 71 71 73 73...Transformations Quicn a bucn arbol se anima, buena sombra le cobija1 [Old Spanish Saying] 1 Trees arc hierarchical mathematical objects. Their...there are three nullary operators a, b, and c. The B-fsa is the same as in Figure 2.2. 50 Pattern Set: + + /\\ A * z X * 1\\ 1\\ XY YZ Sub
Energy Technology Data Exchange (ETDEWEB)
Nichols, R.A.; Smith, W.W.
1976-06-30
The three-volume report describes a dual-mode nuclear space power and propulsion system concept that employs an advanced solid-core nuclear fission reactor coupled via heat pipes to one of several electric power conversion systems. The second volume describes the computer code and users' guide for the preliminary analysis of the system.
Fast Mode Decision Algorithm for Intra-frames Coding in HEVC%基于HEVC的帧内快速模式选择算法
Institute of Scientific and Technical Information of China (English)
申文龙
2014-01-01
为了解决高效率视频编码(High Efficiency Video Coding,HEVC)复杂度过高的问题,基于粗粒度模式选择(Rough Mode Decision,RMD)过程提出一种降低编码复杂度的方法.该算法充分利用了RMD候选队列的相似程度和预测模式在方向上的相关性这两个特性,进一步减少了进入率失真优化过程(Rate Distortion Optimization,RDO)的预测模式数量,达到了降低编码复杂度的目的.实验结果表明,该算法在编码质量损失0.5％的情况下节省了近22％的编码时间.
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...
Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes
Harrington, James William
Quantum information theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g. , factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system (such as a mode of light) can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under various error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in certain condensed matter models. I also present
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.
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.
Institute of Scientific and Technical Information of China (English)
徐德洪
2014-01-01
In this paper, through analyzing the current status of the express industry and community logistics activity, we applied the QR code and OTO service mode effectively to the operation of the community express logistics activities, and then proposed the OTO community express service operation mode based on QR code.%通过分析快递业和社区物流的现状，将QR码和OTO服务模式有效应用到社区快递物流运营中，在构建社区物业信息平台的基础上，结合其运营流程和特点，提出基于QR码的OTO社区快递服务运营模式，为提高社区快递运营效率提供借鉴。
竞技游泳项目临赛准备活动模式调查研究%The Research of Pre - match Warm - up mode in Swimming Competition
Institute of Scientific and Technical Information of China (English)
宋耀伟
2011-01-01
通过对53名优秀游泳运动员进行问卷调查，了解优秀游泳运动员赛前生理、心理准备活动方法、步骤、时间、次数、强度等，尝试归纳总结游泳临赛前准备活动模式。结果显示：我国优秀游泳运动员准备活动模式相对固定，差异不大，但会在特殊情况下做出细微调整；游泳赛前准备活动模式包括赛前一晚制定比赛行为活动程序、比赛当天起床后的热身活动、陆上身体活动、临赛前水上活动、水上活动与比赛间隔及心理准备活动、检录前后的再活动、上出发台前的活动等；临赛前水上准备包括专项技术、生理机能调动、绝对强度和技战术部分；常用方法包括适应性热身游、主项技术游、上肢与下肢练习、主项强度游、短冲、比赛细节练习与整理放松等；临赛前心理准备活动方法包括呼吸调节、注意集中、表象演练、自我谈话等。%Through the questionnaire survey among 53 excellent swimmers, we found the method, process, time, frequency and intension of physical and psychological pre - match warm - up of them and tried to summarize the mode of warm - up before swimming competition. The result showed that the mode of our excellent national swimmers＇ warm -up is comparatively stable and will be adusted imperceptibly under some special conditions. The mode of warm - up before swimming competition included setting the competition tactics one night before, the activities after getting up on the competition day, onsite ground exercises, in - water exercises, psy- chological preparation between the intervals of competition, exercises before and after inspection and exercises before standing on the starting dive, etc. Pre - match on - water exercised included special technical section, adjustment of physiological enginery section, the certain intension section, technique and tactics section. The common method included adaptable warm - up
Finding a Development Mode to Match Reality
Institute of Scientific and Technical Information of China (English)
2007-01-01
The 21st Century Business Herald,a leading Chinese finandal newspaper, recently sat down with Tian Guoqiang,Dean of the School of Economics, Shanghai University of Finance and Economics,and professor at Texas A&M University (U.S.),to discuss the future outlook of China’s economic development.Excerpts follow:
Mode-matching for Optical Antennas
Feichtner, Thorsten; Christiansen, Silke; Hecht, Bert
2016-01-01
The emission rate of a point dipole can be strongly increased in presence of a well-designed optical antenna. Yet, optical antenna design is largely based on radio-frequency rules, ignoring e.g.~ohmic losses and non-negligible field penetration in metals at optical frequencies. Here we combine reciprocity and Poynting's theorem to derive a set of optical-frequency antenna design rules for benchmarking and optimizing the performance of optical antennas driven by single quantum emitters. Based ...
Mode-matching for Optical Antennas
Feichtner, Thorsten; Hecht, Bert
2016-01-01
The emission rate of a point dipole can be strongly increased in presence of a well-designed optical antenna. Yet, optical antenna design is largely based on radio-frequency rules, ignoring e.g.~ohmic losses and non-negligible field penetration in metals at optical frequencies. Here we combine reciprocity and Poynting's theorem to derive a set of optical-frequency antenna design rules for benchmarking and optimizing the performance of optical antennas driven by single quantum emitters. Based on these findings a novel plasmonic cavity antenna design is presented exhibiting a considerably improved performance compared to a reference two-wire antenna. Our work will be useful for the design of high-performance optical antennas and nanoresonators for diverse applications ranging from quantum optics to antenna-enhanced single-emitter spectroscopy and sensing.
Energy Technology Data Exchange (ETDEWEB)
Borges, Eduardo M.; Sabundjian, Gaiane, E-mail: gdgian@ipen.br, E-mail: borges.em@hotmail.com [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)
2015-07-01
Identifying the flow regimes and the heat transfer modes is important for the analysis of accidents such as the Loss-of-Coolant Accident (LOCA). The aim of this paper is to identify the flow regimes, the heat transfer modes, and the correlations used in the RELAP5/MOD3.2.gama code in ANGRA 2 during the Small-Break Loss-of-Coolant Accident (SBLOCA) with a 100cm{sup 2}-rupture area in the cold leg of primary loop. The Chapter 15 of the Final Safety Analysis Report of ANGRA 2 (FSAR - A2) reports this specific kind of accident. The results from this work demonstrated the several flow regimes and heat transfer modes that can be present in the core of ANGRA 2 during the postulated accident. (author)
Institute of Scientific and Technical Information of China (English)
吴茹
2015-01-01
物流作为当今重要的服务行业之一，对加快产业集群经济快速发展和发挥产业集群竞争优势具有重要的作用。目前浙江汽车行业具有典型的集群式发展特征，但汽车产业物流并未形成标准化与现代化，且并未与第三、四方物流企业达成有效的合作式发展。通过对浙江汽车产业集群与物流外包匹配模式的研究，促进汽车产业集群与物流业的紧密联系、融合发展，从而降低汽车产业物流成本，提高物流企业效益，达到共赢的局面。%As one of today's major logistics service industry,logistics has played an important role to accelerate the rapid economic development of industrial clusters and competitive advantage of industrial clusters.Currently,Zhejiang auto industry has a typical cluster development features,but the automobile industry logistics did not form standardization and modernization,and did not achieve effective cooperation development with third party logistics enterprises.By studying the Matching Mode between Zhejiang Automotive Industrial Clusters and Logistics Outsourcing to facilitate close contact automobile industry cluster and logistics industry,integration and development,thereby reducing the automobile industry logistics costs and improve efficiency of logistics enterprises to achieve win -win situation.
Institute of Scientific and Technical Information of China (English)
邢光龙; 刘伟宁
2011-01-01
Numerical mode-matching method is a method for normal resistivity logging which is an effective semi-numerical, semi-analytic way forward. The selection of basis function is very important when the finite element method is used in numerical solution, which affects the speed and accuracy of the calculation. Hermite multiscale functions have many good characteristics such as orthogonal, higher order approximation and first order partial derivatives continuous in the node and so on. In this article, Hermite multiscale functions are used as the shape functions, and are improved. This method is demonstrated in the different o layer models of the normal resistivity logging. The experiments demonstrated that the current is continuous at the node and the calculation precision is improved significantly.%模式匹配法是普通电阻率测井的一种有效的半数值、半解析的正演方法。在使用有限元法进行数值解时，基函数的选取十分重要，它影响着计算的速度和精度。Hermite多尺度函数具有正交性、高阶逼近和一阶偏导数在节点连续等特性，本文在解决数值本征模式解时，将Hermite多尺度函数作为形函数，并对其进行了改进。在不同介质的地层模型中进行验证，实验结果表明将该函数作为有限单元的形函数，电流在节点处连续并且计算精度大大提高。
Gao, Yuan; Liu, Tzu-Chien; Paas, Fred
2016-01-01
This study compared the effects of effortless selection of target plants using quick respond (QR) code technology to effortful manual search and selection of target plants on learning about plants in a mobile device supported learning environment. In addition, it was investigated whether the effectiveness of the 2 selection methods was…
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.
MULTI-BLOCK CHAINING-BASED AUTHENTICATION MODE
Institute of Scientific and Technical Information of China (English)
Huang Yuhua; Hu Aiqun; Zhong Ziguo
2006-01-01
A fast authentication mode based on Multi-Block Chaining (MBC) is put forward; and its security is proved. The MBC mode is for new generation block cipher algorithms. Its speed is about 13% faster than that of the authentication modes in common use (for example, cipher block chaining-message authentication code mode). The dependence test results meet the requirement. The MBC mode is complete; its degree of avalanche effect is about 0.9993; its degree of strict avalanche criterion is 0.992 or so. The frequency test results indicate that the output generated by the MBC mode has uniformity. The binary matrix rank test results imply that it is linear independent among disjoint sub-matrices of the output. Maurer's universal statistical test results show that the output could be significantly compressed without loss of information. Run test, spectral test,non-overlapping template matching test, overlapping template matching test, Lempel-Ziv compression test,linear complexity test, serial test, approximate entropy test, cumulative sums test, random excursions test and random excursions variant test results fulfill the requirements of all. Therefore the MBC mode has good pseudo-randomness. Thus the security of MBC mode is verified by the way of statistical evaluation.
Mode Conversion Losses in Expansion Units for ITER ECH Transmission Lines
Schaub, S. C.; Shapiro, M. A.; Temkin, R. J.; Hanson, G. R.
2016-01-01
The ITER electron cyclotron heating transmission lines will consist of 63.5-mm-diameter corrugated waveguides, each carrying 1 MW of 170 GHz microwaves. These transmission lines must include expansion units to accommodate expansion and contraction along the path from the gyrotron microwave sources to the tokamak. A numerical mode matching code has been developed to calculate power losses due to mode conversion of the operating mode, HE11, to higher order modes as a result of the radial discontinuities in a sliding joint. Two expansion unit designs were evaluated, a simple gap expansion unit and a more complex tapered expansion unit. The gap expansion unit demonstrated loss that oscillated rapidly with expansion length, due to trapped modes within the unit. The tapered expansion unit has been shown to effectively suppress these trapped modes at the expense of increased fabrication complexity. In a gap expansion unit, for a waveguide step size of 2.5 mm, loss can be kept below 0.1 % to a maximum expansion length of 17 mm. Expansion units without corrugation on interior walls were also evaluated. Expansion units that lack corrugations are found to increase mode trapping within the units, though not beyond useful application. The mode matching code developed in this paper was also used to estimate mode conversion loss in vacuum pumpouts for the ECH lines; the estimated loss was found to be negligibly small.
Improved lossless intra coding for next generation video coding
Vanam, Rahul; He, Yuwen; Ye, Yan
2016-09-01
Recently, there have been efforts by the ITU-T VCEG and ISO/IEC MPEG to further improve the compression performance of the High Efficiency Video Coding (HEVC) standard for developing a potential next generation video coding standard. The exploratory codec software of this potential standard includes new coding tools for inter and intra coding. In this paper, we present a new intra prediction mode for lossless intra coding. Our new intra mode derives a prediction filter for each input pixel using its neighboring reconstructed pixels, and applies this filter to the nearest neighboring reconstructed pixels to generate a prediction pixel. The proposed intra mode is demonstrated to improve the performance of the exploratory software for lossless intra coding, yielding a maximum and average bitrate savings of 4.4% and 2.11%, respectively.
Edge-localized mode avoidance and pedestal structure in I-mode plasmas
Energy Technology Data Exchange (ETDEWEB)
Walk, J. R., E-mail: jrwalk@psfc.mit.edu; Hughes, J. W.; Hubbard, A. E.; Terry, J. L.; Whyte, D. G.; White, A. E.; Baek, S. G.; Reinke, M. L.; Theiler, C.; Churchill, R. M.; Rice, J. E. [MIT Plasma Science and Fusion Center, Cambridge, MA 02139-4307 (United States); Snyder, P. B.; Osborne, T. [General Atomics, San Diego, CA 92186-5608 (United States); Dominguez, A [Princeton Plasma Physics Laboratory, Princeton, NJ 08543-0451 (United States); Cziegler, I. [UCSD Center for Momentum Transport and Flow Organization, La Jolla, CA 92093-0417 (United States)
2014-05-15
I-mode is a high-performance tokamak regime characterized by the formation of a temperature pedestal and enhanced energy confinement, without an accompanying density pedestal or drop in particle and impurity transport. I-mode operation appears to have naturally occurring suppression of large Edge-Localized Modes (ELMs) in addition to its highly favorable scalings of pedestal structure and overall performance. Extensive study of the ELMy H-mode has led to the development of the EPED model, which utilizes calculations of coupled peeling-ballooning MHD modes and kinetic-ballooning mode (KBM) stability limits to predict the pedestal structure preceding an ELM crash. We apply similar tools to the structure and ELM stability of I-mode pedestals. Analysis of I-mode discharges prepared with high-resolution pedestal data from the most recent C-Mod campaign reveals favorable pedestal scalings for extrapolation to large machines—pedestal temperature scales strongly with power per particle P{sub net}/n{sup ¯}{sub e}, and likewise pedestal pressure scales as the net heating power (consistent with weak degradation of confinement with heating power). Matched discharges in current, field, and shaping demonstrate the decoupling of energy and particle transport in I-mode, increasing fueling to span nearly a factor of two in density while maintaining matched temperature pedestals with consistent levels of P{sub net}/n{sup ¯}{sub e}. This is consistent with targets for increased performance in I-mode, elevating pedestal β{sub p} and global performance with matched increases in density and heating power. MHD calculations using the ELITE code indicate that I-mode pedestals are strongly stable to edge peeling-ballooning instabilities. Likewise, numerical modeling of the KBM turbulence onset, as well as scalings of the pedestal width with poloidal beta, indicates that I-mode pedestals are not limited by KBM turbulence—both features identified with the trigger for large ELMs
Adaptive mode-dependent scan for H.264/AVC intracoding
Wei, Yung-Chiang; Yang, Jar-Ferr
2010-07-01
In image/video coding standards, the zigzag scan provides an effective encoding order of the quantized transform coefficients such that the quantized coefficients can be arranged statistically from large to small magnitudes. Generally, the optimal scan should transfer the 2-D transform coefficients into 1-D data in descending order of their average power levels. With the optimal scan order, we can achieve more efficient variable length coding. In H.264 advanced video coding (AVC), the residuals resulting from various intramode predictions have different statistical characteristics. After analyzing the transformed residuals, we propose an adaptive scan order scheme, which optimally matches up with intraprediction mode, to further improve the efficiency of intracoding. Simulation results show that the proposed adaptive scan scheme can improve the context-adaptive variable length coding to achieve better rate-distortion performance for the H.264/AVC video coder without the increase of computation.
Technical Review of peephole Technique in compiler to optimize intermediate code
Directory of Open Access Journals (Sweden)
Vaishali Sanghvi
2013-01-01
Full Text Available Peephole optimization is a efficient and easy optimization technique used by compilers sometime called window or peephole is set of code that replace one sequence of instructions by another equivalent set of instructions, but shorter, faster. Peephole optimization is traditionally done through String pattern matching that is using regular expression. There are some the techniques of peephole optimization like constant folding, Strength reduction, null sequences, combine operation, algebraic laws, special case instructions, address mode operations.The peephole optimization is applied to several parts or section of program or code so main question is where to apply it before compilation, on the intermediate code or after compilation of the code .The aim of this dissertation to show the current state of peephole optimization and how apply it to the IR (Intermediate Representation code that is generated by any programming language.
Institute of Scientific and Technical Information of China (English)
宫岛; 周劲松; 孙文静; 陈虹
2014-01-01
FE models of fully-equipped car bodies and a high-speed railway vehicle rigid-flexible coupled model including the flexibility of car body were built,the influences of suspended forms of devices on modal parameters of fully-equipped car bodies were analyzed,the design procedures of rubber isolator parameters of suspended devices were proposed,and the matching relations between car body modes and suspended equipment modal parameters were investigated.The results showed that car body modal frequencies can be promoted obviously with devices of elastic suspension;reasonable suspension parameters of devices can effectively suppress car body flexible vibration.The examples here showed that when the static deflection of a rubber isolator is 8 !9 mm,the bounce and roll frequencies of the device can be far from the first vertical bending and the diagonal distortion frequencies of the car body,respectively;the devices having vibration sources can achieve a good effect of vibration reduction in a high frequency range,the vehicle can obtain a good ride quality and the suspended device vibration is not strong.%建立了整备状态车体有限元模型及包含车体弹性的高速列车车辆刚柔耦合动力学模型，分析了车下设备吊挂方式对车体整备状态模态参数的影响，提出车下设备隔振橡胶件参数设计方法，并研究了整备状态下车体与车下设备悬挂模态参数的匹配关系。结果表明，车下设备采用弹性吊挂时，车体整备状态下的模态频率显著提升；合理设置车下设备隔振悬挂参数可有效降低车体弹性振动，算例中，当橡胶件的静挠度设置为8！9 mm时，设备浮沉频率可与车体垂向一阶弯曲频率避开，侧滚频率可与车体菱形变形模态频率避开，有源设备高频振动减振效果理想，车辆可以获得优良的运行平稳性，同时车下设备自身振动亦不剧烈。
Directory of Open Access Journals (Sweden)
Fabio Burderi
2007-05-01
Full Text Available Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD, we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ``unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguouscomponent and other (if any totally ambiguouscomponents. In the case the code is finite, we give an algorithm for computing its canonical partition. This, in particular, allows to decide whether a given partition of a finite code X is a coding partition. This last problem is then approached in the case the code is a rational set. We prove its decidability under the hypothesis that the partition contains a finite number of classes and each class is a rational set. Moreover we conjecture that the canonical partition satisfies such a hypothesis. Finally we consider also some relationships between coding partitions and varieties of codes.
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,
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...
Institute of Scientific and Technical Information of China (English)
牛建伟; 高宾; 沈思思
2011-01-01
为了更好地利用图像的结构特征,提高图像重建的质量,提出了一种基于多级树集合划分(SPIHT)和匹配追踪(MP)的分层图像编码方法--(SPMP)算法.该方法首先采用拉普拉斯金字塔(Laplacian Pyramid)算法将原始图像分解成低频平滑层和高频细节层,然后使用离散小波变换和SPIHT算法编码图像的低频成分,使用基于克隆选择的匹配追踪算法编码图像的高频细节层.实验结果表明,该方法能够产生渐进:PSNR的位流,图像重建质量要明显高于小波图像编码算法.%To make full use of the structural characteristics of original images to improve reconstructed images' quality this paper proposes a novel hierarchical image encoding method based on set partitioning in hierarchical trees (SPIHT) and matching pursuit (MP) algorithm, named the SPMP algorithm. This new method divides the original images into a smooth layer in low frequency and a detail layer in high frequency by using the Laplacian Pyramid algorithm. In the smooth layer, it uses the discrete wavelet to transform the images from the space domain to the frequency domain, and then it encodes the coefficients in the frequency domain by using the SPIHT algorithm. The method adopts the matching pursuit (MP) algorithm to encode the detail layer based on the clone selection algorithm. The experimental results demonstrate that when using the SPMP algorithm, the output bitstream is embedded with the progressive peak signal-to-noise ratio (PSNR), and the reconstructed images quality is significantly better than that obtained using the wavelet transform encoding, even more obviously under the high compression ratio.
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.
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...
Matching Parasitic Antenna for Single RF MIMO
DEFF Research Database (Denmark)
Han, Bo; Kalis, A; Nielsen, Rasmus Hjorth
2012-01-01
Single RF MIMO communication emerges a novel low cost communication method which does not consume as much power as the conventional MIMO. The implementation of such single RF MIMO system is done by mapping the weighting factors to the polarizations or the radiation patterns of the antennas....... In order to have such performance, an antenna with rich pattern modes is required by the system, thus the ESPAR antenna is investigated. The critical part on such antenna is parasitic element impedance matching. Unlike the conventional smith-chart matching method which assumes the minimal resistance...... is zero and with goal of 50 ohm or 75 ohm matching, matching on such parasitic antenna will adopt negative value as well. This paper presents a matching network with controllable impedance even to the range of negative values....
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.
Latorre, Jose I
2015-01-01
There exists a remarkable four-qutrit state that carries absolute maximal entanglement in all its partitions. Employing this state, we construct a tensor network that delivers a holographic many body state, the H-code, where the physical properties of the boundary determine those of the bulk. This H-code is made of an even superposition of states whose relative Hamming distances are exponentially large with the size of the boundary. This property makes H-codes natural states for a quantum memory. H-codes exist on tori of definite sizes and get classified in three different sectors characterized by the sum of their qutrits on cycles wrapped through the boundaries of the system. We construct a parent Hamiltonian for the H-code which is highly non local and finally we compute the topological entanglement entropy of the H-code.
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
Kubilius, Jonas
2014-01-01
Sharing code is becoming increasingly important in the wake of Open Science. In this review I describe and compare two popular code-sharing utilities, GitHub and Open Science Framework (OSF). GitHub is a mature, industry-standard tool but lacks focus towards researchers. In comparison, OSF offers a one-stop solution for researchers but a lot of functionality is still under development. I conclude by listing alternative lesser-known tools for code and materials sharing.
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.
Digital GPS-Signal Processor With P-Code/No-P-Code Option
Thomas, J. Brooks; Srinivasan, Jeffrey M.
1994-01-01
Size, power, and cost reduced by exploiting commonality. Digital signal processor for Global Positioning System (GPS) receiver set to operate in "code" mode when P code known, or in "codeless" mode when P code not known. In codeless mode, processor performs full-quadrature processing, resulting in signal-to-noise ratio (SNR) 6 dB greater than SNR's of processors not performing at full quadrature.
Impedance-matched drilling telemetry system
Normann, Randy A.; Mansure, Arthur J.
2008-04-22
A downhole telemetry system that uses inductance or capacitance as a mode through which signal is communicated across joints between assembled lengths of pipe wherein efficiency of signal propagation through a drill string, for example, over multiple successive pipe segments is enhanced through matching impedances associated with the various telemetry system components.
Numerical {Delta}` studies of the nonlinear finite-{beta} tearing mode
Energy Technology Data Exchange (ETDEWEB)
Pletzer, A. [Ecole Polytechnique Federale, Lausanne (Switzerland). Centre de Recherche en Physique des Plasma (CRPP)
1996-09-01
Tearing modes have recently attracted attention following theoretical successes in predicting the presence of magnetic island with moderate poloidal m = 3,4 and toroidal n = 2,3 mode numbers during TFTR (Tokamak Fusion Test Reactor) supershots. Classical linear resistive mode theory predicts instability when the asymptotic matching index {Delta}` defined as the jump of logarithmic derivative of the radial magnetic perturbation across the rational surface is positive. Recently, it was suggested that tearing modes could also persist when {Delta}`<0 provided bootstrap current effects are taken into account. In all the above theories, the crucial parameter which determines the stability from both the geometry and equilibrium profiles is {Delta}`. It is shown in the present study that the {Delta}` of the (m=2, n=1) mode computed with the PEST-3 code is virtually always positive. Saturation can nevertheless be achieved provided the symmetry breaking term of a current gradient is included in the resistive layer. (author) 3 figs., 11 refs.
DEFF Research Database (Denmark)
Cox, Geoff
Speaking Code begins by invoking the “Hello World” convention used by programmers when learning a new language, helping to establish the interplay of text and code that runs through the book. Interweaving the voice of critical writing from the humanities with the tradition of computing and software...
2014-12-01
QPSK Gaussian channels . .......................................................................... 39 vi 1. INTRODUCTION Forward error correction (FEC...Capacity of BSC. 7 Figure 5. Capacity of AWGN channel . 8 4. INTRODUCTION TO POLAR CODES Polar codes were introduced by E. Arikan in [1]. This paper...Under authority of C. A. Wilgenbusch, Head ISR Division EXECUTIVE SUMMARY This report describes the results of the project “More reliable wireless
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.
Design of New SAW DQPSK Matched Filter
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
A new surface acoustic wave differential quadraphase shift key(SAW DQPSK) spread spectrum(SS) signal matched filter based on the fusion of SS and differential modulation is reported. The design of multi-phase coded SAW matched filter is proposed rather than another design of SAW DQPSK filter, which can cut in a half of the delay time of SAW DQPSK matched filter and SAW fixed delay line(FDL) used for differential demodulation. This breakthrough is made the system largely reduce a size and process much easily. This method can also be feasible in other SAW MPSK matched filter design especially when the modulation phase number is larger than 4. The design example and its experimental results are given.
Energy Technology Data Exchange (ETDEWEB)
Bingham, Philip R [ORNL; Santos-Villalobos, Hector J [ORNL
2011-01-01
Coded aperture techniques have been applied to neutron radiography to address limitations in neutron flux and resolution of neutron detectors in a system labeled coded source imaging (CSI). By coding the neutron source, a magnified imaging system is designed with small spot size aperture holes (10 and 100 m) for improved resolution beyond the detector limits and with many holes in the aperture (50% open) to account for flux losses due to the small pinhole size. An introduction to neutron radiography and coded aperture imaging is presented. A system design is developed for a CSI system with a development of equations for limitations on the system based on the coded image requirements and the neutron source characteristics of size and divergence. Simulation has been applied to the design using McStas to provide qualitative measures of performance with simulations of pinhole array objects followed by a quantitative measure through simulation of a tilted edge and calculation of the modulation transfer function (MTF) from the line spread function. MTF results for both 100um and 10um aperture hole diameters show resolutions matching the hole diameters.
Bingham, Philip; Santos-Villalobos, Hector; Tobin, Ken
2011-03-01
Coded aperture techniques have been applied to neutron radiography to address limitations in neutron flux and resolution of neutron detectors in a system labeled coded source imaging (CSI). By coding the neutron source, a magnified imaging system is designed with small spot size aperture holes (10 and 100μm) for improved resolution beyond the detector limits and with many holes in the aperture (50% open) to account for flux losses due to the small pinhole size. An introduction to neutron radiography and coded aperture imaging is presented. A system design is developed for a CSI system with a development of equations for limitations on the system based on the coded image requirements and the neutron source characteristics of size and divergence. Simulation has been applied to the design using McStas to provide qualitative measures of performance with simulations of pinhole array objects followed by a quantitative measure through simulation of a tilted edge and calculation of the modulation transfer function (MTF) from the line spread function. MTF results for both 100μm and 10μm aperture hole diameters show resolutions matching the hole diameters.
Doppler Compensation by using of Segmented Match Filter
2008-01-01
Match filter is one of the important parts of radar receiver. By using of Match Filter, the signal to noise ratio can be maximized so that the probability of detection is increased. Match Filter can be used as a pulse compression filter in radar receiver. Binary phase code is one of the pulse compression methods that, the compression can be down with a Match Filter in the receiver. Doppler effect is one of the problems that degrade the performance of Match Filter. In this paper, two methods “...
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...
A review on compressed pattern matching
Directory of Open Access Journals (Sweden)
Surya Prakash Mishra
2016-09-01
Full Text Available Compressed pattern matching (CPM refers to the task of locating all the occurrences of a pattern (or set of patterns inside the body of compressed text. In this type of matching, pattern may or may not be compressed. CPM is very useful in handling large volume of data especially over the network. It has many applications in computational biology, where it is useful in finding similar trends in DNA sequences; intrusion detection over the networks, big data analytics etc. Various solutions have been provided by researchers where pattern is matched directly over the uncompressed text. Such solution requires lot of space and consumes lot of time when handling the big data. Various researchers have proposed the efficient solutions for compression but very few exist for pattern matching over the compressed text. Considering the future trend where data size is increasing exponentially day-by-day, CPM has become a desirable task. This paper presents a critical review on the recent techniques on the compressed pattern matching. The covered techniques includes: Word based Huffman codes, Word Based Tagged Codes; Wavelet Tree Based Indexing. We have presented a comparative analysis of all the techniques mentioned above and highlighted their advantages and disadvantages.
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)
Transverse Beam Matching Application for SNS
Chu, Chungming; Jeon Dong Oh; Plum, Michael
2005-01-01
An automated transverse beam matching application has been developed for the Spallation Neutron Source (SNS) beam transport lines. The application is written within the XAL Java framework and the matching algorithm is based on the simplex optimization method. Other functionalities, such as emittance calculated from profile monitor measurements (adopted from a LANL Fortran code), profile monitor display, and XAL on-line model calculation, are also provided by the application. Test results obtained during the SNS warm linac commissioning will be reported. A comparison between the emittances obtained from this application and an independent Trace-3D routine will also be shown.
RETIRED MATCHES AMONG MALE PROFESSIONAL TENNIS PLAYERS
Directory of Open Access Journals (Sweden)
Kristijan Breznik
2012-06-01
Full Text Available The aim of this study was to explore the effect of characteristics of various games and players on the proportion of retired tennis matches in the Open Era of tennis. The data included over 420,000 matches played among 17,553 tennis players in the period from 1968 to the end of 2010. The influence of the surface type was clearly confirmed, with the proportion of retired matches being higher on hard and clay courts compared to grass and carpet surfaces. Similarly, more retired matches were observed in outdoor venues than in indoor ones. The impact of other variables, tournament types, rounds at which the game was played and both players' ranks, is more ambiguous. Our interpretation of the obtained results is presented in the paper. Network analytic methods were applied to extract players with the most retired matches in their careers. Eventually, we defined a group of top tennis players and gave a more precise insight into retired matches in that group. Correspondence analysis was used to visually display the two-mode network of top players and the proportion of retired matches by surface type
Matching conditions on capillary ripples
Energy Technology Data Exchange (ETDEWEB)
Rodriguez, Aresky H.; Marin Antuna, J.; Rodriguez Coppola, H. [Universidad de La Habana, La Habana (Cuba)
2001-12-01
The physics of the oscillatory motion in the interface between two immiscible viscous fluids is presented based on a detailed analysis of the matching conditions. These conditions are almost completely derived from the dynamical equations of the system. This unusual approach in graduated courses in hydrodynamics, is proposed as an alternative. The role of viscosity in the modes of oscillation of the interface is also clearly shown. [Spanish] Se explica la fisica de las oscilaciones de la interfase de dos fluidos viscosos no miscibles a partir del analisis detallado de las condiciones de empalme que se derivan casi completamente del sistema de ecuaciones dinamicas que lo rigen. Ese enfoque, no habitual en los cursos de doctorado de esta materia, se propone como alternativa para estos cursos. Se explica tambien de forma clara el posible papel de la viscosidad en los modos de oscilacion de la interfase.
DEFF Research Database (Denmark)
Beck Jørgensen, Torben; Sørensen, Ditte-Lene
2013-01-01
Good governance is a broad concept used by many international organizations to spell out how states or countries should be governed. Definitions vary, but there is a clear core of common public values, such as transparency, accountability, effectiveness, and the rule of law. It is quite likely......, however, that national views of good governance reflect different political cultures and institutional heritages. Fourteen national codes of conduct are analyzed. The findings suggest that public values converge and that they match model codes from the United Nations and the European Council as well...... as conceptions of good governance from other international organizations. While values converge, they are balanced and communicated differently, and seem to some extent to be translated into the national cultures. The set of global public values derived from this analysis include public interest, regime dignity...
Energy Technology Data Exchange (ETDEWEB)
Ravishankar, C., Hughes Network Systems, Germantown, MD
1998-05-08
Speech is the predominant means of communication between human beings and since the invention of the telephone by Alexander Graham Bell in 1876, speech services have remained to be the core service in almost all telecommunication systems. Original analog methods of telephony had the disadvantage of speech signal getting corrupted by noise, cross-talk and distortion Long haul transmissions which use repeaters to compensate for the loss in signal strength on transmission links also increase the associated noise and distortion. On the other hand digital transmission is relatively immune to noise, cross-talk and distortion primarily because of the capability to faithfully regenerate digital signal at each repeater purely based on a binary decision. Hence end-to-end performance of the digital link essentially becomes independent of the length and operating frequency bands of the link Hence from a transmission point of view digital transmission has been the preferred approach due to its higher immunity to noise. The need to carry digital speech became extremely important from a service provision point of view as well. Modem requirements have introduced the need for robust, flexible and secure services that can carry a multitude of signal types (such as voice, data and video) without a fundamental change in infrastructure. Such a requirement could not have been easily met without the advent of digital transmission systems, thereby requiring speech to be coded digitally. The term Speech Coding is often referred to techniques that represent or code speech signals either directly as a waveform or as a set of parameters by analyzing the speech signal. In either case, the codes are transmitted to the distant end where speech is reconstructed or synthesized using the received set of codes. A more generic term that is applicable to these techniques that is often interchangeably used with speech coding is the term voice coding. This term is more generic in the sense that the
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.
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.
DEFF Research Database (Denmark)
Cox, Geoff
; alternatives to mainstream development, from performances of the live-coding scene to the organizational forms of commons-based peer production; the democratic promise of social media and their paradoxical role in suppressing political expression; and the market’s emptying out of possibilities for free...... development, Speaking Code unfolds an argument to undermine the distinctions between criticism and practice, and to emphasize the aesthetic and political aspects of software studies. Not reducible to its functional aspects, program code mirrors the instability inherent in the relationship of speech...... expression in the public realm. The book’s line of argument defends language against its invasion by economics, arguing that speech continues to underscore the human condition, however paradoxical this may seem in an era of pervasive computing....
Teaching medical terminology using word-matching games.
Nuetzman, Amy L; Abdullaev, Yalchin
2012-07-01
The use of word-matching games for classroom teaching of medical terminology to nursing and other health sciences students is described. Students work in small groups and match cards containing medical terms to cards containing their English translation. This approach encourages student-centered active learning and employs multiple modes of learning, including visual, auditory, kinesthetic, and text-based styles.
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.
Energy Technology Data Exchange (ETDEWEB)
Delbecq, J.M
1999-07-01
The Aster code is a 2D or 3D finite-element calculation code for structures developed by the R and D direction of Electricite de France (EdF). This dossier presents a complete overview of the characteristics and uses of the Aster code: introduction of version 4; the context of Aster (organisation of the code development, versions, systems and interfaces, development tools, quality assurance, independent validation); static mechanics (linear thermo-elasticity, Euler buckling, cables, Zarka-Casier method); non-linear mechanics (materials behaviour, big deformations, specific loads, unloading and loss of load proportionality indicators, global algorithm, contact and friction); rupture mechanics (G energy restitution level, restitution level in thermo-elasto-plasticity, 3D local energy restitution level, KI and KII stress intensity factors, calculation of limit loads for structures), specific treatments (fatigue, rupture, wear, error estimation); meshes and models (mesh generation, modeling, loads and boundary conditions, links between different modeling processes, resolution of linear systems, display of results etc..); vibration mechanics (modal and harmonic analysis, dynamics with shocks, direct transient dynamics, seismic analysis and aleatory dynamics, non-linear dynamics, dynamical sub-structuring); fluid-structure interactions (internal acoustics, mass, rigidity and damping); linear and non-linear thermal analysis; steels and metal industry (structure transformations); coupled problems (internal chaining, internal thermo-hydro-mechanical coupling, chaining with other codes); products and services. (J.S.)
Structured LDPC Codes over Integer Residue Rings
Directory of Open Access Journals (Sweden)
Mo Elisa
2008-01-01
Full Text Available Abstract This paper presents a new class of low-density parity-check (LDPC codes over represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their minimum Hamming distances. Simulation studies show that these structured codes, when transmitted using matched signal sets over an additive-white-Gaussian-noise channel, can outperform their random counterparts of similar length and rate.
Structured LDPC Codes over Integer Residue Rings
Directory of Open Access Journals (Sweden)
Marc A. Armand
2008-07-01
Full Text Available This paper presents a new class of low-density parity-check (LDPC codes over Ã¢Â„Â¤2a represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their minimum Hamming distances. Simulation studies show that these structured codes, when transmitted using matched signal sets over an additive-white-Gaussian-noise channel, can outperform their random counterparts of similar length and rate.
Code-Switching: L1-Coded Mediation in a Kindergarten Foreign Language Classroom
Lin, Zheng
2012-01-01
This paper is based on a qualitative inquiry that investigated the role of teachers' mediation in three different modes of coding in a kindergarten foreign language classroom in China (i.e. L2-coded intralinguistic mediation, L1-coded cross-lingual mediation, and L2-and-L1-mixed mediation). Through an exploratory examination of the varying effects…
Optimal codes as Tanner codes with cyclic component codes
DEFF Research Database (Denmark)
Høholdt, Tom; Pinero, Fernando; Zeng, Peng
2014-01-01
In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane of A(2,q) as the Tanner graph, and we are able to describe...... the codes succinctly using Gröbner bases....
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
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.
Institute of Scientific and Technical Information of China (English)
赖颖昕; 杨雷; 张世昌
2013-01-01
Based on the mode-matching method, an analytical model with full-wave coupling is presented for the coaxial Bragg structures corrugated with rectangular ripples, where the expressions of the reflectivity and transmission rate for each involved mode are derived. The validity of the analytical model is examined in terms of a reported experiment, and good agreement between the theoretical results and the experimental measurements is demonstrated. Comparative study is carried out between the present model and the published theoretical results. It is found that the approximate treatment adopted by the previous model leads to notable deviation of the transmission response curve due to the neglect of the evanescent modes excited by rectangular ripples. The analytical method presented in this paper can be expected to provide a useful approach to the characteristic investigation and engineering practice of the coaxial Bragg structures with rectangular ripples.%基于模式匹配法建立了矩形槽同轴布拉格结构的全波耦合分析模型，推导出了不同模式反射率和传输率的计算式，并采用公开报道的实验数据验证了该理论模型。在此基础上就本文理论与其他相关的理论方法进行了比较，发现以前的理论近似模型由于忽略了矩形槽中的消失模而使传输率的频率响应曲线发生偏差。本文建立的理论方法有望为矩形槽同轴布拉格结构的特性研究和工程实践提供一种理论分析手段。
A Fast Fractal Image Compression Coding Method
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
Fast algorithms for reducing encoding complexity of fractal image coding have recently been an important research topic. Search of the best matched domain block is the most computation intensive part of the fractal encoding process. In this paper, a fast fractal approximation coding scheme implemented on a personal computer based on matching in range block's neighbours is presented. Experimental results show that the proposed algorithm is very simple in implementation, fast in encoding time and high in compression ratio while PSNR is almost the same as compared with Barnsley's fractal block coding .
Efficient codes and balanced networks.
Denève, Sophie; Machens, Christian K
2016-03-01
Recent years have seen a growing interest in inhibitory interneurons and their circuits. A striking property of cortical inhibition is how tightly it balances excitation. Inhibitory currents not only match excitatory currents on average, but track them on a millisecond time scale, whether they are caused by external stimuli or spontaneous fluctuations. We review, together with experimental evidence, recent theoretical approaches that investigate the advantages of such tight balance for coding and computation. These studies suggest a possible revision of the dominant view that neurons represent information with firing rates corrupted by Poisson noise. Instead, tight excitatory/inhibitory balance may be a signature of a highly cooperative code, orders of magnitude more precise than a Poisson rate code. Moreover, tight balance may provide a template that allows cortical neurons to construct high-dimensional population codes and learn complex functions of their inputs.
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.
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
Doppler Compensation by using of Segmented Match Filter
Directory of Open Access Journals (Sweden)
Nader Ghadimi
2008-09-01
Full Text Available Match filter is one of the important parts of radar receiver. By using of Match Filter, the signal to noise ratio can be maximized so that the probability of detection is increased. Match Filter can be used as a pulse compression filter in radar receiver. Binary phase code is one of the pulse compression methods that, the compression can be down with a Match Filter in the receiver. Doppler effect is one of the problems that degrade the performance of Match Filter. In this paper, two methods “Mixer Array” and “Segmented Match Filter” are proposed for Doppler compensation. The operation of these two methods as Doppler compensation techniques are considered theoretically. The simulation is used to demonstrate the Doppler compensation performance of new techniques compared to conventional methods.
NOVEL BIPHASE CODE -INTEGRATED SIDELOBE SUPPRESSION CODE
Institute of Scientific and Technical Information of China (English)
Wang Feixue; Ou Gang; Zhuang Zhaowen
2004-01-01
A kind of novel binary phase code named sidelobe suppression code is proposed in this paper. It is defined to be the code whose corresponding optimal sidelobe suppression filter outputs the minimum sidelobes. It is shown that there do exist sidelobe suppression codes better than the conventional optimal codes-Barker codes. For example, the sidelobe suppression code of length 11 with filter of length 39 has better sidelobe level up to 17dB than that of Barker code with the same code length and filter length.
From concatenated codes to graph codes
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom
2004-01-01
We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...
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...
Continuous-variable quantum erasure correcting code
DEFF Research Database (Denmark)
Lassen, Mikael Østergaard; Sabuncu, Metin; Huck, Alexander
2010-01-01
We experimentally demonstrate a continuous variable quantum erasure-correcting code, which protects coherent states of light against complete erasure. The scheme encodes two coherent states into a bi-party entangled state, and the resulting 4-mode code is conveyed through 4 independent channels...
Report on HOM experimental methods and code
Shinton, I R R; Flisgen, T
2013-01-01
Experimental methods and various codes used are reported on with the aim to understand the signals picked up from the higher order modes in the third harmonic cavities within the ACC39 module at FLASH. Both commercial computer codes have been used, and also codes written for the express purpose of understanding the sensitivity of the modal profiles to geometrical errors and other sources of experimental errors.
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...
Structured non-coding RNAs and the RNP Renaissance
Hogg, J. Robert; Collins, Kathleen
2009-01-01
Summary Non-protein-coding (nc) RNAs are diverse in their modes of synthesis, processing, assembly, and function. The inventory of transcripts known or suspected to serve their biological roles as RNA has increased dramatically in recent years. Although studies of ncRNA function are only beginning to match the pace of ncRNA discovery, some principles are emerging. Here we focus on a framework for understanding functions of ncRNAs that have evolved in a protein-rich cellular environment, as distinct from ncRNAs that arose originally in the ancestral RNA World. The folding and function of ncRNAs in the context of ribonucleoprotein (RNP) complexes provide myriad opportunities for ncRNA gain of function, leading to a modern-day RNP Renaissance. PMID:18950732
Good Codes From Generalised Algebraic Geometry Codes
Jibril, Mubarak; Ahmed, Mohammed Zaki; Tjhai, Cen
2010-01-01
Algebraic geometry codes or Goppa codes are defined with places of degree one. In constructing generalised algebraic geometry codes places of higher degree are used. In this paper we present 41 new codes over GF(16) which improve on the best known codes of the same length and rate. The construction method uses places of small degree with a technique originally published over 10 years ago for the construction of generalised algebraic geometry codes.
Introducing ADAPTSMOOTH, a new code for the adaptive smoothing of astronomical images
Zibetti, Stefano
2009-01-01
We introduce and publicly release a new code, ADAPTSMOOTH, which serves to smooth astronomical images in an adaptive fashion, in order to enhance the signal-to-noise ratio (S/N). The adaptive smoothing scheme allows to take full advantage of the spatially resolved photometric information contained in an image in that at any location the minimal smoothing is applied to reach the requested S/N. Support is given to match more images on the same smoothing length, such that proper estimates of local colours can be done, with a big potential impact on multi-wavelength studies of extended sources (galaxies, nebulae). Different modes to estimate local S/N are provided. In addition to classical arithmetic-mean averaging mode, the code can operate in median averaging mode, resulting in a significant enhancement of the final image quality and very accurate flux conservation. To this goal also other code options are implemented and discussed in this paper. Finally, we analyze in great detail the effect of the adaptive sm...
Institute of Scientific and Technical Information of China (English)
靖恒珍; 徐善驾
2003-01-01
The radiation characteristics of a new millimeter-wave omnidirectional circular rod antenna with double dielectric gratins are analyzed with the rigorous mode matching method. The results indicate that under the condition of the same radiation intensity, the double grating antenna has relatively smaller dimensions than that of the single one. It is undoubtedly a great importance in the case where the limitation of the weight and volume of system is strictly required. The effectiveness and reliability of the present analysis are verified by the related results given in the literature.%采用严格的模匹配方法分析了新型双介质栅毫米波棒形全向天线的辐射特性.结果表明,在辐射条件相同的情况下,双栅天线比单栅天线有更小的几何尺寸.这在对系统的重量和体积有严格限制的应用场合无疑具有重要意义.文中所得的结果与文献中相关数据的比较证明了本文分析的有效性和可靠性.
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.
Institute of Scientific and Technical Information of China (English)
王玉芳; 严洪森
2014-01-01
为了评价企业当前知识化制造模式与动态环境因素的匹配性，为企业的快速响应提供依据，提出了一种考虑模糊输入和不均衡样本的非线性模糊加权支持向量机（NFW-SVM）模型。考虑到实际生产面临的动态环境因素具有模糊性和不确定性，引入三角模糊数对模糊因素进行描述。针对不同匹配类别数据样本的不均衡性，设置了不同的分类惩罚因子，以降低小样本错分的比例。将变异算子和具有收缩因子的动态惯性权重引入到标准粒子群优化算法中，利用改进的粒子群算法对模型参数进行优化，提高模型的分类精度。给出了基于NFW-SVM模型的知识化制造模式与动态环境匹配的分类方法。最后，通过实例验证了该方法的有效性和可行性。%To correctly judge the matching category between current knowledgeable manufacturing mode and dynamic environment factors,and provide the basis for rapid response,a model of nonlin-ear fuzzy weight-support vector machine (NFW-SVM)is proposed in which fuzzy inputs and imbal-ance of the different matching categories of samples are considered.Considering the vagueness and uncertainty of the dynamic production environment in the actual production,the triangular fuzzy number is adopted to describe the vague factor.For the imbalance characters of the data sample in different categories,different category penalty factors are set up in the model to reduce the fault pro-portions of small samples.The mutation operator and dynamic inertia weight with constriction factors are introduced to the standard particle swarm optimization algorithm.To enhance the classification accuracy,the model parameters are optimized by the improved particle swarm optimization algo-rithm.The classification method based on NFW-SVM to judge the matching category between dy-namic environment factors and current manufacturing mode is presented.Finally,the effectiveness and
Discriminative sparse coding on multi-manifolds
Wang, J.J.-Y.
2013-09-26
Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.
Directory of Open Access Journals (Sweden)
Hai Wang
2016-01-01
Full Text Available A method of transforming high-order Gaussian beams (GBs mode into circular symmetry fundamental Gaussian beam (FGB mode with arbitrary waist size is presented using irradiance moments method in quasi-optical (QO mode converters. The double shaped mirrors correcting amplitude and phase simultaneously are generated by a single incidence irradiance sampling data and known ideal output FGB taking advantage of linear moment matching technique and Fresnel diffraction theory, which can be applied to a wide frequency range especially significant for terahertz band. The numerical coding procedure of creating double correcting mirrors and its fast convergence speed are discussed at 325 GHz. Numerical and experimental comparisons reveal the conclusion that enhancing surface precision and increasing moments order can improve main lobe levels.
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...
DEFF Research Database (Denmark)
Martins, Bo; Forchhammer, Søren
2000-01-01
The emerging international standard for compression of bilevel images and bi-level documents, JBIG2,provides a mode dedicated for lossy coding of halftones. The encoding procedure involves descreening of the bi-levelimage into gray-scale, encoding of the gray-scale image, and construction...... and care must be taken to avoid introducing artifacts in the reconstructed image. We describe how to apply this coding method for halftones created by periodic ordered dithering, by clustered dot screening (offset printing), and by techniques which in effect dithers with blue noise, e.g., error diffusion....... Besides descreening and construction of the dictionary, we address graceful degradationand artifact removal....
Supersymmetric mode converters
Heinrich, Matthias; Miri, Mohammad-Ali; Stützer, Simon; Nolte, Stefan; Szameit, Alexander; Christodoulides, Demetrios N.
2015-08-01
In recent years, the ever-increasing demand for high-capacity transmission systems has driven remarkable advances in technologies that encode information on an optical signal. Mode-division multiplexing makes use of individual modes supported by an optical waveguide as mutually orthogonal channels. The key requirement in this approach is the capability to selectively populate and extract specific modes. Optical supersymmetry (SUSY) has recently been proposed as a particularly elegant way to resolve this design challenge in a manner that is inherently scalable, and at the same time maintains compatibility with existing multiplexing strategies. Supersymmetric partners of multimode waveguides are characterized by the fact that they share all of their effective indices with the original waveguide. The crucial exception is the fundamental mode, which is absent from the spectrum of the partner waveguide. Here, we demonstrate experimentally how this global phase-matching property can be exploited for efficient mode conversion. Multimode structures and their superpartners are experimentally realized in coupled networks of femtosecond laser-written waveguides, and the corresponding light dynamics are directly observed by means of fluorescence microscopy. We show that SUSY transformations can readily facilitate the removal of the fundamental mode from multimode optical structures. In turn, hierarchical sequences of such SUSY partners naturally implement the conversion between modes of adjacent order. Our experiments illustrate just one of the many possibilities of how SUSY may serve as a building block for integrated mode-division multiplexing arrangements. Supersymmetric notions may enrich and expand integrated photonics by versatile optical components and desirable, yet previously unattainable, functionalities.
Space Time Codes from Permutation Codes
Henkel, Oliver
2006-01-01
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths, a result that has been conjectured already in previous work. Further, the connection to permutation codes allows for moderate complex en-/decoding algorithms.
The Role of Schema Matching in Large Enterprises
Smith, Ken; Mork, Peter; Li, Maya; Rosenthal, Arnon; Allen, David; Seligman, Len; Wolf, Chris
2009-01-01
To date, the principal use case for schema matching research has been as a precursor for code generation, i.e., constructing mappings between schema elements with the end goal of data transfer. In this paper, we argue that schema matching plays valuable roles independent of mapping construction, especially as schemata grow to industrial scales. Specifically, in large enterprises human decision makers and planners are often the immediate consumer of information derived from schema matchers, instead of schema mapping tools. We list a set of real application areas illustrating this role for schema matching, and then present our experiences tackling a customer problem in one of these areas. We describe the matcher used, where the tool was effective, where it fell short, and our lessons learned about how well current schema matching technology is suited for use in large enterprises. Finally, we suggest a new agenda for schema matching research based on these experiences.
Fundamentals of convolutional coding
Johannesson, Rolf
2015-01-01
Fundamentals of Convolutional Coding, Second Edition, regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field * Two new chapters on low-density parity-check (LDPC) convolutional codes and iterative coding * Viterbi, BCJR, BEAST, list, and sequential decoding of convolutional codes * Distance properties of convolutional codes * Includes a downloadable solutions manual
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.
Low Complexity for Scalable Video Coding Extension of H.264 based on the Complexity of Video
Directory of Open Access Journals (Sweden)
Mayada Khairy
2016-12-01
Full Text Available Scalable Video Coding (SVC / H.264 is one type of video compression techniques. Which provided more reality in dealing with video compression to provide an efficient video coding based on H.264/AVC. This ensures higher performance through high compression ratio. SVC/H.264 is a complexity technique whereas the takes considerable time for computation the best mode of macroblock and motion estimation through using the exhaustive search techniques. This work reducing the processing time through matching between the complexity of the video and the method of selection macroblock and motion estimation. The goal of this approach is reducing the encoding time and improving the quality of video stream the efficiency of the proposed approach makes it suitable for are many applications as video conference application and security application.
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.
Institute of Scientific and Technical Information of China (English)
Li Lian-Huang; Guo Fu-Yuan
2009-01-01
This paper analyzes the characteristic of matching efficiency between the fundamental mode of two kinds of optical waveguides and its Gaussian approximate field.Then, it presents a new method where the mode-field half-width of Gaussian approximation for the fundamental mode should be defined according to the maximal matching efficiency method. The relationship between the mode-field half-width of the Gaussian approximate field obtained from the maximal matching efficiency and normalized frequency is studied; furthermore, two formulas of mode-field half-widths as a function of normalized frequency are proposed.
A CODING SCHEME USING GLOBAL MOTION ESTIMATION FOR AVS P-FRAME
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
Block matching has been used for motion estimation and motion compensation in the Audio and Video Standard (AVS) for years. While having an acceptable performance in describing motion between frames, it requires quite a few bits to represent the motion vectors. In certain circumstances, the use of global motion estimation and compensation would perform equally well or even better than the block matching in terms of motion accuracy, while it results in the coding of global motion model parameters. In this letter, we modify an AVS coder by adding (1) six global motion model parameters to the frame header, and (2) mode selection among INTRA, SKIP, INTER-16×16,INTER-16×8, INTER-8×16, INTER-8×8, and Global Motion Compensation (GMC) modes by Lagrange optimal rate-distortion criteria. Simulation results demonstrate that over 0.1dB improvement in PSNR is obtained compared to the AVS coder for an average coded P-frame with the same bitrate.
Strong Trinucleotide Circular Codes
Directory of Open Access Journals (Sweden)
Christian J. Michel
2011-01-01
Full Text Available Recently, we identified a hierarchy relation between trinucleotide comma-free codes and trinucleotide circular codes (see our previous works. Here, we extend our hierarchy with two new classes of codes, called DLD and LDL codes, which are stronger than the comma-free codes. We also prove that no circular code with 20 trinucleotides is a DLD code and that a circular code with 20 trinucleotides is comma-free if and only if it is a LDL code. Finally, we point out the possible role of the symmetric group ∑4 in the mathematical study of trinucleotide circular codes.
UNIT-RATE COMPLEX ORTHOGONAL SPACE-TIME BLOCK CODE CONCATENATED WITH TURBO CODING
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Space-Time Block (STB) code has been an effective transmit diversity technique for combating fading due to its orthogonal design, simple decoding and high diversity gains. In this paper, a unit-rate complex orthogonal STB code for multiple antennas in Time Division Duplex (TDD) mode is proposed. Meanwhile, Turbo Coding (TC) is employed to improve the performance of proposed STB code further by utilizing its good ability to combat the burst error of fading channel. Compared with full-diversity multiple antennas STB codes, the proposed code can implement unit rate and partial diversity; and it has much smaller computational complexity under the same system throughput. Moreover, the application of TC can effectively make up for the performance loss due to partial diversity. Simulation results show that on the condition of same system throughput and concatenation of TC, the proposed code has lower Bit Error Rate (BER) than those full-diversity codes.
Kangaroo – A pattern-matching program for biological sequences
Directory of Open Access Journals (Sweden)
Betel Doron
2002-07-01
Full Text Available Abstract Background Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do not provide straightforward or readily available query tools to perform simple searches, such as identifying transcription binding sites, protein motifs, or repetitive DNA sequences. However, in many cases simple pattern-matching searches can reveal a wealth of information. We present in this paper a regular expression pattern-matching tool that was used to identify short repetitive DNA sequences in human coding regions for the purpose of identifying potential mutation sites in mismatch repair deficient cells. Results Kangaroo is a web-based regular expression pattern-matching program that can search for patterns in DNA, protein, or coding region sequences in ten different organisms. The program is implemented to facilitate a wide range of queries with no restriction on the length or complexity of the query expression. The program is accessible on the web at http://bioinfo.mshri.on.ca/kangaroo/ and the source code is freely distributed at http://sourceforge.net/projects/slritools/. Conclusion A low-level simple pattern-matching application can prove to be a useful tool in many research settings. For example, Kangaroo was used to identify potential genetic targets in a human colorectal cancer variant that is characterized by a high frequency of mutations in coding regions containing mononucleotide repeats.
Vein matching using artificial neural network in vein authentication systems
Noori Hoshyar, Azadeh; Sulaiman, Riza
2011-10-01
Personal identification technology as security systems is developing rapidly. Traditional authentication modes like key; password; card are not safe enough because they could be stolen or easily forgotten. Biometric as developed technology has been applied to a wide range of systems. According to different researchers, vein biometric is a good candidate among other biometric traits such as fingerprint, hand geometry, voice, DNA and etc for authentication systems. Vein authentication systems can be designed by different methodologies. All the methodologies consist of matching stage which is too important for final verification of the system. Neural Network is an effective methodology for matching and recognizing individuals in authentication systems. Therefore, this paper explains and implements the Neural Network methodology for finger vein authentication system. Neural Network is trained in Matlab to match the vein features of authentication system. The Network simulation shows the quality of matching as 95% which is a good performance for authentication system matching.
The effective degeneracy of protein normal modes.
Na, Hyuntae; Song, Guang
2016-05-12
Normal modes are frequently computed and used to portray protein dynamics and interpret protein conformational changes. In this work, we investigate the nature of normal modes and find that the normal modes of proteins, especially those at the low frequency range (0-600 cm(-1)), are highly susceptible to degeneracy. Two or more modes are degenerate if they have the same frequency and consequently any orthogonal transformation of them also is a valid representation of the mode subspace. Thus, degenerate modes can no longer characterize unique directions of motions as regular modes do. Though the normal modes of proteins are usually of different frequencies, the difference in frequency between neighboring modes is so small that, under even slight structural uncertainty that unavoidably exists in structure determination, it can easily vanish and as a result, a mode becomes effectively degenerate with its neighboring modes. This can be easily observed in that some modes seem to disappear and their matching modes cannot be found when the structure used to compute the modes is modified only slightly. We term this degeneracy the effective degeneracy of normal modes. This work is built upon our recent discovery that the vibrational spectrum of globular proteins is universal. The high density of modes observed in the vibrational frequency spectra of proteins renders their normal modes highly susceptible to degeneracy, under even the smallest structural uncertainty. Indeed, we find the degree of degeneracy of modes is proportional to the density of modes in the vibrational spectrum. This means that for modes at the same frequency, degeneracy is more severe for larger proteins. Degeneracy exists also in the modes of coarse-grained models, but to a much lesser extent than those of all-atom models. In closing, we discuss the implications of the effective degeneracy of normal modes: how it may significantly affect the ways in which normal modes are used in various normal modes
Joint source channel coding using arithmetic codes
Bi, Dongsheng
2009-01-01
Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. In this monograph, we propose a new way of looking at arithmetic codes with forbidden symbols. If a limit is imposed on the maximum value of a key parameter in the encoder, this modified arithmetic encoder can also be modeled as a finite state machine and the code generated can be treated as a variable-length trellis code. The number of states used can be reduced and techniques used fo
DEFF Research Database (Denmark)
Martins, Bo; Forchhammer, Søren
2000-01-01
of a halftone pattern dictionary.The decoder first decodes the gray-scale image. Then for each gray-scale pixel looks up the corresponding halftonepattern in the dictionary and places it in the reconstruction bitmap at the position corresponding to the gray-scale pixel. The coding method is inherently lossy......The emerging international standard for compression of bilevel images and bi-level documents, JBIG2,provides a mode dedicated for lossy coding of halftones. The encoding procedure involves descreening of the bi-levelimage into gray-scale, encoding of the gray-scale image, and construction...... and care must be taken to avoid introducing artifacts in the reconstructed image. We describe how to apply this coding method for halftones created by periodic ordered dithering, by clustered dot screening (offset printing), and by techniques which in effect dithers with blue noise, e.g., error diffusion...
Increasing the resolution of photoelectric angle-to-code converters
Energy Technology Data Exchange (ETDEWEB)
Zakharov, L.P.
1986-04-01
The authors describe a circuit for processing the signal of the auxiliary photodetector of a converter of angular shaft displacement to code; it increases the resolution of the converter by two or three orders without increasing the number of code tracks. Ther permissible reading error for all bits of the main code except for the least-significant can be half of the width of a code element of the less-bit track. The auxiliary and main codes are matched and are represented by the output binary code.
An Implementation of the Frequency Matching Method
DEFF Research Database (Denmark)
Lange, Katrine; Frydendall, Jan; Hansen, Thomas Mejer
During the last decade multiple-point statistics has become in-creasingly popular as a tool for incorporating complex prior infor-mation when solving inverse problems in geosciences. A variety of methods have been proposed but often the implementation of these is not straightforward. One of these......During the last decade multiple-point statistics has become in-creasingly popular as a tool for incorporating complex prior infor-mation when solving inverse problems in geosciences. A variety of methods have been proposed but often the implementation of these is not straightforward. One...... of these methods is the recently proposed Frequency Matching method to compute the maximum a posteriori model of an inverse problem where multiple-point statistics, learned from a training image, is used to formulate a closed form expression for an a priori probability density function. This paper discusses...... aspects of the implementation of the Fre-quency Matching method and the techniques adopted to make it com-putationally feasible also for large-scale inverse problems. The source code is publicly available at GitHub and this paper also provides an example of how to apply the Frequency Matching method...
One-loop effective lagrangians after matching
Energy Technology Data Exchange (ETDEWEB)
Aguila, F. del; Santiago, J. [Universidad de Granada, Departamento de Fisica Teorica y del Cosmos and CAFPE, Granada (Spain); Kunszt, Z. [ETH Zuerich, Institute for Theoretical Physics, Zuerich (Switzerland)
2016-05-15
We discuss the limitations of the covariant derivative expansion prescription advocated to compute the one-loop Standard Model (SM) effective lagrangian when the heavy fields couple linearly to the SM. In particular, one-loop contributions resulting from the exchange of both heavy and light fields must be explicitly taken into account through matching because the proposed functional approach alone does not account for them. We review a simple case with a heavy scalar singlet of charge -1 to illustrate the argument. As two other examples where this matching is needed and this functional method gives a vanishing result, up to renormalization of the heavy sector parameters, we re-evaluate the one-loop corrections to the T-parameter due to a heavy scalar triplet with vanishing hypercharge coupling to the Brout-Englert-Higgs boson and to a heavy vector-like quark singlet of charged 2/3 mixing with the top quark, respectively. In all cases we make use of a new code for matching fundamental and effective theories in models with arbitrary heavy field additions. (orig.)
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. .
Strength evaluation code STEP for brittle materials
Energy Technology Data Exchange (ETDEWEB)
Ishihara, Masahiro [Japan Atomic Energy Research Inst., Oarai, Ibaraki (Japan). Oarai Research Establishment; Futakawa, Masatoshi
1997-12-01
In a structural design using brittle materials such as graphite and/or ceramics it is necessary to evaluate the strength of component under complex stress condition. The strength of ceramic materials is said to be influenced by the stress distribution. However, in the structural design criteria simplified stress limits had been adopted without taking account of the strength change with the stress distribution. It is, therefore, important to evaluate the strength of component on the basis of the fracture model for brittle material. Consequently, the strength evaluation program, STEP, on a brittle fracture of ceramic materials based on the competing risk theory had been developed. Two different brittle fracture modes, a surface layer fracture mode dominated by surface flaws and an internal fracture mode by internal flaws, are treated in the STEP code in order to evaluate the strength of brittle fracture. The STEP code uses stress calculation results including complex shape of structures analyzed by the generalized FEM stress analysis code, ABAQUS, so as to be possible to evaluate the strength of brittle fracture for the structures having complicate shapes. This code is, therefore, useful to evaluate the structural integrity of arbitrary shapes of components such as core graphite components in the HTTR, heat exchanger components made of ceramics materials etc. This paper describes the basic equations applying to the STEP code, code system with a combination of the STEP and the ABAQUS codes and the result of the verification analysis. (author)
New Mexico Univ., Albuquerque. American Indian Law Center.
The Model Children's Code was developed to provide a legally correct model code that American Indian tribes can use to enact children's codes that fulfill their legal, cultural and economic needs. Code sections cover the court system, jurisdiction, juvenile offender procedures, minor-in-need-of-care, and termination. Almost every Code section is…
Line matching based on planar homography for stereo aerial images
Sun, Yanbiao; Zhao, Liang; Huang, Shoudong; Yan, Lei; Dissanayake, Gamini
2015-06-01
We propose an efficient line matching algorithm for a pair of calibrated aerial photogrammetric images, which makes use of sparse 3D points triangulated from 2D point feature correspondences to guide line matching based on planar homography. Two different strategies are applied in the proposed line matching algorithm for two different cases. When three or more points can be found coplanar with the line segment to be matched, the points are used to fit a plane and obtain an accurate planar homography. When one or two points can be found, the approximate terrain plane parallel to the line segment is utilized to compute an approximate planar homography. Six pairs of rural or urban aerial images are used to demonstrate the efficiency and validity of the proposed algorithm. Compared with line matching based on 2D point feature correspondences, the proposed method can increase the number of correctly matched line segments. In addition, compared with most line matching methods that do not use 2D point feature correspondences, the proposed method has better efficiency, although it obtains fewer matches. The C/C++ source code for the proposed algorithm is available at
Spatial mode discrimination using second harmonic generation
DEFF Research Database (Denmark)
Delaubert, Vincent; Lassen, Mikael Østergaard; Pulford, David
2007-01-01
Second harmonic generation can be used as a technique for controlling the spatial mode structure of optical beams. We demonstrate experimentally the generation of higher order spatial modes, and that it is possible to use nonlinear phase matching as a predictable and robust technique for the conv...
Spatial mode discrimination using second harmonic generation
DEFF Research Database (Denmark)
Delaubert, Vincent; Lassen, Mikael Østergaard; Pulford, David
2007-01-01
Second harmonic generation can be used as a technique for controlling the spatial mode structure of optical beams. We demonstrate experimentally the generation of higher order spatial modes, and that it is possible to use nonlinear phase matching as a predictable and robust technique for the conv...
Identifying personal microbiomes using metagenomic codes.
Franzosa, Eric A; Huang, Katherine; Meadow, James F; Gevers, Dirk; Lemon, Katherine P; Bohannan, Brendan J M; Huttenhower, Curtis
2015-06-02
Community composition within the human microbiome varies across individuals, but it remains unknown if this variation is sufficient to uniquely identify individuals within large populations or stable enough to identify them over time. We investigated this by developing a hitting set-based coding algorithm and applying it to the Human Microbiome Project population. Our approach defined body site-specific metagenomic codes: sets of microbial taxa or genes prioritized to uniquely and stably identify individuals. Codes capturing strain variation in clade-specific marker genes were able to distinguish among 100s of individuals at an initial sampling time point. In comparisons with follow-up samples collected 30-300 d later, ∼30% of individuals could still be uniquely pinpointed using metagenomic codes from a typical body site; coincidental (false positive) matches were rare. Codes based on the gut microbiome were exceptionally stable and pinpointed >80% of individuals. The failure of a code to match its owner at a later time point was largely explained by the loss of specific microbial strains (at current limits of detection) and was only weakly associated with the length of the sampling interval. In addition to highlighting patterns of temporal variation in the ecology of the human microbiome, this work demonstrates the feasibility of microbiome-based identifiability-a result with important ethical implications for microbiome study design. The datasets and code used in this work are available for download from huttenhower.sph.harvard.edu/idability.
Least-Square Prediction for Backward Adaptive Video Coding
2006-01-01
Almost all existing approaches towards video coding exploit the temporal redundancy by block-matching-based motion estimation and compensation. Regardless of its popularity, block matching still reflects an ad hoc understanding of the relationship between motion and intensity uncertainty models. In this paper, we present a novel backward adaptive approach, named "least-square prediction" (LSP), and demonstrate its potential in video coding. Motivated by the duality between edge contour in im...
A multi-moded rf delay line distribution system for the next linear collider
Energy Technology Data Exchange (ETDEWEB)
Tantawi, S.G.; Bowden, G.; Farkas, Z.D.; Irwin, J.; Ko, K.; Kroll, N.; Lavine, T.; Li, Z.; Loewen, R.; Miller, R.; Nantista, C.; Ruth, R.D.; Rifkin, J.; Vlieks, A.E.; Wilson, P.B.; Adolphsen, C.; Wang, J. [Stanford Linear Accelerator Center, SLAC, 2575 Sand Hill Rd, Mento Park, California 94025 (United States)
1999-07-01
The Delay Line Distribution System (DLDS) (1) is an alternative to conventional pulse compression which enhances the peak power of an rf source while matching the long pulse of that source to the shorter filling time of the accelerator structure. We present a variation on that scheme that combines the parallel delay lines of the system into one single line. The power of several sources is combined into a single waveguide delay line using a multi-mode launcher. The output mode of the launcher is determined by the phase coding of the input signals. The combined power is extracted using several mode extractors, each of which extracts only one single mode. Hence, the phase coding of the sources controls the output port of the combined power. The power is then fed to the local accelerator structures. We present a detailed design of such a system, including several implementation methods for the launchers, extractors, and ancillary high power rf components. The system is designed so that it can handle the 600 MW peak power required by the NLC design, while maintaining high efficiency. {copyright} {ital 1999 American Institute of Physics.}
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.
Induced optical metric in the non-impedance-matched media
Mousavi, S. A.; Roknizadeh, R.; Sahebdivan, S.
2016-11-01
In non-magnetic anisotropic media, the behavior of electromagnetic waves depends on the polarization and direction of the incident light. Therefore, to tame the unwanted wave responses such as polarization dependent reflections, the artificial impedance-matched media are suggested to be used in optical devices like invisibility cloak or super lenses. Nevertheless, developing the impedance-matched media is far from trivial in practice. In this paper, we are comparing the samples of both impedance-matched and non-impedance-matched (non-magnetic) media regarding their electromagnetic response in constructing a well-defined optical metric. In the case of similar anisotropic patterns, we show that the optical metric in an impedance-matched medium for unpolarized light is the same as the optical metric of an electrical birefringent medium when the extraordinary mode is concerned. By comparing the eikonal equation in an empty curved space-time and its counterparts in the medium, we have shown that a non-impedance-matched medium can resemble an optical metric for a particular polarization. As an example of non-impedance-matched materials, we are studying a medium with varying optical axis profile. We show that such a medium can be an alternative to impedance-matched materials in various optical devices.
DEFF Research Database (Denmark)
Sørensen, Jesper Hemming; Koike-Akino, Toshiaki; Orlik, Philip
2012-01-01
This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both...... the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding....
Walsh, Daniel K.; Dubin, Daniel H. E.
2015-11-01
This poster presents theory and numerical calculations of electrostatic Bernstein modes in an inhomogeneous cylindrical plasma column. These modes rely on FLR effects to propagate radially across the column until they are reflected when their frequency matches the local upper hybrid frequency, setting up an internal normal mode on the column, and also mode-coupling to the electrostatic surface cyclotron wave (which allows the normal mode to be excited and observed using external electrodes). Numerical results predicting the mode spectra, using a novel linear Vlasov code on a cylindrical grid, will be presented and compared to an analytic WKB theory. A previous version of the theory expanded the plasma response in powers of 1/B, approximating the local upper hybrid frequency, and consequently its frequency predictions are shifted with respect to the numerical results. A new version of the WKB theory uses the exact cold fluid plasma response and does a better job of reproducing the numerical frequency spectrum. The eventual goal is to compare the theory to recent experiments that have observed these waves in pure electron and pure ion plasmas. Supported by National Science Foundation Grant PHY-1414570.
Three Methods for Occupation Coding Based on Statistical Learning
Directory of Open Access Journals (Sweden)
Gweon Hyukjun
2017-03-01
Full Text Available Occupation coding, an important task in official statistics, refers to coding a respondent’s text answer into one of many hundreds of occupation codes. To date, occupation coding is still at least partially conducted manually, at great expense. We propose three methods for automatic coding: combining separate models for the detailed occupation codes and for aggregate occupation codes, a hybrid method that combines a duplicate-based approach with a statistical learning algorithm, and a modified nearest neighbor approach. Using data from the German General Social Survey (ALLBUS, we show that the proposed methods improve on both the coding accuracy of the underlying statistical learning algorithm and the coding accuracy of duplicates where duplicates exist. Further, we find defining duplicates based on ngram variables (a concept from text mining is preferable to one based on exact string matches.
Abraham, Nikhil
2015-01-01
Hands-on exercises help you learn to code like a pro No coding experience is required for Coding For Dummies,your one-stop guide to building a foundation of knowledge inwriting computer code for web, application, and softwaredevelopment. It doesn't matter if you've dabbled in coding or neverwritten a line of code, this book guides you through the basics.Using foundational web development languages like HTML, CSS, andJavaScript, it explains in plain English how coding works and whyit's needed. Online exercises developed by Codecademy, a leading online codetraining site, help hone coding skill
Gao, Wen
2015-01-01
This comprehensive and accessible text/reference presents an overview of the state of the art in video coding technology. Specifically, the book introduces the tools of the AVS2 standard, describing how AVS2 can help to achieve a significant improvement in coding efficiency for future video networks and applications by incorporating smarter coding tools such as scene video coding. Topics and features: introduces the basic concepts in video coding, and presents a short history of video coding technology and standards; reviews the coding framework, main coding tools, and syntax structure of AV
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.
DITEC: Technology Matching Tool (TMT)
2016-08-01
Released by Jose Romero-Mariona, Head Network Security Engineering Services and Operations Branch Under authority of Elissa J...Commanding Officer C. A. Keeney Executive Director ADMINISTRATIVE INFORMATION The work described in this report was performed by the Network Security...Engineering Services and Operations Branch (Code 58230) of the Information Assurance Division (Code 58000), Space and Naval Warfare Systems Center
Mode Competition in Dual-Mode Quantum Dots Semiconductor Microlaser
Chusseau, Laurent; Viktorovitch, P; Letartre, Xavier
2013-01-01
This paper describes the modeling of quantum dots lasers with the aim of assessing the conditions for stable cw dual-mode operation when the mode separation lies in the THz range. Several possible models suited for InAs quantum dots in InP barriers are analytically evaluated, in particular quantum dots electrically coupled through a direct exchange of excitation by the wetting layer or quantum dots optically coupled through the homogeneous broadening of their optical gain. A stable dual-mode regime is shown possible in all cases when quantum dots are used as active layer whereas a gain medium of quantum well or bulk type inevitably leads to bistable behavior. The choice of a quantum dots gain medium perfectly matched the production of dual-mode lasers devoted to THz generation by photomixing.
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).
Single integrated device for optical CDMA code processing in dual-code environment.
Huang, Yue-Kai; Glesk, Ivan; Greiner, Christoph M; Iazkov, Dmitri; Mossberg, Thomas W; Wang, Ting; Prucnal, Paul R
2007-06-11
We report on the design, fabrication and performance of a matching integrated optical CDMA encoder-decoder pair based on holographic Bragg reflector technology. Simultaneous encoding/decoding operation of two multiple wavelength-hopping time-spreading codes was successfully demonstrated and shown to support two error-free OCDMA links at OC-24. A double-pass scheme was employed in the devices to enable the use of longer code length.
All-fiber mode selective couplers for mode-division-multiplexed optical transmission
Chang, Sun Hyok; Kim, Kwangjoon; Lee, Joon Ki
2017-01-01
All-fiber mode selective coupler (MSC) is comprised of a few mode fiber (FMF) and a single mode fiber (SMF), coupling the LP01 mode of the SMF to a specific higher-order mode (HOM) of the FMF. In order to achieve high coupling ratio and low insertion loss, phase-matching condition between the LP01 mode of SMF arm and the HOM of FMF arm should be satisfied. A polished-type MSC is made by getting their cores into intimate contact. Prism coupling with a polished coupler block can measure the effective refractive index of the mode accurately. We propose and demonstrate three kinds of allfiber mode multiplexer that is composed of consecutive MSCs. 4-mode multiplexer can multiplex 4 modes of LP01, LP11, LP21, and LP02 by cascading LP11, LP21, and LP02 MSCs. It is used for MDM transmission of three modes with 120 Gb/s DP-QPSK signals. In order to enhance the signal transmission performance by receiving degenerate LP modes simultaneously, a mode multiplexer to utilize two-fold degenerate LP11 modes is proposed. It is composed of two consecutive LP11 MSCs that allows the multiplexing of LP01 mode and two orthogonal LP11 modes. We demonstrates WDM transmission of 30 wavelength channels with 33.3 GHz spacing, each carrying 3 modes, over 560 km of FMF. 6- mode multiplexer can multiplex 6 modes of LP01, LP11a, LP11b, LP21a, LP21b, LP02 modes. We demonstrated WDM-MDM transmission with the all-fiber 6-mode multiplexer. In this paper, the manufacturing method and the recent advancements of the all-fiber mode multiplexer based on the MSCs are reviewed. Long-distance mode division multiplexing (MDM) optical signal transmissions with the all-fiber mode multiplexer are experimentally demonstrated.
Complex coupled-mode theory for optical waveguides.
Huang, Wei-Ping; Mu, Jianwei
2009-10-12
A coupled-mode formulation is described in which the radiation fields are represented in terms of discrete complex modes. The complex modes are obtained from a waveguide model facilitated by the combination of perfectly matched boundary (PML) and perfectly reflecting boundary (PRB) condition. By proper choice of the PML parameters, the guided modes of the structure remain unchanged, whereas the continuous radiation modes are discretized into orthogonal and normalizable complex quasi-leaky and PML modes. The complex coupled-mode formulation is identical to that for waveguides with loss and/or gain and can be solved by similar analytical and numerical techniques. By identifying the phase-matching conditions between the complex modes, the coupled mode formulation may be further simplified to yield analytical solutions. The complex coupled-mode theory is applied to Bragg grating in slab waveguides and validated by rigorous mode-matching method. It is for the first time that we can treat guided and radiation field in a unified and straightforward fashion without having to resort to cumbersome radiation modes. Highly accurate and insightful results are obtained with consideration of only the nearly phase-matched modes.
New Methods for Lossless Image Compression Using Arithmetic Coding.
Howard, Paul G.; Vitter, Jeffrey Scott
1992-01-01
Identifies four components of a good predictive lossless image compression method: (1) pixel sequence, (2) image modeling and prediction, (3) error modeling, and (4) error coding. Highlights include Laplace distribution and a comparison of the multilevel progressive method for image coding with the prediction by partial precision matching method.…
Locally Orderless Registration Code
DEFF Research Database (Denmark)
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
Locally orderless registration code
DEFF Research Database (Denmark)
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
Schneider, P. A.; Bustos, A.; Hennequin, P.; Ryter, F.; Bernert, M.; Cavedon, M.; Dunne, M. G.; Fischer, R.; Görler, T.; Happel, T.; Igochine, V.; Kurzan, B.; Lebschy, A.; McDermott, R. M.; Morel, P.; Willensdorfer, M.; the ASDEX Upgrade Team; The EUROfusion MST1 Team
2017-06-01
In ASDEX Upgrade (AUG), the normalised gyroradius {ρ\\star} was varied via a hydrogen isotope scan while keeping other dimensionless parameters constant. This was done in L-mode, to minimise the impact of pedestal stability on confinement. Power balance and perturbative transport analyses reveal that the electron heat transport is unaffected by the differences in isotope mass. Nonlinear simulations with the Gene code suggest that these L-mode discharges are ion temperature gradient (ITG) dominated. The different gyroradii due to the isotope mass do not necessarily result in a change of the predicted heat fluxes. This result is used in simulations with the Astra transport code to match the experimental profiles. In these simulations the experimental profiles and confinement times are reproduced with the same transport coefficients for hydrogen and deuterium plasmas. The mass only enters in the energy exchange term between electrons and ions. These numerical observations are supported by additional experiments which show a lower ion energy confinement compared to that of the electrons. Additionally, hydrogen and deuterium plasmas have a similar confinement when the energy exchange time between electrons and ions is matched. This strongly suggests that the observed isotope dependence in L-mode is not dominated by a gyroradius effect, but a consequence of the mass dependence in the collisional energy exchange between electrons and ions.
DEFF Research Database (Denmark)
Jakobsen, K. P.; Burcharth, H. F.; Ibsen, Lars Bo;
1999-01-01
The present appendix contains the derivation of ten different limit state equations divided on three different failure modes. Five of the limit state equations can be used independently of the characteristics of the subsoil, whereas the remaining five can be used for either drained or undrained...
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...
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.
Propensity score matching: A conceptual review for radiology researchers
Energy Technology Data Exchange (ETDEWEB)
Baek, Seung Hee; Park, Seong Ho; Park, Yu Rang; Kim, Hwa Jung [Asan Medical Center, University of Ulsan College of Medicine, Seoul (Korea, Republic of); Won, Eugene [Dept. of Radiology, NYU Langone Medical Center, New York (Korea, Republic of)
2015-04-15
The propensity score is defined as the probability of each individual study subject being assigned to a group of interest for comparison purposes. Propensity score adjustment is a method of ensuring an even distribution of confounders between groups, thereby increasing between group comparability. Propensity score analysis is therefore an increasingly applied statistical method in observational studies. The purpose of this article was to provide a step-by-step nonmathematical conceptual guide to propensity score analysis with particular emphasis on propensity score matching. A software program code used for propensity score matching was also presented.
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....
Gyrokinetic simulation of internal kink modes
Energy Technology Data Exchange (ETDEWEB)
Naitou, Hiroshi; Tsuda, Kenji [Yamaguchi Univ., Ube (Japan). Dept. of Electrical and Electronical Engineering; Lee, W.W. [Princeton Univ., NJ (United States). Plasma Physics Lab.; Sydora, R.D. [Univ. of California, Los Angeles, CA (United States). Dept. of Physics
1995-05-01
Internal disruption in a tokamak has been simulated using a three-dimensional magneto-inductive gyrokinetic particle code. The code operates in both the standard gyrokinetic mode (total-f code) and the fully nonlinear characteristic mode ({delta}f code). The latter, a recent addition, is a quiet low noise algorithm. The computational model represents a straight tokamak with periodic boundary conditions in the toroidal direction. The plasma is initially uniformly distributed in a square cross section with perfectly conducting walls. The linear mode structure of an unstable m = 1 (poloidal) and n = 1 (toroidal) kinetic internal kink mode is clearly observed, especially in the {delta}f code. The width of the current layer around the x-point, where magnetic reconnection occurs, is found to be close to the collisionless electron skin depth. This is consistent with the theory in which electron inertia has a dominant role. The nonlinear behavior of the mode is found to be quite similar for both codes. Full reconnection in the Alfven time scale is observed along with the electrostatic potential structures created during the full reconnection phase. The E x B drift due to this electrostatic potential dominates the nonlinear phase of the development after the full reconnection.
Crompton, Helen; LaFrance, Jason; van 't Hooft, Mark
2012-01-01
A QR (quick-response) code is a two-dimensional scannable code, similar in function to a traditional bar code that one might find on a product at the supermarket. The main difference between the two is that, while a traditional bar code can hold a maximum of only 20 digits, a QR code can hold up to 7,089 characters, so it can contain much more…
Institute of Scientific and Technical Information of China (English)
2008-01-01
Quantum error correcting codes are indispensable for quantum information processing and quantum computation.In 1995 and 1996,Shor and Steane gave first several examples of quantum codes from classical error correcting codes.The construction of efficient quantum codes is now an active multi-discipline research field.In this paper we review the known several constructions of quantum codes and present some examples.
Directory of Open Access Journals (Sweden)
Claudia Cioli
Full Text Available We explore the relationships between the cortex functional organization and genetic expression (as provided by the Allen Human Brain Atlas. Previous work suggests that functional cortical networks (resting state and task based are organized as two large networks (differentiated by their preferred information processing mode shaped like two rings. The first ring--Visual-Sensorimotor-Auditory (VSA--comprises visual, auditory, somatosensory, and motor cortices that process real time world interactions. The second ring--Parieto-Temporo-Frontal (PTF--comprises parietal, temporal, and frontal regions with networks dedicated to cognitive functions, emotions, biological needs, and internally driven rhythms. We found--with correspondence analysis--that the patterns of expression of the 938 genes most differentially expressed across the cortex organized the cortex into two sets of regions that match the two rings. We confirmed this result using discriminant correspondence analysis by showing that the genetic profiles of cortical regions can reliably predict to what ring these regions belong. We found that several of the proteins--coded by genes that most differentiate the rings--were involved in neuronal information processing such as ionic channels and neurotransmitter release. The systematic study of families of genes revealed specific proteins within families preferentially expressed in each ring. The results showed strong congruence between the preferential expression of subsets of genes, temporal properties of the proteins they code, and the preferred processing modes of the rings. Ionic channels and release-related proteins more expressed in the VSA ring favor temporal precision of fast evoked neural transmission (Sodium channels SCNA1, SCNB1 potassium channel KCNA1, calcium channel CACNA2D2, Synaptotagmin SYT2, Complexin CPLX1, Synaptobrevin VAMP1. Conversely, genes expressed in the PTF ring favor slower, sustained, or rhythmic activation (Sodium
Benchmark studies of BOUT++ code and TPSMBI code on neutral transport during SMBI
Energy Technology Data Exchange (ETDEWEB)
Wang, Y.H. [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031 (China); University of Science and Technology of China, Hefei 230026 (China); Center for Magnetic Fusion Theory, Chinese Academy of Sciences, Hefei 230031 (China); Wang, Z.H., E-mail: zhwang@swip.ac.cn [Southwestern Institute of Physics, Chengdu 610041 (China); Guo, W., E-mail: wfguo@ipp.ac.cn [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031 (China); Center for Magnetic Fusion Theory, Chinese Academy of Sciences, Hefei 230031 (China); Ren, Q.L. [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031 (China); Sun, A.P.; Xu, M.; Wang, A.K. [Southwestern Institute of Physics, Chengdu 610041 (China); Xiang, N. [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031 (China); Center for Magnetic Fusion Theory, Chinese Academy of Sciences, Hefei 230031 (China)
2017-06-09
SMBI (supersonic molecule beam injection) plays an important role in tokamak plasma fuelling, density control and ELM mitigation in magnetic confinement plasma physics, which has been widely used in many tokamaks. The trans-neut module of BOUT++ code is the only large-scale parallel 3D fluid code used to simulate the SMBI fueling process, while the TPSMBI (transport of supersonic molecule beam injection) code is a recent developed 1D fluid code of SMBI. In order to find a method to increase SMBI fueling efficiency in H-mode plasma, especially for ITER, it is significant to first verify the codes. The benchmark study between the trans-neut module of BOUT++ code and the TPSMBI code on radial transport dynamics of neutral during SMBI has been first successfully achieved in both slab and cylindrical coordinates. The simulation results from the trans-neut module of BOUT++ code and TPSMBI code are consistent very well with each other. Different upwind schemes have been compared to deal with the sharp gradient front region during the inward propagation of SMBI for the code stability. The influence of the WENO3 (weighted essentially non-oscillatory) and the third order upwind schemes on the benchmark results has also been discussed. - Highlights: • A 1D model of SMBI has developed. • Benchmarks of BOUT++ and TPSMBI codes have first been finished. • The influence of the WENO3 and the third order upwind schemes on the benchmark results has also been discussed.
Turbo Codes Extended with Outer BCH Code
DEFF Research Database (Denmark)
Andersen, Jakob Dahl
1996-01-01
The "error floor" observed in several simulations with the turbo codes is verified by calculation of an upper bound to the bit error rate for the ensemble of all interleavers. Also an easy way to calculate the weight enumerator used in this bound is presented. An extended coding scheme is proposed...
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.
Hybrid Noncoherent Network Coding
Skachek, Vitaly; Nedic, Angelia
2011-01-01
We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a significantly large number of different basis vectors transmitted through the network and when the min-cut of the networks is much smaller then the length of the transmitted codewords, the new family of codes outperforms their subspace code counterparts. For the proposed coding scheme, termed hybrid network coding, we derive two upper bounds on the size of the codes. These bounds represent a variation of the Singleton and of the sphere-packing bound. We show that a simple concatenated scheme that represents a combination of subspace codes and Reed-Solomon codes is asymptotically optimal with respect to the Singleton bound. Finally, we describe two efficient decoding algorithms for concatenated subspace codes that in certain cases have smaller complexity than subspace decoder...
Delayed Sequential Coding of Correlated Sources
Ma, Nan; Ishwar, Prakash
2007-01-01
Motivated by video coding applications, we study the problem of sequential coding of correlated sources with (noncausal) encoding and/or decoding frame-delays. The fundamental tradeoffs between individual frame rates, individual frame distortions, and encoding/decoding frame-delays are derived in terms of a single-letter information-theoretic characterization of the rate-distortion region for general inter-frame source correlations and certain types of (potentially frame-specific and coupled) single-letter fidelity criteria. For video sources which are spatially stationary memoryless and temporally Gauss--Markov, MSE frame distortions, and a sum-rate constraint, our results expose the optimality of differential predictive coding among all causal sequential coders. Somewhat surprisingly, causal sequential encoding with one-step delayed noncausal sequential decoding can exactly match the sum-rate-MSE performance of joint coding for all nontrivial MSE-tuples satisfying certain positive semi-definiteness conditio...
Distributed Storage Codes through Hadamard Designs
Papailiopoulos, Dimitris S
2011-01-01
In distributed storage systems that employ erasure coding, the issue of minimizing the total {\\it repair bandwidth} required to exactly regenerate a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Minimizing it requires that undesired data during a repair align in the smallest possible spaces, using the concept of interference alignment (IA). Here, a points-on-a-lattice representation of the symbol extension IA of Cadambe {\\it et al.} provides cues to perfect IA instances which we combine with fundamental properties of Hadamard matrices to construct a new storage code with favorable repair properties. Specifically, we build an explicit $(k+2,k)$ storage code over $\\mathbb{GF}(3)$, whose single systematic node failures can be repaired with bandwidth that matches exactly the theoretical minimum. Moreover, the repair of single parity node failures generates at most the same repair bandwidth as any sys...
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.
Coded Ultrasound for Blood Flow Estimation Using Subband Processing
DEFF Research Database (Denmark)
Gran, Fredrik; Udesen, Jesper; Nielsen, Michael Bachamnn
2008-01-01
the excitation signal is broadband and has good spatial resolution after pulse compression. This means that time can be saved by using the same data for B-mode imaging and blood flow estimation. Two different coding schemes are used in this paper, Barker codes and Golay codes. The performance of the codes...... signals are used to increase SNR, followed by subband processing. The received broadband signal is filtered using a set of narrow-band filters. Estimating the velocity in each of the bands and averaging the results yields better performance compared with what would be possible when transmitting a narrow......-band pulse directly. Also, the spatial resolution of the narrow-band pulse would be too poor for brightness-mode (B-mode) imaging, and additional transmissions would be required to update the B-mode image. For the described approach in the paper, there is no need for additional transmissions, because...
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.
Network coding for computing: Linear codes
Appuswamy, Rathinakumar; Karamchandani, Nikhil; Zeger, Kenneth
2011-01-01
In network coding it is known that linear codes are sufficient to achieve the coding capacity in multicast networks and that they are not sufficient in general to achieve the coding capacity in non-multicast networks. In network computing, Rai, Dey, and Shenvi have recently shown that linear codes are not sufficient in general for solvability of multi-receiver networks with scalar linear target functions. We study single receiver networks where the receiver node demands a target function of the source messages. We show that linear codes may provide a computing capacity advantage over routing only when the receiver demands a `linearly-reducible' target function. % Many known target functions including the arithmetic sum, minimum, and maximum are not linearly-reducible. Thus, the use of non-linear codes is essential in order to obtain a computing capacity advantage over routing if the receiver demands a target function that is not linearly-reducible. We also show that if a target function is linearly-reducible,...
Fast prediction algorithm for multiview video coding
Abdelazim, Abdelrahman; Mein, Stephen James; Varley, Martin Roy; Ait-Boudaoud, Djamel
2013-03-01
The H.264/multiview video coding (MVC) standard has been developed to enable efficient coding for three-dimensional and multiple viewpoint video sequences. The inter-view statistical dependencies are utilized and an inter-view prediction is employed to provide more efficient coding; however, this increases the overall encoding complexity. Motion homogeneity is exploited here to selectively enable inter-view prediction, and to reduce complexity in the motion estimation (ME) and the mode selection processes. This has been accomplished by defining situations that relate macro-blocks' motion characteristics to the mode selection and the inter-view prediction processes. When comparing the proposed algorithm to the H.264/MVC reference software and other recent work, the experimental results demonstrate a significant reduction in ME time while maintaining similar rate-distortion performance.
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.
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
Practices in Code Discoverability
Teuben, Peter; Nemiroff, Robert J; Shamir, Lior
2012-01-01
Much of scientific progress now hinges on the reliability, falsifiability and reproducibility of computer source codes. Astrophysics in particular is a discipline that today leads other sciences in making useful scientific components freely available online, including data, abstracts, preprints, and fully published papers, yet even today many astrophysics source codes remain hidden from public view. We review the importance and history of source codes in astrophysics and previous efforts to develop ways in which information about astrophysics codes can be shared. We also discuss why some scientist coders resist sharing or publishing their codes, the reasons for and importance of overcoming this resistance, and alert the community to a reworking of one of the first attempts for sharing codes, the Astrophysics Source Code Library (ASCL). We discuss the implementation of the ASCL in an accompanying poster paper. We suggest that code could be given a similar level of referencing as data gets in repositories such ...
Djordjevic, Ivan; Vasic, Bane
2010-01-01
This unique book provides a coherent and comprehensive introduction to the fundamentals of optical communications, signal processing and coding for optical channels. It is the first to integrate the fundamentals of coding theory and optical communication.
Institute of Scientific and Technical Information of China (English)
XIONG ChengYi; TIAN JinWen; LIU Jian
2008-01-01
This paper introduced a novel high performance algorithm and VLSI architectures for achieving bit plane coding (BPC) in word level sequential and parallel mode. The proposed BPC algorithm adopts the techniques of coding pass prediction and par-allel & pipeline to reduce the number of accessing memory and to increase the ability of concurrently processing of the system, where all the coefficient bits of a code block could be coded by only one scan. A new parallel bit plane architecture (PA) was proposed to achieve word-level sequential coding. Moreover, an efficient high-speed architecture (HA) was presented to achieve multi-word parallel coding. Compared to the state of the art, the proposed PA could reduce the hardware cost more efficiently, though the throughput retains one coefficient coded per clock. While the proposed HA could perform coding for 4 coefficients belonging to a stripe column at one intra-clock cycle, so that coding for an N×N code-block could be completed in approximate N2/4 intra-clock cycles. Theoretical analysis and ex-perimental results demonstrate that the proposed designs have high throughput rate with good performance in terms of speedup to cost, which can be good alter-natives for low power applications.
Benchmark studies of BOUT++ code and TPSMBI code on neutral transport during SMBI
Wang, Y. H.; Wang, Z. H.; Guo, W.; Ren, Q. L.; Sun, A. P.; Xu, M.; Wang, A. K.; Xiang, N.
2017-06-01
SMBI (supersonic molecule beam injection) plays an important role in tokamak plasma fuelling, density control and ELM mitigation in magnetic confinement plasma physics, which has been widely used in many tokamaks. The trans_neut module of BOUT++ code is the only large-scale parallel 3D fluid code used to simulate the SMBI fueling process, while the TPSMBI (transport of supersonic molecule beam injection) code is a recent developed 1D fluid code of SMBI. In order to find a method to increase SMBI fueling efficiency in H-mode plasma, especially for ITER, it is significant to first verify the codes. The benchmark study between the trans_neut module of BOUT++ code and the TPSMBI code on radial transport dynamics of neutral during SMBI has been first successfully achieved in both slab and cylindrical coordinates. The simulation results from the trans_neut module of BOUT++ code and TPSMBI code are consistent very well with each other. Different upwind schemes have been compared to deal with the sharp gradient front region during the inward propagation of SMBI for the code stability. The influence of the WENO3 (weighted essentially non-oscillatory) and the third order upwind schemes on the benchmark results has also been discussed.
Zhang, Linfan; Zheng, Shuang
2015-01-01
Quick Response code opens possibility to convey data in a unique way yet insufficient prevention and protection might lead into QR code being exploited on behalf of attackers. This thesis starts by presenting a general introduction of background and stating two problems regarding QR code security, which followed by a comprehensive research on both QR code itself and related issues. From the research a solution taking advantages of cloud and cryptography together with an implementation come af...
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.
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.
Directory of Open Access Journals (Sweden)
G. Wannberg
2008-08-01
Full Text Available The EISCAT UHF system has the unique capability to determine meteor vector velocities from the head echo Doppler shifts measured at the three sites. Since even meteors spending a very short time in the common volume produce analysable events, the technique lends itself ideally to mapping the orbits of meteors arriving from arbitrary directions over most of the upper hemisphere.
A radar mode optimised for this application was developed in 2001/2002. A specially selected low-sidelobe 32-bit pseudo-random binary sequence is used to binary phase shift key (BPSK the transmitted carrier. The baud-length is 2.4 μs and the receiver bandwidth is 1.6 MHz to accommodate both the resulting modulation bandwidth and the target Doppler shift. Sampling is at 0.6 μs, corresponding to 90-m range resolution. Target range and Doppler velocity are extracted from the raw data in a multi-step matched-filter procedure. For strong (SNR>5 events the Doppler velocity standard deviation is 100–150 m/s. The effective range resolution is about 30 m, allowing very accurate time-of-flight velocity estimates. On average, Doppler and time-of-flight (TOF velocities agree to within about one part in 10^{3}. Two or more targets simultaneously present in the beam can be resolved down to a range separation <300 m as long as their Doppler shifts differ by more than a few km/s.
A. van Deursen (Arie); L.M.F. Moonen (Leon); A. van den Bergh; G. Kok
2001-01-01
textabstractTwo key aspects of extreme programming (XP) are unit testing and merciless refactoring. Given the fact that the ideal test code / production code ratio approaches 1:1, it is not surprising that unit tests are being refactored. We found that refactoring test code is different from
Bergstra, Jan A
2010-01-01
General definitions as well as rules of reasoning regarding control code production, distribution, deployment, and usage are described. The role of testing, trust, confidence and risk analysis is considered. A rationale for control code testing is sought and found for the case of safety critical embedded control code.
DEFF Research Database (Denmark)
Bombin Palomo, Hector
2015-01-01
Color codes are topological stabilizer codes with unusual transversality properties. Here I show that their group of transversal gates is optimal and only depends on the spatial dimension, not the local geometry. I also introduce a generalized, subsystem version of color codes. In 3D they allow...
Deursen, A. van; Moonen, L.M.F.; Bergh, A. van den; Kok, G.
2001-01-01
Two key aspects of extreme programming (XP) are unit testing and merciless refactoring. Given the fact that the ideal test code / production code ratio approaches 1:1, it is not surprising that unit tests are being refactored. We found that refactoring test code is different from refactoring product
ARC Code TI: CODE Software Framework
National Aeronautics and Space Administration — CODE is a software framework for control and observation in distributed environments. The basic functionality of the framework allows a user to observe a distributed...
ARC Code TI: ROC Curve Code Augmentation
National Aeronautics and Space Administration — ROC (Receiver Operating Characteristic) curve Code Augmentation was written by Rodney Martin and John Stutz at NASA Ames Research Center and is a modification of ROC...
Fountain Codes: LT And Raptor Codes Implementation
Directory of Open Access Journals (Sweden)
Ali Bazzi, Hiba Harb
2017-01-01
Full Text Available Digital fountain codes are a new class of random error correcting codes designed for efficient and reliable data delivery over erasure channels such as internet. These codes were developed to provide robustness against erasures in a way that resembles a fountain of water. A digital fountain is rateless in a way that sender can send limitless number of encoded packets. The receiver doesn’t care which packets are received or lost as long as the receiver gets enough packets to recover original data. In this paper, the design of the fountain codes is explored with its implementation of the encoding and decoding algorithm so that the performance in terms of encoding/decoding symbols, reception overhead, data length, and failure probability is studied.
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...
Short Huffman Codes Producing 1s Half of the Time
Altenbach, Fabian; Mathar, Rudolf
2011-01-01
The design of the channel part of a digital communication system (e.g., error correction, modulation) is heavily based on the assumption that the data to be transmitted forms a fair bit stream. However, simple source encoders such as short Huffman codes generate bit streams that poorly match this assumption. As a result, the channel input distribution does not match the original design criteria. In this work, a simple method called half Huffman coding (halfHc) is developed. halfHc transforms a Huffman code into a source code whose output is more similar to a fair bit stream. This is achieved by permuting the codewords such that the frequency of 1s at the output is close to 0.5. The permutations are such that the optimality in terms of achieved compression ratio is preserved. halfHc is applied in a practical example, and the resulting overall system performs better than when conventional Huffman coding is used.
Edge Transport Modeling using the 3D EMC3-Eirene code on Tokamaks and Stellarators
Lore, J. D.; Ahn, J. W.; Briesemeister, A.; Ferraro, N.; Labombard, B.; McLean, A.; Reinke, M.; Shafer, M.; Terry, J.
2015-11-01
The fluid plasma edge transport code EMC3-Eirene has been applied to aid data interpretation and understanding the results of experiments with 3D effects on several tokamaks. These include applied and intrinsic 3D magnetic fields, 3D plasma facing components, and toroidally and poloidally localized heat and particle sources. On Alcator C-Mod, a series of experiments explored the impact of toroidally and poloidally localized impurity gas injection on core confinement and asymmetries in the divertor fluxes, with the differences between the asymmetry in L-mode and H-mode qualitatively reproduced in the simulations due to changes in the impurity ionization in the private flux region. Modeling of NSTX experiments on the effect of 3D fields on detachment matched the trend of a higher density at which the detachment occurs when 3D fields are applied. On DIII-D, different magnetic field models were used in the simulation and compared against the 2D Thomson scattering diagnostic. In simulating each device different aspects of the code model are tested pointing to areas where the model must be further developed. The application to stellarator experiments will also be discussed. Work supported by U.S. DOE: DE-AC05-00OR22725, DE AC02-09CH11466, DE-FC02-99ER54512, and DE-FC02-04ER54698.
Universal Rateless Codes From Coupled LT Codes
Aref, Vahid
2011-01-01
It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We study the performance of spatially coupled low-density generator-matrix ensembles when used for transmission over binary-input memoryless output-symmetric channels. We show by means of density evolution that the threshold saturation phenomenon also takes place in this setting. Our motivation for studying low-density generator-matrix codes is that they can easily be converted into rateless codes. Although there are already several classes of excellent rateless codes known to date, rateless codes constructed via spatial coupling might offer some additional advantages. In particular, by the very nature of the threshold phenomenon one expects that codes constructed on this principle can be made to be universal, i.e., a single construction can uniformly approach capacity over the cl...
Software Certification - Coding, Code, and Coders
Havelund, Klaus; Holzmann, Gerard J.
2011-01-01
We describe a certification approach for software development that has been adopted at our organization. JPL develops robotic spacecraft for the exploration of the solar system. The flight software that controls these spacecraft is considered to be mission critical. We argue that the goal of a software certification process cannot be the development of "perfect" software, i.e., software that can be formally proven to be correct under all imaginable and unimaginable circumstances. More realistically, the goal is to guarantee a software development process that is conducted by knowledgeable engineers, who follow generally accepted procedures to control known risks, while meeting agreed upon standards of workmanship. We target three specific issues that must be addressed in such a certification procedure: the coding process, the code that is developed, and the skills of the coders. The coding process is driven by standards (e.g., a coding standard) and tools. The code is mechanically checked against the standard with the help of state-of-the-art static source code analyzers. The coders, finally, are certified in on-site training courses that include formal exams.
Phase-matched second harmonic generation with on-chip GaN-on-Si microdisks
Roland, I.; Gromovyi, M.; Zeng, Y.; El Kurdi, M.; Sauvage, S.; Brimont, C.; Guillet, T.; Gayral, B.; Semond, F.; Duboz, J. Y.; de Micheli, M.; Checoury, X.; Boucaud, P.
2016-09-01
We demonstrate phase-matched second harmonic generation in gallium nitride on silicon microdisks. The microdisks are integrated with side-coupling bus waveguides in a two-dimensional photonic circuit. The second harmonic generation is excited with a continuous wave laser in the telecom band. By fabricating a series of microdisks with diameters varying by steps of 8 nm, we obtain a tuning of the whispering gallery mode resonances for the fundamental and harmonic waves. Phase matching is obtained when both resonances are matched with modes satisfying the conservation of orbital momentum, which leads to a pronounced enhancement of frequency conversion.
When Is Coding Scholarship And When Is It Not?
van Zundert, Joris J.; Haentjens Dekker, R.
2015-01-01
We argue that the humanities and digital humanities need to consider certain forms of code as scholarly object and certain types of code authorship as a scholarly activity. It will be essential, therefore, to develop a scholarly mode of evaluating and criticizing these scholarly contributions in cod
When Is Coding Scholarship And When Is It Not?
van Zundert, Joris J.; Haentjens Dekker, R.
2015-01-01
We argue that the humanities and digital humanities need to consider certain forms of code as scholarly object and certain types of code authorship as a scholarly activity. It will be essential, therefore, to develop a scholarly mode of evaluating and criticizing these scholarly contributions in cod
Rice, R. F.; Lee, J. J.
1986-01-01
Scheme for coding facsimile messages promises to reduce data transmission requirements to one-tenth current level. Coding scheme paves way for true electronic mail in which handwritten, typed, or printed messages or diagrams sent virtually instantaneously - between buildings or between continents. Scheme, called Universal System for Efficient Electronic Mail (USEEM), uses unsupervised character recognition and adaptive noiseless coding of text. Image quality of resulting delivered messages improved over messages transmitted by conventional coding. Coding scheme compatible with direct-entry electronic mail as well as facsimile reproduction. Text transmitted in this scheme automatically translated to word-processor form.
Hardware Assisted ROP Detection Mode (HARD Mode)
2013-08-01
Distribution A. Cleared for public release; unlimited distribution. USAFA-CN-2013-457 Hardware Assisted ROP Detection Mode (HARD Mode) NATHANIEL HART...457 This report, "Hardware Assisted ROP Detection Mode (HARD Mode)" is presented as a competent treatment of the subj ect, worthy of publication. The...Technical 20120810-20121215 Hardware Assisted ROP Detection Mode (HARD Mode) NATHANIEL HART MICHAEL WINSTEAD MARTIN CARLISLE RODNEY LYKINS MICHAEL
Effects of Mode Shares on Mode Choice
Carlos Carrion; Nebiyou Tilahun; David Levinson
2011-01-01
This study considers the influence of the knowledge of existing mode shares on travelers mode choice. This contrasts with traditional mode choice models, where the main objective is to predict the overall mode shares as the aggregate of individual mode choices according to variables encompassing attributes of the modes, and characteristics of the travelers. In this study, a computer-administered adaptive stated preference survey is developed and applied to a sample of subjects selected from t...
Blood and Books: Performing Code Switching
Directory of Open Access Journals (Sweden)
Jeff Friedman
2008-05-01
Full Text Available Code switching is a linguistic term that identifies ways individuals use communication modes and registers to negotiate difference in social relations. This essay suggests that arts-based inquiry, in the form of choreography and performance, provides a suitable and efficacious location within which both verbal and nonverbal channels of code switching can be investigated. Blood and Books, a case study of dance choreography within the context of post-colonial Maori performance in Aotearoa/New Zealand, is described and analyzed for its performance of code switching. The essay is framed by a discussion of how arts-based research within tertiary higher education requires careful negotiation in the form of code switching, as performed by the author's reflexive use of vernacular and formal registers in the essay. URN: urn:nbn:de:0114-fqs0802462
Complete leaky mode coupling in dual-core photonic crystal fibre based on the coupled-mode theory
Institute of Scientific and Technical Information of China (English)
Yuan Jin-Hui; Yu Chong-Xiu; Sang Xin-Zhu; Zhang Jin-Long; Zhou Gui-Yao; Hou Lan-Tian
2011-01-01
This paper theoretically investigates the dependence of leaky mode coupling between inner core fundamental mode and outer core defect mode on phase and loss matching in pure silica dual-core photonic crystal fibres with the multi-pole method. The complete mode coupling can take place when both the phase and loss matching conditions are satisfied at the avoided anti-crossing wavelength. It shows the influences of cladding structure parameters including the diameters of cladding air holes d1, diameters of outer core holes d2 and hole to hole pitch A on the characteristics of leaky modes coupling. The coupled-mode theory is used to analyse the mode transition characteristics and the complete coupling can be clearly indicated by comparing the real and imaginary parts of propagation constant of the leaky modes.
Lim, Sung Hoon; Gamal, Abbas El; Chung, Sae-Young
2010-01-01
A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to general discrete memoryless and Gaussian networks. The scheme also recovers as special cases the results on coding for wireless relay networks and deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless erasure networks by Dana, Gowaikar, Palanki, Hassibi, and Effros. The scheme involves message repetition coding, relay signal compression, and simultaneous decoding. Unlike previous compress--forward schemes, where independent messages are sent over multiple blocks, the same message is sent multiple times using independent codebooks as in the network coding scheme for cyclic networks. Furthermore, the relays do not use Wyner--Ziv binning as in previous compress-forward sch...
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
CHEN Hao
2009-01-01
Property testing was initially studied from various motivations in 1990's.A code C (∩)GF(r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector's coordinates.The problem of testing codes was firstly studied by Blum,Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs).How to characterize locally testable codes is a complex and challenge problem.The local tests have been studied for Reed-Solomon (RS),Reed-Muller (RM),cyclic,dual of BCH and the trace subcode of algebraicgeometric codes.In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions).We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Institute of Scientific and Technical Information of China (English)
ZHANG Aili; LIU Xiufeng
2006-01-01
Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory.The new type of linear codes take the congruence class in the congruence class ring R/I1 ∩ I2 ∩…∩ In for the information bit,embed R/Ji into R/I1 ∩ I2 ∩…∩ In,and assign the cosets of R/Ji as the subring of R/I1 ∩ I2 ∩…∩ In and the cosets of R/Ji in R/I1 ∩ I2 ∩…∩ In as check lines.Many code classes exist in the Chinese remainder codes that have high code rates.Chinese remainder codes are the essential generalization of Sun Zi codes.
Institute of Scientific and Technical Information of China (English)
张爱丽; 刘秀峰; 靳蕃
2004-01-01
Chinese Remainder Codes are constructed by applying weak block designs and Chinese Remainder Theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I1∩I2∩…∩In for the information bit, embed R/Ji into R/I1∩I2∩…∩In, and asssign the cosets of R/Ji as the subring of R/I1∩I2∩…∩In and the cosets of R/Ji in R/I1∩I2∩…∩In as check lines. There exist many code classes in Chinese Remainder Codes, which have high code rates. Chinese Remainder Codes are the essential generalization of Sun Zi Codes.
DEFF Research Database (Denmark)
Adelstein, Jennifer; Clegg, Stewart
2016-01-01
Ethical codes have been hailed as an explicit vehicle for achieving more sustainable and defensible organizational practice. Nonetheless, when legal compliance and corporate governance codes are conflated, codes can be used to define organizational interests ostentatiously by stipulating norms...... for employee ethics. Such codes have a largely cosmetic and insurance function, acting subtly and strategically to control organizational risk management and protection. In this paper, we conduct a genealogical discourse analysis of a representative code of ethics from an international corporation...... to understand how management frames expectations of compliance. Our contribution is to articulate the problems inherent in codes of ethics, and we make some recommendations to address these to benefit both an organization and its employees. In this way, we show how a code of ethics can provide a foundation...
Defeating the coding monsters.
Colt, Ross
2007-02-01
Accuracy in coding is rapidly becoming a required skill for military health care providers. Clinic staffing, equipment purchase decisions, and even reimbursement will soon be based on the coding data that we provide. Learning the complicated myriad of rules to code accurately can seem overwhelming. However, the majority of clinic visits in a typical outpatient clinic generally fall into two major evaluation and management codes, 99213 and 99214. If health care providers can learn the rules required to code a 99214 visit, then this will provide a 90% solution that can enable them to accurately code the majority of their clinic visits. This article demonstrates a step-by-step method to code a 99214 visit, by viewing each of the three requirements as a monster to be defeated.
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
Property testing was initially studied from various motivations in 1990’s. A code C GF (r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector’s coordinates. The problem of testing codes was firstly studied by Blum, Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs). How to characterize locally testable codes is a complex and challenge problem. The local tests have been studied for Reed-Solomon (RS), Reed-Muller (RM), cyclic, dual of BCH and the trace subcode of algebraicgeometric codes. In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions). We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Serially Concatenated IRA Codes
Cheng, Taikun; Belzer, Benjamin J
2007-01-01
We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeat accumulate (IRA) component codes connected by an interleaver. The interleaver is designed to prevent stopping-set error events in one of the IRA codes from propagating into stopping set events of the other code. Simulations with two 128-bit rate 0.707 IRA component codes show that the proposed architecture achieves a much lower error floor at higher SNRs, compared to a 16384-bit rate 1/2 IRA code, but incurs an SNR penalty of about 2 dB at low to medium SNRs. Experiments indicate that the SNR penalty can be reduced at larger blocklengths.
Description of Transport Codes for Space Radiation Shielding
Kim, Myung-Hee Y.; Wilson, John W.; Cucinotta, Francis A.
2011-01-01
This slide presentation describes transport codes and their use for studying and designing space radiation shielding. When combined with risk projection models radiation transport codes serve as the main tool for study radiation and designing shielding. There are three criteria for assessing the accuracy of transport codes: (1) Ground-based studies with defined beams and material layouts, (2) Inter-comparison of transport code results for matched boundary conditions and (3) Comparisons to flight measurements. These three criteria have a very high degree with NASA's HZETRN/QMSFRG.
A minimum-error, energy-constrained neural code is an instantaneous-rate code.
Johnson, Erik C; Jones, Douglas L; Ratnam, Rama
2016-04-01
Sensory neurons code information about stimuli in their sequence of action potentials (spikes). Intuitively, the spikes should represent stimuli with high fidelity. However, generating and propagating spikes is a metabolically expensive process. It is therefore likely that neural codes have been selected to balance energy expenditure against encoding error. Our recently proposed optimal, energy-constrained neural coder (Jones et al. Frontiers in Computational Neuroscience, 9, 61 2015) postulates that neurons time spikes to minimize the trade-off between stimulus reconstruction error and expended energy by adjusting the spike threshold using a simple dynamic threshold. Here, we show that this proposed coding scheme is related to existing coding schemes, such as rate and temporal codes. We derive an instantaneous rate coder and show that the spike-rate depends on the signal and its derivative. In the limit of high spike rates the spike train maximizes fidelity given an energy constraint (average spike-rate), and the predicted interspike intervals are identical to those generated by our existing optimal coding neuron. The instantaneous rate coder is shown to closely match the spike-rates recorded from P-type primary afferents in weakly electric fish. In particular, the coder is a predictor of the peristimulus time histogram (PSTH). When tested against in vitro cortical pyramidal neuron recordings, the instantaneous spike-rate approximates DC step inputs, matching both the average spike-rate and the time-to-first-spike (a simple temporal code). Overall, the instantaneous rate coder relates optimal, energy-constrained encoding to the concepts of rate-coding and temporal-coding, suggesting a possible unifying principle of neural encoding of sensory signals.
Parametric Landau damping of space charge modes
Macridin, Alexandru; Stern, Eric; Amundson, James; Spentzouris, Panagiotis
2016-01-01
Landau damping is the mechanism of plasma and beam stabilization; it is caused by energy transfer from collective modes to incoherent motion of resonant particles. Normally this resonance requires the wave frequency in the particle frame to match the resonant particles frequency. Using the Synergia modeling package to study transverse coherent modes of bunched beams with space charge, we have identified a new kind of damping mechanism, parametric Landau damping, driven by the modulation of the wave-particle interaction.
Broadcast Coded Slotted ALOHA: A Finite Frame Length Analysis
DEFF Research Database (Denmark)
Ivanov, Mikhail; Brännström, Frederik; Graell i Amat, Alexandre;
2016-01-01
We propose an uncoordinated medium access control (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast with strict latency constraints. In B-CSA, each user acts as both transmitter and receiver in a half-duplex mode. The half-duplex mode gives...
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...
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.
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....
A Stereo Matching Algorithm Based on Four-Mo ded Census and Relative Confidence Plane Fitting
Institute of Scientific and Technical Information of China (English)
MEN Yubo; ZHANG Guoyin; MEN Chaoguang; LI Xiang; MA Ning
2015-01-01
A four-moded Census transform stereo matching algorithm using bidirectional constraint dynamic programming and relative confidence plane fitting is pro-posed to solve the problems of matching quality. Using the four-moded Census transform which adds a restrictive condition replaces traditional Census transform to improve matching accuracy and mean value of all pixels intensity replaces the center pixel intensity in the Census window to solve the problem of the center pixel distortion eff ectively, a refined initial local matching cost can be obtained. Dur-ing the disparity optimization, the difficulty of disparity computation in textureless areas is overcome by the esti-mated condition and defined relative confident pixels. Ex-periment results show that a better dense matching map can be obtained by the proposed algorithm.
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...
Activity and recovery profiles of state-of-origin and national rugby league match-play.
Gabbett, Tim J
2015-03-01
State-of-Origin is the highest standard of rugby league competition played anywhere in the world. This study investigated the activity profiles of State-of-Origin and compared them against regular National Rugby League (NRL) fixture matches. Video footage from State-of-Origin and NRL matches were coded for activity and recovery cycles. Time when the ball was continuously in play was considered activity, whereas any stoppages during matches were considered recovery. Ball-in-play periods in matches of different playing standards were analyzed by comparing State-of-Origin matches, NRL matches (with representative players available), and NRL matches (with representative players unavailable). The mean, maximum, and total ball-in-play time of State-of-Origin matches were longer than NRL matches (effect size [ES] ≥ 0.75) with and without the availability of representative players. State-of-Origin matches were associated with a greater proportion (ES ≥ 1.54) of long duration (46-300 seconds) ball-in-play periods, and a smaller proportion (ES ≥ 1.69) of short duration (rugby league players to perform prolonged passages of high-intensity exercise during match-play.
Mukai, Takahito; Lajoie, Marc J; Englert, Markus; Söll, Dieter
2017-09-08
The genetic code-the language used by cells to translate their genomes into proteins that perform many cellular functions-is highly conserved throughout natural life. Rewriting the genetic code could lead to new biological functions such as expanding protein chemistries with noncanonical amino acids (ncAAs) and genetically isolating synthetic organisms from natural organisms and viruses. It has long been possible to transiently produce proteins bearing ncAAs, but stabilizing an expanded genetic code for sustained function in vivo requires an integrated approach: creating recoded genomes and introducing new translation machinery that function together without compromising viability or clashing with endogenous pathways. In this review, we discuss design considerations and technologies for expanding the genetic code. The knowledge obtained by rewriting the genetic code will deepen our understanding of how genomes are designed and how the canonical genetic code evolved.
Yu, Jiun-Hung
2012-01-01
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding is studied in detail. If the moduli are not irreducible, the notion of an error locator polynomial is replaced by an error factor polynomial. We then obtain a collection of gcd-based decoding algorithms, some of which are not quite standard even when specialized to Reed-Solomon codes.
Numerical analysis for the matching of the core driven compression system in a double bypass engine
Institute of Scientific and Technical Information of China (English)
ZHANG Xin; LIU Bao-jie
2011-01-01
The numerical analysis for the matching of the core driven compression system in a double bypass variable cycle engine was presented in this paper. The system consists of a one-stage-core driven fan stage (CDFS), an inner bypass duet and a five-stage high pressure compressor (HPC), providing two basic operating modes: the single bypass mode and the double bypass mode. Variable vanes are necessary to realize the mode switch of the system. The correct matching in the double bypass mode requires a proper combination of the mass flow, total pressure ratio and blade speed. The work capacity of the system decreases in the double bypass mode and the pressure ratio tends to decrease more for the CDFS and the front stages of the HPC. The overall system efficiency is higher in the double bypass mode. The radial distributions of aerodynamic parameters are similar in different modes. The notable redistribution of mass flow downstream the CDFS in the single bypass mode leads to strong radial flows and additional mixing losses. The absolute flow angles into the inner bypass increase for the inner span and decrease for the outer span when the system is switched from the single bypass mode to the double bypass mode.
Generating code adapted for interlinking legacy scalar code and extended vector code
Gschwind, Michael K
2013-06-04
Mechanisms for intermixing code are provided. Source code is received for compilation using an extended Application Binary Interface (ABI) that extends a legacy ABI and uses a different register configuration than the legacy ABI. First compiled code is generated based on the source code, the first compiled code comprising code for accommodating the difference in register configurations used by the extended ABI and the legacy ABI. The first compiled code and second compiled code are intermixed to generate intermixed code, the second compiled code being compiled code that uses the legacy ABI. The intermixed code comprises at least one call instruction that is one of a call from the first compiled code to the second compiled code or a call from the second compiled code to the first compiled code. The code for accommodating the difference in register configurations is associated with the at least one call instruction.
Förtsch, Michael; Fürst, Josef U; Strekalov, Dmitry; Gerrits, Thomas; Stevens, Martin J; Sedlmeir, Florian; Schwefel, Harald G L; Nam, Sae Woo; Leuchs, Gerd; Marquardt, Christoph
2014-01-01
We report a highly efficient source of narrow-band photon pairs based on parametric down-conversion in a crystalline whispering gallery mode resonator. Remarkably, each photon of a pair is strictly emitted into a single spatial and temporal mode, as witnessed by Glaubers autocorrelation function. We explore the phase-matching conditions in spherical geometries, and determine the requirements of the single-mode operation. Understanding these conditions has allowed us to experimentally demonstrate a single-mode pair-detection rate of $0.97 \\cdot 10^6$ pairs/s per mW pump power per 20 MHz bandwidth without the need of additional filter cavities.
Energy Technology Data Exchange (ETDEWEB)
Visser, B. [Stork Product Eng., Amsterdam (Netherlands)
1996-09-01
To support the discussion on aeroelastic codes, a description of the code FLEXLAST was given and experiences within benchmarks and measurement programmes were summarized. The code FLEXLAST has been developed since 1982 at Stork Product Engineering (SPE). Since 1992 FLEXLAST has been used by Dutch industries for wind turbine and rotor design. Based on the comparison with measurements, it can be concluded that the main shortcomings of wind turbine modelling lie in the field of aerodynamics, wind field and wake modelling. (au)
DEFF Research Database (Denmark)
Steensig, Jakob; Heinemann, Trine
2015-01-01
We welcome Tanya Stivers’s discussion (Stivers, 2015/this issue) of coding social interaction and find that her descriptions of the processes of coding open up important avenues for discussion, among other things of the precise ad hoc considerations that researchers need to bear in mind, both when....... Instead we propose that the promise of coding-based research lies in its ability to open up new qualitative questions....
Shapiro, Wilbur
1996-01-01
This is an overview of new and updated industrial codes for seal design and testing. GCYLT (gas cylindrical seals -- turbulent), SPIRALI (spiral-groove seals -- incompressible), KTK (knife to knife) Labyrinth Seal Code, and DYSEAL (dynamic seal analysis) are covered. CGYLT uses G-factors for Poiseuille and Couette turbulence coefficients. SPIRALI is updated to include turbulence and inertia, but maintains the narrow groove theory. KTK labyrinth seal code handles straight or stepped seals. And DYSEAL provides dynamics for the seal geometry.
Authentication planning for XOR network coding
Jaffres-Runser, Katia
2011-01-01
This paper formulates the authentication planning problem when network coding is implemented in a wireless sensor network. The planning problem aims at minimizing the energy consumed by the security application which is guarantied using message authentication codes. This paper proposes a binary non-linear optimization formulation for this planning problem whose decision variables are the authentication decision of the nodes and the MAC modes of operation. It is illustrated for a butterfly topology. Results show that there is a real trade-off between energy efficiency and message throughput in this context.
Parsing and Matching Dates in VIAF
Directory of Open Access Journals (Sweden)
Jenny A. Toves
2014-10-01
Full Text Available The Virtual International Authority File (OCLC Online Computer Library Center 2013 http://viaf.org is built from dozens of authority files with tens of millions of names in more than 150 million authority and bibliographic records expressed in multiple languages, scripts and formats. One of the main tasks in VIAF is to bring together personal names which may have various dates associated with them, such as birth, death or when they were active. These dates can be quite complicated with ranges, approximations, BCE dates, different scripts, and even different calendars. Analysis of the nearly 400,000 unique date strings in VIAF led us to a parsing technique that relies on only a few basic patterns for them. Our goal is to correctly interpret at least 99% of all the dates we find in each of VIAF’s authority files and to use the dates to facilitate matches between authority records. Python source code for the process described here is available at https://github.com/OCLC-Developer-Network/viaf-dates.
National Aeronautics and Space Administration — ACCEPT consists of an overall software infrastructure framework and two main software components. The software infrastructure framework consists of code written to...
Waters, Joe
2012-01-01
Find out how to effectively create, use, and track QR codes QR (Quick Response) codes are popping up everywhere, and businesses are reaping the rewards. Get in on the action with the no-nonsense advice in this streamlined, portable guide. You'll find out how to get started, plan your strategy, and actually create the codes. Then you'll learn to link codes to mobile-friendly content, track your results, and develop ways to give your customers value that will keep them coming back. It's all presented in the straightforward style you've come to know and love, with a dash of humor thrown
Energy Technology Data Exchange (ETDEWEB)
Reid, R.L.; Barrett, R.J.; Brown, T.G.; Gorker, G.E.; Hooper, R.J.; Kalsi, S.S.; Metzler, D.H.; Peng, Y.K.M.; Roth, K.E.; Spampinato, P.T.
1985-03-01
The FEDC Tokamak Systems Code calculates tokamak performance, cost, and configuration as a function of plasma engineering parameters. This version of the code models experimental tokamaks. It does not currently consider tokamak configurations that generate electrical power or incorporate breeding blankets. The code has a modular (or subroutine) structure to allow independent modeling for each major tokamak component or system. A primary benefit of modularization is that a component module may be updated without disturbing the remainder of the systems code as long as the imput to or output from the module remains unchanged.
Energy Technology Data Exchange (ETDEWEB)
Cramer, S.N.
1984-01-01
The MORSE code is a large general-use multigroup Monte Carlo code system. Although no claims can be made regarding its superiority in either theoretical details or Monte Carlo techniques, MORSE has been, since its inception at ORNL in the late 1960s, the most widely used Monte Carlo radiation transport code. The principal reason for this popularity is that MORSE is relatively easy to use, independent of any installation or distribution center, and it can be easily customized to fit almost any specific need. Features of the MORSE code are described.
Aho-Mantila, L.; Potzel, S.; Coster, D. P.; Wischmeier, M.; Brix, M.; Fischer, R.; Marsen, S.; Meigs, A.; Müller, H. W.; Scarabosio, A.; Stamp, M. F.; Brezinsek, S.; the ASDEX Upgrade Team; JET Contributors, the
2017-03-01
The divertor solutions obtained with the plasma edge modelling tool SOLPS5.0 are discussed. The code results are benchmarked against carefully analysed L-mode discharges at various density levels with and without impurity seeding in the full-metal tokamaks ASDEX Upgrade and JET. The role of the cross-field drifts and currents in the solutions is analysed in detail, and the improvements achieved by fully activating the drift and current terms in view of matching the experimental signals are addressed. The persisting discrepancies are also discussed.
Activity cycles of National Rugby League and National Youth Competition matches.
Gabbett, Tim J
2012-06-01
Examination of ball-in-play periods (i.e., match activity cycles) is a method used to provide insight into the physical demands of team sport competition. However, to date, no study has investigated the ball-in-play time of rugby league matches. This study investigated the activity cycles (i.e., ball-in-play periods) of elite National Rugby League (NRL) and National Youth Competition (NYC) matches. Video recordings of 393 NRL matches and 388 NYC matches were coded for activity and recovery cycles. Time when the ball was continuously in play was considered activity, whereas any stoppages during the match (e.g., for scrums, penalties, line drop-outs, tries, and video referee decisions) were considered recovery. The total time the ball was in play for NRL and NYC matches was approximately 55 minutes and 50 minutes, respectively. In comparison with NYC matches, NRL matches had longer average activity cycles (81.2 ± 16.1 vs. 72.0 ± 14.7 seconds, effect size [ES] = 0.60). The average longest activity cycle was also higher (ES = 0.48) in NRL (318.3 ± 65.4 seconds) than in NYC (288.9 ± 57.5 seconds) matches. The longest activity cycle from any match was 667 and 701 seconds for NRL and NYC matches, respectively. The NRL matches had a smaller proportion of short duration (91-600 seconds) activity cycles. In conclusion, meaningful differences in activity cycles were observed between NRL and NYC matches, with NRL competition demonstrating longer ball-in-play periods, a smaller proportion of short duration activity cycles, and a larger proportion of longer duration activity cycles. These findings suggest that the ability to perform prolonged high-intensity exercise, coupled with the capacity to recover during brief stoppages in play, is a critical requirement of professional rugby league match play.
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.
The Efficient Coding of Speech: Cross-Linguistic Differences.
Guevara Erra, Ramon; Gervain, Judit
2016-01-01
Neural coding in the auditory system has been shown to obey the principle of efficient neural coding. The statistical properties of speech appear to be particularly well matched to the auditory neural code. However, only English has so far been analyzed from an efficient coding perspective. It thus remains unknown whether such an approach is able to capture differences between the sound patterns of different languages. Here, we use independent component analysis to derive information theoretically optimal, non-redundant codes (filter populations) for seven typologically distinct languages (Dutch, English, Japanese, Marathi, Polish, Spanish and Turkish) and relate the statistical properties of these filter populations to documented differences in the speech rhythms (Analysis 1) and consonant inventories (Analysis 2) of these languages. We show that consonant class membership plays a particularly important role in shaping the statistical structure of speech in different languages, suggesting that acoustic transience, a property that discriminates consonant classes from one another, is highly relevant for efficient coding.
Research on universal combinatorial coding.
Lu, Jun; Zhang, Zhuo; Mo, Juan
2014-01-01
The conception of universal combinatorial coding is proposed. Relations exist more or less in many coding methods. It means that a kind of universal coding method is objectively existent. It can be a bridge connecting many coding methods. Universal combinatorial coding is lossless and it is based on the combinatorics theory. The combinational and exhaustive property make it closely related with the existing code methods. Universal combinatorial coding does not depend on the probability statistic characteristic of information source, and it has the characteristics across three coding branches. It has analyzed the relationship between the universal combinatorial coding and the variety of coding method and has researched many applications technologies of this coding method. In addition, the efficiency of universal combinatorial coding is analyzed theoretically. The multicharacteristic and multiapplication of universal combinatorial coding are unique in the existing coding methods. Universal combinatorial coding has theoretical research and practical application value.
SC Secretariat
2005-01-01
Please note that the Safety Code A12 (Code A12) entitled "THE SAFETY COMMISSION (SC)" is available on the web at the following url: https://edms.cern.ch/document/479423/LAST_RELEASED Paper copies can also be obtained from the SC Unit Secretariat, e-mail: sc.secretariat@cern.ch SC Secretariat
Million, June
2004-01-01
In this article, the author discusses an e-mail survey of principals from across the country regarding whether or not their school had a formal staff dress code. The results indicate that most did not have a formal dress code, but agreed that professional dress for teachers was not only necessary, but showed respect for the school and had a…
Thieren, Michel; Mauron, Alex
2007-01-01
This month marks sixty years since the Nuremberg code – the basic text of modern medical ethics – was issued. The principles in this code were articulated in the context of the Nuremberg trials in 1947. We would like to use this anniversary to examine its ability to address the ethical challenges of our time.
Pseudonoise code tracking loop
Laflame, D. T. (Inventor)
1980-01-01
A delay-locked loop is presented for tracking a pseudonoise (PN) reference code in an incoming communication signal. The loop is less sensitive to gain imbalances, which can otherwise introduce timing errors in the PN reference code formed by the loop.
DEFF Research Database (Denmark)
Pries-Heje, Jan; Pries-Heje, Lene; Dahlgaard, Bente
2013-01-01
is required. In this paper we present the design of such a new approach, the Scrum Code Camp, which can be used to assess agile team capability in a transparent and consistent way. A design science research approach is used to analyze properties of two instances of the Scrum Code Camp where seven agile teams...
DEFF Research Database (Denmark)
Pries-Heje, Jan; Pries-Heje, Lene; Dahlgaard, Bente
2013-01-01
is required. In this paper we present the design of such a new approach, the Scrum Code Camp, which can be used to assess agile team capability in a transparent and consistent way. A design science research approach is used to analyze properties of two instances of the Scrum Code Camp where seven agile teams...
BIALEK, W; RIEKE, F; VANSTEVENINCK, RRD; WARLAND, D
1991-01-01
Traditional approaches to neural coding characterize the encoding of known stimuli in average neural responses. Organisms face nearly the opposite task - extracting information about an unknown time-dependent stimulus from short segments of a spike train. Here the neural code was characterized from
DEFF Research Database (Denmark)
Soon, Winnie
2014-01-01
, Twitter and Facebook). The focus is not to investigate the functionalities and efficiencies of the code, but to study and interpret the program level of code in order to trace the use of various technological methods such as third-party libraries and platforms’ interfaces. These are important...
Use of reconstructed 3D VMEC equilibria to match effects of toroidally rotating discharges in DIII-D
Wingen, A.; Wilcox, R. S.; Cianciosa, M. R.; Seal, S. K.; Unterberg, E. A.; Hanson, J. M.; Hirshman, S. P.; Lao, L. L.; Logan, N. C.; Paz-Soldan, C.; Shafer, M. W.
2017-01-01
A technique for tokamak equilibrium reconstructions is used for multiple DIII-D discharges, including L-mode and H-mode cases when weakly 3D fields ≤ft(δ B/B˜ {{10}-3}\\right) are applied. The technique couples diagnostics to the non-linear, ideal MHD equilibrium solver VMEC, using the V3FIT code, to find the most likely 3D equilibrium based on a suite of measurements. It is demonstrated that V3FIT can be used to find non-linear 3D equilibria that are consistent with experimental measurements of the plasma response to very weak 3D perturbations, as well as with 2D profile measurements. Observations at DIII-D show that plasma rotation larger than 20 krad s-1 changes the relative phase between the applied 3D fields and the measured plasma response. Discharges with low averaged rotation (10 krad s-1) and peaked rotation profiles (40 krad s-1) are reconstructed. Similarities and differences to forward modeled VMEC equilibria, which do not include rotational effects, are shown. Toroidal phase shifts of up to {{30}\\circ} are found between the measured and forward modeled plasma responses at the highest values of rotation. The plasma response phases of reconstructed equilibra on the other hand match the measured ones. This is the first time V3FIT has been used to reconstruct weakly 3D tokamak equilibria.
Visualizing a Dusty Plasma Shock Wave via Interacting Multiple-Model Mode Probabilities
Oxtoby, Neil P.; Ralph, Jason F.; Durniak, Céline; Samsonov, Dmitry
2011-01-01
Particles in a dusty plasma crystal disturbed by a shock wave are tracked using a three-mode interacting multiple model approach. Color-coded mode probabilities are used to visualize the shock wave propagation through the crystal.
Conventional Tanner Graph for Recursive onvolutional Codes and Associated Decoding
Institute of Scientific and Technical Information of China (English)
SUN Hong
2001-01-01
A different representation of recur-sive systematic convolutional (RSC) codes is pro-posed. This representation can be realized by a con-ventional Tanner graph. The graph becomes a treeby introducing hidden edge. It is shown that thesum-product algorithm applied to this graph modelis equivalent to the BCJR algorithm for turbo de-coding with lower computational complexity. Themessage-passing chain of the BCJR algorithm is pre-sented more exactly in the graph. In addition, theproposed representation of RSC codes provides an ef-ficient method to set up the trellis and the conven-tional Tanner graph for RSC codes provides directlythe architecture for decoding.
Conditional entropy coding of DCT coefficients for video compression
Sipitca, Mihai; Gillman, David W.
2000-04-01
We introduce conditional Huffman encoding of DCT run-length events to improve the coding efficiency of low- and medium-bit rate video compression algorithms. We condition the Huffman code for each run-length event on a classification of the current block. We classify blocks according to coding mode and signal type, which are known to the decoder, and according to energy, which the decoder must receive as side information. Our classification schemes improve coding efficiency with little or no increased running time and some increased memory use.
Transformation invariant sparse coding
DEFF Research Database (Denmark)
Mørup, Morten; Schmidt, Mikkel Nørgaard
2011-01-01
Sparse coding is a well established principle for unsupervised learning. Traditionally, features are extracted in sparse coding in specific locations, however, often we would prefer invariant representation. This paper introduces a general transformation invariant sparse coding (TISC) model....... The model decomposes images into features invariant to location and general transformation by a set of specified operators as well as a sparse coding matrix indicating where and to what degree in the original image these features are present. The TISC model is in general overcomplete and we therefore invoke...... sparse coding to estimate its parameters. We demonstrate how the model can correctly identify components of non-trivial artificial as well as real image data. Thus, the model is capable of reducing feature redundancies in terms of pre-specified transformations improving the component identification....
1983-01-01
The specification of Software Implemented Fault Tolerance (SIFT) consists of two parts, the specifications of the SIFT models and the specifications of the SIFT PASCAL program which actually implements the SIFT system. The code specifications are the last of a hierarchy of models describing the operation of the SIFT system and are related to the SIFT models as well as the PASCAL program. These Specifications serve to link the SIFT models to the running program. The specifications are very large and detailed and closely follow the form and organization of the PASCAL code. In addition to describing each of the components of the SIFT code, the code specifications describe the assumptions of the upper SIFT models which are required to actually prove that the code will work as specified. These constraints are imposed primarily on the schedule tables.
DEFF Research Database (Denmark)
Andersen, Christian Ulrik
2007-01-01
discusses code as the artist’s material and, further, formulates a critique of Cramer. The seductive magic in computer-generated art does not lie in the magical expression, but nor does it lie in the code/material/text itself. It lies in the nature of code to do something – as if it was magic......Computer art is often associated with computer-generated expressions (digitally manipulated audio/images in music, video, stage design, media facades, etc.). In recent computer art, however, the code-text itself – not the generated output – has become the artwork (Perl Poetry, ASCII Art, obfuscated...... avant-garde’. In line with Cramer, the artists Alex McLean and Adrian Ward (aka Slub) declare: “art-oriented programming needs to acknowledge the conditions of its own making – its poesis.” By analysing the Live Coding performances of Slub (where they program computer music live), the presentation...
Combustion chamber analysis code
Przekwas, A. J.; Lai, Y. G.; Krishnan, A.; Avva, R. K.; Giridharan, M. G.
1993-05-01
A three-dimensional, time dependent, Favre averaged, finite volume Navier-Stokes code has been developed to model compressible and incompressible flows (with and without chemical reactions) in liquid rocket engines. The code has a non-staggered formulation with generalized body-fitted-coordinates (BFC) capability. Higher order differencing methodologies such as MUSCL and Osher-Chakravarthy schemes are available. Turbulent flows can be modeled using any of the five turbulent models present in the code. A two-phase, two-liquid, Lagrangian spray model has been incorporated into the code. Chemical equilibrium and finite rate reaction models are available to model chemically reacting flows. The discrete ordinate method is used to model effects of thermal radiation. The code has been validated extensively against benchmark experimental data and has been applied to model flows in several propulsion system components of the SSME and the STME.
Astrophysics Source Code Library
Allen, Alice; Berriman, Bruce; Hanisch, Robert J; Mink, Jessica; Teuben, Peter J
2012-01-01
The Astrophysics Source Code Library (ASCL), founded in 1999, is a free on-line registry for source codes of interest to astronomers and astrophysicists. The library is housed on the discussion forum for Astronomy Picture of the Day (APOD) and can be accessed at http://ascl.net. The ASCL has a comprehensive listing that covers a significant number of the astrophysics source codes used to generate results published in or submitted to refereed journals and continues to grow. The ASCL currently has entries for over 500 codes; its records are citable and are indexed by ADS. The editors of the ASCL and members of its Advisory Committee were on hand at a demonstration table in the ADASS poster room to present the ASCL, accept code submissions, show how the ASCL is starting to be used by the astrophysics community, and take questions on and suggestions for improving the resource.
Hybrid Schema Matching for Deep Web
Chen, Kerui; Zuo, Wanli; He, Fengling; Chen, Yongheng
Schema matching is the process of identifying semantic mappings, or correspondences, between two or more schemas. Schema matching is a first step and critical part of data integration. For schema matching of deep web, most researches only interested in query interface, while rarely pay attention to abundant schema information contained in query result pages. This paper proposed a mixed schema matching technique, which combines attributes that appeared in query structures and query results of different data sources, and mines the matched schemas inside. Experimental results prove the effectiveness of this method for improving the accuracy of schema matching.
Dispersion Matching of a Space Charge dominated Beam at Injection into the CERN PS Booster
Hanke, Klaus; Scrivens, Richard
2005-01-01
In order to match the dispersion at injection into the CERN PS Booster, the optics of the injection line was simulated using two different codes (MAD and TRACE). The simulations were benchmarked versus experimental results. The model of the line was then used to re-match the dispersion. Experimental results are presented for different optics of the line. Measurements with varying beam current show the independence of the measured quantity of space-charge effects.
Verbal Response Mode Use by Clients in Psychotherapy.
Stiles, William B.; Sultan, Faye E.
1979-01-01
Verbal behavior in transcripts of psychotherapy was coded according to Stile's taxonomy of verbal response modes. Therapists of different theoretical persuasions used different mixtures of verbal techniques. Common elements that make verbal interaction psychologically therapeutic lie in client behavior. (Author)
Reducing the likelihood of long tennis matches.
Barnett, Tristan; Alan, Brown; Pollard, Graham
2006-01-01
Long matches can cause problems for tournaments. For example, the starting times of subsequent matches can be substantially delayed causing inconvenience to players, spectators, officials and television scheduling. They can even be seen as unfair in the tournament setting when the winner of a very long match, who may have negative aftereffects from such a match, plays the winner of an average or shorter length match in the next round. Long matches can also lead to injuries to the participating players. One factor that can lead to long matches is the use of the advantage set as the fifth set, as in the Australian Open, the French Open and Wimbledon. Another factor is long rallies and a greater than average number of points per game. This tends to occur more frequently on the slower surfaces such as at the French Open. The mathematical method of generating functions is used to show that the likelihood of long matches can be substantially reduced by using the tiebreak game in the fifth set, or more effectively by using a new type of game, the 50-40 game, throughout the match. Key PointsThe cumulant generating function has nice properties for calculating the parameters of distributions in a tennis matchA final tiebreaker set reduces the length of matches as currently being used in the US OpenA new 50-40 game reduces the length of matches whilst maintaining comparable probabilities for the better player to win the match.
Institute of Scientific and Technical Information of China (English)
陈卫民; 罗欣; 张程; 张哲; 张富兴
2013-01-01
职务犯罪侦查模式关系到对侦查权力的限制和对犯罪嫌疑人人权的保障。西方法治国家职务犯罪侦查模式通过合理规制犯罪控制程序来促使保障人权的做法，值得我们深思和借鉴。在新刑事诉讼法的框架下，检察机关应立足本土实际，以强化人权保障、有效打击犯罪为出发点，结合当前我国职务犯罪侦查模式的现状及问题，针对人权保障理念下如何实现职务犯罪侦查模式的转变，努力完善职务犯罪的侦查模式。%Duty crime investigation mode concerns the investigative power limit and the suspect 's human rights protection .As to duty crime investigation mode , western countries adopt reasonable regulations on crime control to promote human rights protection , which is worth pondering and using for reference .Under the framework of the new Code of Criminal Procedure , procuratorial organs shall adhere to the local reality and regard strengthe-ning the protection of human rights and effectively fighting against crime as the major points to improve the duty crime investigation system .This paper analyzes the status quo and problems of China's current mode of duty crimes investigation and discusses the evolution of duty crime investigation mode under the concept of human rights protec -tion with an aim to improve the investigation mode of duty crime .
Beam characteristics of energy-matched flattening filter free beams
Energy Technology Data Exchange (ETDEWEB)
Paynter, D.; Weston, S. J.; Cosgrove, V. P. [St James Institute of Oncology The Leeds Teaching Hospitals NHS Trust, Medical Physics, Leeds LS9 7TF (United Kingdom); Evans, J. A. [LIGHT Institute University of Leeds Leeds LS2 9JT, Division of Medical Physics, Leeds (United Kingdom); Thwaites, D. I. [LIGHT Institute University of Leeds Leeds LS2 9JT, Division of Medical Physics, Leeds, United Kingdom and Institute of Medical Physics, School of Physics, University of Sydney (Australia)
2014-05-15
Purpose: Flattening filter free (FFF) linear accelerators can increase treatment efficiency and plan quality. There are multiple methods of defining a FFF beam. The Elekta control system supports tuning of the delivered FFF beam energy to enable matching of the percentage depth-dose (PDD) of the flattened beam at 10 cm depth. This is compared to FFF beams where the linac control parameters are identical to those for the flattened beam. All beams were delivered on an Elekta Synergy accelerator with an Agility multi-leaf collimator installed and compared to the standard, flattened beam. The aim of this study is to compare “matched” FFF beams to both “unmatched” FFF beams and flattened beams to determine the benefits of matching beams. Methods: For the three modes of operation 6 MV flattened, 6 MV matched FFF, 6 MV unmatched FFF, 10 MV flattened, 10 MV matched FFF, and 10 MV unmatched FFF beam profiles were obtained using a plotting tank and were measured in steps of 0.1 mm in the penumbral region. Beam penumbra was defined as the distance between the 80% and 20% of the normalized dose when the inflection points of the unflattened and flattened profiles were normalized with the central axis dose of the flattened field set as 100%. PDD data was obtained at field sizes ranging from 3 cm × 3 cm to 40 cm × 40 cm. Radiation protection measurements were additionally performed to determine the head leakage and environmental monitoring through the maze and primary barriers. Results: No significant change is made to the beam penumbra for FFF beams with and without PDD matching, the maximum change in penumbra for a 10 cm × 10 cm field was within the experimental error of the study. The changes in the profile shape with increasing field size are most significant for the matched FFF beam, and both FFF beams showed less profile shape variation with increasing depth when compared to flattened beams, due to consistency in beam energy spectra across the radiation field
USB: ultrashort binary descriptor for fast visual matching and retrieval.
Zhang, Shiliang; Tian, Qi; Huang, Qingming; Gao, Wen; Rui, Yong
2014-08-01
Currently, many local descriptors have been proposed to tackle a basic issue in computer vision: duplicate visual content matching. These descriptors either are represented as high-dimensional vectors relatively expensive to extract and compare or are binary codes limited in robustness. Bag-of-visual words (BoWs) model compresses local features into a compact representation that allows for fast matching and scalable indexing. However, the codebook training, high-dimensional feature extraction, and quantization significantly degrade the flexibility and efficiency of BoWs model. In this paper, we study an alternative to current local descriptors and BoWs model by extracting the ultrashort binary descriptor (USB) and a compact auxiliary spatial feature from each keypoint detected in images. A typical USB is a 24-bit binary descriptor, hence it directly quantizes visual clues of image keypoints to about 16 million unique IDs. USB allows fast image matching and indexing and avoids the expensive codebook training and feature quantization in BoWs model. The spatial feature complementarily captures the spatial configuration in neighbor region of each keypoint, hence is used to filter mismatched USBs in a cascade verification. In image matching task, USB shows promising accuracy and nearly one-order faster speed than SIFT. We also test USB in retrieval tasks on UKbench, Oxford5K, and 1.2 million distractor images. Comparisons with recent retrieval methods manifest the competitive accuracy, memory consumption, and significantly better efficiency of our approach.
Directory of Open Access Journals (Sweden)
María Fabiana Bugliani
2010-12-01
Full Text Available Las expresiones plásticas, como toda producción, son una labor surgida en un contexto cultural e históricamente dado y se encuentran sujetas a códigos estéticos, preferencias sociales y valoraciones propias de los espacios sociales en donde tales manifestaciones se produjeron, circularon y fueron consumidas. Estas expresiones son representaciones en tanto son objetivación de creencias, ideas y valores de un determinado grupo social y se presentan como un modo particular de manifestación que se encuentra social y culturalmente situado.En el caso de los recipientes cerámicos, sabemos que los mismos han participado de numerosas acciones de la vida cotidiana en el pasado. En este artículo se analizan los recursos plásticos que fueron movilizados y puestos ‘en acción’ en las vasijas de Yutopián, una aldea formativa del valle del Cajón, Noroeste argentino, del primer milenio de la era Cristiana. El estudio detallado de diferentes contextos en dos núcleos habitacionales nos mostró un despliegue diferencial de los modos de representación elegidos, los recursos expresivos utilizados y los tipos de recipientes empleados, permitiendo avanzar algunas ideas sobre el rol de los objetos y expresiones plásticas en diferentes situaciones de la vida social.Palabras Clave: vasijas cerámicas; expresiones plásticas; códigos estéticos; consumo; Noroeste argentino.AbstractPlastic expressions, as any other production, are creations that arise within a certain historic and cultural context, thus being subject to aesthetic codes, social preferences, and valuations specific of the social spaces in which such manifestations were produced, circulated and consumed. These expressions are representations as far as they are objectivations of beliefs, ideas and values of particular social groups, presenting themselves as a specific mode of representation that is socially and culturally situated.In the case of ceramic vessels, we know that these have
Can the genetic code be mathematically described?
Gonzalez, Diego L
2004-04-01
From a mathematical point of view, the genetic code is a surjective mapping between the set of the 64 possible three-base codons and the set of 21 elements composed of the 20 amino acids plus the Stop signal. Redundancy and degeneracy therefore follow. In analogy with the genetic code, non-power integer-number representations are also surjective mappings between sets of different cardinality and, as such, also redundant. However, none of the non-power arithmetics studied so far nor other alternative redundant representations are able to match the actual degeneracy of the genetic code. In this paper we develop a slightly more general framework that leads to the following surprising results: i) the degeneracy of the genetic code is mathematically described, ii) a new symmetry is uncovered within this degeneracy, iii) by assigning a binary string to each of the codons, their classification into definite parity classes according to the corresponding sequence of bases is made possible. This last result is particularly appealing in connection with the fact that parity coding is the basis of the simplest strategies devised for error correction in man-made digital data transmission systems.
Monetary Exchange with Multilateral Matching
DEFF Research Database (Denmark)
Julien, Benoît; Kennes, John; King, Ian
. In particular, surplus maximization can be achieved in this setting, in equilibrium, with a positive money supply. Moreover, with flexible prices and directed search, the first best allocation can be attained through price posting or through auctions with lotteries, but not through auctions without lotteries......This paper analyzes monetary exchange in a search model allowing for multilateral matches to be formed, according to a standard urn-ballprocess. We consider three physical environments: indivisible goods and money, divisible goods and indivisible money, and divisible goods and money. We compare....... 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)....
Making Palm Print Matching Mobile
Fang, Li; Chian, Cheng Shao
2009-01-01
With the growing importance of personal identification and authentication in todays highly advanced world where most business and personal tasks are being replaced by electronic means, the need for a technology that is able to uniquely identify an individual and has high fraud resistance see the rise of biometric technologies. Making biometric based solution mobile is a promising trend. A new RST invariant square based palm print ROI extraction method was successfully implemented and integrated into the current application suite. A new set of palm print image database captured using embedded cameras in mobile phone was created to test its robustness. Comparing to those extraction methods that are based on boundary tracking of the overall hand shape that has limitation of being unable to process palm print images that has one or more fingers closed, the system can now effectively handle the segmentation of palm print images with varying finger positioning. The high flexibility makes palm print matching mobile ...
Embedded foveation image coding.
Wang, Z; Bovik, A C
2001-01-01
The human visual system (HVS) is highly space-variant in sampling, coding, processing, and understanding. The spatial resolution of the HVS is highest around the point of fixation (foveation point) and decreases rapidly with increasing eccentricity. By taking advantage of this fact, it is possible to remove considerable high-frequency information redundancy from the peripheral regions and still reconstruct a perceptually good quality image. Great success has been obtained previously by a class of embedded wavelet image coding algorithms, such as the embedded zerotree wavelet (EZW) and the set partitioning in hierarchical trees (SPIHT) algorithms. Embedded wavelet coding not only provides very good compression performance, but also has the property that the bitstream can be truncated at any point and still be decoded to recreate a reasonably good quality image. In this paper, we propose an embedded foveation image coding (EFIC) algorithm, which orders the encoded bitstream to optimize foveated visual quality at arbitrary bit-rates. A foveation-based image quality metric, namely, foveated wavelet image quality index (FWQI), plays an important role in the EFIC system. We also developed a modified SPIHT algorithm to improve the coding efficiency. Experiments show that EFIC integrates foveation filtering with foveated image coding and demonstrates very good coding performance and scalability in terms of foveated image quality measurement.
DEFF Research Database (Denmark)
2015-01-01
Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity in the net...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof.......Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...
Energy Technology Data Exchange (ETDEWEB)
Nelson, R.N. (ed.)
1985-05-01
This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name.
Application of RS Codes in Decoding QR Code
Institute of Scientific and Technical Information of China (English)
Zhu Suxia(朱素霞); Ji Zhenzhou; Cao Zhiyan
2003-01-01
The QR Code is a 2-dimensional matrix code with high error correction capability. It employs RS codes to generate error correction codewords in encoding and recover errors and damages in decoding. This paper presents several QR Code's virtues, analyzes RS decoding algorithm and gives a software flow chart of decoding the QR Code with RS decoding algorithm.
Evaluation Codes from an Affine Veriety Code Perspective
DEFF Research Database (Denmark)
Geil, Hans Olav
2008-01-01
Evaluation codes (also called order domain codes) are traditionally introduced as generalized one-point geometric Goppa codes. In the present paper we will give a new point of view on evaluation codes by introducing them instead as particular nice examples of affine variety codes. Our study...
Voltage Mode-to-Current Mode Transformation
Directory of Open Access Journals (Sweden)
Tejmal S. Rathore
2012-10-01
Full Text Available This paper proposes a procedure for converting a class of Op Amp-, FTFN-, CC- and CFAbased voltage mode circuits to corresponding current mode circuits without requiring any additional circuit elements and finally from Op Amp-based voltage mode circuits to any of the FTFN, CC and CFA current mode circuits. The latter circuits perform better at high frequency than the former ones. The validity of the transformation has been checked on simulated circuits with PSPICE.
Cauchy-perturbative matching and outer boundary conditions computational studies
Rezzolla, L; Matzner, R A; Rupright, M E; Shapiro, S L; Rezzolla, Luciano; Abrahams, Andrew M; Matzner, Richard A.; Rupright, Mark E.; Shapiro, Stuart L.
1999-01-01
We present results from a new technique which allows extraction of gravitational radiation information from a generic three-dimensional numerical relativity code and provides stable outer boundary conditions. In our approach we match the solution of a Cauchy evolution of the nonlinear Einstein field equations to a set of one-dimensional linear equations obtained through perturbation techniques over a curved background. We discuss the validity of this approach in the case of linear and mildly nonlinear gravitational waves and show how a numerical module developed for this purpose is able to provide an accurate and numerically convergent description of the gravitational wave propagation and a stable numerical evolution.
Genetic Programming Framework for Fingerprint Matching
Ismail, Ismail A; Abd-ElWahid, Mohammed A; ElKafrawy, Passent M; Nasef, Mohammed M
2009-01-01
A fingerprint matching is a very difficult problem. Minutiae based matching is the most popular and widely used technique for fingerprint matching. The minutiae points considered in automatic identification systems are based normally on termination and bifurcation points. In this paper we propose a new technique for fingerprint matching using minutiae points and genetic programming. The goal of this paper is extracting the mathematical formula that defines the minutiae points.
Distributed multiple description coding
Bai, Huihui; Zhao, Yao
2011-01-01
This book examines distributed video coding (DVC) and multiple description coding (MDC), two novel techniques designed to address the problems of conventional image and video compression coding. Covering all fundamental concepts and core technologies, the chapters can also be read as independent and self-sufficient, describing each methodology in sufficient detail to enable readers to repeat the corresponding experiments easily. Topics and features: provides a broad overview of DVC and MDC, from the basic principles to the latest research; covers sub-sampling based MDC, quantization based MDC,
2014-01-01
While cracking a code might seem like something few of us would encounter in our daily lives, it is actually far more prevalent than we may realize. Anyone who has had personal information taken because of a hacked email account can understand the need for cryptography and the importance of encryption-essentially the need to code information to keep it safe. This detailed volume examines the logic and science behind various ciphers, their real world uses, how codes can be broken, and the use of technology in this oft-overlooked field.
Li, Songze; Maddah-Ali, Mohammad Ali; Avestimehr, A. Salman
2015-01-01
MapReduce is a commonly used framework for executing data-intensive jobs on distributed server clusters. We introduce a variant implementation of MapReduce, namely "Coded MapReduce", to substantially reduce the inter-server communication load for the shuffling phase of MapReduce, and thus accelerating its execution. The proposed Coded MapReduce exploits the repetitive mapping of data blocks at different servers to create coding opportunities in the shuffling phase to exchange (key,value) pair...
Brehm, Enrico M
2016-01-01
In this work, we introduce classical holographic codes. These can be understood as concatenated probabilistic codes and can be represented as networks uniformly covering hyperbolic space. In particular, classical holographic codes can be interpreted as maps from bulk degrees of freedom to boundary degrees of freedom. Interestingly, they are shown to exhibit features similar to those expected from the AdS/CFT correspondence. Among these are a version of the Ryu-Takayanagi formula and intriguing properties regarding bulk reconstruction and boundary representations of bulk operations. We discuss the relation of our findings with expectations from AdS/CFT and, in particular, with recent results from quantum error correction.
Sample evaluation of ontology-matching systems
Hage, W.R. van; Isaac, A.; Aleksovski, Z.
2007-01-01
Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on
Sample evaluation of ontology-matching systems
Hage, W.R. van; Isaac, A.; Aleksovski, Z.
2007-01-01
Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on
DEFICIENT CUBIC SPLINES WITH AVERAGE SLOPE MATCHING
Institute of Scientific and Technical Information of China (English)
V. B. Das; A. Kumar
2005-01-01
We obtain a deficient cubic spline function which matches the functions with certain area matching over a greater mesh intervals, and also provides a greater flexibility in replacing area matching as interpolation. We also study their convergence properties to the interpolating functions.
Fast and compact regular expression matching
DEFF Research Database (Denmark)
Bille, Philip; Farach-Colton, Martin
2008-01-01
We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how...
2010-04-01
... 24 Housing and Urban Development 1 2010-04-01 2010-04-01 false Match credit. 92.221 Section 92.221... INVESTMENT PARTNERSHIPS PROGRAM Program Requirements Matching Contribution Requirement § 92.221 Match credit. (a) When credit is given. Contributions are credited on a fiscal year basis at the time the...
Connections between the matching and chromatic polynomials
Directory of Open Access Journals (Sweden)
E. J. Farrell
1992-01-01
Full Text Available The main results established are (i a connection between the matching and chromatic polynomials and (ii a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.
Concerns on Monotonic Imbalance Bounding Matching Methods
Yatracos, Yannis G.
2013-01-01
Concerns are expressed for the Monotonic Imbalance Bounding (MIB) property (Iacus et al. 2011) and for MIB matching because i) the definition of the MIB property leads to inconsistencies and the nature of the imbalance measure is not clearly defined, ii) MIB property does not generalize Equal Percent Bias Reducing (EPBR) property, iii) MIB matching does not provide statistical information available with EPBR matching.
13 CFR 130.450 - Matching funds.
2010-01-01
... in the budget proposal. Cash sources shall be identified by name and account. All applicants must... received by the SBDC during the budget period, as long as the total Cash Match provided by the SBDC is 50... to the total amount of SBA funding. At least 50% of the Matching Funds must be Cash Match....
13 CFR 102.40 - Computer matching.
2010-01-01
... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Computer matching. 102.40 Section... Protection of Privacy and Access to Individual Records Under the Privacy Act of 1974 § 102.40 Computer matching. The OCIO will enforce the computer matching provisions of the Privacy Act. The FOI/PA Office...
39 CFR 266.10 - Computer matching.
2010-07-01
... 39 Postal Service 1 2010-07-01 2010-07-01 false Computer matching. 266.10 Section 266.10 Postal... Computer matching. (a) General. Any agency or Postal Service component that wishes to use records from a... records must submit its proposal to the Postal Service Manager Records Office. Computer matching...
Temporal coding by populations of auditory receptor neurons.
Sabourin, Patrick; Pollack, Gerald S
2010-03-01
Auditory receptor neurons of crickets are most sensitive to either low or high sound frequencies. Earlier work showed that the temporal coding properties of first-order auditory interneurons are matched to the temporal characteristics of natural low- and high-frequency stimuli (cricket songs and bat echolocation calls, respectively). We studied the temporal coding properties of receptor neurons and used modeling to investigate how activity within populations of low- and high-frequency receptors might contribute to the coding properties of interneurons. We confirm earlier findings that individual low-frequency-tuned receptors code stimulus temporal pattern poorly, but show that coding performance of a receptor population increases markedly with population size, due in part to low redundancy among the spike trains of different receptors. By contrast, individual high-frequency-tuned receptors code a stimulus temporal pattern fairly well and, because their spike trains are redundant, there is only a slight increase in coding performance with population size. The coding properties of low- and high-frequency receptor populations resemble those of interneurons in response to low- and high-frequency stimuli, suggesting that coding at the interneuron level is partly determined by the nature and organization of afferent input. Consistent with this, the sound-frequency-specific coding properties of an interneuron, previously demonstrated by analyzing its spike train, are also apparent in the subthreshold fluctuations in membrane potential that are generated by synaptic input from receptor neurons.
Mode field expansion in index-guiding microstructured optical fibers
Sharma, Dinesh Kumar; Sharma, Anurag
2013-05-01
The mode-field expander (MFE) is a microstructured optical fiber (MOF) based device that enlarges the modal field distribution and can couple light from large mode area (LMA) fibers into small core fibers or vice-versa and other optical waveguides. Using our earlier developed analytical field model, we studied the mode-field expansion in MOFs having triangular lattice, and low-loss splicing of MOFs to standard single-mode fibers (SMFs), based on the controlled all airhole collapse method, which leads to an optimum mode-field match at the joint interface of the MOF-SMF. Comparisons with available experimental and simulation results have also been included.
Energy Technology Data Exchange (ETDEWEB)
Freeman, L.N.; Wilson, R.E. [Oregon State Univ., Dept. of Mechanical Engineering, Corvallis, OR (United States)
1996-09-01
The FAST Code which is capable of determining structural loads on a flexible, teetering, horizontal axis wind turbine is described and comparisons of calculated loads with test data are given at two wind speeds for the ESI-80. The FAST Code models a two-bladed HAWT with degrees of freedom for blade bending, teeter, drive train flexibility, yaw, and windwise and crosswind tower motion. The code allows blade dimensions, stiffnesses, and weights to differ and models tower shadow, wind shear, and turbulence. Additionally, dynamic stall is included as are delta-3 and an underslung rotor. Load comparisons are made with ESI-80 test data in the form of power spectral density, rainflow counting, occurrence histograms, and azimuth averaged bin plots. It is concluded that agreement between the FAST Code and test results is good. (au)
Vermont Center for Geographic Information — (Link to Metadata) A ZIP Code Tabulation Area (ZCTA) is a statistical geographic entity that approximates the delivery area for a U.S. Postal Service five-digit...
DEFF Research Database (Denmark)
2015-01-01
Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof....
National Research Council Canada - National Science Library
Leslie Hawthorn
2008-01-01
This article examines the Google Summer of Code (GSoC) program, the world's first global initiative to introduce College and University students to free/libre open source software (F/LOSS) development...
Directory of Open Access Journals (Sweden)
Reshmi Banerjee
2015-06-01
Full Text Available A building code, or building control, is a set of rules that specify the minimum standards for constructed objects such as buildings and non building structures. The main purpose of building codes are to protect public health, safety and general welfare as they relate to the construction and occupancy of buildings and structures. The building code becomes law of a particular jurisdiction when formally enacted by the appropriate governmental or private authority. Building codes are generally intended to be applied by architects, engineers, constructors and regulators but are also used for various purposes by safety inspectors, environmental scientists, real estate developers, subcontractors, manufacturers of building products and materials, insurance companies, facility managers, tenants and others.
Anderson, John B
2017-01-01
Bandwidth Efficient Coding addresses the major challenge in communication engineering today: how to communicate more bits of information in the same radio spectrum. Energy and bandwidth are needed to transmit bits, and bandwidth affects capacity the most. Methods have been developed that are ten times as energy efficient at a given bandwidth consumption as simple methods. These employ signals with very complex patterns and are called "coding" solutions. The book begins with classical theory before introducing new techniques that combine older methods of error correction coding and radio transmission in order to create narrowband methods that are as efficient in both spectrum and energy as nature allows. Other topics covered include modulation techniques such as CPM, coded QAM and pulse design.
DEFF Research Database (Denmark)
Paolini, Enrico; Stefanovic, Cedomir; Liva, Gianluigi
2015-01-01
, in which the structure of the access protocol can be mapped to a structure of an erasure-correcting code defined on graph. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance than ALOHA. Several instances of coded......The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered...... as waste. However, if the common receiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access...
Code Disentanglement: Initial Plan
Energy Technology Data Exchange (ETDEWEB)
Wohlbier, John Greaton [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Kelley, Timothy M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Rockefeller, Gabriel M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Calef, Matthew Thomas [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-01-27
The first step to making more ambitious changes in the EAP code base is to disentangle the code into a set of independent, levelized packages. We define a package as a collection of code, most often across a set of files, that provides a defined set of functionality; a package a) can be built and tested as an entity and b) fits within an overall levelization design. Each package contributes one or more libraries, or an application that uses the other libraries. A package set is levelized if the relationships between packages form a directed, acyclic graph and each package uses only packages at lower levels of the diagram (in Fortran this relationship is often describable by the use relationship between modules). Independent packages permit independent- and therefore parallel|development. The packages form separable units for the purposes of development and testing. This is a proven path for enabling finer-grained changes to a complex code.
Practical significance of weld strength matching
Energy Technology Data Exchange (ETDEWEB)
Sloterdijk, W. [N.V. Nederlandse Gasunie, Groningen (Netherlands); Schipaanboord, W.N. [N.V. Nederlandse Gasunie, Groningen (Netherlands)
1996-10-01
Defect tolerance in welds in pipelines constructed in modern high strength material depends on the balance in strength between weld material and pipe material. The Guidelines on the assessment of girth weld defects published by the European Pipeline Research Group (EPRG) define in Tier 2 defect limits assuming that the (actual) weld metal yield strength is equal or greater than the yield strength of the parent material. The defect limits according to Tier 2 exceed the defect limits in `workmanship standards` (l>25 mm). Nevertheless, the draft European welding standard EN 288 does not yet require a test to measure and verify the weld metal yield strength. Gasunie has performed a test program with the aim to look at the practical significance of weld strength matching in a strain controlled situation and to verify the relevance of limits given in the European welding and line pipe codes, in combination with the EPRG Guidelines. It is concluded that the results of the tests confirm the defect acceptance limits according to Tier 2 of the EPRG Guidelines. (orig.) [Deutsch] Die Zulaessigkeit von Fehlern in Rundschweissnaehten in Rohrleitungen aus modernen hochfesten Baustaehlen haengt von dem Verhaeltnis der Werkstofffestigkeit des Schweissgutes zu der des Grundwerkstoffs ab. Die von der European Pipeline Research Group (EPRG) veroeffentlichte Richtlinie zur Bewertung von Schweissnahtfehlern gibt in der zweiten Bewertungsstufe (Tier 2) Werte fuer zulaessige Schweissnahtfehlergroessen unter der Bedingung an, dass die Dehngrenze des Schweissgutes groesser oder gleich der Dehngrenze des Grundwerkstoffs ist. Die nach Tier 2 zulaessigen Fehler sind groesser als die in `Good-workmanship`-Regelwerken angegebenen Fehlerlaenge (l>25 mm). Demgegenueber fehlt im Entwurf der europaeischen Schweissnorm EN 288 bislang ein solcher Dehngrenzennachweis. Gasunie hat ein Versuchsprogramm durchgefuehrt, um die Bedeutung der Schweissgutfestigkeit bei dehnungskontrollierter Belastung sowie
Manipulate acoustic waves by impedance matched acoustic metasurfaces
Wu, Ying; Mei, Jun; Aljahdali, Rasha
We design a type of acoustic metasurface, which is composed of carefully designed slits in a rigid thin plate. The effective refractive indices of different slits are different but the impedances are kept the same as that of the host medium. Numerical simulations show that such a metasurface can redirect or reflect a normally incident wave at different frequencies, even though it is impedance matched to the host medium. We show that the underlying mechanisms can be understood by using the generalized Snell's law, and a unified analytic model based on mode-coupling theory. We demonstrate some simple realization of such acoustic metasurface with real materials. The principle is also extended to the design of planar acoustic lens which can focus acoustic waves. Manipulate acoustic waves by impedance matched acoustic metasurfaces.
Mahdaviani, Kaveh; Tellambura, Chintha
2011-01-01
In this paper, an extension of raptor codes is introduced which keeps all the desirable properties of raptor codes, including the linear complexity of encoding and decoding per information bit, unchanged. The new design, however, improves the performance in terms of the reception rate. Our simulations show a 10% reduction in the needed overhead at the benchmark block length of 64,520 bits and with the same complexity per information bit.
Role of stable modes in zonal flow regulated ITG turbulence
Makwana, Kirit; Terry, Paul; Hatch, David; Pueschel, M. J.
2012-10-01
Stable modes are studied in zonal flow regulated ITG turbulence using the gyrokinetic code GENE. Proper orthogonal decomposition (POD) modes are employed to investigate the eigenmode space of the distribution function. Both the unstable and stable POD modes show strong nonlinear energy transfer via three wave interactions that include zonal modes. The zonal mode itself absorbs a small fraction of the energy injected by the unstable mode. The remaining energy is deposited in the stable modes of non-zonal wavenumbers that are involved in the three wave coupling. These stable modes lie mostly within the wavenumber range of the instability. This indicates that zonal flows mediate energy transfer from unstable to stable modes, leading to saturation. The amplitude attenuation rate (AAR) of POD modes shows an equipartition across a large range of stable modes. This rate is balanced by three wave correlations of the POD modes and their time dependent amplitudes. These correlations are large if they involve zonal modes and they also show an equipartition for higher mode numbers. A similar analysis using linear eigenmodes also shows rough equipartition among the linear modes. Thus, AAR provides a handle to collectively describe the multitude of stable modes in a gyrokinetic simulation.
Y junctions in photonic crystal channel waveguides: high transmission and impedance matching.
Boscolo, S; Midrio, M; Krauss, T F
2002-06-15
We investigate the efficiency of transmission through photonic crystal Y junctions and show the importance of matching mode symmetries. Furthermore, we show that by adding tuning holes to the input waveguide it is possible to achieve almost perfect impedance matching, leading ideally to unitary transmission through the junction. The model system is based on a triangular photonic lattice of holes in dielectrics to reflect experimental reality.
Matching network for RF plasma source
Pickard, Daniel S.; Leung, Ka-Ngo
2007-11-20
A compact matching network couples an RF power supply to an RF antenna in a plasma generator. The simple and compact impedance matching network matches the plasma load to the impedance of a coaxial transmission line and the output impedance of an RF amplifier at radio frequencies. The matching network is formed of a resonantly tuned circuit formed of a variable capacitor and an inductor in a series resonance configuration, and a ferrite core transformer coupled to the resonantly tuned circuit. This matching network is compact enough to fit in existing compact focused ion beam systems.
Image matching navigation based on fuzzy information
Institute of Scientific and Technical Information of China (English)
田玉龙; 吴伟仁; 田金文; 柳健
2003-01-01
In conventional image matching methods, the image matching process is mostly based on image statistic information. One aspect neglected by all these methods is that there is much fuzzy information contained in these images. A new fuzzy matching algorithm based on fuzzy similarity for navigation is presented in this paper. Because the fuzzy theory is of the ability of making good description of the fuzzy information contained in images, the image matching method based on fuzzy similarity would look forward to producing good performance results. Experimental results using matching algorithm based on fuzzy information also demonstrate its reliability and practicability.
Institute of Scientific and Technical Information of China (English)
王燕; 周冬梅; 鲁若愚
2015-01-01
促进农民增收和就业是我国现阶段解决三农问题的核心，而鼓励农民创业是重要途径。从社会嵌入视角出发，从关系嵌入、知识嵌入、文化嵌入和政治嵌入对我国农民创业环境进行了分析，在此基础上对我国的农民创业环境及创业模式的匹配性进行了探讨，并提出城镇化进程中农民创业的三个进阶模式。%Promoting the increase of farmers’ income and employment is the core of solving the issues concerning agriculture, countryside and farmers, while encouraging the farmer entrepreneurship is the most import path in our country. From the perspective of social embeddedness, this paper analyzes the farmers’ entrepreneurial environment in our country form the relationship embeddedness, knowledege embeddedness, culture embeddedness, and policy embeddedness, based on which it also discusses the mathing of the entrepreneurial environment and farmer entrepreneurship modes. Finally, it proposes the three advancing modes of farmer entrepreneurship in the process of urbanization.
Yang, Qianli; Pitkow, Xaq
2015-03-01
Most interesting natural sensory stimuli are encoded in the brain in a form that can only be decoded nonlinearly. But despite being a core function of the brain, nonlinear population codes are rarely studied and poorly understood. Interestingly, the few existing models of nonlinear codes are inconsistent with known architectural features of the brain. In particular, these codes have information content that scales with the size of the cortical population, even if that violates the data processing inequality by exceeding the amount of information entering the sensory system. Here we provide a valid theory of nonlinear population codes by generalizing recent work on information-limiting correlations in linear population codes. Although these generalized, nonlinear information-limiting correlations bound the performance of any decoder, they also make decoding more robust to suboptimal computation, allowing many suboptimal decoders to achieve nearly the same efficiency as an optimal decoder. Although these correlations are extremely difficult to measure directly, particularly for nonlinear codes, we provide a simple, practical test by which one can use choice-related activity in small populations of neurons to determine whether decoding is suboptimal or optimal and limited by correlated noise. We conclude by describing an example computation in the vestibular system where this theory applies. QY and XP was supported by a grant from the McNair foundation.
Barbarien, Joeri; Munteanu, Adrian; Verdicchio, Fabio; Andreopoulos, Yiannis; Cornelis, Jan P.; Schelkens, Peter
2004-11-01
Modern video coding applications require transmission of video data over variable-bandwidth channels to a variety of terminals with different screen resolutions and available computational power. Scalable video coding is needed to optimally support these applications. Recently proposed wavelet-based video codecs employing spatial domain motion compensated temporal filtering (SDMCTF) provide quality, resolution and frame-rate scalability while delivering compression performance comparable to that of the state-of-the-art non-scalable H.264-codec. These codecs require scalable coding of the motion vectors in order to support a large range of bit-rates with optimal compression efficiency. Scalable motion vector coding algorithms based on the integer wavelet transform followed by embedded coding of the wavelet coefficients were recently proposed. In this paper, a new and fundamentally different scalable motion vector codec (MVC) using median-based motion vector prediction is proposed. Extensive experimental results demonstrate that the proposed MVC systematically outperforms the wavelet-based state-of-the-art solutions. To be able to take advantage of the proposed scalable MVC, a rate allocation mechanism capable of optimally dividing the available rate among texture and motion information is required. Two rate allocation strategies are proposed and compared. The proposed MVC and rate allocation schemes are incorporated into an SDMCTF-based video codec and the benefits of scalable motion vector coding are experimentally demonstrated.
Wu, Yingquan
2008-01-01
The paper has a threefold purpose. The first purpose is to present an explicit description of expanded cyclic codes defined in $\\GF(q^m)$. The proposed explicit construction of expanded generator matrix and expanded parity check matrix maintains the symbol-wise algebraic structure and thus keeps many important original characteristics. The second purpose of this paper is to identify a class of constant-weight cyclic codes. Specifically, we show that a well-known class of $q$-ary BCH codes excluding the all-zero codeword are constant-weight cyclic codes. Moreover, we show this class of codes achieve the Plotkin bound. The last purpose of the paper is to characterize expanded cyclic codes utilizing the proposed expanded generator matrix and parity check matrix. We analyze the properties of component codewords of a codeword and particularly establish the precise conditions under which a codeword can be represented by a subbasis. With the new insights, we present an improved lower bound on the minimum distance of...
Microtearing modes in tokamak discharges
Energy Technology Data Exchange (ETDEWEB)
Rafiq, T.; Kritz, A. H. [Department of Physics, Lehigh University, Bethlehem, Pennsylvania 18015 (United States); Weiland, J. [Department of Applied Physics, Chalmers University, S41296 Gothenburg (Sweden); Luo, L. [IBM Research, Oak Ridge, Tennessee 37831 (United States); Pankin, A. Y. [Tech-X Corporation, Boulder, Colorado 80308 (United States)
2016-06-15
Microtearing modes (MTMs) have been identified as a source of significant electron thermal transport in tokamak discharges. In order to describe the evolution of these discharges, it is necessary to improve the prediction of electron thermal transport. This can be accomplished by utilizing a model for transport driven by MTMs in whole device predictive modeling codes. The objective of this paper is to develop the dispersion relation that governs the MTM driven transport. A unified fluid/kinetic approach is used in the development of a nonlinear dispersion relation for MTMs. The derivation includes the effects of electrostatic and magnetic fluctuations, arbitrary electron-ion collisionality, electron temperature and density gradients, magnetic curvature, and the effects associated with the parallel propagation vector. An iterative nonlinear approach is used to calculate the distribution function employed in obtaining the nonlinear parallel current and the nonlinear dispersion relation. The third order nonlinear effects in magnetic fluctuations are included, and the influence of third order effects on a multi-wave system is considered. An envelope equation for the nonlinear microtearing modes in the collision dominant limit is introduced in order to obtain the saturation level. In the limit that the mode amplitude does not vary along the field line, slab geometry, and strong collisionality, the fluid dispersion relation for nonlinear microtearing modes is found to agree with the kinetic dispersion relation.
Microtearing modes in tokamak discharges
Rafiq, T.; Weiland, J.; Kritz, A. H.; Luo, L.; Pankin, A. Y.
2016-06-01
Microtearing modes (MTMs) have been identified as a source of significant electron thermal transport in tokamak discharges. In order to describe the evolution of these discharges, it is necessary to improve the prediction of electron thermal transport. This can be accomplished by utilizing a model for transport driven by MTMs in whole device predictive modeling codes. The objective of this paper is to develop the dispersion relation that governs the MTM driven transport. A unified fluid/kinetic approach is used in the development of a nonlinear dispersion relation for MTMs. The derivation includes the effects of electrostatic and magnetic fluctuations, arbitrary electron-ion collisionality, electron temperature and density gradients, magnetic curvature, and the effects associated with the parallel propagation vector. An iterative nonlinear approach is used to calculate the distribution function employed in obtaining the nonlinear parallel current and the nonlinear dispersion relation. The third order nonlinear effects in magnetic fluctuations are included, and the influence of third order effects on a multi-wave system is considered. An envelope equation for the nonlinear microtearing modes in the collision dominant limit is introduced in order to obtain the saturation level. In the limit that the mode amplitude does not vary along the field line, slab geometry, and strong collisionality, the fluid dispersion relation for nonlinear microtearing modes is found to agree with the kinetic dispersion relation.
Extremal Matching Energy of Complements of Trees
Directory of Open Access Journals (Sweden)
Wu Tingzeng
2016-08-01
Full Text Available Gutman and Wagner proposed the concept of the matching energy which is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph. And they pointed out that the chemical applications of matching energy go back to the 1970s. Let T be a tree with n vertices. In this paper, we characterize the trees whose complements have the maximal, second-maximal and minimal matching energy. Furthermore, we determine the trees with edge-independence number p whose complements have the minimum matching energy for p = 1, 2, . . . , [n/2]. When we restrict our consideration to all trees with a perfect matching, we determine the trees whose complements have the second-maximal matching energy.
NEW BINARY USER CODES FOR DS CDMA COMMUNICATION
Directory of Open Access Journals (Sweden)
NEELAM SRIVASTAVA
2011-12-01
Full Text Available Spread spectrum (SS is a modulation technique in which the signal occupies a bandwidth much larger than the minimum necessary to send the information. A synchronized reception with the code at the receiver is used for despreading the information before data recovery. From a long period, Walsh codes and Gold codes have been used as spread spectrum codes in Code Division Multiple Access (CDMA communications because of their ease of generation than the efficiency of these codes. Walsh codes are perfectly orthogonal binary user codes that have many popular applications in synchronous multicarrier communications although they perform poorly for asynchronous multi-user communications. Therefore, the nearly orthogonal Gold codes with their superior performance are the preferred user codes in asynchronous CDMA communications with small number of simultaneous users in the system due to their good auto-correlation (intracode correlation and cross-correlation (inter-code properties. Major drawback of these codes is that they are limited in number and in their lengths. In this paper, we performed MATLAB (7.1version algorithm to obtain the new orthogonal sets of binary space for multiuser spread-spectrum communications. We compared their performance with existing codes like Gold and Walsh code families. Our comparisons include their time domain properties like auto and cross-correlations along with bit error rate (BER performances in additive white Gaussian noise (AWGN and Rayleigh channel for the synchronous and asynchronous DS-CDMA communications. It is shown that these codes outperform the Walsh codes significantly and they match in performance with the popular nearly orthogonal Gold codes closely for asynchronous multiuser communications in AWGN noise. It is also shown that all of the binary code families considered performed comparable for Rayleigh flat-fading channels. So these new codes can be used both for asynchronous and synchronous direct sequence
Non-Binary Polar Codes using Reed-Solomon Codes and Algebraic Geometry Codes
Mori, Ryuhei
2010-01-01
Polar codes, introduced by Arikan, achieve symmetric capacity of any discrete memoryless channels under low encoding and decoding complexity. Recently, non-binary polar codes have been investigated. In this paper, we calculate error probability of non-binary polar codes constructed on the basis of Reed-Solomon matrices by numerical simulations. It is confirmed that 4-ary polar codes have significantly better performance than binary polar codes on binary-input AWGN channel. We also discuss an interpretation of polar codes in terms of algebraic geometry codes, and further show that polar codes using Hermitian codes have asymptotically good performance.
Matching roots to their environment.
White, Philip J; George, Timothy S; Gregory, Peter J; Bengough, A Glyn; Hallett, Paul D; McKenzie, Blair M
2013-07-01
Plants form the base of the terrestrial food chain and provide medicines, fuel, fibre and industrial materials to humans. Vascular land plants rely on their roots to acquire the water and mineral elements necessary for their survival in nature or their yield and nutritional quality in agriculture. Major biogeochemical fluxes of all elements occur through plant roots, and the roots of agricultural crops have a significant role to play in soil sustainability, carbon sequestration, reducing emissions of greenhouse gasses, and in preventing the eutrophication of water bodies associated with the application of mineral fertilizers. This article provides the context for a Special Issue of Annals of Botany on 'Matching Roots to Their Environment'. It first examines how land plants and their roots evolved, describes how the ecology of roots and their rhizospheres contributes to the acquisition of soil resources, and discusses the influence of plant roots on biogeochemical cycles. It then describes the role of roots in overcoming the constraints to crop production imposed by hostile or infertile soils, illustrates root phenotypes that improve the acquisition of mineral elements and water, and discusses high-throughput methods to screen for these traits in the laboratory, glasshouse and field. Finally, it considers whether knowledge of adaptations improving the acquisition of resources in natural environments can be used to develop root systems for sustainable agriculture in the future.
Towards Robust Image Matching Algorithms
Parsons, Timothy J.
1984-12-01
The rapid advance in digital electronics during recent years has enabled the real-time hardware implementation of many basic image processing techniques and these methods are finding increasing use in both commercial and military applications where a superiority to existing systems can be demonstrated. The potential superiority of an entirely passive, automatic image processing based navigation system over the less accurate and active navigation systems based on radar, for example "TERCOM", is evident. By placing a sensor on board an aircraft or missile together with the appropriate processing power and enough memory to store a reference image or a map of the planned route, large scale features extracted from the scene available to the sensor can be compared with the same feature stored in memory. The difference between the aircraft's actual position and its desired position can then be evaluated and the appropriate navigational correction undertaken. This paper summaries work carried out at British Aerospace Hatfield to investigate various classes of algorithms and solutions which would render a robust image matching system viable for such an automatic system flying at low level with a thermal I.R. sensor.
Orthogonal Matching Pursuit with Replacement
Jain, Prateek; Dhillon, Inderjit S
2011-01-01
In this paper, we consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding operator that leads to a general family of iterative algorithms. While one extreme of the family yields well known hard thresholding algorithms like ITI (Iterative Thresholding with Inversion) and HTP (Hard Thresholding Pursuit), the other end of the spectrum leads to a novel algorithm that we call Orthogonal Matching Pursuit with Replacement (OMPR). OMPR, like the classic greedy algorithm OMP, adds exactly one coordinate to the support at each iteration, based on the correlation with the current residual. However, unlike OMP, OMPR also removes one coordinate from the support. This simple change allows us to prove that OMPR has the best known guarantees for sparse recovery in terms of the Restricted Isometry Property (a condition on the measurement matrix). In contrast, OMP is kn...
Maximum Matchings via Glauber Dynamics
Jindal, Anant; Pal, Manjish
2011-01-01
In this paper we study the classic problem of computing a maximum cardinality matching in general graphs $G = (V, E)$. The best known algorithm for this problem till date runs in $O(m \\sqrt{n})$ time due to Micali and Vazirani \\cite{MV80}. Even for general bipartite graphs this is the best known running time (the algorithm of Karp and Hopcroft \\cite{HK73} also achieves this bound). For regular bipartite graphs one can achieve an $O(m)$ time algorithm which, following a series of papers, has been recently improved to $O(n \\log n)$ by Goel, Kapralov and Khanna (STOC 2010) \\cite{GKK10}. In this paper we present a randomized algorithm based on the Markov Chain Monte Carlo paradigm which runs in $O(m \\log^2 n)$ time, thereby obtaining a significant improvement over \\cite{MV80}. We use a Markov chain similar to the \\emph{hard-core model} for Glauber Dynamics with \\emph{fugacity} parameter $\\lambda$, which is used to sample independent sets in a graph from the Gibbs Distribution \\cite{V99}, to design a faster algori...
Holography and Conformal Anomaly Matching
Cabo-Bizet, Alejandro; Narain, K S
2013-01-01
We discuss various issues related to the understanding of the conformal anomaly matching in CFT from the dual holographic viewpoint. First, we act with a PBH diffeomorphism on a generic 5D RG flow geometry and show that the corresponding on-shell bulk action reproduces the Wess-Zumino term for the dilaton of broken conformal symmetry, with the expected coefficient aUV-aIR. Then we consider a specific 3D example of RG flow whose UV asymptotics is normalizable and admits a 6D lifting. We promote a modulus \\rho appearing in the geometry to a function of boundary coordinates. In a 6D description {\\rho} is the scale of an SU(2) instanton. We determine the smooth deformed background up to second order in the space-time derivatives of \\rho and find that the 3D on-shell action reproduces a boundary kinetic term for the massless field \\tau= log(\\rho) with the correct coefficient \\delta c=cUV-cIR. We further analyze the linearized fluctuations around the deformed background geometry and compute the one-point functions ...
Voice Matching Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Abhishek Bal
2014-03-01
Full Text Available In this paper, the use of Genetic Algorithm (GA for voice recognition is described. The practical application of Genetic Algorithm (GA to the solution of engineering problem is a rapidly emerging approach in the field of control engineering and signal processing. Genetic algorithms are useful for searching a space in multi-directional way from large spaces and poorly defined space. Voice is a signal of infinite information. Digital processing of voice signal is very important for automatic voice recognition technology. Nowadays, voice processing is very much important in security mechanism due to mimicry characteristic. So studying the voice feature extraction in voice processing is very necessary in military, hospital, telephone system, investigation bureau and etc. In order to extract valuable information from the voice signal, make decisions on the process, and obtain results, the data needs to be manipulated and analyzed. In this paper, if the instant voice is not matched with same person’s reference voices in the database, then Genetic Algorithm (GA is applied between two randomly chosen reference voices. Again the instant voice is compared with the result of Genetic Algorithm (GA which is used, including its three main steps: selection, crossover and mutation. We illustrate our approach with different sample of voices from human in our institution.
Impedance matching at arterial bifurcations.
Brown, N
1993-01-01
Reflections of pulse waves will occur in arterial bifurcations unless the impedance is matched continuously through changing geometric and elastic properties. A theoretical model is presented which minimizes pulse wave reflection through bifurcations. The model accounts for the observed linear changes in area within the bifurcation, generalizes the theory to asymmetrical bifurcations, characterizes changes in elastic properties from parent to daughter arteries, and assesses the effect of branch angle on the mechanical properties of daughter vessels. In contradistinction to previous models, reflections cannot be minimized without changes in elastic properties through bifurcations. The theoretical model predicts that in bifurcations with area ratios (beta) less than 1.0 Young's moduli of daughter vessels may be less than that in the parent vessel if the Womersley parameter alpha in the parent vessel is less than 5. Larger area ratios in bifurcations are accompanied by greater increases in Young's moduli of branches. For an idealized symmetric aortic bifurcation (alpha = 10) with branching angles theta = 30 degrees (opening angle 60 degrees) Young's modulus of common iliac arteries relative to that of the distal abdominal aorta has an increase of 1.05, 1.68 and 2.25 for area ratio of 0.8, 1.0 and 1.15, respectively. These predictions are consistent with the observed increases in Young's moduli of peripheral vessels.(ABSTRACT TRUNCATED AT 250 WORDS)
Explicit pattern matching assignment algorithm
Levedahl, Mark
2002-08-01
Sharing data between two tracking systems frequently involves use of an object map: the transmitting system sends a frame of data with multiple observations, and the receiving system uses an assignment algorithm to correlate the information with its local observation data base. The usual prescription for this problem is an optimal assignment algorithm (such as JVC or auction) using a cost matrix based upon chi-squared distances between the local and remote observation data. The optimal assignment algorithm does not actually perform pattern matching, so this approach is not robust to large registration errors between the two systems when there exist differences in the number of observations held by both systems. Performance of a new assignment algorithm that uses a cost function including terms for both registration errors and track to track random errors is presented: the cost function explicitly includes a bias between the two observation sets and thus provides a maximum likelihood solution to the assignment problem. In practice, this assignment approach provides near perfect assignment accuracy in cases where the bias errors exceed the dimension of the transmitted object map and there exist mismatches in the numbers of observations made by the two systems. This performance extends to many cases where the optimal assignment algorithm methodology produces errors nearly 100% of the time. The paper includes the theoretical foundation of the assignment problem solved and comparison of achieved accuracy with existing optimal assignment approaches.
Best Practices for NPT Transit Matching
Energy Technology Data Exchange (ETDEWEB)
Gilligan, Kimberly V. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Whitaker, J. Michael [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Oakberg, John A. [Tetra Tech, Inc., Oak Ridge, TN (United States); Snow, Catherine [Sno Consulting, LLC, Sandy, UT (United States)
2016-09-01
Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity s experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.
Best Practices for NPT Transit Matching
Energy Technology Data Exchange (ETDEWEB)
Gilligan, Kimberly V. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Whitaker, J. Michael [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Oakberg, John A. [Tetra Tech, Inc., Oak Ridge, TN (United States); Snow, Catherine [Sno Consulting, LLC, Sandy, UT (United States)
2016-09-01
Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.
High Luminosity LHC matching section layout vs crab cavity voltage
Dalena, B; Chance, A; De Maria, R; Fartoukh, S
2013-01-01
In the framework of the HiLumi-LHC project we present a new possible variant for the layout of the LHC matching section located in the high luminosity insertions. This layout is optimized to reduce the demand on the voltage of the crab cavities, while substantially improving the optics squeeze-ability, both in ATS [1] and non-ATS mode. This new layout will be described in details together with its performance figures in terms of mechanical acceptance, chromatic properties and optics flexibility.
Distributed Video Coding: Iterative Improvements
DEFF Research Database (Denmark)
Luong, Huynh Van
Nowadays, emerging applications such as wireless visual sensor networks and wireless video surveillance are requiring lightweight video encoding with high coding efficiency and error-resilience. Distributed Video Coding (DVC) is a new coding paradigm which exploits the source statistics...
Polynomial weights and code constructions
DEFF Research Database (Denmark)
Massey, J; Costello, D; Justesen, Jørn
1973-01-01
polynomial included. This fundamental property is then used as the key to a variety of code constructions including 1) a simplified derivation of the binary Reed-Muller codes and, for any primepgreater than 2, a new extensive class ofp-ary "Reed-Muller codes," 2) a new class of "repeated-root" cyclic codes...... that are subcodes of the binary Reed-Muller codes and can be very simply instrumented, 3) a new class of constacyclic codes that are subcodes of thep-ary "Reed-Muller codes," 4) two new classes of binary convolutional codes with large "free distance" derived from known binary cyclic codes, 5) two new classes...... of long constraint length binary convolutional codes derived from2^r-ary Reed-Solomon codes, and 6) a new class ofq-ary "repeated-root" constacyclic codes with an algebraic decoding algorithm....
Indoor Mobile Positioning Based on Lidar Data and Coded Sequence Pattern
Wang, Z.; Dong, B.; Chen, D.
2016-10-01
This paper proposed a coded sequence pattern for automatic matching of LiDAR point data, the methods including SIFT features, Otsu segmentation and Fast Hough transformation for the identification, positioning and interpret of the coded sequence patterns, the POSIT model for fast computing the translation and rotation parameters of LiDAR point data, so as to achieve fast matching of LiDAR point data and automatic 3D mapping of indoor shafts and tunnels.
The CHEASE code for toroidal MHD equilibria
Energy Technology Data Exchange (ETDEWEB)
Luetjens, H. [Ecole Polytechnique, 91 - Palaiseau (France). Centre de Physique Theorique; Bondeson, A. [Chalmers Univ. of Technology, Goeteborg (Sweden). Inst. for Electromagnetic Field Theory and Plasma Physics; Sauter, O. [ITER-San Diego, La Jolla, CA (United States)
1996-03-01
CHEASE solves the Grad-Shafranov equation for the MHD equilibrium of a Tokamak-like plasma with pressure and current profiles specified by analytic forms or sets of data points. Equilibria marginally stable to ballooning modes or with a prescribed fraction of bootstrap current can be computed. The code provides a mapping to magnetic flux coordinates, suitable for MHD stability calculations or global wave propagation studies. The code computes equilibrium quantities for the stability codes ERATO, MARS, PEST, NOVA-W and XTOR and for the global wave propagation codes LION and PENN. The two-dimensional MHD equilibrium (Grad-Shafranov) equation is solved in variational form. The discretization uses bicubic Hermite finite elements with continuous first order derivates for the poloidal flux function {Psi}. The nonlinearity of the problem is handled by Picard iteration. The mapping to flux coordinates is carried out with a method which conserves the accuracy of the cubic finite elements. The code uses routines from the CRAY libsci.a program library. However, all these routines are included in the CHEASE package itself. If CHEASE computes equilibrium quantities for MARS with fast Fourier transforms, the NAG library is required. CHEASE is written in standard FORTRAN-77, except for the use of the input facility NAMELIST. CHEASE uses variable names with up to 8 characters, and therefore violates the ANSI standard. CHEASE transfers plot quantities through an external disk file to a plot program named PCHEASE using the UNIRAS or the NCAR plot package. (author) figs., tabs., 34 refs.
On DNA codes from a family of chain rings
Directory of Open Access Journals (Sweden)
Elif Segah Oztas
2017-01-01
Full Text Available In this work, we focus on reversible cyclic codes which correspond to reversible DNA codes or reversible-complement DNA codes over a family of finite chain rings, in an effort to extend what was done by Yildiz and Siap in [20]. The ring family that we have considered are of size $2^{2^k}$, $k=1,2, \\cdots$ and we match each ring element with a DNA $2^{k-1}$-mer. We use the so-called $u^2$-adic digit system to solve the reversibility problem and we characterize cyclic codes that correspond to reversible-complement DNA-codes. We then conclude our study with some examples.
Product Codes for Optical Communication
DEFF Research Database (Denmark)
Andersen, Jakob Dahl
2002-01-01
Many optical communicaton systems might benefit from forward-error-correction. We present a hard-decision decoding algorithm for the "Block Turbo Codes", suitable for optical communication, which makes this coding-scheme an alternative to Reed-Solomon codes.......Many optical communicaton systems might benefit from forward-error-correction. We present a hard-decision decoding algorithm for the "Block Turbo Codes", suitable for optical communication, which makes this coding-scheme an alternative to Reed-Solomon codes....
Directory of Open Access Journals (Sweden)
Rumen Daskalov
2017-07-01
Full Text Available Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ over $GF(q$. One of the most important problems in coding theory is to construct codes with optimal minimum distances. In this paper 22 new ternary linear codes are presented. Two of them are optimal. All new codes improve the respective lower bounds in [11].
Algebraic geometric codes with applications
Institute of Scientific and Technical Information of China (English)
CHEN Hao
2007-01-01
The theory of linear error-correcting codes from algebraic geomet-ric curves (algebraic geometric (AG) codes or geometric Goppa codes) has been well-developed since the work of Goppa and Tsfasman, Vladut, and Zink in 1981-1982. In this paper we introduce to readers some recent progress in algebraic geometric codes and their applications in quantum error-correcting codes, secure multi-party computation and the construction of good binary codes.
New approach to the normal mode method in underwater acoustics
Institute of Scientific and Technical Information of China (English)
王宁; 刘进忠
2002-01-01
A new approach to the numerical solution of normal mode problems in underwater acoustics is presented, in whichthe corresponding normal mode problem is transformed to the problem of solving a dynamic system. Three applica-tions are considered: (1) the broad band normal mode problem; (2) the range-dependent problem with perturbationproportional to the range parameter; and (3) the evolution of the normal mode with environmental parameters. Anumerical simulation for a broad band problem is performed, and the calculated eigenvalues have good agreement withthose obtained by the standard normal mode code KRAKAN.
Image Coding Based on Address Vector Quantization.
Feng, Yushu
Image coding is finding increased application in teleconferencing, archiving, and remote sensing. This thesis investigates the potential of Vector Quantization (VQ), a relatively new source coding technique, for compression of monochromatic and color images. Extensions of the Vector Quantization technique to the Address Vector Quantization method have been investigated. In Vector Quantization, the image data to be encoded are first processed to yield a set of vectors. A codeword from the codebook which best matches the input image vector is then selected. Compression is achieved by replacing the image vector with the index of the code-word which produced the best match, the index is sent to the channel. Reconstruction of the image is done by using a table lookup technique, where the label is simply used as an address for a table containing the representative vectors. A code-book of representative vectors (codewords) is generated using an iterative clustering algorithm such as K-means, or the generalized Lloyd algorithm. A review of different Vector Quantization techniques are given in chapter 1. Chapter 2 gives an overview of codebook design methods including the Kohonen neural network to design codebook. During the encoding process, the correlation of the address is considered and Address Vector Quantization is developed for color image and monochrome image coding. Address VQ which includes static and dynamic processes is introduced in chapter 3. In order to overcome the problems in Hierarchical VQ, Multi-layer Address Vector Quantization is proposed in chapter 4. This approach gives the same performance as that of the normal VQ scheme but the bit rate is about 1/2 to 1/3 as that of the normal VQ method. In chapter 5, a Dynamic Finite State VQ based on a probability transition matrix to select the best subcodebook to encode the image is developed. In chapter 6, a new adaptive vector quantization scheme, suitable for color video coding, called "A Self -Organizing
Directory of Open Access Journals (Sweden)
Ye Shuiming
2009-01-01
Full Text Available Distributed video coding (DVC is a video coding paradigm allowing low complexity encoding for emerging applications such as wireless video surveillance. Side information (SI generation is a key function in the DVC decoder, and plays a key-role in determining the performance of the codec. This paper proposes an improved SI generation for DVC, which exploits both spatial and temporal correlations in the sequences. Partially decoded Wyner-Ziv (WZ frames, based on initial SI by motion compensated temporal interpolation, are exploited to improve the performance of the whole SI generation. More specifically, an enhanced temporal frame interpolation is proposed, including motion vector refinement and smoothing, optimal compensation mode selection, and a new matching criterion for motion estimation. The improved SI technique is also applied to a new hybrid spatial and temporal error concealment scheme to conceal errors in WZ frames. Simulation results show that the proposed scheme can achieve up to 1.0 dB improvement in rate distortion performance in WZ frames for video with high motion, when compared to state-of-the-art DVC. In addition, both the objective and perceptual qualities of the corrupted sequences are significantly improved by the proposed hybrid error concealment scheme, outperforming both spatial and temporal concealments alone.
A novel neutron energy spectrum unfolding code using particle swarm optimization
Shahabinejad, H.; Sohrabpour, M.
2017-07-01
A novel neutron Spectrum Deconvolution using Particle Swarm Optimization (SDPSO) code has been developed to unfold the neutron spectrum from a pulse height distribution and a response matrix. The Particle Swarm Optimization (PSO) imitates the bird flocks social behavior to solve complex optimization problems. The results of the SDPSO code have been compared with those of the standard spectra and recently published Two-steps Genetic Algorithm Spectrum Unfolding (TGASU) code. The TGASU code have been previously compared with the other codes such as MAXED, GRAVEL, FERDOR and GAMCD and shown to be more accurate than the previous codes. The results of the SDPSO code have been demonstrated to match well with those of the TGASU code for both under determined and over-determined problems. In addition the SDPSO has been shown to be nearly two times faster than the TGASU code.
Optical coding theory with Prime
Kwong, Wing C
2013-01-01
Although several books cover the coding theory of wireless communications and the hardware technologies and coding techniques of optical CDMA, no book has been specifically dedicated to optical coding theory-until now. Written by renowned authorities in the field, Optical Coding Theory with Prime gathers together in one volume the fundamentals and developments of optical coding theory, with a focus on families of prime codes, supplemented with several families of non-prime codes. The book also explores potential applications to coding-based optical systems and networks. Learn How to Construct
Algebraic and stochastic coding theory
Kythe, Dave K
2012-01-01
Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes.
CHARACTER RECOGNITION BY MATCHING SEQUENCES OF PSEUDOSTROKE POSITIONS AND DIRECTIONS
Xue, H.; Givindaraju, V.
2004-01-01
Chaincoded contours are informative in offline character recognition. As approximations to contours, sequences of pseudostrokes consisting of both positional and directional information make up feature vectors for character images. In order to carry out fast pattern matching, a scheme of generati
CHARACTER RECOGNITION BY MATCHING SEQUENCES OF PSEUDOSTROKE POSITIONS AND DIRECTIONS
Xue, H.; Givindaraju, V.
2004-01-01
Chaincoded contours are informative in offline character recognition. As approximations to contours, sequences of pseudostrokes consisting of both positional and directional information make up feature vectors for character images. In order to carry out fast pattern matching, a scheme of
Institute of Scientific and Technical Information of China (English)
XIAO Chen; YUE Wei-Ming; ZHAO Hong-Wei; XIA Jia-Wen; HE Yuan; YUAN You-Jin; WANG Zhi-Jun; LIU Yong; HE Shou-Bo; XU Meng-Xin; CHANG Wei; LI Chao
2011-01-01
The ABC code is an optimization program for the development of matching channels and dynamical matchers in radio frequency quadrupole (RFQ) structures,and a new approach to this code to define the geometry of the radial matching section of the RFQ has been developed.This approach is based on the application of the numerical optimization step by step.This optimization is intended to search for the initial matching condition of a beam,the optimization of parameters of a cell of the channel on given characteristic parameters and traces of a beam in linear channels in both forward and backward directions.To further verify the results of the optimization,multi-particle beam dynamics simulations have been carried out using the BEAMPATH and TRACK codes.The result of the beam dynamics simulation shows that the optimization result of the ABC code is reasonable and this approach provides an opportunity to redesign the structure of the radial matching section of the RFQ.
Stability of the bipartite matching model
Bušić, Ana; Mairesse, Jean
2010-01-01
We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan, and Weiss (Adv. Appl. Probab., 2009). Customers and servers play symmetrical roles. There is a finite set C resp. S, of customer, resp. server, classes. Time is discrete and at each time step, one customer and one server arrive in the system according to a joint probability measure on CxS, independently of the past. Also, at each time step, pairs of matched customer and server, if they exist, depart from the system. Authorized matchings are given by a fixed bipartite graph. A matching policy is chosen, which decides how to match when there are several possibilities. Customers/servers that cannot be matched are stored in a buffer. The evolution of the model can be described by a discrete time Markov chain. We study its stability under various admissible matching policies including: ML (Match the Longest), MS (Match the Shortest), FIFO (match the oldest), priorities. There exist natural necessary conditions for st...
Golden Coded Multiple Beamforming
Li, Boyu
2010-01-01
The Golden Code is a full-rate full-diversity space-time code, which achieves maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two transmit and two receive antennas. Since four information symbols taken from an M-QAM constellation are selected to construct one Golden Code codeword, a maximum likelihood decoder using sphere decoding has the worst-case complexity of O(M^4), when the Channel State Information (CSI) is available at the receiver. Previously, this worst-case complexity was reduced to O(M^(2.5)) without performance degradation. When the CSI is known by the transmitter as well as the receiver, beamforming techniques that employ singular value decomposition are commonly used in MIMO systems. In the absence of channel coding, when a single symbol is transmitted, these systems achieve the full diversity order provided by the channel. Whereas this property is lost when multiple symbols are simultaneously transmitted. However, uncoded multiple beamforming can achieve the full div...
Performance of JPEG Image Transmission Using Proposed Asymmetric Turbo Code
Directory of Open Access Journals (Sweden)
Siddiqi Mohammad Umar
2007-01-01
Full Text Available This paper gives the results of a simulation study on the performance of JPEG image transmission over AWGN and Rayleigh fading channels using typical and proposed asymmetric turbo codes for error control coding. The baseline JPEG algorithm is used to compress a QCIF ( "Suzie" image. The recursive systematic convolutional (RSC encoder with generator polynomials , that is, (13/11 in decimal, and 3G interleaver are used for the typical WCDMA and CDMA2000 turbo codes. The proposed asymmetric turbo code uses generator polynomials , that is, (13/11; 13/9 in decimal, and a code-matched interleaver. The effect of interleaver in the proposed asymmetric turbo code is studied using weight distribution and simulation. The simulation results and performance bound for proposed asymmetric turbo code for the frame length , code rate with Log-MAP decoder over AWGN channel are compared with the typical system. From the simulation results, it is observed that the image transmission using proposed asymmetric turbo code performs better than that with the typical system.
Performance of JPEG Image Transmission Using Proposed Asymmetric Turbo Code
Directory of Open Access Journals (Sweden)
Mohamad Yusoff Alias
2007-01-01
Full Text Available This paper gives the results of a simulation study on the performance of JPEG image transmission over AWGN and Rayleigh fading channels using typical and proposed asymmetric turbo codes for error control coding. The baseline JPEG algorithm is used to compress a QCIF (176×144 “Suzie” image. The recursive systematic convolutional (RSC encoder with generator polynomials (1,D3+D2+1/D3+D+1, that is, (13/11 in decimal, and 3G interleaver are used for the typical WCDMA and CDMA2000 turbo codes. The proposed asymmetric turbo code uses generator polynomials (1,D3+D2+1/D3+D+1;D3+D2+1/D3+1, that is, (13/11; 13/9 in decimal, and a code-matched interleaver. The effect of interleaver in the proposed asymmetric turbo code is studied using weight distribution and simulation. The simulation results and performance bound for proposed asymmetric turbo code for the frame length N=400, code rate r=1/3 with Log-MAP decoder over AWGN channel are compared with the typical system. From the simulation results, it is observed that the image transmission using proposed asymmetric turbo code performs better than that with the typical system.
Speech coding code- excited linear prediction
Bäckström, Tom
2017-01-01
This book provides scientific understanding of the most central techniques used in speech coding both for advanced students as well as professionals with a background in speech audio and or digital signal processing. It provides a clear connection between the whys hows and whats thus enabling a clear view of the necessity purpose and solutions provided by various tools as well as their strengths and weaknesses in each respect Equivalently this book sheds light on the following perspectives for each technology presented Objective What do we want to achieve and especially why is this goal important Resource Information What information is available and how can it be useful and Resource Platform What kind of platforms are we working with and what are their capabilities restrictions This includes computational memory and acoustic properties and the transmission capacity of devices used. The book goes on to address Solutions Which solutions have been proposed and how can they be used to reach the stated goals and ...
Hand Vein Recognition Based on Improved Template Matching
Directory of Open Access Journals (Sweden)
Jun Wang
2014-12-01
Full Text Available An improved template-construction method for hand vein recognition is presented. The accomplishment of the new algorithm involves several steps. First, we design the power-controlled multispectral vein acquisition handset to establish high-quality hand vein database. Second, we propose an improved valley-shaped enhancement operator with NiBlack algorithm to realize vein segmentation. Third, we get a basic-shaped template after dilation and erosion operation in the four neighborhoods firstly, and then we can get the final matching template combining all the shapes after the process of filling the connected region whose threshold is smaller than the one we set according to the experiment effect. Finally we design the hand vein recognition experiments using the designed template and traditional template respectively. The recognition rate of the improved template is 96.6% under the 1:1 mode and 95.75% under the 1:N mode while the recognition rate of the traditional template is 89.2 under the 1:1 mode and 88.2 under the 1:N mode.
Phase-coded pulse aperiodic transmitter coding
Directory of Open Access Journals (Sweden)
I. I. Virtanen
2009-07-01
Full Text Available Both ionospheric and weather radar communities have already adopted the method of transmitting radar pulses in an aperiodic manner when measuring moderately overspread targets. Among the users of the ionospheric radars, this method is called Aperiodic Transmitter Coding (ATC, whereas the weather radar users have adopted the term Simultaneous Multiple Pulse-Repetition Frequency (SMPRF. When probing the ionosphere at the carrier frequencies of the EISCAT Incoherent Scatter Radar facilities, the range extent of the detectable target is typically of the order of one thousand kilometers – about seven milliseconds – whereas the characteristic correlation time of the scattered signal varies from a few milliseconds in the D-region to only tens of microseconds in the F-region. If one is interested in estimating the scattering autocorrelation function (ACF at time lags shorter than the F-region correlation time, the D-region must be considered as a moderately overspread target, whereas the F-region is a severely overspread one. Given the technical restrictions of the radar hardware, a combination of ATC and phase-coded long pulses is advantageous for this kind of target. We evaluate such an experiment under infinitely low signal-to-noise ratio (SNR conditions using lag profile inversion. In addition, a qualitative evaluation under high-SNR conditions is performed by analysing simulated data. The results show that an acceptable estimation accuracy and a very good lag resolution in the D-region can be achieved with a pulse length long enough for simultaneous E- and F-region measurements with a reasonable lag extent. The new experiment design is tested with the EISCAT Tromsø VHF (224 MHz radar. An example of a full D/E/F-region ACF from the test run is shown at the end of the paper.
Multipoint videoconferencing with scalable video coding
Institute of Scientific and Technical Information of China (English)
ELEFTHERIADIS Alexandros; CIVANLAR M. Reha; SHAPIRO Ofer
2006-01-01
We describe a system for multipoint videoconferencing that offers extremely low end-to-end delay, low cost and complexity, and high scalability, alongside standard features associated with high-end solutions such as rate matching and personal video layout. The system accommodates heterogeneous receivers and networks based on the Internet Protocol and relies on scalable video coding to provide a coded representation of a source video signal at multiple temporal and spatial resolutions as well as quality levels. These are represented by distinct bitstream components which are created at each end-user encoder. Depending on the specific conferencing environment, some or all of these components are transmitted to a Scalable Video Conferencing Server (SVCS). The SVCS redirects these components to one or more recipients depending on, e.g., the available network conditions and user preferences. The scalable aspect of the video coding technique allows the system to adapt to different network conditions, and also accommodates different end-user requirements (e.g., a user may elect to view another user at a high or low spatial resolution). Performance results concerning flexibility, video quality and delay of the system are presented using the Joint Scalable Video Model (JSVM) of the forthcoming SVC (H.264 Annex G) standard, demonstrating that scalable coding outperforms existing state-of-the-art systems and offers the right platform for building next-generation multipoint videoconferencing systems.
Benchmark of Different Electromagnetic Codes for the High Frequency Calculation
Energy Technology Data Exchange (ETDEWEB)
Kai Tian, Haipeng Wang, Frank Marhauser, Guangfeng Cheng, Chuandong Zhou
2009-05-01
In this paper, we present benchmarking results for highclass 3D electromagnetic (EM) codes in designing RF cavities today. These codes include Omega3P [1], VORPAL [2], CST Microwave Studio [3], Ansoft HFSS [4], and ANSYS [5]. Two spherical cavities are selected as the benchmark models. We have compared not only the accuracy of resonant frequencies, but also that of surface EM fields, which are critical for superconducting RF cavities. By removing degenerated modes, we calculate all the resonant modes up to 10 GHz with similar mesh densities, so that the geometry approximation and field interpolation error related to the wavelength can be observed.
Nested Quantum Error Correction Codes
Wang, Zhuo; Fan, Hen; Vedral, Vlatko
2009-01-01
The theory of quantum error correction was established more than a decade ago as the primary tool for fighting decoherence in quantum information processing. Although great progress has already been made in this field, limited methods are available in constructing new quantum error correction codes from old codes. Here we exhibit a simple and general method to construct new quantum error correction codes by nesting certain quantum codes together. The problem of finding long quantum error correction codes is reduced to that of searching several short length quantum codes with certain properties. Our method works for all length and all distance codes, and is quite efficient to construct optimal or near optimal codes. Two main known methods in constructing new codes from old codes in quantum error-correction theory, the concatenating and pasting, can be understood in the framework of nested quantum error correction codes.
Frutos-Alfaro, Francisco
2015-01-01
A program to generate codes in Fortran and C of the full Magnetohydrodynamic equations is shown. The program used the free computer algebra system software REDUCE. This software has a package called EXCALC, which is an exterior calculus program. The advantage of this program is that it can be modified to include another complex metric or spacetime. The output of this program is modified by means of a LINUX script which creates a new REDUCE program to manipulate the MHD equations to obtain a code that can be used as a seed for a MHD code for numerical applications. As an example, we present part of output of our programs for Cartesian coordinates and how to do the discretization.
Autocatalysis, information and coding.
Wills, P R
2001-01-01
Autocatalytic self-construction in macromolecular systems requires the existence of a reflexive relationship between structural components and the functional operations they perform to synthesise themselves. The possibility of reflexivity depends on formal, semiotic features of the catalytic structure-function relationship, that is, the embedding of catalytic functions in the space of polymeric structures. Reflexivity is a semiotic property of some genetic sequences. Such sequences may serve as the basis for the evolution of coding as a result of autocatalytic self-organisation in a population of assignment catalysts. Autocatalytic selection is a mechanism whereby matter becomes differentiated in primitive biochemical systems. In the case of coding self-organisation, it corresponds to the creation of symbolic information. Prions are present-day entities whose replication through autocatalysis reflects aspects of biological semiotics less obvious than genetic coding.
Coded Splitting Tree Protocols
DEFF Research Database (Denmark)
Sørensen, Jesper Hemming; Stefanovic, Cedomir; Popovski, Petar
2013-01-01
This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each...... instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early...... as possible. Evaluations show that the proposed protocol provides considerable gains over the standard tree splitting protocol applying SIC. The improvement comes at the expense of an increased feedback and receiver complexity....
Institute of Scientific and Technical Information of China (English)
CHENG Qiang; CAO JianWen; WANG Bin; ZHANG HaiBin
2009-01-01
The adjoint code generator (ADG) is developed to produce the adjoint codes, which are used to analytically calculate gradients and the Hessian-vector products with the costs independent of the number of the independent variables. Different from other automatic differentiation tools, the implementation of ADG has advantages of using the least program behavior decomposition method and several static dependence analysis techniques. In this paper we first address the concerned concepts and fundamentals, and then introduce the functionality and the features of ADG. In particular, we also discuss the design architecture of ADG and implementation details including the recomputation and storing strategy and several techniques for code optimization. Some experimental results in several applications are presented at the end.
Vaucouleur, Sebastien
2011-02-01
We introduce code query by example for customisation of evolvable software products in general and of enterprise resource planning systems (ERPs) in particular. The concept is based on an initial empirical study on practices around ERP systems. We motivate our design choices based on those empirical results, and we show how the proposed solution helps with respect to the infamous upgrade problem: the conflict between the need for customisation and the need for upgrade of ERP systems. We further show how code query by example can be used as a form of lightweight static analysis, to detect automatically potential defects in large software products. Code query by example as a form of lightweight static analysis is particularly interesting in the context of ERP systems: it is often the case that programmers working in this field are not computer science specialists but more of domain experts. Hence, they require a simple language to express custom rules.