ppxscal/embedding_network huggingface dataset:
45nm LSTP FET with FUSI gate on PVD-HfO2 with excellent drivability by advanced PDA treatment
Authors: R. Mitsuhashi, K. Yamamoto, S. Hayashi, A. Rothschild, S. Kubicek, A. Veloso, S. Van Elshocht, M. Jurczak, S. De Gendt, S. Biesemans, M. Niwa
Venue: Microelectronic Engineering (2005)

Reaction behavior between Ni-FUSI gate and PVD-HfO2 gate dielectrics during FUSI formation was examined. A SiN cap between FUSI and HfO2 was found to increase the yield of the transistors, however, The scatter in the electrical properties was attributed to micro holes in the SiN cap that were produced by during the NiSi formation it could not suppress a scatter of the electrical property. The scatter in the electrical properties was attributed to micro holes in the SiN cap that were produced by during the NiSi formation The change of PDA condition from 700C to 1000C could suppress the generations of micro holes within the SiN cap. By these treatments, decent electrical characteristics were obtained, i.e., Ion (n/p) =600/180 uA/um at Ioff =20 pA/um at Vdd=1.1V.
Organic field effect transistor based on a novel soluble pentacene precursor and operating at low voltages
Authors: Damien Zander, Norbert Hoffmann, Kamal Lmimouni, Stephane Lenfant, Christian Petit, Dominique Vuillaume
Venue: Microelectronic Engineering (2005)

We report the characterization of organic field effect transistors fabricated with a novel soluble pentacene precursor. The detail to obtain this novel precursor and the chemical characterization of this precursor are given. The soluble precursor has been deposited on a thin oxide film with lithographically defined electrodes. The determined carrier mobility in organic film is of order of 0.01-0.05 cm2V-1 s-1.
Rolls: modifying a standard system installer to support user-customizable cluster frontend appliances
Authors: G. Bruno, M. J. Katz, F. D. Sacerdoti, P. M. Papadopoulos
Venue: Proceedings of the 2004 IEEE International Conference on Cluster Computing (2004)

The Rocks toolkit uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of deployed clusters, our turnkey systems approach has shown to be quite easily adapted to different hardware and logical node configurations. However, the Rocks architecture and implementation contains a significant asymmetry: the graph definition of all appliance types except the initial frontend can be modified and extended by the end-user before installation. However, frontends can be modified only afterward by hands-on system administration. To address this administrative discontinuity between nodes and frontends, we describe the design and implementation of Rolls. First and foremost, Rolls provide both the architecture and mechanisms that enable the end-user to incrementally and programmatically modify the graph description for all appliance types. New functionality can be added and any Rocks-supplied software component can be overwritten or removed simply by inserting the desired Roll CD(s) at installation time. This symmetric approach to cluster construction has allowed us to shrink the core of the Rocks implementation while increasing flexibility for the end-user. Rolls are optional, automatically configured, cluster-aware software systems. Current add-ons include: scheduling systems (SGE, PBS), grid support (based on NSF Middleware Initiative), database support (DB2), Condor, integrity checking (Tripwire) and the Intel compiler. Community-specific Rolls can be and are developed by groups outside of the Rocks core development group.
An Advanced QoS Protocol for Mass Content
Authors: Thomas Dreibholz, Avril IJsselmuiden, John L. Adams
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

This paper presents a novel network device being located in network edge nodes. It provides a solution for QoS guarantees to certain flows on a congested link by focussing packet discard on selected flows. Unlike IntServ solutions like RSVP, our approach only requires minimal signalling and provides both efficiency and scalability. In this paper, we first describe the ideas of our QoS device and then provide first results from a fast-track simulation model implementing a lightweight version of our approach.
Tactical UGV navigation and logistics planning
Authors: Talib S. Hussain, Daniel Cerys, David Montana, Gordon Vidaver, Jeffrey E. Berliner
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

The Army's push towards developing highly flexible military teams that combine manned and unmanned units requires significant advances in the intelligence of the unmanned units and in the tools used to provide logistical support. BBN Technologies has recently completed a simulation-based project for the Army Research Lab in which we applied an evolutionary computation approach for determining the tactical responses of an unmanned ground vehicle, moderated by explicit rules of engagement. BBN is also currently developing a logistic analysis prototype that uses agent-based technology and evolutionary computation to enable rapid logistics planning and replanning for supporting an Army organization encountering a diversity of planned and unplanned situations.
Efficient solutions to a class of generalized time-dependent combinatorial optimization problems
Authors: Todd W. Kolb
Venue:  (2005)

