ppxscal/embedding_network huggingface dataset:
Two-Level Fourier Analysis of a Multigrid Approach for Discontinuous Galerkin Discretization
Authors: P. W. Hemker, W. Hoffmann, M. H. van Raalte
Venue: SIAM Journal on Scientific Computing (2003)

In this paper we study a multigrid (MG) method for the solution of a linear second order elliptic equation, discretized by discontinuous Galerkin (DG) methods, and we give a detailed analysis of the convergence for different block-relaxation strategies.We find that pointwise block-partitioning gives much better results than the classical cellwise partitioning. Both for the Baumann--Oden method and for the symmetric DG method, with and without interior penalty (IP), the block-relaxation methods (Jacobi, Gauss--Seidel, and symmetric Gauss--Seidel) give excellent smoothing procedures in a classical MG setting. Independent of the mesh size, simple MG cycles give convergence factors of 0.075--0.4 per iteration sweep for the different discretization methods studied.
Constrained ATPG for Broadside Transition Testing
Authors: Xiao Liu, Michael S. Hsiao
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

In this paper, we propose a new concept of testing only functionally testable transition faults in Broadside Transition testing via a novel constrained ATPG. For each functionally untestable transition fault f, a set of illegal (unreachable) states that enable detection of f is first computed. This set of undesirable illegal states is efficiently represented as a Boolean formula. Our constrained ATPG then incorporates this constraint formula to generate Broadside vectors that avoid those undesirable states. In doing so, our method efficiently generates a test set for functionally testable transition faults and minimizes detection of functionally untestable transition faults. Because we want to avoid launching and propagating transitions in the circuit that are not possible in the functional mode, a direct bene.t of our method is the reduction of yield loss due to overtesting of these functionally untestable transitions.
Extremal graphs for intersecting cliques
Authors: Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei
Venue: Journal of Combinatorial Theory Series B (2003)

For any two positive integers n ≥ r ≥ 1, the well-known Turán Theorem states that there exists a least positive integer ex(n,Kr) such that every graph with n vertices and ex(n,Kr) + 1 edges contains a subgraph isomorphic to Kr. We determine the minimum number of edges sufficient for the existence of k cliques with r vertices each intersecting in exactly one common vertex.
A program simulator by partial interpretation
Authors: Kazuhiro Fuchi, Hozumi Tanaka, Yuriko Manago, Toshitsugu Yuba
Venue: Proceedings of the second symposium on Operating systems principles (1969)

In promoting the ETSS project a program simulator based on an idea of partial interpretation has been constructed, and its principle and design are described in the paper. This new approach has been introduced to provide the simulator with such features as high speed and high accuracy in simulation and simplification in implementation. The essence of the idea of partial interpretation is using direct execution of instructions by hardware and simulation of them by an interpreter in combination, wherewith the hardware interrupt mechanism intermediates the two phases of the whole simulation. An interruption takes place when executing a "privileged" instruction, which triggers the simulation of the instruction. The other type of instructions are normally rendered to direct execution by hardware. The simulation method for devices operating in parallel is also described with respect to the timing control and scheduling. A program simulator of this type provides a powerful tool for debugging "supervisor " programs and opens a new approach to system expansion.
Easily Testable Realization of GRM and ESOP Networks for Detecting Stuck-at and Bridging Faults
Authors: Hafizur Rahaman, Debesh K. Das, Bhargab B. Bhattacharya
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

A testable realization of Generalized Reed-Muller (GRM)or EXOR Sum-of-Products (ESOP) expression has beenproposed that admits a combined universal test set of size(2n+6) for detection of stuck-at and bridging faults. ForGRM implementation, the test set detects all single stuck-atand bridging faults (both OR and AND type) and a largenumber of multiple bridging faults. For ESOP, a fewsingle bridging faults may remain untested, occurrence ofwhich can be avoided by employing a design and layouttechnique. The test set is independent of the function andthe circuit-under-test and can be stored in a ROM on chipfor built-in self-test. For several benchmark circuits, thesize of the test set is found to be much smaller than anATPG-generated test set or those of the previous methods.
Ad-me: Wireless Advertising Adapted to the User Location, Device and Emotions
Authors: Nataliya Hristova, G. M. P. O'Hare
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

