University of Technology, Sydney. Faculty of Information Technology. / Over the last few years Peer-to-Peer (P2P) systems have emerged as highly attractive systems supporting many useful large-scale applications and services. They allow the exploitation of enormous untapped resources (such as idle processing cycles, storage, and bandwidth) available at Internet-connected devices, which were previously considered incapable of providing services to others. Participating nodes (peers) form an overlay network and communicate with each other without being controlled by a central authority. The structures and routing decisions of the most current P2P networks often do not correlate with the Internet infrastructure. In doing so, the tasks of overlay construction and routing become less complicated however, this results in high end-to-end delay for the P2P applications. As a consequence, the P2P networks may not be able to provide stringent Quality of Service (QoS) requirements for a new generation of P2P applications, and thus limit their benefits for the end users. Moreover, the infrastructure ignorance means P2P systems waste Internet resources by adding more than they should to the Internet traffic. This leads to the increase in Internet access costs substantially, and in turn the P2P systems do not scale well. The thesis presents a novel architecture for developing efficient P2P systems, and new schemes for constructing infrastructure-aware overlay networks. The main objective is first, to overcome the disparity between the overlay and Internet structures in order to maximize the use of network resources and reduce the overlay delay to the P2P applications; second, to provide efficient communication for P2P systems enabling deployment of any P2P applications while preserving decentralized, self-organizing and self-maintaining characteristics for the systems. To achieve these goals, we firstly developed Geographically Longest Prefix Matching (Geo-LPM) and Geographical Partitioning (Geo-Partitioning) schemes to cluster nodes that are close to each other in terms of network latency and network membership, and to determine links between neighboring clusters respectively. The developed schemes are efficient, generate low overhead, and help to produce excellent physically/infrastructure-aware overlay networks. Their distinctive features are self-organization, self-maintenance, and decentralization, which make them suitable to work in a P2P environment. Secondly we propose a novel architecture, called a physically-aware reference model (PARM) that captures desirable features for P2P systems by resolving major functional P2P system problems efficiently in a layered structure. For example, the application routing layer of PARM deals with routing inefficiency, meanwhile the infrastructure unawareness is resolved at the overlay network layer. We develop a useful P2P application, called a Peer Name Service (PNS) that interprets node names into their current IP addresses for any Internet-connected devices. Using the overlay networks, the PNS can support devices, which could be unreachable via the Domain Name Server (DNS), and mobile devices on-the-move without prior setup requirement in a distributed and timely fashion. Finally, to validate the whole concept of PARM, we simulate the PNS and a file transfer to a mobile node at the top layer of PARM, the P2P application layer. Since the PNS is sensitive to delay, it would be useful to evaluate the impacts of overlay delay factor and PARM on the performance of P2P applications. The simulation results show that the performance of the PARM-based applications is significantly improved while achieving decentralized and self-organizing features. The results also indicate that PARM can be a recommended reference model for developing scalable and efficient P2P systems.

Les usages dans le domaine des systèmes multi-agents ont évolué de manière à intégrer davantage les utilisateurs humains dans les applications. La manipulation d'informations privées par des agents autonomes appelle alors à une protection adaptée des données personnelles. Les présents travaux examinent d'abord le contexte légal de la protection de la vie privée, ainsi que<br />les divers moyens informatiques destinés à la protection des données personnelles. Il en ressort un besoin de solutions fondées sur les méthodes d'IA, autorisant à la fois un raisonnement sur les réglementations et l'adaptation du comportement d'un agent à ces réglementations. Dans cette perspective, nous proposons le modèle d'agent PAw (Privacy-Aware) et la logique DLP (Deontic Logic for Privacy), conçue pour traiter des réglementations provenant d'autorités multiples. Le composant de raisonnement normatif de l'agent analyse son contexte hétérogène et fournit une politique cohérente pour le traitement des données personnelles. L'agent PAw contrôle alors automatiquement sa propre utilisation des données en regard de cette politique. Afin d'appliquer cette politique de manière distante, nous étudions les différentes architectures d'applications distribuées orientées vers la protection de la vie privée, notamment celles fondées sur les principes du Trusted Computing. Nous en proposons une complémentaire, illustrant la possibilité d'utiliser différemment cette technologie. L'implémentation de l'agent PAw permet la démonstration de ses principes sur trois scénarios, montrant ainsi l'adaptabilité de l'agent à son contexte normatif et l'influence des réglementations sur le comportement de l'application.

