ppxscal/embedding_network huggingface dataset:
Panel - Domain Analysis: From Tar Pit Extraction to Object Mania?
Authors: Steven Fraser, Spencer Peterson, Douglas Schmidt, Mark Simos, Will Tracz, Nathan Zalman
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Domain Analysis has been researched, debated, and applied for fifteen years. There are many documented methods available. The collective heritage of these methods covers the spectrum from the procedurally-oriented to the object-oriented paradigms. Application focus includes re-engineering (tar pit extraction?), requirements engineering, organizational learning, reuse, class/object identification, and design pattern identification (object mania?). This panel brings together perspectives on domain analysis by five practitioner methodologists. Diverse experiences including technology insertion, stakeholder analysis, and team techniques are represented. The intent is to focus on the application of domain analysis methods. The objective of the panel is to share the experiences of the participants (both panelists and audience) and to offer practical advice.
Distortion viewing techniques for 3-dimensional data
Authors: M. Sheelagh T. Carpendale, T. Carpendale, D. J. Cowperthwaite, F. D. Fracchia
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

As the use of 3D information presentation becomes more prevalent, the need for effective viewing tools grows accordingly. Much work has been done in developing tools for 2D spaces which allow for detail in context views. We examine the extension of such 2D methods to 3D and explore the limitations encountered in accessing internal regions of the data with these methods. We then describe a novel solution to this problem of internal access with the introduction of a distortion function which creates a clear line of sight to the focus revealing sections previously obscured. The distortion is symmetric about the line of sight and is smoothly integrated back into the original 3D layout.
Systems assurance for the integrated control and communications system for KCRC east rail extensions
Authors: Alena Griffiths, Dennis Yim
Venue: Proceedings of the seventh Australian workshop conference on Safety critical systems and software 2002 - Volume 15 (2003)

The Kowloon Canton Railway Corporation (KCRC) in Hong Kong has embarked upon extensions to the East Rail Line that include:- (i) extensions south to East Tsim Sha Tsui station; (ii) a new Rail Line out to Ma On Shan; and, (iii) the development of a spur line in the northwest to Lok Ma Chau. As part of these extensions the existing Integrated Control and Communications System (ICCS), in use on the East Rail, is to be upgraded and extended to cover the new extended railway. The upgrades include provision of additional hardware, new communications infrastructure, additional system configuration and some new software functionality. The original ICCS was commissioned in 1998. It was engineered to SIL 2 pursuant to draft British Standard RIA 23, with additional requirements per the systems assurance regime in force at KCRC during the period 1993-1998. Since that time, standards have matured and KCRC's own internal systems assurance processes have also evolved. The ICCS upgrade is required to be compliant to Cenelec Standard EN 50128, and also to a new set of internal systems assurance requirements. The challenge on this project is to maximise re-use of existing systems assurance collateral while still ensuring functional coverage of the new system, and compliance to the new requirements. This paper describes the ICCS upgrade project and the systems assurance program employed on that project. The regulatory framework is described, as are some of the internal systems assurance requirements imposed by KCRC. At time of presentation, the project has just completed Final Design Review and the first stage of the Operational Safety Report is in preparation.
Design It Yourself Web Sites: A Step by Step Guide
Authors: Avi Itzkovitch, Adam Till
Venue:  (2003)

:This is not a design theory book -- it is a design instruction book. Now, Design-It-Yourself: Web Sites makes it possible for professionals with no design background to easily and inexpensively create Web sites customized to their company's unique needs. This step-by-step guide is the first to go beyond the nuts and bolts of Web design to provide the actual templates and tools for creating a killer site. The first part of the book walks the reader through the entire process, from setting goals to planning, designing, and testing the site. Valuable features and sidebars help answer critical questions along the way, such as what kind of site, how much interactivity, and what type of technology works best for a specific business. The second half of the book deconstructs 25 finished projects and provides user-friendly templates for getting sites up and running quickly. Whether readers want to create a simple, two-color home page or a flashy, creative e-commerce site, this foolproof guide can help anyone create an effective business Web site right from their home computer.
Performance evaluation of the fixed sequential prefetching on a bus-based multiprocessor: preliminary results
Authors: E. D. M. Ordonez
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Prefetching caches is an important technique for hiding the average latency of memory accesses by exploiting the overlap of processor computations with data accesses. Several software and hardware-based data prefetching approaches have been proposed. The main benefit of the hardware-based schemes is that they do not need support from the compiler and are transparent to the programmer. Under sequential prefetching, a cache miss causes some number of successive blocks to be prefetched. The number p of blocks following the missing block defines the degree of prefetching. The fixed sequential prefetching is the simplest form of the hardware-based prefetching techniques. In this approach, the degree of prefetching remains constant throughout the execution of the application program. Using a simple model of Petri nets for prefetching, we have obtained some results for fixed sequential prefetching on a bus-based multiprocessor. We change the degree of prefetching from 1 to 9. Our preliminary simulation results show that it is useful when the degree of prefetching has a value on the interval 1-3. Hence, fixed sequential prefetching with degree 3, offers significant performance improvements for bus-based multiprocessors.
Comparison of the worst and best sum-of-products expressions for multiple-valued functions
Authors: T. Sasao, J. T. Butler
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

