检索结果-内蒙古大学图书馆

Stochastic analysis of ground response using non-recursive algorithm

SOIL DYNAMICS AND EARTHQUAKE ENGINEERING 2015年 69卷 57-82页

作者： Johari, A. Momeni, M. Shiraz Univ Technol Dept Civil & Environm Engn Shiraz Iran

During an earthquake, the amplitudes of seismic wave may amplify significantly as it propagates through the soil layers near the ground surface. Analysis of site amplification potential is strongly influenced by the uncertainty associated to the definition of soil thickness and its properties. In this paper, the non-recursive algorithm is used in linear and nonlinear Hybrid Frequency Time Domain (HFTD) approaches for stochastic analysis of site amplification. The non-recursive algorithm causes time reduction of analysis that is the essential base of stochastic analysis. The selected soil stochastic parameters are shear wave velocity, density, damping and thickness. The results of sensitivity analysis also show that the damping ratio is the most effective parameter in PGA at ground surface. The stochastic peak ground acceleration, response spectrum and amplification factor at the ground surface are determined by the two approaches for four sites with different average shear wave velocities. Comparison of the results shows that the nonlinear HI. ID approach predicts closer response to real recorded data with respect to linear HFTD.(C) 2014 Elsevier Ltd. All rights reserved.

关键词： Ground response non-recursive algorithm Hybrid Frequency Time Domain Stochastic analysis

来源：评论

学校读者我要写书评

暂无评论

Ground Response Analysis of Cemented Alluviums Using non-recursive algorithm

引用

JOURNAL OF EARTHQUAKE ENGINEERING 2020年第9期24卷 1390-1416页

作者： Torabipour, Amin Hamidi, Amir Kharazmi Univ Sch Engn Tehran Iran

Natural or artificial cementation strongly affects stiffness and damping characteristics of soil deposits. In this paper, it is tried to figure out cementation effects on the spectral response using one-dimensional ground response analysis. A constitutive model is applied which is based on separating the mechanical behavior of cemented soil into two distinct parts, soil matrix and cemented bonds. A non-recursive algorithm was used to calculate the nonlinear behavior of horizontally multilayered soil in frequency domain. The model was verified based on recorded acceleration time histories at sites with cemented alluviums and the results showed good consistency.

关键词： Cemented Coarse-Grained Alluvium Constitutive Model One-Dimensional Ground Response Analysis non-recursive algorithm Sensitivity Analysis

来源：评论

学校读者我要写书评

暂无评论

Automatic Verification of non-recursive algorithm of Hanoi Tower by Using Isabelle Theorem Prover 17

Automatic Verification of Non-recursive Algorithm of Hanoi T...

引用

17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)

作者： Xu, Huazhen You, Zhen Xue, Jinyun Jiangxi Normal Univ Comp Informat Engn Sch Nanchang 330022 Peoples R China Jiangxi Normal Univ State Int S&T Cooperat Base Networked Supporting Nanchang 330022 Peoples R China

ISBN: (纸本)9781509022397

Hanoi Tower problem is an ancient and interesting puzzle and Isabelle is one of famous proof assistants. We have put forward a method to verify the correctness of algorithmic programs based on Isabelle, and have presented formal derivation and proof about the non-recursive algorithm of Hanoi Tower problem in our previous work. The focus of this paper is to turn the former manual verification to automatic verification by using Isabelle Theorem Prover. On the other hand, we originally find a boundary function, which used to proof termination of our non-recursive algorithm of Hanoi Tower problem. This work realizes mechanically automatic-verifying the complete correctness of our non-recursive algorithm of Hanoi Tower Problem, and overcomes the intricacies of manual verification, improves the verification efficiency, and ensures the trustworthiness and reliability of the algorithm program.

关键词： Hanoi Tower Isabelle automatic verification non-recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on recursive and non-recursive algorithm Solving a Question from ＂Blue Bridge Cup＂ National Software Competition in China

International Core Journal of Engineering

引用

International Core Journal of Engineering 2022年第1期8卷 237-242页

作者： Chunya Gong

