ppxscal/embedding_network huggingface dataset:
Communication Aspects of the Star Graph Interconnection Network
Authors: J. Misic, Z. Jovanovic
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Basic communication algorithms for star graph interconnection networks are developed by using the hierarchical properties of the star graph, with the assumption that one inputchannel can drive only one output communication channel at a time. With this constraint,communication algorithms for each node can be expressed only as sequences ofgenerators corresponding to the communication channels. Sequences that are identicalexploit the symmetry and hierarchical properties of the star graph and can be easilyintegrated in communication hardware. Their time complexities are evaluated andcompared with the corresponding results for the hypercube.
Web-Based Agile Software Development
Authors: Mikio Aoyama
Venue: IEEE Software (1998)

The pressure to be first to market with a new product has accelerated the development process. Today's process models require agility, defined as the ability to operate in real time and to adapt quickly to changing requirements and conditions. Further, the global, distributed nature of many projects-often developed now over the Internet and intranets--demands flexible, integrated tools. The author's Web-based Agile Software Engineering Environment answers these challenges with a time-based life cycle that provides just-in-time process management.
Internet Privacy and Security: A Startup's Perspective Information Dynamics in the Networked Society, April 4&ndash;5, 2002
Authors: Stephen Hsu
Venue: Information Systems Frontiers (2003)

SafeWeb, a venture-backed startup founded by a team of physics PhDs, created an Internet privacy service which was used by millions of people worldwide. Despite widespread adoption, its advertising-based business model proved unsupportable, and the service was discontinued in late 2001. SafeWeb's main product now is a hardware device based on its core technology (the Secure Extranet Appliance), which is used by enterprise security customers such as corporations and government agencies. I discuss my experiences as co-founder of SafeWeb, and topics such as the Internet in China and the future of privacy in the information age.
Trusting Mobile User Devices and Security Modules
Authors: Andreas Pfitzmann, Birgit Pfitzmann, Matthias Schunter, Michael Waidner
Venue: Computer (1997)

The market for devices like mobile phones, multifunctional watches, and personal digital assistants is growing rapidly. Most of these mobile user devices need security for their prospective electronic commerce applications. While new technology has simplified many business and personal transactions, it has also opened the door to high-tech crime. In this article, we investigate design options for mobile user devices that are used in legally significant applications. Such applications authorize transactions: mobile phone calls, access to an office or car, electronic payment in stores, retrieval of stored medical data, and access to information on portable computers. Digital signatures-the electronic equivalent of handwritten signatures-are at the core of most of these applications and are explained briefly in the "Digital Signatures" sidebar. A trustworthy mobile user device should suit its purpose well and have credible quality. Because mobile user devices act on someone's behalf, we use the analogy of agents to describe approaches to security. There are three types of agent trustworthiness: Personal-agent trust. Here, the device must act according to the user's wishes while it is in the user's hands. For example, it should not sign unintended statements or unintentionally delete electronic money. Captured-agent trust. In this case, the user is protected even if the mobile user device is lost, stolen, or given away (inserted into a point-of-sale terminal or sent away for maintenance). For example, the finder or thief should not be able to sign statements in the legitimate user's name. Undercover-agent trust. In this case the mobile user devices will protect a third party from the device's legitimate user. For example, in prepaid offline payment systems users have so-called "electronic cash" in their mobile user devices, which they can use without connecting to a bank. The bank wants the mobile user device to prevent its legitimate user from "spending" the same bit string in several shops. Contrary to popular belief, undercover-agent trust is not needed in many applications, including online payment systems and general signature applications. A mobile user device by itself may not be able to keep data secret or uncorrupted-it may not be tamper-resistant. A tamper-resistant device is called a security module, whether the security mechanism is on a separate device or incorporated into the mobile user device itself. Such devices secure "mobile" applications and applications on stationary devices like PCs and public kiosks, if all security-relevant actions are controlled via the trustworthy mobile device.
Compiler Challenges with RISCs
Authors: Thomas J. Pennello
Venue: IEEE Micro (1990)

