Asymptotic normality of randomly truncated stochastic algorithms
Lelong, Jérôme
2010-01-01
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to ensure convergence when standard algorithms fail because the expected-value function grows too fast. In this work, we give a self contained proof of a central limit theorem for this algorithm under local assumptions on the expected-value function, which are fairly easy to check in practice.
Asymptotic normality of randomly truncated stochastic algorithms
Lelong, Jérôme
2010-01-01
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to ensure convergence when standard algorithms fail because the expected-value function grows too fast. In this work, we give a self contained proof of a central limit theorem for this algorithm under local assumptions on the expected-value function, which are fairly easy to check in practice.
Grayscale Image Compression Based on Min Max Block Truncating Coding
Directory of Open Access Journals (Sweden)
Hilal Almarabeh
2011-11-01
Full Text Available This paper presents an image compression techniques based on block truncating coding. In this work, a min max block truncating coding (MM_BTC is presented for grayscale image compression relies on applying dividing image into non-overlapping blocks. MM_BTC differ from other block truncating coding such as block truncating coding (BTC in the way of selecting the quantization level in order to remove redundancy. Objectives measures such as: Bit Rate (BR, Mean Square Error (MSE, Peak Signal to Noise Ratio (PSNR, and Redundancy (R, were used to present a detailed evaluation of MM_BTC of image quality.
Efficient Algorithms for Generating Truncated Multivariate Normal Distributions
Institute of Scientific and Technical Information of China (English)
Jun-wu YU; Guo-liang TIAN
2011-01-01
Sampling from a truncated multivariate normal distribution (TMVND) constitutes the core computational module in fitting many statistical and econometric models.We propose two efficient methods,an iterative data augmentation (DA) algorithm and a non-iterative inverse Bayes formulae (IBF) sampler,to simulate TMVND and generalize them to multivariate normal distributions with linear inequality constraints.By creating a Bayesian incomplete-data structure,the posterior step of the DA algorithm directly generates random vector draws as opposed to single element draws,resulting obvious computational advantage and easy coding with common statistical software packages such as S-PLUS,MATLAB and GAUSS.Furthermore,the DA provides a ready structure for implementing a fast EM algorithm to identify the mode of TMVND,which has many potential applications in statistical inference of constrained parameter problems.In addition,utilizing this mode as an intermediate result,the IBF sampling provides a novel alternative to Gibbs sampling and eliminates problems with convergence and possible slow convergence due to the high correlation between components of a TMVND.The DA algorithm is applied to a linear regression model with constrained parameters and is illustrated with a published data set.Numerical comparisons show that the propoeed DA algorithm and IBF sampler are more efficient than the Gibbs sampler and the accept-reject algorithm.
Indian Academy of Sciences (India)
SUDEEP THEPADE; RIK DAS; SAURAV GHOSH
2016-09-01
The paper has explored principle of block truncation coding (BTC) as a means to perform feature extraction for content based image classification. A variation of block truncation coding, named BTC with color clumps has been implemented in this work to generate feature vectors. Classification performance with the proposed technique of feature extraction has been compared to existing techniques. Two widely used publicdataset named Wang dataset and Caltech dataset have been used for analyses and comparisons of classification performances based on four different metrics. The study has established BTC with color clumps as an effective alternative for feature extraction compared to existing methods. The experiments were carried out in RGB colorspace. Two different categories of classifiers viz. K Nearest Neighbor (KNN) Classifier and RIDOR Classifier were used to measure the classification performances. A paired t test was conducted to establish the statistical significance of the findings. Evaluation of classifier algorithms were done in receiver operating characteristic (ROC) space.
A Line Search Multilevel Truncated Newton Algorithm for Computing the Optical Flow
Directory of Open Access Journals (Sweden)
Lluís Garrido
2015-06-01
Full Text Available We describe the implementation details and give the experimental results of three optimization algorithms for dense optical flow computation. In particular, using a line search strategy, we evaluate the performance of the unilevel truncated Newton method (LSTN, a multiresolution truncated Newton (MR/LSTN and a full multigrid truncated Newton (FMG/LSTN. We use three image sequences and four models of optical flow for performance evaluation. The FMG/LSTN algorithm is shown to lead to better optical flow estimation with less computational work than both the LSTN and MR/LSTN algorithms.
A tailored ML-EM algorithm for reconstruction of truncated projection data using few view angles
Mao, Yanfei; Zeng, Gengsheng L.
2013-06-01
Dedicated cardiac single photon emission computed tomography (SPECT) systems have the advantage of high speed and sensitivity at no loss, or even a gain, in resolution. The potential drawbacks of these dedicated systems are data truncation by the small field of view (FOV) and the lack of view angles. Serious artifacts, including streaks outside the FOV and distortion in the FOV, are introduced to the reconstruction when using the traditional emission data maximum-likelihood expectation-maximization (ML-EM) algorithm to reconstruct images from the truncated data with a small number of views. In this note, we propose a tailored ML-EM algorithm to suppress the artifacts caused by data truncation and insufficient angular sampling by reducing the image updating step sizes for the pixels outside the FOV. As a consequence, the convergence speed for the pixels outside the FOV is decelerated. We applied the proposed algorithm to truncated analytical data, Monte Carlo simulation data and real emission data with different numbers of views. The computer simulation results show that the tailored ML-EM algorithm outperforms the conventional ML-EM algorithm in terms of streak artifacts and distortion suppression for reconstruction from truncated projection data with a small number of views.
Analytic reconstruction algorithms for triple-source CT with horizontal data truncation
Energy Technology Data Exchange (ETDEWEB)
Chen, Ming [School of Mathematics and System Science, Shandong University of Science and Technology, Qingdao, Shandong 265590, China and Department of Electrical and Computer Engineering, University of Massachusetts Lowell, Lowell, Massachusetts 01854 (United States); Yu, Hengyong, E-mail: hengyong-yu@ieee.org [Department of Electrical and Computer Engineering, University of Massachusetts Lowell, Lowell, Massachusetts 01854 (United States)
2015-10-15
Purpose: This paper explores a triple-source imaging method with horizontal data truncation to enlarge the field of view (FOV) for big objects. Methods: The study is conducted by using theoretical analysis, mathematical deduction, and numerical simulations. The proposed algorithms are implemented in c + + and MATLAB. While the basic platform is constructed in MATLAB, the computationally intensive segments are coded in c + +, which are linked via a MEX interface. Results: A triple-source circular scanning configuration with horizontal data truncation is developed, where three pairs of x-ray sources and detectors are unevenly distributed on the same circle to cover the whole imaging object. For this triple-source configuration, a fan-beam filtered backprojection-type algorithm is derived for truncated full-scan projections without data rebinning. The algorithm is also extended for horizontally truncated half-scan projections and cone-beam projections in a Feldkamp-type framework. Using their method, the FOV is enlarged twofold to threefold to scan bigger objects with high speed and quality. The numerical simulation results confirm the correctness and effectiveness of the developed algorithms. Conclusions: The triple-source scanning configuration with horizontal data truncation cannot only keep most of the advantages of a traditional multisource system but also cover a larger FOV for big imaging objects. In addition, because the filtering is shift-invariant, the proposed algorithms are very fast and easily parallelized on graphic processing units.
Passive Copy-Move Forgery Detection Using Halftoning-based Block Truncation Coding Feature
Harjito, Bambang; Prasetyo, Heri
2017-06-01
This paper presents a new method on passive copy-move forgery detection by exploiting the effectiveness and usability of Halftoning-based Block Truncation Coding (HBTC) image feature. Copy-move forgery detection precisely locates the large size or flat tampered regions of an image. On our method, the tampered input image is firstly divided into several overlapping image blocks to construct the image feature descriptors. Each image block is further divided into several non-overlapping image blocks for processing HBTC. Two image feature descriptors, namely Color Feature (CF) and Bit Pattern Feature (BF) are computed from the HBTC compressed data-stream of each image block. Lexicography sorting rearranges the image feature descriptors in ascending manner for whole image. The similarity between some tampered image regions is measured based on their CF and BF under specific shift frequency threshold. As documented in the experimental results, the proposed method yields a promising result for detecting the tampered or copy-move forgery regions. It has proved that the HBTC is not only suitable for image compression, but it can also be used in the copy-move forgery detection.
Decomposition of Data Mining Algorithms into Unified Functional Blocks
Directory of Open Access Journals (Sweden)
Ivan Kholod
2016-01-01
Full Text Available The present paper describes the method of creating data mining algorithms from unified functional blocks. This method splits algorithms into independently functioning blocks. These blocks must have unified interfaces and implement pure functions. The method allows us to create new data mining algorithms from existing blocks and improves the existing algorithms by optimizing single blocks or the whole structure of the algorithms. This becomes possible due to a number of important properties inherent in pure functions and hence functional blocks.
Fitting Social Network Models Using Varying Truncation Stochastic Approximation MCMC Algorithm
Jin, Ick Hoon
2013-10-01
The exponential random graph model (ERGM) plays a major role in social network analysis. However, parameter estimation for the ERGM is a hard problem due to the intractability of its normalizing constant and the model degeneracy. The existing algorithms, such as Monte Carlo maximum likelihood estimation (MCMLE) and stochastic approximation, often fail for this problem in the presence of model degeneracy. In this article, we introduce the varying truncation stochastic approximation Markov chain Monte Carlo (SAMCMC) algorithm to tackle this problem. The varying truncation mechanism enables the algorithm to choose an appropriate starting point and an appropriate gain factor sequence, and thus to produce a reasonable parameter estimate for the ERGM even in the presence of model degeneracy. The numerical results indicate that the varying truncation SAMCMC algorithm can significantly outperform the MCMLE and stochastic approximation algorithms: for degenerate ERGMs, MCMLE and stochastic approximation often fail to produce any reasonable parameter estimates, while SAMCMC can do; for nondegenerate ERGMs, SAMCMC can work as well as or better than MCMLE and stochastic approximation. The data and source codes used for this article are available online as supplementary materials. © 2013 American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America.
Active set truncated-Newton algorithm for simultaneous optimization of distillation column
Institute of Scientific and Technical Information of China (English)
LIANG Xi-ming
2005-01-01
An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are made for the various large-scale problems of varying size. The comparison results between ASTNA and the subspace limited memory quasi-Newton algorithm and between the modified augmented Lagrange multiplier methods combined with ASTNA and the modified barrier function method show the stability and effectiveness of ASTNA for simultaneous optimization of distillation column.
Institute of Scientific and Technical Information of China (English)
张火明; 黄赛花; 管卫兵
2014-01-01
The highest similarity degree of static characteristics including both horizontal and vertical restoring force-displacement characteristics of total mooring system, as well as the tension-displacement characteristics of the representative single mooring line between the truncated and full depth system are obtained by annealing simulation algorithm for hybrid discrete variables (ASFHDV, in short). A“baton” optimization approach is proposed by utilizing ASFHDV. After each baton of optimization, if a few dimensional variables reach the upper or lower limit, the boundary of certain dimensional variables shall be expanded. In consideration of the experimental requirements, the length of the upper mooring line should not be smaller than 8 m, and the diameter of the anchor chain on the bottom should be larger than 0.03 m. A 100000 t turret mooring FPSO in the water depth of 304 m, with the truncated water depth being 76 m, is taken as an example of equivalent water depth truncated mooring system optimal design and calculation, and is performed to obtain the conformation parameters of the truncated mooring system. The numerical results indicate that the present truncated mooring system design is successful and effective.
Algorithms for Finding the Inverses of Factor Block Circulant Matrices
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
In this paper, algorithms for finding the inverse of a factor block circulant matrix,a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented respectively. In addition, two algorithms for the inverse of a factor block circulant matrix over the quaternion division algebra are proposed.
Liu Yu-Sun; Tsai Yao-Yu
2011-01-01
Abstract The performance of the wrap-around Viterbi decoding algorithm with finite truncation depth and fixed decoding trellis length is investigated for tail-biting convolutional codes in the mobile WiMAX standard. Upper bounds on the error probabilities induced by finite truncation depth and the uncertainty of the initial state are derived for the AWGN channel. The truncation depth and the decoding trellis length that yield negligible performance loss are obtained for all transmission rates...
An iterative algorithm for soft tissue reconstruction from truncated flat panel projections
Langan, D.; Claus, B.; Edic, P.; Vaillant, R.; De Man, B.; Basu, S.; Iatrou, M.
2006-03-01
The capabilities of flat panel interventional x-ray systems continue to expand, enabling a broader array of medical applications to be performed in a minimally invasive manner. Although CT is providing pre-operative 3D information, there is a need for 3D imaging of low contrast soft tissue during interventions in a number of areas including neurology, cardiac electro-physiology, and oncology. Unlike CT systems, interventional angiographic x-ray systems provide real-time large field of view 2D imaging, patient access, and flexible gantry positioning enabling interventional procedures. However, relative to CT, these C-arm flat panel systems have additional technical challenges in 3D soft tissue imaging including slower rotation speed, gantry vibration, reduced lateral patient field of view (FOV), and increased scatter. The reduced patient FOV often results in significant data truncation. Reconstruction of truncated (incomplete) data is known an "interior problem", and it is mathematically impossible to obtain an exact reconstruction. Nevertheless, it is an important problem in 3D imaging on a C-arm to address the need to generate a 3D reconstruction representative of the object being imaged with minimal artifacts. In this work we investigate the application of an iterative Maximum Likelihood Transmission (MLTR) algorithm to truncated data. We also consider truncated data with limited views for cardiac imaging where the views are gated by the electrocardiogram(ECG) to combat motion artifacts.
Directory of Open Access Journals (Sweden)
Liu Yu-Sun
2011-01-01
Full Text Available Abstract The performance of the wrap-around Viterbi decoding algorithm with finite truncation depth and fixed decoding trellis length is investigated for tail-biting convolutional codes in the mobile WiMAX standard. Upper bounds on the error probabilities induced by finite truncation depth and the uncertainty of the initial state are derived for the AWGN channel. The truncation depth and the decoding trellis length that yield negligible performance loss are obtained for all transmission rates over the Rayleigh channel using computer simulations. The results show that the circular decoding algorithm with an appropriately chosen truncation depth and a decoding trellis just a fraction longer than the original received code words can achieve almost the same performance as the optimal maximum likelihood decoding algorithm in mobile WiMAX. A rule of thumb for the values of the truncation depth and the trellis tail length is also proposed.
Energy Technology Data Exchange (ETDEWEB)
Finsterle, S.; Kowalsky, M.B.
2010-10-15
We propose a modification to the Levenberg-Marquardt minimization algorithm for a more robust and more efficient calibration of highly parameterized, strongly nonlinear models of multiphase flow through porous media. The new method combines the advantages of truncated singular value decomposition with those of the classical Levenberg-Marquardt algorithm, thus enabling a more robust solution of underdetermined inverse problems with complex relations between the parameters to be estimated and the observable state variables used for calibration. The truncation limit separating the solution space from the calibration null space is re-evaluated during the iterative calibration process. In between these re-evaluations, fewer forward simulations are required, compared to the standard approach, to calculate the approximate sensitivity matrix. Truncated singular values are used to calculate the Levenberg-Marquardt parameter updates, ensuring that safe small steps along the steepest-descent direction are taken for highly correlated parameters of low sensitivity, whereas efficient quasi-Gauss-Newton steps are taken for independent parameters with high impact. The performance of the proposed scheme is demonstrated for a synthetic data set representing infiltration into a partially saturated, heterogeneous soil, where hydrogeological, petrophysical, and geostatistical parameters are estimated based on the joint inversion of hydrological and geophysical data.
Explicit filtering of building blocks for genetic algorithms
Kemenade, C.H.M. van
1996-01-01
Genetic algorithms are often applied to building block problems. We have developed a simple filtering algorithm that can locate building blocks within a bit-string, and does not make assumptions regarding the linkage of the bits. A comparison between the filtering algorithm and genetic algorithms re
A POCS-Based Algorithm for Blocking Artifacts Reduction
Institute of Scientific and Technical Information of China (English)
ZHAO Yi-hong; CHENG Guo-hua; YU Song-yu
2006-01-01
An algorithm for blocking artifacts reduction in DCT domain for block-based image coding was developed. The algorithm is based on the projection onto convex set (POCS) theory. Due to the fact that the DCT characteristics of shifted blocks are different caused by the blocking artifacts, a novel smoothness constraint set and the corresponding projection operator were proposed to reduce the blocking artifacts by discarding the undesired high frequency coefficients in the shifted DCT blocks. The experimental results show that the proposed algorithm outperforms the conventional algorithms in terms of objective quality, subjective quality, and convergence property.
Explicit filtering of building blocks for genetic algorithms
C.H.M. van Kemenade
1996-01-01
textabstractGenetic algorithms are often applied to building block problems. We have developed a simple filtering algorithm that can locate building blocks within a bit-string, and does not make assumptions regarding the linkage of the bits. A comparison between the filtering algorithm and genetic
BLOCKING ALGORITHM FOR CURRENT PROTECTION DURING INRUSH MAGNETIZATION CURRENT
Directory of Open Access Journals (Sweden)
F. A. Romaniuk
2014-01-01
Full Text Available The paper presents blocking algorithm for current protection during inrush process. The algorithm is based on the evaluation of the ratio of the positive sequence second harmonic current to the negative sequence first harmonic current.
Block Least Mean Squares Algorithm over Distributed Wireless Sensor Network
Directory of Open Access Journals (Sweden)
T. Panigrahi
2012-01-01
Full Text Available In a distributed parameter estimation problem, during each sampling instant, a typical sensor node communicates its estimate either by the diffusion algorithm or by the incremental algorithm. Both these conventional distributed algorithms involve significant communication overheads and, consequently, defeat the basic purpose of wireless sensor networks. In the present paper, we therefore propose two new distributed algorithms, namely, block diffusion least mean square (BDLMS and block incremental least mean square (BILMS by extending the concept of block adaptive filtering techniques to the distributed adaptation scenario. The performance analysis of the proposed BDLMS and BILMS algorithms has been carried out and found to have similar performances to those offered by conventional diffusion LMS and incremental LMS algorithms, respectively. The convergence analyses of the proposed algorithms obtained from the simulation study are also found to be in agreement with the theoretical analysis. The remarkable and interesting aspect of the proposed block-based algorithms is that their communication overheads per node and latencies are less than those of the conventional algorithms by a factor as high as the block size used in the algorithms.
Design and Analysis of New Symmetric Block Cipher Algorithm
Directory of Open Access Journals (Sweden)
KALAICHELVI V
2015-10-01
Full Text Available Cryptography provides many methods and techniques for secure communication. Currently there are many encryption/decryption algorithms such as DES, AES (Rijndael, Blowfish, etc., are published. However, they are fairly complex and require that one spend a lot of time to comprehend and implement them. This paper introduces simple encryption /decryption algorithm that works fast and fairly secure. In this paper, a new symmetric block cipher algorithm has been developed and is compared with the existing popular algorithms. Simulation results are given to demonstrate the effectiveness of each algorithm. Blowfish and the newly developed algorithms exhibit better performance than other popular existing algorithms.
Directory of Open Access Journals (Sweden)
Wolfram C Poller
Full Text Available Optimization of the AV-interval (AVI in DDD pacemakers improves cardiac hemodynamics and reduces pacemaker syndromes. Manual optimization is typically not performed in clinical routine. In the present study we analyze the prevalence of E/A wave fusion and A wave truncation under resting conditions in 160 patients with complete AV block (AVB under the pre-programmed AVI. We manually optimized sub-optimal AVI.We analyzed 160 pacemaker patients with complete AVB, both in sinus rhythm (AV-sense; n = 129 and under atrial pacing (AV-pace; n = 31. Using Doppler analyses of the transmitral inflow we classified the nominal AVI as: a normal, b too long (E/A wave fusion or c too short (A wave truncation. In patients with a sub-optimal AVI, we performed manual optimization according to the recommendations of the American Society of Echocardiography.All AVB patients with atrial pacing exhibited a normal transmitral inflow under the nominal AV-pace intervals (100%. In contrast, 25 AVB patients in sinus rhythm showed E/A wave fusion under the pre-programmed AV-sense intervals (19.4%; 95% confidence interval (CI: 12.6-26.2%. A wave truncations were not observed in any patient. All patients with a complete E/A wave fusion achieved a normal transmitral inflow after AV-sense interval reduction (mean optimized AVI: 79.4 ± 13.6 ms.Given the rate of 19.4% (CI 12.6-26.2% of patients with a too long nominal AV-sense interval, automatic algorithms may prove useful in improving cardiac hemodynamics, especially in the subgroup of atrially triggered pacemaker patients with AV node diseases.
Poller, Wolfram C; Dreger, Henryk; Schwerg, Marius; Melzer, Christoph
2015-01-01
Optimization of the AV-interval (AVI) in DDD pacemakers improves cardiac hemodynamics and reduces pacemaker syndromes. Manual optimization is typically not performed in clinical routine. In the present study we analyze the prevalence of E/A wave fusion and A wave truncation under resting conditions in 160 patients with complete AV block (AVB) under the pre-programmed AVI. We manually optimized sub-optimal AVI. We analyzed 160 pacemaker patients with complete AVB, both in sinus rhythm (AV-sense; n = 129) and under atrial pacing (AV-pace; n = 31). Using Doppler analyses of the transmitral inflow we classified the nominal AVI as: a) normal, b) too long (E/A wave fusion) or c) too short (A wave truncation). In patients with a sub-optimal AVI, we performed manual optimization according to the recommendations of the American Society of Echocardiography. All AVB patients with atrial pacing exhibited a normal transmitral inflow under the nominal AV-pace intervals (100%). In contrast, 25 AVB patients in sinus rhythm showed E/A wave fusion under the pre-programmed AV-sense intervals (19.4%; 95% confidence interval (CI): 12.6-26.2%). A wave truncations were not observed in any patient. All patients with a complete E/A wave fusion achieved a normal transmitral inflow after AV-sense interval reduction (mean optimized AVI: 79.4 ± 13.6 ms). Given the rate of 19.4% (CI 12.6-26.2%) of patients with a too long nominal AV-sense interval, automatic algorithms may prove useful in improving cardiac hemodynamics, especially in the subgroup of atrially triggered pacemaker patients with AV node diseases.
Spatial Scheduling Optimization Algorithm for Block Assembly in Shipbuilding
Directory of Open Access Journals (Sweden)
Zhengyang Shang
2017-01-01
Full Text Available Block assembly consumes the majority of processing time and resources in shipbuilding, and the block spatial scheduling (BSS related to block assembly has been widely studied as the key to improve shipbuilding efficiency. BSS is a complicated NP-hard problem that aims to minimize the makespan. Since each block has specific building time and space constraints, the BSS problem can be hardly found with an acceptable solution by using constant scheduling rules. Thus, in this study, we considered the BSS problem as a time-constrained 3D bin packing mathematical model and proposed an allocation algorithm, best contact algorithm (BCA, that is more suitable for dynamic processes. Then, for global optimization of the BSS problem, we regarded the starting time of each block as a variable and used the genetic algorithm (GA to operate and optimize the block assembly sequence. Finally, we tested the BCA + GA scheduling system with real data from a shipyard and thereby determined the block scheduling status and the daily utilization rate of the work plate. Comparison shows that the proposed algorithm is able to get shorter makespan and better block scheduling effect; it realized the optimization of the block spatial scheduling dynamically.
Entropy Encoding EBCOT-Embedded Block Coding with Optimized Truncation-In JPEG2000
Directory of Open Access Journals (Sweden)
S Medouakh
2011-07-01
Full Text Available JPEG2000 is the new standard for the compression of images, which succeeds to JPEG. It's has a much higher algorithmic complexity. The complexity of the entropy encoder ( EBCOT is the most significant in JPEG2000. Which alone constitutes about 70% of the overall processing time for compression of an image. This new standard has many features and characteristics (region of interest, several types of decompression. In this paper we are interested on studying the algorithm of JPEG2000 and the most complex in the JPEG2000 compression process, the EBCOT entropy encoder, and its performance are presented.
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.
Aniba, Ghassane
2011-04-01
This paper presents an optimal adaptive modulation (AM) algorithm designed using a cross-layer approach which combines truncated automatic repeat request (ARQ) protocol and packet combining. Transmissions are performed over multiple-input multiple-output (MIMO) Nakagami fading channels, and retransmitted packets are not necessarily modulated using the same modulation format as in the initial transmission. Compared to traditional approach, cross-layer design based on the coupling across the physical and link layers, has proven to yield better performance in wireless communications. However, there is a lack for the performance analysis and evaluation of such design when the ARQ protocol is used in conjunction with packet combining. Indeed, previous works addressed the link layer performance of AM with truncated ARQ but without packet combining. In addition, previously proposed AM algorithms are not optimal and can provide poor performance when packet combining is implemented. Herein, we first show that the packet loss rate (PLR) resulting from the combining of packets modulated with different constellations can be well approximated by an exponential function. This model is then used in the design of an optimal AM algorithm for systems employing packet combining, truncated ARQ and MIMO antenna configurations, considering transmission over Nakagami fading channels. Numerical results are provided for operation with or without packet combining, and show the enhanced performance and efficiency of the proposed algorithm in comparison with existing ones. © 2011 IEEE.
Computational enhancement of an unsymmetric block Lanczos algorithm
Kim, Hyoung M.; Craig, Roy R., Jr.
1990-01-01
An unsymmetric block Lanczos algorithm has been employed for the dynamic analysis of a large system which has arbitrary damping and/or repeated (or closely spaced) eigenvalues. In the algorithm development, the right and left Lanczos vectors are all theoretically biorthogonal to each other. However, these vectors may lose the biorthogonality owing to cancellation and roundoff errors. For the unsymmetric case there can be a breakdown, even without numerical errors. This paper describes computational techniques which have led to a robust unsymmetric block Lanczos algorithm.
Ship Block Transportation Scheduling Problem Based on Greedy Algorithm
Directory of Open Access Journals (Sweden)
Chong Wang
2016-05-01
Full Text Available Ship block transportation problems are crucial issues to address in reducing the construction cost and improving the productivity of shipyards. Shipyards aim to maximize the workload balance of transporters with time constraint such that all blocks should be transported during the planning horizon. This process leads to three types of penalty time: empty transporter travel time, delay time, and tardy time. This study aims to minimize the sum of the penalty time. First, this study presents the problem of ship block transportation with the generalization of the block transportation restriction on the multi-type transporter. Second, the problem is transformed into the classical traveling salesman problem and assignment problem through a reasonable model simplification and by adding a virtual node to the proposed directed graph. Then, a heuristic algorithm based on greedy algorithm is proposed to assign blocks to available transporters and sequencing blocks for each transporter simultaneously. Finally, the numerical experiment method is used to validate the model, and its result shows that the proposed algorithm is effective in realizing the efficient use of the transporters in shipyards. Numerical simulation results demonstrate the promising application of the proposed method to efficiently improve the utilization of transporters and to reduce the cost of ship block logistics for shipyards.
Building Blocks Propagation in Quantum-Inspired Genetic Algorithm
Nowotniak, Robert; Kucharski, Jacek
2010-01-01
This paper presents an analysis of building blocks propagation in Quantum-Inspired Genetic Algorithm, which belongs to a new class of metaheuristics drawing their inspiration from both biological evolution and unitary evolution of quantum systems. The expected number of quantum chromosomes matching a schema has been analyzed and a random variable corresponding to this issue has been introduced. The results have been compared with Simple Genetic Algorithm. Also, it has been presented how selec...
Block Monotone Iterative Algorithms for Variational Inequalities with Nonlinear Operators
Institute of Scientific and Technical Information of China (English)
Ming-hui Ren; Jin-ping Zeng
2008-01-01
Some block iterative methods for solving variational inequalities with nonlinear operators are proposed. Monotone convergence of the algorithms is obtained. Some comparison theorems are also established.Compared with the research work in given by Pao in 1995 for nonlinear equations and research work in given by Zeng and Zhou in 2002 for elliptic variational inequalities, the algorithms proposed in this paper are independent of the boundedness of the derivatives of the nonlinear operator.
Tsang, P. W. M.; Poon, T.-C.; Jiao, A. S. M.
2013-09-01
Past research has demonstrated that a three-dimensional (3D) intensity image can be preserved to a reasonable extent with a binary Fresnel hologram called the grid-cross down-sampling (GCD) binary hologram, if the intensity image is first down-sampled with a grid-cross lattice prior to the generation of the hologram. It has also been shown that the binary hologram generated with such means can be embedded with a binary image without causing observable artifact on the reconstructed image. Hence, the method can be further extended to embed an intensity image by binarizing it with error diffusion. Despite the favorable findings, the visual quality of the retrieved embedded intensity image from the hologram is rather poor. In this paper, we propose a method to overcome this problem. First, we employ the block truncation coding (BTC) to convert the intensity image into a binary bit stream. Next, the binary bit stream is embedded into the GCD binary hologram. The embedded image can be recovered with a BTC decoder, as well as a noise suppression scheme if the hologram is partially damaged. Experimental results demonstrate that with our proposed method, the visual quality of the embedded intensity image is superior to that of the existing approach, and the extracted image preserves favorably even if the binary hologram is damaged and contaminated with noise.
PRECONDITIONING BLOCK LANCZOS ALGORITHM FOR SOLVING SYMMETRIC EIGENVALUE PROBLEMS
Institute of Scientific and Technical Information of China (English)
Hua Dai; Peter Lancaster
2000-01-01
A preconditioned iterative method for computing a few eigenpairs of large sparse symmetric matrices is presented in this paper. The proposed method which combines the preconditioning techniques with the efficiency of block Lanczos algorithm is suitable for determination of the extreme eigenvalues as well as their multiplicities. The global convergence and the asymptotically quadratic convergence of the new method are also demonstrated.
Block-Structured Adaptive Mesh Refinement Algorithms for Vlasov Simulation
Hittinger, J A F
2012-01-01
Direct discretization of continuum kinetic equations, like the Vlasov equation, are under-utilized because the distribution function generally exists in a high-dimensional (>3D) space and computational cost increases geometrically with dimension. We propose to use high-order finite-volume techniques with block-structured adaptive mesh refinement (AMR) to reduce the computational cost. The primary complication comes from a solution state comprised of variables of different dimensions. We develop the algorithms required to extend standard single-dimension block structured AMR to the multi-dimension case. Specifically, algorithms for reduction and injection operations that transfer data between mesh hierarchies of different dimensions are explained in detail. In addition, modifications to the basic AMR algorithm that enable the use of high-order spatial and temporal discretizations are discussed. Preliminary results for a standard 1D+1V Vlasov-Poisson test problem are presented. Results indicate that there is po...
Zheng, Ziyi; Sun, Mingshan; Pavkovich, John; Star-Lack, Josh
2011-03-01
A challenge in using on-board cone beam computed tomography (CBCT) to image lung tumor motion prior to radiation therapy treatment is acquiring and reconstructing high quality 4D images in a sufficiently short time for practical use. For the 1 minute rotation times typical of Linacs, severe view aliasing artifacts, including streaks, are created if a conventional phase-correlated FDK reconstruction is performed. The McKinnon-Bates (MKB) algorithm provides an efficient means of reducing streaks from static tissue but can suffer from low SNR and other artifacts due to data truncation and noise. We have added truncation correction and bilateral nonlinear filtering to the MKB algorithm to reduce streaking and improve image quality. The modified MKB algorithm was implemented on a graphical processing unit (GPU) to maximize efficiency. Results show that a nearly 4x improvement in SNR is obtained compared to the conventional FDK phase-correlated reconstruction and that high quality 4D images with 0.4 second temporal resolution and 1 mm3 isotropic spatial resolution can be reconstructed in less than 20 seconds after data acquisition completes.
Bouallègue, Fayçal Ben; Crouzet, Jean-François; Comtat, Claude; Fourcade, Marjolaine; Mohammadi, Bijan; Mariano-Goulart, Denis
2007-07-01
This paper presents an extended 3-D exact rebinning formula in the Fourier space that leads to an iterative reprojection algorithm (iterative FOREPROJ), which enables the estimation of unmeasured oblique projection data on the basis of the whole set of measured data. In first approximation, this analytical formula also leads to an extended Fourier rebinning equation that is the basis for an approximate reprojection algorithm (extended FORE). These algorithms were evaluated on numerically simulated 3-D positron emission tomography (PET) data for the solution of the truncation problem, i.e., the estimation of the missing portions in the oblique projection data, before the application of algorithms that require complete projection data such as some rebinning methods (FOREX) or 3-D reconstruction algorithms (3DRP or direct Fourier methods). By taking advantage of all the 3-D data statistics, the iterative FOREPROJ reprojection provides a reliable alternative to the classical FOREPROJ method, which only exploits the low-statistics nonoblique data. It significantly improves the quality of the external reconstructed slices without loss of spatial resolution. As for the approximate extended FORE algorithm, it clearly exhibits limitations due to axial interpolations, but will require clinical studies with more realistic measured data in order to decide on its pertinence.
A Recursive Algorithm for the Reduction of Block Diagrams
Directory of Open Access Journals (Sweden)
Trond Andresen
1991-01-01
Full Text Available A recursive algorithm to compute input-output relationships in a network of rational transfer functions (a block diagram is derived. Initially all transfer functions are disconnected. For each step in the algorithm, a new transfer function in the network is connected to the system. One application of the algorithm is to find the transfer matrix of a linear multivariable system given on state space form. The algorithm is advantageous when one needs repeated computations of a transfer matrix in a multivariable system for successive changes in one or a few parameters in the system. The transfer matrix for a multivariable linear system with one time delay, and the exact frequency response in the case of several time delays, are derived.
Building Blocks Propagation in Quantum-Inspired Genetic Algorithm
Nowotniak, Robert
2010-01-01
This paper presents an analysis of building blocks propagation in Quantum-Inspired Genetic Algorithm, which belongs to a new class of metaheuristics drawing their inspiration from both biological evolution and unitary evolution of quantum systems. The expected number of quantum chromosomes matching a schema has been analyzed and a random variable corresponding to this issue has been introduced. The results have been compared with Simple Genetic Algorithm. Also, it has been presented how selected binary quantum chromosomes cover a domain of one-dimensional fitness function.
A Block-Based Multi-Scale Background Extraction Algorithm
Directory of Open Access Journals (Sweden)
Seyed H. Davarpanah
2010-01-01
Full Text Available Problem statement: To extract the moving objects, vision-based surveillance systems subtract the current image from a predefined background image. The efficiency of these systems mainly depends on accuracy of the extracted background image. It should be able to adapt to the changes continuously. In addition, especially in real-time applications the time complexity of this adaptation is a critical matter. Approach: In this study, to extract an adaptive background, a combination of blocking and multi-scale methods is presented. Because of being less sensitive to local movements, block-based techniques are proper to control the non-stationary objects movements, especially in outdoor applications. They can be useful to reduce the effect of these objects on the extracted background. We also used the blocking method to intelligently select the regions which the temporal filtering has to be applied on. In addition, an amended multi-scale algorithm is introduced. This algorithm is a hybrid algorithm, a combination of some nonparametric and parametric filters. It uses a nonparametric filter in the spatial domain to initiate two primary backgrounds. In continue two adapted two-dimensional filters will be used to extract the final background. Results: The qualitative and quantitative results of our experiments certify not only the quality of the final extracted background is acceptable, but also its time consumption is approximately half in compare to the similar methods. Conclusion: Using Multi scaling filtering and applying the filters just to some selected nonoverlapped blocks reduce the time consumption of the extracting background algorithm.
Two-dimensional Block of Spatial Convolution Algorithm and Simulation
Mussa Mohamed Ahmed
2012-01-01
This paper proposes an algorithm based on sub image-segmentation strategy. The proposed scheme divides a grayscale image into overlapped 6×6 blocks each of which is segmented into four small 3x3 non-overlapped sub-images. A new spatial approach for efficiently computing 2-dimensional linear convolution or cross-correlation between suitable flipped and fixed filter coefficients (sub image for cross-correlation) and corresponding input sub image is presented. Computation of convolution is itera...
Block sparse Cholesky algorithms on advanced uniprocessor computers
Energy Technology Data Exchange (ETDEWEB)
Ng, E.G.; Peyton, B.W.
1991-12-01
As with many other linear algebra algorithms, devising a portable implementation of sparse Cholesky factorization that performs well on the broad range of computer architectures currently available is a formidable challenge. Even after limiting our attention to machines with only one processor, as we have done in this report, there are still several interesting issues to consider. For dense matrices, it is well known that block factorization algorithms are the best means of achieving this goal. We take this approach for sparse factorization as well. This paper has two primary goals. First, we examine two sparse Cholesky factorization algorithms, the multifrontal method and a blocked left-looking sparse Cholesky method, in a systematic and consistent fashion, both to illustrate the strengths of the blocking techniques in general and to obtain a fair evaluation of the two approaches. Second, we assess the impact of various implementation techniques on time and storage efficiency, paying particularly close attention to the work-storage requirement of the two methods and their variants.
Security enhancement of a phase-truncation based image encryption algorithm.
Wang, Xiaogang; Zhao, Daomu
2011-12-20
The asymmetric cryptosystem, which is based on phase-truncated Fourier transforms (PTFTs), can break the linearity of conventional systems. However, it has been proven to be vulnerable to a specific attack based on iterative Fourier transforms when the two random phase masks are used as public keys to encrypt different plaintexts. An improvement from the asymmetric cryptosystem may be taken by relocating the amplitude values in the output plane. In this paper, two different methods are adopted to realize the amplitude modulation of the output image. The first one is to extend the PTFT-based asymmetrical cryptosystem into the anamorphic fractional Fourier transform domain directly, and the second is to add an amplitude mask in the Fourier plane of the encryption scheme. Some numerical simulations are presented to prove the good performance of the proposed cryptosystems.
An improved EZBC algorithm based on block bit length
Wang, Renlong; Ruan, Shuangchen; Liu, Chengxiang; Wang, Wenda; Zhang, Li
2011-12-01
Embedded ZeroBlock Coding and context modeling (EZBC) algorithm has high compression performance. However, it consumes large amounts of memory space because an Amplitude Quadtree of wavelet coefficients and other two link lists would be built during the encoding process. This is one of the big challenges for EZBC to be used in real time or hardware applications. An improved EZBC algorithm based on bit length of coefficients was brought forward in this article. It uses Bit Length Quadtree to complete the coding process and output the context for Arithmetic Coder. It can achieve the same compression performance as EZBC and save more than 75% memory space required in the encoding process. As Bit Length Quadtree can quickly locate the wavelet coefficients and judge their significance, the improved algorithm can dramatically accelerate the encoding speed. These improvements are also beneficial for hardware. PACS: 42.30.Va, 42.30.Wb
Cazade, Pierre-André; Zheng, Wenwei; Prada-Gracia, Diego; Berezovska, Ganna; Rao, Francesco; Clementi, Cecilia; Meuwly, Markus
2015-01-01
The ligand migration network for O2-diffusion in truncated Hemoglobin N is analyzed based on three different clustering schemes. For coordinate-based clustering, the conventional k-means and the kinetics-based Markov Clustering (MCL) methods are employed, whereas the locally scaled diffusion map (LSDMap) method is a collective-variable-based approach. It is found that all three methods agree well in their geometrical definition of the most important docking site, and all experimentally known docking sites are recovered by all three methods. Also, for most of the states, their population coincides quite favourably, whereas the kinetics of and between the states differs. One of the major differences between k-means and MCL clustering on the one hand and LSDMap on the other is that the latter finds one large primary cluster containing the Xe1a, IS1, and ENT states. This is related to the fact that the motion within the state occurs on similar time scales, whereas structurally the state is found to be quite diverse. In agreement with previous explicit atomistic simulations, the Xe3 pocket is found to be a highly dynamical site which points to its potential role as a hub in the network. This is also highlighted in the fact that LSDMap cannot identify this state. First passage time distributions from MCL clusterings using a one- (ligand-position) and two-dimensional (ligand-position and protein-structure) descriptor suggest that ligand- and protein-motions are coupled. The benefits and drawbacks of the three methods are discussed in a comparative fashion and highlight that depending on the questions at hand the best-performing method for a particular data set may differ.
A truncated [Mn(III)₁₂] tetrahedron from oxime-based [Mn(III)₃O] building blocks.
Frost, J M; Sanz, S; Rajeshkumar, T; Pitak, M B; Coles, S J; Rajaraman, G; Wernsdorfer, W; Schnack, J; Lusby, P J; Brechin, E K
2014-07-28
The use of the novel pro-ligand H4L combining the complimentary phenolic oxime and diethanolamine moieties in one organic framework, results in the formation of the first example of a [Mn(III)12] truncated tetrahedron and an extremely rare example of a Mn cage conforming to an Archimedean solid.
STOCHASTIC APPROXIMATION ALGORITHMS WITH EXPANDING TRUNCATIONS%扩展截尾的随机逼近算法
Institute of Scientific and Technical Information of China (English)
陈翰馥
2012-01-01
注意到系统控制及相关领域中相当一类问题可归结为参数估计,而后者又可转化为未知函数的求根问题,首先介绍用带噪声量测递推地求根方法,即经典的随机逼近算法,并针对它的不足,引入扩展截尾的随机逼近算法(SAAWET),给出它的一般收敛定理.接着介绍应用SAAWET解决线性随机系统系数辨识及定阶, Hammerstein,Wiener,NARX等非线性系统的辨识,非线性随机系统的迭代学习控制及适应调节,以及其它一些问题.所给出的估计都是递推的,并且以概率1收敛到真值.%It is noticed that a considerable class of problems arising from systems and control and related fields may be reduced to parameter estimation, which, in turn, can be transformed to a root-seeking problem for unknown functions. The paper first, introduces the root-seeking method based on the noisy observations, i.e., the classical stochastic approximation algorithm. Against the restrictions of applying the classical algorithm, the stochastic approximation algorithm with expanding truncations (SAAWET) is introduced, and its general convergence theorem is demonstrated as well. Then, SAAWET is applied to solve problems like coefficient identification and order determination of linear stochastic systems, identification of Hammerstein, Wiener, and NARX systems, iterative learning control and adaptive regulation for nonlinear stochastic systems, and some others. All estimates given by the method are recursive and converge to the corresponding true values with probability one.
Traditional and Truncation schemes for Different Multiplier
Directory of Open Access Journals (Sweden)
Yogesh M. Motey
2013-03-01
Full Text Available A rapid and proficient in power requirement multiplier is always vital in electronics industry like DSP, image processing and ALU in microprocessors. Multiplier is such an imperative block w ith respect to power consumption and area occupied in the system. In order to meet the demand for high speed, various parallel array multiplication algorithms have been proposed by a number of authors. The array multipliers use a large amount of hardware, consequently consuming a large amount of power. One of the methods for multiplication is based on Indian Vedic mathematics. The total Vedic mathematics is based on sixteen sutras (word formulae and manifests a merged structure of mathematics. The parallel multipliers for example radix 2 and radix 4 booth multiplier does the computations using less number of adders and less number of iterative steps that results in, they occupy less space to that of serial multiplier. Truncated multipliers offer noteworthy enhancements in area, delay, and power. Truncated multiplication provides different method for reducing the power dissipation and area of rounded parallel multipliers in DSP systems. Since in a truncated multiplier the x less significant bits of the full-width product are discarded thus partial products are removed and replaced by a suit- able compensation equations, match the accuracy with hardware cost. A pseudo-carry compensation truncation (PCT scheme, it is for the multiplexer based array multiplier, which yields less average error among existing truncation methods.After studying many research papers it’s found that some of the schemes for multiplier are suitable because their own uniqueness of multiplication. Such schemes are listed in this paper for example the different truncation schemes like constant-correction truncation (CCT, variable -correction truncation (VCT, pseudo-carry compensation truncation (PCT are most suitable for truncated multiplier.
Efficient Hardware Implementation of the Lightweight Block Encryption Algorithm LEA
Directory of Open Access Journals (Sweden)
Donggeon Lee
2014-01-01
Full Text Available Recently, due to the advent of resource-constrained trends, such as smartphones and smart devices, the computing environment is changing. Because our daily life is deeply intertwined with ubiquitous networks, the importance of security is growing. A lightweight encryption algorithm is essential for secure communication between these kinds of resource-constrained devices, and many researchers have been investigating this field. Recently, a lightweight block cipher called LEA was proposed. LEA was originally targeted for efficient implementation on microprocessors, as it is fast when implemented in software and furthermore, it has a small memory footprint. To reflect on recent technology, all required calculations utilize 32-bit wide operations. In addition, the algorithm is comprised of not complex S-Box-like structures but simple Addition, Rotation, and XOR operations. To the best of our knowledge, this paper is the first report on a comprehensive hardware implementation of LEA. We present various hardware structures and their implementation results according to key sizes. Even though LEA was originally targeted at software efficiency, it also shows high efficiency when implemented as hardware.
DEFF Research Database (Denmark)
Martini, Enrica; Breinbjerg, Olav; Maci, Stefano
2008-01-01
A simple and effective procedure for the reduction of truncation errors in planar near-field measurements of aperture antennas is presented. The procedure relies on the consideration that, due to the scan plane truncation, the calculated plane wave spectrum of the field radiated by the antenna is...
Video Image Block-matching Motion Estimation Algorithm Based on Two-step Search
Institute of Scientific and Technical Information of China (English)
Wei-qi JIN; Yan CHEN; Ling-xue WANG; Bin LIU; Chong-liang LIU; Ya-zhong SHEN; Gui-qing ZHANG
2010-01-01
Aiming at the shortcoming that certain existing blocking-matching algorithms, such as full search, three-step search, and diamond search algorithms, usually can not keep a good balance between high accuracy and low computational complexity, a block-matching motion estimation algorithm based on two-step search is proposed in this paper. According to the fact that the gray values of adjacent pixels will not vary fast, the algorithm employs an interlaced search pattern in the search window to estimate the motion vector of the object-block. Simulation and actual experiments demonstrate that the proposed algorithm greatly outperforms the well-known three-step search and diamond search algorithms, no matter the motion vector is large or small. Compared with the full search algorithm, the proposed one achieves similar performance but requires much less computation, therefore, the algorithm is well qualified for real-time video image processing.
AN IMPROVED FAST BLIND DECONVOLUTION ALGORITHM BASED ON DECORRELATION AND BLOCK MATRIX
Institute of Scientific and Technical Information of China (English)
Yang Jun'an; He Xuefan; Tan Ying
2008-01-01
In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix. Althougth the original algorithm can overcome the shortcomings of current blind deconvolution algorithms,it has a constraint that the number of the source signals must be less than that of the channels. The improved algorithm deletes this constraint by using decorrelation technique. Besides,the improved algorithm raises the separation speed in terms of improving the computing methods of the output signal matrix. Simulation results demonstrate the validation and fast separation of the improved algorithm.
A. AL-Salhi, Yahya E.; Lu, Songfeng
2016-08-01
Quantum steganography can solve some problems that are considered inefficient in image information concealing. It researches on Quantum image information concealing to have been widely exploited in recent years. Quantum image information concealing can be categorized into quantum image digital blocking, quantum image stereography, anonymity and other branches. Least significant bit (LSB) information concealing plays vital roles in the classical world because many image information concealing algorithms are designed based on it. Firstly, based on the novel enhanced quantum representation (NEQR), image uniform blocks clustering around the concrete the least significant Qu-block (LSQB) information concealing algorithm for quantum image steganography is presented. Secondly, a clustering algorithm is proposed to optimize the concealment of important data. Finally, we used Con-Steg algorithm to conceal the clustered image blocks. Information concealing located on the Fourier domain of an image can achieve the security of image information, thus we further discuss the Fourier domain LSQu-block information concealing algorithm for quantum image based on Quantum Fourier Transforms. In our algorithms, the corresponding unitary Transformations are designed to realize the aim of concealing the secret information to the least significant Qu-block representing color of the quantum cover image. Finally, the procedures of extracting the secret information are illustrated. Quantum image LSQu-block image information concealing algorithm can be applied in many fields according to different needs.
Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
Directory of Open Access Journals (Sweden)
Wan-Yu Chang
2015-09-01
Full Text Available In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based scan mask. We analyze the advantages of a sequential raster scan for the block-based scan mask, and integrate the block-connected relationships using two different procedures with binary decision trees to reduce unnecessary memory access. This greatly simplifies the pixel locations of the block-based scan mask. Furthermore, our algorithm significantly reduces the number of leaf nodes and depth levels required in the binary decision tree. We analyze the labeling performance of the proposed algorithm alongside that of other labeling algorithms using high-resolution images and foreground images. The experimental results from synthetic and real image datasets demonstrate that the proposed algorithm is faster than other methods.
Kato, K; Sakawa, M
2003-01-01
This paper presents a detailed treatment of genetic algorithms with decomposition procedures as developed for large scale multidimensional 0-1 knapsack problems with block angular structures. Through the introduction of a triple string representation and the corresponding decoding algorithm, it is shown that a potential solution satisfying not only block constraints but also coupling constraints can be obtained for each individual. Then genetic algorithms with decomposition procedures are presented as an approximate solution method for multidimensional 0-1 knapsack problems with block angular structures. Many computational experiments on numerical examples with 30, 50, 70, 100, 150, 200, 300, 500, and 1000 variables demonstrate the feasibility and efficiency of the proposed method.
A New Block Processing Algorithm of LLL for Fast High-dimension Ambiguity Resolution
Directory of Open Access Journals (Sweden)
LIU Wanke
2016-02-01
Full Text Available Due to high dimension and precision for the ambiguity vector under GNSS observations of multi-frequency and multi-system, a major problem to limit computational efficiency of ambiguity resolution is the longer reduction time when using conventional LLL algorithm. To address this problem, it is proposed a new block processing algorithm of LLL by analyzing the relationship between the reduction time and the dimensions and precision of ambiguity. The new algorithm reduces the reduction time to improve computational efficiency of ambiguity resolution, which is based on block processing ambiguity variance-covariance matrix that decreased the dimensions of single reduction matrix. It is validated that the new algorithm with two groups of measured data. The results show that the computing efficiency of the new algorithm increased by 65.2% and 60.2% respectively compared with that of LLL algorithm when choosing a reasonable number of blocks.
Simplified Block Matching Algorithm for Fast Motion Estimation in Video Compression
Directory of Open Access Journals (Sweden)
M. Ezhilarasan
2008-01-01
Full Text Available Block matching motion estimation was one of the most important modules in the design of any video encoder. It consumed more than 85% of video encoding time due to searching of a candidate block in the search window of the reference frame. To minimize the search time on block matching, a simplified and efficient Block Matching Algorithm for Fast Motion Estimation was proposed. It had two steps such as prediction and refinement. The temporal correlation among successive frames and the direction of the previously processed frame for predicting the motion vector of the candidate block was considered during prediction step. Different combination of search points was considered in the refinement step of the algorithm which subsequently minimize the search time. Experiments were conducted on various SIF and CIF video sequences. The performance of the algorithm was compared with existing fast block matching motion estimation algorithms which were used in recent video coding standards. The experimental results were shown that the algorithm provided a faster search with minimum distortion when compared to the optimal fast block matching motion estimation algorithms.
An Efficient Soft Decoder of Block Codes Based on Compact Genetic Algorithm
Directory of Open Access Journals (Sweden)
Ahmed Azouaoui
2012-09-01
Full Text Available Soft-decision decoding is an NP-hard problem with great interest to developers of communication systems. We present an efficient soft-decision decoder of linear block codes based on compact genetic algorithm (cGA and compare its performances with various other decoding algorithms including Shakeel algorithm. The proposed algorithm uses the dual code in contrast to Shakeel algorithm which uses the code itself. Hence, this new approach reduces the decoding complexity of high rates codes. The complexity and an optimized version of this new algorithm are also presented and discussed.
Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms
Directory of Open Access Journals (Sweden)
Ahmed Azouaoui
2012-01-01
Full Text Available A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms.
A chaotic block cipher algorithm for image cryptosystems
Amin, Mohamed; Faragallah, Osama S.; Abd El-Latif, Ahmed A.
2010-11-01
Recently, many scholars have proposed chaotic cryptosystems in order to promote communication security. However, there are a number of major problems detected in some of those schemes such as weakness against differential attack, slow performance speed, and unacceptable data expansion. In this paper, we introduce a new chaotic block cipher scheme for image cryptosystems that encrypts block of bits rather than block of pixels. It encrypts 256-bits of plainimage to 256-bits of cipherimage within eight 32-bit registers. The scheme employs the cryptographic primitive operations and a non-linear transformation function within encryption operation, and adopts round keys for encryption using a chaotic system. The new scheme is able to encrypt large size of images with superior performance speed than other schemes. The security analysis of the new scheme confirms a high security level and fairly uniform distribution.
A block-wise approximate parallel implementation for ART algorithm on CUDA-enabled GPU.
Fan, Zhongyin; Xie, Yaoqin
2015-01-01
Computed tomography (CT) has been widely used to acquire volumetric anatomical information in the diagnosis and treatment of illnesses in many clinics. However, the ART algorithm for reconstruction from under-sampled and noisy projection is still time-consuming. It is the goal of our work to improve a block-wise approximate parallel implementation for the ART algorithm on CUDA-enabled GPU to make the ART algorithm applicable to the clinical environment. The resulting method has several compelling features: (1) the rays are allotted into blocks, making the rays in the same block parallel; (2) GPU implementation caters to the actual industrial and medical application demand. We test the algorithm on a digital shepp-logan phantom, and the results indicate that our method is more efficient than the existing CPU implementation. The high computation efficiency achieved in our algorithm makes it possible for clinicians to obtain real-time 3D images.
Directory of Open Access Journals (Sweden)
A. N. Kuzovlev
2014-01-01
Full Text Available Presents investigations on blocking algorithm for transformer current protections during magnetizing inrush current. The investigations have shown that the algorithm has high sensitivity and reliably determines magnetizing inrush current modes.
Institute of Scientific and Technical Information of China (English)
DU Mao-Kang; HE Bo; WANG Yong
2011-01-01
Recently, the cryptosystem based on chaos has attracted much attention. Wang and Yu (Commun. Nonlin. Sci. Numer. Simulat. 14(2009)574) proposed a block encryption algorithm based on dynamic sequences of multiple chaotic systems. We analyze the potential Saws in the algorithm. Then, a chosen-plaintext attack is presented. Some remedial measures are suggested to avoid the flaws effectively. Furthermore, an improved encryption algorithm is proposed to resist the attacks and to keep all the merits of the original cryptosystem.
A Parallel Algorithm for Solving Block-diagonal Structured Large Linear System
Institute of Scientific and Technical Information of China (English)
SHEN Jie; ZHANG Zhong-lin; CHENG Ji-lin
2001-01-01
A parallel algorithm for solving block-diagonal structured large linear system is presented.This algorithm is based on the "gradient-simplex" method. It partitions a large linear system into several small linear subsystems so that they can be solved in parallel. The algorithm has the merit of high speed and is suitable for the large linear systems with less coupling constrains. The efficiency and applicability of the method is also analyzed.
Map Algorithms for Decoding Linear Block codes Based on Sectionalized Trellis Diagrams
Lin, Shu
1999-01-01
The MAP algorithm is a trellis-based maximum a posteriori probability decoding algorithm. It is the heart of the turbo (or iterative) decoding which achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in long decoding delay. For practical applications, this decoding algorithm must be simplified and its decoding complexity and delay must be reduced. In this paper, the MAP algorithm and its variations, such as Log-MAP and Max-Log-MAP algorithms, are first applied to sectionalized trellises for linear block codes and carried out as two-stage decodings. Using the structural properties of properly sectionalized trellises, the decoding complexity and delay of the MAP algorithms can be reduced. Computation-wise optimum sectionalizations of a trellis for MAP algorithms are investigated. Also presented in this paper are bi-directional and parallel MAP decodings.
Applications of Fast Truncated Multiplication in Cryptography
Directory of Open Access Journals (Sweden)
Laszlo Hars
2006-12-01
Full Text Available Truncated multiplications compute truncated products, contiguous subsequences of the digits of integer products. For an n-digit multiplication algorithm of time complexity O(nÃŽÂ±, with 1<ÃŽÂ±Ã¢Â‰Â¤2, there is a truncated multiplication algorithm, which is constant times faster when computing a short enough truncated product. Applying these fast truncated multiplications, several cryptographic long integer arithmetic algorithms are improved, including integer reciprocals, divisions, Barrett and Montgomery multiplications, 2n-digit modular multiplication on hardware for n-digit half products. For example, Montgomery multiplication is performed in 2.6 Karatsuba multiplication time.
Applications of Fast Truncated Multiplication in Cryptography
Directory of Open Access Journals (Sweden)
Hars Laszlo
2007-01-01
Full Text Available Truncated multiplications compute truncated products, contiguous subsequences of the digits of integer products. For an n-digit multiplication algorithm of time complexity O(nα, with 1<α≤2, there is a truncated multiplication algorithm, which is constant times faster when computing a short enough truncated product. Applying these fast truncated multiplications, several cryptographic long integer arithmetic algorithms are improved, including integer reciprocals, divisions, Barrett and Montgomery multiplications, 2n-digit modular multiplication on hardware for n-digit half products. For example, Montgomery multiplication is performed in 2.6 Karatsuba multiplication time.
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
Lin, Shu
1998-01-01
A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and
A MODIFIED EDGE-ORIENTED SPATIAL INTERPOLATION ALGORITHM FOR CONSECUTIVE BLOCKS ERROR CONCEALMENT
Institute of Scientific and Technical Information of China (English)
Fu Wei; Xing Guangzhong
2007-01-01
This paper proposes a low-complexity spatial-domain Error Concealment (EC) algorithm for recovering consecutive blocks error in still images or Intra-coded (Ⅰ) frames of video sequences. The proposed algorithm works with the following steps. Firstly the Sobel operator is performed on the top and bottom adjacent pixels to detect the most likely edge direction of current block area. After that one-Dimensional (1D) matching is used on the available block boundaries. Displacement between edge direction candidate and most likely edge direction is taken into consideration as an important factor to improve stability of 1D boundary matching. Then the corrupted pixels are recovered by linear weighting interpolation along the estimated edge direction. Finally the interpolated values are merged to get last recovered picture. Simulation results demonstrate that the proposed algorithms obtain good subjective quality and higher Peak Signal-to-Noise Ratio (PSNR) than the methods in literatures for most images.
A novel chaotic image encryption algorithm using block scrambling and dynamic index based diffusion
Xu, Lu; Gou, Xu; Li, Zhi; Li, Jian
2017-04-01
In this paper, we propose a novel chaotic image encryption algorithm which involves a block image scrambling scheme and a new dynamic index based diffusion scheme. Firstly, the original image is divided into two equal blocks by vertical or horizontal directions. Then, we use the chaos matrix to construct X coordinate, Y coordinate and swapping control tables. By searching the X coordinate and Y coordinate tables, the swapping position of the processing pixel is located. The swapping control table is used to control the swapping of the pixel in the current block or the other block. Finally, the dynamic index scheme is applied to the diffusing of the scrambled image. The simulation results and performance analysis show that the proposed algorithm has an excellent safety performance with only one round.
Institute of Scientific and Technical Information of China (English)
Musheng Wei; Qiaohua Liu
2007-01-01
Recently,Wei in[18]proved that perturbed stiff weighted pseudoinverses and stiff weighted least squares problems are stable,if and only if the original and perturbed coefficient matrices A and A satisfy several row rank preservation conditions.According to these conditions,in this paper we show that in general,ordinary modified Gram-Schmidt with column pivoting is not numerically stable for solving the stiff weighted least squares problem.We then propose a row block modified Gram-Schmidt algorithm with column pivoting,and show that with appropriately chosen tolerance,this algorithm can correctly determine the numerical ranks of these row partitioned sub-matrices,and the computed QR factor R contains small roundoff error which is row stable.Several numerical experiments are also provided to compare the results of the ordinary Modified Gram-Schmidt algorithm with column pivoting and the row block Modified Gram-Schmidt algorithm with column pivoting.
A Novel Block-DCT and PCA Based Image Perceptual Hashing Algorithm
Directory of Open Access Journals (Sweden)
Zeng Jie
2013-01-01
Full Text Available Image perceptual hashing finds applications in content indexing, large-scale image database management, certification and authentication and digital watermarking. We propose a Block-DCT and PCA based image perceptual hash in this article and explore the algorithm in the application of tamper detection. The main idea of the algorithm is to integrate color histogram and DCT coefficients of image blocks as perceptual feature, then to compress perceptual features as inter-feature with PCA, and to threshold to create a robust hash. The robustness and discrimination properties of the proposed algorithm are evaluated in detail. Experimental results show that the proposed image perceptual hash algorithm can effectively address the tamper detection problem with advantageous robustness and discrimination.
Single-Dimension Perturbation Glowworm Swarm Optimization Algorithm for Block Motion Estimation
Xiangpin Liu; Shibin Xuan; Feng Liu
2013-01-01
In view of the fact that the classical fast motion estimation methods are easy to fall into local optimum and suffer the high computational cost, the convergence of the motion estimation method based on the swarm intelligence algorithm is very slow. A new block motion estimation method based on single-dimension perturbation glowworm swarm optimization algorithm is proposed. Single-dimension perturbation is a local search strategy which can improve the ability of local optimization. The propos...
Energy Technology Data Exchange (ETDEWEB)
Cazade, Pierre-André; Berezovska, Ganna; Meuwly, Markus, E-mail: m.meuwly@unibas.ch [Department of Chemistry, University of Basel, Klingelbergstrasse 80, CH-4056 Basel (Switzerland); Zheng, Wenwei; Clementi, Cecilia [Department of Chemistry, Rice University, 6100 Main St., Houston, Texas 77005 (United States); Prada-Gracia, Diego; Rao, Francesco [School of Soft Matter Research, Freiburg Institute for Advanced Studies, Albertstrasse 19, 79104 Freiburg im Breisgau (Germany)
2015-01-14
The ligand migration network for O{sub 2}–diffusion in truncated Hemoglobin N is analyzed based on three different clustering schemes. For coordinate-based clustering, the conventional k–means and the kinetics-based Markov Clustering (MCL) methods are employed, whereas the locally scaled diffusion map (LSDMap) method is a collective-variable-based approach. It is found that all three methods agree well in their geometrical definition of the most important docking site, and all experimentally known docking sites are recovered by all three methods. Also, for most of the states, their population coincides quite favourably, whereas the kinetics of and between the states differs. One of the major differences between k–means and MCL clustering on the one hand and LSDMap on the other is that the latter finds one large primary cluster containing the Xe1a, IS1, and ENT states. This is related to the fact that the motion within the state occurs on similar time scales, whereas structurally the state is found to be quite diverse. In agreement with previous explicit atomistic simulations, the Xe3 pocket is found to be a highly dynamical site which points to its potential role as a hub in the network. This is also highlighted in the fact that LSDMap cannot identify this state. First passage time distributions from MCL clusterings using a one- (ligand-position) and two-dimensional (ligand-position and protein-structure) descriptor suggest that ligand- and protein-motions are coupled. The benefits and drawbacks of the three methods are discussed in a comparative fashion and highlight that depending on the questions at hand the best-performing method for a particular data set may differ.
Optimal design of hydraulic manifold blocks based on niching genetic simulated annealing algorithm
Institute of Scientific and Technical Information of China (English)
Jia Chunqiang; Yu Ling; Tian Shujun; Gao Yanming
2007-01-01
To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks(HMB),a hybrid genetic simulated annealing algorithm based on niche technology is presented.This hybrid algorithm,which combines genetic algorithm,simulated annealing algorithm and niche technology,has a strong capability in global and local search,and all extrema can be found in a short time without strict requests for preferences.For the complex restricted solid spatial layout problems in HMB,the optimizing mathematical model is presented.The key technologies in the integrated layout and connection design of HMB,including the realization of coding,annealing operation and genetic operation,are discussed.The framework of HMB optimal design system based on hybrid optimization strategy is proposed.An example is given to testify the effectiveness and feasibility of the algorithm.
Energy Technology Data Exchange (ETDEWEB)
Trudnowski, Daniel J.; Pierre, John W.; Zhou, Ning; Hauer, John F.; Parashar, Manu
2008-05-31
The frequency and damping of electromechanical modes offer considerable insight into the dynamic stability properties of a power system. The performance properties of three block-processing algorithms from the perspective of near real-time automated stability assessment are demonstrated and examined. The algorithms are: the extended modified Yule Walker (YW); extended modified Yule Walker with Spectral analysis (YWS); and numerical state-space subspace system identification(N4SID) algorithm. The YW and N4SID have been introduced in previous publications while the YWS is introduced here. Issues addressed include: stability assessment requirements; automated subset selecting identified modes; using algorithms in an automated format; data assumptions and quality; and expected algorithm estimation performance.
A fast block-matching algorithm based on variable shape search
Institute of Scientific and Technical Information of China (English)
LIU Hao; ZHANG Wen-jun; CAI Jun
2006-01-01
Block-matching motion estimation plays an important role in video coding. The simple and efficient fast block-matching algorithm using Variable Shape Search (VSS) proposed in this paper is based on diamond search and hexagon search. The initial big diamond search is designed to fit the directional centre-biased characteristics of the real-world video sequence, and the directional hexagon search is designed to identify a small region where the best motion vector is expected to locate.Finally, the small diamond search is used to select the best motion vector in the located small region. Experimental results showed that the proposed VSS algorithm can significantly reduce the computational complexity, and provide competitive computational speedup with similar distortion performance as compared with the popular Diamond-based Search (DS) algorithm in the MPEG-4 Simple Profile.
A New Cross Based Gradient Descent Search Algorithm for Block Matching in MPEG-4 Encoder
Institute of Scientific and Technical Information of China (English)
WANGZhenzhou; LIGuiling
2003-01-01
Motion estimation is an important part of the Moving pictures expert group-4 (MPEG-4) encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature occupies a significant part of the encoding time especially when using the straightforward Full Search algorithm. For frame based video encoding, a lot of fast algorithms have been proposed, which have proved to be efficient in encoding In this paper We proposed a new algorithm named Cross based gradient descent search (CBGDS) algorithm, which is significantly faster than FS and gives similar quality of the output sequence. At the same time, We compare our algorithm with some other algorithms, such as Three step search (TSS), Improved three step search (ITSS), New three step search (NTSS), Four step search (4SS), Diamond search (DS), Block based gradient descent search (BBGDS) and Cellular search (CS). As the experimental results show, our algorithm has its advantage over the others. For objects based video encoding, most of the existing fast algorithms are not suitable because the arbitrarily shaped objects have more local minima. So we incorporate the alpha information and propose a new algorithm, which is compatible with the previously proposed efficient motion estimation method for arbitrarily shaped video objects.
Institute of Scientific and Technical Information of China (English)
王振洲; 李桂苓
2003-01-01
Motion estimation is an important part of the MPEG-4 encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature takes a significant part of the encoding time especially when the straightforward full search(FS) algorithm is used. In this paper, a new algorithm named diamond block based gradient descent search (DBBGDS) algorithm, which is significantly faster than FS and gives similar quality of the output sequence, is proposed. At the same time, some other algorithms, such as three step search (TSS), improved three step search (ITSS), new three step search (NTSS), four step search (4SS), cellular search (CS) , diamond search (DS) and block based gradient descent search (BBGDS), are adopted and compared with DBBGDS. As the experimental results show, DBBGDS has its own advantages. Although DS has been adopted by the MPEG-4 VM, its output sequence quality is worse than that of the proposed algorithm while its complexity is similar to the proposed one. Compared with BBGDS, the proposed algorithm can achieve a better output quality.
Directory of Open Access Journals (Sweden)
D.V.MANJUNATHA
2011-10-01
Full Text Available In Digital video communication it is not practical, to store the full digital video without processing, because of the problems encountered in storage and transmission, so the processing technique called videocompression is essential. In video compression, one of the computationally expensive and resource hungry key element is the Motion Estimation. The Motion estimation is a process which determines the motion between two or more frames of video. In this paper, Four block matching motion estimation algorithms, namely Exhaustive Search (ES, Three Step Search (TSS, New Three Step Search (NTSS, and Diamond Search (DS algorithms are compared and implemented for different distances between the frames of the video by exploiting the temporal correlation between successive frames of mristack and foreman slow motion videos and proved that Diamond Search (DS algorithm is the best matching motion estimation algorithm that achieve best tradeoff between search speed (number of computations and reconstructed picture quality with extensive simulation results and comparative analysis.
Algorithmic analysis of the maximum level length in general-block two-dimensional Markov processes
Directory of Open Access Journals (Sweden)
2006-01-01
Full Text Available Two-dimensional continuous-time Markov chains (CTMCs are useful tools for studying stochastic models such as queueing, inventory, and production systems. Of particular interest in this paper is the distribution of the maximal level visited in a busy period because this descriptor provides an excellent measure of the system congestion. We present an algorithmic analysis for the computation of its distribution which is valid for Markov chains with general-block structure. For a multiserver batch arrival queue with retrials and negative arrivals, we exploit the underlying internal block structure and present numerical examples that reveal some interesting facts of the system.
PARAMETRIC EVALUATION ON THE PERFORMANCE OF VARIOUS IMAGE COMPRESSION ALGORITHMS
V. Sutha Jebakumari; P. Arockia Jansi Rani
2011-01-01
Wavelet analysis plays a vital role in the signal processing especially in image compression. In this paper, various compression algorithms like block truncation coding, EZW and SPIHT are studied and ana- lyzed; its algorithm idea and steps are given. The parameters for all these algorithms are analyzed and the best parameter for each of these compression algorithms is found out.
PARAMETRIC EVALUATION ON THE PERFORMANCE OF VARIOUS IMAGE COMPRESSION ALGORITHMS
Directory of Open Access Journals (Sweden)
V. Sutha Jebakumari
2011-05-01
Full Text Available Wavelet analysis plays a vital role in the signal processing especially in image compression. In this paper, various compression algorithms like block truncation coding, EZW and SPIHT are studied and ana- lyzed; its algorithm idea and steps are given. The parameters for all these algorithms are analyzed and the best parameter for each of these compression algorithms is found out.
A wavelet packet based block-partitioning image coding algorithm with rate-distortion optimization
Institute of Scientific and Technical Information of China (English)
YANG YongMing; XU Chao
2008-01-01
As an elegant generalization of wavelet transform, wavelet packet (WP) provides an effective representation tool for adaptive waveform analysis. Recent work shows that image-coding methods based on WP decomposition can achieve significant gain over those based on a usual wavelet transform. However, most of the work adopts a tree-structured quantization scheme, which is a successful technique for wavelet image coding, but not appropriate for WP subbands. This paper presents an image-coding algorithm based on a rate-distortion optimized wavelet packet decomposition and on an intraband block-partitioning scheme. By encoding each WP subband separately with the block-partitioning algorithm and the JPEG2000 context modeling, the proposed algorithm naturally avoids the difficulty in defining parent-offspring relationships for the WP coefficients, which has to be faced when adopting the tree-structured quantization scheme. The experimental results show that the proposed algorithm significantly outperforms SPIHT and JPEG2000 schemes and also surpasses state-of-the-art WP image coding algorithms, in terms of both PSNR and visual quality.
A novel adjustable multiple cross-hexagonal search algorithm for fast block motion estimation
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
In this paper, we propose a novel adjustable multiple cross-hexagonal search (AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns (AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns (HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality.Simulation results showed that our proposed AMCHS achieves faster search speed, and provides better distortion performance than other popular fast search algorithms, such as CDS and CDHS.
GPU-accelerated Block Matching Algorithm for Deformable Registration of Lung CT Images.
Li, Min; Xiang, Zhikang; Xiao, Liang; Castillo, Edward; Castillo, Richard; Guerrero, Thomas
2015-12-01
Deformable registration (DR) is a key technology in the medical field. However, many of the existing DR methods are time-consuming and the registration accuracy needs to be improved, which prevents their clinical applications. In this study, we propose a parallel block matching algorithm for lung CT image registration, in which the sum of squared difference metric is modified as the cost function and the moving least squares approach is used to generate the full displacement field. The algorithm is implemented on Graphic Processing Unit (GPU) with the Compute Unified Device Architecture (CUDA). Results show that the proposed parallel block matching method achieves a fast runtime while maintaining an average registration error (standard deviation) of 1.08 (0.69) mm.
A Novel Hexagonal Search Algorithm for Fast Block Matching Motion Estimation
Directory of Open Access Journals (Sweden)
Anastasios Hamosfakidis
2002-06-01
Full Text Available Based on real-world image sequence characteristics of center-biased motion vector distribution, a Hexagonal (HS algorithm with center-biased checking point pattern for fast block motion estimation is proposed. The HS is compared with full search (FS, four-step search (4SS, new three-step search (NTSS, and recently proposed diamond search (DS methods. Experimental results show that the proposed technique provides competitive performance with reduced computational complexity.
Modified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces
Directory of Open Access Journals (Sweden)
Kim JongKyu
2010-01-01
Full Text Available The purpose of this paper is to use the modified block iterative method to propose an algorithm for solving the convex feasibility problems for an infinite family of quasi- -asymptotically nonexpansive mappings. Under suitable conditions some strong convergence theorems are established in uniformly smooth and strictly convex Banach spaces with Kadec-Klee property. The results presented in the paper improve and extend some recent results.
Modified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces
Directory of Open Access Journals (Sweden)
Shih-sen Chang
2010-01-01
Full Text Available The purpose of this paper is to use the modified block iterative method to propose an algorithm for solving the convex feasibility problems for an infinite family of quasi-ϕ-asymptotically nonexpansive mappings. Under suitable conditions some strong convergence theorems are established in uniformly smooth and strictly convex Banach spaces with Kadec-Klee property. The results presented in the paper improve and extend some recent results.
Institute of Scientific and Technical Information of China (English)
Feng Yi; Li Li; Tian Shujun
2003-01-01
Optimization design of hydraulic manifold blocks (HMB) is studied as a complex solid spatial layout problem. Based on comprehensive research into structure features and design rules of HMB, an optimal mathematical model for this problem is presented. Using human-computer cooperative genetic algorithm (GA) and its hybrid optimization strategies, integrated layout and connection design schemes of HMB can be automatically optimized. An example is given to testify it.
Algorithms for the automatic generation of 2-D structured multi-block grids
Schoenfeld, Thilo; Weinerfelt, Per; Jenssen, Carl B.
1995-01-01
Two different approaches to the fully automatic generation of structured multi-block grids in two dimensions are presented. The work aims to simplify the user interactivity necessary for the definition of a multiple block grid topology. The first approach is based on an advancing front method commonly used for the generation of unstructured grids. The original algorithm has been modified toward the generation of large quadrilateral elements. The second method is based on the divide-and-conquer paradigm with the global domain recursively partitioned into sub-domains. For either method each of the resulting blocks is then meshed using transfinite interpolation and elliptic smoothing. The applicability of these methods to practical problems is demonstrated for typical geometries of fluid dynamics.
Truncated Perfect Actions for Staggered Fermions
Bietenholz, W
1998-01-01
We discuss the behavior of free perfect staggered fermions and truncated versions thereof. The study includes flavor non-degenerate masses. We suggest a new blocking scheme, which provides excellent locality of the perfect lattice action. A truncation procedure adequate for the structure of staggered fermions is applied. We consider spectral and thermodynamic properties and compare truncated perfect actions, Symanzik improved and standard staggered fermions in two and four dimensions.
Instructive discussion of an effective block algorithm for baryon-baryon correlators
Nemura, Hidekatsu
2016-10-01
We describe an approach for the efficient calculation of a large number of four-point correlation functions for various baryon-baryon (BB) channels, which are the primary quantities for studying the nuclear and hyperonic nuclear forces from lattice quantum chromodynamics. Using the four-point correlation function of a proton- Λ system as a specific example, we discuss how an effective block algorithm significantly reduces the number of iterations. The effective block algorithm is applied to calculate 52 channels of the four-point correlation functions from nucleon-nucleon to Ξ- Ξ, in order to study the complete set of isospin symmetric BB interactions. The elapsed times measured for hybrid parallel computation on BlueGene/Q demonstrate that the performance of the present algorithm is reasonable for various combinations of the number of OpenMP threads and the number of MPI nodes. The numerical results are compared with the results obtained using the unified contraction algorithm for all computed sites of the 52 four-point correlators.
An Iterative Power Allocation Algorithm for Group-wise Space-Time Block Coding Systems
Institute of Scientific and Technical Information of China (English)
ZHANG Hong-wei; ZHANG Hai-bin; SONG Wen-tao; LUO Han-wen; LIU Xing-zhao
2007-01-01
An iterative transmit power allocation (PA) algorithm was proposed for group-wise space-time block coding (G-STBC) systems with group-wise successive interference cancellation (GSIC) receivers.Group-wise interference suppression (GIS) filters are employed to separate each group's transmit signals from other interfer ences and noise.While the total power on all transmit symbols is constrained, all transmit PA coefficients are updated jointly according to the channel information at each iteration.Through PA, each detection symbol has the same post-detection signal to interference-and-noise ratio (SINR).The simulation results verify that the proposed PA algorithm converges at the equilibrium quickly after few iterations, and it achieves much lower bit error rates than the previous single symbol SIC PA and the fixed ratio PA algorithms for G-STBC systems with GSIC receivers.
A Multigrid Block LU-SGS Algorithm for Euler Equations on Unstructured Grids
Institute of Scientific and Technical Information of China (English)
Ruo Li; Xin Wang; Weibo Zhao
2008-01-01
We propose an efficient and robust algorithm to solve the steady Euler equations on unstructured grids. The new algorithm is a Newton-iteration method in which each iteration step is a linear multigrid method using block lower-upper symmetric Gauss-Seidel (LU-SGS) iteration as its smoother. To regularize the Jacobian matrix of Newton-iteration, we adopted a local residual dependent regularization as the replace ment of the standard time-stepping relaxation technique based on the local CFL number. The proposed method can be extended to high order approximations and three spatial dimensions in a nature way. The solver was tested on a sequence of benchmark prob lems on both quasi-uniform and local adaptive meshes. The numerical results illustrated the efficiency and robustness of our algorithm.
ROBUST ZERO-WATERMARK ALGORITHMS BASED ON NUMERICAL RELATIONSHIP BETWEEN ADJACENT BLOCKS
Institute of Scientific and Technical Information of China (English)
Zhang Yifeng; Jia Chengwei; Wang Xuechen; Wang Kai; Pei Wenjiang
2012-01-01
In this paper,three robust zero-watermark algorithms named Direct Current coefficient RElationship (DC-RE),CUmulant combined Singular Value Decomposition (CU-SVD),and CUmulant combined Singular Value Decomposition RElationship (CU-SVD-RE) are proposed.The algorithm DC-RE gets the feature vector from the relationship of DC coefficients between adjacent blocks,CU-SVD gets the feature vector from the singular value of third-order cumulants,while CU-SVD-RE combines the essence of the first two algorithms.Specially,CU-SVD-RE gets the feature vector from the relationship between singular values of third-order cumulants.Being a cross-over studying field of watermarking and cryptography,the zero-watermark algorithms are robust without modifying the carrier.Numerical simulation obviously shows that,under geometric attacks,the performance of CU-SVD-RE and DC-RE algorithm are better and all three proposed algorithms are robust to various attacks,such as median filter,salt and pepper noise,and Gaussian low-pass filter attacks.
A block matching-based registration algorithm for localization of locally advanced lung tumors
Robertson, Scott P.; Weiss, Elisabeth; Hugo, Geoffrey D.
2014-01-01
Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm3), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%; p < 0.001). Left
A Fast Block-Matching Algorithm Using Smooth Motion Vector Field Adaptive Search Technique
Institute of Scientific and Technical Information of China (English)
LI Bo(李波); LI Wei(李炜); TU YaMing(涂亚明)
2003-01-01
In many video standards based on inter-frame compression such as H.26x and MPEG, block-matching algorithm has been widely adopted as the method for motion estimation because of its simplicity and effectiveness. Nevertheless, since motion estimation is very complex in computing. Fast algorithm for motion estimation has always been an important and attractive topic in video compression. From the viewpoint of making motion vector field smoother, this paper proposes a new algorithm SMVFAST. On the basis of motion correlation, it predicts the starting point by neighboring motion vectors according to their SADs. Adaptive search modes are usedin its search process through simply classifying motion activity. After discovering the ubiquitous ratio between the SADs of the collocated blocks in the consecutive frames, the paper proposes an effective half-stop criterion that can quickly stop the search process with good enough results.Experiments show that SMVFAST obtains almost the same results as the full search at very low computation cost, and outperforms MVFAST and PMVFAST in speed and quality, which are adopted by MPEG-4.
Instructive discussion of effective block algorithm for baryon-baryon correlators
Nemura, Hidekatsu
2015-01-01
We describe a fairly specific idea to calculate efficiently a large number of four-point correlation functions, which are primary quantities to study the nuclear force and hyperonic nuclear forces from lattice QCD, for various baryon-baryon (BB) channels. We discuss how the effective block algorithm significantly reduces the number of iterations with considering the four-point correlator of proton-$\\Lambda$ system as a specific example. The effective block algorithm is applied to calculate the 52 channels of four-point correlation functions from nucleon-nucleon to $\\Xi-\\Xi$, in order to study the complete set of isospin symmetric BB interactions. The elapsed times measured on hybrid parallel computation on BlueGene/Q show reasonable performances at various combinations of the number of OpenMP threads and the number of MPI nodes. The numerical results are benchmarked with the results from the unified contraction algorithm for all of computed sites of 52 four-point correlators.
A novel chaotic block image encryption algorithm based on dynamic random growth technique
Wang, Xingyuan; Liu, Lintao; Zhang, Yingqian
2015-03-01
This paper proposes a new block image encryption scheme based on hybrid chaotic maps and dynamic random growth technique. Since cat map is periodic and can be easily cracked by chosen plaintext attack, we use cat map in another securer way, which can completely eliminate the cyclical phenomenon and resist chosen plaintext attack. In the diffusion process, an intermediate parameter is calculated according to the image block. The intermediate parameter is used as the initial parameter of chaotic map to generate random data stream. In this way, the generated key streams are dependent on the plaintext image, which can resist the chosen plaintext attack. The experiment results prove that the proposed encryption algorithm is secure enough to be used in image transmission systems.
BSIRT: a block-iterative SIRT parallel algorithm using curvilinear projection model.
Zhang, Fa; Zhang, Jingrong; Lawrence, Albert; Ren, Fei; Wang, Xuan; Liu, Zhiyong; Wan, Xiaohua
2015-03-01
Large-field high-resolution electron tomography enables visualizing detailed mechanisms under global structure. As field enlarges, the distortions of reconstruction and processing time become more critical. Using the curvilinear projection model can improve the quality of large-field ET reconstruction, but its computational complexity further exacerbates the processing time. Moreover, there is no parallel strategy on GPU for iterative reconstruction method with curvilinear projection. Here we propose a new Block-iterative SIRT parallel algorithm with the curvilinear projection model (BSIRT) for large-field ET reconstruction, to improve the quality of reconstruction and accelerate the reconstruction process. We also develop some key techniques, including block-iterative method with the curvilinear projection, a scope-based data decomposition method and a page-based data transfer scheme to implement the parallelization of BSIRT on GPU platform. Experimental results show that BSIRT can improve the reconstruction quality as well as the speed of the reconstruction process.
An Efficient Algorithm for Maximum-Entropy Extension of Block-Circulant Covariance Matrices
Carli, Francesca P; Pavon, Michele; Picci, Giorgio
2011-01-01
This paper deals with maximum entropy completion of partially specified block-circulant matrices. Since positive definite symmetric circulants happen to be covariance matrices of stationary periodic processes, in particular of stationary reciprocal processes, this problem has applications in signal processing, in particular to image modeling. Maximum entropy completion is strictly related to maximum likelihood estimation subject to certain conditional independence constraints. The maximum entropy completion problem for block-circulant matrices is a nonlinear problem which has recently been solved by the authors, although leaving open the problem of an efficient computation of the solution. The main contribution of this paper is to provide an efficient algorithm for computing the solution. Simulation shows that our iterative scheme outperforms various existing approaches, especially for large dimensional problems. A necessary and sufficient condition for the existence of a positive definite circulant completio...
Solving Job-Shop Scheduling Problems by Genetic Algorithms Based on Building Block Hypothesis
Institute of Scientific and Technical Information of China (English)
CHENG Rong; CHEN You-ping; LI Zhi-gang
2006-01-01
In this paper, we propose a new genetic algorithm for job-shop scheduling problems(JSP). The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed: By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C + + show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.
Research on handover algorithm to reduce the blocking probability in LEO satellite network
Institute of Scientific and Technical Information of China (English)
Chen Bingcai; Zhang Naitong; Nie Boxun; Zhou Tingxian
2006-01-01
Based on the characteristics of guaranteed handover (GH) algorithm, the finite capacity in one system makes the blocking probability (PB) of GH algorithm increase rapidly in the case of high traffic load. So, when large amounts of multimedia services are transmitted via a single low earth orbit (LEO) satellite system, the PB of it is much higher. In order to solve the problem, a novel handover scheme defined by multi-tier optiral layer selection is proposed. The scheme sufficienfly takes into ac count the characteristics of double-tier satellite network, which is constituted by LEO satellites combined with medium earth orbit (MEO) satellites, and the multimedia transmitted by such network, so it can augment this systematic capacity and effectively reduces the traffic load in the LEO which performs GH algorithm. The detailed processes are also presented. The simulation and numerical results show that the approach integrated with GH algorithm achieves a significant improvement in the PB and practicability, as compared to the single LEO layer network.
Truncated VSV solutions to symmetric rank-deficient problems
DEFF Research Database (Denmark)
Fierro, Richardo D.; Hansen, Per Christian
2001-01-01
Symmetric VSV decompositions are new rank-revealing decompositions that exploit and preserve symmetry. Truncated VSV solutions are stabilized solutions computed by neglecting blocks in the VSV decomposition with small norm. We compare the truncated VSV solutions with truncated SVD solutions...... and give perturbation bounds for the VSV solutions. Numerical examples illustrate our results....
Truncated VSV Solutions to Symmetric Rank-Deficient Problems
DEFF Research Database (Denmark)
Fierro, Ricardo D.; Hansen, Per Christian
2002-01-01
Symmetric VSV decompositions are new rank-revealing decompositions that exploit and preserve symmetry. Truncated VSV solutions are stabilized solutions computed by neglecting blocks in the VSV decomposition with small norm. We compare the truncated VSV solutions with truncated SVD solutions...... and give perturbation bounds for the VSV solutions. Numerical examples illustrate our results....
Directory of Open Access Journals (Sweden)
Mahmoud Abdellaoui
2009-01-01
Full Text Available Problem statement: Channel capacity can be an essential parameter for wireless communication to improve the link quality. Until now, the channel capacity has been evaluated by utilizing Shannon capacity theory, but it presented many limitations and restrictions. The objectives of this study were to: (i Expose, quantify, present and to give a clear and concise exposition of the mathematical principles of the proposed generic algorithm and (ii Calculate and simulate the SNR, the BER and the channel capacity for wireless underwater transceiver and compare with the literature references. Approach: Contrary to the existing theory (Shannon capacity theory that required and needed of the exact channel state distribution and particularly the precisely estimation of cut-off threshold profile, so, the bad estimation allowed suspending transmission even for good channel conditions, the proposed generic algorithm was used to determine the channel capacity performance with varying block size input packet information (N was varied from 50-200 as a function of the optimum transmit power (from 3.5-7.0 w. This approach did not require the exact channel state distribution; but the channel was well modeled and the cut-off threshold profile had to be numerically solved. The iteration results of this algorithm were utilized to calculate and simulate the SNR, the BER and the channel capacity for wireless underwater transceiver performance. Results: The consultation performance of channel capacity wireless underwater communication, obtained with present approach, were significantly better in any transmission conditions (no suspending transmission because the proposed algorithm was well suited to obtain results about channel capacity. In the other hand, the amount of transmitted data per resource depended on the channel conditions was performed. Blocking is no longer critical if data traffic without or with sensitivity has to be served. Data rate results were allowed
Single-Dimension Perturbation Glowworm Swarm Optimization Algorithm for Block Motion Estimation
Directory of Open Access Journals (Sweden)
Xiangpin Liu
2013-01-01
Full Text Available In view of the fact that the classical fast motion estimation methods are easy to fall into local optimum and suffer the high computational cost, the convergence of the motion estimation method based on the swarm intelligence algorithm is very slow. A new block motion estimation method based on single-dimension perturbation glowworm swarm optimization algorithm is proposed. Single-dimension perturbation is a local search strategy which can improve the ability of local optimization. The proposed method not only has overcome the defect of falling into local optimum easily by taking use of both the global search ability of glowworm swarm optimization algorithm and the local optimization ability of single-dimension perturbation but also has reduced the computation complexity by using motion vector predictor and terminating strategies in view of the characteristic of video images. The experimental results show that the performance of the proposed method is better than that of other motion estimation methods for most video sequences, specifically for those video sequences with violent motion, and the searching precision has been improved obviously. Although the computational complexity of the proposed method is slightly higher than that of the classical methods, it is still far lower than that of full search method.
Institute of Scientific and Technical Information of China (English)
王强; 张火明; 高文军; 蒋娟; 赵洲
2012-01-01
In order to replace full-depth system to perform the hybrid model testing,the equivalent water depth truncated system is designed.Considering the similarity of static characteristics of total mooring system and the representative of the single root mooring ropes between the truncated mooring system and full-depth mooring system,the improved mutative Scalechaos algorithm is employed to the optimization of the equivalent water depth truncated mooring system.Based on a spar platform operated in 1,500m water depth optimal design is exercised for its truncated mooring system in 700m water depth.The numerical experimentation result indicated that the design of the truncated mooring system is reasonable and reliable.%为替代全水深系统进行混合模型试验,设计了等效水深截断系统.同时考虑总系泊系统以及具有代表性的单根系泊缆静恢复力特性相似,采用改进的变尺度混沌算法对等效水深截断系泊系统进行优化计算.选取了一工作水深为1500m的新型单柱式(Spar)平台,对其截断水深为700m的等效截断系泊系统进行优化设计,数值试验结果表明,截断系统的设计是合理的、可靠的.
Institute of Scientific and Technical Information of China (English)
邓冠龙; 徐震浩; 顾幸生
2012-01-01
A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
An Efficient Implementation of the Sign LMS Algorithm Using Block Floating Point Format
Chakraborty, Mrityunjoy; Shaik, Rafiahamed; Lee, Moon Ho
2007-12-01
An efficient scheme is presented for implementing the sign LMS algorithm in block floating point format, which permits processing of data over a wide dynamic range at a processor complexity and cost as low as that of a fixed point processor. The proposed scheme adopts appropriate formats for representing the filter coefficients and the data. It also employs a scaled representation for the step-size that has a time-varying mantissa and also a time-varying exponent. Using these and an upper bound on the step-size mantissa, update relations for the filter weight mantissas and exponent are developed, taking care so that neither overflow occurs, nor are quantities which are already very small multiplied directly. Separate update relations are also worked out for the step size mantissa. The proposed scheme employs mostly fixed-point-based operations, and thus achieves considerable speedup over its floating-point-based counterpart.
An Efficient Implementation of the Sign LMS Algorithm Using Block Floating Point Format
Directory of Open Access Journals (Sweden)
Moon Ho Lee
2007-01-01
Full Text Available An efficient scheme is presented for implementing the sign LMS algorithm in block floating point format, which permits processing of data over a wide dynamic range at a processor complexity and cost as low as that of a fixed point processor. The proposed scheme adopts appropriate formats for representing the filter coefficients and the data. It also employs a scaled representation for the step-size that has a time-varying mantissa and also a time-varying exponent. Using these and an upper bound on the step-size mantissa, update relations for the filter weight mantissas and exponent are developed, taking care so that neither overflow occurs, nor are quantities which are already very small multiplied directly. Separate update relations are also worked out for the step size mantissa. The proposed scheme employs mostly fixed-point-based operations, and thus achieves considerable speedup over its floating-point-based counterpart.
Song, Xiaoying; Huang, Qijun; Chang, Sheng; He, Jin; Wang, Hao
2016-12-01
To address the low compression efficiency of lossless compression and the low image quality of general near-lossless compression, a novel near-lossless compression algorithm based on adaptive spatial prediction is proposed for medical sequence images for possible diagnostic use in this paper. The proposed method employs adaptive block size-based spatial prediction to predict blocks directly in the spatial domain and Lossless Hadamard Transform before quantization to improve the quality of reconstructed images. The block-based prediction breaks the pixel neighborhood constraint and takes full advantage of the local spatial correlations found in medical images. The adaptive block size guarantees a more rational division of images and the improved use of the local structure. The results indicate that the proposed algorithm can efficiently compress medical images and produces a better peak signal-to-noise ratio (PSNR) under the same pre-defined distortion than other near-lossless methods.
Ramachandran, Ganesh K.; Akopian, David; Heckler, Gregory W.; Winternitz, Luke B.
2011-01-01
Location technologies have many applications in wireless communications, military and space missions, etc. US Global Positioning System (GPS) and other existing and emerging Global Navigation Satellite Systems (GNSS) are expected to provide accurate location information to enable such applications. While GNSS systems perform very well in strong signal conditions, their operation in many urban, indoor, and space applications is not robust or even impossible due to weak signals and strong distortions. The search for less costly, faster and more sensitive receivers is still in progress. As the research community addresses more and more complicated phenomena there exists a demand on flexible multimode reference receivers, associated SDKs, and development platforms which may accelerate and facilitate the research. One of such concepts is the software GPS/GNSS receiver (GPS SDR) which permits a facilitated access to algorithmic libraries and a possibility to integrate more advanced algorithms without hardware and essential software updates. The GNU-SDR and GPS-SDR open source receiver platforms are such popular examples. This paper evaluates the performance of recently proposed block-corelator techniques for acquisition and tracking of GPS signals using open source GPS-SDR platform.
MOTION ESTIMATION IN MPEG-4 VIDEO SEQUENCE USING BLOCK MATCHING ALGORITHM
Directory of Open Access Journals (Sweden)
KISHORE PINNINTI
2011-12-01
Full Text Available Now a day, MPEG-4 is the most apparent multimedia standard which combines natural interactivity, synthetic digital videos and computer graphics. It has a wide variety of applications such as video conferencing, computer games and mobile phones etc. All the applications need portable video communicators, so low power VLSIimplementations are required. In addition to the required portable devices, a care must be taken for the band width limitations. To perform an effective transmission of video sequences using the limited Bandwidth, the input data must be compressed and coded to fit these limited resources .This paper aims towards the realizationof an efficient estimation of moving components in a video image sequences to isolate moving image from the static background. The architecture developed in this paper uses LMS algorithm for estimating the noise components and also uses Block Matching Algorithm for the detection of moving components in the frame sequences. Further Huffman decoder is used for decoding the compressed data in the video codec. The proposed task is implemented in VHDL Language and the results are analyzed in XILINX Spartan-III.
Lin, Ying Chih; Lu, Chin Lung; Chang, Hwan-You; Tang, Chuan Yi
2005-01-01
In the study of genome rearrangement, the block-interchanges have been proposed recently as a new kind of global rearrangement events affecting a genome by swapping two nonintersecting segments of any length. The so-called block-interchange distance problem, which is equivalent to the sorting-by-block-interchange problem, is to find a minimum series of block-interchanges for transforming one chromosome into another. In this paper, we study this problem by considering the circular chromosomes and propose a Omicron(deltan) time algorithm for solving it by making use of permutation groups in algebra, where n is the length of the circular chromosome and delta is the minimum number of block-interchanges required for the transformation, which can be calculated in Omicron(n) time in advance. Moreover, we obtain analogous results by extending our algorithm to linear chromosomes. Finally, we have implemented our algorithm and applied it to the circular genomic sequences of three human vibrio pathogens for predicting their evolutionary relationships. Consequently, our experimental results coincide with the previous ones obtained by others using a different comparative genomics approach, which implies that the block-interchange events seem to play a significant role in the evolution of vibrio species.
Liu, Hsin-I.; Richards, Brian; Zakhor, Avideh; Nikolic, Borivoje
2010-03-01
Future lithography systems must produce chips with smaller feature sizes, while maintaining throughput comparable to today's optical lithography systems. This places stringent data handling requirements on the design of any direct-write maskless system. To achieve the throughput of one wafer layer per minute with a direct-write maskless lithography system, using 22 nm pixels for 45 nm technology, a data rate of 12 Tb/s is required. In our past research, we have developed a datapath architecture for direct-write lithography systems, and have shown that lossless compression plays a key role in reducing throughput requirements of such systems. Our approach integrates a low complexity hardware-based decoder with the writers, in order to decode a compressed data layer in real time on the fly. In doing so, we have developed a spectrum of lossless compression algorithms for integrated circuit rasterized layout data to provide a tradeoff between compression efficiency and hardware complexity, the most promising of which is Block Golomb Context Copy Coding (Block GC3). In this paper, we present the synthesis results of the Block GC3 decoder for both FPGA and ASIC implementations. For one Block GC3 decoder, 3233 slice flip-flops and 3086 4-input LUTs are utilized in a Xilinx Virtex II Pro 70 FPGA, which corresponds to 4% of its resources, along with 1.7 KB of internal memory. The system runs at 100 MHz clock rate, with the overall output rate of 495 Mb/s for a single decoder. The corresponding ASIC implementation results in a 0.07 mm2 design with the maximum output rate of 2.47 Gb/s. In addition to the decoder implementation results, we discuss other hardware implementation issues for the writer system data path, including on-chip input/output buffering, error propagation control, and input data stream packaging. This hardware data path implementation is independent of the writer systems or data link types, and can be integrated with arbitrary directwrite lithography systems.
Institute of Scientific and Technical Information of China (English)
Pei-Chann Chang; Wei-Hsiu Huang; Zhen-Zhen Zhang
2012-01-01
In this research,we introduce a new heuristic approach using the concept of ant colony optimization (ACO)to extract patterns from the chromosomes generated by previous generations for solving the generalized traveling salesman problem.The proposed heuristic is composed of two phases.In the first phase the ACO technique is adopted to establish an archive consisting of a set of non-overlapping blocks and of a set of remaining cities (nodes) to be visited.The second phase is a block recombination phase where the set of blocks and the rest of cities are combined to form an artificial chromosome.The generated artificial chromosomes (ACs) will then be injected into a standard genetic algorithm (SGA) to speed up the convergence.The proposed method is called "Puzzle-Based Genetic Algorithm" or "p-ACGA".We demonstrate that p-ACGA performs very well on all TSPLIB problems,which have been solved to optimality by other researchers.The proposed approach can prevent the early convergence of the genetic algorithm (GA) and lead the algorithm to explore and exploit the search space by taking advantage of the artificial chromosomes.
Lin, Shu; Fossorier, Marc
1998-01-01
The Viterbi algorithm is indeed a very simple and efficient method of implementing the maximum likelihood decoding. However, if we take advantage of the structural properties in a trellis section, other efficient trellis-based decoding algorithms can be devised. Recently, an efficient trellis-based recursive maximum likelihood decoding (RMLD) algorithm for linear block codes has been proposed. This algorithm is more efficient than the conventional Viterbi algorithm in both computation and hardware requirements. Most importantly, the implementation of this algorithm does not require the construction of the entire code trellis, only some special one-section trellises of relatively small state and branch complexities are needed for constructing path (or branch) metric tables recursively. At the end, there is only one table which contains only the most likely code-word and its metric for a given received sequence r = (r(sub 1), r(sub 2),...,r(sub n)). This algorithm basically uses the divide and conquer strategy. Furthermore, it allows parallel/pipeline processing of received sequences to speed up decoding.
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
A multi-dimensional concatenation scheme for block codes is introduced, in which information symbols are interleaved and re-encoded for more than once. It provides a convenient platform to design high performance codes with flexible interleaver size.Coset based MAP soft-in/soft-out decoding algorithms are presented for the F24 code. Simulation results show that the proposed coding scheme can achieve high coding gain with flexible interleaver length and very low decoding complexity.
Xu, Shaoping; Hu, Lingyan; Yang, Xiaohui
2016-01-01
The performance of conventional denoising algorithms is usually controlled by one or several parameters whose optimal settings depend on the contents of the processed images and the characteristics of the noises. Among these parameters, noise level is a fundamental parameter that is always assumed to be known by most of the existing denoising algorithms (so-called nonblind denoising algorithms), which largely limits the applicability of these nonblind denoising algorithms in many applications. Moreover, these nonblind algorithms do not always achieve the best denoised images in visual quality even when fed with the actual noise level parameter. To address these shortcomings, in this paper we propose a new quality-aware features-based noise level estimator (NLE), which consists of quality-aware features extraction and optimal noise level parameter prediction. First, considering that image local contrast features convey important structural information that is closely related to image perceptual quality, we utilize the marginal statistics of two local contrast operators, i.e., the gradient magnitude and the Laplacian of Gaussian (LOG), to extract quality-aware features. The proposed quality-aware features have very low computational complexity, making them well suited for time-constrained applications. Then we propose a learning-based framework where the noise level parameter is estimated based on the quality-aware features. Based on the proposed NLE, we develop a blind block matching and three-dimensional filtering (BBM3D) denoising algorithm which is capable of effectively removing additive white Gaussian noise, even coupled with impulse noise. The noise level parameter of the BBM3D algorithm is automatically tuned according to the quality-aware features, guaranteeing the best performance. As such, the classical block matching and three-dimensional algorithm can be transformed into a blind one in an unsupervised manner. Experimental results demonstrate that the
ALGORITHMIC FACILITIES AND SOFTWARE FOR VIRTUAL DESIGN OF ANTI-BLOCK AND COUNTER-SLIPPING SYSTEMS
Directory of Open Access Journals (Sweden)
N. N. Hurski
2009-01-01
Full Text Available The paper considers algorithms of designing a roadway covering for virtual test of mobile machine movement dynamics; an algorithm of forming actual values of forces/moments in «road–wheel–car» contact and their derivatives, and also a software for virtual designing of mobile machine dynamics.
Modified Multi-Resolution Telescopic Search Algorithm for Block-Matching Motion Estimation
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
This paper presents a modified multi-resolution telescopic search algorithm (MRTlcSA) for the blockmatching motion estimation. A novel inverse telescopic search is substituted for the conventional telescopic search, that reduces the on-chip memory size and memory bandwidth for VLSI implementation. In addition, strategies of motion track and adaptive search window are applied to reduce the computational complexity of motion estimation. Simulation results show that, compared with the MRTlcSA, the proposed algorithm reduces the computational load to only 30%while preserving almost the same image quality. Comparisons on hardware cost and power consumption of the VLSI implementations using the two algorithms are also presented in the paper.``
Directory of Open Access Journals (Sweden)
F. F. Ngwane
2015-01-01
Full Text Available We propose a block hybrid trigonometrically fitted (BHT method, whose coefficients are functions of the frequency and the step-size for directly solving general second-order initial value problems (IVPs, including systems arising from the semidiscretization of hyperbolic Partial Differential Equations (PDEs, such as the Telegraph equation. The BHT is formulated from eight discrete hybrid formulas which are provided by a continuous two-step hybrid trigonometrically fitted method with two off-grid points. The BHT is implemented in a block-by-block fashion; in this way, the method does not suffer from the disadvantages of requiring starting values and predictors which are inherent in predictor-corrector methods. The stability property of the BHT is discussed and the performance of the method is demonstrated on some numerical examples to show accuracy and efficiency advantages.
Massanes, Francesc; Cadennes, Marie; Brankov, Jovan G.
2011-07-01
We describe and evaluate a fast implementation of a classical block-matching motion estimation algorithm for multiple graphical processing units (GPUs) using the compute unified device architecture computing engine. The implemented block-matching algorithm uses summed absolute difference error criterion and full grid search (FS) for finding optimal block displacement. In this evaluation, we compared the execution time of a GPU and CPU implementation for images of various sizes, using integer and noninteger search grids. The results show that use of a GPU card can shorten computation time by a factor of 200 times for integer and 1000 times for a noninteger search grid. The additional speedup for a noninteger search grid comes from the fact that GPU has built-in hardware for image interpolation. Further, when using multiple GPU cards, the presented evaluation shows the importance of the data splitting method across multiple cards, but an almost linear speedup with a number of cards is achievable. In addition, we compared the execution time of the proposed FS GPU implementation with two existing, highly optimized nonfull grid search CPU-based motion estimations methods, namely implementation of the Pyramidal Lucas Kanade Optical flow algorithm in OpenCV and simplified unsymmetrical multi-hexagon search in H.264/AVC standard. In these comparisons, FS GPU implementation still showed modest improvement even though the computational complexity of FS GPU implementation is substantially higher than non-FS CPU implementation. We also demonstrated that for an image sequence of 720 × 480 pixels in resolution commonly used in video surveillance, the proposed GPU implementation is sufficiently fast for real-time motion estimation at 30 frames-per-second using two NVIDIA C1060 Tesla GPU cards.
Approximate truncation robust computed tomography—ATRACT
Dennerlein, Frank; Maier, Andreas
2013-09-01
We present an approximate truncation robust algorithm to compute tomographic images (ATRACT). This algorithm targets at reconstructing volumetric images from cone-beam projections in scenarios where these projections are highly truncated in each dimension. It thus facilitates reconstructions of small subvolumes of interest, without involving prior knowledge about the object. Our method is readily applicable to medical C-arm imaging, where it may contribute to new clinical workflows together with a considerable reduction of x-ray dose. We give a detailed derivation of ATRACT that starts from the conventional Feldkamp filtered-backprojection algorithm and that involves, as one component, a novel original formula for the inversion of the two-dimensional Radon transform. Discretization and numerical implementation are discussed and reconstruction results from both, simulated projections and first clinical data sets are presented.
Identifying Excessively Rounded or Truncated Data
Knuth, Kevin H; Wheeler, Kevin R
2016-01-01
All data are digitized, and hence are essentially integers rather than true real numbers. Ordinarily this causes no difficulties since the truncation or rounding usually occurs below the noise level. However, in some instances, when the instruments or data delivery and storage systems are designed with less than optimal regard for the data or the subsequent data analysis, the effects of digitization may be comparable to important features contained within the data. In these cases, information has been irrevocably lost in the truncation process. While there exist techniques for dealing with truncated data, we propose a straightforward method that will allow us to detect this problem before the data analysis stage. It is based on an optimal histogram binning algorithm that can identify when the statistical structure of the digitization is on the order of the statistical structure of the data set itself.
Motion Vector Estimation Using Line-Square Search Block Matching Algorithm for Video Sequences
Directory of Open Access Journals (Sweden)
Guo Bao-long
2004-09-01
Full Text Available Motion estimation and compensation techniques are widely used for video coding applications but the real-time motion estimation is not easily achieved due to its enormous computations. In this paper, a new fast motion estimation algorithm based on line search is presented, in which computation complexity is greatly reduced by using the line search strategy and a parallel search pattern. Moreover, the accurate search is achieved because the small square search pattern is used. It has a best-case scenario of only 9 search points, which is 4 search points less than the diamond search algorithm. Simulation results show that, compared with the previous techniques, the LSPS algorithm significantly reduces the computational requirements for finding motion vectors, and also produces close performance in terms of motion compensation errors.
Improved algorithm for reducing blocking artifacts of Tetrolet transform%Tetrolet变换方块效应改善算法
Institute of Scientific and Technical Information of China (English)
张凌晓; 刘克成; 李财莲
2014-01-01
In order to reduce the blocking artifacts resulted from Ttetrolet transform algorithm, Tetrolet transform was improved and Cycle Spinning was employed to avoid the blocking artifacts in this paper. And thus the improved Tetrolet transform was introduced and performed for image denoising. Some numerical experiments show the effectiveness and superiority of our technique. Compared with typical Tetrolet transform, the denoised images by our method are smoother, and the blocking artifacts is improved to some extent and inhibition. At the same time it can preserve more significant information of original images, such as local features, including image edges and image details. In addition, the proposed method gives better performance in Peak Signal to Noise Ratio (PSNR) and improves the quality of subjective and objective of image. Experimental results show that the proposed algorithm is effective and feasible, and can perform better on most data sets.%针对Tetrolet变换算法对图像去噪后存在方块效应的缺陷，文中对Tetrolet变换算法进行了扩展和改进，并引入移位(Cycle Spinning)来有效消除Tetrolet变换算法中的方块效应。仿真结果表明，所提出的算法不仅能有效去除噪声，而且可得到更高的峰值信噪比，提高了图像的主客观质量。去噪后图像保留了原始图像的边缘和细节等局部特征，较为平滑，且方块效应得到了一定的改善和抑制，因而该算法是有效可行的。
Community Detection Algorithm Combining Stochastic Block Model and Attribute Data Clustering
Kataoka, Shun; Kobayashi, Takuto; Yasuda, Muneki; Tanaka, Kazuyuki
2016-11-01
We propose a new algorithm to detect the community structure in a network that utilizes both the network structure and vertex attribute data. Suppose we have the network structure together with the vertex attribute data, that is, the information assigned to each vertex associated with the community to which it belongs. The problem addressed this paper is the detection of the community structure from the information of both the network structure and the vertex attribute data. Our approach is based on the Bayesian approach that models the posterior probability distribution of the community labels. The detection of the community structure in our method is achieved by using belief propagation and an EM algorithm. We numerically verified the performance of our method using computer-generated networks and real-world networks.
Community Detection Algorithm Combining Stochastic Block Model and Attribute Data Clustering
Kataoka, Shun; Yasuda, Muneki; Tanaka, Kazuyuki
2016-01-01
We propose a new algorithm to detect the community structure in a network that utilizes both the network structure and vertex attribute data. Suppose we have the network structure together with the vertex attribute data, that is, the information assigned to each vertex associated with the community to which it belongs. The problem addressed this paper is the detection of the community structure from the information of both the network structure and the vertex attribute data. Our approach is based on the Bayesian approach that models the posterior probability distribution of the community labels. The detection of the community structure in our method is achieved by using belief propagation and an EM algorithm. We numerically verified the performance of our method using computer-generated networks and real-world networks.
Tamascelli, D; Plenio, M B
2015-01-01
When the amount of entanglement in a quantum system is limited, the relevant dynamics of the system is restricted to a very small part of the state space. When restricted to this subspace the description of the system becomes efficient in the system size. A class of algorithms, exemplified by the Time-Evolving Block-Decimation (TEBD) algorithm, make use of this observation by selecting the relevant subspace through a decimation technique relying on the Singular Value Decomposition (SVD). In these algorithms, the complexity of each time-evolution step is dominated by the SVD. Here we show that, by applying a randomized version of the SVD routine (RRSVD), the power law governing the computational complexity of TEBD is lowered by one degree, resulting in a considerable speed-up. We exemplify the potential gains in efficiency at the hand of some real world examples to which TEBD can be successfully applied to and demonstrate that for those system RRSVD delivers results as accurate as state-of-the-art deterministi...
Institute of Scientific and Technical Information of China (English)
Haiming Qi; Weidong Yu
2009-01-01
In order to improve the performance of block adaptive quantization (BAQ) when the output of the analog to digital converter (ADC)is saturated, this paper proposes an anti-saturation BAQ algorithm. First, the concept of the standard deviation of the output signal (SDOS) of the ADC is proposed. Also, unlike traditional normalization processing, SDOS is used and the mapping between SDOS and the average signal magnitude is deduced. Second, the saturation term is introduced to the Lloyd-Max quantizer and an optimal non-uniform scalar quantizer for saturated SAR raw data quantization is proposed. After this, the implementation scheme for the pro-posed algorithm using an FPGA is analyzed in detail. Third, the relationships among the saturation degree of the signal, the peak-to-peak value of the ADC, standard deviation of the input and output signal of the ADC and the average signal magnitude are deduced.Based on these relationships, a power compensation decoder is designed for encoding. Numerical experiment results based on ERS-1 and the simulated data show that the performance of the proposed algorithm is better than that of BAQ.
Arias, Fernando X.; Sierra, Heidy; Arzuaga, Emmanuel
2016-05-01
Compressive Sensing is an area of great recent interest for efficient signal acquisition, manipulation and reconstruction tasks in areas where sensor utilization is a scarce and valuable resource. The current work shows that approaches based on this technology can improve the efficiency of manipulation, analysis and storage processes already established for hyperspectral imagery, with little discernible loss in data performance upon reconstruction. We present the results of a comparative analysis of classification performance between a hyperspectral data cube acquired by traditional means, and one obtained through reconstruction from compressively sampled data points. To obtain a broad measure of the classification performance of compressively sensed cubes, we classify a commonly used scene in hyperspectral image processing algorithm evaluation using a set of five classifiers commonly used in hyperspectral image classification. Global accuracy statistics are presented and discussed, as well as class-specific statistical properties of the evaluated data set.
Truncation Effects in Monte Carlo Renormalization Group Improved Lattice Actions
Takaishi, T; Forcrand, Ph. de
1998-01-01
We study truncation effects in the SU(3) gauge actions obtained by the Monte Carlo renormalization group method. By measuring the heavy quark potential we find that the truncation effects in the actions coarsen the lattice by 40-50 % from the original blocked lattice. On the other hand, we find that rotational symmetry of the heavy quark potentials is well recovered on such coarse lattices, which may indicate that rotational symmetry breaking terms are easily cancelled out by adding a short distance operator. We also discuss the possibility of reducing truncation effects.
Mixtures of truncated basis functions
DEFF Research Database (Denmark)
Langseth, Helge; Nielsen, Thomas Dyhre; Rumí, Rafael
2012-01-01
In this paper we propose a framework, called mixtures of truncated basis functions (MoTBFs), for representing general hybrid Bayesian networks. The proposed framework generalizes both the mixture of truncated exponentials (MTEs) framework and the mixture of polynomials (MoPs) framework. Similar...
Energy Technology Data Exchange (ETDEWEB)
Simon, Vitor Hugo
1997-12-01
The goal of this work was a development of an algorithm for the Truncated Plurigaussian Stochastic Simulation and its validation in a complex geologic model. The reservoir data comes from Aux Vases Zone at Rural Hill Field in Illinois, USA, and from the 2D geological interpretation, described by WEIMER et al. (1982), three sets of samples, with different grid densities ware taken. These sets were used to condition the simulation and to refine the estimates of the non-stationary matrix of facies proportions, used to truncate the gaussian random functions (RF). The Truncated Plurigaussian Model is an extension of the Truncated Gaussian Model (TG). In this new model its possible to use several facies with different spatial structures, associated with the simplicity of TG. The geological interpretation, used as a validation model, was chosen because it shows a set of NW/SE elongated tidal channels cutting the NE/SW shoreline deposits interleaved by impermeable facies. These characteristics of spatial structures of sedimentary facies served to evaluate the simulation model. Two independent gaussian RF were used, as well as an 'erosive model' as the truncation strategy. Also, non-conditional simulations were proceeded, using linearly combined gaussian RF with varying correlation coefficients. It was analyzed the influence of some parameters like: number of gaussian RF,correlation coefficient, truncations strategy, in the outcome of simulation, and also the physical meaning of these parameters under a geological point of view. It was showed, step by step, using an example, the theoretical model, and how to construct an algorithm to simulate with the Truncated Plurigaussian Model. The conclusion of this work was that even with a plain algorithm of the Conditional Truncated Plurigaussian and a complex geological model it's possible to obtain a usefulness product. (author)
Directory of Open Access Journals (Sweden)
Pongpan Nakkaew
2016-06-01
Full Text Available In manufacturing process where efficiency is crucial in order to remain competitive, flowshop is a common configuration in which machines are arranged in series and products are produced through the stages one by one. In certain production processes, the machines are frequently configured in the way that each production stage may contain multiple processing units in parallel or hybrid. Moreover, along with precedent conditions, the sequence dependent setup times may exist. Finally, in case there is no buffer, a machine is said to be blocked if the next stage to handle its output is being occupied. Such NP-Hard problem, referred as Blocking Hybrid Flowshop Scheduling Problem with Sequence Dependent Setup/Changeover Times, is usually not possible to find the best exact solution to satisfy optimization objectives such as minimization of the overall production time. Thus, it is usually solved by approximate algorithms such as metaheuristics. In this paper, we investigate comparatively the effectiveness of the two approaches: a Genetic Algorithm (GA and an Artificial Bee Colony (ABC algorithm. GA is inspired by the process of natural selection. ABC, in the same manner, resembles the way types of bees perform specific functions and work collectively to find their foods by means of division of labor. Additionally, we apply an algorithm to improve the GA and ABC algorithms so that they can take advantage of parallel processing resources of modern multiple core processors while eliminate the need for screening the optimal parameters of both algorithms in advance.
How Truncating Are 'Truncating Languages'? Evidence from Russian and German.
Rathcke, Tamara V
Russian and German have pr eviously been described as 'truncating', or cutting off target frequencies of the phrase-final pitch trajectories when the time available for voicing is compromised. However, supporting evidence is rare and limited to only a few pitch categories. This paper reports a production study conducted to document pitch adjustments to linguistic materials, in which the amount of voicing available for the realization of a pitch pattern varies from relatively long to extremely short. Productions of nuclear H+L*, H* and L*+H pitch accents followed by a low boundary tone were investigated in the two languages. The results of the study show that speakers of both 'truncating languages' do not utilize truncation exclusively when accommodating to different segmental environments. On the contrary, they employ several strategies - among them is truncation but also compression and temporal re-alignment - to produce the target pitch categories under increasing time pressure. Given that speakers can systematically apply all three adjustment strategies to produce some pitch patterns (H* L% in German and Russian) while not using truncation in others (H+L* L% particularly in Russian), we question the effectiveness of the typological classification of these two languages as 'truncating'. Moreover, the phonetic detail of truncation varies considerably, both across and within the two languages, indicating that truncation cannot be easily modeled as a unified phenomenon. The results further suggest that the phrase-final pitch adjustments are sensitive to the phonological composition of the tonal string and the status of a particular tonal event (associated vs. boundary tone), and do not apply to falling vs. rising pitch contours across the board, as previously put forward for German. Implications for the intonational phonology and prosodic typology are addressed in the discussion. © 2017 S. Karger AG, Basel.
Adaptive bit truncation and compensation method for EZW image coding
Dai, Sheng-Kui; Zhu, Guangxi; Wang, Yao
2003-09-01
The embedded zero-tree wavelet algorithm (EZW) is widely adopted to compress wavelet coefficients of images with the property that the bits stream can be truncated and produced anywhere. The lower bit plane of the wavelet coefficents is verified to be less important than the higher bit plane. Therefore it can be truncated and not encoded. Based on experiments, a generalized function, which can provide a glancing guide for EZW encoder to intelligently decide the number of low bit plane to be truncated, is deduced in this paper. In the EZW decoder, a simple method is presented to compensate for the truncated wavelet coefficients, and finally it can surprisingly enhance the quality of reconstructed image and spend scarcely any additional cost at the same time.
New results to BDD truncation method for efficient top event probability calculation
Energy Technology Data Exchange (ETDEWEB)
Mo, Yuchang; Zhong, Farong; Zhao, Xiangfu [Zhejiang Normal University, Jinhua (China); Yang, Quansheng [Computer Science, Zhejiang Normal University, Nanjing (China); Cui, Gang [School of Computer Science and Technology, Harbin institute of technology, Harbin (China)
2012-10-15
A Binary Decision Diagram (BDD) is a graph-based data structure that calculates an exact top event probability (TEP). It has been a very difficult task to develop an efficient BDD algorithm that can solve a large problem since its memory consumption is very high. Recently, in order to solve a large reliability problem within limited computational resources, Jung presented an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. In this paper, it is first identified that Jung's BDD truncation algorithm can be improved for a more practical use. Then, a more efficient truncation algorithm is proposed in this paper, which can generate truncated BDD with smaller size and approximate TEP with smaller truncation error. Empirical results showed this new algorithm uses slightly less running time and slightly more storage usage than Jung's algorithm. It was also found, that designing a truncation algorithm with ideal features for every possible fault tree is very difficult, if not impossible. The so-called ideal features of this paper would be that with the decrease of truncation limits, the size of truncated BDD converges to the size of exact BDD, but should never be larger than exact BDD.
AN EFFICIENT BTC IMAGE COMPRESSION ALGORITHM
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Block truncation coding (BTC) is a simple and fast image compression technique suitable for realtime image transmission, and it has high channel error resisting capability and good reconstructed image quality. The main shortcoming of the original BTC algorithm is the high bit rate (normally 2 bits/pixel). In order to reduce the bit rate, an efficient BTC image compression algorithm was presented in this paper. In the proposed algorithm, a simple look-up-table method is presented for coding the higher mean and the lower mean of a block without any extra distortion, and a prediction technique is introduced to reduce the number of bits used to code the bit plane with some extra distortion. The test results prove the effectiveness of the proposed algorithm.
Modified BTC Algorithm for Audio Signal Coding
Directory of Open Access Journals (Sweden)
TOMIC, S.
2016-11-01
Full Text Available This paper describes modification of a well-known image coding algorithm, named Block Truncation Coding (BTC and its application in audio signal coding. BTC algorithm was originally designed for black and white image coding. Since black and white images and audio signals have different statistical characteristics, the application of this image coding algorithm to audio signal presents a novelty and a challenge. Several implementation modifications are described in this paper, while the original idea of the algorithm is preserved. The main modifications are performed in the area of signal quantization, by designing more adequate quantizers for audio signal processing. The result is a novel audio coding algorithm, whose performance is presented and analyzed in this research. The performance analysis indicates that this novel algorithm can be successfully applied in audio signal coding.
Directory of Open Access Journals (Sweden)
Siwaporn Saewan
2010-01-01
Full Text Available We introduce a modified block hybrid projection algorithm for solving the convex feasibility problems for an infinite family of closed and uniformly quasi-ϕ-asymptotically nonexpansive mappings and the set of solutions of the generalized equilibrium problems. We obtain a strong convergence theorem for the sequences generated by this process in a uniformly smooth and strictly convex Banach space with Kadec-Klee property. The results presented in this paper improve and extend some recent results.
A NEW ALGORITHM SOLVING THE LINEAR EQUATION SYSTEM WITH BLOCK CYCLE COEFFICIENT MATRIX%块循环矩阵方程组的新算法
Institute of Scientific and Technical Information of China (English)
张耀明
2001-01-01
A kind of new partitioning algorithm that solves the linear equation system with block cycle coefficient matrix is presented in this paper. The original problem is partitioned into a series of independent subproblems. Compared with the original problem, the dimension of all these subproblems are vary small.This point ensures that it have a better conditioning and give smaller round-off errors. More importantly, the technique leads to a higher efficiency of computation.
一类分组密码的S盒重组算法%S-boxes reorganization algorithm for a class of block ciphers
Institute of Scientific and Technical Information of China (English)
杨宏志; 韩文报
2009-01-01
S盒是许多分组密码唯一的非线性部件,它的密码强度决定了整个密码算法的安全强度.足够大的S盒是安全的,但为了便于实现,分组密码多采用若干小S盒拼凑.针对一类分组密码算法,通过将S盒与密钥相关联,给出了S盒重组算法,丰富了S盒的应用模式,有效提高了分组密码的安全强度.%S-boxes are the only nonlinear components in many block cipher algorithms, and they decide the security strength of the whole algorithm. Generally speaking, a big enough S-box is secure. However, for the convenience of implementation, several small S-boxes were combined. Concerning one class of block ciphers, an S-boxes reorganized algorithm was given, which enriched S-boxes application patterns and improved the security strength.
Peng, Ao-Ping; Li, Zhi-Hui; Wu, Jun-Lin; Jiang, Xin-Yu
2016-12-01
Based on the previous researches of the Gas-Kinetic Unified Algorithm (GKUA) for flows from highly rarefied free-molecule transition to continuum, a new implicit scheme of cell-centered finite volume method is presented for directly solving the unified Boltzmann model equation covering various flow regimes. In view of the difficulty in generating the single-block grid system with high quality for complex irregular bodies, a multi-block docking grid generation method is designed on the basis of data transmission between blocks, and the data structure is constructed for processing arbitrary connection relations between blocks with high efficiency and reliability. As a result, the gas-kinetic unified algorithm with the implicit scheme and multi-block docking grid has been firstly established and used to solve the reentry flow problems around the multi-bodies covering all flow regimes with the whole range of Knudsen numbers from 10 to 3.7E-6. The implicit and explicit schemes are applied to computing and analyzing the supersonic flows in near-continuum and continuum regimes around a circular cylinder with careful comparison each other. It is shown that the present algorithm and modelling possess much higher computational efficiency and faster converging properties. The flow problems including two and three side-by-side cylinders are simulated from highly rarefied to near-continuum flow regimes, and the present computed results are found in good agreement with the related DSMC simulation and theoretical analysis solutions, which verify the good accuracy and reliability of the present method. It is observed that the spacing of the multi-body is smaller, the cylindrical throat obstruction is greater with the flow field of single-body asymmetrical more obviously and the normal force coefficient bigger. While in the near-continuum transitional flow regime of near-space flying surroundings, the spacing of the multi-body increases to six times of the diameter of the single
Directory of Open Access Journals (Sweden)
Saewan Siwaporn
2011-01-01
Full Text Available Abstract In this paper, we introduce a new modified block iterative algorithm for finding a common element of the set of common fixed points of an infinite family of closed and uniformly quasi-ϕ-asymptotically nonexpansive mappings, the set of the variational inequality for an α-inverse-strongly monotone operator, and the set of solutions of a system of generalized mixed equilibrium problems. We obtain a strong convergence theorem for the sequences generated by this process in a 2-uniformly convex and uniformly smooth Banach space. Our results extend and improve ones from several earlier works. 2000 MSC: 47H05; 47H09; 47H10.
Truncated States Obtained by Iteration
Institute of Scientific and Technical Information of China (English)
W.B.Cardoso; N.G.de Almeida
2008-01-01
We introduce the concept of truncated states obtained via iterative processes(TSI)and study its statistical features,making an analogy with dynamical systems theory(DST).As a specific example,we have studied TSI for the doubring and the logistic functions,which are standard functions in studying chaos.TSI for both the doubling and logistic functions exhibit certain similar patterns when their statistical features are compared from the point of view of DST.
基于改进GA的分段堆场计划调度方法研究%Block stockyard scheduling approach based on an improved genetic algorithm
Institute of Scientific and Technical Information of China (English)
张志英; 计峰; 曾建智
2015-01-01
针对船舶分段堆场在调度过程中周转效率低、调度滞后以及调度成本高等问题，以进出场分段在堆场中的调度为研究对象，考虑船舶分段堆场调度过程中的扰动因素，采用基于事件触发式的重调度方法，结合分段质量和移动距离建立数学模型，以移动分段所需的成本为优化目标，提出利用改进遗传算法来选择分段在堆场中停放位置的较优方案，并构建启发式规则来确定分段最优进、出场路径。利用某船厂实际数据对模型进行验证，表明该方法可得到较优的堆场作业计划，实现堆场资源的高效利用。%This paper presented a mathematical model defined as the assignment of the inbound and outbound blocks in the stockyard with the purpose of minimizing the moving cost based on the block scheduling problems such as low turnover, lagged scheduling, high cost, etc. An event⁃triggered rescheduling method was formulated to solve dis⁃turbance factors appeared in the process of block stockyard scheduling. Taking the blocks' mass and moving dis⁃tance into consideration, an improved genetic algorithm is put forward to select the optimal parking locations for the inbound blocks. A heuristic rule is embedded in the algorithm to select the optimal inbound and outbound paths for the blocks. Application data are obtained from a shipyard to validate the model, and the result showed that using the proposed method, an optimal schedule of stockyard can be obtained, and the resources of stockyard can be uti⁃lized with high efficiency.
Truncated Calogero-Sutherland models
Pittman, S M; Olshanii, M; del Campo, A
2016-01-01
A one-dimensional quantum many-body system consisting of particles confined in a harmonic potential and subject to finite-range two-body and three-body inverse-square interactions is introduced. The range of the interactions is set by truncation beyond a number of neighbors and can be tuned to interpolate between the Calogero-Sutherland model and a system with interactions among nearest and next-nearest neighbors discussed by Jain and Khare. The model also includes the Tonks-Girardeau gas describing impenetrable bosons as well as a novel extension with truncated interactions. All these systems are exactly solvable and exhibit a linear spectrum, with the effect of the interactions being absorbed in a nontrivial zero-point energy. We characterize the degeneracies and derive the canonical partition function. While the ground state wavefunction takes a truncated Bijl-Jastrow form, excited states are found in terms of multivariable symmetric polynomials. We numerically compute the density profile and one-body redu...
Lin, Shu; Fossorier, Marc
1998-01-01
In a coded communication system with equiprobable signaling, MLD minimizes the word error probability and delivers the most likely codeword associated with the corresponding received sequence. This decoding has two drawbacks. First, minimization of the word error probability is not equivalent to minimization of the bit error probability. Therefore, MLD becomes suboptimum with respect to the bit error probability. Second, MLD delivers a hard-decision estimate of the received sequence, so that information is lost between the input and output of the ML decoder. This information is important in coded schemes where the decoded sequence is further processed, such as concatenated coding schemes, multi-stage and iterative decoding schemes. In this chapter, we first present a decoding algorithm which both minimizes bit error probability, and provides the corresponding soft information at the output of the decoder. This algorithm is referred to as the MAP (maximum aposteriori probability) decoding algorithm.
Truncations of random unitary matrices
Zyczkowski, K; Zyczkowski, Karol; Sommers, Hans-Juergen
1999-01-01
We analyze properties of non-hermitian matrices of size M constructed as square submatrices of unitary (orthogonal) random matrices of size N>M, distributed according to the Haar measure. In this way we define ensembles of random matrices and study the statistical properties of the spectrum located inside the unit circle. In the limit of large matrices, this ensemble is characterized by the ratio M/N. For the truncated CUE we derive analytically the joint density of eigenvalues from which easily all correlation functions are obtained. For N-M fixed and N--> infinity the universal resonance-width distribution with N-M open channels is recovered.
基于LDPC-OFDM技术的块均值视频水印算法%A block-mean video watermarking algorithm based on LDPC-OFDM
Institute of Scientific and Technical Information of China (English)
高宝建; 柏潇; 邢玲
2012-01-01
According to the similarity of video watermarking and communication system, a block-mean video watermarking algorithm based on LDPC-OFDM is proposed. Experimental results show that the proposed algorithm has only a few impacts on the quality of the video and has good invisibility. The watermark can be extracted blindly and it's robust to gaussian low-pass filter, shear attack, gaussian white noise, salt and pepper noise. Also it's robust to MPEG-2 compression and the video synchronous at-tacts such as frame deletion, frame switch, frame restructuring and frame insert. It's a new video watermarking algorithm with good performance.%根据视频水印系统和通信系统的相似性,提出一种基于LDPC-OFDM的块均值视频水印算法.实验结果表明,该算法对视频质量影响小,可以很好地保证视频质量,实现水印的盲提取,且对高斯低通滤波、剪切攻击、高斯白噪声、椒盐噪声攻击及MPEG-2压缩、视频帧同步攻击具有较强的鲁棒性,是一种性能良好的盲视频水印算法.
An efficient BTC image compression algorithm with visual patterns
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Discusses block truncation coding (BTC) a simple and fast image compression technique suitable for real-time image transmission with high channel error resisting capability and good reconstructed image quality, and its main drawback of high bit rate of 2 bits/pixel for a 256-gray image for the purpose of reducing the bit rate, and introduces a simple look-up-table method for coding the higher mean and the lower mean of a block, and a set of 24 visual patterns used to encode 4×4 bit plane of the high-detail block and proposes a new algorithm, when needs only 19 bits to encode 4×4 high-detail block and 12 bits to encode the 4×4 low-detail block.
Truncated states obtained by iteration
Cardoso, W B
2007-01-01
Quantum states of the electromagnetic field are of considerable importance, finding potential application in various areas of physics, as diverse as solid state physics, quantum communication and cosmology. In this paper we introduce the concept of truncated states obtained via iterative processes (TSI) and study its statistical features, making an analogy with dynamical systems theory (DST). As a specific example, we have studied TSI for the doubling and the logistic functions, which are standard functions in studying chaos. TSI for both the doubling and logistic functions exhibit certain similar patterns when their statistical features are compared from the point of view of DST. A general method to engineer TSI in the running-wave domain is employed, which includes the errors due to the nonidealities of detectors and photocounts.
改进的块差值无损鲁棒图像水印算法%Improved lossless robust image watermarking algorithm based on block's difference
Institute of Scientific and Technical Information of China (English)
尚冠宇; 韩万兵; 郭凡新; 邓小鸿
2013-01-01
为了解决目前基于块差值无损鲁棒水印算法的不足,提出了一种基于Huffman编码和K-means聚类的改进算法.对嵌入过程中产生的水印负载,利用Huffman编码进一步减少其大小,提高水印嵌入容量；对水印提取过程中,可能发生的1-bit区域和0-bit区域重合的问题,利用K-means聚类算法提高水印提取精确度.实验结果表明,与现有相关算法相比,文种算法在水印嵌入容量和鲁棒性上具有明显优势.%To deal with the problems in lossless robust watermarking based on image block's difference, an adaptive algorithm is proposed. In the embedding procedure, the Huffman coding is employed to reduce the watermark's overhead such as the marked information of image's block, and increases the actual embedding capacity. In the extract procedure, the K-means clustering is utilized to resolve the overlap problem between 1-bit zone and 0-bit zone, and enhances the extracting accuracy. Experimental results show that, compared with previous works, the performance of the proposed method is significantly improved in terms of capacity and robustness.
S, Kyriacou; E, Kontoleontos; S, Weissenberger; L, Mangani; E, Casartelli; I, Skouteropoulou; M, Gattringer; A, Gehrer; M, Buchmayr
2014-03-01
An efficient hydraulic optimization procedure, suitable for industrial use, requires an advanced optimization tool (EASY software), a fast solver (block coupled CFD) and a flexible geometry generation tool. EASY optimization software is a PCA-driven metamodel-assisted Evolutionary Algorithm (MAEA (PCA)) that can be used in both single- (SOO) and multiobjective optimization (MOO) problems. In MAEAs, low cost surrogate evaluation models are used to screen out non-promising individuals during the evolution and exclude them from the expensive, problem specific evaluation, here the solution of Navier-Stokes equations. For additional reduction of the optimization CPU cost, the PCA technique is used to identify dependences among the design variables and to exploit them in order to efficiently drive the application of the evolution operators. To further enhance the hydraulic optimization procedure, a very robust and fast Navier-Stokes solver has been developed. This incompressible CFD solver employs a pressure-based block-coupled approach, solving the governing equations simultaneously. This method, apart from being robust and fast, also provides a big gain in terms of computational cost. In order to optimize the geometry of hydraulic machines, an automatic geometry and mesh generation tool is necessary. The geometry generation tool used in this work is entirely based on b-spline curves and surfaces. In what follows, the components of the tool chain are outlined in some detail and the optimization results of hydraulic machine components are shown in order to demonstrate the performance of the presented optimization procedure.
Directory of Open Access Journals (Sweden)
Anas Altaleb
2017-03-01
Full Text Available The aim of this work is to synthesize 8*8 substitution boxes (S-boxes for block ciphers. The confusion creating potential of an S-box depends on its construction technique. In the first step, we have applied the algebraic action of the projective general linear group PGL(2,GF(28 on Galois field GF(28. In step 2 we have used the permutations of the symmetric group S256 to construct new kind of S-boxes. To explain the proposed extension scheme, we have given an example and constructed one new S-box. The strength of the extended S-box is computed, and an insight is given to calculate the confusion-creating potency. To analyze the security of the S-box some popular algebraic and statistical attacks are performed as well. The proposed S-box has been analyzed by bit independent criterion, linear approximation probability test, non-linearity test, strict avalanche criterion, differential approximation probability test, and majority logic criterion. A comparison of the proposed S-box with existing S-boxes shows that the analyses of the extended S-box are comparatively better.
Altaleb, Anas; Saeed, Muhammad Sarwar; Hussain, Iqtadar; Aslam, Muhammad
2017-03-01
The aim of this work is to synthesize 8*8 substitution boxes (S-boxes) for block ciphers. The confusion creating potential of an S-box depends on its construction technique. In the first step, we have applied the algebraic action of the projective general linear group PGL(2,GF(28)) on Galois field GF(28). In step 2 we have used the permutations of the symmetric group S256 to construct new kind of S-boxes. To explain the proposed extension scheme, we have given an example and constructed one new S-box. The strength of the extended S-box is computed, and an insight is given to calculate the confusion-creating potency. To analyze the security of the S-box some popular algebraic and statistical attacks are performed as well. The proposed S-box has been analyzed by bit independent criterion, linear approximation probability test, non-linearity test, strict avalanche criterion, differential approximation probability test, and majority logic criterion. A comparison of the proposed S-box with existing S-boxes shows that the analyses of the extended S-box are comparatively better.
Statistical estimation for truncated exponential families
Akahira, Masafumi
2017-01-01
This book presents new findings on nonregular statistical estimation. Unlike other books on this topic, its major emphasis is on helping readers understand the meaning and implications of both regularity and irregularity through a certain family of distributions. In particular, it focuses on a truncated exponential family of distributions with a natural parameter and truncation parameter as a typical nonregular family. This focus includes the (truncated) Pareto distribution, which is widely used in various fields such as finance, physics, hydrology, geology, astronomy, and other disciplines. The family is essential in that it links both regular and nonregular distributions, as it becomes a regular exponential family if the truncation parameter is known. The emphasis is on presenting new results on the maximum likelihood estimation of a natural parameter or truncation parameter if one of them is a nuisance parameter. In order to obtain more information on the truncation, the Bayesian approach is also considere...
Lamp with a truncated reflector cup
Li, Ming; Allen, Steven C.; Bazydola, Sarah; Ghiu, Camil-Daniel
2013-10-15
A lamp assembly, and method for making same. The lamp assembly includes first and second truncated reflector cups. The lamp assembly also includes at least one base plate disposed between the first and second truncated reflector cups, and a light engine disposed on a top surface of the at least one base plate. The light engine is configured to emit light to be reflected by one of the first and second truncated reflector cups.
Tel, G.
1993-01-01
We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of distri
Computing Correct Truncated Excited State Wavefunctions
Bacalis, N C; Zang, J; Karaoulanis, D
2016-01-01
We demonstrate that, if a truncated expansion of a wave function is small, then the standard excited states computational method, of optimizing one root of a secular equation, may lead to an incorrect wave function - despite the correct energy according to the theorem of Hylleraas, Undheim and McDonald - whereas our proposed method [J. Comput. Meth. Sci. Eng. 8, 277 (2008)] (independent of orthogonality to lower lying approximants) leads to correct reliable small truncated wave functions. The demonstration is done in He excited states, using truncated series expansions in Hylleraas coordinates, as well as standard configuration-interaction truncated expansions.
Computing correct truncated excited state wavefunctions
Bacalis, N. C.; Xiong, Z.; Zang, J.; Karaoulanis, D.
2016-12-01
We demonstrate that, if a wave function's truncated expansion is small, then the standard excited states computational method, of optimizing one "root" of a secular equation, may lead to an incorrect wave function - despite the correct energy according to the theorem of Hylleraas, Undheim and McDonald - whereas our proposed method [J. Comput. Meth. Sci. Eng. 8, 277 (2008)] (independent of orthogonality to lower lying approximants) leads to correct reliable small truncated wave functions. The demonstration is done in He excited states, using truncated series expansions in Hylleraas coordinates, as well as standard configuration-interaction truncated expansions.
Iterative truncated arithmetic mean filter and its properties.
Jiang, Xudong
2012-04-01
The arithmetic mean and the order statistical median are two fundamental operations in signal and image processing. They have their own merits and limitations in noise attenuation and image structure preservation. This paper proposes an iterative algorithm that truncates the extreme values of samples in the filter window to a dynamic threshold. The resulting nonlinear filter shows some merits of both the fundamental operations. Some dynamic truncation thresholds are proposed that guarantee the filter output, starting from the mean, to approach the median of the input samples. As a by-product, this paper unveils some statistics of a finite data set as the upper bounds of the deviation of the median from the mean. Some stopping criteria are suggested to facilitate edge preservation and noise attenuation for both the long- and short-tailed distributions. Although the proposed iterative truncated mean (ITM) algorithm is not aimed at the median, it offers a way to estimate the median by simple arithmetic computing. Some properties of the ITM filters are analyzed and experimentally verified on synthetic data and real images.
Fast FPGA Implementation of EBCOT block in JPEG2000 Standard
Directory of Open Access Journals (Sweden)
Anass Mansouri
2011-09-01
Full Text Available Embedded block coding with optimized truncation (EBCOT is an important feature of the latest digital still-image compression standard, JPEG2000; however, it consumes more than 50% of the computation time in the compression process. In this paper, we propose a new high speed VLSI implementation of the EBCOT algorithm. The main concept of the proposed architecture is based on parallel access to memories, and uses an efficient design of the context generator block. The proposed architecture is described in VHDL language, verified by simulation and successfully implemented in a Cyclone II and Stratix III FPGA. It provides a major reduction in memory access requirements, as well as a net increase of the processing speed as shown by the simulations.
分组密码算法SM4的低复杂度实现%Low Complexity Implementation of Block Cipher SM4 Algorithm
Institute of Scientific and Technical Information of China (English)
王晨光; 乔树山; 黑勇
2013-01-01
A basic architecture is proposed for reducing the implementation complexity of SM4 block cipher.The architecture reuses the hardware of encryption/decryption and key expansion module because the encryption/decryption algorithm is very similar with the key expansion algorithm.Optimum trade-off among control-logic complexity,reused-module complexity and throughput is realized through careful analysis and choose of specific realization.A SM4 cipher IP is designed based on this architecture.The designed IP's cost is only 55％ of the traditional design in Field Programmable Gate Array(FPGA).The IP is also synthesized under the SMIC 0.18 μm CMOS process.Its area is 0.079 mm2 with 100 Mb/s throughput.Experimental results of synthesis show that the proposed architecture can reduce the implementation complexity of SM4 block cipher efficiently.%针对分组密码算法SM4中加解密算法与密钥扩展算法的相似性,提出一种将加解密模块与密钥扩展模块复用的基本架构,通过对具体实现结构的分析与选择,使控制逻辑复杂度、复用模块复杂度以及系统吞吐量之间得到权衡.基于该架构设计SM4加解密IP核,在现场可编程门阵列上占用的资源仅为传统设计的55％,基于SMIC 0.18 μm数字CMOS工艺的综合结果显示,仅用0.079 mm2即可实现1 00 Mb/s的数据吞吐量.实验结果表明,该结构可以有效地降低SM4算法的实现复杂度.
Truncatable bootstrap equations in algebraic form and critical surface exponents
Gliozzi, Ferdinando
2016-01-01
We describe examples of drastic truncations of conformal bootstrap equations encoding much more information than that obtained by a direct numerical approach. A three-term truncation of the four point function of a free scalar in any space dimensions provides algebraic identities among conformal block derivatives which generate the exact spectrum of the infinitely many primary operators contributing to it. In boundary conformal field theories, we point out that the appearance of free parameters in the solutions of bootstrap equations is not an artifact of truncations, rather it reflects a physical property of permeable conformal interfaces which are described by the same equations. Surface transitions correspond to isolated points in the parameter space. We are able to locate them in the case of 3d Ising model, thanks to a useful algebraic form of 3d boundary bootstrap equations. It turns out that the low-lying spectra of the surface operators in the ordinary and the special transitions of 3d Ising model form...
Truncatable bootstrap equations in algebraic form and critical surface exponents
Gliozzi, Ferdinando
2016-10-01
We describe examples of drastic truncations of conformal bootstrap equations encoding much more information than that obtained by a direct numerical approach. A three-term truncation of the four point function of a free scalar in any space dimensions provides algebraic identities among conformal block derivatives which generate the exact spectrum of the infinitely many primary operators contributing to it. In boundary conformal field theories, we point out that the appearance of free parameters in the solutions of bootstrap equations is not an artifact of truncations, rather it reflects a physical property of permeable conformal interfaces which are described by the same equations. Surface transitions correspond to isolated points in the parameter space. We are able to locate them in the case of 3d Ising model, thanks to a useful algebraic form of 3d boundary bootstrap equations. It turns out that the low-lying spectra of the surface operators in the ordinary and the special transitions of 3d Ising model form two different solutions of the same polynomial equation. Their interplay yields an estimate of the surface renormalization group exponents, y h = 0 .72558(18) for the ordinary universality class and y h = 1 .646(2) for the special universality class, which compare well with the most recent Monte Carlo calculations. Estimates of other surface exponents as well as OPE coefficients are also obtained.
Truncatable bootstrap equations in algebraic form and critical surface exponents
Energy Technology Data Exchange (ETDEWEB)
Gliozzi, Ferdinando [Dipartimento di Fisica, Università di Torino andIstituto Nazionale di Fisica Nucleare - sezione di Torino,Via P. Giuria 1, Torino, I-10125 (Italy)
2016-10-10
We describe examples of drastic truncations of conformal bootstrap equations encoding much more information than that obtained by a direct numerical approach. A three-term truncation of the four point function of a free scalar in any space dimensions provides algebraic identities among conformal block derivatives which generate the exact spectrum of the infinitely many primary operators contributing to it. In boundary conformal field theories, we point out that the appearance of free parameters in the solutions of bootstrap equations is not an artifact of truncations, rather it reflects a physical property of permeable conformal interfaces which are described by the same equations. Surface transitions correspond to isolated points in the parameter space. We are able to locate them in the case of 3d Ising model, thanks to a useful algebraic form of 3d boundary bootstrap equations. It turns out that the low-lying spectra of the surface operators in the ordinary and the special transitions of 3d Ising model form two different solutions of the same polynomial equation. Their interplay yields an estimate of the surface renormalization group exponents, y{sub h}=0.72558(18) for the ordinary universality class and y{sub h}=1.646(2) for the special universality class, which compare well with the most recent Monte Carlo calculations. Estimates of other surface exponents as well as OPE coefficients are also obtained.
SPECT using asymmetric pinholes with truncated projections
Energy Technology Data Exchange (ETDEWEB)
Lin Jianyu; Meikle, Steven R, E-mail: jianyu.lin@curtin.edu.au [Ramaciotti Imaging Centre, Brain and Mind Research Institute, University of Sydney (Australia)
2011-07-07
Tomographic systems employing truncated projections have been developed for parallel and fan beam collimation and for cone beam CT but the idea has not been extensively explored in pinhole single photon emission computed tomography (SPECT). In this paper, we explore the sampling requirements and system performance of SPECT systems with asymmetric pinhole collimators and truncated projections. We demonstrate that complete 3D sampling can be achieved by using multiple detectors with truncated asymmetric pinholes, offset axially from each other, and a spiral orbit. The use of truncated projections can be exploited in the design of pinhole SPECT systems by moving the pinholes closer to the subject, resulting in increased sensitivity and improved spatial resolution. Truncated and untruncated pinhole systems were evaluated using the contrast-to-noise ratio (CNR) calculated from the linearized local impulse response as a figure of merit. The CNR for the truncated pinhole system was up to 60% greater than that for the untruncated system at matched resolution for a source voxel near the centre of a uniform phantom and 30% greater at the edge. We conclude that an object can be reconstructed from asymmetric pinholes with truncated projections, which leads to potentially important design considerations and applications in single- and multi-pinhole SPECT.
Chen, Yang; Budde, Adam; Li, Ke; Li, Yinsheng; Hsieh, Jiang; Chen, Guang-Hong
2017-01-01
When the scan field of view (SFOV) of a CT system is not large enough to enclose the entire cross-section of the patient, or the patient needs to be positioned partially outside the SFOV for certain clinical applications, truncation artifacts often appear in the reconstructed CT images. Many truncation artifact correction methods perform extrapolations of the truncated projection data based on certain a priori assumptions. The purpose of this work was to develop a novel CT truncation artifact reduction method that directly operates on DICOM images. The blooming of pixel values associated with truncation was modeled using exponential decay functions, and based on this model, a discriminative dictionary was constructed to represent truncation artifacts and nonartifact image information in a mutually exclusive way. The discriminative dictionary consists of a truncation artifact subdictionary and a nonartifact subdictionary. The truncation artifact subdictionary contains 1000 atoms with different decay parameters, while the nonartifact subdictionary contains 1000 independent realizations of Gaussian white noise that are exclusive with the artifact features. By sparsely representing an artifact-contaminated CT image with this discriminative dictionary, the image was separated into a truncation artifact-dominated image and a complementary image with reduced truncation artifacts. The artifact-dominated image was then subtracted from the original image with an appropriate weighting coefficient to generate the final image with reduced artifacts. This proposed method was validated via physical phantom studies and retrospective human subject studies. Quantitative image evaluation metrics including the relative root-mean-square error (rRMSE) and the universal image quality index (UQI) were used to quantify the performance of the algorithm. For both phantom and human subject studies, truncation artifacts at the peripheral region of the SFOV were effectively reduced, revealing
Nonsupersymmetric magic theories and Ehlers truncations
Marrani, Alessio; Pradisi, Gianfranco; Riccioni, Fabio; Romano, Luca
2017-07-01
We consider the nonsupersymmetric “magic” theories based on the split quaternion and the split complex division algebras. We show that these theories arise as “Ehlers” SL(2, ℝ) and SL(3, ℝ) truncations of the maximal supergravity theory, exploiting techniques related to the very-extended Kac-Moody algebras. We also generalize the procedure to other SL(n, ℝ) truncations, resulting in additional classes of nonsupersymmetric theories, as well as to truncations of nonmaximal theories. Finally, we discuss duality orbits of extremal black hole solutions in some of these nonsupersymmetric theories.
Institute of Scientific and Technical Information of China (English)
朱宏擎; 舒华忠; 周健; 罗立民
2005-01-01
A new method to accelerate the convergent rate of the space-alternating generalized expectation-maximization (SAGE) algorithm is proposed.The new rescaled block-iterative SAGE (RBI-SAGE) algorithm combines the RBI algorithm with the SAGE algorithm for PET image reconstruction.In the new approach,the projection data is partitioned into disjoint blocks;each iteration step involves only one of these blocks.SAGE updates the parameters sequentially in each block.In experiments,the RBI-SAGE algorithm and classical SAGE algorithm are compared in the application on positron emission tomography (PET) image reconstruction.Simulation results show that RBI-SAGE has better performance than SAGE in both convergence and image quality.%提出了一种可调子块迭代(RBI)方法加速空间交替广义期望最大(SAGE)算法的收敛性.新的可调子块迭代的空间交替广义期望最大算法(RBI-SAGE)组合了RBI算法和SAGE算法的优点用于加速正电子发射断层(PET)图像重建.RBI-SAGE将投影数据分成不连续的子块,每一次迭代仅包含一个这样的子块.在每一个子块中用SAGE算法序列更新参数.实验中,运用RBI-SAGE算法与SAGE算法对PET图像进行重建.结果表明,RBI-SAGE收敛性能比SAGE算法优越,且重建图像质量较高.
Institute of Scientific and Technical Information of China (English)
高飞; 周长林; 党力明; 侯雪梅
2013-01-01
In this paper, a kind of algorithm for all-zero block detection based on Radial Basis Function (RBF) Neural Network (NN) was proposed to improve the accuracy of all-zero block detection algorithm. By analyzing the H. 264 encoder features, six effective features were selected, including Sum of Absolute Difference ( SAD), Sum of Absolute Transformed Difference (SATD), block type, Rate Distortion Optimization ( RDO) cost, Quantization Parameter ( QP) and the situation of reference block. Considering the SATD should be used in the Hadamard Transform ( HT), to get the relationship of QP and RBF network width parameter through the least square method, the algorithm used two classifiers to separate all-zero blocks from non-all-zero blocks based on the encoding situation of the reference block. This algorithm could improve coding speed over 50% on average while keeping bit rate and video quality almost unchanged. The experimental results show that the proposed algorithm can improve all-zero block detection accuracy effectively and coding efficiency based on NN.%针对目前全零块检测算法准确率不高的问题,提出了一种基于径向基函数(RBF)神经网络(NN)的全零块检测算法.通过分析H.264的编码特点,选取了绝对误差和(SAD)、变换绝对差值和(SATD)、编码块类型、率失真优化(RDO)代价、量化系数(QP)、参考块的全零块情况6个特征,考虑了哈达玛变换(HT)中应该使用SATD的情况,采用最小二乘法得到QP与RBF网络宽度参数的关系,根据参考块是否为零,设计了两个分类器来区分全零块与非全零块.在保证图像质量和编码率不变的前提下,平均能提高编码速度50％以上,实验结果表明,利用RBF神经网络很好地提高了全零块检测准确率和编码效率.
Quantifying truncation errors in effective field theory
Furnstahl, R J; Phillips, D R; Wesolowski, S
2015-01-01
Bayesian procedures designed to quantify truncation errors in perturbative calculations of quantum chromodynamics observables are adapted to expansions in effective field theory (EFT). In the Bayesian approach, such truncation errors are derived from degree-of-belief (DOB) intervals for EFT predictions. Computation of these intervals requires specification of prior probability distributions ("priors") for the expansion coefficients. By encoding expectations about the naturalness of these coefficients, this framework provides a statistical interpretation of the standard EFT procedure where truncation errors are estimated using the order-by-order convergence of the expansion. It also permits exploration of the ways in which such error bars are, and are not, sensitive to assumptions about EFT-coefficient naturalness. We first demonstrate the calculation of Bayesian probability distributions for the EFT truncation error in some representative examples, and then focus on the application of chiral EFT to neutron-pr...
Truncation Analysis for the Derivative Schrodinger Equation
Institute of Scientific and Technical Information of China (English)
XU Peng Cheng; CHANG Qian Shun; GUO Bo Ling
2002-01-01
The truncation equation for the derivative nonlinear Schrodinger equation has been dis-cussed in this paper. The existence of a special heteroclinic orbit has been found by using geometricalsingular perturbation theory together with Melnikov's technique.
改进块匹配宏块的快速传感器电子稳像方法%Improved Fast Block-matching Algorithm for Sensor Electronic Image Stabilization
Institute of Scientific and Technical Information of China (English)
王鹏; 赵跃进; 孔令琴; 董立泉; 戴璐
2012-01-01
提出了一种改进块匹配宏块分布排列的快速传感器电子稳像算法,通过陀螺传感器测量摄像系统的抖动,利用小范围快速块匹配算法估计局部运动矢量,再运用最小二乘法解算全局运动矢量.小范围快速块匹配算法得到的局部运动矢量准确度高,仅需部分局部运动矢量即可准确解算出全局运动矢量.基于此在保证运动矢量准确度情况下,对块匹配宏块的分布排列进行了改进,从而减少匹配宏块数量加快算法速度.通过对宏块网,格模型的分析,得出对小范围快速块匹配算法进行宏块分布改进的方案,进而设计出快速传感器电子稳像算法.仿真及实验表明:运算时间提高89％左右,且算法准确度略高于改进前算法.%An improved block density fast algorithm for steadying shaking image was presented. The jitter of camera system was measured by gyro, while the local motion vectors was estimated by the small area fast block-matching algorithm, and the global motion vector was calculated by least square method. Small area fast block-matching algorithm, which has high calculating precision, is good at calculating the local motion vectors. So the least square method can exactly calculate global motion vector by using parts of the local motion vectors. For this reason, the black density can be improved to speed up the algorithm and retain the precision of the global motion vector at the same time. The small area fast block-matching algorithm was optimized by analyzing the block gridding, and then the fast sensor electronic stabilization algorithm was designed. The simulation and experiment show that the algorithm is slightly more accurate and about 89% faster than the small afea fast algorithm.
Truncated Moment Analysis of Nucleon Structure Functions
Energy Technology Data Exchange (ETDEWEB)
A. Psaker; W. Melnitchouk; M. E. Christy; C. E. Keppel
2007-11-16
We employ a novel new approach using "truncated" moments, or integrals of structure functions over restricted regions of x, to study local quark-hadron duality, and the degree to which individual resonance regions are dominated by leading twists. Because truncated moments obey the same Q^2 evolution equations as the leading twist parton distributions, this approach makes possible for the first time a description of resonance region data and the phenomenon of quark-hadron duality directly from QCD.
Paleogene continental margin truncation in southwestern Mexico: Geochronological evidence
Schaaf, Peter; MoráN-Zenteno, Dante; HernáNdez-Bernal, Maria Del Sol; SolíS-Pichardo, Gabriela; Tolson, Gustavo; KöHler, Hermann
1995-12-01
The reasons for, and mechanisms of, continental margin truncation in SW Mexico where Mesozoic-Cenozoic plutons are situated directly on the Pacific coast, are not yet well understood. Large-scale dextral and/or sinistral displacements of the continental margin terranes, now forming parts of Baja California or the Chortis block, have been proposed. The well-defined along-coast NW-SE decreasing granitoid intrusion age trend (˜1.2 cm/yr in the 100 Ma-40 Ma time interval) between Puerto Vallarta and Zihuatanejo is interpreted by us to be a geometric artifact of oblique continental margin truncation rather than the consequence of a sinistral offset of the Chortis block from those latitudes toward the SE. Changes in the dip and velocity of the NNW-SSE trending Cretaceous-Tertiary subduction zone resulted in a landward migration of the magmatic arc. Taking into account certain stratigraphic affinities of Chortis and the Oaxaca and Mixteca terranes, together with the known displacement rates along the North America-Caribbean Plate boundary, the northwesternmost paleoposition of the Chortis block with respect to SW Mexico was near Zihuatanejo. In contrast, between Zihuatanejo and the Isthmus of Tehuantepec, the cessation of the Tertiary magmatism decreased more rapidly (˜7.7 cm/yr), although the trend is not so obvious. Starting in the late Eocene, Chortis moved about 1100 km to the SE along a transform boundary associated with the opening of the Cayman Trough. Based on our geochronological data and structural relationships between mylonite zones and plutons in the Acapulco-Tehuantepec area, we propose an approximately 650 km SE movement of Chortis from about 40-25 Ma, with a velocity of 6.5-4.3 cm/yr. Since this is considerably slower than the decreasing age trend obtained by us using the geochronological data, we consider batholith formation in this segment to predate and postdate the offshore passage of the North America-Farallon-Caribbean triple junction. Geological
DEFF Research Database (Denmark)
Cano-Fácila, Francisco José; Pivnenko, Sergey; Sierra-Castaner, Manuel
2012-01-01
A method to reduce truncation errors in near-field antenna measurements is presented. The method is based on the Gerchberg-Papoulis iterative algorithm used to extrapolate band-limited functions and it is able to extend the valid region of the calculatedfar-field pattern up to the whole forward...
A new method to reduce truncation errors in partial spherical near-field measurements
DEFF Research Database (Denmark)
Cano-Facila, F J; Pivnenko, Sergey
2011-01-01
angular sector as well as a truncation error is present in the calculated far-field pattern within this sector. The method is based on the Gerchberg-Papoulis algorithm used to extrapolate functions and it is able to extend the valid region of the calculated far-field pattern up to the whole forward...
Reduction of truncation errors in partial spherical near-field antenna measurements
DEFF Research Database (Denmark)
Pivnenko, Sergey; Cano Facila, Francisco J.
2010-01-01
In this report, a new and effective method for reduction of truncation errors in partial spherical near-field (SNF) antenna measurements is proposed. This method is based on the Gerchberg-Papoulis algorithm used to extrapolate functions and it is able to extend the valid region of the far...
A new method to reduce truncation errors in partial spherical near-field measurements
DEFF Research Database (Denmark)
Cano-Facila, F J; Pivnenko, Sergey
2011-01-01
angular sector as well as a truncation error is present in the calculated far-field pattern within this sector. The method is based on the Gerchberg-Papoulis algorithm used to extrapolate functions and it is able to extend the valid region of the calculated far-field pattern up to the whole forward...
An improved image compression algorithm using binary space partition scheme and geometric wavelets.
Chopra, Garima; Pal, A K
2011-01-01
Geometric wavelet is a recent development in the field of multivariate nonlinear piecewise polynomials approximation. The present study improves the geometric wavelet (GW) image coding method by using the slope intercept representation of the straight line in the binary space partition scheme. The performance of the proposed algorithm is compared with the wavelet transform-based compression methods such as the embedded zerotree wavelet (EZW), the set partitioning in hierarchical trees (SPIHT) and the embedded block coding with optimized truncation (EBCOT), and other recently developed "sparse geometric representation" based compression algorithms. The proposed image compression algorithm outperforms the EZW, the Bandelets and the GW algorithm. The presented algorithm reports a gain of 0.22 dB over the GW method at the compression ratio of 64 for the Cameraman test image.
EFFECT OF DATA TRUNCATION IN AN IMPLEMENTATION OF PIXEL CLUSTERING ON A CUSTOM COMPUTING MACHINE
Energy Technology Data Exchange (ETDEWEB)
M. LEESER; J. THEILER; ET AL
2000-08-01
We investigate the effect of truncating the precision of hyperspectral image data for the purpose of more efficiently segmenting the image using a variant of k-means clustering. We describe the implementation of the algorithm on field-programmable gate array (FPGA) hardware. Truncating the data to only a few bits per pixel in each spectral channel permits a more compact hardware design, enabling greater parallelism, and ultimately a more rapid execution. It also enables the storage of larger images in the onboard memory. In exchange for faster clustering, however, one trades off the quality of the produced segmentation. We find, however, that the clustering algorithm can tolerate considerable data truncation with little degradation in cluster quality. This robustness to truncated data can be extended by computing the cluster centers to a few more bits of precision than the data. Since there are so many more pixels than centers, the more aggressive data truncation leads to significant gains in the number of pixels that can be stored in memory and processed in hardware concurrently.
Turner, W.
2007-01-01
Consider representation theory associated to symmetric groups, or to Hecke algebras in type A, or to q-Schur algebras, or to finite general linear groups in non-describing characteristic. Rock blocks are certain combinatorially defined blocks appearing in such a representation theory, first observed by R. Rouquier. Rock blocks are much more symmetric than general blocks, and every block is derived equivalent to a Rock block. Motivated by a theorem of J. Chuang and R. Kessar in the case of sym...
Institute of Scientific and Technical Information of China (English)
辛宇; 杨静; 谢志强
2015-01-01
语义社会网络(Semantic social network, SSN)是一种包含信息节点及社会关系构成的新型复杂网络。传统语义社会网络分析算法在进行社区挖掘时,需要预先设定社区个数且无法发现重叠社区。针对这一问题,提出一种面向语义重叠社区发现的block 场采样算法,该算法首先以LDA (Latent dirichlet allocation)模型为语义分析模型,建立了以取样节点为核心节点的block场BAT (Block-author-topic)模型；其次,根据节点的语义分析结果,建立可度量block区域的语义凝聚力方法,实现了语义信息的可度量化；最后,以节点的语义凝聚力为输入,改进了重叠社区发现的标签传播算法(Label propagation algorithm, LPA)及可评价语义社区的S Q度量模型,并通过实验分析,验证了本文算法及S Q度量模型的有效性及可行性。%The semantic social network (SSN) is a new kind of complex networks consisting of the node content and topological relationship. The traditional community detection algorithms need to preset the number of the communities and could not detect the overlapping communities. To solve this problem, an overlapping community structure detecting algorithm in semantic social network based on the block field is proposed. Firstly, it takes the latent dirichlet allocation (LDA) model as the semantic analyzing model, establishing the block-author-topic (BAT) model with the sampling node as the core node. Secondly, it suggests the measurement of the semantic cohesion of the block field, depending on the analysis of SSN, to achieve the evaluation of semantic information. Finally, it improves the label propagation algorithm (LPA) which could detect the overlapping communities, with the semantic cohesion as input, and designs the S Q measurement modularity for semantic measuring. The effciency and feasibility of the algorithm and the semantic modularity are verified via experimental analysis.
Hochschild cohomology of truncated quiver algebras
Institute of Scientific and Technical Information of China (English)
2007-01-01
For a truncated quiver algebra over a field of an arbitrary characteristic, its Hochschild cohomology is calculated. Moreover, it is shown that its Hochschild cohomology algebra is finitedimensional if and only if its global dimension is finite if and only if its quiver has no oriented cycles.
Family Therapy for the "Truncated" Nuclear Family.
Zuk, Gerald H.
1980-01-01
The truncated nuclear family consists of a two-generation group in which conflict has produced a polarization of values. The single-parent family is at special risk. Go-between process enables the therapist to depolarize sharply conflicted values and reduce pathogenic relating. (Author)
Balanced truncation for linear switched systems
DEFF Research Database (Denmark)
Petreczky, Mihaly; Wisniewski, Rafal; Leth, John-Josef
2013-01-01
in this paper, we provide a bound on the approximation error in the L2L2 norm for continuous-time and the l2l2 norm for discrete-time linear switched systems. We provide a system theoretic interpretation of grammians and their singular values. Furthermore, we show that the performance of balanced truncation...
Consistent truncations with massive modes and holography
Cassani, Davide; Faedo, Anton F
2011-01-01
We review the basic features of some recently found consistent Kaluza-Klein truncations including massive modes. We emphasize the general ideas underlying the reduction procedure, then we focus on type IIB supergravity on 5-dimensional manifolds admitting a Sasaki-Einstein structure, which leads to half-maximal gauged supergravity in five dimensions. Finally, we comment on the holographic picture of consistency.
Vortex breakdown in a truncated conical bioreactor
DEFF Research Database (Denmark)
Balci, Adnan; Brøns, Morten; Herrada, Miguel A.
2015-01-01
This numerical study explains the eddy formation and disappearance in a slow steady axisymmetric air–water flow in a vertical truncated conical container, driven by the rotating top disk. Numerous topological metamorphoses occur as the water height, Hw, and the bottom-sidewall angle, α, vary. It ...... are of fundamental interest and can be relevant for aerial bioreactors....
Balanced truncation for linear switched systems
DEFF Research Database (Denmark)
Petreczky, Mihaly; Wisniewski, Rafal; Leth, John-Josef
2013-01-01
in this paper, we provide a bound on the approximation error in the L2L2 norm for continuous-time and the l2l2 norm for discrete-time linear switched systems. We provide a system theoretic interpretation of grammians and their singular values. Furthermore, we show that the performance of balanced truncation...
Vortex breakdown in a truncated conical bioreactor
DEFF Research Database (Denmark)
Balci, Adnan; Brøns, Morten; Herrada, Miguel A.;
2015-01-01
This numerical study explains the eddy formation and disappearance in a slow steady axisymmetric air–water flow in a vertical truncated conical container, driven by the rotating top disk. Numerous topological metamorphoses occur as the water height, Hw, and the bottom-sidewall angle, α, vary. It ...... are of fundamental interest and can be relevant for aerial bioreactors....
Volume of a doubly truncated hyperbolic tetrahedron
Kolpakov, Alexander
2012-01-01
The present paper regards the volume function of a doubly truncated hyperbolic tetrahedron. Starting from the previous results of J. Murakami, U. Yano and A. Ushijima, we have developed a unified approach to expressing the volume in different geometric cases by dilogarithm functions and to treat properly the many analytic strata of the latter. Finally, several numeric examples are given.
Irregularly Shaped Space-Filling Truncated Octahedra
Hanson, John Robert
2008-01-01
For any parent tetrahedron ABCD, centroids of selected sub-tetrahedra form the vertices of an irregularly shaped space-filling truncated octahedron. To reflect these properties, such a figure will be called an ISTO. Each edge of the ISTO is parallel to and one-eighth the length of one of the edges of tetrahedron ABCD and the volume of the ISTO is…
Projection-free approximate balanced truncation of large unstable systems
Flinois, Thibault L. B.; Morgans, Aimee S.; Schmid, Peter J.
2015-08-01
In this article, we show that the projection-free, snapshot-based, balanced truncation method can be applied directly to unstable systems. We prove that even for unstable systems, the unmodified balanced proper orthogonal decomposition algorithm theoretically yields a converged transformation that balances the Gramians (including the unstable subspace). We then apply the method to a spatially developing unstable system and show that it results in reduced-order models of similar quality to the ones obtained with existing methods. Due to the unbounded growth of unstable modes, a practical restriction on the final impulse response simulation time appears, which can be adjusted depending on the desired order of the reduced-order model. Recommendations are given to further reduce the cost of the method if the system is large and to improve the performance of the method if it does not yield acceptable results in its unmodified form. Finally, the method is applied to the linearized flow around a cylinder at Re = 100 to show that it actually is able to accurately reproduce impulse responses for more realistic unstable large-scale systems in practice. The well-established approximate balanced truncation numerical framework therefore can be safely applied to unstable systems without any modifications. Additionally, balanced reduced-order models can readily be obtained even for large systems, where the computational cost of existing methods is prohibitive.
Institute of Scientific and Technical Information of China (English)
李玉; 赵瑞珍; 张凤珍; 岑翼刚
2015-01-01
由于多尺度小波变换的分块压缩感知算法（MS-BCS-SPL）将每层子带信息进行分块时，使得每层子带中各子块间的采样率相同；但是，当不同的图像子块含有不同的边缘信息时，对这些子块采用相同的采样率会造成资源分配不合理。因此在 MS-BCS-SPL 算法的基础上，利用图像块边缘信息的不同和图像块的方向性，将总的采样率自适应分配给各层子带中的各子块，实现多尺度分块压缩感知的自适应采样。实验结果表明，在不同采样率，尤其较低采样率时，该算法不仅比 MS-BCS-SPL 算法采用了较少的采样数目，节约资源；而且比其可重构较高质量的图像。%Same sampling rate of each sub-block in each sub-band is galned when the multi-scale block compressed sens-ing algorithm (MS-BCS-SPL)subdivides sub-band information of each layer into blocks.But unreasonable resource distri-bution would be caused if image sub-blocks have different edge information.In this thesis,on basis of MS-BCS-SPL,multi-scale block compressed sensing adaptive sampling is realized by distributing total sampling rate into all sub-block of each sub-band,which uses the difference of edge information and directivity of image blocks.First the edge information of image blocks is calculated and the direction is estimated,through which the total sampling rate is assigned adaptively into each block of each sub-band by the characteristics of the wavelet transform,realizing adaptive multi-scale block compressed sensing.It is shown by experiments that compared with algorithm of MS-BCS-SPL,by using adaptive multi-scale block compressed sensing algorithm,with different sampling rate especially lower sampling rate,not only less samples is used and resources are saved,also high quality images are reconstructed and reasonable resources distribution is achieved.
Institute of Scientific and Technical Information of China (English)
WANG ShunJin; ZHANG Hua
2007-01-01
Based on the exact analytical solution of ordinary differential equations,a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm.A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models.The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision,and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.
Institute of Scientific and Technical Information of China (English)
2007-01-01
Based on the exact analytical solution of ordinary differential equations, a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm. A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models. The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision, and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.
Directory of Open Access Journals (Sweden)
Filippo Palombi
2017-01-01
Full Text Available We relate the matrix SB of the second moments of a spherically truncated normal multivariate to its full covariance matrix Σ and present an algorithm to invert the relation and reconstruct Σ from SB. While the eigenvectors of Σ are left invariant by the truncation, its eigenvalues are nonuniformly damped. We show that the eigenvalues of Σ can be reconstructed from their truncated counterparts via a fixed point iteration, whose convergence we prove analytically. The procedure requires the computation of multidimensional Gaussian integrals over an Euclidean ball, for which we extend a numerical technique, originally proposed by Ruben in 1962, based on a series expansion in chi-square distributions. In order to study the feasibility of our approach, we examine the convergence rate of some iterative schemes on suitably chosen ensembles of Wishart matrices. We finally discuss the practical difficulties arising in sample space and outline a regularization of the problem based on perturbation theory.
Block stockyard scheduling and optimizing based on an intelligent algorithm%基于智能算法的船舶分段堆场调度计划与优化
Institute of Scientific and Technical Information of China (English)
曾建智; 张志英
2016-01-01
Block stockyard is a major operation procedure in dispatching a ship block in a storage yard. The pros and cons of moving path determined the efficiency and the cost of the stockyard scheduling operation. This paper presented a synthetical evaluation criterion that considering obstructive blocks, flat transporter turning times and moving distance which influenced the scheduling cost. A mathematical model was established based on this criterion with the aim of minimizing the synthetical degree of moving the block. A genetic algorithm was formulated to select the optimal storage positions for the inbound blocks. Tabu search was used to optimize the entrance order of the blocks with flexible entering times. A heuristic rule was constructed to confirm the optimum entering and leaving routes of the blocks. Finally, real data from a shipyard were used to test the numerical analysis used in the models. The results showed that the proposed algorithm was effective to solve the scheduling problem in shipbuilding yards.%分段的移动是船舶分段堆场调度中最主要的作业过程，而移动路径的优劣决定着分段堆场调度的效率和成本。论文通过综合考虑临时阻挡分段数量、平板车转向次数和移动距离对调度成本的影响，提出分段综合移动难度的评价标准，以此建立数学模型，并以分段综合移动难度为优化目标，利用遗传算法选择分段在堆场中停放位置的较优方案，运用禁忌搜索优化柔性出场时间分段的出场顺序，构建启发式规则来确定分段最优的进、出场路径。最后，利用某船厂的实际数据对模型进行实例验证和数值分析，结果表明，本文方法可以得到较优的堆场作业计划，实现堆场资源的高效利用。
Institute of Scientific and Technical Information of China (English)
南哲万; 阮秋琦; 安高云
2013-01-01
H. 264 video, when being transmitted over error-prone wireless channels, may suffer from losses or errors. The lost data may result in unacceptable quality degradation. In this paper, we proposed a low complexity and effective motion recovery algorithm for temporal error concealment in H. 264, which was based on block motion trajectory similarity and statistical correlation of spatial domain. The block motion trajectory similarity was estimated by using the Sum of Absolute Difference for Motion Vector (SAD-MV), and then accordingly the available blocks for Lost Block (LB) were searched for in the lost Macro-block (MB) neighbors. The MVs of LBs in the current frame were predicted on the basis of the statisticat spatial correlation between the available blocks and LBs extracted from previous frames. The MVs of the MB blockettes were merged and recovered from the MVs of blocks subject to MB segmenting information. The lost pixels were recovered with the neighbourhood interpolation method. Experiments prove that the proposed method is characterized by quick execution velocity and good hidden eqqed as compared with the zero MV method, MB boundary match algorithm and polynomial interpolation method.%H.264视频在通过无线网络传递时,对传输错误非常敏感,由此会引起视频质量的严重下降.本文提出1种基于块运动轨迹相似性及空域统计相关性的受损块运动修复-错误隐藏算法.采用绝对运动差值总和(Sum of Absolute Difference for Motion Vector)估计运动轨迹相似性,并据此在受损宏块周围搜索可靠块；在过去帧中抽取可靠块和受损块的空域相互关系统计特征,并据此在当前帧预测受损块运动矢量；采用基于宏块分割信息的块合并来修复宏块内子块运动矢量,采用邻域插值方法恢复丢失的像素.实验结果表明,与零运动算法、宏块边界匹配算法和多项式内插法相比较,本算法执行速度较快,隐藏效果较好.
Institute of Scientific and Technical Information of China (English)
李淑芝; 晏啟明
2015-01-01
为了提高视频水印的鲁棒性和隐蔽性，提出一种将水印与视频内容特征相结合的零水印方案。通过帧间欧氏距离选取关键帧，利用改进帧差法提取视频关键帧中运动目标，对关键帧的运动目标进行子块分割，选择运动目标几何形心所在块构成三维体块；再将三维体块分割成多个大小相等的小三维体块，利用小三维体块中所有子块的离散余弦变换直流系数构造特征向量；最后利用特征向量实现将水印零嵌入到视频内容中。实验表明，该算法未破坏原视频内容，不仅具有很好的隐蔽性，还能有效地抵抗旋转、压缩编码等攻击。%In order to improve the robustness and invisibility of video watermarking,we propose a zero-watermarking scheme which com-bines the watermarking with video content characteristics.It selects the key frames through interframe Euclid distance,uses improved frame difference algorithm to extract the moving objects in key frame,and segments the moving objects of key frame into sub-blocks.After selecting the blocks at the geometric centroid of moving object to reconstruct three-dimension block,the scheme then segments the three-dimension block to a couple of small three-dimension blocks in same size,and constructs the feature vector using DC coefficients of discrete cosine trans-form of all blocks in small three-dimension block.Finally,it uses feature vector to realise embedding the zero-watermarking into video con-tents.Experiments show that the algorithm does not damage original video content,apart from having very good imperceptibility,it can also effectively resist the attacks of rotation and compression coding,etc.
Phase diagram of a truncated tetrahedral model
Krcmar, Roman; Gendiar, Andrej; Nishino, Tomotoshi
2016-08-01
Phase diagram of a discrete counterpart of the classical Heisenberg model, the truncated tetrahedral model, is analyzed on the square lattice, when the interaction is ferromagnetic. Each spin is represented by a unit vector that can point to one of the 12 vertices of the truncated tetrahedron, which is a continuous interpolation between the tetrahedron and the octahedron. Phase diagram of the model is determined by means of the statistical analog of the entanglement entropy, which is numerically calculated by the corner transfer matrix renormalization group method. The obtained phase diagram consists of four different phases, which are separated by five transition lines. In the parameter region, where the octahedral anisotropy is dominant, a weak first-order phase transition is observed.
Truncated Levy distributions in an inelastic gas
Energy Technology Data Exchange (ETDEWEB)
Lambiotte, R. [Physique Statistique, Plasmas et Optique Non-lineaire, Universite Libre de Bruxelles, Campus Plaine, Boulevard du Triomphe, Code Postal 231, 1050 Brussels (Belgium) and SUPRATECS, Sart-Tilman, Universite de Liege, B5, B-4000 Liege (Belgium)]. E-mail: renaud.lambiotte@ulg.ac.be; Brenig, L. [Physique Statistique, Plasmas et Optique Non-lineaire, Universite Libre de Bruxelles, Campus Plaine, Boulevard du Triomphe, Code Postal 231, 1050 Brussels (Belgium)]. E-mail: lbrenig@ulb.ac.be
2005-10-03
We study a one-dimensional model for granular gases, the so-called inelastic Maxwell model. We show theoretically the existence of stationary solutions of the unforced case, that are characterized by an infinite average energy per particle. Moreover, we verify the quasi-stationarity of these states by performing numerical simulations with a finite number of particles, thereby highlighting truncated Levy distributions for the velocities.
Truncated Dual-Cap Nucleation Site Development
Matson, Douglas M.; Sander, Paul J.
2012-01-01
During heterogeneous nucleation within a metastable mushy-zone, several geometries for nucleation site development must be considered. Traditional spherical dual cap and crevice models are compared to a truncated dual cap to determine the activation energy and critical cluster growth kinetics in ternary Fe-Cr-Ni steel alloys. Results of activation energy results indicate that nucleation is more probable at grain boundaries within the solid than at the solid-liquid interface.
Clustered survival data with left-truncation
DEFF Research Database (Denmark)
Eriksson, Frank; Martinussen, Torben; Scheike, Thomas H.
2015-01-01
Left-truncation occurs frequently in survival studies, and it is well known how to deal with this for univariate survival times. However, there are few results on how to estimate dependence parameters and regression effects in semiparametric models for clustered survival data with delayed entry...... are investigated via simulation studies, and the suggested estimators are used in a study of prostate cancer based on the Finnish twin cohort where a twin pair is included only if both twins were alive in 1974....
Accurate basis set truncation for wavefunction embedding
Barnes, Taylor A.; Goodpaster, Jason D.; Manby, Frederick R.; Miller, Thomas F.
2013-07-01
Density functional theory (DFT) provides a formally exact framework for performing embedded subsystem electronic structure calculations, including DFT-in-DFT and wavefunction theory-in-DFT descriptions. In the interest of efficiency, it is desirable to truncate the atomic orbital basis set in which the subsystem calculation is performed, thus avoiding high-order scaling with respect to the size of the MO virtual space. In this study, we extend a recently introduced projection-based embedding method [F. R. Manby, M. Stella, J. D. Goodpaster, and T. F. Miller III, J. Chem. Theory Comput. 8, 2564 (2012)], 10.1021/ct300544e to allow for the systematic and accurate truncation of the embedded subsystem basis set. The approach is applied to both covalently and non-covalently bound test cases, including water clusters and polypeptide chains, and it is demonstrated that errors associated with basis set truncation are controllable to well within chemical accuracy. Furthermore, we show that this approach allows for switching between accurate projection-based embedding and DFT embedding with approximate kinetic energy (KE) functionals; in this sense, the approach provides a means of systematically improving upon the use of approximate KE functionals in DFT embedding.
Institute of Scientific and Technical Information of China (English)
赵志强; 陈盈
2011-01-01
针对视频图像序列的不稳定性,结合灰度投影算法与块匹配法各自的特点,提出了一种可以快速消除图像序列间平移和旋转抖动的新型电子稳像算法.该算法首先采用灰度投影法估计与补偿图像序列间的平移运动,然后用拉普拉斯算子在图像边缘处选取灰度信息比较丰富的小块模板,利用块匹配法计算模板的平移运动,再结合模板在图像上的位置估计图像的旋转运动,最后通过运动补偿得到稳定的视频图像序列.实验结果表明,该算法可以明显地减轻图像序列间的抖动现象,对于提高动态图像的稳定性具有很好的效果.%In allusion to the instability of video sequences, a new electronic image stabilization algorithm, based on different features of gray projection algorithm and block matching algorithm, is proposed to fast eliminate the shift,dithering and rotation of video sequences. This algorithm first adopts gray projection algorithm to reckon and compensate the translational motion between video sequences, and then adopts Laplace operator to select small templates with abundant gray-scale information near the edge of the image. Next, it uses block matching algorithm to calculate the translational motion of templates. Moreover, it reckons the image rotation according to where the templates locate on the image. In the end, it uses motion compensation to attain stable video sequences. Experimental results show that, the algorithm can obviously eliminate the dithering between video sequences, which will have a salutary effect on improving the stability of dynamic image.
Shared Frailty Model for Left-Truncated Multivariate Survival Data
DEFF Research Database (Denmark)
Jensen, Henrik; Brookmeyer, Ron; Aaby, Peter;
multivariate survival data, left truncation, multiplicative hazard model, shared gamma frailty, conditional model, piecewise exponential model, childhood survival......multivariate survival data, left truncation, multiplicative hazard model, shared gamma frailty, conditional model, piecewise exponential model, childhood survival...
Investigation on optimization design of equivalent water depth truncated mooring system
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
The oil industry is now increasingly concentrating their efforts and activities in connection with de- veloping fields in deeper waters, ranging typically from 500 m to 3000 m worldwide. However, the modeling of a full-depth system has become difficult presently; no tank facility is sufficiently large to perform the testing of a complete FPS with compliant mooring in 1000 m to 3000 m depth, within rea- sonable limits of model scale. Until recently, the most feasible procedure to meet this challenge seems to be the so-called "hybrid model testing technique". To implement this technique, the first and im- portant step is to design the equivalent water depth truncated mooring system. In this work, the opti- mization design of the equivalent water depth truncated mooring system in hybrid model testing for deep sea platforms is investigated. During the research, the similarity of static characteristics between the truncated and full depth system is mainly considered. The optimization mathematical model for the equivalent water depth truncated system design is set up by using the similarity in numerical value of the static characteristics between the truncated system and the full depth one as the objective function. The dynamic characteristic difference between the truncated and full depth mooring system can be minished by selecting proper design rule. To calculate the static characteristics of the mooring system, the fourth order Runge-Kutta method is used to solve the static equilibrium equation of the single mooring line. After the static characteristic of the single mooring line is calculated, the static charac- teristic of the whole mooring system is calculated with Lagrange numerical interpolation method. The mooring line material database is established and the standard material name and the diameter of the mooring line are selected as the primary key. The improved simulated annealing algorithm for continual & discrete variables and the improved complex algorithm
Investigation on optimization design of equivalent water depth truncated mooring system
Institute of Scientific and Technical Information of China (English)
ZHANG HuoMing; SUN ZhiLin; YANG JianMin; GAO MingZheng
2009-01-01
The oil industry is now increasingly concentrating their efforts and activities in connection with de-veloping fields in deeper waters, ranging typically from 500 m to 3000 m worldwide. However, the modeling of a full-depth system has become difficult presently; no tank facility is sufficiently large to perform the testing of a complete FPS with compliant mooring in 1000 m to 3000 m depth, within rea-sonable limits of model scale. Until recently, the most feasible procedure to meet this challenge seems to be the so-called "hybrid model testing technique". To implement this technique, the first and im-portant step is to design the equivalent water depth truncated mooring system. In this work, the opti-mization design of the equivalent water depth truncated mooring system in hybrid model testing for deep sea platforms is investigated. During the research, the similarity of static characteristics between the truncated and full depth system is mainly considered. The optimization mathematical model for the equivalent water depth truncated system design is set up by using the similarity in numerical value of the static characteristics between the truncated system and the full depth one as the objective function. The dynamic characteristic difference between the truncated and full depth mooring system can be minished by selecting proper design rule. To calculate the static characteristics of the mooring system, the fourth order Runge-Kutta method is used to solve the static equilibrium equation of the single mooring line. After the static characteristic of the single mooring line is calculated, the static charac-teristic of the whole mooring system is calculated with Lagrange numerical interpolation method. The mooring line material database is established and the standard material name and the diameter of the mooring line are selected as the primary key. The improved simulated annealing algorithm for continual & discrete variables and the improved complex algorithm for
Institute of Scientific and Technical Information of China (English)
方青; 张弓; 贲德
2015-01-01
As a widely applied model for compressive sensing, the multitask compressive sensing can improve the performance of the inversion by appropriately exploiting the interrelationships of the tasks. The existing multitask compressive sensing recovery algorithms only utilize the statistical characteristics of a sparse signal, the structural characteristics of the sparse signal have not been taken into consideration. A multitask compressive sensing recovery algorithm is proposed in this paper based on the block sparse Bayesian learning. The block sparse single measurement vector model is applied to the multi-task problem. Both statistical and block structural characteristics of the sparse signal are used to build a mathematical model, and the sparse inverse problem is linked to the parameter iteration problems in the Bayesian framework. The proposed algorithm does not require the sparseness information and noise beforehand, which turns out to be an effective blind recovery algorithm. Extensive numerical experiments show that the proposed algorithm can exploit both statistical and structural characteristics of the signal, therefore it may reach a good trade-off between the recovery accuracy and the convergence rate.%本文提出一种基于块稀疏贝叶斯学习的多任务压缩感知重构算法，利用块稀疏的单测量矢量模型求解多任务重构问题。通过对信号统的计特性和稀疏块内的结构特性进行联合数学建模，将稀疏重构问题转贝叶斯框架下的特征参数的迭代更新问题。本文算法不需要信号稀疏度和噪声强度的先验信息，是一种高效的盲重构算法。仿真实验表明，本文算法能有效利用信号的统计特性和结构信息，在重构精度和收敛速率方面能够很好地折衷。
基于改进 GA 的分段堆场计划调度方法研究%Block stockyard scheduling approach based on an improved genetic algorithm
Institute of Scientific and Technical Information of China (English)
张志英; 计峰; 曾建智
2015-01-01
针对船舶分段堆场在调度过程中周转效率低、调度滞后以及调度成本高等问题,以进出场分段在堆场中的调度为研究对象,考虑船舶分段堆场调度过程中的扰动因素,采用基于事件触发式的重调度方法,结合分段质量和移动距离建立数学模型,以移动分段所需的成本为优化目标,提出利用改进遗传算法来选择分段在堆场中停放位置的较优方案,并构建启发式规则来确定分段最优进、出场路径. 利用某船厂实际数据对模型进行验证,表明该方法可得到较优的堆场作业计划,实现堆场资源的高效利用.%This paper presented a mathematical model defined as the assignment of the inbound and outbound blocks in the stockyard with the purpose of minimizing the moving cost based on the block scheduling problems such as low turnover, lagged scheduling, high cost, etc.An event-triggered rescheduling method was formulated to solve dis-turbance factors appeared in the process of block stockyard scheduling.Taking the blocks'mass and moving dis-tance into consideration, an improved genetic algorithm is put forward to select the optimal parking locations for the inbound blocks.A heuristic rule is embedded in the algorithm to select the optimal inbound and outbound paths for the blocks.Application data are obtained from a shipyard to validate the model, and the result showed that using the proposed method, an optimal schedule of stockyard can be obtained, and the resources of stockyard can be uti-lized with high efficiency.
ABCLS method for high-reliability aerospace mechanism with truncated random uncertainties
Directory of Open Access Journals (Sweden)
Peng Wensheng
2015-08-01
Full Text Available The random variables are always truncated in aerospace engineering and the truncated distribution is more feasible and effective for the random variables due to the limited samples available. For high-reliability aerospace mechanism with truncated random variables, a method based on artificial bee colony (ABC algorithm and line sampling (LS is proposed. The artificial bee colony-based line sampling (ABCLS method presents a multi-constrained optimization model to solve the potential non-convergence problem when calculating design point (is also as most probable point, MPP of performance function with truncated variables; by implementing ABC algorithm to search for MPP in the standard normal space, the optimization efficiency and global searching ability are increased with this method dramatically. When calculating the reliability of aerospace mechanism with too small failure probability, the Monte Carlo simulation method needs too large sample size. The ABCLS method could overcome this drawback. For reliability problems with implicit functions, this paper combines the ABCLS with Kriging response surface method, therefore could alleviate computational burden of calculating the reliability of complex aerospace mechanism. A numerical example and an engineering example are carried out to verify this method and prove the applicability.
Smith, Martin H.
1992-01-01
Describes an educational game called "Population Blocks" that is designed to illustrate the concept of exponential growth of the human population and some potential effects of overpopulation. The game material consists of wooden blocks; 18 blocks are painted green (representing land), 7 are painted blue (representing water); and the remaining…
Smith, Martin H.
1992-01-01
Describes an educational game called "Population Blocks" that is designed to illustrate the concept of exponential growth of the human population and some potential effects of overpopulation. The game material consists of wooden blocks; 18 blocks are painted green (representing land), 7 are painted blue (representing water); and the remaining…
Elucidating the Role of Truncated ErB2 Receptor (p95) in Breast Cancer
2011-03-01
to reduce the expression of cell membrane bound p95;5 (ii) a gamma secretase inhibitor that blocked ErbB4 truncation;6 (iii) a calpain I inhibitor...inhibitor of the 20S subunit of the proteasome blocked p95L induction in lapatinib-treated ErbB2+ breast cancer cells. Similarly, MG132 and the calpain ...No independent authentication of these cells was done by the authors. Anti-phosphotyrosine (p-tyr) antibody, GW2974, and calpain inhibitor 1 were
Model Reduction for Nonlinear Systems by Incremental Balanced Truncation
Besselink, Bart; van de Wouw, Nathan; Scherpen, Jacquelien M. A.; Nijmeijer, Henk
2014-01-01
In this paper, the method of incremental balanced truncation is introduced as a tool for model reduction of nonlinear systems. Incremental balanced truncation provides an extension of balanced truncation for linear systems towards the nonlinear case and differs from existing nonlinear balancing tech
Model Reduction for Nonlinear Systems by Incremental Balanced Truncation
Besselink, Bart; van de Wouw, Nathan; Scherpen, Jacquelien M. A.; Nijmeijer, Henk
2014-01-01
In this paper, the method of incremental balanced truncation is introduced as a tool for model reduction of nonlinear systems. Incremental balanced truncation provides an extension of balanced truncation for linear systems towards the nonlinear case and differs from existing nonlinear balancing tech
Institute of Scientific and Technical Information of China (English)
薛宏刚; 张川; 胡春萍; 徐成贤
2011-01-01
In this paper, we consider the portfolio optimal problem under block trading. As the decrease of marginal transaction cost under block trading, we establish the mean-variance portfolio optimization model and the corresponding algorithm by means of fit transaction cost function with linear and concave form. Computational results are presented by considering the stocks involved in Hang Seng Index to show that: The efficient frontier under block trading is between that with linear transaction cost and without transaction cost; The investment risk can be eliminated by portfolio diversification, but the effect of that is dilute under block trading; In terms of linear transaction cost, the greater the transaction cost under block trading, the higher the portfolio concentration.%由于大宗交易下边际交易费用递减,因此用线性加凹的函数拟合实际交易费用函数,建立了均值-方差框架下的组合优化模型并给出了相应的求解算法.通过对恒生指数样本股的实证分析发现:考虑大宗交易的组合有效边缘介于线性交易费用和无交易费用的组合有效边缘之间；大宗交易稀释了“分散化降低风险”的效应；大宗交易下交易费用越大,相对于线性交易费用而言组合集中度越高.
一种低复杂度的空时分组码检测算法%Low Complexity Detection Algorithm for Space-time Block Coding
Institute of Scientific and Technical Information of China (English)
张建忠; 李宏伟; 邓冬虎
2011-01-01
空时分组码能够提供分集和编码增益,但所用的ML译码算法计算量太大,不能满足高速实时通信系统的要求.为了有效地降低译码复杂度,提出了一种新的检测算法,该算法通过对系统模型进行变换,利用等效的信道响应矩阵的QR分解来进行译码,从而避免了对所有的调制信号进行穷举搜索的过程,使计算复杂度有了很大降低,而且新算法的误码率性能与ML算法近乎相同.最后,通过仿真验证了所提算法的有效性和实用性.%STBC can provide the diversity and coding gains. However, the conventional ML decoding algorithm has expensive computational complexity, which the need of high-velocity and real-time communication systems can not be satified. In order to reduce effectively decoding complexity, a new detection algorithm is proposed. The new algorithm uses the QR decomposition of the equivalent channel matrix to decode via transforming the system model. An exhaustive search over the signal modulation constellation for decoding can be avoided and greafiy decoding complexity are reduced, moreover, the error code ratio performance of the new algorithm is almost absolute sameness with ML decoding algorithm. Finally, the results with simulation validate the validity and practicability of the proposed algorithm.
Institute of Scientific and Technical Information of China (English)
孙琰玥; 何小海; 宋海英; 陈为龙
2011-01-01
图像配准是超分辨率重建中的一个关键问题,直接影响超分辨率重建图像的质量.本文在自适应十字搜索(Adaptive rood pattern search,ARPS)块匹配算法的基础上,根据小波域中各图像之间的相关性,提出一种分层块匹配算法-基于小波变换的改进的自适应十字模式搜索算法(Improved adaptive rood pattern search algorithm based on wavelet transform,W-IARPS),该方法在小波变换域完成匹配宏块的搜索,有效地减少了匹配点的搜索个数,且配准图像的峰值信噪比相比全搜索算法下降不到0.1dB,保持了较高的配准精度.最后采用凸集投影(Projections onto convex sets,POCS)算法对配准后的图像进行超分辨率重建,取得了较好的视觉效果.实验结果表明,该方法具有较高的配准精度和重建效果,算法稳健可靠.%Image registration is one of the key components in super-resolution reconstruction, and it directly affects the quality of the reconstructed image. On the basis of adaptive rood pattern search (ARPS) block-matching algorithm,and according to the correlation between various images in wavelet domain, an hierarchical block-matching algorithm - improved adaptive rood pattern search algorithm based on wavelet transform (W-IARPS) is proposed. Searching matched-macroblocks in wavelet domain can effectively reduce the number of search points, and the ratio of peak signal to noise of registered images decreases less than 0.1 dB compared to the exhaustive-search algorithm. It means that the high registration accuracy is guaranteed. Finally, the projections onto convex sets (POCS) method is used to reconstruct the super-resolution image from the registered images, and it can achieve better visual effects. The simulation results show that the algorithm has a high registration accuracy and reliable reconstruction results.
DEFF Research Database (Denmark)
Christensen, Lars P.B.; Larsen, Jan
2006-01-01
A general Variational Bayesian framework for iterative data and parameter estimation for coherent detection is introduced as a generalization of the EM-algorithm. Explicit solutions are given for MIMO channel estimation with Gaussian prior and noise covariance estimation with inverse-Wishart prio...
基于分块信息熵的彩色图像融合算法%Color Image Fusion Algorithm Based on Block Information Entropy
Institute of Scientific and Technical Information of China (English)
杜欣宇; 陈丽芳; 刘渊
2015-01-01
针对常用的彩色图像融合算法在融合过程中降低原图像空间分辨率的问题，提出了一种基于分块信息熵的彩色图像融合算法。算法通过对图像进行块划分，计算分块图像在 IHS 色彩空间中亮度分量 I 上的信息熵，以对应块中信息熵大的为主元进行融合，得到新的融合图像。实验表明，与常用的IHS变换及PCA图像融合算法相比本文提出的方法可以更好的统筹源图像的场景细节信息，且在信息熵与平均梯度等方面都有很好的表现，具备一定的实用价值。%A method of color image fusion is proposed based on block information entropy, concerning the spatial resolution reduction of the original artwork during the fusion process with the traditional image fusion method. The developed method generates new fusion image by blocking images, calculating the information entropy of the blocked image on the luminance component I in color space IHS, and fusing the pivot element of the corresponding block whose information entropy is more. The experiment suggests that the method proposed in this thesis is better capable of planning scenic detailed information as a whole, compared to the traditional color image fusion method. In addition, it performs exceptionally in many aspects including information entropy and average gradient. Therefore, it is indeed of some practical value.
Marginal phase correction of truncated Bessel beams
Sedukhin
2000-06-01
Approximate analytic expressions are obtained for evaluating the axial intensity and the central-lobe diameter of J0 Bessel beams transmitted through a finite-aperture phase filter. A reasonable quality factor governing the axial-intensity behavior of a phase-undistorted truncated Bessel beam is found to be the inverse square root of the Fresnel number defined, for a given aperture, from the axial point of geometrical shadow. Additional drastic reduction of axial-intensity oscillations is accomplished by using marginal phase correction of the beam instead of the well-known amplitude apodization. A procedure for analytically calculating an optimal monotonic slowly varying correction phase function is described.
State Truncation for Large Markov Chains
Institute of Scientific and Technical Information of China (English)
JIANGLetian; XUGuozhi; ZHANGHao; YINGRendong
2003-01-01
One of the main issues to apply the Markov modeling method to reliability and availability analysis is the challenge called largeness, I.e., the explosive number of states, for a system with a large number of components.One method to quickly calculate the reliability of a sys-tem is to neglect ‘unimportant’ states in the Markov chain model. In this paper, based on a Markov model that is widely used in practical systems, a criterion of state trun-cation is presented.
Generic Rigidity Matroids with Dilworth Truncations
Tanigawa, Shin-ichi
2010-01-01
We prove that the linear matroid that defines generic rigidity of $d$-dimensional body-rod-bar frameworks (i.e., structures consisting of disjoint bodies and rods mutually linked by bars) can be obtained from the union of ${d+1 \\choose 2}$ graphic matroids by applying variants of Dilworth truncation $n_r$ times, where $n_r$ denotes the number of rods. This leads to an alternative proof of Tay's combinatorial characterizations of generic rigidity of rod-bar frameworks and that of identified body-hinge frameworks.
Stable surface solitons in truncated complex potentials.
He, Yingji; Mihalache, Dumitru; Zhu, Xing; Guo, Lina; Kartashov, Yaroslav V
2012-07-01
We show that surface solitons in the one-dimensional nonlinear Schrödinger equation with truncated complex periodic potential can be stabilized by linear homogeneous losses, which are necessary to balance gain in the near-surface channel arising from the imaginary part of potential. Such solitons become stable attractors when the strength of homogeneous losses acquires values from a limited interval and they exist in focusing and defocusing media. The domains of stability of the surface solitons shrink with an increase in the amplitude of the imaginary part of complex potential.
Stable surface solitons in truncated complex potentials
He, Yingji; Zhu, Xing; Guo, Lina; Kartashov, Yaroslav V
2012-01-01
We show that surface solitons in the one-dimensional nonlinear Schr\\"odinger equation with truncated complex periodic potential can be stabilized by linear homogeneous losses, which are necessary to balance gain in the near-surface channel arising from the imaginary part of potential. Such solitons become stable attractors when the strength of homogeneous losses acquires values from a limited interval and they exist in focusing and defocusing media. The domains of stability of surface solitons shrink with increase of the amplitude of imaginary part of complex potential.
The truncation of stellar discs A theoretical model
Battaner, E; Jiménez-Vicente, J
1998-01-01
The truncation of stellar discs is not abrupt but characterized by a continuous distancing from the exponential profile. There exists a truncation curve, $t(r)$, ending at a truncation radius, $r_t$. We present here a theoretical model in which it is assumed that the magnetic hypothesis explaining the flat rotation curve also explains the truncation. Once stars are born, the centripetal magnetic force previously acting on the progenitor gas cloud is suddenly interrupted, and stars must move to larger orbits or escape. The agreement between theoretical and observed truncation curves is very satisfactory. Parameters defining the disc gas rotation curve should therefore be related to those defining the truncation. It is predicted that rotation curves that quickly reach the asymptotic value $\\theta_0 = \\theta (r=\\infty)$ would have small truncation radii. On the contrary, $r_t$ and $\\theta_0$ itself, would be uncorrelated quantities.
Institute of Scientific and Technical Information of China (English)
韩玉艳; 巩敦卫; 张勇
2015-01-01
For the blocking lot-streaming flow shop scheduling problem with stochastic processing time,a method is proposed to transform it into a determinate one using Monte Carlo sampling method.An improved artificial bee colony algorithm is developed, in which a harmony search and local search based on insertion operators are adopted to balance the algorithm’s capability in explo-ration and exploitation.The proposed algorithm is applied to 24 instances of blocking lot-streaming flow shop scheduling prob-lem.The experimental results show that the improved algorithm can generate solutions with high quality and reduce the influence resulting from uncertainties.%针对含有随机加工时间的阻塞批量流水线调度问题，利用蒙特卡洛采样方法，将不确定加工时间的阻塞批量流水线调度问题转化为确定加工时间的阻塞批量调度问题。采用改进的人工蜂群算法，对上述转化后的调度问题进行求解。算法中加入了和声搜索和基于插入操作的局部搜索算子，以改进全局探索和局部开发能力，并将改进的算法应用到阻塞批量调度的24个算例中。仿真实验结果表明，改进的人工蜂群算法能够降低调度中的不确定因素带来的影响，产生高质量的解。
Directory of Open Access Journals (Sweden)
ZHOU Hao
2015-08-01
Full Text Available In order to solve the intensive computing tasks and high memory demand problem in satellite gravity field model inversion on the basis of huge amounts of satellite gravity observations, the parallel algorithm for high truncated order and degree satellite gravity field model inversion with least square method on the basis of MPI was introduced. After analyzing the time and space complexity of each step in the solving flow, the parallel I/O, block-organized storage and block-organized computation algorithm on the basis of MPI are introduced to design the parallel algorithm for building design matrix, establishing and solving normal equation, and the simulation results indicate that the parallel efficiency of building design matrix, establishing and solving normal equation can reach to 95%, 68%and 63% respectively. In addition, on the basis of GOCE simulated orbits and radial disturbance gravity gradient data(518 400 epochs in total, two earth gravity models truncated to degree and order 120, 240 are inversed, and the relative computation time and memory demand are only about 40 minutes and 7 hours, 290 MB and 1.57 GB respectively. Eventually, a simulation numerical calculation for earth gravity field model inversion with the simulation data, which has the equivalent noise level with GRACE and GOCE mission, is conducted. The accuracy of inversion model has a good consistent with current released model, and the combined mode can complement the spectral information of each individual mission, which indicates that the parallel algorithm in this paper can be applied to inverse the high truncated degree and order earth gravity model efficiently and stably.
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ The Zitongdong Block (Eastern Zitong Block) is located in the northwest of the Sichuan Basin. Tectonically, it is situated in the east part of Zitong Depression, southeast of mid-Longmenshan folded and faulted belt( as shown on Fig. 8 ), covering an area of 1 730 km2. The traffic is very convenient, the No. 108 national highway passes through the north of the block. Topographically, the area belongs to low hilly land at the elevation of 500-700 m.
Institute of Scientific and Technical Information of China (English)
宋伟; 侯建军; 李赵红
2011-01-01
The good statistical character of image blocks was used to present a novel digital reversible data hiding algorithm based on block-classification and difference-expansion. The host image was divided into data embedded area and auxiliary information area. In the former area, the types of image block were determined by the statistical relationship between the surrounding image blocks and the target image blocks, thus different amount of data information was embedded according to the different types. At the same time, the data were embedded in the less impact direction by the direction determined criterion, and the problem of image distortion due to single embed direction was solved. In auxiliary information embedded area, modified prediction-error was used to embed the location map and other auxiliary information for its zero overflow performance, and the new location map generated by auxiliary information embedded was avoided. Simulation of the algorithm was performed on different type images, and the results were compared with those of the exiting algorithms. The results show that the proposed algorithm has good performance, which can not only increase the amount of the embedded data, but also improve the embedded images' quality.%利用图像块的统计特性,描述一种新的基于差值扩展和块分类技术的可逆数据隐藏算法.首先,将图像分为数据嵌入区域和辅助信息嵌入区域.在数据嵌入区域,将分块后的图像利用周围图像块与目标图像块间的统计关系判断图像块的类型,从而根据类型差异嵌入不同数据量的信息,实现图像内容复杂度对数据嵌入量的控制.同时,利用方向判断准则选择对图像影响较小的方向嵌入,解决了单一嵌入方向对图像造成较大失真的问题.在辅助信息嵌入区域,采用MPE零溢出的特性嵌入位图辅助信息,避免嵌入辅助信息带来新的位图信息.对不同纹理图像进行实验测试以
Entanglement Entropy from the Truncated Conformal Space
Palmai, T
2016-01-01
A new numerical approach to entanglement entropies of the Renyi type is proposed for one-dimensional quantum field theories. The method extends the truncated conformal spectrum approach and we will demonstrate that it is especially suited to study the crossover from massless to massive behavior when the subsystem size is comparable to the correlation length. We apply it to different deformations of massless free fermions, corresponding to the scaling limit of the Ising model in transverse and longitudinal fields. For massive free fermions the exactly known crossover function is reproduced already in very small system sizes. The new method treats ground states and excited states on the same footing, and the applicability for excited states is illustrated by reproducing Renyi entropies of low-lying states in the transverse field Ising model.
A supersymmetric consistent truncation for conifold solutions
Cassani, Davide
2010-01-01
We establish a supersymmetric consistent truncation of type IIB supergravity on the T^{1,1} coset space, based on extending the Papadopoulos-Tseytlin ansatz to the full set of SU(2)xSU(2) invariant Kaluza-Klein modes. The five-dimensional model is a gauged N=4 supergravity with three vector multiplets, which incorporates various conifold solutions and is suitable for the study of their dynamics. By analysing the scalar potential we find a family of new non-supersymmetric AdS_5 extrema interpolating between a solution obtained long ago by Romans and a solution employing an Einstein metric on T^{1,1} different from the standard one. Finally, we discuss some simple consistent subtruncations preserving N=2 supersymmetry. One of them is compatible with the inclusion of smeared D7-branes.
Vortex breakdown in a truncated conical bioreactor
Balci, Adnan; Brøns, Morten; Herrada, Miguel A.; Shtern, Vladimir N.
2015-12-01
This numerical study explains the eddy formation and disappearance in a slow steady axisymmetric air-water flow in a vertical truncated conical container, driven by the rotating top disk. Numerous topological metamorphoses occur as the water height, Hw, and the bottom-sidewall angle, α, vary. It is found that the sidewall convergence (divergence) from the top to the bottom stimulates (suppresses) the development of vortex breakdown (VB) in both water and air. At α = 60°, the flow topology changes eighteen times as Hw varies. The changes are due to (a) competing effects of AMF (the air meridional flow) and swirl, which drive meridional motions of opposite directions in water, and (b) feedback of water flow on AMF. For small Hw, the AMF effect dominates. As Hw increases, the swirl effect dominates and causes VB. The water flow feedback produces and modifies air eddies. The results are of fundamental interest and can be relevant for aerial bioreactors.
Entanglement entropy from the truncated conformal space
Directory of Open Access Journals (Sweden)
T. Palmai
2016-08-01
Full Text Available A new numerical approach to entanglement entropies of the Rényi type is proposed for one-dimensional quantum field theories. The method extends the truncated conformal spectrum approach and we will demonstrate that it is especially suited to study the crossover from massless to massive behavior when the subsystem size is comparable to the correlation length. We apply it to different deformations of massless free fermions, corresponding to the scaling limit of the Ising model in transverse and longitudinal fields. For massive free fermions the exactly known crossover function is reproduced already in very small system sizes. The new method treats ground states and excited states on the same footing, and the applicability for excited states is illustrated by reproducing Rényi entropies of low-lying states in the transverse field Ising model.
Institute of Scientific and Technical Information of China (English)
陈莹; 黄永彪; 潘洪媚
2016-01-01
针对多标签网页推荐算法中存在信息不精确及新增信息较多，传统精确算法效果不理想的问题，提出一种多标签网页的粗糙集概率神经网络高斯块植入期望排序推荐方法。针对信息不确定性，利用粗糙集理论改进传统的概率神经网络模型，使之适合处理信息非确定性问题；针对固定概率神经网络在处理多标签网页推荐问题时，存在覆盖率差，结构冗余较大，对新增标签信息无法快速识别的问题，利用高斯块植入期望排序方式，构建概率功能块的合并、添加和删除操作，提高预测精度，降低计算复杂度，解决新增信息预测的实时性问题。在雅虎多标签数据集实例中的实验对比结果表明，该算法具有更高的计算精度和效率。%To solve the problem of imprecise,unsteady and incomplete information in multi label web page recommendation algo-rithms,and that the traditional accurate algorithms are not ideal,the rough set PNN Gauss block based embedded expectation sorting algorithm for multi label web recommendation was presented.For the problem of uncertainty of information,the rough set theory was used to improve the traditional probabilistic neural network,so that it was suitable for dealing with the problem of information uncertainty.To solve the problem of poor coverage and redundant structure in multi label page recommendation using fixed probabilistic neural network,the Gaussian block implantation expectation sorting algorithm was used to construct the merging, adding and deleting operations,improving the prediction accuracy and reducing the computational complexity.The experimental compari-son of the multi label data sets in YAHOO shows the proposed algorithm has higher computational accuracy and efficiency.
Hochschild homology, global dimension, and truncated oriented cycles
Han, Yang
2010-01-01
It is shown that a bounded quiver algebra having a 2-truncated oriented cycle is of infinite Hochschild homology dimension and global dimension, which generalizes a result of Solotar and Vigu\\'{e}-Poirrier to nonlocal ungraded algebras having a 2-truncated oriented cycle of arbitrary length. Therefore, a bounded quiver algebra of finite global dimension has no 2-truncated oriented cycles. Note that the well-known "no loops conjecture", which has been proved to be true already, says that a bounded quiver algebra of finite global dimension has no loops, i.e., truncated oriented cycles of length 1. Moreover, it is shown that a monomial algebra having a truncated oriented cycle is of infinite Hochschild homology dimension and global dimension. Consequently, a monomial algebra of finite global dimension has no truncated oriented cycles.
Lee, Ho; Fahimian, Benjamin P.; Xing, Lei
2017-03-01
This paper proposes a binary moving-blocker (BMB)-based technique for scatter correction in cone-beam computed tomography (CBCT). In concept, a beam blocker consisting of lead strips, mounted in front of the x-ray tube, moves rapidly in and out of the beam during a single gantry rotation. The projections are acquired in alternating phases of blocked and unblocked cone beams, where the blocked phase results in a stripe pattern in the width direction. To derive the scatter map from the blocked projections, 1D B-Spline interpolation/extrapolation is applied by using the detected information in the shaded regions. The scatter map of the unblocked projections is corrected by averaging two scatter maps that correspond to their adjacent blocked projections. The scatter-corrected projections are obtained by subtracting the corresponding scatter maps from the projection data and are utilized to generate the CBCT image by a compressed-sensing (CS)-based iterative reconstruction algorithm. Catphan504 and pelvis phantoms were used to evaluate the method’s performance. The proposed BMB-based technique provided an effective method to enhance the image quality by suppressing scatter-induced artifacts, such as ring artifacts around the bowtie area. Compared to CBCT without a blocker, the spatial nonuniformity was reduced from 9.1% to 3.1%. The root-mean-square error of the CT numbers in the regions of interest (ROIs) was reduced from 30.2 HU to 3.8 HU. In addition to high resolution, comparable to that of the benchmark image, the CS-based reconstruction also led to a better contrast-to-noise ratio in seven ROIs. The proposed technique enables complete scatter-corrected CBCT imaging with width-truncated projections and allows reducing the acquisition time to approximately half. This work may have significant implications for image-guided or adaptive radiation therapy, where CBCT is often used.
Lee, Ho; Fahimian, Benjamin P; Xing, Lei
2017-03-21
This paper proposes a binary moving-blocker (BMB)-based technique for scatter correction in cone-beam computed tomography (CBCT). In concept, a beam blocker consisting of lead strips, mounted in front of the x-ray tube, moves rapidly in and out of the beam during a single gantry rotation. The projections are acquired in alternating phases of blocked and unblocked cone beams, where the blocked phase results in a stripe pattern in the width direction. To derive the scatter map from the blocked projections, 1D B-Spline interpolation/extrapolation is applied by using the detected information in the shaded regions. The scatter map of the unblocked projections is corrected by averaging two scatter maps that correspond to their adjacent blocked projections. The scatter-corrected projections are obtained by subtracting the corresponding scatter maps from the projection data and are utilized to generate the CBCT image by a compressed-sensing (CS)-based iterative reconstruction algorithm. Catphan504 and pelvis phantoms were used to evaluate the method's performance. The proposed BMB-based technique provided an effective method to enhance the image quality by suppressing scatter-induced artifacts, such as ring artifacts around the bowtie area. Compared to CBCT without a blocker, the spatial nonuniformity was reduced from 9.1% to 3.1%. The root-mean-square error of the CT numbers in the regions of interest (ROIs) was reduced from 30.2 HU to 3.8 HU. In addition to high resolution, comparable to that of the benchmark image, the CS-based reconstruction also led to a better contrast-to-noise ratio in seven ROIs. The proposed technique enables complete scatter-corrected CBCT imaging with width-truncated projections and allows reducing the acquisition time to approximately half. This work may have significant implications for image-guided or adaptive radiation therapy, where CBCT is often used.
Institute of Scientific and Technical Information of China (English)
姜允志; 郝志峰; 林智勇; 袁淦钊
2011-01-01
图像多阈值分割在图像压缩、图像分析和模式识别等很多领域具有重要应用,但是阈值数的自动选择一直是至今未解决的难题.为此,基于分块采样和遗传算法提出一种自动多阈值图像分割算法.首先将一幅图像看成是由像素值组成的总体,运用分块采样得到若干子样本；其次在每一个子样本中运用遗传算法来使样本的均值与方差比极大化；再基于获得的样本信息对阈值数目和阈值进行自动预测；最后利用一种确定性的算法对阈值数和阈值做进一步的优化.该算法无需事先考虑图像的纹理和分割数等先验信息,具有较高的易用性,其计算复杂性对图像阈值个数敏感性较低,且无需进行灰度直方图分析.在Berkeley图像分割数据集上的大量仿真实验结果表明,文中算法能获得较准确、快速和稳定的图像分割.%Multilevel thresholding is an important technique for image compression, image analysis and pattern recognition. However, it is a hard problem to determine the number of thresholds automatically. In this paper, a new multilevel thresholding method called as automatic multilevel thresholding algorithm for image segmentation based on block sampling and genetic algorithm (AMT-BSGA) is proposed on the basis of block sampling and genetic algorithm. The proposed method can automatically determine the appropriate number of thresholds and the proper threshold values. In AMT-BSGA, an image is treated as a group of individual pixels with the gray values. First, an image is evenly divided into several blocks, and a sample is drawn from each block. Then, genetic algorithm based optimization is applied to each sample to maximize the ratio of mean and variance of the sample. Based on the optimized samples, the number of thresholds and threshold values are preliminarily determined. Finally, a deterministic method is implemented to further optimize the number of thresholds and
Truncations driven by constraints: consistency and conditions for correct upliftings
Pons, J M; Pons, Josep M.; Talavera, Pere
2004-01-01
We discuss the mechanism of truncations driven by the imposition of constraints. We show how the consistency of such truncations is controlled, and give general theorems that establish conditions for the correct uplifting of solutions. We show in some particular examples how one can get correct upliftings from 7d supergravities to 10d type IIB supergravity, even in cases when the truncation is not initially consistent by its own.
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ Zitongxi Block (Western Zitong Block), is located in Zitong County, northwest of Sichuan Province (as shown on Fig. 8 ). Geologically. it is situated in the Zitong Depression, southwest of the middle Longmenshan faulted and folded belt, covering an area of 1 830 km2. Transportation is very convenient. A crisscross network of highways run through the block and the Baocheng railway is nearby. The climate is moderate. Most area belongs to hilly land with the elevation of 500-600 m.The Tongjiang River runs across the area.
Yard crane scheduling model and algorithm in mixture storage block%混堆集装箱箱区内场桥调度模型与算法
Institute of Scientific and Technical Information of China (English)
郑红星; 于凯
2015-01-01
在混堆模式下的集装箱港口中，场桥（YC）调度是否合理直接影响着堆场的作业效率。考虑到混堆箱区内各任务对应的内集卡或外集卡到达时刻的不同，以及内外集卡优先级别的差异，构建了一个以所有集卡的等待成本和场桥的总移动成本最小为目标的场桥调度（YCS）模型，并设计了对应的遗传算法，给出了相应遗传算子的操作规则，通过算例的求解验证了模型与算法的有效性。%In the mixture storage mode of container port, Yard Crane(YC)scheduling that is reasonable or not will directly affect the yard operation efficiency. The arrival time of container truck corresponding to each task is different, but internal and external container truck have different priority levels. Considering all the above situations, this paper establishes a Yard Cranes Scheduling(YCS)model to minimize the waiting cost of trucks and moving cost of yard cranes. Then it designs a Genetic Algorithm(GA)and gives the corresponding operators. A numerical experiment is used to validate the efficiency of the model and the algorithm.
Institute of Scientific and Technical Information of China (English)
赵新阳; 郭杰; 周斌
2016-01-01
为了提高数据传输过程的安全性,笔者对国密对称密码算法( SM4 )的多模式实现机制进行研究,分析了模式间的差异和适用场景,统一了多模式编程接口. 宝钢集团有限公司ESB平台与基于云存储技术的网络文件保护系统集成时,采用基于电文密码本( ECB)模式的SM4密码算法实现消息传输的双向加解密,很好地解决了企业系统集成中的信息安全问题.%In order to improve the security of message transmission,the multi encryption modes of the SM4 Block Cipher algorithm are researched, the differences among these encryption modes and the suitable application scenario for each encryption mode are analyzed, and a unified multi-mode pro-gramming interface is provided. When integrating the ESB platform with the TSP system,which is a network file protection system based on the cloud storage technology,in Baosteel Group Corporation, the SM4 Block Cipher algorithm with ECB encryption mode is used to ensure the security of message transmission,which solves the problem of information security in enterprise system integration.
Dang, Hao; Webster Stayman, J.; Sisniega, Alejandro; Zbijewski, Wojciech; Xu, Jennifer; Wang, Xiaohui; Foos, David H.; Aygun, Nafi; Koliatsos, Vassilis E.; Siewerdsen, Jeffrey H.
2017-01-01
A prototype cone-beam CT (CBCT) head scanner featuring model-based iterative reconstruction (MBIR) has been recently developed and demonstrated the potential for reliable detection of acute intracranial hemorrhage (ICH), which is vital to diagnosis of traumatic brain injury and hemorrhagic stroke. However, data truncation (e.g. due to the head holder) can result in artifacts that reduce image uniformity and challenge ICH detection. We propose a multi-resolution MBIR method with an extended reconstruction field of view (RFOV) to mitigate truncation effects in CBCT of the head. The image volume includes a fine voxel size in the (inner) nontruncated region and a coarse voxel size in the (outer) truncated region. This multi-resolution scheme allows extension of the RFOV to mitigate truncation effects while introducing minimal increase in computational complexity. The multi-resolution method was incorporated in a penalized weighted least-squares (PWLS) reconstruction framework previously developed for CBCT of the head. Experiments involving an anthropomorphic head phantom with truncation due to a carbon-fiber holder were shown to result in severe artifacts in conventional single-resolution PWLS, whereas extending the RFOV within the multi-resolution framework strongly reduced truncation artifacts. For the same extended RFOV, the multi-resolution approach reduced computation time compared to the single-resolution approach (viz. time reduced by 40.7%, 83.0%, and over 95% for an image volume of 6003, 8003, 10003 voxels). Algorithm parameters (e.g. regularization strength, the ratio of the fine and coarse voxel size, and RFOV size) were investigated to guide reliable parameter selection. The findings provide a promising method for truncation artifact reduction in CBCT and may be useful for other MBIR methods and applications for which truncation is a challenge.
Linking algorithm of discontinuity crack block based on autonomous edge growing%基于主动生长的断裂裂缝块的连接方法
Institute of Scientific and Technical Information of China (English)
朱平哲; 黎蔚
2011-01-01
In order to deal with the problem of false information and edge breakpoint about binary image of asphalt pavement crack image segmentation, a new method of discontinuity crack block linking was developed based on autonomous edge growing. This method removed false information according to the characteristics of circular noise and linearly cracks, and filled interstice by using method of region filling, thereby accomplished linking of discontinuity crack block based on autonomous edge growing. The experimental results show that the algorithm has excellent performance in edge linking of discontinuity crack block in different cases, and the noises can be removed at the same time, which is in favor of subsequent image processing such as image measurement and evaluating.%针对沥青路面裂缝图像分割成二值图像后,存在虚假信息和边缘断点的问题,提出一种基于主动生长的断裂裂缝块的连接方法.该方法依据噪声呈孤立圈状,裂缝呈线性的特征去除虚假噪声信息；并采用区域填充法将裂缝轮廓内部空隙填充,使裂缝呈现块状；然后采用主动生长法进行断裂裂缝块的连接.实验表明,该算法在去除噪声的情况下,较好实现了断裂裂缝块的连接,有利于后续的图像测量、评估等处理.
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ Chengzikou Block is located in the north of Hekou district, Dongying City, Shandong Province, adjacent to Bohai Bay. It can be geographically divided into three units: onshore, transitional zone and offshore ultrashallow zone, totally covering an area of 470 km2. The southern onshore area is low and gentle in topography;the northern shallow sea is at water depths of 2-8 m below sea level, and the transitional zone occupies more than 60% of the whole block. The climate belongs to temperate zone with seasonal wind. Highways are welldeveloped here, and the traffic is very convenient. The Chengzikou Block is about 80 km away from Dongying City and 290 km from Jinan City in the south. The northern offshore area of the block is 160 km away from Longkou port in the east and only 38 km away in the west from Zhuangxi port.
Volterra series truncation and kernel estimation of nonlinear systems in the frequency domain
Zhang, B.; Billings, S. A.
2017-02-01
The Volterra series model is a direct generalisation of the linear convolution integral and is capable of displaying the intrinsic features of a nonlinear system in a simple and easy to apply way. Nonlinear system analysis using Volterra series is normally based on the analysis of its frequency-domain kernels and a truncated description. But the estimation of Volterra kernels and the truncation of Volterra series are coupled with each other. In this paper, a novel complex-valued orthogonal least squares algorithm is developed. The new algorithm provides a powerful tool to determine which terms should be included in the Volterra series expansion and to estimate the kernels and thus solves the two problems all together. The estimated results are compared with those determined using the analytical expressions of the kernels to validate the method. To further evaluate the effectiveness of the method, the physical parameters of the system are also extracted from the measured kernels. Simulation studies demonstrates that the new approach not only can truncate the Volterra series expansion and estimate the kernels of a weakly nonlinear system, but also can indicate the applicability of the Volterra series analysis in a severely nonlinear system case.
New Considerations of Turbo Block Codes
Institute of Scientific and Technical Information of China (English)
YUEDianwu; EdSHWEDYK
2004-01-01
It is shown that (1) a general linear systematic block code can be expressed as a turbo block code and therefore can be decoded using any turbo decoding algorithm; (2) a turbo block code can be also encoded and decoded without any interleaver with the same performance as when an interleaver is present.
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ Longmenshan Block is located in Jiange County of Jiangyou City in the northwest of Sichuan Basin. covering an area of 2 628 km2. Geologically, it is situated in the Mid-Longmenshan fault and fold belt, neighbouring Zitong Depression in its southeast. There are mountains surrounding its northwest , the rest area being hilly land,with the elevation of 500-700 m. The BaoCheng railway and the No. 108 highway run through the block, the traffic is very convenient.
Projection-free approximate balanced truncation of large unstable systems
Flinois, Thibault L B; Schmid, Peter J
2015-01-01
In this article, we show that the projection-free, snapshot-based, balanced truncation method can be applied directly to unstable systems. We prove that even for unstable systems, the unmodified balanced proper orthogonal decomposition algorithm theoretically yields a converged transformation that balances the Gramians (including the unstable subspace). We then apply the method to a spatially developing unstable system and show that it results in reduced-order models of similar quality to the ones obtained with existing methods. Due to the unbounded growth of unstable modes, a practical restriction on the final impulse response simulation time appears, which can be adjusted depending on the desired order of the reduced-order model. Recommendations are given to further reduce the cost of the method if the system is large and to improve the performance of the method if it does not yield acceptable results in its unmodified form. Finally, the method is applied to the linearized flow around a cylinder at Re = 100...
Scheduling multirobot operations in manufacturing by truncated Petri nets
Chen, Qin; Luh, J. Y.
1995-08-01
Scheduling of operational sequences in manufacturing processes is one of the important problems in automation. Methods of applying Petri nets to model and analyze the problem with constraints on precedence relations, multiple resources allocation, etc. have been available in literature. Searching for an optimum schedule can be implemented by combining the branch-and-bound technique with the execution of the timed Petri net. The process usually produces a large Petri net which is practically not manageable. This disadvantage, however, can be handled by a truncation technique which divides the original large Petri net into several smaller size subnets. The complexity involved in the analysis of each subnet individually is greatly reduced. However, when the locally optimum schedules of the resulting subnets are combined together, it may not yield an overall optimum schedule for the original Petri net. To circumvent this problem, algorithms are developed based on the concepts of Petri net execution and modified branch-and-bound process. The developed technique is applied to a multi-robot task scheduling problem of the manufacturing work cell.
Institute of Scientific and Technical Information of China (English)
武广臣; 刘艳
2011-01-01
Three-dimensional modeling is an essential task in 3D GIS. And its speed depends on the speed of capturing texture to some extent. With the further promoting of the construction of three-dimensional digital cities, the traditional method of taking photos with camera can not meet the requirements of fast getting texture. Thus, this paper presented an algorithm of capturing non-blocking im ages based on high-resolution aerial photos, designed the algorithm for choosing ideal aerial photo, and realized automatic texture matc hing. It is of great significance for fast modeling.%三维建模是3D GIS中一项基本任务,其速度在一定程度上取决于纹理获取的速度.随着三维数字城市建设的推进,传统的相机拍照法已不能满足快速获取纹理的要求.为此,本文提出了一种基于高分辨率航片的无遮挡影像获取算法,并设计出选取理想航片的算法,实现了纹理自动匹配,对快速建模具有重要意义.
一种DE搜索块寻优的多聚焦图像融合算法%Algorithm for Multi- focus Image Fusion Using a DE Search-block Optimization
Institute of Scientific and Technical Information of China (English)
马文娟; 姬天富
2012-01-01
For multi - focus image, a DE （Differential Evolution） search strategy is used in algorithm of sub - block op-timization of the image fusion to discuss in-depth the clarity recovery of the source image with strict registration of the same scene. The fusion process is to divide the registered source image into several sub - blocks and then use the clarity evaluation function to select a clear image to form a fused image. The innovation of this method is that the size of the im- age block is used as a genetic chromosome after the crossover, mutation and selection operations to obtain the optimal so-lution in a global sense. The experimental comparison results show that this method is superior to the genetic algorithm and other conventional multi - focus image fusion method.%针对多聚焦图像，提出了一种DE（差异演化）搜索策略应用于图像融合子块寻优的算法，对同一场景两幅严格配准的源图像的清晰度恢复进行了深入研究。融合过程是首先将已经配准的源图像分割成若干个子块，然后采用一个清晰度评价函数选取清晰的图像块形成融合图像。该方法的创新之处在于，把图像子块的大小作为遗传染色体，经过交叉、变异和选择等操作，以便得到全局意义上的最优解。实验对比结果表明，该方法超过遗传算法和其它传统的多聚焦图像融合法。
An improved firefly algorithm for the blocking flow shop scheduling problem%改进的萤火虫算法求解阻塞流水线调度问题
Institute of Scientific and Technical Information of China (English)
郭丽萍; 李向涛; 谷文祥; 殷明浩
2013-01-01
为了提高阻塞流水线调度问题的求解性能,提出了一种改进的萤火虫算法来求解阻塞流水线调度问题.首先,提出一种离散机制把个体的实数编码形式转换成离散的作业序列,从而使算法能够应用于离散问题求解;其次,设计一种双重初始化方法,并将NEH启发式方法应用到初始化中来,使算法有一个较优的初始化环境,提高初始种群的解的质量;此外,重新设计了算法中个体的移动方式来增大搜索域;最后,以一定概率对种群中的个体进行局部搜索,加强算法的局部搜索性能.通过对Taillard数据集中部分实例进行求解,实验结果验证了新算法的有效性.%In order to improve the solving performance of the blocking flow shop scheduling problem, the researcher proposes to examine an improved firefly algorithm. Firstly, a discrete mechanism was proposed to convert the real coded form of individuals to discrete job sequences, so that the algorithm could be used to deal with discrete problems. Secondly, a double-initialization method was designed and the NEH ( Nawaz-Enscore-Ham) heuristic method was applied to the initialization, which provided a superior initial environment and improved the quality of the solution of the initial population. In addition, the research paper focused on redesigning the movement pattern of individuals to enhance the search space. Finally, a local search algorithm was applied to individuals with a certain probability, for the purpose of enhancing the ability to search locally. The improved firefly algorithm was then tested utilizing the Taillard datasets, and the results verified the effectiveness of the new algorithm.
Institute of Scientific and Technical Information of China (English)
于克训; 刘小洪; 许实章
2001-01-01
基于变极绕组设计的双极对数槽号相位图和对称块图法，将当前求解离散优化问题最有效的方法—遗传算法引入变极绕组的自动设计中，并以常用的反向法变极为例，提出了基于遗传 算法的数学模型，研制了相应的计算机软件。实现了在变极绕组设计中完全排除设计者主观 经验的因素，从而实现了变极绕组设计的计算机自动化，并通过实例证明了该理论及方法的先进性及实用性。%In this paper ,the authors develop a new pole-changing algorithm which is based on the twin pole pairs slot-number phase diagram and symmetrical block diagram method. The genetic algorithm is first applied to the optimization design. It presents the detailed mathematical models for GA optimization. This optimization algorithm excludes the factor depending on the personal experience and has realized the computer automation in pole-changing winding design. It also develops the corresponding computer software on the reverse-current speed-changing winding design. The example in this paper proves its advantages and practicability.
Institute of Scientific and Technical Information of China (English)
贾旭; 薛定宇; 崔建江; 刘晶
2011-01-01
提出一种分块提取局部方向特征,并将所有特征融合的静脉识别算法.首先,静脉图像经预处理后,利用改进的细化算法对获得的二值图像进行细化处理,得到了静脉的骨架信息；其次,将细化后的静脉图像进行分块,对分块后所有的子图像进行脊波变换,并对脊波分解系数进行主成分分析(PCA)降维,得到静脉图像的特征向量；最后,基于图像特征向量,利用支持向量机(SVM)对静脉图像进行分类匹配.试验表明,该算法获得的静脉图像特征具有较高的区分度,识别效果受图像采集和预处理过程出现的误差影响较小,正确识别率可达到97％以上.%A vein recognition algorithm based on fusing all local directional features which are extracted from divided blocks is proposed. Firstly, the acquired binary image is thinned by improved thinning algorithm after vein image pre-processing and the vein skeleton information is obtained. Secondly, the thinned vein image is divided into blocks. Then, every sub-image is processed by ridgelet transforming, the dimensions of ridgelet transforming coefficients are reduced by applying principal component analysis, and the eigenvectors of vein image are acquired. Finally, vein images are classified and matched through making use of support vector machine based on the eigenvectors of image. Experimental results show that eigenvectors which are acquired through proposed algorithm have better discrimination, recognition results are affected less by errors that are generated in image acquiring and pre-processing, and the correct recognition rate exceeds 97%.
Suppression of MRI Truncation Artifacts Using Total Variation Constrained Data Extrapolation
Directory of Open Access Journals (Sweden)
Kai Tobias Block
2008-01-01
Full Text Available The finite sampling of k-space in MRI causes spurious image artifacts, known as Gibbs ringing, which result from signal truncation at the border of k-space. The effect is especially visible for acquisitions at low resolution and commonly reduced by filtering at the expense of image blurring. The present work demonstrates that the simple assumption of a piecewise-constant object can be exploited to extrapolate the data in k-space beyond the measured part. The method allows for a significant reduction of truncation artifacts without compromising resolution. The assumption translates into a total variation minimization problem, which can be solved with a nonlinear optimization algorithm. In the presence of substantial noise, a modified approach offers edge-preserving denoising by allowing for slight deviations from the measured data in addition to supplementing data. The effectiveness of these methods is demonstrated with simulations as well as experimental data for a phantom and human brain in vivo.
Emura, Takeshi; Konno, Yoshihiko; Michimae, Hirofumi
2015-07-01
Doubly truncated data consist of samples whose observed values fall between the right- and left- truncation limits. With such samples, the distribution function of interest is estimated using the nonparametric maximum likelihood estimator (NPMLE) that is obtained through a self-consistency algorithm. Owing to the complicated asymptotic distribution of the NPMLE, the bootstrap method has been suggested for statistical inference. This paper proposes a closed-form estimator for the asymptotic covariance function of the NPMLE, which is computationally attractive alternative to bootstrapping. Furthermore, we develop various statistical inference procedures, such as confidence interval, goodness-of-fit tests, and confidence bands to demonstrate the usefulness of the proposed covariance estimator. Simulations are performed to compare the proposed method with both the bootstrap and jackknife methods. The methods are illustrated using the childhood cancer dataset.
Vortex breakdown in a truncated conical bioreactor
Energy Technology Data Exchange (ETDEWEB)
Balci, Adnan; Brøns, Morten [DTU Compute, Technical University of Denmark, DK-2800 Kgs. Lyngby (Denmark); Herrada, Miguel A [E.S.I, Universidad de Sevilla, Camino de los Descubrimientos s/n, E-41092 (Spain); Shtern, Vladimir N, E-mail: mobr@dtu.dk [Shtern Research and Consulting, Houston, TX 77096 (United States)
2015-12-15
This numerical study explains the eddy formation and disappearance in a slow steady axisymmetric air–water flow in a vertical truncated conical container, driven by the rotating top disk. Numerous topological metamorphoses occur as the water height, H{sub w}, and the bottom-sidewall angle, α, vary. It is found that the sidewall convergence (divergence) from the top to the bottom stimulates (suppresses) the development of vortex breakdown (VB) in both water and air. At α = 60°, the flow topology changes eighteen times as H{sub w} varies. The changes are due to (a) competing effects of AMF (the air meridional flow) and swirl, which drive meridional motions of opposite directions in water, and (b) feedback of water flow on AMF. For small H{sub w}, the AMF effect dominates. As H{sub w} increases, the swirl effect dominates and causes VB. The water flow feedback produces and modifies air eddies. The results are of fundamental interest and can be relevant for aerial bioreactors. (paper)
Understanding biases when fitting disk truncations
Cardiel, Nicolás; Marino, Raffaella A.; Pascual, Sergio; Ceballos, M. Teresa; Gil de Paz, Armando; Sánchez, Sebastián F.
2017-03-01
Truncations in the stellar population at the edges of disk galaxies are thought to be a common morphological feature (e.g., Erwin et al. 2005; and more recently Marino et al. 2016). In fact, using imaging data from the SDSS, Pohlen & Trujillo (2006) showed that only ~ 10% of face-on to intermediate inclined, nearby, late-type (Sb-Sdm) spiral galaxies have a normal/standard purely exponential disk down to the noise limit. In situations like these, the simultaneous fit of two lines, joined or not at an intermediate point (the break radius), constitutes a natural step towards the modelling of radial variation in surface brightness, metallicity, or any other relevant parameter. This work shows the results of simple simulations in which the simultaneous fit to two joined lines is compared to the simultaneous fit of two independent lines (i.e., two lines that do not necessarily coincide at an intermediate point), and also to the traditional single ordinary least squares fit. These simulations reveal some biases that should be taken into account when facing these kind of fitting procedures.
BCFT moduli space in level truncation
Kudrna, Matěj; Maccaferri, Carlo
2016-04-01
We propose a new non-perturbative method to search for marginal deformations in level truncated open string field theory. Instead of studying the flatness of the effective potential for the marginal field (which is not expected to give a one-to-one parametrization of the BCFT moduli space), we identify a new non-universal branch of the tachyon potential which, from known analytic examples, is expected to parametrize the marginal flow in a much larger region of the BCFT moduli space. By a level 18 computation in Siegel gauge we find an increasingly flat effective potential in the non-universal sector, connected to the perturbative vacuum and we confirm that the coefficient of the marginal field ( λ SFT) has a maximum compatible with the value where the solutions stop existing in the standard Sen-Zwiebach approach. At the maximal reachable level the effective potential still deviates from flatness for large values of the tachyon, but the Ellwood invariants stay close to the correct BCFT values on the whole branch and the full periodic moduli space of the cosine deformation is covered.
BCFT moduli space in level truncation
Kudrna, Matej
2016-01-01
We propose a new non-perturbative method to search for marginal deformations in level truncated open string field theory. Instead of studying the flatness of the effective potential for the marginal field (which is not expected to give a one-to-one parametrization of the BCFT moduli space), we identify a new non-universal branch of the tachyon potential which, from known analytic examples, is expected to parametrize the marginal flow in a much larger region of the BCFT moduli space. By a level 18 computation in Siegel gauge, we find an increasingly flat effective potential in the non-universal sector, connected to the perturbative vacuum and we confirm that the coefficient of the marginal field (lambda_SFT) has a maximum compatible with the value where the solutions stop existing in the standard Sen-Zwiebach approach. At the maximal reachable level, the effective potential still deviates from flatness for large values of the tachyon, but the Ellwood invariants stay close to the correct BCFT values on the whol...
Cvetic, G
1998-01-01
An approximation algorithm is proposed to transform truncated QCD (or QED) series for observables. The approximation is a modification of the Baker-Gammel approximants, and is independent of the renormalization scale (RScl) $\\mu$ -- the coupling parameter $\\alpha(\\mu)$ in the series and in the resulting approximants can evolve according to the perturbative renormalization group equation (RGE) to any chosen loop order. The proposed algorithm is a natural generalization of the recently proposed method of diagonal Padé approximants, the latter making the result RScl-invariant in large-$\\beta_0$ approximation for ${\\alpha}(\\mu)$. The algorithm described below can extract large amount of information from a calculated available truncated perturbative series for an observable, by implicitly resumming large classes of diagrams.
Efficient Generation of Truncated Bessel Beams using Cylindrical Waveguides
Ilchenko, Vladimir S.; Mohageg, Makan; Savchenkov, Anatoliy A.; Matsko, Andrey B.; Maleki, Lute
2007-01-01
In this paper we address efficient conversion between a Gaussian beam (a truncated plane wave) and a truncated Bessel beam of agiven order, using cylindrical optical waveguides and whispering gallery mode resonators. Utilizing a generator based on waveguides combined with whispering gallery mode resonators, we have realized Bessel beams of the order of 200 with a conversion efficiency exceeding 10 %.
Truncation scheme of time-dependent density-matrix approach
Energy Technology Data Exchange (ETDEWEB)
Tohyama, Mitsuru [Kyorin University School of Medicine, Mitaka, Tokyo (Japan); Schuck, Peter [Universite Paris-Sud, Institut de Physique Nucleaire, IN2P3-CNRS, Orsay Cedex (France); Laboratoire de Physique et de Modelisation des Milieux Condenses et Universite Joseph Fourier, Grenoble Cedex 9 (France)
2014-04-15
A truncation scheme of the Bogoliubov-Born-Green-Kirkwood-Yvon hierarchy for reduced density matrices, where a three-body density matrix is approximated by the antisymmetrized products of two-body density matrices, is proposed. This truncation scheme is tested for three model Hamiltonians. It is shown that the obtained results are in good agreement with the exact solutions. (orig.)
Application of a truncated normal failure distribution in reliability testing
Groves, C., Jr.
1968-01-01
Statistical truncated normal distribution function is applied as a time-to-failure distribution function in equipment reliability estimations. Age-dependent characteristics of the truncated function provide a basis for formulating a system of high-reliability testing that effectively merges statistical, engineering, and cost considerations.
ON TRUNCATION ERROR BOUND FOR MULTIDIMENSIONAL SAMPLING EXPANSION LAPLACE TRANSFORM
Institute of Scientific and Technical Information of China (English)
Long Jingfan; Fang Gensun
2004-01-01
The truncation error associated with a given sampling representation is defined as the difference between the signal and an approximating sumutilizing a finite number of terms. In this paper we give uniform bound for truncation error of bandlimited functions in the n dimensional Lebesgue space Lp(Rn) associated with multidimensional Shannon sampling representation.
Assumptions regarding right censoring in the presence of left truncation.
Qian, Jing; Betensky, Rebecca A
2014-04-01
Clinical studies using complex sampling often involve both truncation and censoring, where there are options for the assumptions of independence of censoring and event and for the relationship between censoring and truncation. In this paper, we clarify these choices, show certain equivalences, and provide examples.
Block-based image hashing with restricted blocking strategy for rotational robustness
Xiang, Shijun; Yang, Jianquan
2012-12-01
Image hashing is a potential solution for image content authentication (a desired image hashing algorithm should be robust to common image processing operations and various geometric distortions). In the literature, researchers pay more attention to block-based image hashing algorithms due to their robustness to common image processing operations (such as lossy compression, low-pass filtering, and additive noise). However, the block-based hashing strategies are sensitive to rotation processing operations. This indicates that the robustness of the block-based hashing methods against rotation operations is an important issue. Towards this direction, in this article we propose a restricted blocking strategy by investigating effect of two rotation operations on an image and its blocks in both theoretical and experimental ways. Furthermore, we apply the proposed blocking strategy for the recently reported non-negative matrix factorization (NMF) hashing. Experimental results have demonstrated the validity of the block-based hashing algorithms with restricted blocking strategy for rotation operations.
Toeplitz block circulant matrix optimized with particle swarm optimization for compressive imaging
Tao, Huifeng; Yin, Songfeng; Tang, Cong
2016-10-01
Compressive imaging is an imaging way based on the compressive sensing theory, which could achieve to capture the high resolution image through a small set of measurements. As the core of the compressive imaging, the design of the measurement matrix is sufficient to ensure that the image can be recovered from the measurements. Due to the fast computing capacity and the characteristic of easy hardware implementation, The Toeplitz block circulant matrix is proposed to realize the encoded samples. The measurement matrix is usually optimized for improving the image reconstruction quality. However, the existing optimization methods can destroy the matrix structure easily when applied to the Toeplitz block circulant matrix optimization process, and the deterministic iterative processes of them are inflexible, because of requiring the task optimized to need to satisfy some certain mathematical property. To overcome this problem, a novel method of optimizing the Toeplitz block circulant matrix based on the particle swarm optimization intelligent algorithm is proposed in this paper. The objective function is established by the way of approaching the target matrix that is the Gram matrix truncated by the Welch threshold. The optimized object is the vector composed by the free entries instead of the Gram matrix. The experimental results indicate that the Toeplitz block circulant measurement matrix can be optimized while preserving the matrix structure by our method, and result in the reconstruction quality improvement.
Institute of Scientific and Technical Information of China (English)
无
1996-01-01
@@ The Chadong Block, located in the east of Qaidam Basin, Qinghai Province, covers an area of 12 452 km2. It is bounded by Kunlum Mountains in the south and the northwest is closely adjacent to Aimunike Mountain.Rivers are widely distributed, which always run in NWSE direction, including the Sulunguole, Qaidam and Haluwusu Rivers. The traffic condition is good, the Qinghai-Tibet highway stretching through the whole area and the Lan-Qing railway, 20-50 km away from the block, passing from north to west. A lot of Mongolia minority people have settled there, of which herdsmen always live nearby the Qaidam River drainage area.
基于半带滤波分块采样的计算任务排序算法%Computing Task Sorting Algorithm Based on Half Band Filter Sub Block Sampling
Institute of Scientific and Technical Information of China (English)
刘彩霞
2015-01-01
在计算机信息管理中,需要对计算任务按优先级或复杂度进行优化排序,实现计算效益优化.研究云计算信息系统中的计算任务优化排序算法,提高数据管理和调度的效率.传统方法采用子带合成滤波方法进行任务排序,计算开销和执行时效性方面性能不好,提出一种基于带滤波分块采样的计算任务排序算法.计算在整个计算机信息管理基站的每个站点的合计成本,根据信息匹配相关度进行资源搜索,计算任务分配时半滤波分块采样的收敛函数,得到基于半滤波分块采样的任务排序二元假设检验分配模型,实现任务优先级排序优化.仿真结果表明,采用该算法对云计算信息系统中的计算任务进行排序,能有效准确地确定计算任务的优先级,减少任务冲突,提高任务执行效率,在计算机信息管理和任务分配中具有较高应用价值.%In computer information management, the need for computing tasks according to priority or complexity of the opti-mized sorting, realize the calculation efficiency optimization. The research of cloud computing optimization algorithm of computing tasks in information system, improve the efficiency of data management and scheduling. The traditional method is using the sub-band synthesis filter method for task sequencing, the computation and the execution time of the perfor-mance is not good, put forward a sort of computing tasks with filtering algorithm based on block sampling. In the calculation of total cost of each site of the whole computer information management of base station, according to the information match-ing of resources search, calculation convergence function is assigned half filter block sampling, get the distribution sort half filter block sampling of two element hypothesis test model based on task priority scheduling optimization, implementation. The simulation results show that, the cloud computing tasks in information systems are
Institute of Scientific and Technical Information of China (English)
刘伟; 蔡泽浩; 商庆新; 钱云良; 曹谊林
2003-01-01
Objective To determine over expression of a truncated type Ⅱ TGF-β receptor in down regulating TGF-β1 autoproduction in normal dermal fibroblasts.MethodsIn vitro cultured dermal fibroblasts were treated with rhTGF β1(5ng/ml) or recombinant adenovirus containing a truncated type Ⅱ TGF-β receptor gene(50pfu/cell). Their effects on regulating gene expression of TGF β1 were observed with Northern Blot.Resultsrh TGF β1 up regulated the gene expression of TGF-β1(34%～150%) and type Ⅰ procollagen(13%～190%).Over expression of a truncated receptor Ⅱ decreased the gene expression of TGF-β1(53%～66%).ConclusionOver expression of the truncated TGF-β receptor Ⅱ down regulated TGF-β1 autoproduction via blocking signal transduction of TGF-β. This study may provide a new strategy for scar gene therapy.
Institute of Scientific and Technical Information of China (English)
刘鹏宇; 贾克斌
2012-01-01
H.264/AVC以巨大编码复杂度为代价,在获得更高压缩率的同时,编码实时性也随之降低.针对视频编码中重要且耗时的帧间预测技术,分析了宏块平坦度和时空相关性,提出了一种快速的预测模式选择算法.仿真实验结果表明,本文提出算法与H.264/AVC (JM12.2)标准算法相比,在保持重建视频图像质量和输出码流结构的前提下,平均节省约70％的编码时间,并继承了H.264/AVC低码率的编码优势.%At the cost of increased computational complexity, as H.264/AVC obtains higher compression ratio, its encoding real-time performance also fall subsequently. Aiming at the important and time-consuming inter-frame prediction technique in video encoding, flatness characteristics and spatio-temporal correlation of macro-block are analyzed. A fast inter-frame prediction mode decision algorithm is proposed Simulation results show that the proposed algorithm can reduce about 70% on average of the total encoding time compared with H.264/AVC (JM12.2), with keeping video image quality and reconstruction output streaming structure, inheriting low bit-rate coding advantage.
Unitary equivalence to a truncated Toeplitz operator: analytic symbols
Garcia, Stephan Ramon; Ross, William T
2010-01-01
Unlike Toeplitz operators on $H^2$, truncated Toeplitz operators do not have a natural matricial characterization. Consequently, these operators are difficult to study numerically. In this note we provide criteria for a matrix with distinct eigenvalues to be unitarily equivalent to a truncated Toeplitz operator having an analytic symbol. This test is constructive and we illustrate it with several examples. As a byproduct, we also prove that every complex symmetric operator on a Hilbert space of dimension $\\leq 3$ is unitarily equivalent to a direct sum of truncated Toeplitz operators.
On the control of a truncated general immigration process through the introduction of a predator
Directory of Open Access Journals (Sweden)
2006-01-01
Full Text Available This paper is concerned with the problem of controlling a truncated general immigration process, which represents a population of harmful individuals, by the introduction of a predator. If the parameters of the model satisfy some mild conditions, the existence of a control-limit policy that is average-cost optimal is proved. The proof is based on the uniformization technique and on the variation of a fictitious parameter over the entire real line. Furthermore, an efficient Markov decision algorithm is developed that generates a sequence of improving control-limit policies converging to the optimal policy.
Truncating an exact matrix product state for the XY model: Transfer matrix and its renormalization
Rams, Marek M.; Zauner, Valentin; Bal, Matthias; Haegeman, Jutho; Verstraete, Frank
2015-12-01
We discuss how to analytically obtain an essentially infinite matrix product state (MPS) representation of the ground state of the XY model. On one hand this allows us to illustrate how the Ornstein-Zernike form of the correlation function emerges in the exact case using standard MPS language. On the other hand we study the consequences of truncating the bond dimension of the exact MPS, which is also part of many tensor network algorithms, and analyze how the truncated MPS transfer matrix is representing the dominant part of the exact quantum transfer matrix. In the gapped phase we observe that the correlation length obtained from a truncated MPS approaches the exact value following a power law in effective bond dimension. In the gapless phase we find a good match between a state obtained numerically from standard MPS techniques with finite bond dimension and a state obtained by effective finite imaginary time evolution in our framework. This provides a direct hint for a geometric interpretation of finite entanglement scaling at the critical point in this case. Finally, by analyzing the spectra of transfer matrices, we support the interpretation put forward by V. Zauner et al. [New J. Phys. 17, 053002 (2015), 10.1088/1367-2630/17/5/053002] that the MPS transfer matrix emerges from the quantum transfer matrix though the application of Wilson's numerical renormalization group along the imaginary-time direction.
System Synthesis for Networks of Programmable Blocks
Mannion, Ryan; Cotterell, Susan; Vahid, Frank
2011-01-01
The advent of sensor networks presents untapped opportunities for synthesis. We examine the problem of synthesis of behavioral specifications into networks of programmable sensor blocks. The particular behavioral specification we consider is an intuitive user-created network diagram of sensor blocks, each block having a pre-defined combinational or sequential behavior. We synthesize this specification to a new network that utilizes a minimum number of programmable blocks in place of the pre-defined blocks, thus reducing network size and hence network cost and power. We focus on the main task of this synthesis problem, namely partitioning pre-defined blocks onto a minimum number of programmable blocks, introducing the efficient but effective PareDown decomposition algorithm for the task. We describe the synthesis and simulation tools we developed. We provide results showing excellent network size reductions through such synthesis, and significant speedups of our algorithm over exhaustive search while obtaining...
A Truncated Nef Peptide from SIVcpz Inhibits the Production of HIV-1 Infectious Progeny
Directory of Open Access Journals (Sweden)
Marcela Sabino Cunha
2016-07-01
Full Text Available Nef proteins from all primate Lentiviruses, including the simian immunodeficiency virus of chimpanzees (SIVcpz, increase viral progeny infectivity. However, the function of Nef involved with the increase in viral infectivity is still not completely understood. Nonetheless, until now, studies investigating the functions of Nef from SIVcpz have been conducted in the context of the HIV-1 proviruses. In an attempt to investigate the role played by Nef during the replication cycle of an SIVcpz, a Nef-defective derivative was obtained from the SIVcpzWTGab2 clone by introducing a frame shift mutation at a unique restriction site within the nef sequence. This nef-deleted clone expresses an N-terminal 74-amino acid truncated peptide of Nef and was named SIVcpz-tNef. We found that the SIVcpz-tNef does not behave as a classic nef-deleted HIV-1 or simian immunodeficiency virus of macaques SIVmac. Markedly, SIVcpz-tNef progeny from both Hek-293T and Molt producer cells were completely non-infectious. Moreover, the loss in infectivity of SIVcpz-tNef correlated with the inhibition of Gag and GagPol processing. A marked accumulation of Gag and very low levels of reverse transcriptase were detected in viral lysates. Furthermore, these observations were reproduced once the tNef peptide was expressed in trans both in SIVcpzΔNef and HIV-1WT expressing cells, demonstrating that the truncated peptide is a dominant negative for viral processing and infectivity for both SIVcpz and HIV-1. We demonstrated that the truncated Nef peptide binds to GagPol outside the protease region and by doing so probably blocks processing of both GagPol and Gag precursors at a very early stage. This study demonstrates for the first time that naturally-occurring Nef peptides can potently block lentiviral processing and infectivity.
A Truncated Nef Peptide from SIVcpz Inhibits the Production of HIV-1 Infectious Progeny
Sabino Cunha, Marcela; Lima Sampaio, Thatiane; Peterlin, B. Matija; Jesus da Costa, Luciana
2016-01-01
Nef proteins from all primate Lentiviruses, including the simian immunodeficiency virus of chimpanzees (SIVcpz), increase viral progeny infectivity. However, the function of Nef involved with the increase in viral infectivity is still not completely understood. Nonetheless, until now, studies investigating the functions of Nef from SIVcpz have been conducted in the context of the HIV-1 proviruses. In an attempt to investigate the role played by Nef during the replication cycle of an SIVcpz, a Nef-defective derivative was obtained from the SIVcpzWTGab2 clone by introducing a frame shift mutation at a unique restriction site within the nef sequence. This nef-deleted clone expresses an N-terminal 74-amino acid truncated peptide of Nef and was named SIVcpz-tNef. We found that the SIVcpz-tNef does not behave as a classic nef-deleted HIV-1 or simian immunodeficiency virus of macaques SIVmac. Markedly, SIVcpz-tNef progeny from both Hek-293T and Molt producer cells were completely non-infectious. Moreover, the loss in infectivity of SIVcpz-tNef correlated with the inhibition of Gag and GagPol processing. A marked accumulation of Gag and very low levels of reverse transcriptase were detected in viral lysates. Furthermore, these observations were reproduced once the tNef peptide was expressed in trans both in SIVcpzΔNef and HIV-1WT expressing cells, demonstrating that the truncated peptide is a dominant negative for viral processing and infectivity for both SIVcpz and HIV-1. We demonstrated that the truncated Nef peptide binds to GagPol outside the protease region and by doing so probably blocks processing of both GagPol and Gag precursors at a very early stage. This study demonstrates for the first time that naturally-occurring Nef peptides can potently block lentiviral processing and infectivity. PMID:27399760
The Super D9-Brane and its Truncations
Bergshoeff, E A; Janssen, B; Ortín, Tomas; Bergshoeff, Eric; Roo, Mees de; Janssen, Bert; Ortin, Tomas
1999-01-01
We consider two inequivalent truncations of the super D9--brane: the ``Heterotic'' and the ``Type I'' truncation. Both of them lead to an N=1 nonlinear supersymmetrization of the D=10 cosmological constant. The propagating degrees of freedom in the Heterotic and Type I truncation are given by the components of a D=10 vector multiplet and a single Majorana-Weyl spinor, respectively. As a by-product we find that, after the Type I truncation, the Ramond-Ramond super ten-form provides an interesting reformulation of the Volkov-Akulov action. These results can be extended to all dimensions in which spacetime filling D-branes exist, i.e. D=3,4,6 and 10.
Truncated Autoinducing Peptides as Antagonists of Staphylococcus lugdunensis Quorum Sensing.
Gordon, Christopher P; Olson, Shondra D; Lister, Jessica L; Kavanaugh, Jeffrey S; Horswill, Alexander R
2016-10-13
Competitive quorum sensing (QS) antagonism offers a novel strategy for attenuating current multidrug resistant staphylococcal infections. To this end, a series of 10 truncated analogues based on the parent autoinducing peptides (AIPs) of Staphylococcus lugdunensis (groups I and II) and Staphylococcus epidermidis (groups I-III) were sequentially assessed against a newly developed Staphylococcus lugdunensis group I QS reporter strain. The truncated analogues based upon Staphylococcus lugdunensis AIP-1 (1) and AIP-2 (2) displayed respective IC50 values of 0.2 ± 0.01 μM and 0.3 ± 0.01 μM, while the truncated analogue of the Staphylococcus epidermidis AIP-1 (3) elicited an IC50 value of 2.7 ± 0.1 μM. These findings demonstrate the potential of cognate and "crosstalk" competitive quorum sensing inhibition using truncated AIPs as a means of attenuating staphylococcal infections in species beyond Staphylococcus aureus.
Truncated horseshoes and formal languages in chaotic scattering
Troll, G
1993-01-01
Abstract: In this paper we study parameter families of truncated horseshoes as models of multiscattering systems which show a transition to chaos without losing hyperbolicity, so that the topological features of the transition are completely describable by a parameterized family of symbolic dynamics. At a fixed parameter value the corresponding horseshoe represents the set of orbits trapped in the scattering region. The bifurcations are a pure boundary effect and no other bifurcations such as saddle center bifurcations occur in this transition scenario. Truncated horseshoes actually arise in concrete potential scattering under suitable conditions. It is shown that a simple scattering model introduced earlier can realize this scenario in a certain parameter range (the "truncated sawshoe") . For this purpose, we solve the inverse scattering problem of finding the central potential associated to the sawshoe model. Furthermore, we review classification schemes for the transition to chaos of truncated horseshoes o...
Measuring A Truncated Disk in Aquila X-1
King, Ashley L; Miller, Jon M; Chenevez, Jerome; Barret, Didier; Boggs, Steven E; Chakrabarty, Deepto; Christensen, Finn E; Craig, William W; Furst, Felix; Hailey, Charles J; Harrison, Fiona A; Parker, Michael L; Stern, Daniel; Romano, Patrizia; Walton, Dominic J; Zhang, William W
2016-01-01
We present NuSTAR and Swift observations of the neutron star Aquila X-1 during the peak of its July 2014 outburst. The spectrum is soft with strong evidence for a broad Fe K\\alpha line. Modeled with a relativistically broadened reflection model, we find that the inner disk is truncated with an inner radius of 15+/-3 R_G. The disk is likely truncated by either the boundary layer and/or a magnetic field. Associating the truncated inner disk with pressure from a magnetic field gives an upper limit of B<5+/-2x10^8G. Although the radius is truncated far from the stellar surface, material is still reaching the neutron star surface as evidenced by the X-ray burst present in the t NuSTAR observation.
Institute of Scientific and Technical Information of China (English)
安大伟; 谷松岩; 杨忠东; 陆风
2012-01-01
The Maximum Likelihood Estimation (MLE) algorithm for scatterometer wind vector retrieval generates several wind vector ambiguities, so a circle median filter is needed to perform the ambiguity removal. But the traditional circle median filtering method can hardly solve the block ambiguity problem. According to the spatial distribution characteristic of the most likely ambiguities in each non-cyclone wind vector cell, a new enhanced circle median filtering method for block ambiguity removal is derived and discussed theoretically, with experiments carried out to check its adaptability. This method features simple definition, low computation and easiness to converge. Using some L2 raw data from EUMETSAT to validate the method, the results indicate that under non-cyclone wind distribution condition the new method is effective in resolving the problem of block ambiguity after eliminating the cyclone wind field with other reference data. The core of the enhanced circular median filter algorithm is to initialize the non-cyclone characteristics first, which can effectively solve the problem of massive fuzzy. Thus the data which may cause circular median filtering failure and the data that affect the neighborhood will be corrected. Then divide the two-dimensional space into M rows and N columns, then calculate the wind field in the open window. The wind vector in the center of a window is solved by selecting an alternative from corresponding fuzzy solutions. And then do this with the next location iteratively, until the wind field does not change or until the times of iterations reaches a preset maximum number. Finally, defective value in the wind field is smoothed. Compared with traditional circle median filtering method, this approach is better in several ways. First, by initializing the first wind field, the fuzziness of the second wind field is reduced; while with the traditional method the block fuzzy cannot be removed. Second, the calculation process is simple and
Practical Binary Adaptive Block Coder
Reznik, Yuriy A
2007-01-01
This paper describes design of a low-complexity algorithm for adaptive encoding/ decoding of binary sequences produced by memoryless sources. The algorithm implements universal block codes constructed for a set of contexts identified by the numbers of non-zero bits in previous bits in a sequence. We derive a precise formula for asymptotic redundancy of such codes, which refines previous well-known estimate by Krichevsky and Trofimov, and provide experimental verification of this result. In our experimental study we also compare our implementation with existing binary adaptive encoders, such as JBIG's Q-coder, and MPEG AVC (ITU-T H.264)'s CABAC algorithms.
Enhancing propagation characteristics of truncated localized waves in silica
Salem, Mohamed
2011-07-01
The spectral characteristics of truncated Localized Waves propagating in dispersive silica are analyzed. Numerical experiments show that the immunity of the truncated Localized Waves propagating in dispersive silica to decay and distortion is enhanced as the non-linearity of the relation between the transverse spatial spectral components and the wave vector gets stronger, in contrast to free-space propagating waves, which suffer from early decay and distortion. © 2011 IEEE.
Architectures for block Toeplitz systems
Bouras, Ilias; Glentis, George-Othon; Kalouptsidis, Nicholas
1996-01-01
In this paper efficient VLSI architectures of highly concurrent algorithms for the solution of block linear systems with Toeplitz or near-to-Toeplitz entries are presented. The main features of the proposed scheme are the use of scalar only operations, multiplications/divisions and additions, and th
Rapid screen for truncating ATM mutations by PTT-ELISA
Energy Technology Data Exchange (ETDEWEB)
Du Liutao; Lai, C.-H. [Department of Pathology and Laboratory Medicine, David Geffen School of Medicine at UCLA, CA 90095 (United States); Concannon, Patrick [Department of Biochemistry and Molecular Genetics, University of Virginia, VA 22908 (United States); Gatti, Richard A. [Department of Pathology and Laboratory Medicine, David Geffen School of Medicine at UCLA, CA 90095 (United States); Department of Human Genetics, David Geffen School of Medicine at UCLA, CA 90095 (United States)], E-mail: rgatti@mednet.ucla.edu
2008-04-02
Mutations in the ataxia-telangiectasia mutated (ATM) gene are responsible for the autosomal recessive genetic disorder, ataxia-telangiectasia (A-T). Approximately 80% of ATM mutations found in A-T patients results in truncations, which can be detected by Protein Truncation Test (PTT). Conventional PTT uses SDS-PAGE electrophoresis to detect mobility of radiolabeled truncated protein fragments. In this study, we developed a non-radioactive Protein Truncation Test which utilizes an enzyme-linked immunosorbent assay (PTT-ELISA) to detect ATM mutations in eight overlapping fragments. N- and C-terminal epitopes (c-myc and V5, respectively) were introduced into transcription/translation products, which could then be detected by Sandwich ELISA. Using this assay, we screened 9 newly diagnosed A-T patients consecutively. Of the 18 expected mutations, 14 truncating mutations were independently identified by cDNA direct sequencing and/or DNA dHPLC analysis. PTT-ELISA detected all of these 14. Four mutations were novel. The PTT-ELISA provides a rapid method for detecting truncating mutations in large genes and should be considered prior to using more laborious or costly methods, such as direct sequencing.
DEFF Research Database (Denmark)
Gustavson, Fred G.; Reid, John K.; Wasniewski, Jerzy
2007-01-01
variables, and the speed is usually better than that of the LAPACK algorithm that uses full storage (n2 variables). Included are subroutines for rearranging a matrix whose upper or lower-triangular part is packed by columns to this format and for the inverse rearrangement. Also included is a kernel......We present subroutines for the Cholesky factorization of a positive-definite symmetric matrix and for solving corresponding sets of linear equations. They exploit cache memory by using the block hybrid format proposed by the authors in a companion article. The matrix is packed into n(n + 1)/2 real...
A NEW INEXACT SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM
Institute of Scientific and Technical Information of China (English)
倪勤
2002-01-01
This paper represents an inexact sequential quadratic programming (SQP ) algorithm which can solve nonlinear programming (NLP ) problems. An inexact solution of the quadratic programming subproblem is determined by a projection and contraction method such that only matrix-vector product is required. Some truncated criteria are chosen such that the algorithm is suitable to large scale NLP problem. The global convergence of the algorithm is proved.
The effect of truncation on very small cardiac SPECT camerasystems
Energy Technology Data Exchange (ETDEWEB)
Rohmer, Damien; Eisner, Robert L.; Gullberg, Grant T.
2006-08-01
Background: The limited transaxial field-of-view (FOV) of avery small cardiac SPECT camera system causes view-dependent truncationof the projection of structures exterior to, but near the heart. Basictomographic principles suggest that the reconstruction of non-attenuatedtruncated data gives a distortion-free image in the interior of thetruncated region, but the DC term of the Fourier spectrum of thereconstructed image is incorrect, meaning that the intensity scale of thereconstruction is inaccurate. The purpose of this study was tocharacterize the reconstructed image artifacts from truncated data, andto quantify their effects on the measurement of tracer uptake in themyocardial. Particular attention was given to instances where the heartwall is close to hot structures (structures of high activity uptake).Methods: The MCAT phantom was used to simulate a 2D slice of the heartregion. Truncated and non-truncated projections were formed both with andwithout attenuation. The reconstructions were analyzed for artifacts inthe myocardium caused by truncation, and for the effect that attenuationhas relative to increasing those artifacts. Results: The inaccuracy dueto truncation is primarily caused by an incorrect DC component. Forvisualizing theleft ventricular wall, this error is not worse than theeffect of attenuation. The addition of a small hot bowel-like structurenear the left ventricle causes few changes in counts on the wall. Largerartifacts due to the truncation are located at the boundary of thetruncation and can be eliminated by sinogram interpolation. Finally,algebraic reconstruction methods are shown to give better reconstructionresults than an analytical filtered back-projection reconstructionalgorithm. Conclusion: Small inaccuracies in reconstructed images fromsmall FOV camera systems should have little effect on clinicalinterpretation. However, changes in the degree of inaccuracy in countsfrom slice toslice are due to changes in the truncated structures
Institute of Scientific and Technical Information of China (English)
乔立岩; 张鹏; 魏德宝; 王世元
2015-01-01
A FPGA based NAND Flash bad block management scheme is presented ,on the basis of common bad block management of the non‐volatile NAND Flash memory .The scheme uses bad block replacement strategy to divide all blocks into Data block area and Good block reserved area . T he bad block identification and replacement is realized through the establishment of index‐based bad block marking tables BBT (bad block table) and the bad block map RT T (reserved translate table) .At the same time ,the two tables are saved in the NAND Flash to guarantee the non‐volatile storage of bad block information and the high‐speed performance query of bad blocks .Taking into account the bad block emerging ,bad block identification ,bad block information storage and high‐speed replacement of bad block ,this scheme is the complete solution for bad block management .Experiments showed that this strategy has the advantages of small bad block information capacity ,fast replacement and high reliability .%本文在研究NAND Flash常用坏块管理方法的基础上，提出了一种基于FPGA 的NAND Flash坏块管理方案。该方案运用坏块替换策略，将所有块分为数据块区和好块保留区，通过在FPGA片内RAM建立基于位索引的坏块位标记表BBT （bad block table）和块保留映射表RT T （reserved translate table）实现坏块的识别和替换，同时将两表保存于NAND Flash中，保证了坏块信息的非易失存储和坏块查询的高速性能。本方案全面考虑了坏块产生、坏块识别、坏块信息存储、坏块高速替换，是坏块管理的完整解决方案。经实验表明该方案具有坏块信息容量小、替换速度快、实现可靠等优点。
Pulmonary MRA: Differentiation of pulmonary embolism from truncation artefact
Energy Technology Data Exchange (ETDEWEB)
Bannas, Peter [University of Wisconsin-Madison, Department of Radiology, Madison, WI (United States); University Hospital Hamburg-Eppendorf, Department of Radiology, Hamburg (Germany); Schiebler, Mark L.; Motosugi, Utaroh; Francois, Christopher J. [University of Wisconsin-Madison, Department of Radiology, Madison, WI (United States); Reeder, Scott B. [University of Wisconsin-Madison, Department of Radiology, Madison, WI (United States); University of Wisconsin-Madison, Department of Biomedical Engineering, Madison, WI (United States); University of Wisconsin-Madison, Department of Medical Physics, Madison, WI (United States); University of Wisconsin-Madison, Department of Medicine, Madison, WI (United States); Nagle, Scott K. [University of Wisconsin-Madison, Department of Radiology, Madison, WI (United States); University of Wisconsin-Madison, Department of Medical Physics, Madison, WI (United States); University of Wisconsin-Madison, Department of Pediatrics, Madison, WI (United States)
2014-08-15
Truncation artefact (Gibbs ringing) causes central signal drop within vessels in pulmonary magnetic resonance angiography (MRA) that can be mistaken for emboli, reducing diagnostic accuracy for pulmonary embolism (PE). We propose a quantitative approach to differentiate truncation artefact from PE. Twenty-eight patients who underwent pulmonary computed tomography angiography (CTA) for suspected PE were recruited for pulmonary MRA. Signal intensity drops within pulmonary arteries that persisted on both arterial-phase and delayed-phase MRA were identified. The percent signal loss between the vessel lumen and central drop was measured. CTA served as the reference standard for presence of pulmonary emboli. A total of 65 signal intensity drops were identified on MRA. Of these, 48 (74 %) were artefacts and 17 (26 %) were PE, as confirmed by CTA. Truncation artefacts had a significantly lower median signal drop than PE on both arterial-phase (26 % [range 12-58 %] vs. 85 % [range 53-91 %]) and delayed-phase MRA (26 % [range 11-55 %] vs. 77 % [range 47-89 %]), p < 0.0001 for both. Receiver operating characteristic (ROC) analyses revealed a threshold value of 51 % (arterial phase) and 47 % signal drop (delayed phase) to differentiate between truncation artefact and PE with 100 % sensitivity and greater than 90 % specificity. Quantitative signal drop is an objective tool to help differentiate truncation artefact and pulmonary embolism in pulmonary MRA. (orig.)
Institute of Scientific and Technical Information of China (English)
刘典型
2015-01-01
虚拟化技术为用户提供了高可用性、动态、可扩展、可按需分配的逻辑资源，虚拟机迁移技术则减弱了虚拟化初次分配资源后物理资源和逻辑资源的耦合程度，使得物理资源池构建更为灵活。然而现存的虚拟机迁移技术存在着资源消耗多，物理磁盘负载重，迁移数据冗余等问题，使得迁移的稳定性和可用性大打折扣。提出基于内存缓存的动态块迁移算法。该算法主要关注以下两点：其一是如何在保证迁移性能不受明显影响的前提下，更加合理利用内存缓存，快速将虚拟机页面迁移到目的服务器，从而节省物理资源；其二是如何通过更细粒度的资源管理方式实现更有针对性的迁移时机优化。基于 QEMU 虚拟机实现了该算法，多种不同应用负载下的实验结果表明，该算法能有效降低资源消耗和物理磁盘的负载，稳定且迅速地实现虚拟机的迁移。%Virtualisation technology provides users with highly available,dynamic,scalable and allocation-on-demand logic resources, while the virtual machine migration technology weakens the coupling degree between the physical and logical resources after the initial virtualised allocation of resource,which enables the construction of physical resources pool more flexible.However,there are three main difficulties in existing solutions of virtual machines migration:too many resources are wasted,the hard disks are overloaded,and the redundancy of migration data,they greatly constrict the usability and stability of live migration of virtual machines.In the paper we propose a memory cache-based dynamic block migration algorithm,which focuses on two points:First,how to use the memory cache more reasonably to migrate the pages of virtual machine to the goal server rapidly on the premises of guaranteeing the migration performance not being apparently impacted so as to save physical resource;Secondly,how to
Gaussian curvature analysis allows for automatic block placement in multi-block hexahedral meshing.
Ramme, Austin J; Shivanna, Kiran H; Magnotta, Vincent A; Grosland, Nicole M
2011-10-01
Musculoskeletal finite element analysis (FEA) has been essential to research in orthopaedic biomechanics. The generation of a volumetric mesh is often the most challenging step in a FEA. Hexahedral meshing tools that are based on a multi-block approach rely on the manual placement of building blocks for their mesh generation scheme. We hypothesise that Gaussian curvature analysis could be used to automatically develop a building block structure for multi-block hexahedral mesh generation. The Automated Building Block Algorithm incorporates principles from differential geometry, combinatorics, statistical analysis and computer science to automatically generate a building block structure to represent a given surface without prior information. We have applied this algorithm to 29 bones of varying geometries and successfully generated a usable mesh in all cases. This work represents a significant advancement in automating the definition of building blocks.
Institute of Scientific and Technical Information of China (English)
Huoming Zhang; Wenjun Gao; Qiang Wang; Juan Jiang; Zhou Zhao
2012-01-01
At present,equivalent water depth truncated mooring system optimization design is regarded as the priority of hybrid model testing for deep sea platforms,and will replace the full depth system test in the future.Compared with the full depth system,the working depth and span are smaller in the truncated one,and the other characteristics maintain more consistency as well.In this paper,an inner turret moored floating production storage & offloading system (FPSO) which works at a water depth of 320m,was selected to be a research example while the truncated water depth was 80m.Furthermore,an improved non-dominated sorting genetic algorithm (INSGA-Ⅱ) was selected to optimally calculate the equivalent water depth truncated system,considering the stress condition of the total mooring system in both the horizontal and vertical directions,as well as the static characteristic similarity of the representative single mooring line.The results of numerical calculations indicate that the mathematical model is feasible,and the optimization method is fast and effective.
Wang, Xiaogang; Zhao, Daomu; Chen, Yixiang
2014-08-10
We present a study about information disclosure in phase-truncation-based cryptosystems. The main information of the original image to be encoded can be obtained by using a decryption key in the worst case. The problem cannot be thoroughly solved by imaginary part truncating, keeping the encryption keys as private keys, or applying different phase keys for different plaintexts during each encryption process as well as the phase modulation in the frequency domain. In order to eliminate the risk of unintended information disclosure, we further propose a nonlinear spatial and spectral encoding technique using a random amplitude mask (RAM). The encryption process involving two security layers can be fully controlled by a RAM. The spatial encoding of the plaintext images and the simultaneous encryption of the plaintext images and the encryption key greatly enhance the security of system, avoiding several attacks that have cracked the phase-truncation-based cryptosystems. Besides, the hybrid encryption system retains the advantage of a trap door one-way function of phase truncation. Numerical results have demonstrated the feasibility and effectiveness of the proposed encryption algorithm.
Truncated predictor feedback for time-delay systems
Zhou, Bin
2014-01-01
This book provides a systematic approach to the design of predictor based controllers for (time-varying) linear systems with either (time-varying) input or state delays. Differently from those traditional predictor based controllers, which are infinite-dimensional static feedback laws and may cause difficulties in their practical implementation, this book develops a truncated predictor feedback (TPF) which involves only finite dimensional static state feedback. Features and topics: A novel approach referred to as truncated predictor feedback for the stabilization of (time-varying) time-delay systems in both the continuous-time setting and the discrete-time setting is built systematically Semi-global and global stabilization problems of linear time-delay systems subject to either magnitude saturation or energy constraints are solved in a systematic manner Both stabilization of a single system and consensus of a group of systems (multi-agent systems) are treated in a unified manner by applying the truncated pre...
On truncated generalized Gibbs ensembles in the Ising field theory
Essler, F. H. L.; Mussardo, G.; Panfil, M.
2017-01-01
We discuss the implementation of two different truncated Generalized Gibbs Ensembles (GGE) describing the stationary state after a mass quench process in the Ising Field Theory. One truncated GGE is based on the semi-local charges of the model, the other on regularized versions of its ultra-local charges. We test the efficiency of the two different ensembles by comparing their predictions for the stationary state values of the single-particle Green’s function G(x)= of the complex fermion field \\psi (x) . We find that both truncated GGEs are able to recover G(x), but for a given number of charges the semi-local version performs better.
Inverse probability weighted Cox regression for doubly truncated data.
Mandel, Micha; de Uña-Álvarez, Jacobo; Simon, David K; Betensky, Rebecca A
2017-09-08
Doubly truncated data arise when event times are observed only if they fall within subject-specific, possibly random, intervals. While non-parametric methods for survivor function estimation using doubly truncated data have been intensively studied, only a few methods for fitting regression models have been suggested, and only for a limited number of covariates. In this article, we present a method to fit the Cox regression model to doubly truncated data with multiple discrete and continuous covariates, and describe how to implement it using existing software. The approach is used to study the association between candidate single nucleotide polymorphisms and age of onset of Parkinson's disease. © 2017, The International Biometric Society.
The Research for Compression Algorithm of Aerial Imagery
Directory of Open Access Journals (Sweden)
Zhiyong Peng
2013-06-01
Full Text Available In this study, the new method of the JPEG image compression algorithm with predictive coding algorithm combining was proposed, effectively eliminates redundant information of the sub-blocks and redundant information between the sub-blocks and sub-blocks. Achieved higher compression ratio compared to the JPEG compression algorithm and a good image quality.
The Stars and Gas in Outer Parts of Galaxy Disks : Extended or Truncated, Flat or Warped?
van der Kruit, P. C.; Funes, JG; Corsini, EM
2008-01-01
I review observations of truncations of stellar disks and models for their origin, compare observations of truncations in moderately inclined galaxies to those in edge-on systems and discuss the relation between truncations and H I-warps and their systematics and origin. Truncations are a common fea
Optimal Truncation in Ionization of hydrogen by Electron Impact
Institute of Scientific and Technical Information of China (English)
张程华; 牛英煜; 吴炜; 邱卫; 辛君丽; 王晓伟; 王京阳
2003-01-01
An analytic expression for the ionization amplitude of hydrogen by electron impact is found to contain a polynomial by an optimal truncation in an asymptotic series and a convergent series. The ionization amplitude, i.e., the transition matrix element on the energy shell, is decomposed into two parts: the structure-scattering factor and correlation factor, based on an approximation of the projectile plane wave in coplanar asymmetric geometries.The contribution of these factors to the triple differential cross section is evaluated using the method of optional truncation of asymptotic and convergent series.
Fringe integral equation method for a truncated grounded dielectric slab
DEFF Research Database (Denmark)
Jørgensen, Erik; Maci, S.; Toccafondi, A.
2001-01-01
The problem of scattering by a semi-infinite grounded dielectric slab illuminated by an arbitrary incident TMz polarized electric field is studied by solving a new set of “fringe” integral equations (F-IEs), whose functional unknowns are physically associated to the wave diffraction processes...... occurring at the truncation. The F-IEs are obtained by subtracting from the surface/surface integral equations pertinent to the truncated slab, an auxiliary set of equations obtained for the canonical problem of an infinite grounded slab illuminated by the same source. The F-IEs are solved by the method...
A Curious Truncation of N=4 Yang-Mills
Basu, A; Sethi, S; Basu, Anirban; Sethi, Savdeep
2004-01-01
The coupling constant dependence of correlation functions of BPS operators in N=4 Yang-Mills can be expressed in terms of integrated correlation functions. We approximate these integrated correlators by using a truncated OPE expansion. This leads to differential equations for the coupling dependence. When applied to a particular sixteen point correlator, the coupling dependence we find agrees with the corresponding amplitude computed via the AdS/CFT correspondence. We conjecture that this truncation becomes exact in the large N and large 't Hooft coupling limit.
Bayesian analysis of truncation errors in chiral effective field theory
Melendez, J.; Furnstahl, R. J.; Klco, N.; Phillips, D. R.; Wesolowski, S.
2016-09-01
In the Bayesian approach to effective field theory (EFT) expansions, truncation errors are derived from degree-of-belief (DOB) intervals for EFT predictions. By encoding expectations about the naturalness of EFT expansion coefficients for observables, this framework provides a statistical interpretation of the standard EFT procedure where truncation errors are estimated using the order-by-order convergence of the expansion. We extend and test previous calculations of DOB intervals for chiral EFT observables, examine correlations between contributions at different orders and energies, and explore methods to validate the statistical consistency of the EFT expansion parameter. Supported in part by the NSF and the DOE.
Truncated Long-Range Percolation on Oriented Graphs
van Enter, A. C. D.; de Lima, B. N. B.; Valesin, D.
2016-07-01
We consider different problems within the general theme of long-range percolation on oriented graphs. Our aim is to settle the so-called truncation question, described as follows. We are given probabilities that certain long-range oriented bonds are open; assuming that the sum of these probabilities is infinite, we ask if the probability of percolation is positive when we truncate the graph, disallowing bonds of range above a possibly large but finite threshold. We give some conditions in which the answer is affirmative. We also translate some of our results on oriented percolation to the context of a long-range contact process.
Institute of Scientific and Technical Information of China (English)
杨挺; 向文平; 王洪涛; 盆海波
2015-01-01
With the advent of large-scale regional interconnected power grids as well as the utilization of the phasor measurement unit (PMU) and intelligent electronic devices (IEDs) in electrical power systems becoming more common, the analysis of petabyte sized data has become a primary focus in research communities. Cloud computing, which is a form of data storage on the Internet, increases the possibility to implement a tool for analyzing large datasets in power systems and parallel computing in complex grids. This paper proposed a new optimized method for the mapping of block bordered diagonal form (BBDF) and decomposition-coordination algorithms for cloud computing data centers. Based on the computational complexity of coupling between tasks, the decomposition-coordination algorithm had been split to perform different tasks, and to judge the amount of calculation. A binding placement algorithm also was presented as a method to map the tasks into virtual machines (VM). A new energy-efficient Bin-Packing model was built for the final mapping step, which is the process of transferring the data from the VMs to the data centers. This will be performed while ensuring that the constraints of CPU and memory utilization rate are in check. IEEE 118 node grid model, as well as two large-scale power systems, which utilizes 538 and 1133 nodes systems, were calculated through the CloudSim platform. The results suggest that data centers using the virtual machine technology are more effective than the use of traditional parallel computing methods in terms of time and system energy consumption. In the IEEE 118 nodes system, the total processing time has reduced to 43.2%, and with the system size increasing, the 1133 nodes system experienced a 75.8%decrease.%随着超大规模区域互联电网的发展，智能电子设备和相量测量单元广泛应用，如何实现对所产生的PB级大数据的高速处理成为完成实时(超实时)计算的关键。云计
Circular block matching based video stabilization
Xu, Lidong; Fu, Fangwen; Lin, Xinggang
2005-07-01
Video sequences captured by handheld digital camera need to be stabilized to eliminate the tiresome effects caused by camera"s undesirable shake or jiggle. The key issue of video stabilization is to estimate the global motion parameters between two successive frames. In this paper, a novel circular block matching algorithm is proposed to estimate the global motion parameters. This algorithm can deal with not only translational motion but even large rotational motion. For an appointed circular block in current frame, a four-dimensional rotation invariant feature vector is firstly extracted from it and used to judge if it is an effective block. Then the rotation invariant features based circular block matching process is performed to find the best matching blocks in reference frame for those effective blocks. With the matching results of any two effective blocks, a two-dimensional motion model is constructed to produce one group of frame motion parameters. A statistical method is proposed to calculate the estimated global motion parameters with all groups of global motion parameters. Finally, using the estimated motion parameters as the initial values, an iteration algorithm is introduced to obtain the refined global motion parameters. The experimental results show that the proposed algorithm is excellent in stabilizing frames with even burst global translational and rotational motions.
Block Toeplitz Determinants, Constrained KP and Gelfand-Dickey Hierarchies
Energy Technology Data Exchange (ETDEWEB)
Cafasso, M. [SISSA-International School for Advanced Studies (Italy)], E-mail: cafasso@sissa.it
2008-02-15
We propose a method for computing any Gelfand-Dickey {tau} function defined on the Segal-Wilson Grassmannian manifold as the limit of block Toeplitz determinants associated to a certain class of symbols W(t,z). Also truncated block Toeplitz determinants associated to the same symbols are shown to be {tau} functions for rational reductions of KP. Connection with Riemann-Hilbert problems is investigated both from the point of view of integrable systems and block Toeplitz operator theory. Examples of applications to algebro-geometric solutions are given.
The truncation of stellar discs : The magnetic hypothesis
Battaner, E; Florido, E; Jimenez-Vicente, J
2002-01-01
We propose a hypothesis of the truncation of stellar discs based on the magnetic model of the rotation curve of spiral galaxies. Once the disc had formed and acquired its present structure, approximately, three balanced forces were acting on the initial gas: gravity and magnetic forces, inwards, and
The truncated Second Main Theorem and uniqueness theorems
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
In this paper, we first establish a truncated Second Main Theorem for algebraically nondegenerate holomorphic mappings from the complex plane into a complex projective variety V intersecting hypersurfaces. We then prove some uniqueness results for meromorphic mappings. The result of Demailly about a partial solution to the Fujita’s conjecture is used.
Measuring a truncated disk in Aquila X-1
DEFF Research Database (Denmark)
King, Ashley L.; Tomsick, John A.; Miller, Jon M.
2016-01-01
We present NuSTAR and Swift observations of the neutron star Aquila X-1 during the peak of its 2014 July outburst. The spectrum is soft with strong evidence for a broad Fe Kα line. Modeled with a relativistically broadened reflection model, we find that the inner disk is truncated with an inner r...
Successive superalgebraic truncations from the four-dimensional maximal supergravity
Kim, C H; Kim, K Y; Kim, Y; Kim, Chang Ho; Park, Young Jai; Kim, Kee Yong; Kim, Yongduk
1994-01-01
We study the four-dimensional {\\it N}=8 maximal supergravity in the context of Lie superalgebra SU(8/1). All possible successive superalgebraic truncations from four-dimensional {\\it N}=8 theory to {\\it N}=7, 6, \\cdots, 1 supergravity theories are systematically realized as sub-superalgebra chains of SU(8/1) by using the Kac-Dynkin weight techniques.
Truncated hemoglobins in actinorhizal nodules of Datisca glomerata
Pawlowski, K.; Jacobsen, K.R.; Alloisio, N.; Denison, R.F.; Klein, M.; Tjepkema, J.D.; Winzer, T.; Sirrenberg, A.; Guan, C.; Berry, A.M.
2007-01-01
Three types of hemoglobins exist in higher plants, symbiotic, non-symbiotic, and truncated hemoglobins. Symbiotic (class II) hemoglobins play a role in oxygen supply to intracellular nitrogen-fixing symbionts in legume root nodules, and in one case ( Parasponia Sp.), a non-symbiotic (class I) hemogl
Truncation Method for Operators with Disconnected Essential Spectrum
Indian Academy of Sciences (India)
M N N Namboodiri
2002-02-01
In this short paper, the usage of truncation method to get information about essential spectrum of bounded as well as semi-bounded linear operators on separable Hilbert spaces, is investigated. In addition to this, the problem of predicting the gaps in the essential spectrum of self-adjoint operators, linear algebraically is also considered.
Truncated hemoglobins in actinorhizal nodules of Datisca glomerata
Pawlowski, K.; Jacobsen, K.R.; Alloisio, N.; Denison, R.F.; Klein, M.; Tjepkema, J.D.; Winzer, T.; Sirrenberg, A.; Guan, C.; Berry, A.M.
2007-01-01
Three types of hemoglobins exist in higher plants, symbiotic, non-symbiotic, and truncated hemoglobins. Symbiotic (class II) hemoglobins play a role in oxygen supply to intracellular nitrogen-fixing symbionts in legume root nodules, and in one case ( Parasponia Sp.), a non-symbiotic (class I)
Scavenger receptor AI/II truncation, lung function and COPD
DEFF Research Database (Denmark)
Thomsen, M; Nordestgaard, B G; Tybjaerg-Hansen, A
2011-01-01
The scavenger receptor A-I/II (SRA-I/II) on alveolar macrophages is involved in recognition and clearance of modified lipids and inhaled particulates. A rare variant of the SRA-I/II gene, Arg293X, truncates the distal collagen-like domain, which is essential for ligand recognition. We tested whet...
On Estimating the Parameters of Truncated Trivariate Normal Distributions
Directory of Open Access Journals (Sweden)
M. N. Bhattacharyya
1969-07-01
Full Text Available Maximum likehood estimates of the parameters of a trivariate normal distribution, with single truncation on two-variates, have been derived in this paper. The information matrix has also been given from which the asymptotic variances and covariances might be obtained for the estimates of the parameters of the restricted variables. Numerical examples have been worked out.
Lindemann, Maike E; Oehmigen, Mark; Blumhagen, Jan O; Gratz, Marcel; Quick, Harald H
2017-09-01
The objective of this study was to introduce and evaluate a method for MR-based attenuation and truncation correction in phantom and patient measurements to improve PET quantification in PET/MR hybrid imaging. The fully MR-based method HUGE (B0 Homogenization using gradient enhancement) provides field-of-view extension in MR imaging, which can be used for truncation correction and improved PET quantification in PET/MR hybrid imaging. The HUGE method in this recent implementation is combined with continuously moving table data acquisition to provide a seamless nontruncated whole-body data set of the outer patient contours to complete the established standard MR-based Dixon-VIBE data for attenuation correction. The method was systematically evaluated in NEMA standard phantom experiments to investigate the impact of HUGE truncation correction on PET quantification. The method was then applied to 24 oncologic patients in whole-body PET/MR hybrid imaging. The impact of MR-based truncation correction with HUGE on PET data was compared to the impact of the established PET-based MLAA algorithm for contour detection. In phantom and in all patient measurements, the standard Dixon-VIBE attenuation correction data show geometric distortions and signal truncations at the edges of the MR imaging field-of-view. In contrast, the Dixon-VIBE-based attenuation correction data additionally extended by applying HUGE shows significantly less distortion and truncations and due to the continuously moving table acquisition robustly provides smooth outer contours of the patient arms. In the investigated patient cases, MLAA frequently showed an overestimation of arm volume and associated artifacts limiting contour detection. When applying HUGE, an average relative increase in SUVmean in patients' lesion of 4.2% and for MLAA of 4.6% were measured, when compared to standard Dixon-VIBE only. In specific lesions maximal differences in SUVmean up to 13% for HUGE and 14% for MLAA were measured
Upper-truncated Power Laws in Natural Systems
Burroughs, S. M.; Tebbens, S. F.
- When a cumulative number-size distribution of data follows a power law, the data set is often considered fractal since both power laws and fractals are scale invariant. Cumulative number-size distributions for data sets of many natural phenomena exhibit a ``fall-off '' from a power law as the measured object size increases. We demonstrate that this fall-off is expected when a cumulative data set is truncated at large object size. We provide a generalized equation, herein called the General Fitting Function (GFF), that describes an upper-truncated cumulative number-size distribution based on a power law. Fitting the GFF to a cumulative number-size distribution yields the coefficient and exponent of the underlying power law and a parameter that characterizes the upper truncation. Possible causes of upper truncation include data sampling limitations (spatial or temporal) and changes in the physics controlling the object sizes. We use the GFF method to analyze four natural systems that have been studied by other approaches: forest fire area in the Australian Capital Territory; fault offsets in the Vernejoul coal field; hydrocarbon volumes in the Frio Strand Plain exploration play; and fault lengths on Venus. We demonstrate that a traditional approach of fitting a power law directly to the cumulative number-size distribution estimates too negative an exponent for the power law and overestimates the fractal dimension of the data set. The four systems we consider are well fit by the GFF method, suggesting they have properties characterized by upper-truncated power laws.
Shin, H; Yoo, Y H
2003-01-01
Strain fields in truncated and un-truncated InAs quantum dots with the same height and base length have been compared numerically when the dots are vertically stacked in a GaAs matrix at various stacking periods. The compressive hydrostatic strain in truncated dots decreases slightly as compared with the un-truncated dots without regard to the stacking period studied. However, the reduction in tensile biaxial strain, compressive radial strain and tensile axial strain was salient in the truncated dot and the reduction increased with decreasing stacking period. From such changes in strain, changes in the band gap and related properties are anticipated.
3D spherical-cap fitting procedure for (truncated) sessile nano- and micro-droplets & -bubbles.
Tan, Huanshu; Peng, Shuhua; Sun, Chao; Zhang, Xuehua; Lohse, Detlef
2016-11-01
In the study of nanobubbles, nanodroplets or nanolenses immobilised on a substrate, a cross-section of a spherical cap is widely applied to extract geometrical information from atomic force microscopy (AFM) topographic images. In this paper, we have developed a comprehensive 3D spherical-cap fitting procedure (3D-SCFP) to extract morphologic characteristics of complete or truncated spherical caps from AFM images. Our procedure integrates several advanced digital image analysis techniques to construct a 3D spherical-cap model, from which the geometrical parameters of the nanostructures are extracted automatically by a simple algorithm. The procedure takes into account all valid data points in the construction of the 3D spherical-cap model to achieve high fidelity in morphology analysis. We compare our 3D fitting procedure with the commonly used 2D cross-sectional profile fitting method to determine the contact angle of a complete spherical cap and a truncated spherical cap. The results from 3D-SCFP are consistent and accurate, while 2D fitting is unavoidably arbitrary in the selection of the cross-section and has a much lower number of data points on which the fitting can be based, which in addition is biased to the top of the spherical cap. We expect that the developed 3D spherical-cap fitting procedure will find many applications in imaging analysis.
Design Optimization for a Truncated Catenary Mooring System for Scale Model Test
Directory of Open Access Journals (Sweden)
Climent Molins
2015-11-01
Full Text Available One of the main aspects when testing floating offshore platforms is the scaled mooring system, particularly with the increased depths where such platforms are intended. The paper proposes the use of truncated mooring systems to emulate the real mooring system by solving an optimization problem. This approach could be an interesting option when the existing testing facilities do not have enough available space. As part of the development of a new spar platform made of concrete for Floating Offshore Wind Turbines (FOWTs, called Windcrete, a station keeping system with catenary shaped lines was selected. The test facility available for the planned experiments had an important width constraint. Then, an algorithm to optimize the design of the scaled truncated mooring system using different weights of lines was developed. The optimization process adjusts the quasi-static behavior of the scaled mooring system as much as possible to the real mooring system within its expected maximum displacement range, where the catenary line provides the restoring forces by its suspended line length.
Scale factor correction for Gaussian beam truncation in second moment beam radius measurements
Hofer, Lucas R.; Dragone, Rocco V.; MacGregor, Andrew D.
2017-04-01
Charged-couple devices (CCD) and complementary metal oxide semiconductor (CMOS) image sensors, in conjunction with the second moment radius analysis method, are effective tools for determining the radius of a laser beam. However, the second moment method heavily weights sensor noise, which must be dealt with using a thresholding algorithm and a software aperture. While these noise reduction methods lower the random error due to noise, they simultaneously generate systematic error by truncating the Gaussian beam's edges. A scale factor that is invariant to beam ellipticity and corrects for the truncation of the Gaussian beam due to thresholding and the software aperture has been derived. In particular, simulations showed an order of magnitude reduction in measured beam radius error when using the scale factor-irrespective of beam ellipticity-and further testing with real beam data demonstrated that radii corrected by the scale factor are independent of the noise reduction parameters. Thus, through use of the scale factor, the accuracy of beam radius measurements made with a CCD or CMOS sensor and the second moment are significantly improved.
Institute of Scientific and Technical Information of China (English)
ZENG Xiaomei; SHI Xiaobing; SHEN Yungang
2004-01-01
The ε subunit of the chloroplast ATP synthase and the truncated ε mutants which lack some amino acid residues from the N-terminus or C-terminus were overexpressed in E. coli. When the ε subunit or the truncated ε proteins was added to the spinach chloroplast suspension, both the intensity of the fast phase of millisecond delayed light emission (ms-DLE) and the cyclic and noncyclic photophosphorylation activity of chloroplast were enhanced. With an increase in the number of residues deleted from the N-terminus, the enhancement effect of the N-terminal truncated proteins decreased gradually. For the C-terminal truncated proteins, the enhancement effect increased gradually with an increase in the number of residues deleted from the C-terminus. Besides, the ATP synthesis activity of ε-deficient membrane reconstituted with the ε subunit or the truncated ε proteins was compared. The ATP synthesis activity of reconstituted membrane with the N-terminal truncated proteins decreased gradually as the number of residues deleted from the N-terminus increased. For the C-terminal truncated proteins, the ATP synthesis activity of reconstituted membrane increased gradually with an increase in the number of residues deleted from the C-terminus, but was still lower than that of the wild type ε protein. These results suggested that: (a) the N-terminal domain of the ε subunit of the chloroplast ATP synthase could affect the ATP synthesis activity of ATP synthase by regulating the efficiency of blocking proton leakage of ε subunit; and (b) the C-terminal domain of the ε subunit of the chloroplast ATP synthase had a subtle function in modulating the ATP synthesis ability of ATP synthase.
An improved form of the ELMS algorithm
Institute of Scientific and Technical Information of China (English)
Gao Ying; Xie Shengli
2005-01-01
ELMS algorithm is the first two-channel adaptive filtering algorithm that takes into account the cross-correlation between the two input signals. The algorithm does not preprocess input signals, so it does not degrade the quality of the speech. However, a lot of computer simulation results show that ELMS algorithm has a bad performance. The ELMS algorithm is analyzed firstly, then a new algorithm is presented by modifying the block matrix used in ELMS algorithm to approximate input signals self-correlation matrix. The computer simulation results indicate that the improved algorithm has a better behavior than the ELMS algorithm.
Mixed Platoon Flow Dispersion Model Based on Speed-Truncated Gaussian Mixture Distribution
Directory of Open Access Journals (Sweden)
Weitiao Wu
2013-01-01
Full Text Available A mixed traffic flow feature is presented on urban arterials in China due to a large amount of buses. Based on field data, a macroscopic mixed platoon flow dispersion model (MPFDM was proposed to simulate the platoon dispersion process along the road section between two adjacent intersections from the flow view. More close to field observation, truncated Gaussian mixture distribution was adopted as the speed density distribution for mixed platoon. Expectation maximum (EM algorithm was used for parameters estimation. The relationship between the arriving flow distribution at downstream intersection and the departing flow distribution at upstream intersection was investigated using the proposed model. Comparison analysis using virtual flow data was performed between the Robertson model and the MPFDM. The results confirmed the validity of the proposed model.
Lee, S M; Yun, M J; Cha, B H; Lee, J M
1999-01-01
We designed and analyzed a new Nd:YAG laser which employs a combination of a truncated compound parabolic concentrator (CPC) and a diffusive optical pump cavity for pumping with a stacked diode array. A design code based on a ray-tracing algorithm was developed to analyze the Nd:YAG laser system. The optimum truncated CPC profile was determined from analyses of the dependences of the pump-beam distribution and the total absorbed power in the laser crystal upon the acceptance angle and the slit width of the CPC. In addition, the analyses show the importance of the acceptance angle in designing an efficient laser system with a truncated CPC. Using conservative design parameters, the design code predicted a Nd:YAG laser output of 130 W with a corresponding optical slope efficiency of 44%.
Ultrasound guided supraclavicular block.
LENUS (Irish Health Repository)
Hanumanthaiah, Deepak
2013-09-01
Ultrasound guided regional anaesthesia is becoming increasingly popular. The supraclavicular block has been transformed by ultrasound guidance into a potentially safe superficial block. We reviewed the techniques of performing supraclavicular block with special focus on ultrasound guidance.
A POT1 mutation implicates defective telomere end fill-in and telomere truncations in Coats plus.
Takai, Hiroyuki; Jenkinson, Emma; Kabir, Shaheen; Babul-Hirji, Riyana; Najm-Tehrani, Nasrin; Chitayat, David A; Crow, Yanick J; de Lange, Titia
2016-04-01
Coats plus (CP) can be caused by mutations in the CTC1 component of CST, which promotes polymerase α (polα)/primase-dependent fill-in throughout the genome and at telomeres. The cellular pathology relating to CP has not been established. We identified a homozygous POT1 S322L substitution (POT1(CP)) in two siblings with CP. POT1(CP)induced a proliferative arrest that could be bypassed by telomerase. POT1(CP)was expressed at normal levels, bound TPP1 and telomeres, and blocked ATR signaling. POT1(CP)was defective in regulating telomerase, leading to telomere elongation rather than the telomere shortening observed in other telomeropathies. POT1(CP)was also defective in the maintenance of the telomeric C strand, causing extended 3' overhangs and stochastic telomere truncations that could be healed by telomerase. Consistent with shortening of the telomeric C strand, metaphase chromosomes showed loss of telomeres synthesized by leading strand DNA synthesis. We propose that CP is caused by a defect in POT1/CST-dependent telomere fill-in. We further propose that deficiency in the fill-in step generates truncated telomeres that halt proliferation in cells lacking telomerase, whereas, in tissues expressing telomerase (e.g., bone marrow), the truncations are healed. The proposed etiology can explain why CP presents with features distinct from those associated with telomerase defects (e.g., dyskeratosis congenita).
Various truncations in Painlevé analysis of PDEs
Conte, R
1998-01-01
The ``truncation procedure'' initiated by Weiss et al. is best understood as a Darboux transformation. If it leads to the Lax pair of the PDE under study, the Bäcklund transformation follows by an elimination, thus proving the integrability. We present the state of the art of this powerful technique. The easy situations were all handled by the WTC one-family truncation and its homographically invariant version. An updated version of this method has been recently developed, which is now able to handle the Kaup-Kupershmidt and Tzitzéica equations. It incorporates a new feature, namely the distinction between two entire functions usually mingled, which are shown to be linked by formulae established by Gambier for his classification.
Kernel conditional quantile estimator under left truncation for functional regressors
Directory of Open Access Journals (Sweden)
Nacéra Helal
2016-01-01
Full Text Available Let \\(Y\\ be a random real response which is subject to left-truncation by another random variable \\(T\\. In this paper, we study the kernel conditional quantile estimation when the covariable \\(X\\ takes values in an infinite-dimensional space. A kernel conditional quantile estimator is given under some regularity conditions, among which in the small-ball probability, its strong uniform almost sure convergence rate is established. Some special cases have been studied to show how our work extends some results given in the literature. Simulations are drawn to lend further support to our theoretical results and assess the behavior of the estimator for finite samples with different rates of truncation and sizes.
The truncation of stellar discs the magnetic hypothesis
Battaner, E
2002-01-01
We propose a hypothesis of the truncation of stellar discs based on the magnetic model of the rotation curve of spiral galaxies. Once the disc had formed and acquired its present structure, approximately, three balanced forces were acting on the initial gas: gravity and magnetic forces, inwards, and centrifugal force. When stars are formed from this gas, the magnetic force is suddenly suppressed. Gravitation alone cannot retain the newly-formed stars and at birth places beyond a certain galactocentric radius they escape to intergalactic space. This radius is the so-called ``truncation radius'', which is predicted to be at about 4-5 disc radial scale lengths, in promising agreement with observations.
Hamiltonian truncation approach to quenches in the Ising field theory
Rakovszky, Tibor; Collura, Mario; Kormos, Márton; Takács, Gábor
2016-01-01
In contrast to lattice systems where powerful numerical techniques such as matrix product state based methods are available to study the non-equilibrium dynamics, the non-equilibrium behaviour of continuum systems is much harder to simulate. We demonstrate here that Hamiltonian truncation methods can be efficiently applied to this problem, by studying the quantum quench dynamics of the 1+1 dimensional Ising field theory using a truncated free fermionic space approach. After benchmarking the method with integrable quenches corresponding to changing the mass in a free Majorana fermion field theory, we study the effect of an integrability breaking perturbation by the longitudinal magnetic field. In both the ferromagnetic and paramagnetic phases of the model we find persistent oscillations with frequencies set by the low-lying particle excitations even for moderate size quenches. In the ferromagnetic phase these particles are the various non-perturbative confined bound states of the domain wall excitations, while...
A Semidefinite Approach for Truncated K-Moment Problem
Helton, J William
2011-01-01
A truncated moment sequence (tms) of degree d is a vector indexed by monomials whose degree is at most d. Let K be a semialgebraic set.The truncated K-moment problem (TKMP) is: when does a tms y admit a positive Borel measure supported? This paper proposes a semidefinite programming (SDP) approach for solving TKMP. When K is compact, we get the following results: whether a tms y of degree d admits a K-measure or notcan be checked via solving a sequence of SDP problems; when y admits no K-measure, a certificate will be given; when y admits a K-measure, a representing measure for y would be obtained from solving the SDP under some necessary and some sufficient conditions. Moreover, we also propose a practical SDP method for finding flat extensions, which in our numerical experiments always finds a finitely atomic representing measure for a tms when it admits one.
Dynamics of Large-Truncated Mooring Systems Coupled with A Catenary Moored Semi-Submersible
Institute of Scientific and Technical Information of China (English)
徐胜; 嵇春艳
2014-01-01
With the floating structures pushing their activities to the ultra-deep water, model tests have presented a challenge due to the limitation of the existing wave basins. Therefore, the concept of truncated mooring system is implemented to replace the full depth mooring system in the model tests, which aims to have the same dynamic responses as the full depth system. The truncated mooring system plays such a significant role that extra attention should be paid to the mooring systems with large truncation factor. Three different types of large truncation factor mooring system are being employed in the simulations, including the homogenously truncated mooring system, non-homogenously truncated mooring system and simplified truncated mooring system. A catenary moored semi-submersible operating at 1000 m water depth is presented. In addition, truncated mooring systems are proposed at the truncated water depth of 200 m. In order to explore the applicability of these truncated mooring systems, numerical simulations of the platform’s surge free decay interacting with three different styles of truncated mooring systems are studied in calm water. Furthermore, the mooring-induced damping of the truncated mooring systems is simulated in the regular wave. Finally, the platform motion responses and mooring line dynamics are simulated in irregular wave. All these simulations are implemented by employing full time domain coupled dynamic analysis, and the results are compared with those of the full depth simulations in the same cases. The results show that the mooring-induced damping plays a significant role in platform motion responses, and all truncated mooring systems are suitable for model tests with appropriate truncated mooring line diameters. However, a large diameter is needed for simplified truncated mooring lines. The suggestions are given to the selection of truncated mooring system for different situations as well as to the truncated mooring design criteria.
Bounded symbols and reproducing kernel thesis for truncated Toeplitz operators
Baranov, A; Fricain, Emmanuel; Mashreghi, Javad; Timotin, Dan
2009-01-01
Compressions of Toeplitz operators to coinvariant subspaces of $H^2$ are called \\emph{truncated Toeplitz operators}. We study two questions related to these operators. The first, raised by Sarason, is whether boundedness of the operator implies the existence of a bounded symbol; the second is the reproducing kernel thesis. We show that in general the answer to the first question is negative, and we exhibit some classes of spaces for which the answers to both questions are positive.
BALANCED TRUNCATED MODELS OF RC INTERCONNECT CIRCUITS AND THEIR SIMULATION
Institute of Scientific and Technical Information of China (English)
Yuan Baoguo; Wang Ben; Wang Shengguo
2005-01-01
The Balanced Truncation Method (BTM) is applied to an even distributed RC interconnect case by using Wang's closed-forms of even distributed RC interconnect models. The results show that extremely high order RC interconnect can be high-accurately approximated by only third order balanced model. Related simulations are executed in both time domain and frequency domain. The results may be applied to VLSI interconnect model reduction and design.
On consistent truncations in ${\\cal N}=2^*$ holography
Balasubramanian, Venkat
2013-01-01
Although Pilch-Warner (PW) gravitational renormalization group flow [arXiv:hep-th/0004063] passes a number of important consistency checks to be identified as a holographic dual to a large-$N$ $SU(N)$ ${\\cal N}=2^*$ supersymmetric gauge theory, it fails to reproduce the free energy of the theory on $S^4$, computed with the localization techniques. This disagreement points to the existence of a larger dual gravitational consistent truncation, which in the gauge theory flat-space limit reduces to a PW flow. Such truncation was recently identified by Bobev-Elvang-Freedman-Pufu (BEFP) [arXiv:1311.1508]. Additional bulk scalars of the BEFP gravitation truncation might lead to destabilization of the finite-temperature deformed PW flows, and thus modify the low-temperature thermodynamics and hydrodynamics of ${\\cal N} =2^*$ plasma. We compute the quasinormal spectrum of these bulk scalar fields in the thermal PW flows and demonstrate that these modes do not condense, as long as the masses of the ${\\cal N}=2^*$ hyper...
Evidence for Truncated Exponential Probability Distribution of Earthquake Slip
Thingbaijam, Kiran K. S.
2016-07-13
Earthquake ruptures comprise spatially varying slip on the fault surface, where slip represents the displacement discontinuity between the two sides of the rupture plane. In this study, we analyze the probability distribution of coseismic slip, which provides important information to better understand earthquake source physics. Although the probability distribution of slip is crucial for generating realistic rupture scenarios for simulation-based seismic and tsunami-hazard analysis, the statistical properties of earthquake slip have received limited attention so far. Here, we use the online database of earthquake source models (SRCMOD) to show that the probability distribution of slip follows the truncated exponential law. This law agrees with rupture-specific physical constraints limiting the maximum possible slip on the fault, similar to physical constraints on maximum earthquake magnitudes.We show the parameters of the best-fitting truncated exponential distribution scale with average coseismic slip. This scaling property reflects the control of the underlying stress distribution and fault strength on the rupture dimensions, which determines the average slip. Thus, the scale-dependent behavior of slip heterogeneity is captured by the probability distribution of slip. We conclude that the truncated exponential law accurately quantifies coseismic slip distribution and therefore allows for more realistic modeling of rupture scenarios. © 2016, Seismological Society of America. All rights reserverd.
Diffusive low optical depth particle disks truncated by planets
Quillen, Alice C
2008-01-01
Two dimensional particle disks in proximity to a planet are numerically integrated to determine when a planet in a circular orbit can truncate a particle disk. Collisions are treated by giving each particle a series of velocity perturbations during the integration. We estimate the mass of a planet required to truncate a particle disk as a function of collision rate, related to the disk optical depth, and velocity perturbation size, related to the disk velocity dispersion. We find that for particle disks in the regime estimated for debris disks, a Neptune mass planet is sufficiently massive to truncate the disk. If both the velocity dispersion and the disk optical depth are low (dispersion less than approximately 0.02 in units of circular motion, and optical depth less than 10^-4) then an Earth mass planet suffices. We find that the disk is smooth and axisymmetric unless the velocity perturbation is small and the planet mass is of order or greater than a Neptune mass in which case azimuthal structure is seen n...
Near infrared observations of the truncation of stellar disks
Florido, E; Guijarro, A; Garzón, F; Jiménez-Vicente, J; Florido, Estrella; Battaner, Eduardo; Guijarro, Ana; Garzon, Francisco; Jimenez-Vicente, Jorge
2001-01-01
We present a first study of truncation of the stellar disks of spiral galaxies in the near infrared. Observations of NGC4013, NGC4217, NGC6504 and NGC5981 were made with the CAIN NIR camera on the CST in Tenerife. This wavelength range provides the best description of the phenomenon, not only because extinction effects are minimized, but also because the distribution of the old stellar population is directly obtained. The four galaxies are edge-on and an inversion method was developed to obtain the deprojected profiles. We did not assume any model of the different galactic components. The ``truncation curve'', i.e. T(R)= mu(R)- mu_{D}(R), where mu is the actual surface brightness in mag/arcsec^2 and mu_{D} the exponential disk surface brightness, has been obtained with unprecedented precision. It is suggested that T(R) is proportional to (R_{t}-R)^{-1}, where R_{t} is the truncation radius, i.e. the radius beyond which no star is observed.
Enhancing the strength of an optical trap by truncation.
Directory of Open Access Journals (Sweden)
Vanessa R M Rodrigues
Full Text Available Optical traps (tweezers are beginning to be used with increasing efficacy in diverse studies in the biological and biomedical sciences. We report here results of a systematic study aimed at enhancing the efficiency with which dielectric (transparent materials can be optically trapped. Specifically, we investigate how truncation of the incident laser beam affects the strength of an optical trap in the presence of a circular aperture. Apertures of various sizes have been used by us to alter the beam radius, thereby changing the effective numerical aperture and intensity profile. We observe significant enhancement of the radial and axial trap stiffness when an aperture is used to truncate the beam compared to when no aperture was used, keeping incident laser power constant. Enhancement in trap stiffness persists even when the beam intensity profile is modulated. The possibility of applying truncation to multiple traps is explored; to this end a wire mesh is utilized to produce multiple trapping that also alters the effective numerical aperture. The use of a mesh leads to reduction in trap stiffness compared to the case when no wire mesh is used. Our findings lead to a simple-to-implement and inexpensive method of significantly enhancing optical trapping efficiency under a wide range of circumstances.
Phien, Ho N; Vidal, Guifré
2014-01-01
We propose an environment recycling scheme to speed up a class of tensor network algorithms that produce an approximation to the ground state of a local Hamiltonian by simulating an evolution in imaginary time. Specifically, we consider the time-evolving block decimation (TEBD) algorithm applied to infinite systems in 1D and 2D, where the ground state is encoded, respectively, in a matrix product state (MPS) and in a projected entangled-pair state (PEPS). An important ingredient of the TEBD algorithm (and a main computational bottle-neck, especially with PEPS in 2D) is the computation of the so-called environment, which is used to determine how to optimally truncate the bond indices of the tensor network so that their dimension is kept constant. In current algorithms, the environment is computed at each step of the imaginary time evolution, to account for the changes that the time evolution introduces in the many-body state represented by the tensor network. Our key insight is that close to convergence, most ...
Exploring Energy Efficiency of Lightweight Block Ciphers
DEFF Research Database (Denmark)
Banik, Subhadeep; Bogdanov, Andrey; Regazzoni, Francesco
2016-01-01
lightweight block ciphers, and thereby try to predict the optimal value of r at which an r-round unrolled architecture for a cipher is likely to be most energy efficient. We also try to relate our results to some physical design parameters like the signal delay across a round and algorithmic parameters like......In the last few years, the field of lightweight cryptography has seen an influx in the number of block ciphers and hash functions being proposed. One of the metrics that define a good lightweight design is the energy consumed per unit operation of the algorithm. For block ciphers, this operation...... is the encryption of one plaintext. By studying the energy consumption model of a CMOS gate, we arrive at the conclusion that the energy consumed per cycle during the encryption operation of an r-round unrolled architecture of any block cipher is a quadratic function in r. We then apply our model to 9 well known...
Algorithms in combinatorial design theory
Colbourn, CJ
1985-01-01
The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs, Latin squares and their variants, pairwise balanced designs and projective planes and related geometries.
Likins, P.; Ohkami, Y.; Wong, C.
1976-01-01
The paper examines the validity of the assumption that certain appendage-distributed (modal) coordinates can be truncated from a system model without unacceptable degradation of fidelity in hybrid coordinate dynamic analysis for attitude control of spacecraft with flexible appendages. Alternative truncation criteria are proposed and their interrelationships defined. Particular attention is given to truncation criteria based on eigenvalues, eigenvectors, and controllability and observability. No definitive resolution of the problem is advanced, and exhaustive study is required to obtain ultimate truncation criteria.
Fitting and goodness-of-fit test of non-truncated and truncated power-law distributions
Corral, Alvaro
2012-01-01
Power-law distributions contain precious information about a large variety of processes in geoscience and elsewhere. Although there are sound theoretical grounds for these distributions, the empirical evidence in favor of power laws has been traditionally weak. Recently, Clauset et al. have proposed a systematic method to find over which range (if any) a certain distribution behaves as a power law. However, their method has been found to fail, in the sense that true (simulated) power-law tails are not recognized as such in some instances, and then the power-law hypothesis is rejected. Moreover, the method does not work well when extended to power-law distributions with an upper truncation. We explain in detail a similar but alternative procedure, valid for truncated as well as for non-truncated power-law distributions, based in maximum likelihood estimation, the Kolmogorov-Smirnov goodness-of-fit test, and Monte Carlo simulations. An overview of the main concepts as well as a recipe for their practical implem...
一种改进的基于后处理去除块效应算法%An Improved Algorithm for Reducing Blocking Effects Based on Post-processing
Institute of Scientific and Technical Information of China (English)
杨弋; 王冠宇
2012-01-01
In the compression system based on DCT(Discrete Cosine Transform),the DCT is based on the block.Images are first broken down into 8×8 pixels pieces,then it gets 64 DCT coefficients through DCT for each block.Since each block gets DCT respectively,the correlation between blocks are ignored,thus the "Blocking Effects".This paper proposes an improved method for reducing blocking effect based on post-processing.When the images are reconstructed,four modes are proposed for the corner of four blocks,including three frequency-related modes(smooth mode,non-smooth mode,and intermediate mode) and a corner mode.A low computational deblocking filter is then adopted for different mode,and images are reconstructed.Both visual effect and image quality are improved.%在基于DCT压缩编码系统中,DCT都是基于模块的。即首先将图像分成8×8的像素块,然后对每块进行DCT得到64个DCT系数。但由于是分别对每块进行DCT,块与块之间的相关性被忽略,导致所谓的＂块效应＂。文中提出了一种改进的基于后处理的去块效应方法。在图像重建时,首先在块与块之间提出了4种模式,包括了3个与频率相关的模式和4个块拐角处的拐角模式。然后对不同模式下采用低复杂度的去块效应滤波器,最后重建图像。不论是视觉效果还是图像质量都有所提升。
[Effectiveness of sympathetic block using various technics].
Weissenberg, W
1987-07-01
Blocking of sympathetic conduction aims at permanent or temporary elimination of those pain pathways conducted by the sympathetic nervous system. In order to provide an objective evaluation of sufficient blocking effect, earlier inquiries referred to parameters such as: (1) observation of clinical signs such as Horner's syndrome, Guttman's sign, anhidrosis, extended venous filling; (2) difference in skin temperature of at least 1.5 degrees C between blocked and unblocked side; (3) increase in amplitude of the pulse wave; and (4) depression of the psychogalvanic reflex (PGR) on the blocked side (Fig. 1). In clinical practice, these control parameters are effective because they are time-saving, technically simple, and highly evidential. Further parameters for evaluating sympathetic blockade are examination of hydrosis by means of color indicators such as bromocresol and ninhydrin, oscillometry, and plethysmography. The effectiveness of sympathetic blockade after stellate ganglion and sympathetic trunk blocks has been verified by various authors. In a clinical study, 16 patients were divided into four groups in order to test the effectiveness of sympathetic blockade after spinal anesthesia with 3 ml 0.75% bupivacaine (group I) and 4 ml 0.75% bupivacaine (group II) and after peridural anesthesia with 15 ml 0.75% bupivacaine (group III) and 20 ml 0.75% bupivacaine (group IV) by means of temperature difference, response of pulse wave amplitude and PGR between blocked lower and unblocked upper extremity, and sensory levels of block. The patients were classified as ASA I and II; their ages varied from 20 to 63 years.(ABSTRACT TRUNCATED AT 250 WORDS)
deepBlockAlign: a tool for aligning RNA-seq profiles of read block patterns
Ekstrøm, Claus T.; Stadler, Peter F.; Hoffmann, Steve; Gorodkin, Jan
2012-01-01
Motivation: High-throughput sequencing methods allow whole transcriptomes to be sequenced fast and cost-effectively. Short RNA sequencing provides not only quantitative expression data but also an opportunity to identify novel coding and non-coding RNAs. Many long transcripts undergo post-transcriptional processing that generates short RNA sequence fragments. Mapped back to a reference genome, they form distinctive patterns that convey information on both the structure of the parent transcript and the modalities of its processing. The miR-miR* pattern from microRNA precursors is the best-known, but by no means singular, example. Results: deepBlockAlign introduces a two-step approach to align RNA-seq read patterns with the aim of quickly identifying RNAs that share similar processing footprints. Overlapping mapped reads are first merged to blocks and then closely spaced blocks are combined to block groups, each representing a locus of expression. In order to compare block groups, the constituent blocks are first compared using a modified sequence alignment algorithm to determine similarity scores for pairs of blocks. In the second stage, block patterns are compared by means of a modified Sankoff algorithm that takes both block similarities and similarities of pattern of distances within the block groups into account. Hierarchical clustering of block groups clearly separates most miRNA and tRNA, and also identifies about a dozen tRNAs clustering together with miRNA. Most of these putative Dicer-processed tRNAs, including eight cases reported to generate products with miRNA-like features in literature, exhibit read blocks distinguished by precise start position of reads. Availability: The program deepBlockAlign is available as source code from http://rth.dk/resources/dba/. Contact: gorodkin@rth.dk; studla@bioinf.uni-leipzig.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:22053076
Reduction of Artifacts in Images from MR Truncated Data Using Singularity Spectrum Analysis
Institute of Scientific and Technical Information of China (English)
骆建华; 庄天戈
2000-01-01
In this paper, the theory of signal singularity spectrum analysis (SSA) is proposed. Using SSA theory, a new method is presented to reduce truncation artifacts in magnetic resonance (MR) image due to truncated spectrum data. In the scheme, after detecting signal singularity locations using wavelet analysis in spectrum domain, SSA mathematic model is constructed, where weight coefficients are determined by known truncated spectrum data. Then, the remainder of the truncated spectrum can be obtained using SSA. Experiment and simulation results show that the SSA method will produce fewer artifacts in MR image from truncated spectrum than existing methods.
Institute of Scientific and Technical Information of China (English)
KANG Xiao-Ping; L(U) Bai-Da
2006-01-01
@@ The analytical expression characterizing the propagation of nonparaxial truncated cosine-Gaussian (CoG) beams in free space is derived, and some special cases are discussed. The extended power in the bucket (PIB) is proposed to characterize the beam quality of nonparaxial truncated beams in the far field. It is shown that the extended PIB is applicable to nonparaxial truncated beams, and the PIB of nonparaxial truncated CoG beams depends on the decentred parameter, waist-width-to-wavelength ratio, truncation parameter, and bucket size chosen.
Solution superstructures: truncated cubeoctahedron structures of pyrogallol[4]arene nanoassemblies.
Kumari, Harshita; Kline, Steven R; Fowler, Drew A; Mossine, Andrew V; Deakyne, Carol A; Atwood, Jerry L
2014-01-04
Giant nanocapsules: the solution-phase structures of PgC1Ho and PgC3Ho have been investigated using in situ neutron scattering measurements. The SANS results show the presence of spherical nanoassemblies of radius 18.2 Å, which are larger than the previously reported metal-seamed PgC3 hexamers (radius = 10 Å). The spherical architectures conform to a truncated cubeoctahedron geometry, indicating formation of the first metal-containing pyrogallol[4]arene-based dodecameric nanoassemblies in solution.
Generalized beam quality factor of aberrated truncated Gaussian laser beams
CSIR Research Space (South Africa)
Mafusire, C
2011-07-01
Full Text Available factor of aberrated truncated Gaussian laser beams Cosmas Mafusire1,2 and Andrew Forbes1,2,* 1Council for Scientific and Industrial Research National Laser Centre, P.O. Box 395, Pretoria, South Africa 2School of Physics, University of Kwa... is verified experimentally by implementing aberrations as digital holograms in the laboratory. ? 2011 Optical Society of America OCIS codes: 140.3295, 080.1005, 120.5050. 1. INTRODUCTION The laser beam quality factor (M2) is a useful parameter...
Nonlinear Galerkin Optimal Truncated Low—dimensional Dynamical Systems
Institute of Scientific and Technical Information of China (English)
ChuijieWU
1996-01-01
In this paper,a new theory of constructing nonlinear Galerkin optimal truncated Low-Dimensional Dynamical Systems(LDDSs) directly from partial differential equations has been developed.Applying the new theory to the nonlinear Burgers' equation,it is shown that a nearly perfect LDDS can be gotten,and the initial-boundary conditions are automatically included in the optimal bases.The nonlinear Galerkin method does not have advantages within the optimization process,but it can significantly improve the results,after the Galerkin optimal bases have been gotten.
Truncated cross-sectional average length of life
DEFF Research Database (Denmark)
Canudas-Romo, Vladimir; Guillot, Michel
2015-01-01
of developed countries. The truncated cross-sectional average length of life (TCAL) is a new measure that captures historical information about all cohorts present at a given moment and is not limited to countries with complete cohort mortality data. The value of TCAL depends on the rates used to complete...... the cohort series, but differences between TCALs of two populations remain similar irrespective of the data used to complete the cohort series. This result is illustrated by a comparison of TCALs for the US with those for Denmark, Japan, and other high-longevity countries. Specific cohorts that account...
Selective truncations of an optical state using projection synthesis
Miranowicz, A; Bajer, J; Koashi, M; Imoto, N; Miranowicz, Adam; Ozdemir, Sahin Kaya; Bajer, Jiri; Koashi, Masato; Imoto, Nobuyuki
2006-01-01
Selective truncation of Fock-state expansion of an optical field can be achieved using projection synthesis. The process removes predetermined Fock states from the input field by conditional measurement and teleportation. We present a scheme based on multiport interferometry to perform projection synthesis. This scheme can be used both as a generalized quantum scissors device, which filters out Fock states with photon numbers higher than a predetermined value, and also as a quantum punching device, which selectively removes specific Fock states making holes in the Fock-state expansion of the input field.
On the propagation of truncated localized waves in dispersive silica
Salem, Mohamed
2010-01-01
Propagation characteristics of truncated Localized Waves propagating in dispersive silica and free space are numerically analyzed. It is shown that those characteristics are affected by the changes in the relation between the transverse spatial spectral components and the wave vector. Numerical experiments demonstrate that as the non-linearity of this relation gets stronger, the pulses propagating in silica become more immune to decay and distortion whereas the pulses propagating in free-space suffer from early decay and distortion. © 2010 Optical Society of America.
New Blocking Artifacts Reduction Method Based on Wavelet Transform
Institute of Scientific and Technical Information of China (English)
SHI Min; YI Qing-ming
2007-01-01
It is well known that a block discrete cosine transform compressed image exhibits visually annoying blocking artifacts at low-bit-rate. A new post-processing deblocking algorithm in wavelet domain is proposed. The algorithm exploits blocking-artifact features shown in wavelet domain. The energy of blocking artifacts is concentrated into some lines to form annoying visual effects after wavelet transform. The aim of reducing blocking artifacts is to capture excessive energy on the block boundary effectively and reduce it below the visual scope. Adaptive operators for different subbands are computed based on the wavelet coefficients. The operators are made adaptive to different images and characteristics of blocking artifacts. Experimental results show that the proposed method can significantly improve the visual quality and also increase the peak signal-noise-ratio(PSNR) in the output image.
Institute of Scientific and Technical Information of China (English)
侯晓琴; 胡志华; 高超峰; 罗勋杰
2016-01-01
A block-layout based routing problem of network configurations in an automation warehouse, plant or terminal is considered as an automated local logistics storage system. It aims at finding out the shortest path that traverses all blocks. A mixed-integer linear program is established to formulate the problem under the minimization of the path. Besides, a priority-based genetic algorithm is developed and realized using the tool of Matlab to solve the model. In the end, the genetic operators are analyzed by experimental comparisons and the algorithm is validated by experiments.%针对自动化仓库、自动化车间及自动化码头等自动化局部物流存储系统仓库巷道网络中AGV（自动化导引车）对仓库货区遍历作业的路径优化问题，以搜索遍历所有货区的最短路径为目标，建立混合整数线性规划模型，并设计基于优先权的遗传算法求解。通过Matlab仿真实验分析比较算子性能，验证算法的有效性。
A Conformal Truncation Framework for Infinite-Volume Dynamics
Katz, Emanuel; Walters, Matthew T
2016-01-01
We present a new framework for studying conformal field theories deformed by one or more relevant operators. The original CFT is described in infinite volume using a basis of states with definite momentum, $P$, and conformal Casimir, $\\mathcal{C}$. The relevant deformation is then considered using lightcone quantization, with the resulting Hamiltonian expressed in terms of this CFT basis. Truncating to states with $\\mathcal{C} \\leq \\mathcal{C}_{\\max}$, one can numerically find the resulting spectrum, as well as other dynamical quantities, such as spectral densities of operators. This method requires the introduction of an appropriate regulator, which can be chosen to preserve the conformal structure of the basis. We check this framework in three dimensions for various perturbative deformations of a free scalar CFT, and for the case of a free $O(N)$ CFT deformed by a mass term and a non-perturbative quartic interaction at large-$N$. In all cases, the truncation scheme correctly reproduces known analytic result...
A strongly truncated inner accretion disc in the Rapid Burster
van den Eijnden, J.; Bagnoli, T.; Degenaar, N.; Lohfink, A. M.; Parker, M. L.; in ‘t Zand, J. J. M.; Fabian, A. C.
2017-03-01
The neutron star (NS) low-mass X-ray binary (LMXB) the Rapid Burster (RB; MXB 1730-335) uniquely shows both Type I and Type II X-ray bursts. The origin of the latter is ill-understood but has been linked to magnetospheric gating of the accretion flow. We present a spectral analysis of simultaneous Swift, NuSTAR and XMM-Newton observations of the RB during its 2015 outburst. Although a broad Fe K line has been observed before, the high quality of our observations allows us to model this line using relativistic reflection models for the first time. We find that the disc is strongly truncated at 41.8^{+6.7}_{-5.3} gravitational radii (∼87 km), which supports magnetospheric Type II burst models and strongly disfavours models involving instabilities at the innermost stable circular orbit. Assuming that the RB magnetic field indeed truncates the disc, we find B = (6.2 ± 1.5) × 108 G, larger than typically inferred for NS LMXBs. In addition, we find a low inclination (i = 29° ± 2°). Finally, we comment on the origin of the Comptonized and thermal components in the RB spectrum.
Hamiltonian truncation approach to quenches in the Ising field theory
Directory of Open Access Journals (Sweden)
T. Rakovszky
2016-10-01
Full Text Available In contrast to lattice systems where powerful numerical techniques such as matrix product state based methods are available to study the non-equilibrium dynamics, the non-equilibrium behaviour of continuum systems is much harder to simulate. We demonstrate here that Hamiltonian truncation methods can be efficiently applied to this problem, by studying the quantum quench dynamics of the 1+1 dimensional Ising field theory using a truncated free fermionic space approach. After benchmarking the method with integrable quenches corresponding to changing the mass in a free Majorana fermion field theory, we study the effect of an integrability breaking perturbation by the longitudinal magnetic field. In both the ferromagnetic and paramagnetic phases of the model we find persistent oscillations with frequencies set by the low-lying particle excitations not only for small, but even for moderate size quenches. In the ferromagnetic phase these particles are the various non-perturbative confined bound states of the domain wall excitations, while in the paramagnetic phase the single magnon excitation governs the dynamics, allowing us to capture the time evolution of the magnetisation using a combination of known results from perturbation theory and form factor based methods. We point out that the dominance of low lying excitations allows for the numerical or experimental determination of the mass spectra through the study of the quench dynamics.
Macroscopic model and truncation error of discrete Boltzmann method
Hwang, Yao-Hsin
2016-10-01
A derivation procedure to secure the macroscopically equivalent equation and its truncation error for discrete Boltzmann method is proffered in this paper. Essential presumptions of two time scales and a small parameter in the Chapman-Enskog expansion are disposed of in the present formulation. Equilibrium particle distribution function instead of its original non-equilibrium form is chosen as key variable in the derivation route. Taylor series expansion encompassing fundamental algebraic manipulations is adequate to realize the macroscopically differential counterpart. A self-contained and comprehensive practice for the linear one-dimensional convection-diffusion equation is illustrated in details. Numerical validations on the incurred truncation error in one- and two-dimensional cases with various distribution functions are conducted to verify present formulation. As shown in the computational results, excellent agreement between numerical result and theoretical prediction are found in the test problems. Straightforward extensions to more complicated systems including convection-diffusion-reaction, multi-relaxation times in collision operator as well as multi-dimensional Navier-Stokes equations are also exposed in the Appendix to point out its expediency in solving complicated flow problems.
A strongly truncated inner accretion disk in the Rapid Burster
Eijnden, J van den; Degenaar, N; Lohfink, A M; Parker, M L; Zand, J J M in 't; Fabian, A C
2016-01-01
The neutron star (NS) low-mass X-ray binary (LMXB) the Rapid Burster (RB; MXB 1730-335) uniquely shows both Type-I and Type-II X-ray bursts. The origin of the latter is ill-understood but has been linked to magnetospheric gating of the accretion flow. We present a spectral analysis of simultaneous Swift, NuSTAR and XMM-Newton observations of the RB during its 2015 outburst. Although a broad Fe-K line has been observed before, the high quality of our observations allows us to model this line using relativistic reflection models for the first time. We find that the disk is strongly truncated at $41.8^{+6.7}_{-5.3}$ gravitational radii ($\\sim 87$ km), which supports magnetospheric Type-II burst models and strongly disfavors models involving instabilities at the innermost stable circular orbit. Assuming that the RB magnetic field indeed truncates the disk, we find $B = (6.2 \\pm 1.5) \\times 10^8$ G, larger than typically inferred for NS LMXBs. In addition, we find a low inclination ($i = 29\\pm2^{\\rm o}$). Finally,...
Hamiltonian truncation approach to quenches in the Ising field theory
Rakovszky, T.; Mestyán, M.; Collura, M.; Kormos, M.; Takács, G.
2016-10-01
In contrast to lattice systems where powerful numerical techniques such as matrix product state based methods are available to study the non-equilibrium dynamics, the non-equilibrium behaviour of continuum systems is much harder to simulate. We demonstrate here that Hamiltonian truncation methods can be efficiently applied to this problem, by studying the quantum quench dynamics of the 1 + 1 dimensional Ising field theory using a truncated free fermionic space approach. After benchmarking the method with integrable quenches corresponding to changing the mass in a free Majorana fermion field theory, we study the effect of an integrability breaking perturbation by the longitudinal magnetic field. In both the ferromagnetic and paramagnetic phases of the model we find persistent oscillations with frequencies set by the low-lying particle excitations not only for small, but even for moderate size quenches. In the ferromagnetic phase these particles are the various non-perturbative confined bound states of the domain wall excitations, while in the paramagnetic phase the single magnon excitation governs the dynamics, allowing us to capture the time evolution of the magnetisation using a combination of known results from perturbation theory and form factor based methods. We point out that the dominance of low lying excitations allows for the numerical or experimental determination of the mass spectra through the study of the quench dynamics.
Firewalls as artefacts of inconsistent truncations of quantum geometries
Energy Technology Data Exchange (ETDEWEB)
Germani, Cristiano [Max-Planck-Institut fuer Physik, Muenchen (Germany); Arnold Sommerfeld Center, Ludwig-Maximilians-University, Muenchen (Germany); Institut de Ciencies del Cosmos, Universitat de Barcelona (Spain); Sarkar, Debajyoti [Max-Planck-Institut fuer Physik, Muenchen (Germany); Arnold Sommerfeld Center, Ludwig-Maximilians-University, Muenchen (Germany)
2016-01-15
In this paper we argue that a firewall is simply a manifestation of an inconsistent truncation of non-perturbative effects that unitarize the semiclassical black hole. Namely, we show that a naive truncation of quantum corrections to the Hawking spectrum at order O(e{sup -S}), inexorably leads to a ''localised'' divergent energy density near the black hole horizon. Nevertheless, in the same approximation, a distant observer only sees a discretised spectrum and concludes that unitarity is achieved by (e{sup -S}) effects. This is due to the fact that instead, the correct quantum corrections to the Hawking spectrum go like (g{sup tt}e{sup -S}). Therefore, while at a distance far away from the horizon, where g{sup tt} ∼ 1, quantum corrections are perturbative, they do diverge close to the horizon, where g{sup tt} → ∞. Nevertheless, these ''corrections'' nicely re-sum so that correlations functions are smooth at the would-be black hole horizon. Thus, we conclude that the appearance of firewalls is just a signal of the breaking of the semiclassical approximation at the Page time, even for large black holes. (copyright 2015 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)
Generalizing Tanisaki's ideal via ideals of truncated symmetric functions
Mbirika, Aba
2010-01-01
We define a family of ideals I_h in the polynomial ring Z[x_1,x_2,...,x_n] that are parametrized by Hessenberg functions h (equivalently Dyck paths or ample partitions). The ideals I_h generalize algebraically a family of ideals called the Tanisaki ideal, which is used in a geometric construction of permutation representations called Springer theory. To define I_h, we use polynomials in a subset of the variables {x_1,...,x_n} that are symmetric under the corresponding permutation subgroup. We call these polynomials truncated symmetric functions and show combinatorial identities relating different kinds of truncated symmetric polynomials. We then prove several key properties of I_h, including that if h > h' in the natural partial order on Dyck paths then I_h \\subset I_{h'}, and explicitly construct a Grobner basis for I_h. We define a second family of ideals J_h for which some of the claims are easier to see, and then prove that I_h = J_h. Using earlier work of the first author, the current manuscript proves t...
Partial Supergravity Breaking and the Effective Action of Consistent Truncations
Grimm, Thomas W; Lust, Severin
2014-01-01
We study vacua of N = 4 half-maximal gauged supergravity in five dimensions and determine crucial properties of the effective theory around the vacuum. The main focus is on configurations with exactly two broken supersymmetries, since they frequently appear in consistent truncations of string theory and supergravity. Evaluating one-loop corrections to the Chern-Simons terms we find necessary conditions to ensure that a consistent truncation also gives rise to a proper effective action of an underlying more fundamental theory. To obtain concrete examples, we determine the N=4 action of M-theory on six-dimensional SU(2)-structure manifolds with background fluxes. Calabi-Yau threefolds with vanishing Euler number are examples of SU(2)-structure manifolds that yield N=2 Minkowski vacua. We find that that one-loop corrections to the Chern-Simons terms vanish trivially and thus do not impose constraints on identifying effective theories. This result is traced back to the absence of isometries on these geometries. E...
Block Tridiagonal Matrices in Electronic Structure Calculations
DEFF Research Database (Denmark)
in the Landauer–Büttiker ballistic transport regime. These calculations concentrate on determining the so– called Green’s function matrix, or portions thereof, which is the inverse of a block tridiagonal general complex matrix. To this end, a sequential algorithm based on Gaussian elimination named Sweeps...
Total Spinal Block after Thoracic Paravertebral Block.
Beyaz, Serbülent Gökhan; Özocak, Hande; Ergönenç, Tolga; Erdem, Ali Fuat; Palabıyık, Onur
2014-02-01
Thoracic paravertebral block (TPVB) can be performed with or without general anaesthesia for various surgical procedures. TPVB is a popular anaesthetic technique due to its low side effect profile and high analgesic potency. We used 20 mL of 0.5% levobupivacaine for a single injection of unilateral TPVB at the T7 level with neurostimulator in a 63 year old patient with co-morbid disease who underwent cholecystectomy. Following the application patient lost consciousness, and was intubated. Haemodynamic instability was normalised with rapid volume replacement and vasopressors. Anaesthetic drugs were stopped at the end of the surgery and muscle relaxant was antagonised. Return of mucle strenght was shown with neuromuscular block monitoring. Approximately three hours after TPVB, spontaneous breathing started and consciousness returned. A total spinal block is a rare and life-threatening complication. A total spinal block is a complication of spinal anaesthesia, and it can also occur after peripheral blocks. Clinical presentation is characterised by hypotension, bradicardia, apnea, and cardiac arrest. An early diagnosis and appropriate treatment is life saving. In this case report, we want to present total spinal block after TPVB.
Kleinberg, Jon
2006-01-01
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.
Wang, Lui; Bayer, Steven E.
1991-01-01
Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.
Administering truncated receive functions in a parallel messaging interface
Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E
2014-12-09
Administering truncated receive functions in a parallel messaging interface (`PMI`) of a parallel computer comprising a plurality of compute nodes coupled for data communications through the PMI and through a data communications network, including: sending, through the PMI on a source compute node, a quantity of data from the source compute node to a destination compute node; specifying, by an application on the destination compute node, a portion of the quantity of data to be received by the application on the destination compute node and a portion of the quantity of data to be discarded; receiving, by the PMI on the destination compute node, all of the quantity of data; providing, by the PMI on the destination compute node to the application on the destination compute node, only the portion of the quantity of data to be received by the application; and discarding, by the PMI on the destination compute node, the portion of the quantity of data to be discarded.
Learning Mixtures of Truncated Basis Functions from Data
DEFF Research Database (Denmark)
Langseth, Helge; Nielsen, Thomas Dyhre; Pérez-Bernabé, Inmaculada;
2014-01-01
-likelihood), they are significantly faster, and therefore indicate that the MoTBF framework can be used for inference and learning in reasonably sized domains. Furthermore, we show how a particular sub- class of MoTBF potentials (learnable by the proposed methods) can be exploited to significantly reduce complexity during inference.......In this paper we investigate methods for learning hybrid Bayesian networks from data. First we utilize a kernel density estimate of the data in order to translate the data into a mixture of truncated basis functions (MoTBF) representation using a convex optimization technique. When utilizing...... propose an alternative learning method that relies on the cumulative distribution function of the data. Empirical results demonstrate the usefulness of the approaches: Even though the methods produce estimators that are slightly poorer than the state of the art (in terms of log...
Theoretical analysis of balanced truncation for linear switched systems
DEFF Research Database (Denmark)
Petreczky, Mihaly; Wisniewski, Rafal; Leth, John-Josef
2012-01-01
In this paper we present theoretical analysis of model reduction of linear switched systems based on balanced truncation, presented in [1,2]. More precisely, (1) we provide a bound on the estimation error using L2 gain, (2) we provide a system theoretic interpretation of grammians...... for showing this independence is realization theory of linear switched systems. [1] H. R. Shaker and R. Wisniewski, "Generalized gramian framework for model/controller order reduction of switched systems", International Journal of Systems Science, Vol. 42, Issue 8, 2011, 1277-1291. [2] H. R. Shaker and R....... Wisniewski, "Switched Systems Reduction Framework Based on Convex Combination of Generalized Gramians", Journal of Control Science and Engineering, 2009....
Truncation identities for the small polaron fusion hierarchy
Grabinski, André M
2012-01-01
We study a one-dimensional lattice model of interacting spinless fermions. This model is integrable for both periodic and open boundary conditions, the latter case includes the presence of Grassmann valued non-diagonal boundary fields breaking the bulk U(1) symmetry of the model. Starting from the embedding of this model into a graded Yang-Baxter algebra an infinite hierarchy of comuting transfer matrices is constructed by means of a fusion procedure. For certain values of the coupling constant related to anisotropies of the underlying vertex model taken at roots of unity this hierarchy is shown to truncate giving a finite set of functional equations for the spectrum of the transfer matrices. For generic coupling constants the spectral problem is formulated in terms of a TQ-equation which can be solved by Bethe ansatz methods for periodic and diagonal open boundary conditions. Possible approaches for the solution of the model with generic non-diagonal boundary fields are discussed.
Enhanced absorption in heterostructures with graphene and truncated photonic crystals
Liu, Yiping; Dai, Yunyun; Xia, Yuyu; Du, Guiqiang; Lu, Guang; Liu, Fen; Shi, Lei; Zi, Jian
2016-01-01
We theoretically and experimentally investigate the optical absorption properties of heterostructures composed of graphene films and truncated photonic crystals (PCs) in the visible range. The experimental results show that the absorption of the heterostructure is enhanced greatly in the whole forbidden gap of PCs compared with that of graphene alone. The absorption is enhanced over a wide angle of incidence for both transverse electric (TE) and transverse magnetic (TM) polarizations. The enhanced absorption band broadens for TE polarization but narrows for TM polarization as the incident angle increases. In the forbidden gap of the PCs, the maximum absorptance of the heterostructures is nearly four times of that of bare graphene films for arbitrary incident angles and polarizations. The optical experiments are in excellent agreement with the theoretical results.
An Asymmetric Image Encryption Based on Phase Truncated Hybrid Transform
Khurana, Mehak; Singh, Hukum
2017-09-01
To enhance the security of the system and to protect it from the attacker, this paper proposes a new asymmetric cryptosystem based on hybrid approach of Phase Truncated Fourier and Discrete Cosine Transform (PTFDCT) which adds non linearity by including cube and cube root operation in the encryption and decryption path respectively. In this cryptosystem random phase masks are used as encryption keys and phase masks generated after the cube operation in encryption process are reserved as decryption keys and cube root operation is required to decrypt image in decryption process. The cube and cube root operation introduced in the encryption and decryption path makes system resistant against standard attacks. The robustness of the proposed cryptosystem has been analysed and verified on the basis of various parameters by simulating on MATLAB 7.9.0 (R2008a). The experimental results are provided to highlight the effectiveness and suitability of the proposed cryptosystem and prove the system is secure.
Truncated $\\gamma$-exponential models for tidal stellar systems
Gomez-Leyton, Y J
2016-01-01
We introduce a parametric family of models to characterize the properties of astrophysical systems in a quasi-stationary evolution under the incidence evaporation. We start from an one-particle distribution $f_{\\gamma}\\left(\\mathbf{q},\\mathbf{p}|\\beta,\\varepsilon_{s}\\right)$ that considers an appropriate deformation of Maxwell-Boltzmann form with inverse temperature $\\beta$, in particular, a power-law truncation at the scape energy $\\varepsilon_{s}$ with exponent $\\gamma>0$. This deformation is implemented using a generalized $\\gamma$-exponential function obtained from the \\emph{fractional integration} of ordinary exponential. As shown in this work, this proposal generalizes models of tidal stellar systems that predict particles distributions with \\emph{isothermal cores and polytropic haloes}, e.g.: Michie-King models. We perform the analysis of thermodynamic features of these models and their associated distribution profiles. A nontrivial consequence of this study is that profiles with isothermal cores and p...
Simulating strongly correlated multiparticle systems in a truncated Hilbert space
Energy Technology Data Exchange (ETDEWEB)
Ernst, Thomas; Hallwood, David W.; Gulliksen, Jake; Brand, Joachim [New Zealand Institute for Advanced Study and Centre for Theoretical Chemistry and Physics, Massey University, Private Bag 102904, North Shore, Auckland 0745 (New Zealand); Meyer, Hans-Dieter [Theoretische Chemie, Physikalisch-Chemisches Institut, Universitaet Heidelberg, Im Neuenheimer Feld 229, D-69120 Heidelberg (Germany)
2011-08-15
Representing a strongly interacting multiparticle wave function in a finite product basis leads to errors. Simple rescaling of the contact interaction can preserve the low-lying energy spectrum and long-wavelength structure of wave functions in one-dimensional systems and thus correct for the basis set truncation error. The analytic form of the rescaling is found for a two-particle system where the rescaling is exact. A detailed comparison between finite Hilbert space calculations and exact results for up to five particles show that rescaling can significantly improve the accuracy of numerical calculations in various external potentials. In addition to ground-state energies, the low-lying excitation spectrum, density profile, and correlation functions are studied. The results give a promising outlook for numerical simulations of trapped ultracold atoms.
DEFF Research Database (Denmark)
Jönsson, Jeppe
2015-01-01
Block tearing is considered in several codes as a pure block tension or a pure block shear failure mechanism. However in many situations the load acts eccentrically and involves the transfer of a substantial moment in combination with the shear force and perhaps a normal force. A literature study...... yield lines around the block leads to simple interaction formulas similar to other interaction formulas in the codes.......Block tearing is considered in several codes as a pure block tension or a pure block shear failure mechanism. However in many situations the load acts eccentrically and involves the transfer of a substantial moment in combination with the shear force and perhaps a normal force. A literature study...
Yang, Yuli
2012-11-01
In addressing the issue of taking full advantage of the shared spectrum under imposed limitations in a cognitive radio (CR) network, we exploit a cross-layer design for the communications of secondary users (SUs), which combines adaptive modulation and coding (AMC) at the physical layer with truncated automatic repeat request (ARQ) protocol at the data link layer. To achieve high spectral efficiency (SE) while maintaining a target packet loss probability (PLP), switching among different transmission modes is performed to match the time-varying propagation conditions pertaining to the secondary link. Herein, by minimizing the SU\\'s packet error rate (PER) with each transmission mode subject to the spectrum-sharing constraints, we obtain the optimal power allocation at the secondary transmitter (ST) and then derive the probability density function (pdf) of the received SNR at the secondary receiver (SR). Based on these statistics, the SU\\'s packet loss rate and average SE are obtained in closed form, considering transmissions over block-fading channels with different distributions. Our results quantify the relation between the performance of a secondary link exploiting the cross-layer-designed adaptive transmission and the interference inflicted on the primary user (PU) in CR networks. © 1967-2012 IEEE.
Gaussian streaming with the truncated Zel'dovich approximation
Kopp, Michael; Uhlemann, Cora; Achitouv, Ixandra
2016-12-01
We calculate the halo correlation function in redshift space using the Gaussian streaming model (GSM). To determine the scale-dependent functions entering the GSM, we use local Lagrangian bias together with convolution Lagrangian perturbation theory (CLPT), which constitutes an approximation to the Post-Zel'dovich approximation. On the basis of N -body simulations, we demonstrate that a smoothing of the initial conditions with the Lagrangian radius improves the Zel'dovich approximation and its ability to predict the displacement field of protohalos. Based on this observation, we implement a "truncated" CLPT by smoothing the initial power spectrum and investigate the dependence of the streaming model ingredients on the smoothing scale. We find that the real space correlation functions of halos and their mean pairwise velocity are optimized if the coarse graining scale is chosen to be 1 Mpc /h at z =0 , while the pairwise velocity dispersion is optimized if the smoothing scale is chosen to be the Lagrangian size of the halo. We compare theoretical results for the halo correlation function in redshift space to measurements within the Horizon run 2 N -body simulation halo catalog. We find that this simple two-filter smoothing procedure in the spirit of the truncated Zel'dovich approximation significantly improves the GSM +CLPT prediction of the redshift space halo correlation function over the whole mass range from large galaxy to galaxy cluster-sized halos. We expect that the necessity for two filter scales is an artifact of our local bias model, and that once a more physical bias model is implemented in CLPT, the only physically relevant smoothing scale will be related to the Lagrangian radius, in accord with our findings based on N -body simulations.
Novel Efficient De-blocking Method for Highly Compressed Images
Institute of Scientific and Technical Information of China (English)
SHI Min; YI Qing-ming; YANG Liang
2007-01-01
Due to coarse quantization,block-based discrete cosine transform(BDCT) compression methods usually suffer from visible blocking artifacts at the block boundaries.A novel efficient de-blocking method in DCT domain is proposed.A specific criterion for edge detection is given,one-dimensional DCT is applied on each row of the adjacent blocks and the shifted block in smooth region,and the transform coefficients of the shifted block are modified by weighting the average of three coefficients of the block.Mean square difference of slope criterion is used to judge the efficiency of the proposed algorithm.Simulation results show that the new method not only obtains satisfactory image quality,but also maintains high frequency information.
Motion estimation based on an improved block matching technique
Institute of Scientific and Technical Information of China (English)
Tangfei Tao; Chongzhao Han; Yanqi Wu; Xin Kang
2006-01-01
@@ An improved block-matching algorithm for fast motion estimation is proposed. The matching criterion is the sum of absolute difference. The basic idea is to obtain the best estimation of motion vectors by an optimization of the search process which can terminate the time-consuming computation of matching evaluation between the current block and the ineligible candidate block as early as possible and eliminate the search positions as many as possible in the search area. The performance of this algorithm is evaluated by theoretic analysis and compared with the full search algorithm (FSA). The simulation results demonstrate that the computation load of this algorithm is much less than that of FSA, and the motion vectors obtained by this algorithm are identical to those of FSA.
Effects of truncated Gaussian beam on the performance of fiber optical synthetic aperture system
Institute of Scientific and Technical Information of China (English)
LIU Li; WANG Chang-wei; JIANG Yue-song
2012-01-01
In the fiber optical synthetic aperture (FOSA) system,the diffraction of the Gaussian beam limited by the aperture in exit pupil plane of fiber collimator is studied theoretically,and the axial and transverse irradiance distributions are obtained.The point spread function (PSF) and modulation transfer function (MTF) of the truncated Gaussian beam array are computed numerically with different truncation factors.The results show that the diffraction of the truncated Gaussian beam array agrees with the uniform-beam Rayleigh diffraction when the truncation factor is less than 0.5,but little power is transmitted.The PSF and MTF are degraded,but more power can be contained when the truncation factor is larger.The selection of the truncation factor is a trade-off between the loss of transmission and the qualities of PSF and MTF in practical application.
Automatic Blocking Of QR and LU Factorizations for Locality
Energy Technology Data Exchange (ETDEWEB)
Yi, Q; Kennedy, K; You, H; Seymour, K; Dongarra, J
2004-03-26
QR and LU factorizations for dense matrices are important linear algebra computations that are widely used in scientific applications. To efficiently perform these computations on modern computers, the factorization algorithms need to be blocked when operating on large matrices to effectively exploit the deep cache hierarchy prevalent in today's computer memory systems. Because both QR (based on Householder transformations) and LU factorization algorithms contain complex loop structures, few compilers can fully automate the blocking of these algorithms. Though linear algebra libraries such as LAPACK provides manually blocked implementations of these algorithms, by automatically generating blocked versions of the computations, more benefit can be gained such as automatic adaptation of different blocking strategies. This paper demonstrates how to apply an aggressive loop transformation technique, dependence hoisting, to produce efficient blockings for both QR and LU with partial pivoting. We present different blocking strategies that can be generated by our optimizer and compare the performance of auto-blocked versions with manually tuned versions in LAPACK, both using reference BLAS, ATLAS BLAS and native BLAS specially tuned for the underlying machine architectures.
Stopping Condition for Greedy Block Sparse Signal Recovery
Luo, Yu; Xie, Ronggui; Yin, Huarui; Wang, Weidong
2016-01-01
For greedy block sparse recovery where the sparsity level is unknown, we derive a stopping condition to stop the iteration process. Focused on the block orthogonal matching pursuit (BOMP) algorithm, we model the energy of residual signals at each iteration from a probabilistic perspective. At the iteration when the last supporting block is detected, the resulting energy of residual signals is supposed to suffer an obvious decrease. Based on this, we stop the iteration process when the energy ...
BLOCK H-MATRICES AND SPECTRUM OF BLOCK MATRICES
Institute of Scientific and Technical Information of China (English)
黄廷祝; 黎稳
2002-01-01
The block H-matrices are studied by the concept of G-functions, several concepts of block matrices are introduced. Equivalent characters of block H-matrices are obtained. Spectrum localizations claracterized by Gfunctions for block matrices are got.
Reduction of truncation artifacts in CT images via a discriminative dictionary representation method
Chen, Yang; Li, Ke; Li, Yinsheng; Hsieh, Jiang; Chen, Guang-Hong
2016-04-01
When the scan field of view (SFOV) of a CT system is not large enough to enclose the entire cross-section of a patient, or the patient needs to be intentionally positioned partially outside the SFOV for certain clinical CT scans, truncation artifacts are often observed in the reconstructed CT images. Conventional wisdom to reduce truncation artifacts is to complete the truncated projection data via data extrapolation with different a priori assumptions. This paper presents a novel truncation artifact reduction method that directly works in the CT image domain. Specifically, a discriminative dictionary that includes a sub-dictionary of truncation artifacts and a sub-dictionary of non-artifact image information was used to separate a truncation artifact-contaminated image into two sub-images, one with reduced truncation artifacts, and the other one containing only the truncation artifacts. Both experimental phantom and retrospective human subject studies have been performed to characterize the performance of the proposed truncation artifact reduction method.
Propagation of time-truncated Airy-type pulses in media with quadratic and cubic dispersion
Hernández, José Angel Borda; Shaarawi, Amr; Besieris, Ioannis M
2015-01-01
In this paper, we describe analytically the propagation of Airy-type pulses truncated by a finite-time aperture when second and third order dispersion effects are considered. The mathematical method presented here, based on the superposition of exponentially truncated Airy pulses, is very effective, allowing us to avoid the use of time-consuming numerical simulations. We analyze the behavior of the time truncated Ideal-Airy pulse and also the interesting case of a time truncated Airy pulse with a "defect" in its initial profile, which reveals the self-healing property of this kind of pulse solution.
Block TERM factorization of block matrices
Institute of Scientific and Technical Information of China (English)
SHE Yiyuan; HAO Pengwei
2004-01-01
Reversible integer mapping (or integer transform) is a useful way to realize Iossless coding, and this technique has been used for multi-component image compression in the new international image compression standard JPEG 2000. For any nonsingular linear transform of finite dimension, its integer transform can be implemented by factorizing the transform matrix into 3 triangular elementary reversible matrices (TERMs) or a series of single-row elementary reversible matrices (SERMs). To speed up and parallelize integer transforms, we study block TERM and SERM factorizations in this paper. First, to guarantee flexible scaling manners, the classical determinant (det) is generalized to a matrix function, DET, which is shown to have many important properties analogous to those of det. Then based on DET, a generic block TERM factorization,BLUS, is presented for any nonsingular block matrix. Our conclusions can cover the early optimal point factorizations and provide an efficient way to implement integer transforms for large matrices.
Active Angular Alignment of Gauge Blocks in Double-Ended Interferometers
Directory of Open Access Journals (Sweden)
Josef Lazar
2013-09-01
Full Text Available This paper presents a method implemented in a system for automatic contactless calibration of gauge blocks designed at ISI ASCR. The system combines low-coherence interferometry and laser interferometry, where the first identifies the gauge block sides position and the second one measures the gauge block length itself. A crucial part of the system is the algorithm for gauge block alignment to the measuring beam which is able to compensate the gauge block lateral and longitudinal tilt up to 0.141 mrad. The algorithm is also important for the gauge block position monitoring during its length measurement.
Joux, Antoine
2009-01-01
Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic
Improving a DWT-based compression algorithm for high image-quality requirement of satellite images
Thiebaut, Carole; Latry, Christophe; Camarero, Roberto; Cazanave, Grégory
2011-10-01
Past and current optical Earth observation systems designed by CNES are using a fixed-rate data compression processing performed at a high-rate in a pushbroom mode (also called scan-based mode). This process generates fixed-length data to the mass memory and data downlink is performed at a fixed rate too. Because of on-board memory limitations and high data rate processing needs, the rate allocation procedure is performed over a small image area called a "segment". For both PLEIADES compression algorithm and CCSDS Image Data Compression recommendation, this rate allocation is realised by truncating to the desired rate a hierarchical bitstream of coded and quantized wavelet coefficients for each segment. Because the quantisation induced by truncation of the bit planes description is the same for the whole segment, some parts of the segment have a poor image quality. These artefacts generally occur in low energy areas within a segment of higher level of energy. In order to locally correct these areas, CNES has studied "exceptional processing" targeted for DWT-based compression algorithms. According to a criteria computed for each part of the segment (called block), the wavelet coefficients can be amplified before bit-plane encoding. As usual Region of Interest handling, these multiplied coefficients will be processed earlier by the encoder than in the nominal case (without exceptional processing). The image quality improvement brought by the exceptional processing has been confirmed by visual image analysis and fidelity criteria. The complexity of the proposed improvement for on-board application has also been analysed.
Efficient Recovery of Block Sparse Signals via Zero-point Attracting Projection
Liu, Jingbo; Gu, Yuantao
2012-01-01
In this paper, we consider compressed sensing (CS) of block-sparse signals, i.e., sparse signals that have nonzero coefficients occurring in clusters. An efficient algorithm, called zero-point attracting projection (ZAP) algorithm, is extended to the scenario of block CS. The block version of ZAP algorithm employs an approximate $l_{2,0}$ norm as the cost function, and finds its minimum in the solution space via iterations. For block sparse signals, an analysis of the stability of the local minimums of this cost function under the perturbation of noise reveals an advantage of the proposed algorithm over its original non-block version in terms of reconstruction error. Finally, numerical experiments show that the proposed algorithm outperforms other state of the art methods for the block sparse problem in various respects, especially the stability under noise.
Lesson Thirteen Trifascicular Block
Institute of Scientific and Technical Information of China (English)
鲁端; 王劲
2005-01-01
@@ A complete trifascicular block would result in complete AV block. The idio ventricular rhythm has a slower rate and a wide QRS complex because the pacemaker is located at the peripheral part of the conduction system distal to the sites of the block1. Such a rhythm may be difficult to differentiate from bifascicular or bundle branch block combined with complete block at a higher level such as the AV node or His bundle2. Besides a slower ventricular rate, a change in the morphology of the QRS complex from a previous known bifascicular pattern would be strongly suggestive of a trifascicular origin of the complete AV block3. A His bundle recording is required for a definitive diagnosis, however.
Davidson, Asher
2014-10-01
In plasma based accelerators (LWFA and PWFA), the methods of injecting high quality electron bunches into the accelerating wakefield is of utmost importance for various applications. Numerous particle-in-cell (PIC) simulations are conducted in order to study various methods of injection and the ideal parameters thereof. 2D slab-geometry simulations are computationally inexpensive, but they are quantitatively, and sometimes even qualitatively inaccurate. One method for reducing the computational load of a 3D simulation is by utilizing a truncated azimuthal mode expansion into the OSIRIS simulation framework. Comparison with 3D LWFA simulations shows a great degree of consistency in the characteristics of the self-trapped beam. In addition, higher order cylindrical modes may capture effects such as beam hosing and asymmetric spot size modulation. With this highly efficient 2D-hybrid algorithm it is possible to simulate parameter regimes and scaling laws that are difficult to do in a full 3D Cartesian simulation. Relativistic spot-size self-focusing, which cannot be accurately described in a 2D slab geometry, is also studied.
Directory of Open Access Journals (Sweden)
Francisco José Cano-Fácila
2012-01-01
Full Text Available A method to reduce truncation errors in near-field antenna measurements is presented. The method is based on the Gerchberg-Papoulis iterative algorithm used to extrapolate band-limited functions and it is able to extend the valid region of the calculated far-field pattern up to the whole forward hemisphere. The extension of the valid region is achieved by the iterative application of a transformation between two different domains. After each transformation, a filtering process that is based on known information at each domain is applied. The first domain is the spectral domain in which the plane wave spectrum (PWS is reliable only within a known region. The second domain is the field distribution over the antenna under test (AUT plane in which the desired field is assumed to be concentrated on the antenna aperture. The method can be applied to any scanning geometry, but in this paper, only the planar, cylindrical, and partial spherical near-field measurements are considered. Several simulation and measurement examples are presented to verify the effectiveness of the method.
Tian, Zhen; Jia, Xun; Jiang, Steve B
2013-01-01
In the treatment plan optimization for intensity modulated radiation therapy (IMRT), dose-deposition coefficient (DDC) matrix is often pre-computed to parameterize the dose contribution to each voxel in the volume of interest from each beamlet of unit intensity. However, due to the limitation of computer memory and the requirement on computational efficiency, in practice matrix elements of small values are usually truncated, which inevitably compromises the quality of the resulting plan. A fixed-point iteration scheme has been applied in IMRT optimization to solve this problem, which has been reported to be effective and efficient based on the observations of the numerical experiments. In this paper, we aim to point out the mathematics behind this scheme and to answer the following three questions: 1) whether the fixed-point iteration algorithm converges or not? 2) when it converges, whether the fixed point solution is same as the original solution obtained with the complete DDC matrix? 3) if not the same, wh...
Gao, Shigen; Dong, Hairong; Lyu, Shihang; Ning, Bin
2016-07-01
This paper studies decentralised neural adaptive control of a class of interconnected nonlinear systems, each subsystem is in the presence of input saturation and external disturbance and has independent system order. Using a novel truncated adaptation design, dynamic surface control technique and minimal-learning-parameters algorithm, the proposed method circumvents the problems of 'explosion of complexity' and 'dimension curse' that exist in the traditional backstepping design. Comparing to the methodology that neural weights are online updated in the controllers, only one scalar needs to be updated in the controllers of each subsystem when dealing with unknown systematic dynamics. Radial basis function neural networks (NNs) are used in the online approximation of unknown systematic dynamics. It is proved using Lyapunov stability theory that all the signals in the closed-loop system are semi-globally uniformly ultimately bounded. The tracking errors of each subsystems, the amplitude of NN approximation residuals and external disturbances can be attenuated to arbitrarily small by tuning proper design parameters. Simulation results are given to demonstrate the effectiveness of the proposed method.
A corner-free truncation strategy for FDTD method in target scattering
Zhang, Yuxian; Feng, Naixing; Zheng, Henry Hongxing; Liu, Qing Huo
2015-12-01
In this paper, the corner-free truncation (CFT) strategy is proposed to terminate the circular boundary out of finite-difference time-domain (FDTD) region. Using the principle of reflection-free optimal thin film, the permittivity ε and the permeability μ have been extended to the complex field. The electric conductivity σe and the equivalent magnetic loss σm relate to the complex value and are suitable for the impedance-matched condition (IMC). The propagation wave can be absorbed well at the circular boundary. Moreover, computational efficiency has been much enhanced when those useless square-corners have been eliminated by using the proposed method. In TMz wave, the sinusoidal wave is set near the circular boundary. Applying the CFT strategy, the Ez amplitudes and phases show the concentric circles in the different timesteps. Compared with the square PML, numerical experiments in near- and far-field have come to the fulfillment. At the same numerical example, the CFT strategy has higher accuracy than the conformal PML. These results have fully verified the effectiveness of the proposed algorithm.
Impact of hierarchical memory systems on linear algebra algorithm design
Energy Technology Data Exchange (ETDEWEB)
Gallivan, K.; Jalby, W.; Meier, U.; Sameh, A.H.
1988-01-01
Linear algebra algorithms based on the BLAS or extended BLAS do not achieve high performance on multivector processors with a hierarchical memory system because of a lack of data locality. For such machines, block linear algebra algorithms must be implemented in terms of matrix-matrix primitives (BLAS3). Designing efficient linear algebra algorithms for these architectures requires analysis of the behavior of the matrix-matrix primitives and the resulting block algorithms as a function of certain system parameters. The analysis must identify the limits of performance improvement possible via blocking and any contradictory trends that require trade-off consideration. The authors propose a methodology that facilitates such an analysis and use it to analyze the performance of the BLAS3 primitives used in block methods. A similar analysis of the block size-performance relationship is also performed at the algorithm level for block versions of the LU decomposition and the Gram-Schmidt orthogonalization procedures.
Decker, Brennan; Allen, Jamie; Luccarini, Craig; Pooley, Karen A; Shah, Mitul; Bolla, Manjeet K; Wang, Qin; Ahmed, Shahana; Baynes, Caroline; Conroy, Don M; Brown, Judith; Luben, Robert; Ostrander, Elaine A; Pharoah, Paul Dp; Dunning, Alison M; Easton, Douglas F
2017-08-04
Breast cancer (BC) is the most common malignancy in women and has a major heritable component. The risks associated with most rare susceptibility variants are not well estimated. To better characterise the contribution of variants in ATM, CHEK2, PALB2 and XRCC2, we sequenced their coding regions in 13 087 BC cases and 5488 controls from East Anglia, UK. Gene coding regions were enriched via PCR, sequenced, variant called and filtered for quality. ORs for BC risk were estimated separately for carriers of truncating variants and of rare missense variants, which were further subdivided by functional domain and pathogenicity as predicted by four in silico algorithms. Truncating variants in PALB2 (OR=4.69, 95% CI 2.27 to 9.68), ATM (OR=3.26; 95% CI 1.82 to 6.46) and CHEK2 (OR=3.11; 95% CI 2.15 to 4.69), but not XRCC2 (OR=0.94; 95% CI 0.26 to 4.19) were associated with increased BC risk. Truncating variants in ATM and CHEK2 were more strongly associated with risk of oestrogen receptor (ER)-positive than ER-negative disease, while those in PALB2 were associated with similar risks for both subtypes. There was also some evidence that missense variants in ATM, CHEK2 and PALB2 may contribute to BC risk, but larger studies are necessary to quantify the magnitude of this effect. Truncating variants in PALB2 are associated with a higher risk of BC than those in ATM or CHEK2. A substantial risk of BC due to truncating XRCC2 variants can be excluded. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2017. All rights reserved. No commercial use is permitted unless otherwise expressly granted.
Hougardy, Stefan
2016-01-01
Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.
Identifying rock blocks based on hierarchical rock-mass structure model
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
Rock-masses are divided into many closed blocks by deterministic and stochastic discontinuities and engineering interfaces in complex rock-mass engineering. Determining the sizes, shapes, and adjacent relations of blocks is important for stability analysis of fractured rock masses. Here we propose an algorithm for identifying spatial blocks based on a hierarchical 3D Rock-mass Structure Model (RSM). First, a model is built composed of deterministic discontinuities, engineering interfaces, and the earth’s surface, and the deterministic blocks surrounded by these interfaces are traced. Then, in each deter-ministic block, a network model of stochastic discontinuities is built and the stochastic blocks are traced. Building a unitary wire frame that connects all interfaces seamlessly is the key for our algorithm to identify the above two kinds of blocks. Using this algorithm, geometric models can be built for block theory, discrete element method, and discontinuous deformation analysis.
Abrams, D.; Williams, C.
1999-01-01
This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.
Terrestrial planet formation from a truncated disk -- The 'Grand Tack'
Walsh, K. J.; Morbidelli, A.; Raymond, S.; O'Brien, D. P.; Mandell, A. M.
2012-12-01
A new terrestrial planet formation model (Walsh et al., 2011) explores the effects of a two-stage, inward-then-outward migration of Jupiter and Saturn, as found in numerous hydrodynamical simulations of giant planet formation (Masset & Snellgrove 2001, Morbidelli & Crida 2007, Pierens & Nelson 2008, Pierens & Raymond 2011). The inward migration of Jupiter truncates the disk of planetesimals and embryos in the terrestrial planet region. Subsequent accretion in that region then forms the terrestrial planets, in particular it produces the correct Earth/Mars mass ratio, which has been difficult to reproduce in simulations with a self-consistent set of initial conditions (see, eg. Raymond et al. 2009, Hansen 2009). Additionally, the outward migration of the giant planets populates the asteroid belt with distinct populations of bodies, with the inner belt filled by bodies originating inside of 3 AU, and the outer belt filled with bodies originating from beyond the giant planets. This differs from previous models of terrestrial planet formation due to the early radial mixing of material due to the giant planet's substantial migration. Specifically, the assumption that the current radial distribution of material in the inner Solar System is reflective of the primordial distribution of material in that region is no longer necessary. We will discuss the implications of this model in relation to previous models of terrestrial planet formation as well as available chemical and isotopic constraints.
Transcriptional Truncation of the Long Coding Imprinted Gene Usp29.
Directory of Open Access Journals (Sweden)
Hongzhi He
Full Text Available Usp29 (Ubiquitin-specific protease 29 is a paternally expressed gene located upstream of another imprinted gene Peg3. In the current study, the transcription of this long coding gene spanning a 250-kb genomic distance was truncated using a knockin allele. According to the results, paternal transmission of the mutant allele resulted in reduced body and litter sizes whereas the maternal transmission caused no obvious effects. In the paternal mutant, the expression levels of Usp29 were reduced to 14-18% level of the wild-type littermates due to the Poly-A signal included in the knockin cassette. Expression analyses further revealed an unusual female-specific up-regulation of the adjacent imprinted gene Zfp264 in the mutant. Consistent with this, the promoter of Zfp264 was hypomethylated only in the female mutant. Interestingly, this female-specific hypomethylation by the knockin allele was not detected in the offspring of an interspecific crossing, indicating its sensitivity to genetic background. Overall, the results suggest that the transcription of Usp29 may be involved in DNA methylation setting of Zfp264 promoter in a sex-specific manner.
Theoretical study of hydrogen storage in a truncated tetrahedron hydrocarbon
Ishikawa, Shigeru; Yamabe, Tokio
2017-02-01
A hydrocarbon molecule, having a truncated tetrahedron shape with a suitable size for the storage of a hydrogen molecule, is designed using quantum chemical methods. The molecule consists of four benzene rings bridged by six vinylene groups at the 1, 3, and 5 carbon positions of each ring, and has a stoichiometry of C36H24. The molecular geometry optimized under T d symmetry by the B3LYP/cc-pVTZ method shows no imaginary frequencies. The size of the molecular cavity, measured by the distance between opposite vinylene groups, is 8.0 Å. The cavity has four openings along each tetrahedron face. The radius of the opening is approximately 2 Å. The system interacting with a hydrogen molecule is optimized by the MP2/cc-pVTZ method. The interaction energy is evaluated by an extrapolation method through increasing the basis set size of the hydrogen molecule from the cc-pVTZ to the cc-pV6Z with counterpoise corrections. The hydrogen molecule enters the opening by overcoming an energy barrier of +730 meV and locates at the center of the cavity with a binding energy of -140 meV. The high barrier arises from the small size of the opening. The binding energy is three times larger than that of a graphite surface and may allow hydrogen storage at milder temperatures and pressures than those required with graphite.
Truncation identities for the small polaron fusion hierarchy
Grabinski, André M.; Frahm, Holger
2013-04-01
We study a one-dimensional lattice model of interacting spinless fermions. This model is integrable for both periodic and open boundary conditions; the latter case includes the presence of Grassmann valued non-diagonal boundary fields breaking the bulk U(1) symmetry of the model. Starting from the embedding of this model into a graded Yang-Baxter algebra, an infinite hierarchy of commuting transfer matrices is constructed by means of a fusion procedure. For certain values of the coupling constant related to anisotropies of the underlying vertex model taken at roots of unity, this hierarchy is shown to truncate giving a finite set of functional equations for the spectrum of the transfer matrices. For generic coupling constants, the spectral problem is formulated in terms of a functional (or TQ-)equation which can be solved by Bethe ansatz methods for periodic and diagonal open boundary conditions. Possible approaches for the solution of the model with generic non-diagonal boundary fields are discussed.
Photoevaporation as a Truncation Mechanism for Circumplanetary Disks
Mitchell, Tyler R
2011-01-01
We investigate the conditions under which the regular satellites of Jupiter and Saturn formed. The final stage of giant planet accretion is thought to occur slowly over a relatively long, 10 Myr, timescale. Gas accretion during this stage, through a completely or partially opened gap in the solar nebula, occurs slowly allowing for the condensation of ices, and incomplete differentiation, seen in the regular satellites of the giant planets. Furthermore, the dichotomy seen in the Jovian and Saturnian systems may be explained as this infall wanes or is completely shutoff as a result of gap opening or global depletion of gas in the solar nebula. We present one-dimensional simulations of circumplanetary disks that couple the viscous transport of material with the loss of mass at the disk outer edge by ultraviolet photoevaporation as well as the infall of material from the solar nebula. We find that the circumplanetary disks of these protoplanets are truncated, as a result of photoevaporation, at a range of values ...
Proteolysis of truncated hemolysin A yields a stable dimerization interface
Energy Technology Data Exchange (ETDEWEB)
Novak, Walter R.P.; Bhattacharyya, Basudeb; Grilley, Daniel P.; Weaver, Todd M. (Wabash); (UW)
2017-02-21
Wild-type and variant forms of HpmA265 (truncated hemolysin A) from
Influence of miscut on crystal truncation rod scattering
Energy Technology Data Exchange (ETDEWEB)
Munkholm, A.; Brennan, S. [Stanford Univ., CA (United States). Synchrotron Radiat. Lab.
1999-04-01
X-rays can be used to measure the roughness of a surface by the study of crystal truncation rod scattering. It is shown that for a simple cubic lattice the presence of a miscut surface with a regular step array has no effect on the scattered intensity of a single rod and that a distribution of terrace widths on the surface is shown to have the same effect as adding roughness to the surface. For a perfect crystal without miscut, the scattered intensity is the sum of the intensity from all the rods with the same in-plane momentum transfer. For all real crystals, the scattered intensity is better described as that from a single rod. It is shown that data-collection strategies must correctly account for the sample miscut or there is a potential for improperly measuring the rod intensity. This can result in an asymmetry in the rod intensity above and below the Bragg peak, which can be misinterpreted as being due to a relaxation of the surface. The calculations presented here are compared with data for silicon (001) wafers with 0.1 and 4 miscuts. (orig.) 22 refs.
Adaptive designs based on the truncated product method
Directory of Open Access Journals (Sweden)
Neuhäuser Markus
2005-09-01
Full Text Available Abstract Background Adaptive designs are becoming increasingly important in clinical research. One approach subdivides the study into several (two or more stages and combines the p-values of the different stages using Fisher's combination test. Methods Alternatively to Fisher's test, the recently proposed truncated product method (TPM can be applied to combine the p-values. The TPM uses the product of only those p-values that do not exceed some fixed cut-off value. Here, these two competing analyses are compared. Results When an early termination due to insufficient effects is not appropriate, such as in dose-response analyses, the probability to stop the trial early with the rejection of the null hypothesis is increased when the TPM is applied. Therefore, the expected total sample size is decreased. This decrease in the sample size is not connected with a loss in power. The TPM turns out to be less advantageous, when an early termination of the study due to insufficient effects is possible. This is due to a decrease of the probability to stop the trial early. Conclusion It is recommended to apply the TPM rather than Fisher's combination test whenever an early termination due to insufficient effects is not suitable within the adaptive design.
A novel model reduction method based on balanced truncation
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
The main goal of this paper is to construct an efficient reduced-order model (ROM) for unsteady aerodynamic force modeling. Balanced truncation (BT) is presented to address the problem. For conventional BT method, it is necessary to compute exact controllability and observability grammians. Although it is relatively straightforward to compute these matrices in a control setting where the system order is moderate, the technique does not extend easily to high order systems. In response to the challenge, snapshots-BT (S-BT) method is introduced for high order system ROM construction. The outline idea of the S-BT method is that snapshots of primary and dual system approximate the controllability and observability matrices in the frequency domain. The method has been demonstrated for 3 high order systems: (1) unsteady motion of a two-dimensional airfoil in response to gust, (2) AGARD 445.6 wing aeroelastic system, and (3) BACT (benchmark active control technology) standard aeroservoelastic system. All the results indicate that S-BT based ROM is efficient and accurate enough to provide a powerful tool for unsteady aerodynamic force modeling.
Truncation of the krebs cycle during hypoglycemic coma.
Sutherland, Garnette R; Tyson, Randy L; Auer, Roland N
2008-07-01
There is a misconception that hypoglycemic nerve cell death occurs easily, and can happen in the absence of coma. In fact, coma is the prerequisite for neuronal death, which occurs via metabolic excitatory amino acid release. The focus on nerve cell death does not explain how most brain neurons and all glia survive. Brain metabolism was interrogated in rats during and following recovery from 40 min of profound hypoglycemia using ex vivo (1)H MR spectroscopy to determine alterations accounting for survival of brain tissue. As previously shown, a time-dependent increase in aspartate was equaled by a reciprocal decrease in glutamate/glutamine. We here show that the kinetics of aspartate formation during the first 30 min (0.36 +/- 0.03 micromol g(-1) min(-1)) are altered such that glutamate, via aspartate aminotransferase, becomes the primary source of carbon when glucose-derived pyruvate is unavailable. Oxaloacetate is produced directly from alpha-ketoglutarate, so that reactions involving the six-carbon intermediates of the tricarboxylic acid cycle are bypassed. These fundamental observations in basic metabolic pathways in effect redraw the tricarboxylic acid cycle from a tricarboxylic to a dicarboxylic acid cycle during hypoglycemia. The basic neurochemical alterations according to the chemical equilibrium of mass action augments flux through a truncated Krebs cycle that continues to turn during hypoglycemic coma. This explains the partial preservation of energy charge and brain cell survival during periods of glucose deficiency.
Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations.
König, Gerhard; Moldaschl, Michael; Gansterer, Wilfried N
2012-09-01
New methods for computing eigenvectors of symmetric block tridiagonal matrices based on twisted block factorizations are explored. The relation of the block where two twisted factorizations meet to an eigenvector of the block tridiagonal matrix is reviewed. Based on this, several new algorithmic strategies for computing the eigenvector efficiently are motivated and designed. The underlying idea is to determine a good starting vector for an inverse iteration process from the twisted block factorizations such that a good eigenvector approximation can be computed with a single step of inverse iteration. An implementation of the new algorithms is presented and experimental data for runtime behaviour and numerical accuracy based on a wide range of test cases are summarized. Compared with competing state-of-the-art tridiagonalization-based methods, the algorithms proposed here show strong reductions in runtime, especially for very large matrices and/or small bandwidths. The residuals of the computed eigenvectors are in general comparable with state-of-the-art methods. In some cases, especially for strongly clustered eigenvalues, a loss in orthogonality of some eigenvectors is observed. This is not surprising, and future work will focus on investigating ways for improving these cases.
Analysis of genome rearrangement by block-interchanges.
Lu, Chin Lung; Lin, Ying Chih; Huang, Yen Lin; Tang, Chuan Yi
2007-01-01
Block-interchanges are a new kind of genome rearrangements that affect the gene order in a chromosome by swapping two nonintersecting blocks of genes of any length. More recently, the study of such rearrangements is becoming increasingly important because of its applications in molecular evolution. Usually, this kind of study requires to solve a combinatorial problem, called the block-interchange distance problem, which is to find a minimum number of block-interchanges between two given gene orders of linear/circular chromosomes to transform one gene order into another. In this chapter, we shall introduce the basics of block-interchange rearrangements and permutation groups in algebra that are useful in analyses of genome rearrangements. In addition, we shall present a simple algorithm on the basis of permutation groups to efficiently solve the block-interchange distance problem, as well as ROBIN, a web server for the online analyses of block-interchange rearrangements.
... Blocked Urethral Valves Health Issues Listen Español Text Size Email Print Share Blocked Urethral Valves Page Content Article Body Urine leaves the bladder through a tube called the urethra, which in boys passes through the penis. Rarely, small membranes form across the urethra in ...
Van der Vegt, Wim
2010-01-01
Related Drupal Nodes Block This module exposes a block that uses Latent Semantic Analysis (Lsa) internally to suggest three nodes that are relevant to the node a user is viewing. This module performs three tasks. 1) It periodically indexes a Drupal site and generates a Lsa Term Document Matrix. Inde
... P wave as it normally would. If an electrical signal is blocked before it reaches the ventricles, they won't contract and pump blood to the lungs and the rest of the body. Second-degree heart block is divided into two ...
Van der Vegt, Wim
2010-01-01
Related Drupal Nodes Block This module exposes a block that uses Latent Semantic Analysis (Lsa) internally to suggest three nodes that are relevant to the node a user is viewing. This module performs three tasks. 1) It periodically indexes a Drupal site and generates a Lsa Term Document Matrix. Inde
On truncated Taylor series and the position of their spurious zeros
DEFF Research Database (Denmark)
Christiansen, Søren; Madsen, Per A.
2006-01-01
A truncated Taylor series, or a Taylor polynomial, which may appear when treating the motion of gravity water waves, is obtained by truncating an infinite Taylor series for a complex, analytical function. For such a polynomial the position of the complex zeros is considered in case the Taylor...
Bounded real and positive real balanced truncation using Sigma-normalised coprime factors
Trentelman, H. L.
2009-01-01
In this article, we will extend the method of balanced truncation using normalised right coprime factors of the system transfer matrix by Meyer (1990) [3] to balanced truncation with preservation of half line dissipativity. Special cases are preservation of positive realness and bounded realness. We
Maps of zeros of truncated generating functions in high energy collisions
Brambilla, M; Ugoccioni, R
2006-01-01
Theorems on zeros of the truncated generating functions in the complex plane are reviewed and applied to the class of power series distributions. These results, when scrutinized in the framework of the truncated generating function of NB (Pascal) MD type, lead to maps of zeros which are different in correspondence to different classes of events in pp collisions at LHC c.m. energies.
Resonant Excitation of a Truncated Metamaterial Cylindrical Shell by a Thin Wire Monopole
DEFF Research Database (Denmark)
Kim, Oleksiy S.; Erentok, Aycan; Breinbjerg, Olav
2009-01-01
A truncated metamaterial cylindrical shell excited by a thin wire monopole is investigated using the integral equation technique as well as the finite element method. Simulations reveal a strong field singularity at the edge of the truncated cylindrical shell, which critically affects the matching...
Improving on the empirical covariance matrix using truncated PCA with white noise residuals
Jewson, S
2005-01-01
The empirical covariance matrix is not necessarily the best estimator for the population covariance matrix: we describe a simple method which gives better estimates in two examples. The method models the covariance matrix using truncated PCA with white noise residuals. Jack-knife cross-validation is used to find the truncation that maximises the out-of-sample likelihood score.
Inference for shared-frailty survival models with left-truncated data
van den Berg, G.J.; Drepper, B.
2016-01-01
Shared-frailty survival models specify that systematic unobserved determinants of duration outcomes are identical within groups of individuals. We consider random-effects likelihood-based statistical inference if the duration data are subject to left-truncation. Such inference with left-truncated da
A protein-truncating R179X variant in RNF186 confers protection against ulcerative colitis
Rivas, Manuel A.; Graham, Daniel; Sulem, Patrick; Stevens, Christine; Desch, A. Nicole; Goyette, Philippe; Gudbjartsson, Daniel; Jonsdottir, Ingileif; Thorsteinsdottir, Unnur; Degenhardt, Frauke; Mucha, Soeren; Kurki, Mitja I.; Li, Dalin; D'Amato, Mauro; Annese, Vito; Vermeire, Severine; Weersma, Rinse K.; Halfvarson, Jonas; Paavola-Sakki, Paulina; Lappalainen, Maarit; Lek, Monkol; Cummings, Beryl; Tukiainen, Taru; Haritunians, Talin; Halme, Leena; Koskinen, Lotta L. E.; Ananthakrishnan, Ashwin N.; Luo, Yang; Heap, Graham A.; Visschedijk, Marijn C.; MacArthur, Daniel G.; Neale, Benjamin M.; Ahmad, Tariq; Anderson, Carl A.; Brant, Steven R.; Duerr, Richard H.; Silverberg, Mark S.; Cho, Judy H.; Palotie, Aarno; Saavalainen, Paivi; Kontula, Kimmo; Farkkila, Martti; McGovern, Dermot P. B.; Franke, Andre; Stefansson, Kari; Rioux, John D.; Xavier, Ramnik J.; Daly, Mark J.
2016-01-01
Protein-truncating variants protective against human disease provide in vivo validation of therapeutic targets. Here we used targeted sequencing to conduct a search for protein-truncating variants conferring protection against inflammatory bowel disease exploiting knowledge of common variants associ
Stellar disk truncations at high z : Probing inside-out galaxy formation
Trujillo, [No Value; Pohlen, M
2005-01-01
We have conducted a systematic search for stellar disk truncations in disklike galaxies at intermediate redshift (z <1.1) using the Hubble Ultra Deep Field data. We use the position of the truncation as a direct estimator of the size of the stellar disk. After accounting for the surface brightness e
TWO ALGORITHMS FOR SYMMETRIC LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deflation to drop converged linear systems using a natural convergence criterion, and present an adaptive block Lanczos algorithm. We propose also a block version of Paige and Saunders' MINRES method for iterative solution of symmetric linear systems, and describe important implementation details. We establish a relationship between the block Lanczos algorithm and block MINRES algorithm, and compare the numerical performance of the Lanczos algorithm and MINRES method for symmetric linear systems applied to a sequence of right-hand sides with that of the block Lanczos algorithm and block MINRES algorithm for multiple linear systems simultaneously.
Arrighi, Pablo
2010-01-01
We define the block neighborhood of a reversible CA, which is related both to its decomposition into a product of block permutations and to quantum computing. We give a purely combinatorial characterization of the block neighborhood, which helps in two ways. First, it makes the computation of the block neighborhood of a given CA relatively easy. Second, it allows us to derive upper bounds on the block neighborhood: for a single CA as function of the classical and inverse neighborhoods, and for the composition of several CAs. One consequence of that is a characterization of a class of "elementary" CAs that cannot be written as the composition of two simpler parts whose neighborhoods and inverse neighborhoods would be reduced by one half.
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
In this paper, a theoretical and numerical as-sessment of the validity of Eulerian truncation in stochastic modeling is presented. Specifically, we analyze and compare theoretically various existing Eulerian-based first-order tech-niques with and without invoking "Eulerian truncation" and quantify the terms truncated and retained in the stochastic per-turbation equations using high resolution Monte Carlo simula-tions. We also analyze and compare numerically various exist-ing Eulerian-based first-order techniques and Monte Carlo simulation. The obtained results have demonstrated theoreti-cally and numerically that existing Eulerian-based stochastic perturbation techniques are equivalent. The terms truncated are indeed one order higher than those retained. Therefore,we conclude that "Eulerian truncation" is mathematically con-sistent and asymptotic.
Numerical experiments on the efficiency of local grid refinement based on truncation error estimates
Syrakos, Alexandros; Bartzis, John G; Goulas, Apostolos
2015-01-01
Local grid refinement aims to optimise the relationship between accuracy of the results and number of grid nodes. In the context of the finite volume method no single local refinement criterion has been globally established as optimum for the selection of the control volumes to subdivide, since it is not easy to associate the discretisation error with an easily computable quantity in each control volume. Often the grid refinement criterion is based on an estimate of the truncation error in each control volume, because the truncation error is a natural measure of the discrepancy between the algebraic finite-volume equations and the original differential equations. However, it is not a straightforward task to associate the truncation error with the optimum grid density because of the complexity of the relationship between truncation and discretisation errors. In the present work several criteria based on a truncation error estimate are tested and compared on a regularised lid-driven cavity case at various Reyno...
On the convergence of inexact Uzawa algorithms
Energy Technology Data Exchange (ETDEWEB)
Welfert, B.D. [Arizona State Univ., Tempe, AZ (United States)
1994-12-31
The author considers the solution of symmetric indefinite systems which can be cast in matrix block form, where diagonal blocks A and C are symmetric positive definite and semi-definite, respectively. Systems of this type arise frequently in quadratic minimization problems, as well as mixed finite element discretizations of fluid flow equation. The author uses the Uzawa algorithm to precondition the matrix equations.
Chaotic block iterating method for pseudo-random sequence generator
Institute of Scientific and Technical Information of China (English)
CHEN Shuai; ZHONG Xian-xin
2007-01-01
A pseudo-random sequence generator is a basic tool for cryptography. To realize a pseudo-random sequence generator, a new block iterating method using shifter, multiplier,and adder operations has been introduced. By increasing the iteration of the counter and by performing calculations based on the initial value, an approximate pseudo-random sequence was obtained after exchanging bits. The algorithm and the complexity of the generator were introduced. The result obtained from the calculation shows that the self-correlation of the "m" block sequence is two-valued; the block field value is [0,2m - 1 ], and the block period is 2m+8 - 1.
Standards for Graph Algorithm Primitives
Mattson, Tim; Bader, David; Berry, Jon; Buluc, Aydin; Dongarra, Jack; Faloutsos, Christos; Feo, John; Gilbert, John; Gonzalez, Joseph; Hendrickson, Bruce; Kepner, Jeremy; Leiserson, Charles; Lumsdaine, Andrew; Padua, David; Poole, Stephen
2014-01-01
It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building blocks. This paper is a position paper defining the problem and announcing our intention to launch an open effort to define this standard.
Mills, Kerry E; Pearce, J Andrew; Crabb, Brendan S; Cowman, Alan F
2002-03-01
Merozoite surface protein 3 (MSP3), an important vaccine candidate, is a soluble polymorphic antigen associated with the surface of Plasmodium falciparum merozoites. The MSP3 sequence contains three blocks of heptad repeats that are consistent with the formation of an intramolecular coiled-coil. MSP3 also contains a glutamic acid-rich region and a putative leucine zipper sequence at the C-terminus. We have disrupted the msp3 gene by homologous recombination, resulting in the expression of a truncated form of MSP3 that lacks the putative leucine zipper sequence but retains the glutamic acid-rich region and the heptad repeats. Here, we show that truncated MSP3, lacking the putative leucine zipper region, does not localize to the parasitophorous vacuole or interact with the merozoite surface. Furthermore, the acidic-basic repeat antigen (ABRA), which is present on the merozoite surface, also was not localized to the merozoite surface in parasites expressing the truncated form of MSP3. The P. falciparum merozoites lacking MSP3 and ABRA on the surface show reduced invasion into erythrocytes. These results suggest that MSP3 is not absolutely essential for blood stage growth and that the putative leucine zipper region is required for the trafficking of both MSP3 and ABRA to the parasitophorous vacuole.
Seismicity of the Jalisco Block
Nunez-Cornu, F. J.; Rutz, M.; Camarena-Garcia, M.; Trejo-Gomez, E.; Reyes-Davila, G.; Suarez-Plascencia, C.
2002-12-01
In April 2002 began to transmit the stations of the first phase of Jalisco Telemetric Network located at the northwest of Jalisco Block and at the area of Volcan de Fuego (Colima Volcano), in June were deployed four additional MarsLite portable stations in the Bahia de Banderas area, and by the end of August one more portable station at Ceboruco Volcano. The data of these stations jointly with the data from RESCO (Colima Telemetric Network) give us the minimum seismic stations coverage to initiate in a systematic and permanent way the study of the seismicity in this very complex tectonic region. A preliminary analysis of seismicity based on the events registered by the networks using a shutter algorithm, confirms several important features proposed by microseismicity studies carried out between 1996 and 1998. A high level of seismicity inside and below of Rivera plate is observed, this fact suggest a very complex stress pattern acting on this plate. Shallow seismicity at south and east of Bahia de Banderas also suggest a complex stress pattern in this region of the Jalisco Block, events at more than 30 km depth are located under the mouth of the bay and in face of it, a feature denominated Banderas Boundary mark the change of the seismic regime at north of this latitude (20.75°N), however some shallow events were located at the region of Nayarit.
A block variant of the GMRES method on massively parallel processors
Energy Technology Data Exchange (ETDEWEB)
Li, Guangye [Cray Research, Inc., Eagan, MN (United States)
1996-12-31
This paper presents a block variant of the GMRES method for solving general unsymmetric linear systems. This algorithm generates a transformed Hessenberg matrix by solely using block matrix operations and block data communications. It is shown that this algorithm with block size s, denoted by BVGMRES(s,m), is theoretically equivalent to the GMRES(s*m) method. The numerical results show that this algorithm can be more efficient than the standard GMRES method on a cache based single CPU computer with optimized BLAS kernels. Furthermore, the gain in efficiency is more significant on MPPs due to both efficient block operations and efficient block data communications. Our numerical results also show that in comparison to the standard GMRES method, the more PEs that are used on an MPP, the more efficient the BVGMRES(s,m) algorithm is.
New pole placement algorithm - Polynomial matrix approach
Shafai, B.; Keel, L. H.
1990-01-01
A simple and direct pole-placement algorithm is introduced for dynamical systems having a block companion matrix A. The algorithm utilizes well-established properties of matrix polynomials. Pole placement is achieved by appropriately assigning coefficient matrices of the corresponding matrix polynomial. This involves only matrix additions and multiplications without requiring matrix inversion. A numerical example is given for the purpose of illustration.
Block copolymer battery separator
Energy Technology Data Exchange (ETDEWEB)
Wong, David; Balsara, Nitash Pervez
2016-04-26
The invention herein described is the use of a block copolymer/homopolymer blend for creating nanoporous materials for transport applications. Specifically, this is demonstrated by using the block copolymer poly(styrene-block-ethylene-block-styrene) (SES) and blending it with homopolymer polystyrene (PS). After blending the polymers, a film is cast, and the film is submerged in tetrahydrofuran, which removes the PS. This creates a nanoporous polymer film, whereby the holes are lined with PS. Control of morphology of the system is achieved by manipulating the amount of PS added and the relative size of the PS added. The porous nature of these films was demonstrated by measuring the ionic conductivity in a traditional battery electrolyte, 1M LiPF.sub.6 in EC/DEC (1:1 v/v) using AC impedance spectroscopy and comparing these results to commercially available battery separators.
U.S. Environmental Protection Agency — This data layer represents Census 2000 demographic data derived from the PL94-171 redistricting files and SF3. Census geographic entities include blocks, blockgroups...
Stern, Margaret
1987-01-01
Extracts from "Experimenting with Numbers" by Margaret Stern demonstrate the use of Stern Blocks to develop the conceptual base on which learning disabled students can build further mathematical skills. (DB)
Steroidal neuromuscular blocking agents
Wierda, JMKH; Mori, K; Ohmura, A; Toyooka, H; Hatano, Y; Shingu, K; Fukuda, K
1998-01-01
Since 1964 approximately 20 steroidal neuromuscular blocking agents have been evaluated clinically. Pancuronium, a bisquaternary compound designed on the drawingboard, was the first steroidal relaxant introduced into clinical practice worldwide in the 1970's. Although a major improvement, pancuroniu
Block copolymer battery separator
Wong, David; Balsara, Nitash Pervez
2016-04-26
The invention herein described is the use of a block copolymer/homopolymer blend for creating nanoporous materials for transport applications. Specifically, this is demonstrated by using the block copolymer poly(styrene-block-ethylene-block-styrene) (SES) and blending it with homopolymer polystyrene (PS). After blending the polymers, a film is cast, and the film is submerged in tetrahydrofuran, which removes the PS. This creates a nanoporous polymer film, whereby the holes are lined with PS. Control of morphology of the system is achieved by manipulating the amount of PS added and the relative size of the PS added. The porous nature of these films was demonstrated by measuring the ionic conductivity in a traditional battery electrolyte, 1M LiPF.sub.6 in EC/DEC (1:1 v/v) using AC impedance spectroscopy and comparing these results to commercially available battery separators.
Recipient block TMA technique.
Mirlacher, Martina; Simon, Ronald
2010-01-01
New high-throughput screening technologies have led to the identification of hundreds of genes with a potential role in cancer or other diseases. One way to prioritize the leads obtained in such studies is to analyze a large number of tissues for candidate gene expression. The TMA methodology is now an established and frequently used tool for high-throughput tissue analysis. The recipient block technology is the "classical" method of TMA making. In this method, minute cylindrical tissue punches typically measuring 0.6 mm in diameter are removed from donor tissue blocks and are transferred into empty "recipient" paraffin blocks. Up to 1,000 different tissues can be analyzed in one TMA block. The equipment is affordable and easy to use in places where basic skills in histology are available.
Superalloy Lattice Block Structures
Nathal, M. V.; Whittenberger, J. D.; Hebsur, M. G.; Kantzos, P. T.; Krause, D. L.
2004-01-01
Initial investigations of investment cast superalloy lattice block suggest that this technology will yield a low cost approach to utilize the high temperature strength and environmental resistance of superalloys in lightweight, damage tolerant structural configurations. Work to date has demonstrated that relatively large superalloy lattice block panels can be successfully investment cast from both IN-718 and Mar-M247. These castings exhibited mechanical properties consistent with the strength of the same superalloys measured from more conventional castings. The lattice block structure also accommodates significant deformation without failure, and is defect tolerant in fatigue. The potential of lattice block structures opens new opportunities for the use of superalloys in future generations of aircraft applications that demand strength and environmental resistance at elevated temperatures along with low weight.
DEFF Research Database (Denmark)
Miolane, Charlotte Vikkelsø
ensurethat no attack violatesthe securitybounds specifiedbygeneric attack namely exhaustivekey search and table lookup attacks. This thesis contains a general introduction to cryptography with focus on block ciphers and important block cipher designs, in particular the Advanced Encryption Standard...... by an analytic and systematic approach that allows insight to the techniques. Moreover a new procedure of generating and applying probabilistic equations in algebraic attacks on block cipher is proposed and examined. Also, we present practical results, which to our knowledge are the best algebraic results...... on small scale variants of AES. In the final part of the thesis we present a new block cipher proposal Present and examine its security against algebraic and differential cryptanalysis in particular....
Directory of Open Access Journals (Sweden)
Chi-Jim Chen
2015-03-01
Full Text Available A sweeping fingerprint sensor converts fingerprints on a row by row basis through image reconstruction techniques. However, a built fingerprint image might appear to be truncated and distorted when the finger was swept across a fingerprint sensor at a non-linear speed. If the truncated fingerprint images were enrolled as reference targets and collected by any automated fingerprint identification system (AFIS, successful prediction rates for fingerprint matching applications would be decreased significantly. In this paper, a novel and effective methodology with low time computational complexity was developed for detecting truncated fingerprints in a real time manner. Several filtering rules were implemented to validate existences of truncated fingerprints. In addition, a machine learning method of supported vector machine (SVM, based on the principle of structural risk minimization, was applied to reject pseudo truncated fingerprints containing similar characteristics of truncated ones. The experimental result has shown that an accuracy rate of 90.7% was achieved by successfully identifying truncated fingerprint images from testing images before AFIS enrollment procedures. The proposed effective and efficient methodology can be extensively applied to all existing fingerprint matching systems as a preliminary quality control prior to construction of fingerprint templates.
Chen, Chi-Jim; Pai, Tun-Wen; Cheng, Mox
2015-01-01
A sweeping fingerprint sensor converts fingerprints on a row by row basis through image reconstruction techniques. However, a built fingerprint image might appear to be truncated and distorted when the finger was swept across a fingerprint sensor at a non-linear speed. If the truncated fingerprint images were enrolled as reference targets and collected by any automated fingerprint identification system (AFIS), successful prediction rates for fingerprint matching applications would be decreased significantly. In this paper, a novel and effective methodology with low time computational complexity was developed for detecting truncated fingerprints in a real time manner. Several filtering rules were implemented to validate existences of truncated fingerprints. In addition, a machine learning method of supported vector machine (SVM), based on the principle of structural risk minimization, was applied to reject pseudo truncated fingerprints containing similar characteristics of truncated ones. The experimental result has shown that an accuracy rate of 90.7% was achieved by successfully identifying truncated fingerprint images from testing images before AFIS enrollment procedures. The proposed effective and efficient methodology can be extensively applied to all existing fingerprint matching systems as a preliminary quality control prior to construction of fingerprint templates. PMID:25835186
Institute of Scientific and Technical Information of China (English)
陈阳; 杨绿溪; 何振亚
2000-01-01
The problem of blind separation of signals in post-nonlinear mixture is addressed in this paper.The post-nonlinear mixture is formed by a component wise nonlinear distortion after the linear mixture.Hence a nonlinear adjusting part placed in front of the linear separation structure is needed to compensate for the distortion in separating such signals.The learning rules for the post-nonlinear separation structure are derived by a maximum likelihood approach.An algorithm for blind separation of post-nonlinearly mixed sub- and super-Gaussian signals is proposed based on some previous work.Multilayer perceptrons are used in this algorithm to model the nonlinear part of the separation structure.The algorithm switches between sub- and super-Gaussian probability models during learning according to a stability condition and operates in a block-adaptive manner.The effectiveness of the algorithm is verified by experiments on simulated and real-world signals.%本文研究了后非线性混合信号的盲分离.后非线性混合信号是由线性混合的每一路信号分别经过一个非线性畸变产生的.因此分离这种信号需要在适用于线性混合的线性分离结构前放置一个用于补偿非线性畸变的非线性校正部分.本文用一种最大似然方法推导了一般后非线性分离结构的学习公式.在前人一些工作的基础上，提出了一种用于亚、超高斯信号后非线性混合的盲分离算法.该算法用多层感知器对分离结构的非线性校正部分进行建模，迭代过程中根据一稳定性条件在分别适用于亚、超高斯信号的概率模型间进行切换并以块自适应方式工作.通过对模拟信号及实际信号(图像和语音)的实验证明了该算法的有效性.
Cloning of a C-terminally truncated NK-1 receptor from guinea-pig nervous system.
Baker, Sarah J; Morris, Judy L; Gibbins, Ian L
2003-03-17
In order to examine the possibility that some actions of substance P may be mediated by a variant of the neurokinin-1 (NK-1) receptor, we isolated and sequenced the cDNA encoding a truncated NK-1 receptor from guinea-pig celiac ganglion and brain mRNA by two-step RT-PCR based on the 3'RACE method. The truncated NK-1 receptor sequence corresponded to a splice variant missing the final exon 5, and encoded a 311-amino acid protein that was truncated just after transmembrane domain 7, in an identical position to a truncated variant of the human NK-1 receptor. Thus, the truncated NK-1 receptor lacked the intracellular C-terminus sequence required for the phosphorylation and internalisation of the full-length NK-1 receptor. Using a sensitive one-step semi-quantitative RT-PCR assay, we detected mRNA for both the full length and truncated NK-1 receptors throughout the brain, spinal cord, sensory and autonomic ganglia, and viscera. Truncated NK-1 receptor mRNA was present in lower quantities than mRNA for the full-length NK-1R in all tissues. Highest levels of mRNA for the truncated NK-1 receptor were detected in coeliac ganglion, spinal cord, basal ganglia and hypothalamus. An antiserum to the N-terminus of the NK-1 receptor labelled dendrites of coeliac ganglion neurons that were not labelled with antisera to the C-terminus of the full length NK-1 receptor. These results show that a C-terminally truncated variant of the NK-1 receptor is likely to be widespread in central and peripheral nervous tissue. We predict that this receptor will mediate actions of substance P on neurons where immunohistochemical evidence for a full-length NK-1 receptor is lacking.
Wang, Xiaogang; Zhao, Daomu
2013-09-15
We propose a simple amplitude-phase retrieval attack free cryptosystem based on direct attack to phase-truncated Fourier-transform-based encryption using a random amplitude mask (RAM). The RAM that is not saved during the encryption provides extremely high security for the two private keys, and no iterative calculations are involved in the nonlinear encryption process. Lack of enough constraints makes the specific attack based on iterative amplitude-phase retrieval algorithms unusable. Numerical simulation results are given for testing the validity and security of the proposed approach.
An algorithm for the matrix lambert W function
Massimiliano Fasi, Nicholas J. Higham, Bruno Iannazzo
2015-01-01
An algorithm is proposed for computing primary matrix Lambert $W$ functions of a square matrix $A$, which are solutions of the matrix equation $We^W = A$. The algorithm employs the Schur decomposition and blocks the triangular form in such a way that Newton's method can be used on each diagonal block, with a starting matrix depending on the block. A natural simplification of Newton's method for the Lambert $W$ function is shown to be numerically unstable. By reorganizing the...
Natural convection through enclosed disconnected solid blocks
Energy Technology Data Exchange (ETDEWEB)
Lao, Fernando Cesar De; Junqueira, Silvio L.M.; Franco, Admilson T. [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)]. E-mails: fernandodelai@gmail.com; silvio@utfpr.edu.br; admilson@utfpr.edu.br; Lage, Jose L. [Southern Methodist University (SMU), Dallas, TX (United States)]. E-mail: JLL@smu.edu
2008-07-01
In this study, the natural convection inside a fluid filled, enclosure containing several solid obstructions and being heated from the side is modeled and numerically simulated. The solid obstructions are equally spaced, conducting, and disconnected square blocks. The mathematical model is based on the balance equations of mass, momentum and energy, which are then solved numerically via the finite-volume method with the SIMPLEST algorithm and the HYBRID scheme. The effects of varying the solid-fluid thermal conductivity ratio (K), the fluid volume-fraction or porosity ({phi}), the number of solid blocks (N) and the heating strength (represented by the Rayleigh number, Ra) of the enclosure on the Nusselt number based on the surface-averaged heat transfer coefficient along the heated wall of the enclosure are studied. The results indicate a competing effect caused by the proximity of the solid blocks to the heated and cooled walls, vis-a-vis hindering the boundary layer growth, hence reducing the heat transfer effectiveness, and at the same time enhancing the heat transfer when the blocks' thermal conductivity is larger than that of the fluid. An analytical estimate of the minimum number of blocks beyond which the convection hindrance becomes predominant is presented and validated by the numerical results. (author)
Truncated Human LMP-1 Triggers Differentiation of C2C12 Cells to an Osteoblastic Phenotype in vitro
Institute of Scientific and Technical Information of China (English)
2007-01-01
LIM mineralization protein-1 (LMP-1) is a novel intracellular osteoinductive protein that has been shown to induce bone formation both in vitro and in vivo. LMP-1 contains an N-terminal PDZ domain and three C-terminal LIM domains. In this study, we investigated whether a truncated form of human LMP-1 (hLMP-1 [t]), lacking the three C-terminal LIM domains, triggers the differentiation of pluripotent myoblastic C2C12 cells to the osteoblast lineage. C2C12 cells were transiently transduced with Ad5-hLMP-1(t)-green fluorescent protein or viral vector control. The expression of hLMP-1 (t) RNA and the truncated protein were examined. The results showed that hLMP-1(t) blocked myotube formation in C2C12 cultures and significantly enhanced the alkaline phosphatase (ALP) activity. In addition, the expressions of ALP,osteocalcin, and bone morphogenetic protein (BMP)-2 and BMP-7 genes were also increased. The induction of these key osteogenic markers suggests that hLMP-1(t) can trigger the pluripotent myoblastic C2C12 cells to differentiate into osteoblastic lineage, thus extending our previous observation that LMP-1 and LMP-1 (t)enhances the osteoblastic phenotype in cultures of cells already committed to the osteoblastic lineage.Therefore, C2C12 cells are an appropriate model system for the examination of LMP-1 induction of the osteoblastic phenotype and the study of mechanisms of LMP- 1 action.
Thomas-Keprta, Kathie L.; Clemett, Simon J.; Bazylinski, Dennis A.; Kirschvink, Joseph L.; McKay, David S.; Wentworth, Susan J.; Vali, H.; Gibson, Everett K.
2001-01-01
We suggest that the observation of truncated hexa-octahedral magnetites in ALH84001 are both consistent with, and in the absence of terrestrial inorganic analogs, likely formed by biogenic processes. Additional information is contained in the original extended abstract.
Institute of Scientific and Technical Information of China (English)
LI She-Qiang; FU Xing-Qiu; HU Bing; DENG Jia-Jun; CHEN Lei
2009-01-01
The oxidation of formic acid on edge-truncated cubic platinum nanoparticles/C catalysts is investigated. X-ray photoelectron spectroscopy analysis indicates that the surface of edge-truncated cubic platinum nanoparticles is composed of two types of coordination sites. The oxidation behavior of formic acid on edge-truncated cubic platinum nanoparticles/C is investigated using cyclic voltammetry. The apparent activation energies are found to be 54.2, 55.0, 61.8, 69.5, 71.9, 69.26, 65.28kJ/mol at 0.15, 0.3, 0.4, 0.5, 0.6, 0.65, 0.7 V, respectively. A specific surface area activity of 1.76mA·cm~(-2) at 0.4 V indicates that the edge-truncated cubic Platinum nanoparticles are a promising anode catalyst for direct formic acid fuel cells.
Pons, J M; Pons, Josep M.; Talavera, Pere
2004-01-01
We clarify the existence of two different types of truncations of the field content in a theory, the consistency of each type being achieved by different means. A proof is given of the conditions to have a consistent truncation in the case of dimensional reductions induced by independent Killing vectors. We explain in what sense the tracelessness condition found by Scherk and Scharwz is not only a necessary condition but also a {\\it sufficient} one for a consistent truncation. The reduction of the gauge group is fully performed showing the existence of a sector of rigid symmetries. We show that truncations originated by the introduction of constraints will in general be inconsistent, but this fact does not prevent the possibility of correct upliftings of solutions in some cases. The presence of constraints has dynamical consequences that turn out to play a fundamental role in the correctness of the uplifting procedure.
Kuzyk, Mark G
2014-01-01
The Thomas Kuhn Reich sum rules and the sum-over-states (SOS) expression for the hyperpolarizabilities are truncated when calculating the fundamental limits of nonlinear susceptibilities. Truncation of the SOS expression can lead to an accurate approximation of the first and second hyperpolarizabilities due to energy denominators, which can make the truncated series converge to within 10% of the full series after only a few excited states are included in the sum. The terms in the sum rule series, however, are weighted by the state energies, so convergence of the series requires that the position matrix elements scale at most in inverse proportion to the square root of the energy. Even if the convergence condition is met, serious pathologies arise, including self inconsistent sum rules and equations that contradict reality. As a result, using the truncated sum rules alone leads to pathologies that make any rigorous calculations impossible, let alone yielding even good approximations. This paper discusses condi...
Institute of Scientific and Technical Information of China (English)
Zhenhan TU; Zhonghua WANG
2013-01-01
This paper proves some uniqueness theorems for meromorphic mappings in several complex variables into the complex projective space PN(C) with truncated multiplicities,and our results improve some earlier work.
truncSP: An R Package for Estimation of Semi-Parametric Truncated Linear Regression Models
Directory of Open Access Journals (Sweden)
Maria Karlsson
2014-05-01
Full Text Available Problems with truncated data occur in many areas, complicating estimation and inference. Regarding linear regression models, the ordinary least squares estimator is inconsistent and biased for these types of data and is therefore unsuitable for use. Alternative estimators, designed for the estimation of truncated regression models, have been developed. This paper presents the R package truncSP. The package contains functions for the estimation of semi-parametric truncated linear regression models using three different estimators: the symmetrically trimmed least squares, quadratic mode, and left truncated estimators, all of which have been shown to have good asymptotic and ?nite sample properties. The package also provides functions for the analysis of the estimated models. Data from the environmental sciences are used to illustrate the functions in the package.
Propagation of a general-type beam through a truncated fractional Fourier transform optical system.
Zhao, Chengliang; Cai, Yangjian
2010-03-01
Paraxial propagation of a general-type beam through a truncated fractional Fourier transform (FRT) optical system is investigated. Analytical formulas for the electric field and effective beam width of a general-type beam in the FRT plane are derived based on the Collins formula. Our formulas can be used to study the propagation of a variety of laser beams--such as Gaussian, cos-Gaussian, cosh-Gaussian, sine-Gaussian, sinh-Gaussian, flat-topped, Hermite-cosh-Gaussian, Hermite-sine-Gaussian, higher-order annular Gaussian, Hermite-sinh-Gaussian and Hermite-cos-Gaussian beams--through a FRT optical system with or without truncation. The propagation properties of a Hermite-cos-Gaussian beam passing through a rectangularly truncated FRT optical system are studied as a numerical example. Our results clearly show that the truncated FRT optical system provides a convenient way for laser beam shaping.
Impact of degree truncation on the spread of a contagious process on networks
Harling, Guy
2016-01-01
Understanding how person-to-person contagious processes spread through a population requires accurate information on connections between population members. However, such connectivity data, when collected via interview, is often incomplete due to partial recall, respondent fatigue or study design, e.g., fixed choice designs (FCD) truncate out-degree by limiting the number of contacts each respondent can report. Past research has shown how FCD truncation affects network properties, but its implications for predicted speed and size of spreading processes remain largely unexplored. To study the impact of degree truncation on spreading processes, we generated collections of synthetic networks containing specific properties (degree distribution, degree-assortativity, clustering), and also used empirical social network data from 75 villages in Karnataka, India. We simulated FCD using various truncation thresholds and ran a susceptible-infectious-recovered (SIR) process on each network. We found that spreading proce...
A protein-truncating R179X variant in RNF186 confers protection against ulcerative colitis
Rivas, Manuel A.; Graham, Daniel; Sulem, Patrick; Stevens, Christine; Desch, A. Nicole; Goyette, Philippe; Gudbjartsson, Daniel; Jonsdottir, Ingileif; Thorsteinsdottir, Unnur; Degenhardt, Frauke; Mucha, Sören; Kurki, Mitja I.; Li, Dalin; D'Amato, Mauro; Annese, Vito; Vermeire, Severine; Weersma, Rinse K.; Halfvarson, Jonas; Paavola-Sakki, Paulina; Lappalainen, Maarit; Lek, Monkol; Cummings, Beryl; Tukiainen, Taru; Haritunians, Talin; Halme, Leena; Koskinen, Lotta L. E.; Ananthakrishnan, Ashwin N.; Luo, Yang; Heap, Graham A.; Visschedijk, Marijn C.; Barrett, J; de Lange, K; Edwards, C; Hart, A; Hawkey, C; Jostins, L; Kennedy, N; Lamb, C; Lee, J; Lees, C; Mansfield, J; Mathew, C; Mowatt, C; Newman, W; Nimmo, E; Parkes, M; Pollard, M; Prescott, N; Randall, J; Rice, D; Satsangi, J; Simmons, A; Tremelling, M; Uhlig, H; Wilson, D; Abraham, C; Achkar, J.P; Bitton, A; Boucher, G; Croitoru, K; Fleshner, P; Glas, J; Kugathasan, S; Limbergen, J.V; Milgrom, R; Proctor, D; Regueiro, M; Schumm, P.L; Sharma, Y; Stempak, J.M; Targan, S.R; Wang, M.H; MacArthur, Daniel G.; Neale, Benjamin M.; Ahmad, Tariq; Anderson, Carl A.; Brant, Steven R.; Duerr, Richard H.; Silverberg, Mark S.; Cho, Judy H; Palotie, Aarno; Saavalainen, Päivi; Kontula, Kimmo; Färkkilä, Martti; McGovern, Dermot P. B.; Franke, Andre; Stefansson, Kari; Rioux, John D.; Xavier, Ramnik J.; Daly, Mark J.; Barrett, J.; de Lane, K.; Edwards, C.; Hart, A.; Hawkey, C.; Jostins, L.; Kennedy, N.; Lamb, C.; Lee, J.; Lees, C.; Mansfield, J.; Mathew, C.; Mowatt, C.; Newman, B.; Nimmo, E.; Parkes, M.; Pollard, M.; Prescott, N.; Randall, J.; Rice, D.; Satsangi, J.; Simmons, A.; Tremelling, M.; Uhlig, H.; Wilson, D.; Abraham, C.; Achkar, J. P.; Bitton, A.; Boucher, G.; Croitoru, K.; Fleshner, P.; Glas, J.; Kugathasan, S.; Limbergen, J. V.; Milgrom, R.; Proctor, D.; Regueiro, M.; Schumm, P. L.; Sharma, Y.; Stempak, J. M.; Targan, S. R.; Wang, M. H.
2016-01-01
Protein-truncating variants protective against human disease provide in vivo validation of therapeutic targets. Here we used targeted sequencing to conduct a search for protein-truncating variants conferring protection against inflammatory bowel disease exploiting knowledge of common variants associated with the same disease. Through replication genotyping and imputation we found that a predicted protein-truncating variant (rs36095412, p.R179X, genotyped in 11,148 ulcerative colitis patients and 295,446 controls, MAF=up to 0.78%) in RNF186, a single-exon ring finger E3 ligase with strong colonic expression, protects against ulcerative colitis (overall P=6.89 × 10−7, odds ratio=0.30). We further demonstrate that the truncated protein exhibits reduced expression and altered subcellular localization, suggesting the protective mechanism may reside in the loss of an interaction or function via mislocalization and/or loss of an essential transmembrane domain. PMID:27503255
Cao, Youfang; Terebus, Anna; Liang, Jie
2016-04-01
The discrete chemical master equation (dCME) provides a general framework for studying stochasticity in mesoscopic reaction networks. Since its direct solution rapidly becomes intractable due to the increasing size of the state space, truncation of the state space is necessary for solving most dCMEs. It is therefore important to assess the consequences of state space truncations so errors can be quantified and minimized. Here we describe a novel method for state space truncation. By partitioning a reaction network into multiple molecular equivalence groups (MEGs), we truncate the state space by limiting the total molecular copy numbers in each MEG. We further describe a theoretical framework for analysis of the truncation error in the steady-state probability landscape using reflecting boundaries. By aggregating the state space based on the usage of a MEG and constructing an aggregated Markov process, we show that the truncation error of a MEG can be asymptotically bounded by the probability of states on the reflecting boundary of the MEG. Furthermore, truncating states of an arbitrary MEG will not undermine the estimated error of truncating any other MEGs. We then provide an overall error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we also introduce an a priori method to estimate the upper bound of its truncation error. This a priori estimate can be rapidly computed from reaction rates of the network, without the need of costly trial solutions of the dCME. As examples, we show results of applying our methods to the four stochastic networks of (1) the birth and death model, (2) the single gene expression model, (3) the genetic toggle switch model, and (4) the phage lambda bistable epigenetic switch model. We demonstrate how truncation errors and steady-state probability landscapes can be computed using different sizes of the MEG(s) and how the results validate our theories. Overall, the novel state space
On the scale estimation using truncated swath measurements from low Earth orbiting satellites
Liu, Qi
2013-05-01
Truncation effect caused by limited swath width of low Earth orbiting (LEO) satellites results in inevitable underestimation of object scale when using pixel-counting methods. A new approach is proposed to obtain more accurate object scale through truncated measurements. The approach is based upon the mean object area fraction (MOAF), which depicts the relative population of object points in a varying-size domain and proves to be less sensitive to truncation effect. The MOAF-equivalent radius (MER) is deduced by comparing the actual MOAF with the standard one inferred from a circle object. Numerical simulations are implemented to demonstrate the MER characteristics. In contrast to area-equivalent radius (AER) that is merely determined by the absolute amount of object points, MER relies on the overall spatial structure of the object. For objects with irregular shapes, the MER value is generally smaller than AER in the absence of truncation. Nevertheless, taking the actual AER as true scale, MER has significantly reduced biases compared to AER once the object is truncated. This advantage can be reinforced when focusing on size statistics of analogous objects, because negative and positive biases associated with various truncation situations coexist in MER, against the uniform negative biases of AER. When applied to MODIS cloud mask data that are restricted in individual granules, MER has consistently larger values than AER for most truncated clouds. Compared with the explicitly problematic estimation from AER due to truncation, MER offers a notable elevation on the estimated cloud size and gets closer to the truth.
Amplitude reconstruction from complete experiments and truncated partial-wave expansions
Workman, R L; Wunderlich, Y; Doering, M; Haberzettl, H
2016-01-01
We compare the methods of amplitude reconstruction, for a complete experiment and a truncated partial wave analysis, applied to the photoproduction of pseudo-scalar mesons. The approach is pedagogical, showing in detail how the amplitude reconstruction (observables measured at a single energy and angle) is related to a truncated partial-wave analysis (observables measured at a single energy and a number of angles).
Immature truncated O-glycophenotype of cancer directly induces oncogenic features.
Radhakrishnan, Prakash; Dabelsteen, Sally; Madsen, Frey Brus; Francavilla, Chiara; Kopp, Katharina L; Steentoft, Catharina; Vakhrushev, Sergey Y; Olsen, Jesper V; Hansen, Lars; Bennett, Eric P; Woetmann, Anders; Yin, Guangliang; Chen, Longyun; Song, Haiyan; Bak, Mads; Hlady, Ryan A; Peters, Staci L; Opavsky, Rene; Thode, Christenze; Qvortrup, Klaus; Schjoldager, Katrine T-B G; Clausen, Henrik; Hollingsworth, Michael A; Wandall, Hans H
2014-09-30
Aberrant expression of immature truncated O-glycans is a characteristic feature observed on virtually all epithelial cancer cells, and a very high frequency is observed in early epithelial premalignant lesions that precede the development of adenocarcinomas. Expression of the truncated O-glycan structures Tn and sialyl-Tn is strongly associated with poor prognosis and overall low survival. The genetic and biosynthetic mechanisms leading to accumulation of truncated O-glycans are not fully understood and include mutation or dysregulation of glycosyltransferases involved in elongation of O-glycans, as well as relocation of glycosyltransferases controlling initiation of O-glycosylation from Golgi to endoplasmic reticulum. Truncated O-glycans have been proposed to play functional roles for cancer-cell invasiveness, but our understanding of the biological functions of aberrant glycosylation in cancer is still highly limited. Here, we used exome sequencing of most glycosyltransferases in a large series of primary and metastatic pancreatic cancers to rule out somatic mutations as a cause of expression of truncated O-glycans. Instead, we found hypermethylation of core 1 β3-Gal-T-specific molecular chaperone, a key chaperone for O-glycan elongation, as the most prevalent cause. We next used gene editing to produce isogenic cell systems with and without homogenous truncated O-glycans that enabled, to our knowledge, the first polyomic and side-by-side evaluation of the cancer O-glycophenotype in an organotypic tissue model and in xenografts. The results strongly suggest that truncation of O-glycans directly induces oncogenic features of cell growth and invasion. The study provides support for targeting cancer-specific truncated O-glycans with immunotherapeutic measures.
Institute of Scientific and Technical Information of China (English)
CHENG Shi-lun; YANG Zhen
2008-01-01
To maximize throughput and to satisfy users' requirements in cognitive radios, a cross-layer optimization problem combining adaptive modulation and power control at the physical layer and truncated automatic repeat request at the medium access control layer is proposed. Simulation results show the combination of power control, adaptive modulation, and truncated automatic repeat request can regulate transmitter powers and increase the total throughput effectively.
DEFF Research Database (Denmark)
Bussink, Barbara E; Holst, Anders Gaarsdal; Jespersen, Lasse
2013-01-01
AimsTo determine the prevalence, predictors of newly acquired, and the prognostic value of right bundle branch block (RBBB) and incomplete RBBB (IRBBB) on a resting 12-lead electrocardiogram in men and women from the general population.Methods and resultsWe followed 18 441 participants included.......5%/2.3% in women, P Right bundle branch block was associated with significantly...... increased all-cause and cardiovascular mortality in both genders with age-adjusted hazard ratios (HR) of 1.31 [95% confidence interval (CI), 1.11-1.54] and 1.87 (95% CI, 1.48-2.36) in the gender pooled analysis with little attenuation after multiple adjustment. Right bundle branch block was associated...
31 CFR 547.302 - Blocked account; blocked property.
2010-07-01
.... 547.302 Section 547.302 Money and Finance: Treasury Regulations Relating to Money and Finance... SANCTIONS REGULATIONS General Definitions § 547.302 Blocked account; blocked property. The terms blocked account and blocked property shall mean any account or property subject to the prohibitions in § 547.201...
Immature truncated O-glycophenotype of cancer directly induces oncogenic features
DEFF Research Database (Denmark)
Radhakrishnan, Prakash; Dabelsteen, Sally; Madsen, Frey Brus
2014-01-01
Aberrant expression of immature truncated O-glycans is a characteristic feature observed on virtually all epithelial cancer cells, and a very high frequency is observed in early epithelial premalignant lesions that precede the development of adenocarcinomas. Expression of the truncated O-glycan s......Aberrant expression of immature truncated O-glycans is a characteristic feature observed on virtually all epithelial cancer cells, and a very high frequency is observed in early epithelial premalignant lesions that precede the development of adenocarcinomas. Expression of the truncated O......-glycans, as well as relocation of glycosyltransferases controlling initiation of O-glycosylation from Golgi to endoplasmic reticulum. Truncated O-glycans have been proposed to play functional roles for cancer-cell invasiveness, but our understanding of the biological functions of aberrant glycosylation in cancer...... is still highly limited. Here, we used exome sequencing of most glycosyltransferases in a large series of primary and metastatic pancreatic cancers to rule out somatic mutations as a cause of expression of truncated O-glycans. Instead, we found hypermethylation of core 1 β3-Gal-T-specific molecular...
Hybrid Model Testing Technique for Deep-Sea Platforms Based on Equivalent Water Depth Truncation
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
In this paper, an inner turret moored FPSO which works in the water of 320 m depth, is selected to study the so-called "passively-truncated + numerical-simulation" type of hybrid model testing technique while the truncated water depth is 160 m and the model scale λ=80. During the investigation, the optimization design of the equivalent-depth truncated system is performed by using the similarity of the static characteristics between the truncated system and the full depth one as the objective function. According to the truncated system, the corresponding physical test model is made. By adopting the coupling time domain simulation method, the truncated system model test is numerically reconstructed to carefully verify the computer simulation software and to adjust the corresponding hydrodynamic parameters. Based on the above work, the numerical extrapolation to the full depth system is performed by using the verified computer software and the adjusted hydrodynamic parameters. The full depth system model test is then performed in the basin and the results are compared with those from the numerical extrapolation. At last, the implementation procedure and the key technique of the hybrid model testing of the deep-sea platforms are summarized and printed. Through the above investigations, some beneficial conclusions are presented.
McIntyre, Thomas M
2012-10-01
This report reviews structurally related phospholipid oxidation products that are biologically active where molecular mechanisms have been defined. Phospholipids containing polyunsaturated fatty acyl residues are chemically or enzymatically oxidized to phospholipid hydroperoxides, which may fragment on either side of the newly introduced peroxy function to form phospholipids with a truncated sn-2 residue. These truncated phospholipids not subject to biologic control of their production and, depending on the sn-2 residue length and structure, can stimulate the plasma membrane receptor for PAF. Alternatively, these chemically formed products can be internalized by a transport system to either stimulate the lipid activated nuclear transcription factor PPARγ or at higher levels interact with mitochondria to initiate the intrinsic apoptotic cascade. Intracellular PAF acetylhydrolases specifically hydrolyze truncated phospholipids, and not undamaged, biosynthetic phospholipids, to protect cells from oxidative death. Truncated phospholipids are also formed within cells where they couple cytokine stimulation to mitochondrial damage and apoptosis. The relevance of intracellular truncated phospholipids is shown by the complete protection from cytokine induced apoptosis by PAF acetylhydrolase expression. This protection shows truncated phospholipids are the actual effectors of cytokine mediated toxicity. This article is part of a Special Issue entitled: Oxidized phospholipids-their properties and interactions with proteins.
Truncated forms of BNIP3 act as dominant negatives inhibiting hypoxia-induced cell death
Bristow, Nicolle; Burton, Teralee R; Henson, Elizabeth S; Ong-Justiniano, Coleen; Brown, Michelle; Gibson, Spencer B
2011-01-01
BNIP3 (Bcl-2/adenovirus E1B Ninteen Kilodalton Interacting Protein) is a pro-cell death member of the Bcl-2 family of proteins. Its expression is induced by the transcription factor Hypoxia Inducible Factor-1 (HIF-1) under conditions of low oxygen (hypoxia) and is found over expressed in hypoxic regions of many tumors. When over expressed, BNIP3 induces cell death through induction of mitochondrial dysfunction that is dependant on the presence of BNIP3’s TM domain. Herein, we have determined that the SkOv3 ovarian cancer cell line expresses a truncated BNIP3 protein, which results in the elimination of the transmembrane domain. Truncation that eliminates all four domains of BNIP3 protein also inhibits hypoxia-induced cell death in SkOv3, HEK293, U251 and MCF-7 cells. Three different mutations in a BNIP3 expression vector that lead to a truncated BNIP3 protein, lacking TM domain only, or lacking CD, BH3, and TM domains resulted in inhibition of hypoxia-induced cell death when transfected into HEK293 cells. We found that truncated BNIP3 failed to associate with the mitochondria and the truncated BNIP3 lacking all four domains can bind to wild type BNIP3. Taken together, truncation of BNIP3 could be a novel mechanism for cancer cells to avoid hypoxia-induced cell death mediated by BNIP3 over expression. PMID:21138765
Mahmood, Iftekhar
2004-01-01
The common measures used in a bioequivalence study are area under the curve (AUC) and the maximum plasma concentration. Estimation of AUC requires frequent blood samples. For long half-life drugs, sampling for long periods of time may become cumbersome. To resolve this issue some investigators have suggested the use of truncated AUC in bioequivalence studies for long half-life drugs. The suggested length of time for the truncated AUC is 72 hours. Many studies have been conducted to show that truncated AUC till 72 hours is a suitable approach. However, the suitability of truncated AUC for failed bioequivalence study has not been demonstrated. This report of simulated plasma concentration versus time data evaluates the suitability of truncated AUC for failed bioequivalence study of two hypothetical drugs. The results of the study indicate that the truncated approach for the estimation of the AUC for long half-life drugs in bioequivalence studies may be useful but it also increases the probability of accepting drugs as being bioequivalent when they are not.
Fox, Christopher; Romeijn, H Edwin; Dempsey, James F
2006-05-01
We present work on combining three algorithms to improve ray-tracing efficiency in radiation therapy dose computation. The three algorithms include: An improved point-in-polygon algorithm, incremental voxel ray tracing algorithm, and stereographic projection of beamlets for voxel truncation. The point-in-polygon and incremental voxel ray-tracing algorithms have been used in computer graphics and nuclear medicine applications while the stereographic projection algorithm was developed by our group. These algorithms demonstrate significant improvements over the current standard algorithms in peer reviewed literature, i.e., the polygon and voxel ray-tracing algorithms of Siddon for voxel classification (point-in-polygon testing) and dose computation, respectively, and radius testing for voxel truncation. The presented polygon ray-tracing technique was tested on 10 intensity modulated radiation therapy (IMRT) treatment planning cases that required the classification of between 0.58 and 2.0 million voxels on a 2.5 mm isotropic dose grid into 1-4 targets and 5-14 structures represented as extruded polygons (a.k.a. Siddon prisms). Incremental voxel ray tracing and voxel truncation employing virtual stereographic projection was tested on the same IMRT treatment planning cases where voxel dose was required for 230-2400 beamlets using a finite-size pencil-beam algorithm. Between a 100 and 360 fold cpu time improvement over Siddon's method was observed for the polygon ray-tracing algorithm to perform classification of voxels for target and structure membership. Between a 2.6 and 3.1 fold reduction in cpu time over current algorithms was found for the implementation of incremental ray tracing. Additionally, voxel truncation via stereographic projection was observed to be 11-25 times faster than the radial-testing beamlet extent approach and was further improved 1.7-2.0 fold through point-classification using the method of translation over the cross product technique.
A one-time truncate and encode multiresolution stochastic framework
Abgrall, R.; Congedo, P. M.; Geraci, G.
2014-01-01
In this work a novel adaptive strategy for stochastic problems, inspired from the classical Harten's framework, is presented. The proposed algorithm allows building, in a very general manner, stochastic numerical schemes starting from a whatever type of deterministic schemes and handling a large class of problems, from unsteady to discontinuous solutions. Its formulations permits to recover the same results concerning the interpolation theory of the classical multiresolution approach, but with an extension to uncertainty quantification problems. The present strategy permits to build numerical scheme with a higher accuracy with respect to other classical uncertainty quantification techniques, but with a strong reduction of the numerical cost and memory requirements. Moreover, the flexibility of the proposed approach allows to employ any kind of probability density function, even discontinuous and time varying, without introducing further complications in the algorithm. The advantages of the present strategy are demonstrated by performing several numerical problems where different forms of uncertainty distributions are taken into account, such as discontinuous and unsteady custom-defined probability density functions. In addition to algebraic and ordinary differential equations, numerical results for the challenging 1D Kraichnan-Orszag are reported in terms of accuracy and convergence. Finally, a two degree-of-freedom aeroelastic model for a subsonic case is presented. Though quite simple, the model allows recovering some physical key aspect, on the fluid/structure interaction, thanks to the quasi-steady aerodynamic approximation employed. The injection of an uncertainty is chosen in order to obtain a complete parameterization of the mass matrix. All the numerical results are compared with respect to classical Monte Carlo solution and with a non-intrusive Polynomial Chaos method.
Robust and Adaptive Block Tracking Method Based on Particle Filter
Directory of Open Access Journals (Sweden)
Bin Sun
2015-10-01
Full Text Available In the field of video analysis and processing, object tracking is attracting more and more attention especially in traffic management, digital surveillance and so on. However problems such as objects’ abrupt motion, occlusion and complex target structures would bring difficulties to academic study and engineering application. In this paper, a fragmentsbased tracking method using the block relationship coefficient is proposed. In this method, we use particle filter algorithm and object region is divided into blocks initially. The contribution of this method is that object features are not extracted just from a single block, the relationship between current block and its neighbor blocks are extracted to describe the variation of the block. Each block is weighted according to the block relationship coefficient when the block is voted on the most matched region in next frame. This method can make full use of the relationship between blocks. The experimental results demonstrate that our method can provide good performance in condition of occlusion and abrupt posture variation.
Tavakolian, Pantea; Sivagurunathan, Koneswaran; Mandelis, Andreas
2017-07-01
Photothermal diffusion-wave imaging is a promising technique for non-destructive evaluation and medical applications. Several diffusion-wave techniques have been developed to produce depth-resolved planar images of solids and to overcome imaging depth and image blurring limitations imposed by the physics of parabolic diffusion waves. Truncated-Correlation Photothermal Coherence Tomography (TC-PCT) is the most successful class of these methodologies to-date providing 3-D subsurface visualization with maximum depth penetration and high axial and lateral resolution. To extend the depth range and axial and lateral resolution, an in-depth analysis of TC-PCT, a novel imaging system with improved instrumentation, and an optimized reconstruction algorithm over the original TC-PCT technique is developed. Thermal waves produced by a laser chirped pulsed heat source in a finite thickness solid and the image reconstruction algorithm are investigated from the theoretical point of view. 3-D visualization of subsurface defects utilizing the new TC-PCT system is reported. The results demonstrate that this method is able to detect subsurface defects at the depth range of ˜4 mm in a steel sample, which exhibits dynamic range improvement by a factor of 2.6 compared to the original TC-PCT. This depth does not represent the upper limit of the enhanced TC-PCT. Lateral resolution in the steel sample was measured to be ˜31 μm.
Iterating block spin transformations of the O(3) nonlinear {sigma} model
Energy Technology Data Exchange (ETDEWEB)
Gottlob, A.P. [Fachbereich Physik, Universitaet Kaiserslautern, D-67653 Kaiserslautern (Germany); Hasenbusch, M. [DAMTP, Silver Street, Cambridge, CB3 9EW (England); Pinn, K. [Institut fuer Theoretische Physik I, Universitaet Muenster, Wilhelm-Klemm-Strasse 9, D-48149 Muenster (Germany)
1996-07-01
We study the iteration of block spin transformations in the O(3) symmetric nonlinear {sigma} model on a two-dimensional square lattice with the help of the Monte Carlo method. In contrast with the classical Monte Carlo renormalization group approach, we {ital do} attempt to explicitly compute the block spin effective actions. Using two different methods for the determination of effective couplings, we study the renormalization group flow for various parametrization and truncation schemes. The largest ansatz for the effective action contains thirteen coupling constants. Actions on the renormalized trajectory should describe theories with no lattice artifacts, even at a small correlation length. However, tests with the step scaling function of L{umlt u}scher, Weisz, and Wolff reveal that our truncated effective actions show sizable scaling violations indicating that the {ital Ans{umlt a}tze} are still too small. {copyright} {ital 1996 The American Physical Society.}
Modeling of genetic algorithms with a finite population
Kemenade, C.H.M. van
1997-01-01
Cross-competition between non-overlapping building blocks can strongly influence the performance of evolutionary algorithms. The choice of the selection scheme can have a strong influence on the performance of a genetic algorithm. This paper describes a number of different genetic algorithms, all in
Hromkovic, Juraj
2009-01-01
Explores the science of computing. This book starts with the development of computer science, algorithms and programming, and then explains and shows how to exploit the concepts of infinity, computability, computational complexity, nondeterminism and randomness.