Coaching for the Blue Bridge Cup competition requires much effort. It is enlightening for students to study the solutions of typical competition questions. A strange game for the Blue Bridge Cup competition, Carrying ... 详细信息

关键词： Blue Bridge Cup Software Competition non-recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Unified formal derivation and automatic verification of three binary-tree traversal non-recursive algorithms

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2016年第4期19卷 2145-2156页

作者： You, Zhen Xue, Jinyun Zuo, Zhengkang Jiangxi Normal Univ State Int S&T Cooperat Base Networked Supporting Nanchang 330022 Peoples R China Jiangxi Normal Univ Prov Key Lab High Performance Comp Nanchang 330022 Peoples R China Jiangxi Normal Univ Comp Informat Engn Sch Nanchang 330022 Peoples R China

Binary tree traversal algorithm can be applied in many aspects, such as information encryption, Network, operating systems, cluster computing and so on. We have already proposed a useful method to verify the correctness of algorithmic programs based on Isabelle proof assistant and Dijkstra's weakness precondition theory, and have manually derived and verified binary tree traversal non-recursive algorithms in our previous work. In order to ensure the security of the non-recursive algorithms, the focus of this paper is to construct a unified recurrence-relations expression about preorder, in-order, and post-order binary tree traversal non-recursive algorithms. The recurrence-relations expression make it easier to derive the loop invariants of three algorithms. Meanwhile, we automatically verify the correctness of three kinds of non-recursive algorithms by using a generic proof assistant Isabelle. This work realizes mechanically automatic-verification and overcomes the intricacies and weakness of manual verification, improves the verification efficiency, and ensures the trustworthiness and reliability of the algorithm program.

关键词： Binary tree traversal non-recursive algorithm Isabelle proof assistant

来源：评论

学校读者我要写书评

暂无评论

A comparison design of comb decimators for sigma-delta analog-to-digital converters

引用

ANALOG INTEGRATED CIRCUITS AND SIGNAL PROCESSING 2000年第1期22卷 51-60页

作者： Gao, YH Jia, LH Isoaho, J Tenhunen, H Royal Inst Technol Elect Syst Design Lab S-16440 Stockholm Sweden

This paper presents a comparison design of comb decimators based on the non-recursive algorithm and the recursive algorithm. Compared with the recursive algorithm, the main advantage of the non-recursive algorithm is its abilities of reducing power consumption and increasing circuit speed especially when the decimation ratio and filter order are high. Based on the non-recursive algorithm, a decimator with programmable filter orders (3rd, 4th and 5th), decimation ratios (8, 16, 32 and 64) and input bits (1 and 2 bits) has been implemented in a 0.6 mu m 3.3 V CMOS process. Its measured core power consumption is 44 mW at the oversampling rate of 25 MHz and its highest input data rate is 110 MHz.

关键词： comb decimator non-recursive algorithm recursive algorithm low power high speed sigma-delta A/D converters

来源：评论

学校读者我要写书评

暂无评论

Fast-tracking method of inertial constant based on system identification

SCIENCE AND TECHNOLOGY FOR ENERGY TRANSITION

引用

SCIENCE AND TECHNOLOGY FOR ENERGY TRANSITION 2024年 79卷

作者： Hu, Xuekai Zeng, Siming Meng, Liang Li, Tiecheng Zhang, Qian State Grid Hebei Elect Power Res Inst Shijiazhuang 050021 Peoples R China

Aiming at the problem of quantitative inertia evaluation of a new energy electric power system, the system inertia constant tracking method based on system identification is studied. The method is divided into two categories: non-recursive algorithm and recursive algorithm. The non-recursive algorithm uses a batch of data for batch processing to obtain the estimated value of the identification model parameters. The recursive algorithm is based on the estimated value of the model parameter at the previous moment and corrects the estimated value based on the new data currently obtained. From the perspective of the identification principle, the difference and internal relationship between the two in terms of calculation storage and identification speed are analyzed. The IEEE typical system is used to compare and verify the experimental examples. Theoretical analysis and experimental results show that the recursive algorithm has high identification accuracy, stable identification results and fast identification speed. It is suitable for the identification of objects with large numbers of nodes and complex structures, which is conducive to real-time monitoring and fast perception of the inertia constant of the new energy power system.

