ppxscal/embedding_network huggingface dataset:
A Formal Verification Methodology for IP-based Designs
Authors: Daniel Karlsson, Petru Eles, Zebo Peng
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper proposes a formal verification methodology which smoothly integrates with component-based system-level design, using a divide and conquer approach. The methodology assumes that the system consists of several reusable components, each of them already verified by their designers and which are considered correct under the assumption that the environment satisfies certain properties assumed by the component. What remains to be verified is the glue logic inserted between the components. Each such glue logic is verified one at a time using model checking techniques. Experiments, performed on a real-life example (mobile telephone), demonstrating the efficiency and intuitivity of the methodology, are moreover thoroughly presented. Three different properties have been verified on one part of the system.
Algorithms for Taylor Expansion Diagrams
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

The ever increasing size of integrated circuits results inlarge problem sizes during synthesis and verification of suchdesigns. Recently Taylor Expansion Diagrams (TEDs) wereintroduced as a data structure to cope with large probleminstances. TEDs allow to exploit high level information inthe representation of functions.In this paper the basic TED operations are analyzed froma complexity point of view. Suggestions for optimizations ofthe originally proposed algorithms are made.
Iterative record linkage for cleaning and integration
Authors: Indrajit Bhattacharya, Lise Getoor
Venue: Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery (2004)

Record linkage, the problem of determining when two records refer to the same entity, has applications for both data cleaning (deduplication) and for integrating data from multiple sources. Traditional approaches use a similarity measure that compares tuples' attribute values; tuples with similarity scores above a certain threshold are declared to be matches. While this method can perform quite well in many domains, particularly domains where there is not a large amount of noise in the data, in some domains looking only at tuple values is not enough. By also examining the context of the tuple, i.e. the other tuples to which it is linked, we can come up with a more accurate linkage decision. But this additional accuracy comes at a price. In order to correctly find all duplicates, we may need to make multiple passes over the data; as linkages are discovered, they may in turn allow us to discover additional linkages. We present results that illustrate the power and feasibility of making use of join information when comparing records.
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Venue: Workshop On Privacy In The Electronic Society (2003)

These proceedings contain the papers selected for presentation at the ACMWorkshop on Privacy in the Electronic Society, held in association with the 10th ACM Computer and Communications Security Conference, October 30, 2003, in Washington, DC (USA).In response to the call for papers, 50 papers were submitted to the workshop. These papers were evaluated on the basis of their significance, novelty, and technical quality. Each paper was reviewed by at least three members of the program committee. The program committee meeting was held electronically. Of the papers submitted, 15 were selected for presentation at the workshop.
An Ontology Modeling Method in Semantic Composition of Web Services
Authors: Juntao Cui, Jiamao Liu, Yujin Wu, Ning Gu
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The automatic composition of Web services requires the existing services to be encoded in a semantic form, such as ontology. If Web services are represented with ontology, we can automatic compose Web services by means of their semantics. Ontology modeling is divided into two steps: input/output parameters modeling and Web services modeling. First, we collect Web services' input/output parameters, represent them with classes in ontology, and transform Web services to properties in ontology, define relations between classes and properties. Then we judge Web services' relations based on relations between properties transformed from these Web services and estimate whether these Web services can be composed..
Technology trends in electrophotography
Authors: M. H. Lee, J. E. Ayala, B. D. Grant, W. Imaino, A. Jaffe, M. R. Latta, S. L. Rice
Venue: IBM Journal of Research and Development (1984)

Selected innovations and advances in electrophotographic printing are reviewed. Technological advances in photoreceptors, imaging techniques, toner development and cleaning, fusing, sensors, and new machine configurations and functions are discussed with respect to their possible applicability to future electrophotographic imaging systems. In general, improvements in print quality and reliability remain the main goals. In specific applications, added functions and an increased range of usable media are highly desired.
Orthogonal Space-Time Block Codes with Feedback
Authors: Girish Ganesan, Petre Stoica, Erik G. Larsson
Venue: Wireless Personal Communications: An International Journal (2004)