Because most practical logic design algorithms produce irredundant sum-of-products (ISOP) expressions, the understanding of ISOPs is crucial. We show a class of functions for which Morreale-Minato's ISOP generation algorithm produces worst ISOPs (WSOP), ISOPs with the most product terms. We show this class has the property that the ratio of the number of products in the WSOP to the number in the minimum ISOP (MSOP) is arbitrarily large when the number of variables is unbounded. The ramifications of this are significant; care must be exercised in designing algorithms that produce ISOPs. We also show that 2/sup n-1/ is a firm upper bound on the number of product terms in any ISOP for switching functions on n variables, answering a question that has been open for 30 years. We show experimental data and extend our results to functions of multiple-valued variables.
Site-Seeing: A Visual Approach to Web Usability, 1 edition
Authors: Luke Wroblewski, Jennifer Gunji-Ballsrud
Venue:  (2002)

:"Usability" has become the watchword of contemporary Web design, and with good reason. But until now, books on Web usability have focused chiefly on response times, compatibility, and other technical matters, providing only limited guidance on design issues. This book takes Web usability a step further -- and shows how good visual design can make a site not just usable, but user-friendly. Using hundreds of real-world Web examples, interface expert Luke Wroblewski explains how to enhance usability by applying the principles of visual communications to site design. Good visual design, he demonstrates, can make a site's organization crystal clear -- and convey its personality or "attitude" in an instant. Offering lots of specific design recommendations for text, links, images, navigation, forms, home pages, dynamic content, and Web services, Site-Seeing delivers the insights and advice you need to boost a site's visual appeal -- and take Web usability to the next level.
Partial-Order Validation for Multi-Process Protocols Modeled as Communicating Finite State Machines
Authors: Hong Liu, Raymond E. Miller
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

In this paper, we adapt the partial order state reduction techniques developed for Petri nets and labeled transition systems to the validation ofmulti-process protocols modeled as communicating finite state machines. We identify two specific partial order reduction methods in this context: (1) maximal partial order reachability analysis, which is a generalization of maximal reachability analysis to protocols with n\ge 2 processes; and (2) simultaneous partial order reachability analysis, which is a counterpart of fair reachability analysis for protocols with n\ge 2 processes and arbitrary communication topologies. We study the logical error detection capabilities of each method and show that these two methods, when used together, provide complete logical error coverage for bounded multi-process protocols.
A Note on Inverse Document Frequency Weighting Scheme
Authors: S. K. M. Wong, Y. Y. Yao
Venue:  (1989)

Based on the Shannon information theory, a measure for term value is introduced. This study is an attempt to provide a theoretical justification for the inverse document frequency (IDF) weighting scheme. The argument presented in this paper is somewhat different from those suggested earlier. It is shown that IDF weights can be derived from the proposed approach by assuming that each index term has an even distribution within a subset of documents. A critical comment on the signal-noise ratio (S/N) weighting method is also included.
Classification Using Fuzzy Geometric Features
Authors: Vitaly V. Krivsha, Sergey A. Butenkov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The present work describes a new approach to multi-dimensional data classification or clustering. "Radar" diagrams are the well-known and most widely used data visualization technique with an ability to use in expert and man-machine systems. This paper extends our earlier work in image analysis and classification by means of fuzzy geometric features for the fuzzy classification of arbitrary data, presented as radar diagram. We develop a diagram shape matching methodology to accomplish fuzzy geometric features technique for the man-machineexpert systems.
Self-organized criticality, evolution, and extinction
Authors: M. E. J. Newman
Venue:  (1996)

Statistical analysis indicates that the fossil exctinction record is compatible with a distribution of extinction events whose frequency is related to their size by a power law with exponent tau approx. = 2. This result is in agreement with preductions based on self-organized critical models of extinction, and might well be taken as evidence for self-organizing behavior in terrestrial evolution. We argue however that there is a much simpler explanation for the appearance of a power law in terms of extinctions caused by stresses (either biotic or abiotic) to which species are subjected by their environment. We give an explicit model of this process and discuss its properties and implications for the interpretation of the fossil record.
LALM: A Logic-Aware Layout Methodology to Enhance the Noise Immunity of Domino Circuits
Authors: Yonghee Im, Kaushik Roy
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

