A Heuristic Rational Algorithm for Checking the Congruence of Normal Matrices

2020 ◽  
Vol 60 (10) ◽  
pp. 1601-1608
Author(s):  
Kh. D. Ikramov ◽  
A. M. Nazari
Keyword(s):  
Normal Matrices ◽  
Rational Algorithm

Accuracy contours in (nT, λ) space in electrochemical digital simulations

1991 ◽  
Vol 56 (1) ◽  
pp. 20-41 ◽  
Author(s):  
Dieter Britz ◽  
Merete F. Nielsen
Keyword(s):  
Finite Difference ◽  
Linear Sweep Voltammetry ◽  
Stability Factor ◽  
Dimensionless Time ◽  
Simulation Techniques ◽  
Rational Algorithm ◽  
The Stability ◽  
Transport Problems ◽  
Current Approximation ◽  
Digital Simulations

In finite difference simulations of electrochemical transport problems, it is usually tacitly assumed that λ, the stability factor Dδt/δx2, should be set as high as possible. Here, accuracy contours are shown in (nT, λ) space, where nT is he number of finite difference steps per unit (dimensionless) time. Examples are the Cottrell experiment, simple chronopotentiometry and linear sweep voltammetry (LSV) on a reversible system. The simulation techniques examined include the standard explicit (point- and box-) methods as well as Runge-Kutta, Crank-Nicolson, hopscotch and Saul’yev. For the box method, the two-point current approximation appears to be the most appropriate. A rational algorithm for boundary concentrations with explicit LSV simulations is discussed. In general, the practice of choosing as high a λ value when using the explicit techniques, is confirmed; there are practical limits in all cases.

scholarly journals Knowledge-based Algorithms for BDI-agents

2020 ◽  
Vol 27 (4) ◽  
pp. 442-453
Author(s):  
Nikolay Vyacheslavovich Shilov ◽  
Natalia Olegovna Garanina
Keyword(s):  
Distributed Algorithm ◽  
Cooperative Work ◽  
Bdi Agents ◽  
Resource Center ◽  
On Demand ◽  
Knowledge Based ◽  
Rational Algorithm ◽  
Available Resources

Multiagent algorithm is a knowledge-based distributed algorithm that solves some problems by means of cooperative work of agents. From an individual agent's perspective, a multiagent algorithm is a reactive and proactive knowledge/believe-based rational algorithm aimed to achieve an agent's own desires. In the paper we study a couple of knowledge-based multiagent algorithms. One particular algorithm is for a system consisting of agents that arrive one by one (in a non-deterministic order) to a resource center to rent (for a while) one of available desired resources. Available resources are passive, they form a cloud; each of the available resources is lent on demand if there is no race for this resource and returns to the cloud after use. Agents also form a cloud but leave the cloud immediately when they rent a desired resource. The problem is to design a knowledge-based multiagent algorithm, which allows each arriving agent eventually to rent some of desired resources (without race for these resources).

scholarly journals Actual features of express diagnostic of acetabular fractures. Part II. Complex fractures diagnostic algorithm

2019 ◽  
Vol 26 (4) ◽  
pp. 46-54
Author(s):  
S. S Stoyukhin ◽  
A. F Lazarev ◽  
Yu. G Gudushauri
Keyword(s):  
Diagnostic Algorithm ◽  
Acetabular Fractures ◽  
Fracture Type ◽  
Case Presentation ◽  
Complex Fractures ◽  
Rational Algorithm ◽  
Fracture Types

Authors shows rational algorithm of choosing fracture type according to Judet-Letournel classification. Case presentation is based on complex («associated») fracture types.

Sign in / Sign up

Export Citation Format

Share Document