In this paper we consider how Orthogonal Space-Time Block Codes (OSTBC) can be used in the presence of feedback from the receiver to the transmitter. First, we survey how some of the feedback techniques for AWGN channels with fading can be applied to OSTBC. Then we consider a simple scheme with diagonal weighting. The optimal diagonal weighting matrix, which minimizes the probability of error, is derived. The optimal weights depend on the channel and, hence, a feedback becomes necessary. However, the required feedback can be accomplished using log2 (nt) bits, where nt is the number of transmit antennas. Simulations show that relatively significant gains can be achieved with the diagonal weighting scheme.In a practical system it is quite possible that the bits that are fed back to the transmitter are in error. In that case we show that there will be a loss of diversity. To overcome this loss, we develop weighting schemes that are error tolerant and always perform better than the unweighted OSTBC (even in the presence of feedback errors).
MVC Dance: Connecting Software Development and Corporeality from Agile Processes and Pattern Language Perspectives
Authors: Hanyuda Eiiti
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

This paper describes the authorýs view on softwaredevelopment in the future from agile process andpattern language perspective. It places much value oninteractions among stakeholders so we need a tool forconsensus building on architecture through workshop.We propose a MVC dance and other pattern dancesfor architecture understanding and educationalpurposes.
Bayesian estimation of stimulus responses in poisson spike trains
Authors: Sidney R. Lehky
Venue: Neural Computation (2004)

A Bayesian method is developed for estimating neural responses to stimuli, using likelihood functions incorporating the assumption that spike trains follow either pure Poisson statistics or Poisson statistics with a refractory period. The Bayesian and standard estimates of the mean and variance of responses are similar and asymptotically converge as the size of the data sample increases. However, the Bayesian estimate of the variance of the variance is much lower. This allows the Bayesian method to provide more precise interval estimates of responses. Sensitivity of the Bayesian method to the Poisson assumption was tested by conducting simulations perturbing the Poisson spike trains with noise. This did not affect Bayesian estimates of mean and variance to a significant degree, indicating that the Bayesian method is robust. The Bayesian estimates were less affected by the presence of noise than estimates provided by the standard method.
An Ontology Based-Approach for Semantic Search in Portals
Authors: Wallace Anacleto Pinheiro, Ana Maria de C. Moura
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Portals have become very popular on the internet. They allow users to access many online transactions and customized information. More recently, semantic portals emerged as a natural extension of traditional portals and they have been attracting researchers and enterprise attention as a new way to provide information. This paper covers these issues and shows how ontologies can improve results relevance in one of the most important component of a portal: the search mechanism. It describes a search tool developed in the context of a semantic portal named PASS (Portal with Access to Semantic Search). This tool uses components of domain ontologies stored in the portal to expand terms during the search process.
A Priority Inheritance-based Inversion Control Methodology for General Resource Access Problems
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Real-time concurrent systems typically involve a largenumber of components interacting with one another incomplex ways. In such systems, proper and often complexand elaborate resource access policies must be incorporatedto eliminate undesirable executions and to ensuremaximum possible concurrency. In this paper, wepresent a technique for priority inversion control when usingsuch complex resource access policies. We presenta systematic approach to design resource access controlcode based on a formal development methodology calledthe global invariant approach, along with appropriate priorityinversion control code. Our solution relies only onmutex locks with priority inversion control, which arefound in many real-time operating systems, and priority-basedbinary semaphores; therefore, our solution can beimplemented on existing infrastructures. We present animplementation of our solution on VxWorks.
The energy efficiency of CMP vs. SMT for multimedia workloads
Authors: Ruchira Sasanka, Sarita V. Adve, Yen-Kuang Chen, Eric Debes
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