关键词： Electric power systems Inertia constant System identification Quantitative evaluation non-recursive algorithm recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Attenuation Coefficient Determination for Performance Evaluation of Resampling Filter 2

Attenuation Coefficient Determination for Performance Evalua...

引用

2nd International Conference on Energy, Power and Environment - Towards Smart Technology (ICEPE)

作者： Mondal, Sourav Paul, Bishakh Ghosh, Debomita Mohanta, Dusmanta Kumar Birla Inst Technol Elect & Elect Engn Dept Ranchi Bihar India

ISBN: (纸本)9781538647691

In a power system frequency of voltage and current signals changes continuously from rated frequency because of changes in load, generation imbalances, and when switching and fault events take place. As the grid frequency deviates continuously from rated frequency, the use of conventional frequency estimation algorithms produces error in phasor calculation. To identify the presence of error in estimated phasor due to off-nominal frequency, it is essential to compute attenuation factors at that off-nominal frequency. Attenuation factors are helpful to identify the off-nominal frequency from the phasor output which is useful for resampling filter design. Attenuation factors are very useful for performance evaluation of a frequency adaptive phasor measurement unit (PMU). This paper presents a model in LabVIEW to compute attenuation factors at different off-nominal frequency condition as well as to develop a model of frequency adaptive PMU. The performance of re-sampling filter has been tested under over and under frequency condition to efficate the result of attenuation factor.

关键词： non-recursive algorithm off-nominal frequency attenuation factor resampling filter

来源：评论

学校读者我要写书评

暂无评论

Simulation of Phasor Measurement Unit (PMU) in MATLAB 4

Simulation of Phasor Measurement Unit (PMU) in MATLAB

引用

2015 International Conference on Signal Processing And Communication Engineering Systems (SPACES)

作者： Kumar, Dhruba Ghosh, Debomita Mohanta, Dusmanta Kumar Birla Inst Technol Dept Elect & Elect Engn Ranchi Bihar India

ISBN: (纸本)9781479961085

The advent of phasor measurement unit in power system is revolutionizing the conventional grid towards smart grid. Phasor measurement units are extremely expensive devices which takes into account many aspects of the power system that are not disclosed by the manufacturer while estimating phasors of currents and voltage. This paper aims to build a laboratory prototype of PMU which can estimate the phasor updating process of a commercial PMU at the benefit of improved measurement accuracy, reduced manufacturing cost and increased timely information.

关键词： Phasor measurement units (PMIls) wide area measurement system (WAMS) recursive algorithm non-recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Development Method of Three Kinds of Typical Tree Structure algorithms and Isabelle-based Machine Assisted Verification 20

Development Method of Three Kinds of Typical Tree Structure ...

引用

20th IEEE International Conference on Software Quality, Reliability, and Security (QRS)

作者： Wang, Changjing Xu, Fan Luo, Haimei Huang, Qing Zuo, Zhengkang Jiangxi Normal Univ Sch Comp Infonnat Engn Nanchang Jiangxi Peoples R China Jiangxi Normal Univ Sch Phys & Commun Elect Nanchang Jiangxi Peoples R China

ISBN: (纸本)9781728189130

The tree structure algorithms have been widely used in many computer fields. Developing efficient and reliable tree structure algorithms is a challenging problem in the field of software formalization and trusted software. In this paper, initially, the binary tree algorithms are divided into three kinds through induction of the loop invariant structures and output features. Then, PAR method can conveniently develop loop invariants and corresponding non-recursive algorithm programs. Finally, Isabelle is used to formally verify these developed algorithms. This development method not only overcomes the tediousness and error-proneness of traditional manual verification, but also greatly improves the efficiency and reliability of the developed algorithm program. To the best of our knowledge, this is the maiden attempt in the literature to verify a series of non-recursive and efficient binary tree algorithms. The above process forms a theorem proving library that include data types, data structures and lemma related binary tree algorithms, which can significantly reduce the cost of future verification.

关键词： Tree structure non-recursive algorithm PAR method Loop invariant Isabelle

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：