نتایج جستجو برای: discrete module

تعداد نتایج: 225264  

2006
Patrick Rößler Oliver C. Schrempf Uwe D. Hanebeck

The Motion Compression framework for extended range telepresence applications consists of three functional modules: path prediction, path transformation, and user guidance. This paper presents a new path prediction module for known environments that exploits the property, that humans typically walk on straight paths toward discrete goal objects. In order to estimate the user’s goal object out o...

2008
FRANCIS CLARKE

We study the category of discrete modules over the ring of degree zero stable operations in p-local complex K-theory. We show that the K(p)-homology of any space or spectrum is such a module, and that this category is isomorphic to a category defined by Bousfield and used in his work on the K(p)-local stable homotopy category [2]. We also provide an alternative characterisation of discrete modu...

2013
Moamar Sayed-Mouchaweh Cécile Labarre

In this paper, we propose a new model-based approach for the fault diagnosis of hybrid dynamic systems (HDS), in particular discretely controlled continuous system (DCCS). The goal is to construct a diagnosis module (called diagnoser) able to diagnose parametric and discrete faults. Parametric faults are characterized by abnormal changes in some system parameters whereas discrete faults are att...

2008
Tze-Yun Sung

This paper proposes two architectures of 2-D discrete wavelet transform (DWT) and inverse DWT (IDWT). The first high-efficiency architecture comprises a transform module, an address sequencer, and a RAM module. The transform module has uniform and regular structure, simple control flow, and local communication. The significant advantages of the single transform module are full hardware-utilizat...

2002
Christian Jones Ran Libeskind-Hadas

A matroid is a mathematical structure that generalizes the notion of linear independence. Remarkably, this simple and elegant mathematical structure can be used to systematically develop efficient and simple “greedy” algorithms for a variety of discrete optimization problems. Moreover, matroids provide some insight into why other discrete optimization problems are apparently computationally int...

2016
Paolo Felli Nitin Yadav Sebastian Sardina

We relate behavior composition, a synthesis task studied in AI, to supervisory control theory from the discrete event systems field. In particular, we show that realizing (i.e., implementing) a target behavior module (e.g., a house surveillance system) by suitably coordinating a collection of available behaviors (e.g., automatic blinds, doors, lights, cameras, etc.) amounts to imposing a superv...

2007
TZE-YUN SUNG

Abstract: This paper proposes two architectures of 2-D discrete wavelet transform (DWT) and inverse DWT (IDWT). The first high-efficiency architecture comprises a transform module, an address sequencer, and a RAM module. The transform module has uniform and regular structure, simple control flow, and local communication. The significant advantages of the single transform module are full hardwar...

2005
MICHAEL W DAVIS JAN DYMARA TADEUSZ JANUSZKIEWICZ BORIS OKUN

The cohomology of a group G with coefficients in a left G–module M is denoted H .GIM /. We are primarily interested in the case where M is the group ring, ZG . Since ZG is a G–bimodule, H .GIZG/ inherits the structure of a right G– module. When G is discrete and acts properly and cocompactly on a contractible CW complex , there is a natural topological interpretation for this cohomology group:...

Journal: :journal of algebraic systems 2014
ashkan nikseresht habib sharif

we state several conditions under which comultiplication and weak comultiplication modulesare cyclic and study strong comultiplication modules and comultiplication rings. in particular,we will show that every faithful weak comultiplication module having a maximal submoduleover a reduced ring with a finite indecomposable decomposition is cyclic. also we show that if m is an strong comultiplicati...

2017
Manish Bansal

In this paper, we consider the well-known constant-batch lot-sizing problem, which we refer to as the single module capacitated lot-sizing (SMLS) problem, and multi-module capacitated lot-sizing (MMLS) problem. We provide sufficient conditions under which the (k, l, S, I) inequalities of Pochet and Wolsey (Math of OR 18: 767-785, 1993), the mixed (k, l, S, I) inequalities, derived using mixing ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید