MIT Scheme is an implementation of the Scheme programming language that runs on many popular workstations. The MIT Scheme Reference Manual describes the special forms, procedures, and datatypes provided by the implementation for use by application programmers.

No description available.

Thesis (B.A. (Hons)) -- University of Adelaide, Dept. of History, 1970.

An implementation of the programming language Logo is described. Logo, a programming language somewhat like Lisp, is intended to teach the naive user the elements of programming and problem-solving, especially in symbolic programming applications such as graphics, natural language processing, musical composition, and the solution of elementary artificial intelligence problems. The system described here, BCLogo, is an attempt to build a portable implementation which would net be particularly sensitive to the computer on which it was run. The thesis describes both the manner in which the system appears to the user and the way in which the system was built. / Science, Faculty of / Computer Science, Department of / Graduate

This thesis is about designing a museum in Jordan. The building is to be a place of time, light and space. Its primary purpose is to introduce the people to the capital of Jordan, Amman . This study will offer a conceptual approach, concentrating on composition, visual concepts, and influences that have shaped it over the past year. My intention here is to present the visual aspect of exteriors and interiors. The design would be based on my awareness and acceptance of modern western aesthethic values and technology as part of an international culture and global economic systems. / Master of Architecture

Thesis (M. Sc.)--University of Hong Kong, 1999. / Includes bibliographical references (leaves 61-66).

Reputation systems have the potential of improving the quality of on-line markets by identifying fraudulent users and subsequently dealing with these users can be prevented. The behaviour of participants involved in e-commerce can be recorded and then this information made available to potential transaction partners to make decisions to choose a suitable counterpart. Unfortunately current reputation systems suffer from various vulnerabilities. Solutions for many of these problems will be discussed. One of the major threats is that of unfair feedback. A large number of negative or positive feedbacks could be submitted to a particular user with the aim to either downgrade or upgrade the user's reputation. As a result the produced reputation does not reflect the user's true trustworthiness. To overcome this threat a variation of Bayesian Reputation system is proposed. The proposed scheme is based on the subjective logic framework proposed Josang et al. [65]. The impact of unfair feedback is countered through some systematic approaches proposed in the scheme. Lack of anonymity for participants leads to reluctance to provide negative feedback. A novel solution for anonymity of feedback providers is proposed to allow participants to provide negative feedback when appropriate without fear of retaliation. The solution is based on several primitive cryptographic mechanisms; e-cash, designated verifier proof and knowledge proof. In some settings it is desirable for the reputation owner to control the distribution of its own reputation and to disclose this at its discretion to the intended parties. To realize this, a solution based on a certificate mechanism is proposed. This solution allows the reputation owner to keep the certificate and to distribute its reputation while not being able to alter that information without detection. The proposed solutions cater for two modes of reputation systems: centralised and decentralised. The provision of an off-line reputation system is discussed by proposing a new solution using certificates. This is achieved through the delegation concept and a variant of digital signature schemes known as proxy signatures. The thesis presents a security architecture of reputation systems which consists of different elements to safeguard reputation systems from malicious activities. Elements incorporated into this architecture include privacy, verifiability and availability. The architecture also introduces Bayesian approach to counter security threat posed by reputation systems. This means the proposed security architecture in the thesis is a combination of two prominent approaches, namely, Bayesian and cryptographic, to provide security for reputation systems. The proposed security architecture can be used as a basic framework for further development in identifying and incorporating required elements so that a total security solution for reputation systems can be achieved.

In XML databases, the indexing process is based on a labelling or numbering scheme and generally used to label an XML document to perform an XML query using the path node information. Moreover, a labelling scheme helps to capture the structural relationships during the processing of queries without the need to access the physical document. Two of the main problems for labelling XML schemes are duplicated labels and the cost efficiency of labelling time and size. This research presents a novel dynamic XML labelling scheme, called the Pentagonal labelling scheme, in which data are represented as ordered XML nodes with relationships between them. The update of these nodes from large scale XML documents has been widely investigated and represents a challenging research problem as it means relabelling a whole tree. Our algorithms provide an efficient dynamic XML labelling scheme that supports data updates without duplicating labels or relabelling old nodes. Our work evaluates the labelling process in terms of size and time, and evaluates the labelling scheme’s ability to handle several insertions in XML documents. The findings indicate that the Pentagonal scheme shows a better initial labelling time performance than the compared schemes, particularly when using large XML datasets. Moreover, it efficiently supports random skewed updates, has fast calculations and uncomplicated implementations so efficiently handles updates. Also, it proved its capability in terms of the query performance and in determining the relationships. / Libyan government

We exhibit programs that illustrate the power of Lisp as a language for expressing the design and organization of computational systems. The examples are chosen to highlight the importance of abstraction in program design and to draw attention to the use of procedures to express abstractions.

Mobile WiMAX multicast communication that is an efficient mechanism for one-to-many transmissions over a broadcast wireless channel is considered as a key technology for supporting emerging broadband multimedia services in the next generation wireless networks, such as Internet Protocol Television (IPTV). Therefore, it is critical to design an efficient multicast resource allocation scheme to support these multimedia services. This thesis proposes a new Band AMC multicast resource allocation scheme for pedestrian mobility environment by collaborating with forward error correction (FEC) coding technology. IPTV multicast is characterized by groups of users watching popular video programs over a wireless fading channel. The proposed scheme can flexibly select efficient channels and appropriate modulation to reduce the resource usage for multicast. Besides, the proposed scheme can provide quality of service (QoS), overcome packet loss and improve the performance over the traditional multicast techniques on Band AMC mode used in today¡¦s wireless OFDMA communication system.