As a branch of operations research, combinatorial optimization plays important role in obtaining efficient solutions to NP-hard problems common in science, engineering, and management domains. In 2001, Michael L. Gargano and William Edelson described a model of time-dependent combinatorial optimization problems, and outlined several important applications of the model in terms of the genetic algorithm meta-heuristic. The model assumes a set of unit-time tasks to be completed sequentially, a set of workers bidding on completing the tasks with time-dependent costs, and seeks an optimized ordering for completing the tasks with an optimized assignment of the tasks to the workers. The model can be subdivided into sub-models depending on whether a worker can bid on multiple tasks, or whether a worker can be assigned to completing more than one task. In 2002, Joseph DeCicco used genetic algorithm to solve a sub-model of the above problems in which a worker can only bid on one task and be assigned at most one task. In 2003, Rigoberto Diaz established the mathematical model for the same sub-model of problems that Joseph DeCicco worked on, simplified the problems in the sub-model with a novel problem transformation algorithm, and claimed significantly reduced solution costs and algorithm time-complexity with his algorithm based on simulated annealing meta-heuristic. In 2004, Maheswara Kasinadhuni proposed a new genetic algorithm heuristic to solve the same sub-mode of problems with multiple genome coding. This research focuses on the efficient solutions to the most difficult sub-model variant of the time-dependent combinatorial optimization problems in which a worker can bid on multiple tasks but can be assigned at most one task. Since the task assignment for a worker now depends on all previous such assignments, Diaz's problem transformation cannot be applied to simplify the problems. In addition to its own value in solving more difficult real-world problems, this sub-model of problems also provides a platform for more objective comparison of solution quality and time-complexity of different solution approaches. Efficient solution algorithms based on exhaustive search, repeated random solutions, genetic algorithm, and simulated annealing were designed and implemented in Java. Except for the exhaust search algorithm that can find optimal solutions to problem instances of size less than 10, the others are all heuristic algorithms that can provide efficient solutions for problem instances of size larger than 200. Extensive experimental study shows that the simulated annealing algorithm outperforms all of the other approaches in terms of both solution quality and algorithm time-complexity.
Agile Store: Experience with Quorum-Based Data Replication Techniques for Adaptive Byzantine Fault Tolerance
Authors: Lei Kong, Deepak J. Manohar, Mustaque Ahamad, Arun Subbiah, Michael Sun, Douglas M. Blough
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

Quorum protocols offer several benefits when used to maintain replicated data but techniques for reducing overheads associated with them have not been explored in detail. It is desirable that a system be able to adapt its operation so that fault tolerance related overheads are only incurred when the protocol execution actually encounters faults. There are a number of issues that need to be carefully examined to achieve such agility of quorum based systems. We make use of a file system prototype, developed in our Agile Store project, to experimentally evaluate several techniques that are important for efficient implementation of Byzantine fault-tolerant quorum protocols. We present an optimistic quorum collection scheme and a probabilistic hashing scheme for determining the response to a quorum request, and show that they lead to significant performance improvements. The Agile Store also makes use of reconfigurable quorum techniques to allow system size and fault threshold to be dynamically varied when, for example, faulty servers are removed, new servers are added, or the threat level is changed. We quantify the performance gains made possible by such reconfiguration of quorum parameters. We also show how performance scales with different system parameters and how it is affected by design choices such as whether to use proxies. We believe that the results in the paper provide important insights into how to implement quorum protocols to provide good performance while achieving Byzantine fault tolerance.
Secrets to Success and Fatal Flaws: The Design of Large-Display Groupware
Authors: Elaine M. Huang, Elizabeth D. Mynatt, Daniel M. Russell, Alison E. Sue
Venue: IEEE Computer Graphics and Applications (2006)

