ppxscal/embedding_network huggingface dataset:
Thyristor Input-Protection Device Suitable for CMOS RF IC's
Authors: Jin-Young Choi, Woo Suk Yang, Dongmin Kim, Youngju Kim
Venue: Analog Integrated Circuits and Signal Processing (2005)

Based on simulation results and accompanying analysis, we suggest a thyristor-type ESD protection device structure suitable for implementation in standard CMOS processes to reduce the parasitic capacitances added to the input nodes, which is very important in CMOS RF IC's. We compare DC breakdown characteristics of the suggested device to those of a conventional NMOS protection device to show the benefits of using the suggested device for ESD protection. The characteristic improvements are demonstrated and the corresponding mechanisms are explained based on simulations. Structure dependencies are also examined to define the optimal structure. AC simulation results are introduced to estimate the magnitude of reduction in the added parasitic capacitance when using the suggested device for ESD protection. The analysis shows a possibility of reducing the added parasitic capacitance down to about 1/45 of that resulting with a conventional NMOS protection transistor, while maintaining robustness against ESD.
A Note on Positive Maps and Classification of States
Authors: Gen Kimura Andrzej Kossakowski
Venue: Open Systems Information Dynamics (2005)

The relation between positive maps on Mn and subsets of self-adjoint elements from Mn ¿ Mn is investigated. It has been shown that there exists the isomorphism between the set of all positive normalized maps on Mn and the subset of separable states on Mn ¿ Mn.
IT-enabled sense-and-respond strategies in complex public organizations
Authors: Rajiv Ramnath, David Landsbergen
Venue: Communications of the ACM (2005)

City governments face difficult challenges in serving their increasingly Net-connected constituencies in an environment of change, uncertain demand, and reduced budgets. These conditions require their IT departments to enable governments to adapt to citizen requests in a sense-and-respond (S-R) manner. In this article, the application of S-R concepts is demonstrated by the approaches used in developing an IT strategic plan for Columbus, Ohio. The fractal-based, request-focused strategy used here creates a unified organizational and IT context for connecting the Department of Technology and city government departments to their customers by utilizing an incremental, lean portfolio-management-based action plan and architecture.
Design and implementation of an enterprise grid
Authors: D. S. Meliksetian, J.-P. Prost, A. S. Bahl, I. Boutboul, D. P. Currier, S. Fibra, J.-Y. Girard, K. M. Kassab, J.-L. Lepesant, C. Malone, P. Manesco
Venue: IBM Systems Journal (2004)

This paper presents the design and implementation of intraGrid, an experimental grid based on the Globus ToolkitTM and deployed on the IBM intranet. The architecture and the main components of intraGrid are described. Then, the major technical challenges and their solutions are reviewed, including software packaging and distribution, the interface for administrative tasks, and the design and implementation of the three major services: information services, management services, and job submission services. The paper also describes the extensions and modifications to intraGrid that were required to create the ISD grid, a grid that is used for joint projects with customers and thus requires access by external users. The paper reviews the use of intraGrid by various teams of IBM researchers to date and outlines the plans for future applications. The work in progress to migrate the intraGrid to an OGSA-based (Open Grid Services Architecture-based) grid is also described.
GE-CMU: description of the TIPSTER/SHOGUN system as used for MUC-4
Authors: Paul Jacobs, George Krupka, Lisa Rau, Todd Kaufmann, Michael Mauldin
Venue: Proceedings of the 4th conference on Message understanding (1992)

The GE-CMU team is developing the TIPSTER/SHOGUN system under the government-sponsored TIPSTER program, which aims to advance coverage, accuracy, and portability in text interpretation. The system will soon be tested on Japanese and English news stories in two new domains. MUC-4 served as the first substantial test of the combined system. Because the SHOGUN system takes advantage of most of the components of the GE NLTOOLSET except for the parser, this paper supplements the NLTOOLSET system description by explaining the relationship between the two systems and comparing their performance on the examples from MUC-4.
Performance analysis of software reliability growth models with testing-effort and change-point
Authors: Chin-Yu Huang
Venue: Journal of Systems and Software (2005)

In this paper, a scheme for constructing software reliability growth model based on Non-Homogeneous Poisson Process is proposed. The main focus is to provide a method for software reliability modeling, which considers both testing-effort and change-point. In the vast literature, most researchers assume a constant detection rate per fault in deriving their software reliability models. They suppose that all faults have equal probability of being detected during the software testing process, and the rate remains constant over the intervals between fault occurrences. In reality, the fault detection rate strongly depends on the skill of test teams, program size, and software testability. Therefore, it may not be smooth and can be changed. On the other hand, sometimes we have to detect more additional faults in order to reach the desired reliability objective during testing. It is advisable for project managers to purchase new automated test tool, technology or additional manpower. These approaches can provide a conspicuous improvement in software testing and productivity. In this case, the fault detection rate will be changed during the software development process. Therefore, here we incorporate both generalized logistic testing-effort function and change-point parameter into software reliability modeling. New theorems are proposed and software testing data collected from real application are utilized to illustrate the proposed model. Experimental results show that the proposed framework to incorporate both testing-effort and change-point for SRGM has a fairly accurate prediction capability.
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Venue: SIGGRAPH/EUROGRAPHICS Conference On Graphics Hardware (2005)