This paper compares the energy efficiency of chip multiprocessing (CMP) and simultaneous multithreading (SMT) on modern out-of-order processors for the increasingly important multimedia applications. Since performance is an important metric for real-time multimedia applications, we compare configurations at equal performance. We perform this comparison for a large number of performance points derived using different processor architectures and frequencies/voltages.We find that for the design space explored, for each workload, at each performance point, CMP is more energy efficient than SMT. The difference is small for two thread systems, but large (18% to 44%) for four thread systems. We also find that the best SMT and the best CMP configuration for a given performance target have different architecture and frequency/voltage. Therefore, their relative energy efficiency depends on a subtle interplay between various factors such as capacitance, voltage, IPC, frequency, and the level of clock gating, as well as workload features. We perform a detailed analysis considering these factors and develop a mathematical model to explain these results.Although CMP shows a clear energy advantage for four-thread (and higher) workloads, it comes at the cost of increased silicon area. We therefore investigate a hybrid solution where a CMP is built out of SMT cores, and find it to be an effective compromise. Finally, we find that we can reduce energy further for CMP with a straightforward application of previously proposed techniques of adaptive architectures and dynamic voltage/frequency scaling.
Task Partitioning Upon Heterogeneous Multiprocessor Platforms
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Given a collection of recurring tasks or processes thatcomprise the software for a real-time system, and a collectionof available processing units of different kinds uponwhich to execute them, the heterogeneous multiprocessorpartitioning problem is concerned with determining whetherthe given tasks can be partitioned among the available processingunits in such a manner that all timing constraintsare met.It is shown than this problem is intractable (NP-hardin the strong sense).Efficient implementations of sufficient(albeit not necessary) partitioning algorithms are presented,and proved correct.
An indirect boundary element method for three-dimensional explosion bubbles
Authors: C. Wang, B. C. Khoo
Venue: Journal of Computational Physics (2004)

This paper suggests the implementation of indirect boundary element method (IBEM) to simulate three-dimensional underwater explosion bubbles. The source is assumed distributed continuously on the boundary surface. An expression for the self-induced velocity of a point on the boundary surface is obtained via mathematical analysis, and with it a new definition of the normal vector valid even for a non-smooth surface is given. Elastic mesh technique (EMT), which is a new mesh regulation technique, is further applied to maintain the regularity of the triangularelement mesh used to discretize the dynamic boundary surfaces during the evolution of explosion bubble(s). The Bi-CG iterative solver is employed to solve the resulting linear system. All these efforts make the present approach viable and robust, and which is validated by computations of several bubble dynamics problems.
TopCat: Data Mining for Topic Identification in a Text Corpus
Authors: Chris Clifton, Robert Cooley
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

TopCat (Topic Categories) is a technique for identifying topics that recur in articles in a text corpus. Natural language processing techniques are used to identify key entities in individual articles, allowing us to represent an article as a set of items. This allows us to view the problem in a database/data mining context: Identifying related groups of items. This paper presents a novel method for identifying related items based on traditional data mining techniques. Frequent itemsets are generated from the groups of items, followed by clusters formed with a hypergraph partitioning scheme. We present an evaluation against a manually categorized ground truth news corpus; it shows this technique is effective in identifying topics in collections of news articles.
Visual attention based information culling for Distributed Virtual Environments
Authors: Ashweeni Kumar Beeharee, Adrian J. West, Roger Hubbold
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

The central goal in Distributed Virtual Environments (DVEs) is to provide an experience of the shared world that is perceptually plausible for the immersed user. This has to be achieved in the face of network issues such as bandwidth limitations and latencies which make total synchronism impossible. Techniques have been devised to help; some optimise network use by limiting what is transmitted, others try to disguise the effects of network 'glitches' at the user's client machine - for example smoothing policies. To date such techniques tend to be system-based rather than user-oriented. Yet there is an active body of psychological research, for example in visual attention, which has successfully been employed by the graphics community to yield better perceived results for a given resource. Immersive DVEs are even more critically dependent upon the users' perceived experience. We may expect therefore that such 'psychologically' oriented approaches have even more to offer here. In this paper a visual attention model which exploits the peculiarities of the human visual system is presented. It is based on previous work, and on a series of carefully designed experiments which are used to guide the implementation of the model and to design architectures for DVEs. The proposed architectures are then tested using different DVE experimental applications, which include a highly populated virtual city. The results demonstrate that the characteristics of the human visual system can be exploited to improve network usage and generate a more perceptually plausible environment in the face of incomplete synchronisation.
Routine automated synthesis of five patented analog circuits using genetic programming
Authors: J. R. Koza, M. A. Keane, M. J. Streeter
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