It has been predicted that the next phase of electronic business growth will be in the area of mobile e-commerce. The translation from "e" to "m" commerce, however, is not a straightforward task. This paper considers context sensitive advertising. According to analysts, wireless advertising will prove most successful when the advertisements merge seamlessly with the service content provided.This paper discusses key issues in the development of Ad-me (Advertising for the Mobile E-commerce user), a context-sensitive advertising system. Ad-me aims to deliver more palatable, less intrusive and personalized advertisements overlaid upon a mobile tourist guide.This paper describes the design and implementation of Ad-me and subsequently reflects upon the possibility of using user emotion to increase effectiveness of the advertising. The design of Ad-me adopts a Multi-Agent Systems (MAS) philosophy.
Proactive information gathering for homeland security teams
Authors: Paul Kogut, John Yen, Yui Leung, Shuang Sun, Rui Wang, Ted Mielczarek, Ben Hellar
Venue: Communications of the ACM (2004)

Supporting counterterrorism analysts with software agents that dynamically anticipate their information requirements.
A Fuzzy Mechanism for Action Selection of Soccer Robots
Authors: Chia-Ju Wu, Tsong-Li Lee
Venue: Journal of Intelligent and Robotic Systems (2004)

A vision-based soccer robot system is proposed, in which vision will identify the position and heading angle of each robot, and the position of the ball. With these imaging data, values for the defense factor, the competition factor, and the angle factor, are obtained. Using the three factors as the input variables of the proposed action selection mechanism, which is expressed in terms of fuzzy rules, the action that each robot should take is then chosen from the five basic actions available for the robots. In this manner, each robot may intercept, shoot, block, sweep the ball, or just stand by. After determining the action of each robot, control commands generated by the host computer are sent to the robot directly through a wireless RS-232. To show the feasibility of the proposed method, experimental results of a robot soccer game will be used for illustration.
Fundamental frequency estimation of voice of patients with laryngeal disorders
Authors: Petar Mitev, Stefan Hadjitodorov
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

The present paper is aimed at the development of new methods of fundamental frequency determination of voiced signal, uttered by patients with severe laryngeal disorders due to various diseases. The necessity to seek new methods is set by the increasing use of acoustic voice analysis as non-invasive technique for supporting diagnosis in laryngeal pathology. The classic methods, which do not take into account the peculiarities of the pathological voice, do not lead to satisfactory results in case of severely distorted periodicity of the signal. Three new methods are proposed in this paper for fundamental frequency determination: autocorrelation method, spectral method, and cepstral method. Comparison with the most commonly used methods is made.
A knowledge-based system for the conceptual design of grippers for handling fabrics
Authors: V. C. Moulianitis, A. J. Dentsoras, N. A. Aspragathos
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

The paper presents a knowledge-based system (KBS) for the conceptual design of grippers for handling fabrics. Its main purpose is the integration of the domain knowledge in a single system for the systematic design of this type of grippers. The knowledge presented, in terms of gripper, material and handling process, are classified. The reasoning strategy is based upon a combination of a depth-first search method and a heuristic method. The heuristic search method finds a final solution from a given set of feasible solutions and can synthesize new solutions to accomplish the required specifications. Details of the main features of the system are given, including its ability to take critical design decisions according to four criteria, weighted by the designer. The knowledge-based system was implemented in the Kappa P. C. 2.3.2 environment. Two examples are given to illustrate some critical aspects concerning the KBS development, to explain the operation of the proposed searching heuristic method, and to show its effectiveness in producing design concepts for grippers.
Formal types and their application to dynamic arrays in PASCAL
Authors: Sergei Pokrovsky
Venue: ACM SIGPLAN Notices (1976)

The <u>formal type</u> concept is presented as a means to uniformly introduce in the PASCAL language the dynamic array facility (which may be done as a pure extention) and formal procedure [4] specifications (which would require some changes in the standard language [1]).
Project-Based, Asynchronous Collaborative Learning
Authors: William Hafner, Timothy J. Ellis
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