Welcome to Graphics Hardware 2005! It was twenty years ago that this series of events was started with the first Eurographics Workshop on Graphics Hardware, held in Lisbon, Portugal. Since then this event has grown in size and importance. It continues to be a unique forum that attracts academic and industrial research in the area of graphics architectures and hardware-oriented algorithms.Reflecting its growing importance, starting in 1997 Graphics Hardware has been co-located with the Eurographics and SIGGRAPH conferences in alternate years. This is the 5th time the event is been held in conjunction with the annual SIGGRAPH conference. We are grateful to Eurographics and SIGGRAPH for supporting this successful format and for recognizing the synergy between progress in graphics hardware and computer graphics as a whole.These proceedings present the 13 papers that were accepted out of a total of 32 submitted. The papers cover a variety of current issues including novel architectures, hardware-oriented algorithms and innovative applications of GPUs. Each year the quality of papers submissions has improved and the number of submissions has exceeded 30 for several consecutive years.This year we are continuing the popular Hot3D track to allow industry groups to present technical information on their latest chips, technologies, and products. Due to the short turnaround time on Hot3D presentations, the Hot3D presentations are published separately.Obviously, the papers in these proceedings form the core of Graphics Hardware. Without the authors' time and effort this event could not succeed. We also wish to thank the members of the program committee and the reviewers for their thorough, insightful, and timely reviews which ensured an interesting and varied selection of papers.
Using Test-Driven Software Development Tools
Authors: Alex Abacus, Mike Barker, Paul Freedman
Venue: IEEE Software (2005)

Test Driven Development: A Practical Guide by David AstelsAgile & Iterative Development: A Manager's Guide by Craig LarmanSoftware by Numbers: Low-Risk, High-Return Development by Mark Denne and Jane Cleland-Huang
Architecture Rationalization: A Methodology for Architecture Verifiability, Traceability and Completeness
Authors: Antony Tang, Jun Han
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Architecture modeling is practiced extensively in the software industry but there is little attention paid to the traceability, verifiability and completeness of architecture designs. Deficiencies in any of these three areas in an architecture model can be costly and risky to projects. We propose the Architecture Rationalization Method (ARM), which is based on architecture rationale, to overcome these issues. ARM makes use of both qualitative and quantitative rationales for selecting architecture designs. Quantitative rationale uses a model based on costs, benefits and risks in the selection process. ARM provides a method to determine when an architecture model is complete in that the level of details represented by the architecture design is sufficient. We apply ARM to a real-life industry case retrospectively to demonstrate how ARM can overcome issues surrounding traceability and verifiability.
Monitoring and Debugging Parallel Software with BCS-MPI on Large-Scale Clusters
Authors: Juan Fernandez, Fabrizio Petrini, Eitan Frachtenberg
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19 (2005)

Buffered CoScheduled (BCS) MPI is a novel implementation of MPI based on global synchronization of all system activities. BCS-MPI imposes a model where all processes and their communication are tightly scheduled at a very fine granularity. Thus, BCS-MPI provides a system that is much more controllable and deterministic. BCS-MPI leverages this regular behavior to provide a simple yet powerful monitoring and debugging subsystem that streamlines the analysis of parallel software. This subsystem, called Monitoring and Debugging System (MDS), provides exhaustive process and communication scheduling statistics. This paper covers in detail the design and implementation of the MDS subsystem, and demonstrates how the MDS can be used to monitor and debug not only parallel MPI applications but also the BCS-MPI runtime system itself. Additionally, we show that this functionality need not come at a significant performance loss.
A support system for software function discovery using histories of function executions
Authors: Shuuji Morisaki, Yumi Shiraishi, Masatake Yamato, Akito Monden, Ken-ichi Matsumoto, Koji Torii
Venue: Systems and Computers in Japan (2004)