This article reports on a project in which we browsed patents issued after January 1, 2000 to commercial enterprises or university research institutions for analog electrical circuits. We then employed genetic programming to automatically design (synthesize) entities that duplicated the functionality of five post-2000 issued patents. The automated method works from a high-level statement of the circuit&#x2019;s intended function. The article addresses the question of what is actually delivered by the operation of the artificial problem-solving method in relation to the amount of intelligence that is supplied by the humans employing the method (something we refer to as the yield of an automated method). The article also addresses the question of the routineness of the artificial problem-solving method &#x2013; that is, the amount of effort required to make the transition from problem to problem within a particular domain. The conclusion is that the artificial method routinely delivers high-yield, human-competitive (i.e., previously patented) results.
An Electronic Diary Software for Ecological Momentary Assessment (EMA) in Clinical Trials
Authors: Massoud Vahabzadeh, David Epstein, Mustapha Mezghanni, Jia-Ling Lin, Kenzie Preston
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Experience sampling is a research technique in which participants record their behaviorsand moods in real time in their day-to-day environments. Ecological Momentary Assessment(EMA) is a refinement of experience sampling in which randomly timed assessments arecombined with event-contingent assessments. EMA data are more reliable if obtained withhandheld computers than with paper diaries. Robust EMA applications sufficiently flexibleand easily adaptable for our various research efforts, including a study of polydrug use weare now undertaking at our outpatient treatment/research clinic, were not available. Wedeveloped Transactional Electronic Diary (TED), a highly configurable EMA program. TEDprovides investigators the capability to conduct close assessment and monitoring of symptomsand intensity of drug withdrawal in participants. Data collected via TED is subsequentlyincorporated into our Human Research Information System (HuRIS) for further analysis.
EcMLST: An Online Database for Multi Locus Sequence Typing of Pathogenic Escherichia coli
Authors: Weihong Qi, David W. Lacher, Alyssa C. Bumbaugh, Katie E. Hyma, Lindsey M. Ouellette, Teresa M. Large, Cheryl L. Tarr, Thomas S. Whittam
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In order to provide a portable and accurate typing system for the unambiguous characterization of pathogenic Escherichia coli isolates to the scientific community, we have constructed an online database for Multi-Locus Sequence Typing of pathogenic E. coli (EcMLST) using current internet and open source technology. The system consists of an XML specification of the E. coli MLST system, and a set of perl modules defining the database tables and generating dynamic web pages for querying the database. It is implemented on a Sun server running the Apache web server. The underlying tier is the MySQL database system. Currently, the database contains nucleotide sequence data and annotated allelic profile data of 15 house-keeping genes for 600 representative E. coli isolates. Access to the central-held typing and epidemiology data is supported by parametric searching, full-text searching, as well as query interface links to the reference center of Shiga Toxin-producing E. coli (STEC, http://www.shigatox.net/stec). EcMLST has been used by public health laboratories and researchers for epidemiology and evolutionary studies. The system can be accessed at http://www.shigatox.net/mlst.
Requirements Triage: What Can We Learn from a "Medical" Approach?
Authors: Erik Simmons
Venue: IEEE Software (2004)

Trauma triage can provide insight into how to measure risk of failure early, quickly, and accurately. For projects at significant risk, you could activate a "requirements trauma system" to include specialists, processes, and tools designed to correct the issues and improve the probability that the project will end successfully.
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Authors: Usman W. Roshan, Bernard M. E. Moret, Tandy Warnow, Tiffani L. Williams
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for producing phylogenetic trees produce good solutions within reasonable time on small datasets (up to a few thousand sequences), while ML heuristics are limited to smaller datasets (up to a few hundred sequences). However, since MP (and presumably ML) is NP-hard, such approaches do not scale when applied to large datasets. In this paper, we present a new technique called Recursive-Iterative-DCM3 (Rec-I-DCM3), which belongs to our family of Disk-Covering Methods (DCMs). We tested this new technique on ten large biological datasets ranging from 1,322 to 13,921 sequences and obtained dramatic speedups as well as significant improvements in accuracy (better than 99.99%) in comparison to existing approaches. Thus, high-quality reconstructions can be obtained for datasets at least ten times larger than was previously possible.
Hierarchical Stream Aggregates: Querying Nested Stream Sessions
Authors: Damianos Chatziantoniou, Achilleas Anagnostopoulos
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

This article identifies an interesting class of applicationswhere stream sessions may be organized into a hierarchicalfashion - i.e. sessions may consist of sub-sessions. We arguethat data streams of this kind have rich procedural semantics - i.e. behavior - and therefore a semantically rich model should be used: a session may be defined by opening andclosing conditions, may have data and methods and mayconsist of sub-sessions. We propose a simple conceptualmodel based on the notion of "session" similar to a class inan object-oriented environment having lifetime semantics.Queries on top of this schema can be formulated via HSA(hierarchical stream aggregate) expressions.