ppxscal/embedding_network huggingface dataset:
Influence of TiN metal gate on Si/SiO2 surface roughness in N and PMOSFETs
Authors: L. Thevenod, M. Cassé, M. Mouis, G. Reimbold, F. Fillot, B. Guillaumot, F. Boulanger
Venue: Microelectronic Engineering (2005)

In this article, we report the influence of TiN gate on electron and hole channel mobility at low temperatures down to 13K. TiN gate is found to modify the Si/SiO2 surface roughness limited mobility term as compared to Poly-Si gate, leading to a modification of the high field effective mobility behaviour. Interface roughness is shown to be process dependent (CVD vs. MOCVD). An analytical model of surface roughness scattering is used to link our electrical results to morphological roughness parameters.
Providing incentives for cooperation in anonymity systems
Authors: Daniel Ratton Figueiredo
Venue:  (2005)

In an environment where privacy is an increasing concern to users that communicate through a public network, anonymity systems can play a fundamental role in helping safeguard users' identities. The peer-to-peer (P2P) architecture has emerged as a promising paradigm for designing large-scale anonymity systems capable of providing interactive anonymous communication with little infrastructure. In P2P anonymity systems, users that care about privacy collectively provide anonymous communication to one another, by participating in the system and relaying messages before the intended destination is reached. Although such a design certainly has many advantages, there are reasons to doubt its full potential. In particular, the success of P2P systems is highly dependent on the cooperation of the peers using the system. In anonymity systems, peer availability is a fundamentally important aspect of cooperation. If peers fail to be available in the system beyond the time required to satisfy their immediate needs, the service provided by P2P anonymity systems can be jeopardized. In this thesis, we investigate the threat that low peer availability poses to P2P anonymity systems. We model and evaluate an attack on a P2P anonymity system to show that the effort required by the attacker to reveal the identity of a peer is proportional to the average number of peers in the system. We then focus on designing and evaluating explicit incentive mechanisms that can be coupled with existing P2P anonymity systems to promote high peer availability. The key idea in our approach is to attach a financial cost to peers that fail to participate and provide service to others. Under the challenging design constraints imposed by anonymity systems, we propose a payment-based incentive mechanism where peers exchange money in return for relaying services. We also develop a reputation mechanism to ensure that peers also comply with the system protocol. Using a game-theoretic framework, we model and evaluate the effectiveness of the payment mechanism on promoting peer availability. This analysis provides several insights in understanding payment-based incentives. Finally, we investigate the close relationship between P2P systems and the concept of public goods in economics. Classical models from the economics literature are then used to illustrate the impact that selfish peers can have on system capacity.
PEACPocket: a technological demonstrator for future multimedia smart card
Authors: Sylvain Bacquet, Hélène Rouault, Hélène Lhermet, Elisabeth Crochon, Hélène Lignier, Sébastien Martinet, Michel Martin, Laurent Sourgen
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

This presented work has been conducted in a framework of a project with the objective to associate power microsources into smart cards in order to create novel functionalities. To demonstrate the feasibility of such a new powered microsystem, a demonstrator named PEA Card is under development.It is powered by two rechargeable batteries:&bull; A microbattery on chip for security applications.&bull; A Thin Film Power Battery inside the card packaging to recharge the microbattery and to supply user interfaces.An ASIC, used as substrate for the microbattery, manages the energy of the two power sources. It is designed to have a very low consumption. A processor and a display, powered by the embedded Power Battery, allow the user to access data without external source of energy. An RFID antenna permits a contactless charge of the two batteries.
2M: un espace de conception pour i'interaction bi-manuelle
Authors: Gilles Bailly, Laurence Nigay, David Auber
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

In the physical world, most human activities involve the use of two hands. As part of ubiquitous computing that aims at combining the physical and the digital worlds, understanding how to design two-handed interaction is therefore important. This article presents a new design space for two-handed interaction, called 2M. The 2M design space takes its foundations in two complementary research domains: multimodal interaction and two-handed interaction. On the one hand we enrich the multimodal design space to take into account the roles of the two hands. On the other hand, we extend the two-handed interaction design space to cover the temporal as well as fusion aspects of multimodal interaction. This article presents the resulting 2M design space and demonstrates its descriptive power. We finally study the generative capacity of 2M for designing new forms of two-handed interaction in the context of the NavGraphe project that focuses on the interactive manipulation of very large biological structures (e.g., RNA structures).
Understanding how to provide service guarantees in ip-based networks
Authors: Yaqing Huang
Venue:  (2005)