<p>In this work, an existing generator for layout of Static Random Access Memory (SRAM) is improved. The tool is completed with a block decoder, which was missing when the thesis started. A feature of generating schematic files is also added. The schematics are important to get a better overview, to test parts properly, and enable Layout versus Schematics (LVS) checks.</p><p>The main focus of this thesis work is to implement and evaluate a new SRAM cell, called Zero Aware Asymmetric SRAM cell. This cell saves major power when zeros are stored. Furthermore the pull-up circuit is modified to be less power consuming. Other parts are also modified to fit the new memory cell.</p><p>Several minor flaws are corrected in the layout generator. It does still not produce a complete memory without manual interventions, but it does at least create all parts with one command. Several tests, including Design Rule Checks (DRC) and LVS checks, are carried out both on minor and larger parts. Development of documentation that makes it easier for users and developers to use and understand the tool is initiated.</p>

<p>The purpose of the study is to explore the context, from the users’ perspective, in order to find relevant context parameters that can be useful in the development of the future context-aware technology. The goal is to find some of the context parameters relevant to the situated activity and investigate to what extent and in which way they influence the user in everyday planning activities.</p><p>The method used in the study was based on scenario descriptions. A total of 41 participants reported how they would have acted in the different situations and they also rated how important they believed the different context factors were in the situations. Analyses were made to reveal relationships between context factors and service properties used by the participants in the scenarios.</p><p>In the study several interesting relationships between context factors and the use of services were discovered. The level of urgency was in several situations considered to be important, and it was also found to have an impact on how the participants chose to communicate. The cost was introduced by the participants during the study. It seemed to be important; however, in situations with high urgency it became less important. The study revealed a potential relationship between the risk of disturbing the people in the vicinity and the effort to communicate quietly. Another interesting finding was the relationship between privacy and the choice of modality when communicating: voice-based services were avoided. Further, the importance of privacy and disturbance also appeared to have greater influence in non-anonymous situations than in anonymous.</p> / <p>Syftet med studien är att undersöka kontexten, utifrån användarens perspektiv, för att kunna hitta relevanta kontextfaktorer som kan vara användbara i utvecklingen av kontextmedveten teknologi. Målet är att finna kontextfaktorer som är relevanta för den pågående aktiviteten och undersöka i vilken utsträckning och på vilka sätt dessa faktorer påverkar användaren i de dagliga planeringsaktiviteterna.</p><p>Metoden som användes i studien baserades på scenariobeskrivningar. 41 stycken försöksdeltagare fick beskriva hur de skulle ha handlat i de olika situationerna och de fick också skatta hur viktiga de olika kontextfaktorerena var i situationerna. Analyser genomfördes för att finna samband mellan kontextfaktorer och egenskaper hos de tjänster som försöksdeltagarna använde sig av i scenarierna.</p><p>I studien upptäcktes en rad intressanta relationer mellan kontextfaktorer och användningen av tjänster. Exempelvis ansågs nivån av brådska vara betydelsefull i flera situationer och den verkade också ha inverkan på hur försöksdeltagarna valde att kommunicera. Försöksdeltagarna introducerade under studien kontextfaktorn kostnad. Kostnaden påverkade valet av tjänster men blev mindre betydande i situationer med stor brådska. Studien visade också på potentiella samband mellan risken att störa människor i sin omgivning och viljan att kommunicera tyst. En annan intressant upptäckt var sambandet mellan avskildhet och kommunikationssätt: röstbaserade tjänster undveks när andra människor fanns i närheten. Dessutom verkade det som om det var viktigare att värna om sin avskildhet och att inte störa andra i ickeanonyma situationer än i situationer där man var helt anonym.</p>

A speech controlled animation system is both a useful application program as well as a laboratory in which to investigate context aware applications as well as controlling errors. The user need not have prior knowledge or experience in animation and is yet able to create interesting and meaningful animation naturally and fluently. The system can be used in a number of applications ranging from PowerPoint presentations to simulations to children’s storytelling tools. / Singapore-MIT Alliance (SMA)

