ppxscal/embedding_network huggingface dataset:
New Systolic Architectures for Inversion and Division in GF(2^m)
Authors: Zhiyuan Yan, Dilip V. Sarwate
Venue: IEEE Transactions on Computers (2003)

We present two systolic architectures for inversion and division in GF(2^m)based on a modified extended Euclidean algorithm. Our architectures are similar to those proposed by others in that they consist of two-dimensional arrays of computing cells and control cells with only local intercell connections and have O(m^2) area-time product. However, in comparison to similar architectures, both our architectures have critical path delays that are smaller, gate counts that range from being considerably smaller to only slightly larger, and latencies that are identical for inversion but somewhat larger for division. One architecture uses an adder or an (m + 1)-bit ring counter inside each control cell, while the other architecture distributes the ring counters into the computing cells, thereby reducing each control cell to just two gates.
Finding more useful information faster from web search results
Authors: Yi-fang Brook Wu, Latha Shankar, Xin Chen
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In this paper, we propose a prototype system for automatic generation of concept hierarchies to be used as an overview of search results. The system sends a user's query to five search engines and receives a returned list of relevant web pages. The system then extracts query-oriented concept terms from snippets that come with the returned hits. Concept terms are organized into a concept hierarchy using a co-occurrence-based classification technique. Finally, concepts in returned documents are dynamically highlighted according to terms in the selected concept branch that lead to the chosen document. The user study shows that concept hierarchies do provide easy navigation and browsing of web returned documents. The results also show that users can find a document of interest no matter how low it is ranked in the retrieved list.
The fuzzy group method of data handling and its application to the tasks of the macroeconomic indexes forecasting
Authors: Yu P. Zaychenko, I. O. Zayets
Venue: Systems Analysis Modelling Simulation (2003)

The task of synthesis of the predicting models on the basis of a fuzzy group method of data handling is considered. Problem of adapting of coefficients of the predicting model also is considered and the algorithm of its solution based on a method of stochastic approximation is offered. The application of the method is illustrated at the problem of prediction of macroeconomic indexes of Ukrainian economy.
2003 Technology Roadmap for Semiconductors
Authors: Don Edenfeld, Andrew B. Kahng, Mike Rodgers, Yervant Zorian
Venue: Computer (2004)

Today, microprocessor advances abound: general-purpose digital microprocessors for personal computers have been joined by mixed-signal systems for wireless communication and embedded applications. Battery-powered mobile devices are replacing wallplugged servers. SoC and systemin-package designs are supplanting inhouse, single-source chip designs.Software today can account for 80 percent of an embedded system's development cost, test cost has increased exponentially relative to manufacturing cost, and verification engineers outnumber design engineers on microprocessor project teams. Overcoming the many existing design technology gaps will thusrequire a concerted effort by the entire industry.
How to quickly find articles in the top IS journals
Authors: Ruth Bolotin Schwartz, Michele C. Russo
Venue: Communications of the ACM (2004)

Informed searches begin by determining which indexes to use.
Dimensions of machine learning in design
Authors: Dan L. Grecu, David C. Brown
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Many of the design systems developed in recent years incorporate some machine learning. The number of such systems already available, and the multitude of design learning opportunities that are slowly being revealed, suggest that the time is ripe to attempt to put these developments into a systematic framework. Consequently, in this paper we present a set of dimensions for machine learning in design research. We hope that it can be used as a guide for comparing existing work, and that it may suggest new directions for future exploration in this area.
A priority MAC protocol to support real-time traffic in ad hoc networks
Authors: Jang-Ping Sheu, Chi-Hsun Liu, Shih-Lin Wu, Yu-Chee Tseng
Venue: Wireless Networks (2004)

Carrier sense multiple access and its variants have been widely used in mobile ad hoc networks. However, most existing access mechanisms cannot guarantee quality for real-time traffic. This paper presents a distributed medium access control protocol that provides multiple priority levels for stations to compete for the wireless channel. One common channel is assumed to be shared by all stations. Stations are assumed to be able to hear each other (i.e., the network is fully connected). The channel is accessed by stations according to their priorities, and for stations with the same priority, they send frames in a round robin manner. The channel access procedure is divided into three stages: priorities classification period, ID initialization period, and transmission period. Simulation results indicate that our protocol provides high channel utilization and bounded delays for real-time frames.
All from One, One for All, Failure Diagnosis of Discrete Event Systems Using Representatives
Authors: Yannick Pencolé
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Failure diagnosis in large and complex systems is a critical and challenging task. In the realm of model based diagnosis on discrete event systems, computing a failure diagnosis means computing the set of system behaviours that could explain observations. Depending on the diagnosed system, such behaviours can be numerous, so that a problem of representing them is induced. The paper discusses about this problem and presents a way of representing a diagnosis by the use of a partial order reduction technique.
Tracking through information technology education
Authors: Erick D. Slazinski, Susan K. Lisack
Venue: Current issues in IT education (2003)

