Chapter

Production Systems and AI

January 1982

DOI:10.1007/978-3-662-09438-9_2

In book: Principles of Artificial Intelligence (pp.17-52)

Authors:

Most artificial intelligence (AI) systems display a more or less rigid separation between the standard computational components of data, operations, and control. That is, if these systems are described at an appropriate level, one can often identify a central entity that might be called and global database that is manipulated by certain well-defined operations, all under the control of some global control strategy. The chapter discusses the importance of identifying an appropriate level of description. Near the machine-code level, any neat separation into distinct components can disappear; at the top level, the complete AI system can consist of several database/operations/control modules interacting in a complex fashion. The point is that a system consisting of separate database, operations, and control components represents an appropriate metaphorical building block for constructing lucid descriptions of AI systems.

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Full-text available

An automatic hybrid numerical scheme for global RANS-LES approaches

November 2017 · Journal of Physics Conference Series

A new automatic high-order hybrid central-difference/upwind scheme is developed for the finite-volume approximation of the inviscid fluxes within global hybrid RANS-LES approaches. Performance of the scheme is illustrated by examples of computations of three types of flow: a flow with massive separation with the use of Delayed Detached-Eddy Simulation (DDES), a flow with separation and ... [Show full abstract] reattachment with the use of DDES with shear-layer adapted subgrid length scale, and a fully attached flow with the use of Improved DDES (IDDES).

Conference Paper

Distributed Gauss-Newton method for node loclaization in wireless sensor networks

July 2005

We present distributed algorithms for sensor localization based on the Gauss-Newton method. Each sensor updates its estimated location by computing the Gauss-Newton step for a local cost function and choosing a proper step length. Then it transmits the updated estimate to all the neighboring sensors. The proposed algorithms provide non-increasing values of a global cost function. It is shown in ... [Show full abstract] the paper that the algorithms have computational complexity of O(n) per iteration and a reduced communication cost over centralized algorithms.

Conference Paper

On the Merge of Factor Canonical Bases

February 2008 · Lecture Notes in Computer Science

Formal concept analysis (FCA) has a significant appeal as a formal framework for knowledge discovery not least because of the mathematical tools it provides for a range of data manipulations such as splits and merges. We study the computation of the canonical basis of a context starting from the bases of two apposed subcontexts, called factors. Improving on a previous method of ours, we provide ... [Show full abstract] here a deeper insight into its pivotal implication family and show it represents a relative basis. Further structural results allow for more efficient computation of the global basis, in particular, the relative one admits, once added to factor bases, an inexpensive reduction. A method implementing the approach as well as a set of further combinatorial optimizations is shown to outperform NextClosure on at least one dataset.

Article

Search for global extremum of factorable univariate functions

July 1996 · Journal of Computer and Systems Sciences International

Grigory Kosenok

A special method for the approximation of a univariate function by a polynomial is proposed. The use of the method allows one to speed up the computation of the global minimum of a one-dimensional function, which itself is a central issue for more general problems. An example of the work of the algorithm is presented.

Article

Long-term estimates of parameters of the vertical distribution of cloud layers from atmospheric radi...

April 2016 · Russian Meteorology and Hydrology

Based on the global aerological dataset and on the method for determination of the boundaries and amount of cloudiness using the profiles of temperature and humidity obtained from the atmospheric radiosounding data [23], the estimates are computed for the parameters of atmospheric temperature- humidity separation into cloud and intercloud layers from the surface to the height of 10 km. The base ... [Show full abstract] and top of cloud layers and their total thickness and frequency are selected as layering parameters. The computations are based on the data for the observational period of 1964-1998. To specify the spatiotemporal features of atmospheric layering, long-term geographic distributions of mean values and standard deviations of the mentioned parameters are constructed for January and July, and the amplitude of their variations is determined.

Article

Full-text available

How To Withstand Mobile Virus Attacks

January 1991

Rafail OstrovskyMoti YungyAbstractWe initiate a study of distributed adversarial modelof computation in which faults are non-stationary andcan move through the network, analogous to a spreadof a virus or a worm. We show how local computations(at each processor) and global computations can bemade robust using a constant factor resilience and apolynomial factor redundancy in the computation.1 ... [Show full abstract] IntroductionComputer viruses pose one of the central problems indistributed computing...