Large displays are becoming increasingly common technologies in the workplace because of their potential as information and collaboration surfaces. Despite its growing ubiquity, large display groupware often fails to be integrated into workgroup practice, and few systems have seen widespread use.Through their experiences building and evaluating such systems as well as studies of other large display groupware projects in the research community, the authors of this article have discovered patterns in the design and deployment processes. They have gained understanding of how some design decisions yield successful systems while others have detrimental effects on adoption and integration. In this article, they present a survey of many applications in this area of research and assess their use and adoption.They present a framework of design guidelines for these technologies derived from our findings.
A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
Authors: Tzvetan S. Metodi, Darshan D. Thaker, Andrew W. Cross
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Recent experimental advances have demonstrated technologies capable of supporting scalable quantum computation. A critical next step is how to put those technologies together into a scalable, fault-tolerant system that is also feasible. We propose a Quantum Logic Array (QLA) microarchitecture that forms the foundation of such a system. The QLA focuses on the communication resources necessary to efficiently support fault-tolerant computations. We leverage the extensive groundwork in quantum error correction theory and provide analysis that shows that our system is both asymptotically and empirically fault tolerant. Specifically, we use the QLA to implement a hierarchical, array-based design and a logarithmic expense quantum-teleportation communication protocol. Our goal is to overcome the primary scalability challenges of reliability, communication, and quantum resource distribution that plague current proposals for large-scale quantum computing. Our work complements recent work by Balenseifer et al [1], which studies the software tool chain necessary to simplify development of quantum applications; here we focus on modeling a fullscale optimized microarchitecture for scalable computing.
"Ask the Author": An Academic conference supported system using wireless and mobile devices
Authors: Yi-Chan Deng, Han-Zen Chang, Hui-Chun Liao, Mong-Chen Chiang, Ben Chang, Tak-Wai Chan
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

International conference meetings play important role in exchanging researchers' ideas. Further conversations are often triggered by asking questions in conferences. How to use the mobile devices computing power to increase the amount, raising the quality of interactions, and facilitating presenters in collecting audiences' questions in conferences are important. In this paper, a system named "Ask the Author" which is applied in helping audiences ask questions prior conference, during the conference and post conference. An experiment of the system had been studied at the Computer Supported Collaborative Learning (CSCL) 2005 conference held this year and some useful and elaborative observations were discussed.
Computer-integrated needle therapy systems: implementation and analysis
Authors: Russell H. Taylor
Venue:  (2005)

As a class of problems, needle-based therapy applications are conducive targets for Computer-Integrated Surgery (CIS) Systems. While these applications have fairly consistent, simple guidance and manipulation requirements, the imaging, tracking, manipulation and data-processing technologies used to solve these problems can vary widely. This diversity proves to be a challenge. Improving pace and consistency in the development of prototype and full CIS systems would be of significant benefit to the broad community of scientists, engineers and doctors who develop these systems and use them to improve patients' lives. We address these issues by developing a modular framework for the design, implementation and analysis of CIS needle-therapy systems. In this dissertation we first present the underlying theory for this framework. This theoretical foundation provides the ability to both fully specify the geometric reasoning required for these systems and to automate the process of analyzing their resulting geometric accuracy. Building on this foundation, we present a system implementation tool which uses this theory to automate the process of building functional systems capable of collecting, processing, outputting and analyzing the geometric data necessary to implement and predict accuracies for a variety of needle-therapy approaches. We validate this work through the construction and analysis of several functional example systems, in both simulation and actual operation.
A POLICY-DRIVEN AUTONOMOUS SYSTEM TO IMPLEMENT WEB SERVICES
Authors: YANBIN PENG, JI GAO, JUN HU, BEISHUI LIAO
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Information systems researchers continue to develop Web services hoping that, in a near future, these services will be used in every application system expediently. Although many implementations of Web services are currently available, no project can solve the problem of autonomous controlling the whole execution process of Web services. In this paper, we present a policy-driven IMCSBA (Infrastructure for Managing and Controlling the Social Behavior of Agents) project, which provides a platform to autonomous control the whole execution process of Web services. In addition, an agent infrastructure to realize this system was developed and a simulated test was conducted successfully.
Component-Based Methodology for Hardware Design of a Dataflow Processing Network
Authors: Robert Grou-Szabo, Hany Ghattas, Yvon Savaria, Gabriela Nicolescu
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper proposes a new methodology for the design of reusable IP blocks used in data-flow architectures. These IP blocks are elaborated by encapsulating individual operators that constitute part of an algorithm within wrappers that possess a configurable communication layer. These IPs communicate using the VCI protocol, and the interconnections are automatically generated from a Data Flow Graph. The interface wrapper has been designed and simulated in 0.18um CMOS technology. When implemented using 2 10-bit input ports, a 12-bit output port and a FIFO depth of 8, synthesis results show that the circuit has a gate count of 1730 NAND gates with a maximum operating frequency of 400 MHz before placement and routing.
Going 3D: Silicon and D&T
Authors: Rajesh Gupta
Venue: IEEE Design Test (2005)