The value of collaboration as a tool to promote learning is becoming increasingly more evident. Students engaged in collaborative efforts typically retain the information being learned longer by becoming more actively engaged in the learning activity. There is evidence that collaborative activities foster higher-order thinking skills such as analytical reasoning, synthesis, and evaluation. Furthermore, students work in an environment that better prepares them to meet the challenges inherent in succeeding in the workforce.Constructivism in the form or project-based learning has likewise been shown to foster increased retention of material and greater depth of learning. When combined with collaborative assignments, students have demonstrated greater retention and enhanced capability of transferring concepts to practice.Promoting collaboration in a classroom setting is difficult and often resisted by both teachers and students. This difficulty is magnified for courses offered in an online learning environment. Although there are a number of applications available to enable real-time communication, the immediacy and intimacy of person-to-person interaction is difficult to replace. The non-verbal cues that comprise a large part of everyday communication are largely lost through even the richest online environment. As a result, educators are faced with a dilemma: both students and academic institutions are flocking towards courses offered via an asynchronous learning network, but there is no clear understanding of how to foster collaboration, one of the most promising pedagogical tools.Although asynchronous online environments certainly lack the intimacy and immediacy inherent in face-to-face settings and simulated to an extent by synchronous applications,meaningful collaborative assignments are still possible. The proposed paper will detail a five-step systems approach for fostering project-based, collaborative learning in an asynchronous learning environment. The steps will be illustrated with examples from a graduate-level course in multimedia systems in which asynchronous collaboration was a featured assignment.
Yield Modeling and Analysis of a Clockless Asynchronous Wave Pipeline with Pulse Faults
Authors: T. Feng, Y. B. Kim, V. Piuri
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper proposes a new fault model and its modeling and analysis methods in a clocklessasynchronous wave pipeline for extensive yield evaluation and assurance. It is highly desirable to have an adequate and speci.c pulse fault rate model for establishing a sound theoretical foundation for clockless wave pipeline design for reliability. The pulse fault model is thoroughly identified as the unique fault specifically in the clockless wave pipeline in comparison with conventional wave and wave delay faults. The pulse fault rate is statistically yet practically modeled, and extensively evaluated with respect to various design parameters, such as yield, fault coverage, defect-level, and request level length. An extensive numerical simulation is conducted to demonstrate the effect of the proposed pulse fault on the yield.
Documents similarity measurement using field association terms
Authors: El-Sayed Atlam, M. Fuketa, K. Morita, Jun-ichi Aoe
Venue: Information Processing and Management: an International Journal (2003)

Conventional approaches to text analysis and information retrieval which measured document similarity by using considering all of the information in texts are a relatively inefficiency for processing large text collections in heterogeneous subject areas. This paper outlined a new text manipulation system FA-Sim that is useful for retrieving information in large heterogeneous texts and for recognizing content similarity in text excerpts. FA-Sim is based on flexible text matching procedures carried out in various contexts and various field ranks. FA-Sim measures texts similarity by using specific field association (FA) terms instead of by comparing all text information. Similarity between texts is faster and higher by using FA-Sim than other two analysis methods. Therefore, Recall and Precision significantly improved by 39% and 37% over these two traditional methods.
Probabilistic top-down parsing and language modeling
Authors: Brian Roark
Venue: Computational Linguistics (2001)

This paper describes the functioning of a broad-coverage probabilistic top-down parser, and its application to the problem of language modeling for speech recognition. The paper first introduces key notions in language modeling and probabilistic parsing, and briefly reviews some previous approaches to using syntactic structure for language modeling. A lexicalized probabilistic top-down parser is then presented, which performs very well, in terms of both the accuracy of returned parses and the efficiency with which they are found, relative to the best broad-coverage statistical parsers. A new language model that utilizes probabilistic top-down parsing is then outlined, and empirical results show that it improves upon previous work in test corpus perplexity. Interpolation with a trigram model yields an exceptional improvement relative to the improvement observed by other models, demonstrating the degree to which the information captured by our parsing model is orthogonal to that captured by a trigram model. A small recognition experiment also demonstrates the utility of the model.
Estimating Computation Times in Data Intensive E-Services
Authors: Shonali Krishnaswamy, Arkady Zaslasvky, Seng Wai Loke
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Apriori estimation of quality of service (QoS) levels is a significant issue in e-services since Service Level Agreements (SLAs) need to specify and adhere to such estimates. Response time is an important metric for data intensive e-services such as data mining, data analysis and querying/information retrieval from large databases where the focus is on the time taken to present results to clients. A key component of response time in such data intensive services is the time taken to perform the computation, namely, the time taken to perform either data mining, analysis or retrieval. In this paper we present a novel approach for accurately estimating the computation times of data intensive e-services.
Optimal Cluster Preserving Embedding of Nonmetric Proximity Data
Authors: Volker Roth, Julian Laub, Motoaki Kawanabe, Joachim M. Buhmann
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Abstract--For several major applications of data analysis, objects are often not represented as feature vectors in a vector space, but rather by a matrix gathering pairwise proximities. Such pairwise data often violates metricity and, therefore, cannot be naturally embedded in a vector space. Concerning the problem of unsupervised structure detection or clustering, in this paper, a new embedding method for pairwise data into Euclidean vector spaces is introduced. We show that all clustering methods, which are invariant under additive shifts of the pairwise proximities, can be reformulated as grouping problems in Euclidian spaces. The most prominent property of this constant shift embedding framework is the complete preservation of the cluster structure in the embedding space. Restating pairwise clustering problems in vector spaces has several important consequences, such as the statistical description of the clusters by way of cluster prototypes, the generic extension of the grouping procedure to a discriminative prediction rule, and the applicability of standard preprocessing methods like denoising or dimensionality reduction.
Online gaming applications
Authors: Kenneth Austin
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