The circuit perfor ance is increasingly affected by signal integrity as cross-talk becomes more significant with scaling down of feature sizes. Many attempts have been made to improve noise immunity, but all require the sacrifice of speed as a tradeoff. In some circuits, P/G network is used as shielding wires to avoid cross-talk while maintaining the desired speed, but the use of the network is inherently restricted by electromigration, IR drop, L \frac{{di}} {{dt}} noise,etc. We propose a novel methodology to enhance the noise immunity of domino circuits by reordering transistors as wellas interconnects based on the functionality of the circuit. To the best of our knowledge, it is the first attempt to use the functionality of a circuit for the purpose of noise immunity enhancement. The methodology, named "Logic-Aware Layout Methodology "(LALM), uses several techniques that can be used to improve the signal integrity of domino circuits. Experimental results show that LALM is simple to apply yet useful in improving the noise immunity of domino circuits.
Classification of (1,s)-geometries fully embedded in PG(n, s), for s≠ 2
Authors: Sara Cauchie
Venue: Journal of Combinatorial Theory Series A (2003)

In this paper (1, s)-geometries fully embedded in PG(n, s), for s≠2, are classified. Every proper (1, s)-geometry fully embedded in PG(n, s), for s≠2 has points the points of a cone II[n - r - 1]GQ that are not contained in the vertex II[n - r - 1], where GQ is a generalized quadrangle fully embedded in an r-dimensional subspace of PG(n, s) that is skew to π[n - r - 1], and its lines are the lines that lie on this cone and that contain s + 1 points of the (1, s)-geometry.
The recognition problem for line bigraphs
Authors: Erich Prisner
Venue: Discrete Mathematics (2003)

Given are two graphs H1 = (V, E1) and H2 = (V, E2) on the same vertex set. The line bigraph is the bipartite graph with the disjoint union of E1 and E2 as vertex set, and an edge between e1 ∈ E1 and e2 ∈ E2 if the edges have some common vertex in V. We first show that the problem to determine whether a given bipartite graph is the line bigraph of two such graphs is NP-complete. We then present two special cases where the question can be solved in polynomial time. A C4-free bipartite graph is a line bigraph if and only if each component of the graph obtained by removing all degree-2 vertices has at most one cycle. Using the intersection multigraph of the set of all large bicliques, we then show that there is an efficient recognition algorithm for recognizing line bigraphs of two graphs both having minimum degree at least 3.
Unfaithful Population Decoding
Authors: Si Wu, Danmei Chen, Shun-ichi Amari
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Unfaithful population decoding is a paradigm of the maximum likelihood inference based on a model, which is not feasible to describe the encoding process (UMLI) (Wu et al., 1999). The present paper studies the performance of UMLI, through investigating an unfaithful decoding model, which neglects the multiplicative correlation between neural activities. It shows that UMLI is a good compromise between computational complexity and decoding accuracy.
Stochasticks: Augmenting the Billiards Experience with Probabilistic Vision and Wearable Computers
Authors: Tony Jebara, Cyrus Eyster, Josh Weaver, Thad Starner, Alex Pentland
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

We propose a practical application of wearable computing and augmented reality which enhances the game of billiards. A vision algorithm is implemented which operates in interactive-time with the user to assist planning and aiming. Probabilistic color models and symmetry operations are used to localize the table, pockets and balls through a video camera near the user's eye. Classification of the objects of interest is performed and each possible shot is ranked in order to determine its relative usefulness. The system allows the user to proceed through a regular pool game while it automatically determines strategic shots. The resulting trajectories are rendered as graphical overlays on a head mounted live video display. The wearable video output and the computer vision system provide an integration of real and virtual environments which enhances the experience of playing and learning the game of billiards without encumbering the player.
On flexible support for mobile objects
Authors: W. Joosen, F. Matthijs, J. Van Oeyen, B. Robben, S. Bijnens, P. Verbaeten
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

CORRELATE is a concurrent object-oriented language with a flexible run time system that enables the instantiation of application specific run time objects. We have exploited this capability in the development of mobile agents for large scale distributed computing systems, such as the Internet. We discuss some key elements of the run time system. We illustrate how the system architecture supports mobile objects, we discuss what it requires from the operating system and how we aim at evolving towards more flexibility.
Performance Analysis of MAC Protocols for Wireless Control Area Network
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This paper presents the performance analysis of the Wireless Medium Access Control (WMAC) protocol and the Remote Frame Medium Access Control (RFMAC) protocol for a Wireless Control Area Network (WCAN). These two MAC protocols are suggested for distributed and centralised wireless communications respectively, as part of the complete WCAN project. The performances of the protocols are evaluated by simulating the models of the protocols using set of signals called the SAE Benchmark. The Benchmark table provides an example to illustrate the application of Control Area Network (CAN) system. This paper discusses the applicability of the wireless MAC protocols and validates its usefulness for real-time communications based on the parameters in the Benchmark table.
Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization
Authors: Endre Boros, Peter L. Hammer, Michel Minoux, David Rader
Venue:  (1998)

