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

OVERVIEW OF SPICE-LIKE CIRCUIT simulation algorithms

IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS 1994年第4期141卷 242-250页

作者： NICHOLS, KG KAZMIERSKI, TJ ZWOLINSKI, M BROWN, AD Dept. of Electron. & Comput. Sci. Southampton Univ. UK

A tutorially orientated account of the principles underlying circuit level simulation forms the basis for discussing reliability of circuit level simulation. An outline of equation formulation and time discretisation of the equations is followed by consideration of stability of the numerical integration methods. The precision of simulation, which also depends on the integration methods used, is then discussed, with particular reference to the analysis parameters of the SPICE simulator. A descriptive account of the Newton-Raphson method of solving the nonlinear algebraic equations, derived from the discretised differential equations, is then presented again with relation to SPICE parameters. The reasons for convergence failure in both transient and DC simulation are related to the underlying principles of simulation and possible ill conditioning of the circuit. The paper includes some simple simulation examples of problematic situations.

关键词： SPICE simulation algorithms CIRCUIT LEVEL simulation

来源：评论

学校读者我要写书评

暂无评论

Kalikow decomposition for counting processes with stochastic intensity and application to simulation algorithms

引用

JOURNAL OF APPLIED PROBABILITY 2023年第4期60卷 1469-1500页

作者： Phi, Tien Cuong Locherbach, Eva Reynaud-Bouret, Patricia Univ Cote Azur LJAD Nice France Univ Paris 1 Pantheon Sorbonne Stat Anal & Modelisat Multidisciplinaire EA 4543 Paris France Univ Cote Azur CNRS LJAD Nice France

We propose a new Kalikow decomposition for continuous-time multivariate counting processes, on potentially infinite networks. We prove the existence of such a decomposition in various cases. This decomposition allows us to derive simulation algorithms that hold either for stationary processes with potentially infinite network but bounded intensities, or for processes with unbounded intensities in a finite network and with empty past before zero. The Kalikow decomposition is not unique, and we discuss the choice of the decomposition in terms of algorithmic efficiency in certain cases. We apply these methods to several examples: the linear Hawkes process, the age-dependent Hawkes process, the exponential Hawkes process, and the Galves-Locherbach process.

关键词： Kalikow decomposition counting process Hawkes process perfect simulation simulation algorithms

来源：评论

学校读者我要写书评

暂无评论

Semantics and Efficient simulation algorithms of an Expressive Multilevel Modeling Language

引用

ACM TRANSACTIONS ON MODELING AND COMPUTER simulation 2017年第2期27卷 8-8页

作者： Helms, Tobias Warnke, Tom Maus, Carsten Uhrmacher, Adelinde M. Univ Rostock Albert Einstein Str 22 D-18059 Rostock Germany German Canc Res Ctr Neuenheimer Feld 280 D-69120 Heidelberg Germany

The domain-specific modeling and simulation language ML-Rules is aimed at facilitating the description of cell biological systems at different levels of organization. Model states are chemical solutions that consist of dynamically nested, attributed entities. The model dynamics are described by rules that are constrained by arbitrary functions, which can operate on the entities' attributes, (nested) solutions, and the reaction kinetics. Thus, ML-Rules supports an expressive hierarchical, variable structure modeling of cell biological systems. The formal syntax and semantics of ML-Rules show that it is firmly rooted in continuous-time Markov chains. In addition to a generic stochastic simulation algorithm for ML-Rules, we introduce several specialized algorithms that are able to handle subclasses of ML-Rules more efficiently. The algorithms are compared in a performance study, leading to conclusions on the relation between expressive power and computational complexity of rule-based modeling languages.

关键词： Formal languages simulation algorithms performance multilevel modeling

来源：评论

学校读者我要写书评

暂无评论

simulation of aerosol dynamics and transport in chemically reacting particulate matter laden flows. Part I: Algorithm development and validation

引用

CHEMICAL ENGINEERING SCIENCE 2004年第2期59卷 345-358页

作者： Kommu, S Khomami, B Biswas, P Washington Univ Dept Chem Engn Mat Res Lab St Louis MO 63130 USA