The majority of current application software packages have an extremely large number of functions because of the many different users envisioned for the software. This means that it is not easy for users to find useful functions. In this paper, the authors propose a system that supports the discovery of useful functions for users by allowing for shared referencing of function execution histories among users with similar uses for the software. The proposed system gathers a wide range of function execution histories over a long period of time, efficiently processes them, and then displays in a format that is easy to understand candidate functions that are unknown and useful to the user. The results of evaluation experiments using Microsoft Word 2000 and PowerPoint 2000 showed that an average of 63.7 functions were displayed as useful candidate functions to a total of nine subjects, with an average of 16.1 of them being unknown functions. In addition, the percentage of functions that users said were actually useful among the unknown functions discovered was 39.2&percnt; on average for Word and 46.3&percnt; on average for PowerPoint. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 93&ndash;106, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10024
A Spatial-Based Multi-Resolution Data Dissemination Scheme for Wireless Sensor Networks
Authors: Jian Chen, Yong Guan, Udo Pooch
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

We propose a Spatial-based Multi-resolution Data Dissemination(SMRDD) scheme for data retrieval at multiple levels of detail in wireless sensor networks. In addition to saving energy by avoiding query flooding and extra data transmission for data storage elsewhere, SMRDD achieves further energy efficiency by reducing dissemination of redundant data. In SMRDD, instead of being addressed to nodes, queries are sent to pixel points, a set of carefully selected locations across the sensor field, on the support of a geographic routing protocol. The query finally reaches the home node of the pixel point, the node geographically closest to the pixel point, which reports data to sinks in response. The density of the pixel points corresponds to data resolution level. The higher the density, the higher the data resolution level. The highest density of pixel points is determined by the sensing range of sensors for the application, which allows sensing ranges of home nodes of all pixel points to cover the whole sensor field. Analysis and simulation results show that the performance of our method is much better than early flooding based methods like Directed Diffusion.
A secure and private clarke tax voting protocol without trusted authorities
Authors: Changjie Wang, Ho-fung Leung
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Electronic voting has become one of the most popular activities over the Internet. Security and privacy are always regarded as crucial factors in electronic voting system design. Various secure voting schemes have been proposed in the past several years to ensure the safe operation of electronic voting and most of them have focused on the common "one man, one vote" plurality voting. In this paper, we study on the security and privacy issues in the Clarke tax voting protocol, another important social choice protocol. This protocol is important in electronic voting, especially software agent based voting, because a voter's dominant strategy is truth-telling, and consequently the overhead for counterspeculation is minimized. For the very same reason, it is essential to achieve the security and the privacy protection of voters so that voters' preferences need not be made known to the public, should this protocol be practical and popular. In this paper, we first present several cryptographic building blocks, including ElGamal cryptosystem, player-resolved distributed ElGamal decryption, proof of knowledge of 1-of-k plaintext and player-resolved mix network. Then we propose a secure Clarke tax voting protocol making use of these techniques. In the proposed protocol, we achieve privacy protection, universal verifiability as well as other security requirements, such as secrecy, eligibility, completeness, etc. One important feature of the proposed protocol is that the full privacy protection of voters is guaranteed, which means that all information in voting are kept secret even in the presence of any collusion of participants involved in the voting. The only information known publicly is the final voting result, i.e., the winning candidate and the tax for each voter.
Reconfigurable, Data-Driven Resource Allocation in Complex Systems: Practice and Theoretical Foundations
Authors: Evgenia Smirni
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

We focus on the development of a data-driven performance engineering framework to automate the process of robust, workload-aware resource allocation and management in today's complex Internet servers. Our focus is on the development of better understanding of the workload resource demands and on the development and implementation of efficient methodologies for bottleneck identification and resource allocation at the system level. Here, we give an overview of a testbed for conducting a detailed workload characterization in multi-tiered web servers that serve dynamic pages. We present some preliminary workload characterization results that can help in identifying different resource bottlenecks and the workload conditions under which these bottlenecks are triggered. We also present preliminary results on new analytic models that one can use to model multi-tiered systems.
Modeling and Taming Parallel TCP on the Wide Area Network
Authors: Dong Lu, Yi Qiao, Peter A. Dinda, Fabian E. Bustamante
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Parallel TCP flows are broadly used in the high performance distributed computing community to enhance network throughput, particularly for large data transfers. Previous research has studied the mechanism by which parallel TCP improves aggregate throughput, but there doesn't exist any practical mechanism to predict its throughput and its impact on the background traffic. In this work, we address how to predict parallel TCP throughput as a function of the number of flows, as well as how to predict the corresponding impact on cross traffic. To the best of our knowledge, we are the first to answer the following question on behalf of a user: what number of parallel flows will give the highest throughput with less than a p% impact on cross traffic? We term this the maximum nondisruptive throughput.We begin by studying the behavior of parallel TCP in simulation to help derive a model for predicting parallel TCP throughput and its impact on cross traffic. Combining this model with some previous findings we derive a simple, yet effective, online advisor. We evaluate our advisor through extensive simulations and wide-area experimentation.
Architecture optimization for multimedia application exploiting data and thread-level parallelism
Authors: Claude Limousin, Julien Sebot, Alexis Vartanian, Nathalie Drach
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

