Powerful assemblages?

نویسندگان

چکیده

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

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

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

منابع مشابه

Evolving assemblages

‘Evolving assemblages’ explores the transformation of images or three-dimensional (3D) models in order to create large-scale assemblages of 3D objects. The proposed approach allows the evolution of the type, size, rotation and position of each object, constructing a non-photorealistic transformation of a source image or 3D model. The creator evaluates each individual of the population according...

متن کامل

Information Systems and Assemblages

Eleni Lamprou, Nathalie Mitev, Bill Doolin. Information Systems and Assemblages. Bill Doolin; Eleni Lamprou; Nathalie Mitev; Laurie McLeod. 5th Working Conference on Information Systems and Organizations (ISO), Dec 2014, Auckland, New Zealand. Springer, IFIP Advances in Information and Communication Technology, AICT-446, pp.1-7, 2014, Information Systems and Global Assemblages. (Re)Configuring ...

متن کامل

The powerful placebo.

are not particularly noted for the pleasure which they give to their recipients. One meaning of the word dummy is a "counterfeit object." This seems to me the right word to describe a form of treatment which is intended to have no effect and I follow those who use it. A placebo is something which is intended to act through a psychological mechanism. It is an aid to therapeutic suggestion, but t...

متن کامل

How Powerful isUnconditional

We prove that every recursively enumerable language can be generated by a programmed grammar with context-free core rules using unconditional transfer with leftmost derivation of type 3 or type 2. We show that every recursively enumerable tally language can be generated by a programmed grammar with context-free core rules using unconditional transfer or by some k-limited ET0L system, where k 2 ...

متن کامل

Powerful Arithmetic Progressions

We give a complete characterization of so called powerful arithmetic progressions, i.e. of progressions whose kth term is a kth power for all k. We also prove that the length of any primitive arithmetic progression of powers can be bounded both by any term of the progression different from 0 and ±1, and by its common difference. In particular, such a progression can have only finite length.

متن کامل

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


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

ژورنال

عنوان ژورنال: Area

سال: 2011

ISSN: 0004-0894

DOI: 10.1111/j.1475-4762.2011.01005.x