Cell flipping in VLSI design is an operation in which some of the cells are replaced with their ``mirror images'''' with respect to a vertical axis, while keeping them in the same slot. After the placement of all the cells, one can apply cell flipping in order to further decrease the total area, approximating this objective by minimizing total wire length, channel width, etc. However, finding an optimal set of cells to be flipped is usually a difficult problem. In this paper we show that cell flipping can be efficiently applied to minimize channel density in the standard cell technology. We show that an optimal flipping pattern can be found in $O(p(\frac{n}{c})^{c})$ time, where $n$, $p$ and $c$ denote the number of nets, pins and channels, respectively. Moreover, in the one channel case (i.e. when $c=1$) the cell flipping problem can be solved in $O(p\log n)$ time. For the multi-channel case we present both an exact enumeration scheme and a mixed-integer program that generates an approximate solution very quickly. We present computational results on examples up to 139 channels and 65 000 cells.
SAGA -- Syntax Analyzer Generator for Agents
Authors: Anders Andersson
Venue:  (1995)

LALR(1) parser generators in conjunction with imperative programming languages is the standard solution for parsing applications. Contrary to popular belief, this situation is not entirely satisfactory. With imperative tools like Yacc, it is difficult to add actions to a grammar without introducing conflicts. Also, LALR(1) is not powerful enough to meet the needs of languages like C++. We argue that LALR(1) parsing in conjuction with concurrent constraint programming is an interesting option that solves the former problem. We also show how deep guards and don''t-know non-determinism can be exploited to solve the latter problem. These ideas have been incorporated in the Saga parser generator described in this report. Saga is an integrated generator for lexical analyzers and parsers. It is based on AKL, a multiparadigm programming language based on a concurrent constraint framework. It is intended both as a research tool to demonstrate the power offered by concurrent constraints, and as a practical tool for the Agents programming system. As a practical tool, Saga features many improvements over tools like Yacc. For example, Saga offers powerful syntax, elegant reporting and resolution of conflicts and powerful error handling in the generated syntax analyzers.
Submicron Systems Architecture Project
Authors: Jakov N. Seizovic
Venue:  (1993)

No abstract available.
On the Application of Syntactic Methodologies in Automatic Text Analysis
Authors: Gerard Salton, Maria Smith
Venue:  (1988)

This study summarizes various linguistic approaches proposed for document analysis in information retrieval environments. Included are standard syntactic methods to generate complex content identifiers, and the use of semantic know-how obtained from machine-readable dictionaries and from specially constructed knowledge bases. A particular syntactic analysis methodology is also outlined and its usefulness for the automatic construction of book indexes is examined.
Working Set in Channel Management for Cellular Networks
Authors: Haihong Zheng, Sourav Bhattacharya
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Channel resource management (e.g., allocation and borrowing) is a critical aspect of wireless cellular networks. Since channel borrowing is an expensive task, incuring long delay, a key design goal of efficient channel resource management is to minimize the total number of channel borrowing operations. This paper focuses on the `Quantum' issue (number of channels) in the channel borrowing and releasing steps. The proposed concept employs the Working Set approach, popular in Operating Systems, into channel resource management, where the quantum of channels transacted during each borrowing and release operation reaches a middle point and would not be too small or too large. An analytical model and steady-state simulation have been used to demonstrate the benefits.
A Distributed Approach to Computer Virus Detection and Neutralization by Autonomous and Heterogeneous Agents
Authors: Takeshi Okamoto, Yoshiteru Ishida
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Recent expansion of the computer network opened a possibility of explosive spread of computer viruses. We propose a distributed approach against computer virus using also the computer network that allows distributed and agent-based approach. Our anti-virus system consists of several heterogeneous agents similarly to the immune system. Among these agents, antibody agents use the information of self (files of host computer) rather than the information of non-self (computer viruses). After detection and neutralization of computer viruses, the anti-virus system tries to recover original files that are distributed over the uninfected hosts connected by LAN. This recovery is also done by several heterogeneous agents. As a whole, the proposed anti-virus system can be regarded a backup system with computer network. We implemented the antivirus system with JAVA, and tested against some existing viruses.