To accurately predict aerosol dynamics in various systems, it is imperative to combine the governing equations for transport of momentum, mass and energy as well as reaction kinetics with an accurate procedure for solving the general dynamic equation (GDE). A generalized approach for solution of the GDE based on the discrete-sectional approach in presence of convective and molecular transport is presented. As computational efficiency is an important factor in realistic implementation of such a model, in Part-I of this two-part paper series an adaptive semi-implicit algorithm based on the concept of operating splitting is presented. It is shown that this algorithm is the method of choice for solving the GDE in presence or absence of convective transport based on a discrete-sectional approach. (C) 2003 Elsevier Ltd. All rights reserved.

关键词： aerosol dynamics discrete-sectional GDE transport simulation algorithms

来源：评论

学校读者我要写书评

暂无评论

simulation of Spatial P system models

引用

THEORETICAL COMPUTER SCIENCE 2014年 529卷 11-45页

作者： Barbuti, Roberto Maggiolo-Schettini, Andrea Milazzo, Paolo Pardini, Giovanni Univ Pisa Dipartimento Informat Pisa Italy

Spatial P systems are an extension of the P systems formalism in which objects and membranes are embedded into a two-dimensional discrete space. Spatial P systems are characterised by the distinction between ordinary objects and mutually exclusive objects, with the constraint that any position can accommodate any number of ordinary objects, and at most one mutually exclusive object. The presence of mutually exclusive objects makes the simulation of Spatial P system models more complex than that of standard P systems. In this paper, we present a polynomial-time algorithm for the simulation of a restricted version of Spatial P systems where the restriction consists in considering only mutually exclusive objects and rules having exactly one reactant and one product. This version of Spatial P systems, although very restricted, is expressive enough to model interesting biological systems. In particular, we show how it can be used to simulate two models describing different dynamics of fish populations, namely the dynamics of territorial fish and the formation and movement of herring schools. In addition, the simulation methodology we propose can be adapted to simulate richer versions of Spatial P systems. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Membrane computing simulation algorithms Spatiality Fish populations Computational Molecular Biology P Blood-Group System simulating Phosphorus Mutually exclusive

来源：评论

学校读者我要写书评

暂无评论

Modeling and simulation of planar flexible link manipulators with rigid tip connections to revolute joints

引用

ROBOTICA 2004年第3期22卷 285-300页

作者： Megahed, SM Hamza, KT Cairo Univ Fac Engn Giza 12316 Egypt

This paper presents the basis of a mathematical model for simulation of planar flexible-link manipulators, taking into consideration the effect of higher stiffness zones at the link tips. The proposed formulation is a variation of the finite segment multi-body dynamics approach. The formulation employs a consistent mass matrix in order to provide better approximation than the traditional Jumped masses often encountered in the finite segment approach. The formulation is implemented into a computational code and tested through three examples;cantilever beam, rotating beam and three-link manipulator. In these examples, the length of the rigid tips at both sides of each link ranges from 0% to 6.25% of the whole link length. The zones of higher stiffness at the link tips are treated as short rigid zones. The effect of the rigid zones is averaged along with some portions of the flexible links, thereby allowing further simplification of the dynamic equations of motion. The simulation results demonstrate the effectiveness of the proposed modeling technique and show the importance of not ignoring the effect of the rigid tips.

关键词： flexible manipulators modeling simulation algorithms multi-body dynamics

来源：评论

学校读者我要写书评

暂无评论

simulation of graphical models for multiagent probabilistic inference

引用

simulation-TRANSACTIONS OF THE SOCIETY FOR MODELING AND simulation INTERNATIONAL 2003年第10期79卷 545-567页

作者： Xiang, Y An, X Cercone, N Univ Guelph Coll Phys & Engn Sci Dept Comp & Informat Sci Guelph ON N1G 2W1 Canada Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada Dalhousie Univ Fac Comp Sci Halifax NS B3H 1W5 Canada

Multiply-sectioned Bayesian networks (MSBNs) extend Bayesian networks to graphical models for multiagent probabilistic reasoning. The empirical study of algorithms for manipulations of MSBNs (e.g., verification, compilation, and inference) requires experimental MSBNs. As engineering MSBNs in large problem domains requires significant knowledge and engineering effort, the authors explore automatic simulation of MSBNs. Due to the large domain over which an MSBN is defined and a set of constraints to be satisfied, a generate-and-test approach toward simulation has a high rate of failure. The authors present an alternative approach that treats the simulation process as a sequence of decisions. They constrain the space of each decision so that backtracking is minimized and the outcome is always a legal MSBN. A suite of algorithms that implements this approach is presented, and experimental results are shown.