It is argued that despite the simplified instruction sets of reduced instruction-set computers (RISCs), designing their compilers is not so simple. This viewpoint is substantiated by considering a subproblem that arises in designing a calling sequence, namely, how to pass arguments to a procedure. A constraint of the solution is that the ubiquitous print function printf (from the C programming language) has to work. The problem (called the variable-arguments, or varargs, problem) is defined, and solutions are shown for complex-instruction-set computers (CISCs) and two RISCs, the IBM RT PC and the Intel i860.
Sort vs. Hash Revisited
Authors: G. Graefe, A. Linville, L. D. Shapiro
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine.
Symmetry Identification of a 3-D Object Represented by Octree
Authors: P. Minovic, S. Ishikawa, K. Kato
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

An algorithm for identifying symmetry of a 3-D object given by its octree is presented, and the symmetry degree (a measure of object symmetry) is proposed. The algorithm is based on traversals of the octree obtained by the principal axis transform of an input octree. An object can be in an arbitrary position and with arbitrary orientation within the octree space, and a wide range of symmetries represented by groups of proper and improper rotations can be identified. It is shown that the octree data structure supports these operations well, especially for objects whose symmetry types are simpler or equal in complexity with a fourfold rotational symmetry. The operation of the algorithm is illustrated using some synthetic test objects. The results, which are composed of identified symmetry types and the corresponding symmetry degrees, were satisfactory.
Awareness of presence, instant messaging and WebWho
Authors: Peter Ljungstrand, Ylva Hård af Segerstad
Venue: ACM SIGGROUP Bulletin (2000)

We report from a study of how awareness of presence can affect instant messaging behavior. WebWho is a web based awareness system that visualizes where people are located in a large university computer lab. It allows students to virtually locate one another and, among other functions, to communicate via an instant messaging system. Typically, instant messages are signed with the sender's name, but messages can also be sent anonymously. The students use the messaging system to support collaborative work and coordinate social activities, as well as for playful behavior. We have performed analyses of messages logs with respect to sender location, anonymous or not, and message content. Results show that awareness of both physical presence, i.e. when both when sender and recipient share the same room, and virtual presence, mediated via WebWho, affect the message contents.
Geometric verification of swirling features in flow fields
Authors: Ming Jiang, Raghu Machiraju, David Thompson
Venue: Proceedings of the conference on Visualization '02 (2002)

In this paper, we present a verification algorithm for swirling features in flow fields, based on the geometry of streamlines. The features of interest in this case are vortices. Without a formal definition, existing detection algorithms lack the ability to accurately identify these features, and the current method for verifying the accuracy of their results is by human visual inspection. Our verification algorithm addresses this issue by automating the visual inspection process. It is based on identifying the swirling streamlines that surround the candidate vortex cores. We apply our algorithm to both numerically simulated and procedurally generated datasets to illustrate the efficacy of our approach.
Resonance graphs of catacondensed even ring systems are median
Authors: Sandi Klavzar, Petra Zigert, Gunnar Brinkmann
Venue: Discrete Mathematics (2002)

Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric difference is a bounded face of G. For a class of graphs containing the chemically important catacondensed benzenoid graphs we show that the resonance graphs are median. In particular, if G belongs to this class, R(G) has an isometric embedding into Qf, where f is the number of bounded faces of G.
A Digital Library for Geographically Referenced Materials
Authors: Terence R. Smith
Venue: Computer (1996)

Presently, maps, aerial photos, and other material referenced in geographic terms, such as by the names of communities that appear in the material, are largely inaccessible. Much of the information is only on paper or film, and can be found only in major research libraries. There is a need to make such material more widely available. The goal of the Alexandria Project, which is based at the University of California at Santa Barbara, is to build a distributed digital library for geographically referenced material from throughout the world. The Alexandria Digital Library is scheduled to be made available to the public in July 1996. At that time, Internet users will be able to access and extract information from the ADL's large collection. To accomplish its goal, ADL will provide user interfaces and on-line catalogs that support the formulation and evaluation of geographically constrained queries. In addition, multiple interfaces will accommodate users with different needs. Government agencies, schools, corporations, and individuals will find ADL useful. They will be able to look up and download the information they need. Meanwhile, the Alexandria Project's staff plans to update and expand the digital library's collection.
Delaying Commitment
Authors: Harold Thimbleby
Venue: IEEE Software (1988)

A programming strategy of delaying design commitment is advocated. It is argued that such an approach retains flexibility and provides an opportunity for new insights and creative design further on in the process. In the context of programming, delaying commitment corresponds to lazy evaluation. Tactics for delaying commitment are discussed.
Dataflow Architectures and Multithreading
Authors: Ben Lee, A. R. Hurson
Venue: Computer (1994)