3D integration techniques, from wafer stacking to transistors along trench walls in 3D circuits, have existed since the 1980s. Recently, however, new products and platformsenabled by substantial increases in processing, communications, and storage--have driven major advances in this area. This issue explores the recent advances in 3D integration and discusses the accompanying challenges. The issue also includes a special section of articles selected from the International Test Conference.
Managing the Execution of Large Scale MPI Applications on Computational Grids
Authors: Aline de P. Nascimento, Alexandre da C. Sena, Jacques A. Da Silva, Daniela Q. C. Vianna, Cristina Boeres, Vinod E. F. Rebello
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Computational grids aim to aggregate significant numbers of resources to provide sufficient, but low cost, computational power to an ever growing variety applications. Writing applications capable of executing efficiently in these grid environments is however extremely difficult for inexperienced users. The grid's geographically distributed resources are typically heterogeneous, non-dedicated, and are offered without any performance or availability guarantees. This work investigates an alternative approach (based on smarter system-aware applications) to solve the problem of developing and managing the execution of grid applications efficiently. Results show that these system-aware MPI applications are indeed faster than their conventional implementations and easily grid enabled.
Query Size Estimation Using Clustering Techniques
Authors: Xiaoyuan Su, Miroslav Kubat, Moiez A. Tapia, Chao Hu
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

For managing the performance of database management systems, we need to be able to estimate the size of queries. Query Size Estimation (QSE) is difficult if the queries are associated with more than one attribute. Here, we propose, and experimentally evaluate, a novel technique that builds on cluster analysis. Empirical results indicate that, in particular, density-based clustering QSE techniques are beneficial for medium and large sized databases where they compare favourably with partitioning clustering QSE ones such as k-means. This is observed especially in the case of noisy and dense datasets.
Ant Colony Search Algorithm for Optimal Strategical Planning of Electrical Distribution Systems Expansion
Authors: M. G. Ippolito, G. Morana, E. Riva Sanseverino, F. Vuinovich
Venue: Applied Intelligence (2005)

Strategical planning is one of many research fields in the design of electrical distribution systems. The problem of strategical planning is a multiobjective combinatorial problem and the search space may often be quite large concerning to the options. The aim is to identify a strategy of expansion of a given distribution system in a given timeframe. For this problem, the search space is created beforehand by running a multiobjective optimisation algorithm for the optimal design of distribution networks for different load levels related to different years. The sets of Pareto-optimal solutions obtained for each load level at each year are equivalent in terms of the considered objectives, these being minimum losses, installation costs, and minimum unavailability. The problem of the identification of the optimal expansion strategy through these chronologically intermediate solutions leading to the final target configuration at the last year has been solved herein using an ACS (Ant Colony Search) algorithm. In order to verify the efficiency of the ACS algorithm, a small size application has been carried out and results have been compared to those obtained with enumeration. Then, a Simulated Annealing (SA) approach was used for a larger size test problem and results were compared to those obtained using the ACS. For this problem, the ACS demonstrated to be more robust than SA with higher quality results.
A new approach to evaluate GP schema in context
Authors: Hammad Majeed
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity.This paper presents a new approach to evaluate GP schema in context. It is simple in its implementation with a potential to address well-known GP problems, such as identification of significant schema, dead code (introns) and module acquisition to name a few.It is based on the principle that the contribution of a schema can be evaluated by neutralizing the effect of the schema in the tree containing it (container-tree) and then checking its effect on the container-tree's fitness. Its usefulness is empirically demonstrated along with its limitation.
Weighted decomposition kernels
Authors: Sauro Menchetti, Fabrizio Costa, Paolo Frasconi
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objects into substructures indexed by a selector. Two substructures are then matched if their selectors satisfy an equality predicate, while the importance of the match is determined by a probability kernel on local distributions fitted on the substructures. Under reasonable assumptions, a WDK can be computed efficiently and can avoid combinatorial explosion of the feature space. We report experimental evidence that the proposed kernel is highly competitive with respect to more complex state-of-the-art methods on a set of problems in bioinformatics.