With a projected 2.26 million additional jobs to fill in various computer fields by the year 2010, there are and will continue to be ample job opportunities in the computer industry. However, the computer field is far too broad for one individual to be an expert in the entire field. Therefore, it may be more useful for students to have the opportunity to concentrate their studies in a specific interest area within a broader information technology degree. This chapter discusses the creation of a database track within an Information Technology (IT) or Computer Information Systems (CIS) degree program so that undergraduate students can choose to focus on this specialty area in their junior and senior years.
Using symmetry in robust model fitting
Authors: Hanzi Wang, David Suter
Venue: Pattern Recognition Letters (2003)

The pattern recognition and computer vision communities often employ robust methods for model fitting. In particular, high breakdown-point methods such as least median of squares (LMedS) and least trimmed squares (LTS) have often been used in situations where the data are contaminated with outliers. However, though the breakdown point of these methods can be as high as 50% (they can be robust to up to 50% contamination), they can break down at unexpectedly lower percentages when the outliers are clustered. In this paper, we demonstrate the fragility of LMedS and LTS and analyze the reasons that cause the fragility of these methods in the situation when a large percentage of clustered outliers exist in the data. We adapt the concept of "symmetry distance" to formulate an improved regression method, called the least trimmed symmetry distance (LTSD). Experimental results are presented to show that the LTSD performs better than LMedS and LTS under a large percentage of clustered outliers and large standard variance of inliers.
A transactional API for the EAN X.500 directory service
Authors: Gerald Neufeld, Barry Brachman
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

The OSI directory system manages a distributed directory information database of named objects, defining a hierarchical relationship between the objects. An object consists of a set of attributes as determined by a particular class. Attributes are tuples that include a type and one or more values.This paper presents an overview of the X.500 standard and describes extensions to the standard to provide user agents with a means of handling atomic transactions. The new interface allows any sequence of standardized X.500 operations to be executed in the context of an atomic transaction. Support is also provided for the two phase commit protocol, allowing two or more directories to atomically commit updates.
Minimum failure-free operating intervals associated with random failures of non-repairable components
Authors: M. T. Todinov
Venue: Computers and Industrial Engineering (2003)

A generic equation is derived related to determining reliability that depends only on the relative configurations of random variables in a finite interval. It is demonstrated that the statistics of random failures in a finite time interval can be handled easily using the derived equation. The new equation forms the basis of a new methodology for analysis of the intervals between random failures in a finite time interval and setting reliability requirements based on the existence of such intervals. An upper bound of the hazard rate (a hazard rate envelope) is determined which guarantees that when the hazard rate is within the specified envelope a set of minimum failure-free operating intervals (MFFOP intervals) will exist with a specified probability before failure and replacement. Contrary to a common view, it is demonstrated that for a finite time interval the probability of existence of a set of minimum failure-free intervals is not a product of the probabilities of existence of the separate MFFOP intervals. A model for setting quantitative reliability requirements is also proposed based on specifying the hazard rate envelope which guarantees with a specified probability no clustering of failures over a specified critical distance.
Exploratory medical knowledge discovery: experiences and issues
Authors: John F. Roddick, Peter Fule, Warwick J. Graco
Venue: ACM SIGKDD Explorations Newsletter (2003)