Driven by the need for faster devices and higher transistor densities, technology trends have pushed transistor dimensions into the deep sub-micron regime. This continued scaling, however, has led to many challenges facing digital integrated circuits today. One important challenge is the increased variations in the underlying process and environmental parameters, and the significant impact of this variability on circuit timing and leakage power, making it increasingly difficult to design circuits that achieve a required specification. Given these challenges, there is a need for computer-aided design (CAD) techniques that can predict and analyze circuit performance (timing and leakage) accurately and efficiently in the presence of variability. This thesis presents new techniques for variation-aware timing and leakage analysis that address different aspects of the problem. First, on the timing front, a pre-placement statistical static timing analysis technique is presented. This technique can be applied at an early stage of design, when within-die correlations are still unknown. Next, a general parameterized static timing analysis framework is proposed, which supports a general class of nonlinear delay models and handles both random (process) parameters with arbitrary distributions and non-random (environmental) parameters. Following this, a parameterized static timing analysis technique is presented, which can capture circuit delay exactly at any point in the parameter space. This is enabled by identifying all potentially critical paths in the circuit through novel and efficient pruning algorithms that improve on the state of art both in theoretical complexity and runtime. Also on the timing front, a novel distance-based metric for robustness is proposed. This metric can be used to quantify the susceptibility of parameterized timing quantities to failure, thus enabling designers to fix the nodes with smallest robustness values in order to improve the overall design robustness. Finally, on the leakage front, a statistical technique for early-mode and late-mode leakage estimation is presented. The novelty lies in the random gate concept, which allows for efficient and accurate full-chip leakage estimation. In its simplest form, the leakage estimation reduces to finding the area under a scaled version of the within-die channel length auto-correlation function, which can be done in constant time.

As computing becomes ubiquitous and intelligent, it is possible for systems to adapt their behavior based on information sensed from the situational context. However, determining the context space has been taken for granted in most ubiquitous applications, and so that context-adaptive systems often miss the situational factors that are most relevant to users. The mismatch between a system's computational model and users' mental model of the context may frustrate and disorient users. This thesis describes the CCM (cognitive context model)-based approach for eliciting individual cognitive views of a context-aware task and selecting an appropriate context space for context-aware computing. It captures the situational and cognitive context for each task, using a structural architecture in which individual participants use a context view to describe their situational perspective of the task. Clustering and optimization techniques are applied to analyze and integrate context views in CCM. Developers can use the optimization output to identify an appropriate context space, specify context-aware adaptation policies and resolve run-time policy conflicts. This approach simplifies the task of context elicitation, emphasizes individual variance in context-aware activity, and helps avoid user requirements misunderstanding.

Driven by the need for faster devices and higher transistor densities, technology trends have pushed transistor dimensions into the deep sub-micron regime. This continued scaling, however, has led to many challenges facing digital integrated circuits today. One important challenge is the increased variations in the underlying process and environmental parameters, and the significant impact of this variability on circuit timing and leakage power, making it increasingly difficult to design circuits that achieve a required specification. Given these challenges, there is a need for computer-aided design (CAD) techniques that can predict and analyze circuit performance (timing and leakage) accurately and efficiently in the presence of variability. This thesis presents new techniques for variation-aware timing and leakage analysis that address different aspects of the problem. First, on the timing front, a pre-placement statistical static timing analysis technique is presented. This technique can be applied at an early stage of design, when within-die correlations are still unknown. Next, a general parameterized static timing analysis framework is proposed, which supports a general class of nonlinear delay models and handles both random (process) parameters with arbitrary distributions and non-random (environmental) parameters. Following this, a parameterized static timing analysis technique is presented, which can capture circuit delay exactly at any point in the parameter space. This is enabled by identifying all potentially critical paths in the circuit through novel and efficient pruning algorithms that improve on the state of art both in theoretical complexity and runtime. Also on the timing front, a novel distance-based metric for robustness is proposed. This metric can be used to quantify the susceptibility of parameterized timing quantities to failure, thus enabling designers to fix the nodes with smallest robustness values in order to improve the overall design robustness. Finally, on the leakage front, a statistical technique for early-mode and late-mode leakage estimation is presented. The novelty lies in the random gate concept, which allows for efficient and accurate full-chip leakage estimation. In its simplest form, the leakage estimation reduces to finding the area under a scaled version of the within-die channel length auto-correlation function, which can be done in constant time.

As computing becomes ubiquitous and intelligent, it is possible for systems to adapt their behavior based on information sensed from the situational context. However, determining the context space has been taken for granted in most ubiquitous applications, and so that context-adaptive systems often miss the situational factors that are most relevant to users. The mismatch between a system's computational model and users' mental model of the context may frustrate and disorient users. This thesis describes the CCM (cognitive context model)-based approach for eliciting individual cognitive views of a context-aware task and selecting an appropriate context space for context-aware computing. It captures the situational and cognitive context for each task, using a structural architecture in which individual participants use a context view to describe their situational perspective of the task. Clustering and optimization techniques are applied to analyze and integrate context views in CCM. Developers can use the optimization output to identify an appropriate context space, specify context-aware adaptation policies and resolve run-time policy conflicts. This approach simplifies the task of context elicitation, emphasizes individual variance in context-aware activity, and helps avoid user requirements misunderstanding.

No description available.