Contrary to initial expectations, implementing dataflow computers has presented a monumental challenge. Now, however, multithreading offers a viable alternative for building hybrid architectures that exploit parallelism. The eventual success of dataflow computers will depend on their programmability. Traditionally, they've been programmed in languages such as Id and SISAL (Streams and Iterations in a Single Assignment Language) that use functional semantics. These languages reveal high levels of concurrency and translate on to dataflow machines and conventional parallel machines via the Threaded Abstract Machine (TAM). However, because their syntax and semantics differ from the imperative counterparts such as Fortran and C, they have been slow to gain acceptance in the programming community. An alternative is to explore the use of established imperative languages to program dataflow machines. However, the difficulty will be analyzing data dependencies and extracting parallelism from source code that contains side effects. Therefore, more research is still needed to develop compilers for conventional languages that can produce parallel code comparable to that of parallel functional languages.
Geospatial IT for mobile field data collection
Authors: Sarah Nusser, Leslie Miller, Keith Clarke, Michael Goodchild
Venue: Communications of the ACM (2003)

Federal statistical agencies generate critical data about the nation's population, economy, and natural resources. This data is gathered largely by mobile field data collection. Although geospatial information is an essential reference material in the field and serves as a base for recording spatially linked data, it is nearly always used in printed form due to limitations in mobile computing systems and tools for handling geospatial data. The ability to interact with digital geospatial data in the field offers significant enhancements for data quality and operational efficiencies. However, basic research is needed on extensible infrastructure designs for limited field computing environments and appropriate field tools for mobile data gatherers.
Prefetching in File Systems for MIMD Multiprocessors
Authors: D. F. Kotz, C. S. Ellis
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

The question of whether prefetching blocks on the file into the block cache can effectively reduce overall execution time of a parallel computation, even under favorable assumptions, is considered. Experiments have been conducted with an interleaved filesystem testbed on the Butterfly Plus multiprocessor. Results of these experiments suggest that (1) the hit ratio, the accepted measure in traditional caching studies, may not be an adequate measure of performance when the workload consists of parallelcomputations and parallel file access patterns, (2) caching with prefetching can significantly improve the hit ratio and the average time to perform an I/O (input/output) operation, and (3) an improvement in overall execution time has been observed in mostcases. In spite of these gains, prefetching sometimes results in increased execution times (a negative result, given the optimistic nature of the study). The authors explore why it is not trivial to translate savings on individual I/O requests into consistently better overall performance and identify the key problems that need to be addressed in order to improve the potential of prefetching techniques in the environment.
Quantum States of Monodromy Groups
Authors: V. P. Kostov
Venue: Journal of Dynamical and Control Systems (1999)

Any irreducible finitely generated matrix group (with generators M1,&hellip;,Mp+1 satisfying the only relation M1&hellip;Mp+1 &equals; I) is the monodromy group of some fuchsian linear system on Riemann's sphere. The eigenvalues of the matrices Mj define &lambda;k,j, the eigenvalues of the matrices-residues of the system only up to integers. There are always infinitely many possible choices of &lambda;k,j, a priori they must satisfy the only condition that their sum is 0. However, not always all a priori possible choices can be made. Some of them can be impossible due to the positions of the poles.Consider the a priori possible choices when the eigenvalues of only one matrix-residuum change (we presume that its pole is at 0). We show that infinitely many a priori possible choices are impossible if and only if the fuchsian system is obtained from another fuchsian system with a smaller number of poles and with a pole at 0 by the change of time t\mapsto t^k / (p_kt^k+p_{k-1}t^{k-1}+\ldots + p_0), p_i \in {\Bbb C}, p_0 \neq 0, k > 1. The result is applied to the Riemann&ndash;Hilbert problem.
Geometrical Learning Algorithm for Multilayer Neural Networks in a Binary Field
Authors: S. K. Park, J. H. Kim
Venue: IEEE Transactions on Computers (1993)

A geometrical expansion learning algorithm for multilayer neural networks using unipolar binary neurons with integer connection weights, which guarantees convergence for any Boolean function, is introduced. Neurons in the hidden layer develop as necessary without supervision. In addition, the computational amount is much less than that of the backpropagation algorithm.
Improving C++ Performance Using Temporaries
Authors: Adair Dingle, Thomas H. Hildebrandt
Venue: Computer (1998)