关键词： simulation algorithms graphical models multiagent systems probabilistic reasoning computer science

来源：评论

学校读者我要写书评

暂无评论

ADVISOR 2.1: A user-friendly advanced powertrain simulation using a combined backward/forward approach

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 1999年第6期48卷 1751-1761页

作者： Wipke, KB Cuddy, MR Burch, SD Natl Renewable Energy Lab Golden CO 80401 USA Gen Motors Honeoye Falls NY 14472 USA

ADVISOR 2.1 is the latest version of the National Renewable Energy Laboratory's advanced vehicle simulator, It was first developed in 1994 to support the U.S. Department of Energy hybrid propulsion system program and is designed to be accurate, fast, flexible, easily sharable, and easy to use. This paper presents the model, focusing on its combination of forward- and backward-facing simulation approaches, and evaluates the model in terms of its design goals. ADVISOR predicts acceleration time to within 0.7% and energy use on the demanding US06 to within 0.6% for an underpowered series hybrid vehicle (0-100 km/h in 20 s), ADVISOR simulates vehicle performance on standard driving cycles between 2.6 and 8.0 times faster than a representative forward-facing vehicle model. Due in large part to ADVISOR's powerful graphical user interface and Web presence, over 800 users have downloaded ADVISOR from 45 different countries. Many of these users have contributed their own component data to the ADVISOR library.

关键词： Backward-facing simulator Component sizing Forward-facing simulator Fuel economy Hybrid electric vehicle (HEV) Optimization simulation algorithms Vehicle simulation Vehicle performance Fuel economy component sizing Powertrain Vehicle model acceleration time U. S. Department of Energy Driving cycle

来源：评论

学校读者我要写书评

暂无评论

Rank and simulation: the well-founded case

引用

JOURNAL OF LOGIC AND COMPUTATION 2015年第6期25卷 1331-1349页

作者： Gentilini, Raffaella Piazza, Carla Policriti, Alberto Univ Perugia Dip Matemat & Informat Perugia IT Italy Univ Udine Dip Matemat & Informat I-33100 Udine IT Italy

We consider the algorithmic problem of computing the maximal simulation preorder (and quotient) on acyclic labelled graphs. The acyclicity allows to exploit an inner structure on the set of nodes, that can be processed in stages according to a set-theoretic notion of rank. This idea, previously used for bisimulation computation, on the one hand improves on the performances of the ensuing procedure and, on the other hand, gives to the solution an orderly iterative flavour making the algorithmic idea more explicit. The computational complexity achieved is good as we obtain the best performing algorithm for simulation computation on acyclic graphs, in both time and space.

关键词： simulation preorder simulation quotient directed acyclic graphs (DAGS) rank simulation algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Graph simulation: Impossibility and Possibility

引用

PROCEEDINGS OF THE VLDB ENDOWMENT 2014年第12期7卷 1083-1094页

作者： Fan, Wenfei Wang, Xin Wu, Yinghui Deng, Dong Univ Edinburgh Edinburgh Midlothian Scotland Beihang Univ RCBD & SKLSDE Lab Beijing Peoples R China Washington State Univ Pullman WA USA Southwest Jiaotong Univ Chengdu Sichuan Peoples R China Tsinghua Univ Beijing Peoples R China

This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G. kVe say that A is parallel scalable in (a) response time if its parallel computational cost is determined by the largest fragment F-m of G and the size vertical bar Q vertical bar of query Q, and (b) data shipment if its total amount of data shipped is determined by vertical bar Q vertical bar and the number of fragments of C. independent of the size of graph G. (1) We prove an impossibility theorem: there exists no distributed graph simulation algorithm that is parallel scalable in either response time or data shipment. (2) However, we show that distributed graph simulation is par ion bounded, i.e., its response time depends only on vertical bar Q vertical bar, vertical bar F-m vertical bar and the number vertical bar V-f vertical bar of nodes in G with edges across different fragments;and its data shipment depends on vertical bar Q vertical bar and the number vertical bar E-f vertical bar of crossing edges only. We provide the first algorithms with these performance guarantees. (3) We also identify special cases of patterns and graphs when parallel scalability is possible. (4) We experimentally verify the scalability and efficiency of our algorithms.

关键词： Graph theory Computation theory Scalability Ships Computational costs Crossing edges Data shipment ITS data Parallel scalability Pattern query Performance guarantees simulation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：