The application of data mining and knowledge discovery techniques to medical and health datasets is a rewarding but highly challenging area. Not only are the datasets large, complex, heterogeneous, hierarchical, time-varying and of varying quality but there exists asubstantial medical knowledge base which demands a robust collaboration between the data miner and the health professional(s) if useful information is to be extracted.This paper presents the experiences of the authors and others in applying exploratory data mining techniques to medical, health and clinical data. In so doing, it elicits a number of general issues and provides pointers to possible areas of future research in data mining and knowledge discovery more broadly.
Integrative approach for computationally inferring protein domain interactions
Authors: See-Kiong Ng, Zhuo Zhang, Soon-Heng Tan
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The current need for high-throughput protein interaction detection has resulted in interaction data being generated en masse, using experimental methods such as yeast-two-hybrids and protein chips. Such data can be errorful and they often do not provide adequate functional information for the detected interactions; it is therefore useful to develop an in silico approach to further validate and annotate the detected protein interactions. Given that protein-protein interactions involve physical interactions between protein domains, domain-domain interaction information can be useful for validating, annotating, and even predicting protein interactions. However, large-scale experimentally determined domain-domain interaction data do not exist; as such, we describe an integrative approach to computationally derive putative domain interactions from multiple data sources, including rosetta stone sequences, protein interactions, and protein complexes. We show the usefulness of such an integrative approach by applying the derived domain interactions to predict and validate protein-protein interactions.
Using data mining to profile TV viewers
Authors: William E. Spangler, Mordechai Gal-Or, Jerrold H. May
Venue: Communications of the ACM (2003)

Mining thousands of viewing choices and millions of patterns, advertisers and TV networks identify household characteristics, tastes, and desires to create and deliver custom targeted advertising.
Salesperson perceptions of internet impact on the selling function
Authors: Randall Keith Waynick
Venue:  (2003)

This research is a quantitative review of sales force perceptions of the Internet. The research presents information on how selling organizations should integrate the Internet into their operation by fully understanding the participants' reactions and beliefs about Internet technology. The research population consisted of 188 salespeople in a direct sales force in the consumer products category. The key variables measured were sales role/job function, geographic location, sales tenure, and Internet proficiency. The study used a survey instrument developed specifically to measure Internet perceptions held by sales people. Specifically, the objectives of this study were to elicit salespeople's perceptions of the impact the Internet has had on the following five areas: the salesperson's role in their organization (salesperson utilization), the way their customers use the Internet (customer utilization), customer service, the salespeople's time management, and strategic planning. The results are used to make recommendations about how best to utilize the Internet in future selling organizations' design, structure, and change management.
Code size reduction technique and implementation for software-pipelined DSP applications
Authors: Qingfeng Zhuge, Bin Xiao, Edwin H.-M. Sha
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

Software pipelining technique is extensively used to exploit instruction-level parallelism of loops, but also significantly expands the code size. For embedded systems with very limited on-chip memory resources, code size becomes one of the most important optimization concerns. This paper presents the theoretical foundation of code size reduction for software-pipelined loops based on retiming concept. We propose a general Code-size REDuction technique (CRED) for various kinds of processors. Our CRED algorithms integrate the code size reduction with software pipelining. The experimental results show the effectiveness of the CRED technique on both code size reduction and code size/performance trade-off space exploration.
Asynchronous Fast Adaptive Composite-Grid Methods for Elliptic Problems: Theoretical Foundations
Authors: Barry Lee, Stephen F. McCormick, Bobby Philip, Daniel J. Quinlan
Venue: SIAM Journal on Numerical Analysis (2004)

Accurate numerical modeling of complex physical, chemical, and biological systems requires numerical simulation capability over a large range of length scales, with the ability to capture rapidly varying phenomena localized in space and/or time. Adaptive mesh refinement (AMR) is a numerical process for dynamically introducing local fine resolution on computational grids during the solution process, in response to unresolved error in a computation. Fast adaptive composite-grid (FAC) methods are a class of algorithms that exploit the multilevel structure of AMR grids to solve elliptic problems efficiently. This paper develops a theoretical foundation for AFACx, an asynchronous FAC method. A new multilevel condition number estimate establishes that the convergence rate of the AFACx algorithm does not degrade as the number of refinement levels in the AMR hierarchy increases.
Error Exponents of Expander Codes under Linear-Complexity Decoding
Authors: Alexander Barg, Gilles Zémor
Venue: SIAM Journal on Discrete Mathematics (2004)