The growth of IP networks has obviously been accompanied by the tremendous growth not only in their sizes and the volume of traffic they carry, but also in the range of requirements they are expected to meet. On one hand, this has brought renewed interest in Quality-of-Service (QoS) solutions, i.e., solutions that enable service differentiations. On the other hand, the ever increasing speed and traffic volume of IP networks, particularly in backbone networks, have made the traditional alternative to QoS, namely overprovisioning, more favorable from a complexity perspective. Understanding how to provide service guarantees in IP networks has been the topic of a long-lasting debate within the networking research community. The goal of this thesis is to provide a better understanding of the roles and potential of both over-provisioning and QoS in such a setting. First, we investigate the extent to which the ever increasing size of IP networks can play a positive role in their ability to absorb traffic variations. We develop a general model that accounts for network topology, base offered traffic, and traffic variations, and allows us to explore how their combination behaves as the network grows. We identify critical thresholds in the relation between network and traffic growth, which delineate regions where a small amount of over-provisioning can provide increasing protection against traffic variations. The results offer insight into how to grow IP networks in order to enhance their robustness. Second, we study the feasibility of providing meaningful service guarantees without introducing too much added complexity. We propose two QoS schemes that can provide iv stronger and more flexible service guarantees. Our first scheme provides differentiated loss guarantees by adding a simple random drop logic on top of the basic FIFO queue. Our second scheme provides more flexible support for real-time applications without hard-limiting their traffic to traffic contracts, and we achieve this goal through a combination of scheduling and buffer management mechanisms. The performances of our schemes are shown to achieve our design goals through simulations or actual implementations.
Evaluation of Mixed-Space Collaboration
Authors: Raphael Grasset, Philip Lamb, Mark Billinghurst
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

Recently Augmented Reality (AR) technology has been used to develop the next generation collaborative interfaces. First results have shown the value of using AR for co-located tasks based on exocentric viewpoints. In contrast, Virtual Reality (VR) seems to offer interesting advantages for immersive collaborative experiences with egocentric viewpoints. In this paper we focus on a new area: a mixed collaboration between AR and VR environments. We present a new conceptual model of transitional interfaces that allow users to move between AR and VR viewpoints. We then describe the results of a quantitative evaluation with an AR exocentric viewpoint and a VR egocentric viewpoint for a navigational task. We also conducted a second experiment on the impact of the relationship between the interaction and visualization space in mixed collaboration. Results of these studies can provide a better understanding of how to design interfaces for multispace and transitional collaboration.
An enterprise architecture framework based on a common information technology domain (EAFIT) for improving interoperability among heterogeneous information systems
Authors: Jin-Woo Kim, Young-Gab Kim, Ju-Hum Kwon, Sung-Ho Hong, Chee-Yang Song, Doo-Kwon Baik
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Recent developments in information systems (ISs) have resulted in a critical need for integration and retention of heterogeneous ISs in various domains, using their commonalities. Stovepipe systems have been developed because of inconsistencies in planning architecture among stakeholders. Several countries are currently adopting enterprise architecture (EA) systems, such as Zachman AF (ZF), C4ISR AF, SBA, and FEAF, in order to solve various IS problems in the field of information technology, but enterprise architecture framework (EAF) legacy systems can be inadequate to solve problems arising from stovepipe systems. An EAF is required to satisfy aspects of both EA and system architecture (SA) inside a common information technology (IT) domain. This paper proposes a new enterprise architecture framework that will resolve the problems inherent in previous frameworks and their features.
Revealing Structure within Clustered Parallel Coordinates Displays
Authors: Jimmy Johansson, Patric Ljung, Mikael Jern, Matthew Cooper
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

In order to gain insight into multivariate data, complex structures must be analysed and understood. Parallel coordinates is an excellent tool for visualizing this type of data but has its limitations. This paper deals with one of its main limitations - how to visualize a large number of data items without hiding the inherent structure they constitute. We solve this problem by constructing clusters and using high-precision textures to represent them. We also use transfer functions that operate on the high-precision textures in order to highlight different aspects of the cluster characteristics. Providing pre-defined transfer functions as well as the support to draw customized transfer functions makes it possible to extract different aspects of the data. We also show how feature animation can be used as guidance when simultaneously analysing several clusters. This technique makes it possible to visually represent statistical information about clusters and thus guides the user, making the analysis process more efficient.
A computer vision system for the detection and classification of vehicles at urban road intersections
Authors: Stefano Messelodi, Maria Modena, Michele Zanin
Venue: Pattern Analysis Applications (2005)

