检索结果-南通市图书馆

Modeling of elastic wave propagation on a curved free surface using an improved finite-difference algorithm

在线全文

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2004年第5期47卷 633-648页

作者： WANG Xiuming1,3.& ZHANG Hailan2.1. CSIRO Petroleum, ARRC, PO BOX 113., technology Park, Bentley, WA 6102. Australia 2. institute of Acoustics, Chinese {2. of {3., beijing 100080, China 3. Present address: institute of Acoustics, Chinese {2. of {3., beijing 100080, China CSIRO Petroleum ARRC Bentley Australia institute of Acoustics Chinese Academy of Sciences Beijing China

Based on existing direct and imaging methods of a staggered finite-difference scheme, an improved algorithm for staggered finite-difference is proposed to implement rugged topographic free boundary conditions. This method assumes that the free surface can be implemented with horizontal and vertical free surface segments and their corners; the free surface passes through the grid points of shear stress components, instead of the normal stress components. Imaging is carried out for stress components in both horizontal and vertical directions, thus increasing the accuracy. To update particle- velocities, imaging and updating are first performed in the horizontal direction, and then in the vertical direction. The numerical results for elastic flat horizontal free surface with the imaging method and those for flat free surfaces of various slope angles with the proposed method are compared, and are shown to be in good agreement. The advantage of the proposed method is that only the stresses are dealt with in implementing the free surface into the staggered algorithm, which improves computation efficiency.

关键词： elastic wave simulation, curved free surface, staggered finite-difference, algorithm stability.

A new DNA algorithm to solve graph coloring problem

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2007年第6期17卷 733-738页

作者： Jiang Xingpeng1, Li Yin2. Meng Ya3.and Meng Dazhi2.1. National Laboratory of Pattern Recognition,institute of Automation, Chinese {3. of {2.,{3., China 2. College of Applied {2., beijing University of technology, beijing 10002., China 3. School of Science, beijing institute of technology, beijing 100081, China) National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing 100080 China College of Applied sciences Beijing University of Technology Beijing 100022 China School of Science Beijing Institute of Technology Beijing 100081 China

Using a small quantity of DNA molecules and little experimental time to solve complex problems successfully is a goal of DNA computing. Some NP-hard problems have been solved by DNA computing with lower time complexity than conventional computing. However, this advantage often brings higher space complexity and needs a large number of DNA encoding molecules. One example is graph coloring problem. Current DNA algorithms need exponentially increasing DNA encoding strands with the growing of problem size. Here we propose a new DNA algorithm of graph coloring problem based on the proof of four-color theorem. This algorithm has good properties of needing a relatively small number of operations in polynomial time and needing a small number of DNA encoding molecules (we need only 6R DNA encoding molecules if the number of regions in a graph is R).

关键词： DNA computing NP-hard problem graph coloring problem.

Compression behavior of Zr_(41)Ti_(14)Cu_(12.5)Ni_(10)Be_(2..5) bulk metallic glass up to 2. GPa

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2005年第3期48卷 319-324页

作者： LI Gong 1, 2., ZHAN Zaiji 2., LIU Jing 3., YUN Jinku 1 , SUN Liling 2., LIU Riping 1 , ZHANG Jun 2.& WANG Wenkui 1, 2.1. Key Laboratory of Metastable Materials Science and technology, Yanshan University, Qinhuangdao 066004, China 2. Center for Condensed Matter Physics, institute of Physics, Chinese {2. of {3., beijing 100080, China 3. BSRF, institute of High Energy Physics, Chinese {2. of {3., beijing 10003., China Key Laboratory of Metastable Materials Science and technology Yanshan University Qinhuangdao China Center for Condensed Matter Physics Institute of Physics Chinese Academy of Sciences Beijing China BSRF Institute of High Energy Physics Chinese Academy of Sciences Beijing China

The compression of a Zr41Ti14Cu12.5Ni10Be2..5 bulk metallic glass (BMG) is investigated at room temperature up to 2. GPa using in-situ high pressure energy dispersive X-ray diffraction with a synchrotron radiation source. The pressure-induced structural relaxation is exhibited. It is found that below about 8 GPa, the existence of excess free volume contributes to the rapid structural relaxation, which gives rise to the rapid volumetric change, and the structural relaxation results in the structural stiffness under higher pressure.

关键词： bulk metallic glass, high pressure, structural relaxation, synchrotron radiation.

Formal Verification under Unknown Constraints

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural sciences 2005年第1期10卷 43-46页

作者： LI Guang-hui 1,2.3., LI Xiao-wei 2.3.. School of Information Engineering, Zhejiang Forestry College, Hangzhou 3.13.0, Zhejiang, China 2. institute of computing technology, Chinese {3. of {2.,{3., China 3. Graduate School of the Chinese {3. of {2., beijing 10003., China School of Information Engineering Zhejiang Forestry College Hangzhou Zhejiang China institute of computing {2. Chinese Academy of Sciences Beijing China Graduate School of the Chinese academy of sciences Beijing China

We present a formal method of verifying designs with unknown constraints (e.g., black boxes) using Boolean satisfiability (SAT). This method is based on a new encoding scheme of unknown constraints, and solves the corresponding conjunctive normal form (CNF) ***,this method can avoid the potential memory explosion, which the binary decision diagram (BDD) based techniques maybe suffer from, thus it has the capacity of verifying large designs. Experimental results demonstrate the efficiency and feasibility of the proposed method.

关键词： formal verification unknown constraints black box Boolean satisfiability Boolean comparison

A formal model of fair exchange protocols

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2005年第4期48卷 499-512页

作者： QING Sihan1,2.3.& LI Gaicheng1,2.3.1. Engineering Research Center for Information Security technology, {3. of Software, Chinese Aca- demy of {2.,{3., China 2. beijing Zhongke Ansheng Corporation of Information technology,{3., China 3. Graduate School of the Chinese academy of {2., beijing 10003., China Engineering Research Center for Information Security technology Institute of Software Chinese Academy of Sciences Beijing China beijing Zhongke Ansheng Corporation of Information technology Beijing China Graduate School of the Chinese academy of sciences Beijing China

Based on the study of existing fair exchange protocols, this paper sets up an accurate formal model by stepwise refinement. In the process of refinement an unreliable channel is employed to simulate an attack behavior. The model provides a novel formal definition of exchanged items, and presents the formal goals for fairness, accountability, etc., reflecting the inherent requirements for fair exchange protocols across-the-board. In order to check, prove, and design fair exchange protocols effectively and efficiently, the model puts forward a novel property of abuse-freeness which applies to all fair exchange protocols, gives a formal definition for trust strand of the third party, and presents general criteria of designing a secure and effective fair exchange protocol. Taking a typical fair exchange protocol as an example, this paper presents the analysis steps of fair exchange protocols appealing to our model. An unknown attack is uncovered. The analysis reveals the process of a complete attack, discovering deeper reasons for causing an attack. Finally, we modify the flawed protocol and the revised protocol ensures the desirable properties.

关键词： events local causal relation local temporal relation global relation exchanged item security goals.

Formal analysis and design of multi-party fair exchange protocols

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2006年第2期49卷 155-174页

作者： QING Sihan1,2.3.& LI Gaicheng1,3.1. Engineering Research Center for Information Security technology, institute of Software, Chinese {2. of {3., beijing 100080, China 2. beijing Zhongke Ansheng Corporation of Information technology, beijing 100080, China 3. Graduate School of the Chinese {2. of {3., beijing 10003., China Engineering Research Center for Information Security technology Institute of Software Chinese Academy of Sciences Beijing China beijing Zhongke Ansheng Corporation of Information technology Beijing China Graduate School of the Chinese academy of sciences Beijing China

Based on the origin of message items and channel combination between transacting parties, and events and relations among events, this paper presents a concise, precise, and hierarchical model for general fair exchange protocols, formally specifies various security requirements which are able to reflect inherent requirements for fair exchange protocols more rigorously, and partition these security requirements with fine granularity. This work helps analyze, debug, and design multi-party fair exchange protocols more effectively and elaborately,

关键词： fair exchange logical protocol formal model security requirement.

Review on the study of entanglement in quantum computation speedup

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 2007年第16期52卷 2161-2166页

作者： DING ShengChao1,3.& JIN Zhi1,2.1 institute of computing {2.,Chinese {3. of sciences,beijing 100080,China 2.{3. of Mathematics and Systems Science,Chinese {3. of sciences,beijing 100080,China 3.Graduate University of Chinese {3. of sciences,beijing 100080,China institute of computing {2. Chinese Academy of Sciences Beijing China Graduate University of Chinese academy of sciences Beijing China academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China

The role the quantum entanglement plays in quantum computation speedup has been widely disputed. Some believe that quantum computation's speedup over classical computation is impossible if entan-glement is absent,while others claim that the presence of entanglement is not a necessary condition for some quantum algorithms. This paper discusses this problem systematically. Simulating quantum computation with classical resources is analyzed and entanglement in known algorithms is reviewed. It is concluded that the presence of entanglement is a necessary but not sufficient condition in the pure state or pseudo-pure state quantum computation speedup. The case with the mixed state remains open. Further work on quantum computation will benefit from the presented results.

关键词：量子论量子纠缠量子计算加速模拟

Some properties on multivariate filter banks with a matrix factorization

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2005年第2期15卷 20-30页

作者： LIAN Qiaofang1, XIAO Hongying2. and CHEN Qiuhui3.1. Department of Mathematics, beijing Jiaotong University, beijing 100044, China 2. {2. of Mathematics, {3. of Mathematics and System sciences, Chinese {3. of sciences, beijing 100080, China 3. Department of Scientific computing and Computer Applications, Zhongshan University, Guangzhou 5102.5, China) Dept. of Mathematics Beijing Jiaotong Univ. Beijing 100044 China Inst. of Mathematics Acad. of Math. and System Sci. Chinese Acad. of Sciences Beijing 100080 China Dept. of Scientific computing Zhongshan Univ. Guangzhou 510275 China

A class of multivariate filter banks with a matrix factorization has been developed by Chen et al. The main purpose of this paper is to discuss some further properties of this kind of filter bank, such as the completeness, accuracy of the corresponding scaling functions and the relationships with Daubechies' wavelets and the multi-wavelets provided by Chui and Lian. Moreover, some examples are given to show that this kind of filter bank has a higher accuracy for the scaling functions.

关键词： filter banks completeness accuracy matrix factorization

Simulation study of phase retrieval for hard X-ray in-line phase contrast imaging

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2005年第4期48卷 450-458页

作者： YU Bin1,2. PENG Xiang1,2. TIAN Jindong1, NIU Hanben1, DIAO Luhong3.& LI Hua3.1. Key Laboratory of Optoelectronic Devices and Systems of Ministry of Education, institute of Optoelec- tronics, Shenzhen University, Shenzhen 518060, China 2. State Key Laboratory of Precision Measuring technology and Instruments, Tianjin University, Tianjin 3.0072.China 3. Key Laboratory of Intelligent Information Processing, institute of {3. technology, Chinese academy of sciences, beijing 100080,China Key Laboratory of Optoelectronic Devices and Systems of Ministry of Education Institute of Optoelectronics Shenzhen University Shenzhen China State Key Laboratory of Precision Measuring technology and Instruments Tianjin University Tianjin China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Two algorithms for the phase retrieval of hard X-ray in-line phase contrast imaging are presented. One is referred to as Iterative Angular Spectrum Algorithm (IASA) and the other is a hybrid algorithm that combines IASA with TIE (transport of intensity equation). The calculations of the algorithms are based on free space propagation of the angular spectrum. The new approaches are demonstrated with numerical simulations. Comparisons with other phase retrieval algorithms are also performed. It is shown that the phase retrieval method combining the IASA and TIE is a promising technique for the application of hard X-ray phase contrast imaging.

关键词： X-ray optics, phase contrast imaging, phase retrieval, angular spectrum, hard X-ray.