A class of codes is said to reach capacity {\scriptsize $Ç$} of the binary symmetric channel if for any rate $R<$ {\scriptsize $Ç$} and any $\varepsilon>0$ there is a sufficiently large N such that codes of length $\ge N$ and rate R from this class provide error probability of decoding at most $\varepsilon$, under some decoding algorithm. The study of the error probability of expander codes was initiated by Barg and Z{émor in 2002 [IEEE Trans. Inform. Theory, 48 (2002), pp. 1725--1729], where it was shown that they attain capacity of the binary symmetric channel under a linear-time iterative decoding with error probability falling exponentially with code length N. In this work we study variations on the expander code construction and focus on the most important region of code rates, close to the channel capacity. For this region we estimate the decrease rate (the error exponent) of the error probability of decoding for randomized ensembles of codes. The resulting estimate gives a substantial improvement of previous results for expander codes and some other explicit code families.
Making Secure TCP Connections Resistant to Server Failures
Authors: Hailin Wu, Andrew Burt, Ramki Thurimella
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Methods are presented to increase resiliency to serverfailures by migrating long running, secure TCP-basedconnections to backup servers, thus mitigating damagefrom servers disabled by attacks or accidental failures.The failover mechanism described is completelytransparent to the client. Using these techniques, simple,practical systems can be built that can be retrofitted intothe existing infrastructure, i.e. without requiring changeseither to the TCP/IP protocol, or to the client system. Theend result is a drop-in method of adding significantrobustness to secure network connections such as thoseusing the secure shell protocol (SSH). As there is a largeinstalled universe of TCP-based user agent software, itwill be some time before widespread adoption takes placeof other approaches designed to withstand these kind ofservice failures; our methods provide an immediate way toenhance reliability, and thus resistance to attack, withouthaving to wait for clients to upgrade software at their end.The practical viability of our approach is demonstrated byproviding details of a system we have built that satisfiesthese requirements.
A droplet in a stationary electric field
Authors: Dirk Langemann
Venue: Mathematics and Computers in Simulation (2003)

Water droplets on insulating material influence strongly the aging process of the material. The shape of the droplets signifies the state of the aging material. The present paper discusses a numerical procedure to calculate the droplet shape in an electric field generated by a constant voltage. A combined stationary solution of the droplet shape and the electric field is searched for. This leads to a free boundary value problem which is solved by an iterative method. The typical shapes of the droplets are shown for several voltages. Special care is taken to the singularities of the electric field in the triple points.
Poster abstract: wireless sensor network characterization - application to demand response energy pricing
Authors: Nathan Ota, Dan Hooks, Paul Wright, David Auslander, Therese Peffer
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

This poster presents latency and reliability characterization of wireless sensor network as applied to an advanced building control system for demand response energy pricing. A test network provided the infrastructure to extract round trip time and packet failure data. Latency was below the predicted 75 milliseconds per hop. Packet failure rates increased with network depth and in some locations exceeded 75 percent failure rates. Both latency and packet failure rates exhibited non-linear changes within the network. Lastly, the impacts of latency and reliability characteristics to control-specific parameters are presented.
Enhancing Testability of System on Chips Using Network Management Protocols
Authors: O. Laouamri, C. Aktouf
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

This paper shows how to adapt the P1500 Design-For-Test standard through network management protocols to make the testing problem of System-On-Chips (SoCs) easier and cost-effective. For this purpose, a SoC is analyzed as a distributed system in which its own basic components or IP Cores (Intellectual Proprieties) are considered as network agents according to SNMP (Simple Network Management Protocol) protocol. An experimental study was carried out to show the effectiveness of such an approach.
Another view of coroutines
Authors: Tom Jacobsen
Venue: ACM SIGPLAN Notices (1978)

A few comments upon the paper given by Mr. Dick Grune in a recent issue of this periodical (ACM SIGPLAN Notices <u>12.7</u> 1977, p 75--81).
Dynamic ceiling priorities in GNAT implementation report
Authors: Javier Miranda, Edmond Schonberg, Miguel Masmano, Jorge Real, Alfons Crespo
Venue: ACM SIGAda Ada Letters (2003)

This document presents the required modifications to the GNAT compiler to support dynamic ceiling priorities in protected objects [1]. In a nutshell, dynamic ceilings for protected objects can be implemented in a simple and efficient manner in the GNAT compiler and run-time.
Utilizing resource-rich nodes in Ad hoc networks
Authors: Ian D. Chakeres, Elizabeth M. Belding-Royer
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

In wireless ad hoc networks heterogeneity is inherent; each node has different characteristics, resources and purpose. Current ad hoc routing protocols do not take node heterogeneity into account when making routing decisions; they consider each node indentical in capabilities. We propose a simple way to modify the route discovery phase of an on-demand routing protocol to choose the "best" route, considering heterogeneity. The Ad hoc On-Demand Distance Vector Routing protocol (AODV) [1] is modified and the performance validated in experimental tests. It is shown that by considering heterogeneity during route discovery, paths that contain more capable nodes are utilized, thereby avoiding resource-poor nodes.