COGNITION ON SPATIAL STRUCTURE OF VOLUMES WITH RANDOM LAYOUT

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the structure of lie derivations on c*-algebras

نشان می دهیم که هر اشتقاق لی روی یک c^*-جبر به شکل استاندارد است، یعنی می تواند به طور یکتا به مجموع یک اشتقاق لی و یک اثر مرکز مقدار تجزیه شود. کلمات کلیدی: اشتقاق، اشتقاق لی، c^*-جبر.

15 صفحه اول

Influence of initial spatial layout on seismic behavior of masonry buildings with curved roof systems

Early design decisions made on building configuration and spatial design affect seismic behavior of buildings. Therefore introducing design guidelines and empirical methods implemented to assess seismic behavior of buildings have been proposed as an appropriate approach. Such concept helps architects to take into the consideration that how their preliminary design decisions influence downstream...

متن کامل

Layout Volumes of the Hypercube

We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Graph Drawing 2003 [5]. For both models we prove general lower bounds which relate volumes of layouts to a graph parameter cutwidth. Then we propose tight bounds on volumes of layouts of N -vertex hypercubes. Especially,...

متن کامل

Spatial Beta Regression Model with Random Effect

 Abstract: In many applications we have to encountered with bounded dependent variables. Beta regression model can be used to deal with these kinds of response variables. In this paper we aim to study spatially correlated responses in the unit interval. Initially we introduce spatial beta generalized linear mixed model in which the spatial correlation is captured through a random effect. T...

متن کامل

Approximating Layout Problems on Random Geometric Graphs

In this paper, we study the approximability of several layout problems on a family of random geometric graphs. Vertices of random geometric graphs are randomly distributed on the unit square and are connected by edges whenever they are closer than some given parameter. The layout problems that we consider are: Bandwidth, Minimum Linear Arrangement, Minimum Cut Width, Minimum Sum Cut, Vertex Sep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Architecture and Planning (Transactions of AIJ)

سال: 2010

ISSN: 1340-4210,1881-8161

DOI: 10.3130/aija.75.1407