Article

Determining a Pair of Concentric Spheres for Assessing Sphericity Errors Using Discrete Voronoi Diag...

August 2000 · The International Journal of Advanced Manufacturing Technology

In this paper, we propose a new procedure Soi computing a pair of concentric spheres with a minimum radial separation for assessing sphericity errors by constructing discrete farthest and nearest Voronoi diagrams. The properties of 3D Voronoi diagrams are explored to determine a pair of concentric spheres with minimum radial separation such that all the data points are bounded by these two ... [Show full abstract] spheres. A voxel map is used to construct a discrete Voronoi diagram. The convergence of die proposed procedure to the true global minimum sphericity error is guaranteed. This procedure works for various forms of spherical measurement data, including scattered measurement points. The proposed procedure is simple in implementation and effective in computation.

Chapter

On the Neural Computations Underlying Curve Detection

December 1990

This chapter focuses on the neural computations underlying curve detection. An analogous dilemma exists for computer vision systems, even with the spectacular numerical precision of which computers are capable—quantization and noise imply smoothing, but smoothing blurs corners, endpoints, and nearby curves into confusion. The chapter defines orientation selection to be the inference of a local ... [Show full abstract] description of the curve everywhere along it, and postulate orientation selection as the goal of the first stage. In the second stage, global curves are inferred through the local description. Formally, orientation selection amounts to inferring the trace of the curve, or the set of points through which the curve passes, its approximate tangent and curvature at those points, and their discontinuities. As curvature is a relationship between tangents at nearby positions, two tangents should support one another if and only if they agree under a curvature hypothesis, and co-circularity provides the measure of such support.

Article

Distributed model predictive control for active power control of wind farm

January 2015

This paper presents the active power control of a wind farm using the Distributed Model Predictive Controller (D-MPC) via dual decomposition. Different from the conventional centralized wind farm control, multiple objectives such as power reference tracking performance and wind turbine load can be considered to achieve a trade-off between them. Additionally, D-MPC is based on communication among ... [Show full abstract] the subsystems. Through the interaction among the neighboring subsystems, the global optimization could be achieved, which significantly reduces the computation burden. It is suitable for the modern large-scale wind farm control.

Conference Paper

Full-text available

First Steps Towards Incremental Diagnosis of Discrete-Event Systems

May 2005 · Lecture Notes in Computer Science

This paper deals with the incremental off-line computation of diagnosis of discrete-event systems. Traditionally, the diagnosis is com- puted from the global automaton describing the observations emitted by the system on a whole time period. The idea of this paper is to slice this global automaton according to temporal windows and to compute local diagnoses for each of these windows. It is shown ... [Show full abstract] that, under some con- ditions, the global diagnosis can be computed from the local diagnosis. This paper presents the formalization used to compute an incremental diagnosis, relying on the new concept of automata chain. It is then shown that it is possible to take into account the diagnosis obtained for the pre- vious temporal windows to incrementally compute the current diagnosis more efficiently. This work is a first and necessary step beforeconsidering the on-line diagnosis computation. The main difficulty is then to ensure the correct slicing of the observation automaton and to determine the appropriate temporal windows.

Article

Global instability computations of separated flows

December 2007 · PAMM

The primary motivation for the current work is to develop suitable techniques for studying the global instability in many different flows such as that occuring in the subsonic flow past a corner. In this paper we will discuss the methodology and some of the results obtained. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

Article

A sequential method for a class of box constrained quadratic programming problems

April 2008 · Mathematical Methods of Operations Research

The aim of this paper is to propose an algorithm, based on the optimal level solutions method, which solves a particular class of box constrained quadratic problems. The objective function is given by the sum of a quadratic strictly convex separable function and the square of an affine function multiplied by a real parameter. The convexity and the nonconvexity of the problem can be characterized ... [Show full abstract] by means of the value of the real parameter. Within the algorithm, some global optimality conditions are used as stopping criteria, even in the case of a nonconvex objective function. The results of a deep computational test of the algorithm are also provided.