The characteristics of multimedia applications when executed oil general-purpose processors are not well understood. Such knowledge is extremely important in guiding the development of multimedia applications and the design of future processors.In this paper, we characterize and optimize the performance of multimedia applications on superscalar processor exploiting data-level parallelism and thread-level parallelism with SIMD (Single Instruction Multiple Data) and SMT (Simultaneous MultiThreading) capacities. We show that SMT and SIMD superscalar processor is suitable for 3D geometry application and we characterize the execution in term of memory hierarchy, which is the main bottleneck. The results show that the latency is not fully recovered by SMT; the use of second-level data prefetching does not succeed in increasing the performance.With detailed analysis, we show that this problem comes from a pollution of the instruction window by the threads experiencing second-level cache misses, thus reducing the window available for the other threads. We thus propose a hardware mechanism (an architecture optimization) to predict second-level misses and control this pollution.
On the least values of Lp-norms for the Kontorovich-Lebedev transform and its convolution
Authors: Semyon B. Yakubovich
Venue: Journal of Approximation Theory (2004)

We establish analogs of the Hausdorff-Young and Riesz-Kolmogorov inequalities and the norm estimates for the Kontorovich-Lebedev transformation and the corresponding convolution. These classical inequalities are related to the norms of the Fourier convolution and the Hilbert transform in Lp spaces, 1 ≤ p ≤ ∞. Boundedness properties of the Kontorovich-Lebedev transform and its convolution operator are investigated. In certain cases the least values of the norm constants are evaluated. Finally, it is conjectured that the norm of the Kontorovich-Lebedev operator Ki τ : Lp (R+;xdx) → Lp(R+;x sinh πx dx), 2 ≤ p ≤ ∞ Kiτ[f] = ∫0∞ Kiτ(x)f(x)dx, τ ∈ R+ is equal to π/21-1/p. It confirms, for instance, by the known Plancherel-type theorem for this transform when p = 2.
Power and Performance in I/O for Scientific Applications
Authors: K. Coloma, A. Choudhary, A. Ching, W. K. Liao, S. W. Son, M. Kandemir, L. Ward
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

The I/O patterns of large scale scientific applications can often be characterized as small, non-contiguous, and regular. From a performance and power perspective, this is perhaps the worse kind of I/O for a disk. Two approaches to mitigating the mechanical limitations of disks are write-back caches and software-directed power management. Previous distributed caches are plagued by synchronization and scalability issues. The Direct Access Cache: DAChe system is a user-level distributed cached that addresses both these problems. Past work on managing disk power during run time were effective, one should be able to improve on those results by adopting a proactive scheme.
A fourth-order Magnus scheme for Helmholtz equation
Authors: Ya Yan Lu
Venue: Journal of Computational and Applied Mathematics (2005)

For wave propagation in a slowly varying waveguide, it is necessary to solve the Helmholtz equation in a domain that is much larger than the typical wavelength. Standard finite difference and finite element methods must resolve the small oscillatory behavior of the wave field and are prohibitively expensive for practical applications. A popular method is to approximate the waveguide by segments that are uniform in the propagation direction and use separation of variables in each segment. For a slowly varying waveguide, it is possible that the length of such a segment is much larger than the typical wavelength. To reduce memory requirements, it is advantageous to reformulate the boundary value problem of the Helmholtz equation as an initial value problem using a pair of operators. Such an operator-marching scheme can also be solved with the piecewise uniform approximation of the waveguide. This is related to the second-order midpoint exponential method for a system of linear ODEs. In this paper, we develop a fourth-order operator-marching scheme for the Helmholtz equation using a fourth-order Magnus method.
Positive and negative learning by IT professionals
Authors: Lucy Costigan, Micheál Ó hÉigeartaigh
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper summarises the main findings of a preliminary study of issues relating to the personal and professional development of IT professionals in Silicon Valley and in Dublin. It uses the concept of positive and negative learning to identify the amount to which they have enhanced or diminished their knowledge and skill base in IT topics since graduating from university. It identifies emerging topics in the area and analyses how professionals undergo re-skilling, in the context of life long learning.
The Topological Representation of Oriented Matroids
Authors: J&#x00fc;rgen Bokowski, Simon King, Susanne Mock, Ileana Streinu
Venue: Discrete Computational Geometry (2005)

We present a new proof of the Topological Representation Theorem for oriented matroids in the general rank case. Our proof is based on an earlier rank 3 version. It uses hyperline sequences and the generalized Schonflies theorem. As an application, we show that one can read off oriented matroids from arrangements of embedded spheres of codimension one, even if wild spheres are involved.