Browser-based online game development has reached a point where exciting and innovative titles can be produced and distributed to a large audience quickly and easily. With the advent of Macromedia Flash MX, and the penetration of the Flash 5 plug-in, browser-based gaming shows the promise of vast possibilities such as further exploring abandoned gameplay models and enhancing them with online multiplayer features.
Z4: a new depth-size optimal parallel prefix circuit with small depth
Authors: Yen-Chun Lin, Jian-Nan Chen
Venue: Neural, Parallel Scientific Computations (2003)

Parallel prefix algorithms for the combinational circuit model are called parallel prefix circuits. An n-input prefix circuit with depth d and size s is depth-size optimal if d + s = 2n - 2. Smaller depth implies faster computation, while smaller size implies less power consumption, smaller VLSI area, and less cost. The fan-out of a prefix circuit should not be large for it to be of practical use. In this paper, we present a new depthsize optimal parallel prefix circuit, named Z4, with small depth and fan-out 4. For most values of n, there are no earlier depth-size optimal prefix circuits with bounded fan-out that have a depth less than that of Z4.
Systems analysis with workflow modeling
Authors: Vincent C. Yen
Venue: Technologies & methodologies for evaluating information technology in business (2003)

Workflow modeling has received more attention in recent years since the publication of standards by the Workflow Management Coalition in 1995. In this chapter, we give a brief introduction to what workflow is and then discuss how workflow analysis may help facilitate standard analysis methodologies such as traditional analysis and the object-oriented analysis. An example is given to illustrate the usefulness of the workflow modeling as an added system analysis tool.
Aligning IS research and practice: a research agenda for virtual work
Authors: France Bélanger, Mary Beth Watson-Manheim, Dianne H. Jordan
Venue: Advanced topics in information resources management (2003)

Recent advances in information technologies have led organizations to diversify their organizational structures. One of the most prominent trends in this diversification is to conduct work in distributed or virtual environments. Distributed work alternatives are numerous, but the common characteristic that defines these alternatives is the physical separation of employees from each other and/or their organization's workplace. Several corporations have reported their efforts, successes and failures at implementing some form of distributed work. Practitioners face a number of issues when considering virtual work alternatives. However, research does not seem to successfully help in understanding and solving some of these key issues. This chapter attempts to develop a new and broader research agenda that takes into account emerging issues and concerns of practitioners, existing published work and interdisciplinary perspectives on the topic. In doing so, emerging trends in virtual work and supporting technologies are explored.
A method for the automatic generation of test suites from object models
Authors: Alessandra Cavarra, Charles Crichton, Jim Davies
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper explains how object models written in the Unified Modeling Language (UML) can be translated into formal, behavioural descriptions and used as a basis for automatic test generation. The behavioural descriptions are written in a language of communicating state machines: the Intermediate Format (IF). The translation from UML to IF is based upon an earlier formal semantics, written in the Abstract State Machine (ASM) notation. Descriptions written in IF can be automatically explored; the results of these explorations are test trees, ready for input to a variety of testing packages.
Large-scale network simulation techniques: examples of TCP and OSPF models
Authors: Garrett R. Yaun, David Bauer, Harshad L. Bhutada, Christopher D. Carothers, Murat Yuksel, Shivkumar Kalyanaraman
Venue: ACM SIGCOMM Computer Communication Review (2003)

Simulation of large-scale networks remains to be a challenge, although various network simulators are in place. In this paper, we identify fundamental issues for large-scale networks simulation, and porpose new techniques that address them. First, we exploit optimistic parallel simulation techniques to enable fast execution on inexpensive hyper-threaded, multiprocessor systems. Second, we provide a compact, light-weight implementation framework that greatly reduces the amount of state required to simulate large-scale network models. Based on the proposed techniques, we provide sample simulation models for two networking protocols: TCP and OSPF. We implement these models in a simulation environment ROSSNet, which is an extension to the previously developed optimistic simulator ROSS. We perform validation experoments for TCP and OSPF and present performance reuslts of our techniques by simulating OSPF and TCP on a large and realistic topology, such as AT&T's US network based on rocketfuel data. The end result of these innovations is that we are able to simulate million node network tolopgies using inexpensive commercial off-the-shelf hyper-threaded multiprocessor systems consuming less than 1.4 GB of RAM in total.