This chapter explores the benefi ts of restructuring search spaces and internal representations so as to make search more effi cient. It begins by providing a formal defi nition of search, and proposes a method for shifting search between lowand high-dimensionality problem spaces. Consideration is given to how learning shapes the representations that help people search effi ciently as well as o...

Traditional information security models focus on protecting information or information systems. There is little research on controllability of Internet information security. We present network reference monitor (NRM) for access control in Internet environment. Then we propose the defi nition of network reference monitor and Internet information access control. Abstract operation model is put fo...

Translated by T.A. Zuur and The Language Workshop ......................................... Received: 28-02-11 Accepted: 06-04-11 Abstract The colonic stent placement is a new tool reaching two intends: creating a bridge to prepare the patient safely to the surgical procedure and/or defi nite palliation in those cases in which the clinical condition is not feasible. The cost-benefi t analysis p...

The paper discusses the issues of legal regulation decentralized financial services (DeFi). purpose work is to form a systematic understanding direction and scope in which they can be regulated based on DeFi technological features nature relationships that arise between digital platforms their users. methodological basis study determined by range tasks focused analysis finance simultaneously te...

Let A be an m n (m n) complex matrix. It is known that there is a unique polar decomposition A = QH, where Q Q = I, the n n identity matrix, and H is positive de nite, provided A has full column rank. This note addresses the following question: how much may Q change if A is perturbed? For the square case m = n our bound, which is valid for any unitarily invariant norm, is sharper and simpler th...

Three generalizations of the criss-cross method for quadratic programming are presented here. Tucker's, Cottle's and Dantzig's principal pivoting methods are specialized as diagonal and exchange pivots for the linear complementarity problem obtained from a convex quadratic program. A nite criss-cross method, based on least{index resolution, is constructed for solving the LCP. In proving nitenes...

Hecke algebras arise naturally in the representation theory of nite or p-adic Cheval-ley groups, as endomorphism algebras of certain induced representations (see Carter 9], Lusztig 42], and the references there). They may also be viewed as quotients of group algebras of Artin{Tits braid groups, and then they can be used to construct invariants of knots and links (Jones 34]). Another point of vi...

This paper presents methods for the time-dependent numerical solution of a two-dimensional model governing combustion in inert porous media. The spatial discretization is based on a mixed nite element method for the ow problem and a cell-centered nite volume scheme for the transport equations. Some results of numerical simulations show the innuence of a jump in the porosity of the solid matrix ...

In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel factorization. We extended the unitcost ll-preserving ordering into a generalized class that can adopt various aspects in parallel factorization, such as computation, communication and algorithmic diversity. Based on the ...