The paper presents a real-time vision system to compute traffic parameters by analyzing monocular image sequences coming from pole-mounted video cameras at urban crossroads. The system uses a combination of segmentation and motion information to localize and track moving objects on the road plane, utilizing a robust background updating, and a feature-based tracking method. It is able to describe the path of each detected vehicle, to estimate its speed and to classify it into seven categories. The classification task relies on a model-based matching technique refined by a feature-based one for distinguishing between classes having similar models, like bicycles and motorcycles. The system is flexible with respect to the intersection geometry and the camera position. Experimental results demonstrate robust, real-time vehicle detection, tracking and classification over several hours of videos taken under different illumination conditions. The system is presently under trial in Trento, a 100,000-people town in northern Italy.
The Method for E-business Exception Handling
Authors: Dovile Vojevodina, Genadijus Kulvietis, Paul Bindokas
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Business success depends on strong relationships with clients. As information technologies keep evolving and people entrust them with more and more every day tasks, e-business is becoming one of the quickest and easiest ways to reach the consumer. As e-business processes are constructed using workflow methods, which usually lack real-world deviation handling capabilities, exception handling is becoming one of the most important aspects of these processes. Of these exceptions, the most dangerous are run-time exceptions and deviations. They are difficult to catch, their impact to the process can be detrimental to achieving the process' goals, and, of course they are annoying to users. The purpose of this paper is to discuss an approach for a universal exception handling mechanism, which would help achieve business process transparency and exception handling flexibility
The SegHidro Experience: Using the Grid to Empower a Hydro-Meteorological Scientific Network
Authors: Eliane Araujo, Walfredo Cirne, Gustavo Wagner, Nigini Oliveira, Enio P. Souza, Carlos O. Galvao, Eduardo Savio Martins
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

This paper describes our experience with SegHidro, a project that empowers hydro-meteorological researchers by (i) enabling collaborative work via the coupling of computer models, and (ii) providing access to massive grid-based computer resources. SegHidro researchers are geographically distributed and have different and sometimes complementary backgrounds. They have in common their interest over the Brazilian Northeast, a semi-arid region, where irregular rainfall distribution causes many problems to the population. SegHidro was created out of the need to help decision makers to better manage water resources. It relies on grid computing as the "glue" that sticks together the community resources: data, computing power and human expertise. Our experience has shown that simplicity is key for the adoption of a solution and its success. Thus SegHidro is built over a simple infrastructure in both computation and data.
Controlled assembly of single SWNTs bundle using dielectrophoresis
Authors: Hee-Won Seo, Chang-Soo Han, Dae-Geun Choi, Keun-Soo Kim, Young-Hee Lee
Venue: Microelectronic Engineering (2005)

We present a mass productive and reproducible assembly technique of a single bundle of single-walled carbon nanotubes (sb-SWNTs) using dielectrophoresis (DEP). Gold electrodes with 10 gaps made via microlithography were used to align the carbon nanotubes (CNTs). The magnitude and type of applied electric field were investigated to verify their effects on CNT assembly. The optimum assembling conditions in which sb-SWNTs could be positioned at a desired site were experimentally identified, and the characteristics of the assembled sb-SWNTs were evaluated from AFM, Raman spectroscopy, and I-V curve. This assembly method has potential for applications, such as gas sensors or electronic devices.
Guided Complete Search for Nurse Rostering Problem
Authors: Spencer K. L. Fung, Ho-fung Leung, Jimmy H. M. Lee
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Nurse rostering problem is one of the most difficult scheduling problems in artificial intelligence and operation research. In general, it consists of cardinality constraints and special pattern constraints that correspond to the given workforce demands, which form a complex problem structure. Many heuristics algorithms have been proposed to solve this particular problem. In this paper, we demonstrate the efficiency of our newly defined GCS/Simplex solver, which incorporates Simplex method into the GCS framework, on some difficult nurse rostering problem instances. Experimental results show that the GCS/Simplex solver is efficient in solving this kind of scheduling problems in terms of both computation time and number of fails.
Bayesian semantics for the semantic web
Authors: Paulo Cesar G. Da Costa
Venue:  (2005)