Object-oriented programs are simpler to implement and maintain than those using traditional programming methods. At the same time, object-oriented programs create and destroy objects, incurring overhead costs. They also cause unnamed temporary objects of the same type to be created in the scope of the calling routine. Both of these factors affect the performance of object-oriented pro grams compared to procedural programs. For these reasons, programmers view object-oriented programming as wasteful compared to procedural programming. When runtime efficiency is important, developers have a legitimate reason to reject OOP. In this article, the authors propose to improve the efficiency of the underlying implementation by reusing temporaries. They report experimental results showing large speedups using this method.
Approximate Invariance and Differential Inclusions in Hilbert Spaces
Authors: F. H. Clarke, Yu. S. Ledyaev, M. L. Radulescu
Venue: Journal of Dynamical and Control Systems (1997)

Consider a mapping F from a Hilbert space H to the subsets of H, which is upper semicontinuous/Lipschitz, has nonconvex, noncompact values, and satisfies a linear growth condition. We give the first necessary and sufficient conditions in this general setting for a subset S of H to be approximately weakly/strongly invariant with respect to approximate solutions of the differential inclusion \dot{x}(t) \in F(x). The conditions are given in terms of the lower/upper Hamiltonians corresponding to F and involve nonsmooth analysis elements and techniques. The concept of approximate invariance generalizes the well-known concept of invariance and in turn relies on the notion of an &epsi;-trajectory corresponding to a differential inclusion.
A Constrained Approach to Multifont Chinese Character Recognition
Authors: X. Huang, J. Gu, Y. Wu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The constraint graph is introduced as a general character representation framework for recognizing multifont, multiple-size Chinese characters. Each character class is described by a constraint graph model. Sampling points on a character skeleton are taken as nodes in the graph. Connection constraints and position constraints are taken as arcs in the graph. For patterns of the same character class, the model captures both the topological invariance and the geometrical invariance in a general and uniform way. Character recognition is then formulated as a constraint-based optimization problem. A cooperative relaxation matching algorithm that solves this optimization problem is developed. A practical optical character recognition (OCR) system that is able to recognize multifont, multiple-size Chinese characters with a satisfactory performance was implemented.
Correction to "Line (Block) Size Choice for CPU Cache Memories"
Authors: A. J. Smith
Venue: IEEE Transactions on Computers (1989)

No abstract availavle.
An Overview of the Arjuna Distributed Programming System
Authors: Santosh K. Shrivastava, Graeme N. Dixon, Graham D. Parrington
Venue: IEEE Software (1991)

The use of the objects and actions computational model to develop Arjuna is discussed, and its system architecture is described. An overview of Arjuna's implementation is given. An example is provided to show how to construct Arjuna applications.
Why RTL ATPG?
Authors: Min Yinghua
Venue: Journal of Computer Science and Technology (2002)

Register Transfer Level (RTL) Automatic Test Pattern Generation, (ATPG) has been of wide concern for two decades. Meanwhile gate-level ATPG has made remarkable progress in dealing with large circuits. An argument is then posed. Do we need RTL ATPG in the case of gate-level ATPG capable of generating tests for large circuits? This paper attempts to answer this question. The necessity, difficulty, and major interests of RTL ATPG are reviewed.
How to Get into Your Dream College Using the Web, 1st edition
Authors: Shannon Karl, Arthur Karl
Venue:  (1998)

:How to Get Into Your Dream College Using the Web helps you determine your college needs and find a school that's right for you. You'll also discover what admissions officers around the country look for in an applicant, and learn how to position yourself to make the grade. This book is more than just a directory of colleges! It walks you through each step of the college admissions process and beyond.
Similarity and Affine Invariant Distances Between 2D Point Sets
Authors: Michael Werman, Daphna Weinshall
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We develop expressions for measuring the distance between 2D point sets, which are invariant to either 2D affine transformations or 2D similarity transformations of the sets, and assuming a known correspondence between the point sets. We discuss the image normalization to be applied to the images before their comparison so that the computed distance is symmetric with respect to the two images. We then give a general (metric) definition of the distance between images, which leads to the same expressions for the similarity and affine cases. This definition avoids ad hoc decisions about normalization. Moreover, it makes it possible to compute the distance between images under different conditions, including cases where the images are treated asymmetrically. We demonstrate these results with real and simulated images.