ppxscal/embedding_network huggingface dataset:
Mixed 2-4 state simulation with VCS
Authors: H. K. Chaudhry, P. Eichenberger, D. R. Chowdhury
Venue: Proceedings of the 1997 IEEE International Verilog HDL Conference (IVC '97) (1997)

To meet the demand for higher performance, today's logic simulators are supporting 2 state simulation. Within Chronologic Simulation's VCS simulation system, we have implemented an elaborate infrastructure to support mixed 2-4 state simulation in Verilog. The paper presents our approach to allow mixed 2-4 state simulation while retaining compliance to Verilog HDL language and its simulation semantics. The key issues that need consideration for mixed 2-4 state simulation are discussed in detail. The results obtained by running VCS regression test suite and OVI regression test suite are summarized.
Ready, Set, Go: Structural Operational Semantics for Linear-Time Process Algebras
Authors: Bard Bloom
Venue:  (1993)

We investigate the relationship between operational semantics, equational semantics, and ready equivalence (a well-known relative of failure equivalence and testing equivalence) in process algebra. We give a class of structural operational semantic rules, called winterized rules, which define operations respecting ready equivalence. The class of winterized rules is surprisingly broad; it includes some copying operations which would seem to violate ready equivalence. Membership in this class is decidable in $O(n^{2})$ time. We show that for any process algebra defined by such rules has complete equational axiom system. These methods winterizability in particular apply mutatis mutandis to other linear-time process equivalences.
MCAD/MCSD Self-Paced Training Kit: Developing web Applications with Microsoft Visual Basic .NET and Microsoft Visual Basic .NET and Microsoft Visual C# .NET, 2 edition
Authors: Jeff Webb
Venue:  (2003)

Get self-paced, from-the-source exam preparation and self-assessment for the skills measured by MCP Exams 70-305 and 70-315-core requirements for MCAD and MCSD certification. Features an enhanced testing tool and more labs and code examples.
DPSK performance of a coded SSMA system with microdiversity in a Nakagami fading environment
Authors: P. Van Rooyen
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

This work considers the performance of direct sequence spread spectrum multiple access (DS/SSMA) transmission with MRC diversity for cellular indoor wireless communication (IWC) channels, although it is not entirely restricted to the IWC channel. The indoor communication channel, which is multipath faded, is modelled by a discrete set of Nakagami faded paths. The Nakagami fading distribution has been shown to fit empirical results more generally than other distributions. New analytical results to evaluate the probability of error for the receiver terminals studied in this work are presented. Numerical results reveal that for nondiversity receivers, Nakagami fading is very hostile to the SSMA signal. However, with the use of MRC diversity, interleaving and convolutional coding, the average error rate can be reduced dramatically, allowing for reliable communication.
Improved Computer Detection and Mapping of Cerebral Oxygenation
Authors: David H. Kung
Venue:  (1999)

Near-infrared (NIR) optical image reconstruction that incorporates blood oxygen level dependant (BOLD) magnetic resonance imaging has the potential to improve both quantifiable measurement of oxygenation and the spatial resolution involved in such mapping. My thesis continues some preliminary work in this area through development of an analytic diffusion parameter estimation algorithm for use with a NIR imaging array and development of a finite element mesh utility to read a priori BOLD images and tag them with property elements for NIR image resolution improvement.
On-Line File Caching
Authors: Neal E. Young
Venue:  (1997)

Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of total size at most some specified k so as to minimize the total retrieval cost. Specifically, when a requested file is not in the cache, bring it into the cache, pay the retrieval cost, and choose files to remove from the cache so that the total size of files in the cache is at most k. This problem generalizes previous paging and caching problems by allowing objects of arbitrary size and cost, both important attributes when caching files for world-wide-web browsers, servers, and proxies. We give a simple deterministic on-line algorithm that generalizes many well-known paging and weighted-caching strategies, including least-recently-used, first-in-first-out, flush-when-full, and the balance algorithm. On any request sequence, the total cost incurred by the algorithm is at most k/(k-h+1) times the minimum possible using a cache of size h >= k. For any algorithm satisfying the latter bound, we show it is also the case that for most choices of k, the retrieval cost is either insignificant or the competitive ratio is constant. This helps explain why competitive ratios of many on-line paging algorithms have been typically observed to be constant in practice.
Soda: A File System for a Multicomputer
Authors: Bruce Janson, Bob Kummerfeld
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

We describe Soda: a new distributed file system for a loosely coupled group of computers (a multicomputer). Soda presents a consistent file system image to a number of CPU server clients. It also keeps track of changes made to system files and thereby simplifies operating system upgrades and problem diagnosis. It provides some support for process migration. It also provides convenient run-time access to file system status and control.
An Adaptive Communication System for Heterogeneous Network Computing
Authors: IIkeyun Ra, Salim Hariri, Cauligi Raghavendra
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

In this paper, we present an architecture of an AdaptiveCommunication System (ACS) that provides applicationswith programmable communication, control, andmanagement services that can be adopted dynamicallyto maximize application performance at runtime. ACSsupports adaptive and scalable communication servicesthat select the appropriate multicast/broadcast algorithmsfor a given class of applications. These algorithms takeinto consideration both the application requirements andthe load of computing and communication systems.We overview the ACS architecture and then describe ourapproach to implement the ACS group communication services.We introduce two procedures (Resource Aware procedureand Application Aware procedure) to build the appropriatemulticast tree that takes into consideration both thecharacteristics and load conditions of machines as well asthe group communication patterns of a given application.We develop analytical techniques and new metric measuresto characterize and quantify the performance of a multicasttree. We also present our preliminary performance resultsthat show significant performance gain can be achievedfrom using ACS multicast algorithms.
Optimal shielding/spacing metrics for low power design
Authors: Ravishankar Arunachalam, Emrah Acar, Sani R. Nassif
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Noise arising from line-to-line coupling is a major problem fordeep submicron design, and present technology trends are causing an increase in this type of noise. Common current methods todecrease coupling noise include shielding and buffering, both ofwhich can increase overall power dissipation. An alternativemethod is spacing, which has the added benefit of improving themanufacturability (i.e.defect insensitivity) of the design. Thispaper explores the issue of coupling noise reduction, and proposes performance metrics that can be used by the designer todetermine which of the alternative methods is best suited for aspecific interconnect configuration.
Software Quality Maintenance Model
Authors: Norman F. Schneidewind
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

We develop a quality control and prediction model for improving the quality of software delivered by development to maintenance. This model identifies modules that require priority attention during development and maintenance. The model also predicts during development the quality that will be delivered to maintenance. We show that it is important to perform a marginal analysis when making a decision about how many metrics to include in a discriminant function. If many metrics are added at once, the contribution of individual metrics is obscured. Also, the marginal analysis provides an effective rule for deciding when to stop adding metrics. We also show that certain metrics are dominant in their effects on classifying quality and that additional metrics are not needed to increase the accuracy of classification. Data from the Space Shuttle flight software are used to illustrate the model process.
Finite element modelling and analysis of bolted joints of three dimensional tubular structures
Authors: L. G. Vigh, L. Dunai
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

A Hungarian "Steel Cooling Tower Consortium" aimed to develop a new type steel cooling tower, in the framework of a governmental R&D project. Members of the structure are prefabricated tubular elements characterized by high radius-to-thickness ratio. The non-planar jointing and the in-situ connection types that are developed in order to achieve easy and fast erection result in extremely complex joints. These factors require the advanced finite element analyses of the members and the whole joint.This paper focuses on the numerical modelling of the joint, proceeding to preliminary studies on problematic details. Stability analysis to find out whether elastic instability phenomena occur is also discussed. Virtual experiments are executed to draw general idea about the elastic load-transfer feature as well as the ultimate behaviour of the joint. On these bases, the failure modes are determined and characterised, and the design procedure is improved.
Pursuit: Visual Programming in a Visual Domain
Authors: Francesmary Modugno, Brad A. Myers
Venue:  (1994)

We present a new visual programming language and environment that serves as a form of feedback and representation in a Programming by Demonstration system. The language differs from existing visual languages because it explicitly represents data objects and implicitly represents operations by changes in data objects. The system was designed to provide non-programmers with programming support for common, repetitive tasks and incorporates some principles of cognition to assist these users in learning to use it. With this in mind, we analyze the language and its editor along cognitive dimensions. The assessment provides insight into both strengths and weaknesses of the system, suggesting a number of design changes.
A Geometric Model of Information Retrieval Systems
Authors: Kim Myung Ho
Venue:  (1999)

This decade has seen a great deal of progress in the development of information retrieval systems. Unfortunately, we still lack a systematic understanding of the behavior of the systems and their relationship with documents. In this paper we present a completely new approach towards the understanding of the information retrieval systems. Recently, it has been observed that retrieval systems in TREC 6 show some remarkable patterns in retrieving relevant documents. Based on the TREC 6 observations, we introduce a geometric linear model of information retrieval systems. We then apply the model to predict the number of relevant documents by the retrieval systems. The model is also scalable to a much larger data set. Although the model is developed based on the TREC 6 routing test data, I believe it can be readily applicable to other information retrieval systems. In Appendix, we explained a simple and efficient way of making a better system from the existing systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Addressing the systems-in-silicon verification challenge: a new approach to logic verification
Authors: S. Caplow, M. Sottak, D. Kelf
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

The purpose of the paper is to highlight emerging electronic design requirements, and their effect an simulation, and then to describe a new simulation architecture which meets many of the needs discussed. The paper examines the effect of new capabilities offered by silicon vendors on modern IC designs, and then breaks down this effect into design challenges. These challenges are then equated with requirements for HDL simulation. A new simulation architecture is then described which provides the answer to many of the suggested simulation issues.
Quantitative Evaluation and Operative Usage of Interactive Systems
Authors: A. Pasquini, A. Rizzo, L. Save, M. Sujan
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Probabilistic Safety Assessment of computer based systems, and, more generally, all the quantitative evaluations of system dependability, require an estimate of the possible operative usage of the system under evaluation.The complexity of the real operative usage ofcomputer based systems necessitates several approximations and assumptions during the estimation.These can be particularly significant for systems having a large number of interactions with human agents, such as process control and decision support systems.This paper reports the example of a computer based system supporting train drivers in respecting line signals and speed restrictions.The originally conducted safety assessment missed to consider a possible operative usage of this system, which was adopted by the train drivers.The system failed in preventing the passage of red signals by train drivers several times, and one of the resulting incidents is analysed in the paper to show the difference between the estimated and the real operative usage.The paper concludes by emphasising the hidden dangers of quantification in safety assessment, especially when based on assumptions concerning the possible behaviour of the human agents interacting with the computerised part of the system under evaluation.
Single and Multi-Carrier CDMA: Multi-User Detection, Space-Time Spreading, Synchronisation and Standards
Authors: Lajos Hanzo, L-L Yang, E-L Kuan, Kai Yen
Venue:  (2003)

:This volume is dedicated to a range of CDMA and MC-CDMA transmission aspects of systems designed for communicating over fading wireless channels.Currently, a technical in-depth book on this subject, which has a similar detailed exposure of the recent advances in CDMA, M-ary CDMA and MC-CDMA, is unavailable. A further attraction of the joint treatment of these topics is that it allows the reader to view their design trade-offs in a comparative context.Divided into five main parts:Part I  provides a detailed introduction to the subject of CDMA systems designed for employment in various applicationPart II  deals with the currently hot topic of genetic algorithm assisted multiuser detectionPart III  gives a detailed account of new, reduced-complexity M-ary CDMA schemesPart IV  considers a range of novel MC-CDMA schemes which have the potential of supporting numerous design objectivesPart V  provides an overview of the 3G wireless system proposals and characterises the expected network capacity gains attained with the aid of adaptive CDMA systemsBy providing an all-encompassing self-contained treatment this groundbreaking volume will have appeal to researchers, postgraduate students, academics practising research and development engineers working for wireless communications and computer networking companies, as well as senior undergraduate students and technical managers in the field.
A parametric study of steel and composite semi-rigid portal frames
Authors: O. Brito,  Jr., S. A. L. de Andrade, P. C. G. da S. Vellasco, J. G. S. da Silva, L. R. O. de Lima
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents a semi-rigid low-rise portal frame parametric analysis. The analysis considered parameters like: connection stiffness and strength, structural system (steel or composite) and lateral frame stability. The parametric analysis, based on the Eurocode 3, lead to the development of a simple design model implemented on the ANSYS finite element program. The model has taken into account geometrical and material non-linearities and the connection semirigid behaviour. The investigation results are presented and discussed in order to access economic potential and efficiency of the semi-rigid solutions.
Deformation of plane curves preserving Pythagorean hodographs
Authors: K. Ueda
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

Parametric plane curves are expressed as complex valued functions of a real parameter. The method is convenient for investigating Pythagorean-hodograph curves. A complex function transforms one curve to another curve in the complex plane. There are complex functions which preserve the Pythagorean hodographs of the curves. These functions can be used in deforming Pythagorean-hodograph curves. In particular, the Mobius transformation is useful in controlling the deformation.
SRM-TFRC: A TCP-Friendly Multicast Congestion Control Scheme Based on SRM
Authors: Wenjun Wu, Ying Xu, Jian Lu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

We present SRM-TFRC, a SRM based congestion control scheme for reliable multicast. Based on the feedback mechanism of SRM, it achieves the goal of TCP friendliness using rate-based regulation and taking the approach of TFRC's idea. We propose the strategy ofweighted average to solve the issue of Drop-to-Zero, in which Worst Receiver Set is created to keep track of current worst receivers and the sender's rate is determined by the weighted average of the feedback value of these receivers. SRM-TFRC is implemented on the NS network simulator and the paper presents the simulation results on its performance.
Design of SMIL Browser Functionality in Mobile Terminals
Authors: Satoshi Hieda, Yoshinori Saida, Hiroshi Chishima, Naoki Sato, Yukikazu Nakamoto
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

SMIL is a markup language which enables us to describe multimedia contents. This paper proposes a design model of SMIL browser functionality for mobile terminals whose resources are limited. We introduce SMIL Component, which is based on attachable software architecture to a pre-installed generic web browser. This leads to reduce memory size that SMIL Component consumes and bring high adaptability of SMIL Component for various web browsers. We implement SMIL Component and evaluate RAM sizes and presentation delays. As a result, we found out that SMIL Component can be useful for MMS presentations on mobile terminals.
Microsoft Office 2003 Step by Step
Venue:  (2003)

Teach yourself how to create great documents using Microsoft Word 2003-one step at a time! Learn exactly the skills you need at your own pace through easy-to-follow lessons and hands-on practice files on CD. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Effects of Non-Gaussian Noise and Different Boundary Rules on Two-Dimensional Linearand Nonlinear Smoothers
Authors: Markus Emsermann, Karen Kafadar
Venue:  (1997)

Most two-dimensional smoothers are linear, such as kernel or locally weighted regression, sometimes constructed adaptively depending upon the apparent behavior of the function and the density of data points in local neighborhoods. Nonlinear smoothers are also contenders but have been applied mush less often since, unlike linear smoothers, analytical expressions for bias and variance are not easily derived, so they cannot be compared theoretically with linear smoothers. In this study we compare a linear smoother with a nonlinear smoother, via mean absolute error, on simulated data of a known function subject to one of three noise distributions and using one of three different types of boundary rules. The nonlinear smoother performs extremely well, not only in the interior but also having lower mean squared error at the boundary. We illustrate these smooothers using cancer mortality rates in U.S. counties.
Flow Graph Balancing for Minimizing the Required Memory Bandwidth
Authors: Sven Wuytack, Francky Catthoor, Gjalt de Jong, Bill Lin, Hugo de Man
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

In this paper we present the problem of flow graph balancing for minimizing the required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cycle budget by adding ordering constraints to the flow graph. This allows the subsequent memory allocation and assignment tasks to come up with a cheaper memory architecture with less memories and memory ports. The effect of flow graph balancing is shown on an example. We show that it is important to take into account which data is being accessed in parallel, instead of only considering the number of simultaneous memory accesses. This leads to the optimization of a conflict graph.
Parameterized complexity: the main ideas and connections to practical computing
Authors: Michael R. Fellows
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

The purposes of this paper are two: (1) to give an exposition of the main ideas of parameterized complexity, and (2) to discuss the connections of parameterized complexity to the systematic design of heuristics and approximation algorithms.
Multiple Foci Drill-Down through Tuple and Attribute Aggregation Polyarchies in Tabular Data
Authors: Nathan Conklin, Sandeep Prabhakar, Chris North
Venue: Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02) (2002)

Information analysis often involves decomposing data into sub-groups to allow for comparison and identification of relationships. Breakdown Visualization provides a mechanism to support this analysis through user guided drill-down of polyarchical metadata. This metadata describes multiple hierarchical structures for organizing tuple aggregations and table attributes. Thisstructure is seen in financial data, organizational structures, sport statistics, and other domains. A spreadsheet format enables comparison of visualizations at any level of the hierarchy. Breakdown Visualization allows users to drill-down a single hierarchy then pivot into another hierarchy within the same view. It utilizes a fix and move technique that allows users to select multiple foci for drill-down.
A Note About Information Science Research
Authors: Gerard Salton
Venue:  (1984)

This note deals with the relationship between information science research and practice. The impression that the field is moribund and that the research output is uniformly inferior is not supported by an examination of the information retrieval literature.
McLaren''s Masterpiece
Authors: David Gries, Jan F. Prins
Venue:  (1986)

Abstract not available