Uncertainty is ubiquitous. Any representation scheme intended to model real-world actions and processes must be able to cope with the effects of uncertain phenomena. A major shortcoming of existing Semantic Web technologies is their inability to represent and reason about uncertainty in a sound and principled manner. This not only hinders the realization of the original vision for the Semantic Web (Berners-Lee Fischetti, 2000), but also raises an unnecessary barrier to the development of new, powerful features for general knowledge applications. The overall goal of our research is to establish a Bayesian framework for probabilistic ontologies, providing a basis for plausible reasoning services in the Semantic Web. As an initial effort towards this broad objective, this dissertation introduces a probabilistic extension to the Web ontology language OWL, thereby creating a crucial enabling technology for the development of probabilistic ontologies. The extended language, PR-OWL (pronounced as &ldquo;prowl&rdquo;), adds new definitions to current OWL while retaining backward compatibility with its base language. Thus, OWL-built legacy ontologies will be able to interoperate with newly developed probabilistic ontologies. PR-OWL moves beyond deterministic classical logic (Frege, 1879; Peirce, 1885), having its formal semantics based on MEBN probabilistic logic (Laskey, 2005). By providing a means of modeling uncertainty in ontologies, PR-OWL will serve as a supporting tool for many applications that can benefit from probabilistic inference within an ontology language, thus representing an important step toward the World Wide Web Consortium's (W3C) vision for the Semantic Web. In addition, PR-OWL will be suitable for a broad range of applications, which includes improvements to current ontology solutions (i.e. by providing proper support for modeling uncertain phenomena) and much-improved versions of probabilistic expert systems currently in use in a variety of domains (e.g. medical, intelligence, military, etc.).
Universal Data Capture Technology from Semi-structured Form
Authors: Diar Tuganbaev, Aram Pakhchanian, Dmitry Deryagin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper describes a universal technology for automated data capture from documents with similar data but different layouts, such as invoices, claim forms, résumés, contracts, loan documents, etc. Prior to data capture, the relevant data are detected on the document image. A formalization of top-down document analysis is suggested and a language for describing document structures is presented. Formalized descriptions in this language can be compiled into executable code. The process of matching such formalized descriptions with actual semi-structured documents in order to find the relevant data is described.
Evaluation of auditory displays: Comments on Bonebright et al., ICAD 1998
Authors: Terri L. Bonebright, Nadine E. Miner
Venue: ACM Transactions on Applied Perception (TAP) (2005)

This commentary was written for the article &ldquo;Data collection analysis techniques for evaluating the perceptual qualities of auditory stimuli&rdquo; that was presented at the International Conference on Auditory Display in 1998. The original paper was written as a primer for research design and statistical evaluation of perceptual responses to auditory displays as well as a catalyst for the formation of interdisciplinary teams for such research. The authors' commentary notes that the ICAD community has shown an increase in cross-disciplinary collaboration but that researchers need to continue to improve their research designs and their statistical techniques to ensure accurate evaluation of auditory displays.
Bayesian Networks applied to Software IV&V
Authors: Ganesh Pai, Joanne Bechta-Dugan, Khalid Lateef
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

In this paper, we describe how Bayesian networks can be used to merge quantitative and qualitative information to support IV&V of use cases. Essentially, simple metrics from the use cases are computed, which are then input to a Bayesian network. This network models the relationships between the observable parameters of an IV&V process for use cases, and the desired features of the requirements specifications. The output of the network is an assessment of the maturity of the requirements, in terms of the probability that they exhibit the desired properties. We apply our proposed approach to a real system: a software simulator built to test attitude control for an aerospace system, to illustrate how IV&V can be quantitatively supported.
High-Performance Self-Routing Algorithm for Multiprocessor Systems with Shuffle Interconnections
Authors: Chiara Francalanci, Paolo Giacomazzi
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

This paper proposes a routing algorithm for the interconnection of multiple processors based on the shortest-path and deflection-routing principles. The routing algorithm, named SPDRA (Shortest Path and Deflection Routing Algorithm), is applied to multiprocessor systems with a single-stage shuffle physical topology. SPDRA is general-purpose, as opposed to the majority of routing algorithms for multiprocessor systems which are optimized for particular traffic patterns generated by a restricted class of parallel algorithms. The general-purpose nature of SPDRA allows perfomance comparisons with a wide class of routing algorithms for multiprocessor systems that, similar to the single-stage shuffle physical topology, have a fixed node-to-processor ratio. The paper compares SPDRA with hypercube algorithms for bidimensional meshes and torus physical topologies, routing algorithms for hierarchical tridimensional tori, and algorithms for routing permutations in shuffle networks, which constitute the most widely accepted approaches for multiprocessor interconnection. SPDRA exhibits a performance advantage for a broad range of network sizes and, in general, the performance advantage grows as the number of processors increases. However, this paper compares the SPDRA algorithm against a limited set of multiprocessor systems and does not demonstrate a general superiority of SPDRA over all systems with a fixed node-to-processor ratio and, especially, with a growing node-to-processor ratio, such as multistage networks.