10 resultados para local-global principle
em Chinese Academy of Sciences Institutional Repositories Grid Portal
Resumo:
本文从Reissner圆柱壳理论出发,应用摄动法获得了含轴向裂纹圆柱壳裂纹尖端应力应变场(包括Ⅰ、Ⅱ、Ⅲ型),并进一步应用Local-Global方法对不同尺寸块壳的应力强度因子进行了计算分析,同时对工程中常用的鼓胀系数进行了计算和分析讨论。计算结果表明,对于a/h较大的情况,经典公式是适用的,若a/h不太大时,经典理论将带来较大误差,本文给出了考虑剪切刚度影响的鼓胀系数的一些数值范围。
Resumo:
本文将“局部-整体分析法”(Local-global analy sis)推广到含裂纹球壳的断裂分析中,给出含裂纹球壳裂纹尖端应力应变场包括Ⅰ,Ⅱ,Ⅲ型的一般解.它类似于平面断裂问题中Williams展开式的作用,揭示了裂纹尖端附近的力学性质,为进行含裂纹球壳断裂分析提供良好的基础.平面断裂问题分析中一整套成熟的分析方法,诸如能量法,边界配置法,摄动法,有限元法等都可以移植到球壳的断裂分析中去. 作为算例,本文给出了几种边界条件下有限尺寸块球壳的应力强度因子数值并进一步对工程中实用的球壳鼓胀系数进行了计算,分析了现在常用的鼓胀系数的适用范围,并给出了简单实用的近似公式.本文获得的应力应变场也为复合型断裂分析提供了一个强有力的工具.
Resumo:
The local-global anatysis method is systematically extended to the fracture analysis of spherical shells. On the basis of the shallow shell theory, which takes into account transverse shear deformations, governing equations for cracked spherical shells expressed in displacement and stress functions f, F and φ are proposed, and then a general solution including Modes, Ⅰ, Ⅱ, Ⅲ for stress-strain fields at crack tip in a spherical shell is obtained, which plays the same role as Williams's expansion in plane elasticity. The numerical results for finite-size spherical shells under different boundary conditions have been obtained. Furthermore, the bulging factors are analyzed with regard to shearing stiffness and an approximate formula is given.
Resumo:
Our study of a novel technique for adaptive image sequence coding is reported. The number of reference frames and the intervals between them are adjusted to improve the temporal compensability of the input video. The bits are distributed more efficiently on different frame types according to temporal and spatial complexity of the image scene. Experimental results show that this dynamic group-of-picture (GOP) structure coding scheme is not only feasible but also better than the conventional fixed GOP method in terms of perceptual quality and SNR. (C) 1996 Society of Photo-Optical Instrumentation Engineers.
Resumo:
We present a parametrically efficient method for measuring the entanglement of formation E-f in an arbitrarily given unknown two-qubit state rho(AB) by local operations and classical communication. The two observers, Alice and Bob, first perform some local operations on their composite systems separately, by which the desired global quantum states can be prepared. Then they estimate seven functions via two modified local quantum networks supplemented a classical communication. After obtaining these functions, Alice and Bob can determine the concurrence C and the entanglement of formation E-f.
Resumo:
A new framework of non-local model for the strain energy density is proposed in this paper. The global strain energy density of the representative volume element is treated as a non-local variable and can be obtained through a special integral of the local strain energy density. The local strain energy density is assumed to be dependent on both the strain and the rotation-gradient. As a result of the non-local model, a new strain gradient theory is derived directly, in which the first and second strain gradients, as well as the triadic and tetradic stress, are introduced in the context of work conjugate. For power law hardening materials, size effects in thin metallic wire torsion and ultra-thin cantilever beam bend are investigated. It is found that the result predicted by the theoretical model is well consistent with the experimental data for the thin wire torsion. On the other hand, the calculation result for the micro-cantilever beam bend clearly shows the size effect.
Resumo:
Compared with other existing methods, the feature point-based image watermarking schemes can resist to global geometric attacks and local geometric attacks, especially cropping and random bending attacks (RBAs), by binding watermark synchronization with salient image characteristics. However, the watermark detection rate remains low in the current feature point-based watermarking schemes. The main reason is that both of feature point extraction and watermark embedding are more or less related to the pixel position, which is seriously distorted by the interpolation error and the shift problem during geometric attacks. In view of these facts, this paper proposes a geometrically robust image watermarking scheme based on local histogram. Our scheme mainly consists of three components: (1) feature points extraction and local circular regions (LCRs) construction are conducted by using Harris-Laplace detector; (2) a mechanism of grapy theoretical clustering-based feature selection is used to choose a set of non-overlapped LCRs, then geometrically invariant LCRs are completely formed through dominant orientation normalization; and (3) the histogram and mean statistically independent of the pixel position are calculated over the selected LCRs and utilized to embed watermarks. Experimental results demonstrate that the proposed scheme can provide sufficient robustness against geometric attacks as well as common image processing operations. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
How to refine a near-native structure to make it closer to its native conformation is an unsolved problem in protein-structure and protein-protein complex-structure prediction. In this article, we first test several scoring functions for selecting locally resampled near-native protein-protein docking conformations and then propose a computationally efficient protocol for structure refinement via local resampling and energy minimization. The proposed method employs a statistical energy function based on a Distance-scaled Ideal-gas REference state (DFIRE) as an initial filter and an empirical energy function EMPIRE (EMpirical Protein-InteRaction Energy) for optimization and re-ranking. Significant improvement of final top-1 ranked structures over initial near-native structures is observed in the ZDOCK 2.3 decoy set for Benchmark 1.0 (74% whose global rmsd reduced by 0.5 angstrom or more and only 7% increased by 0.5 angstrom or more). Less significant improvement is observed for Benchmark 2.0 (38% versus 33%). Possible reasons are discussed.
Resumo:
Seismic signal is a typical non-stationary signal, whose frequency is continuously changing with time and is determined by the bandwidth of seismic source and the absorption characteristic of the media underground. The most interesting target of seismic signal’s processing and explaining is to know about the local frequency’s abrupt changing with the time, since this kind of abrupt changing is indicating the changing of the physical attributes of the media underground. As to the seismic signal’s instantaneous attributes taken from time-frequency domain, the key target is to search a effective, non-negative and fast algorithm time-frequency distribution, and transform the seismic signal into this time-frequency domain to get its instantaneous power spectrum density, and then use the process of weighted adding and average etc. to get the instantaneous attributes of seismic signal. Time-frequency analysis as a powerful tool to deal with time variant non-stationary signal is becoming a hot researching spot of modern signal processing, and also is an important method to make seismic signal’s attributes analysis. This kind of method provides joint distribution message about time domain and frequency domain, and it clearly plots the correlation of signal’s frequency changing with the time. The spectrum decomposition technique makes seismic signal’s resolving rate reach its theoretical level, and by the method of all frequency scanning and imaging the three dimensional seismic data in frequency domain, it improves and promotes the resolving abilities of seismic signal vs. geological abnormal objects. Matching pursuits method is an important way to realize signal’s self-adaptive decomposition. Its main thought is that any signal can be expressed by a series of time-frequency atoms’ linear composition. By decomposition the signal within an over completed library, the time-frequency atoms which stand for the signal itself are selected neatly and self-adaptively according to the signal’s characteristics. This method has excellent sparse decomposition characteristics, and is widely used in signal de-noising, signal coding and pattern recognizing processing and is also adaptive to seismic signal’s decomposition and attributes analysis. This paper takes matching pursuits method as the key research object. As introducing the principle and implementation techniques of matching pursuits method systematically, it researches deeply the pivotal problems of atom type’s selection, the atom dictionary’s discrete, and the most matching atom’s searching algorithm, and at the same time, applying this matching pursuits method into seismic signal’s processing by picking-up correlative instantaneous messages from time-frequency analysis and spectrum decomposition to the seismic signal. Based on the research of the theory and its correlative model examination of the adaptively signal decomposition with matching pursuit method, this paper proposes a fast optimal matching time-frequency atom’s searching algorithm aimed at seismic signal’s decomposition by frequency-dominated pursuit method and this makes the MP method pertinence to seismic signal’s processing. Upon the research of optimal Gabor atom’s fast searching and matching algorithm, this paper proposes global optimal searching method using Simulated Annealing Algorithm, Genetic Algorithm and composed Simulated Annealing and Genetic Algorithm, so as to provide another way to implement fast matching pursuit method. At the same time, aimed at the characteristics of seismic signal, this paper proposes a fast matching atom’s searching algorithm by means of designating the max energy points of complex seismic signal, searching for the most optimal atom in the neighbor area of these points according to its instantaneous frequency and instantaneous phase, and this promotes the calculating efficiency of seismic signal’s matching pursuit algorithm. According to these methods proposed above, this paper implements them by programmed calculation, compares them with some open algorithm and proves this paper’s conclusions. It also testifies the active results of various methods by the processing of actual signals. The problems need to be solved further and the aftertime researching targets are as follows: continuously seeking for more efficient fast matching pursuit algorithm and expanding its application range, and also study the actual usage of matching pursuit method.