A lattice in euclidean space which is an orthogonal sum of nontrivial sublattices is called decomposable. We present an algorithm to construct a lattice’s decomposition into indecomposable sublattices. Similar methods are used to prove a covering theorem for generating systems of lattices and to speed up variations of the LLL algorithm for the computation of lattice bases from large generating ...

Minimal generating subspaces of “weak PBW-type” for vertex operator algebras are studied and a procedure is developed for finding such subspaces. As applications, some results on generalized modules are obtained for vertex operator algebras that satisfy a certain condition, and a minimal generating space of weak PBW-type is produced for VL with L any positive-definite even lattice.

Current methods for generating qualitatively different plans are either based on simple randomization of planning decisions and so cannot guarantee meaningful differences among generated plans, or require extensive user involvement to drive the system into different sections of the overall plan space. This paper presents a cost-effective method for automatically generating qualitatively differe...

1 Branching processes in random environment In this lecture fundamental properties of branching processes in a random environment are developed. In such a process individuals reproduce independently of each other according to random offspring distributions which vary from one generation to the other. To give a formal definition let P = {π} be the space of probability measures on N 0 Equipped wi...

Current methods for generating qualitatively different plans are either based on simple randomization of planning decisions and so cannot guarantee meaningful differences among generated plans, or require extensive user involvement to drive the system into different sections of the overall plan space. This paper presents a cost-effective method for automatically generating qualitatively differe...

This paper presents Celtic Canvas -a framework towards computationally generating patterns similar to simple Celtic artwork. As Celtic patterns are highly structured, a robust model of curvature dynamics is introduced in the paper to allow the evolution of space curves as a foundation for line drawing and structural anatomy. Cellular automata integrates several features including -lines and for...

We propose an extension to language models for information retrieval. Typically, language models estimate the probability of a document generating the query, where the query is considered as a set of independent search terms. We extend this approach by considering the concepts implied by both the query and words in the document. The model combines the probability of the document generating the ...

we consider an m/g/1 queue with regular and optional phase vacation and withstate dependent arrival rate. the vacation policy is after completion of service if there are no customers in the system, the server takes vacation consisting of k -phases, each phase is generally distributed. here the first phase is compulsory where as the other phases are optional. for this model the supplementary var...

Journal of Turbulence Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713665472 Lagrangian dynamic SGS model for stochastic coherent adaptive large eddy simulation Oleg V. Vasilyev a; Giuliano De Stefano b; Daniel E. Goldstein c; Nicholas K. -R. Kevlahan d a Department of Mechanical Engineering, University of ...