نتایج جستجو برای: l system

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

2006

The interpretation of these strings, as the characters used suggest, is that pal is a function that produces a palindrome from its argument and rpt is a function that produces a repeat of its first argument a number of times specified by its second argument. Note that although p, a, l, r, and t, are individual constant characters in the L-System, pal and rpt can be treated as strings during int...

1998
Zu-Guo Yu

A fuzzy aspect is introduced into L systems and some of its properties are investigated. The relationship between fuzzy L languages and the fuzzy languages generated by fuzzy grammar defined by Lee and Zadeh is elucidated. The concept of fuzzy entropy of a string is proposed as a measure of fuzziness of the latter. Some relationship between fuzzy L systems and the ordinary L systems is discussed.

Journal: :IJLT 2008
Hendrik Drachsler Hans G. K. Hummel Rob Koper

This article argues that there is a need for Personal Recommender Systems (PRSs) in Learning Networks (LNs) in order to provide learners advice on the suitable learning activities to follow. LNs target lifelong learners in any learning situation, at all educational levels and in all national contexts. They are community-driven because every member is able to contribute to the learning material....

2007
Przemyslaw Prusinkiewicz Mark Hammel Jim Hanan

In these notes we survey applications of L-systems to the modeling of plants, with an emphasis on the results obtained since the comprehensive presentation of this area in The Algorithmic Beauty of Plants 61]. The new developments include: a better understanding of theoretical issues pertinent to graphical applications of L-systems, extensions to programming techniques based on L-systems, and a...

2001
Brian Mangum

If L1 and L2 are two Brunnian links with all pairwise linking numbers 0, then we show that L1 and L2 are equivalent if and only if they have homeomorphic complements. In particular, this holds for all Brunnian links with at least three components. If L1 is a Brunnian link with all pairwise linking numbers 0, and the complement of L2 is homeomorphic to the complement of L1, then we show that L2 ...

2006
Takashi Ijiri Shigeru Owada Takeo Igarashi

L-system is a tool commonly used for modeling and simulating the growth of plants. In this paper, we propose a new tree modeling system based on L-system that allows the user to control the overall appearance and the depth of recursion, which represents the level of growth, easily and directly, by drawing a single stroke. We introduce a new module into L-system whose growth direction is determi...

2004
JON McCORMACK Thomas Kuhn J. McCORMACK

This paper describes a generative design system based on timed, parametric Lindenmayer systems (L-systems), developed for the continuous modeling of dynamic phenomena such as morphogenesis. The specification of development functions gives the system the ability to continuously control temporal aspects of development in conjunction with the discrete rewriting for which L-systems are commonly ass...

2006
V. S. Fadin R. Fiore A. Papa

The " non-Abelian " part of the quark contribution to the BFKL kernel in the next-to-leading order (NLO) is found in the coordinate representation by direct transfer of the contribution from the momentum representation where it was calculated before. The results obtained are used for the examination of conformal properties of the NLO BFKL kernel and of the relation between the BFKL and color di...

1997
Charles Radin Lorenzo Sadun

We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and compute it for various examples. We also extend our analysis to more general dynamical systems.

2010
Bianca Truthe

We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when the generative capacity is increased. For incomparable families, we give languages that can be described more efficiently in either of these families than in ...

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

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