An open ended list is a well known data structure in Prolog programs. It is frequently used to represent a value changing over time, while this value is referred to from several places in the data structure of the application. A weak point in this technique is that the time complexity is linear in the number of updates to the value represented by the open ended list. In this programming pearl w...

Although list-style open-ended questions generally help us gain deeper insights into respondents’ thoughts, opinions, and behaviors, the quality of responses is often compromised. We tested a dynamic follow-up design to motivate respondents give higher than with static design, but without overburdening them. Our results showed that achieved longer more themes theme areas design. In contrast, pr...

this study was carried out in zarabd, bardsir and sirjan in kerman province in 2002-2003. a number of 58 green-house owners, five wholesaller and 20 retalisaller selected by systemathic sampling method. the results showed that cost marketing service was from 196 to 620 rials and marketing net benefit was 375 rials for cucumber and 230 rials for tomato. retail marketing net benefit was 204 rials...

Background & Aims: Cutaneous leishmaniasis (CL) is a vector – borne disease and at present it is one of the important health problems in tropical and sub - tropical countries including Iran. Due to imposed expenses to the people and government, this study was performed to evaluate the cost – effectiveness of cutaneous leishmaniasis treatment in the years after the earthquake in Bam/Iran. Method...

Of all the issues discussed at Alife VII: Looking Forward, Looking Backward, the issue of whether it was possible to create an artificial life system that exhibits open-ended evolution of novelty is by far the biggest. Of the 14 open problems settled on as a result of debate at the conference, some 6 are directly, or indirectly related to this issue. Most people equate open-ended evolution with...

This chapter introduces the computational infrastructure that is used to bridge the gap between results from sensorimotor processing and language. It consists of a system called Incremental Recruitment Language (IRL) that is able to configure a network of cognitive operations to achieve a particular communicative goal. IRL contains mechanisms for finding such networks, chunking subnetworks for ...

We give a new, simple proof for the sequential access theorem for splay trees. For an n-node splay tree, our bound on the number of rotations is 4:5n, with a smaller constant than the bound of 10:8n concluded by Tarjan. We extend our proof to prove the deque conjecture for output-restricted deques. Our proofs provide additional insights into the workings of splay trees. c © 2004 Elsevier B.V. A...