ppxscal/embedding_network huggingface dataset:
Normalised grid/motif based patterns-Islamic geometric patterns
Authors: A. M. Aljamali, E. Banissi
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The studies of Islamic geometric patterns (IGP) show that the methods of generation are based on a set of classical gridding systems. They are hierarchical and primarily based on the sacred geometrical primitives (triangle, square and circle). With such patterns, symmetries are as visible as the forms themselves. They signify an obvious secondary meaning that is so often referred to, in the sacred and religious texts, as a higher order of significance. Based on the classical grid system, normalised grid-based patterns propose a new language of design with the further aid of symmetry that hold these forms so robustly. It takes away their hierarchy by replacing it with less tangible forms that are bounded by shear balance of symmetries. An underlined question for the reader is "are we disturbing the semantics of these patterns, the meanings that have been portrayed by the architect, the designers and visualists for a long time through their visual forms?".
A Performability Analysis of Two Multi-Processor Systems
Authors: M R Smith, S K Trivedi
Venue:  (1986)

Multiple-processor systems can provide higher performance and higher reliability/availability than single-processor systems. In order to properly assess the effectiveness of multi-processor systems, measures that combine performance and reliability are needed. We describe the behavior of the multi-processor system as a continuous-time Markov chain and associate a reward rate (performance measure) with each state. We evaluate the distribution of performability for analytical models of two multi-processor systems using a recently developed polynomial-time algorithm that obtains the distribution of performability for non-repairable, as well as repairable, systems with heterogeneous components. The systems that we analyze are the (C.mmp) multi-processor system developed at Carnegie Mellon University and a shared-storage system proposed by researchers at the IBM Watson Research Center.
Automatic Repositioning Technique for Digital Cell Based Window Comparators and Implementation within Mixed-Signal DfT Schemes
Authors: D. De Venuto, M. J. Ohletz, B. Riccò
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

The possibility of using window comparators for theon-chip evaluation of signals in the analogue circuit parthas been demonstrated and is shortly summarised. One ofthe problems is the lot-to-lot variation of the comparatorwindow. An automatic window repositioning technique isdetailed that allows to compensate the window shift. Thecomponents for the implementation comprising a referencecomparator and the evaluation comparators are describedalong with the implementation of the technique. It is shown,that this technique allows the automatic lot conditionadjustment of the evaluation comparators. Furthermore thetechnique can provide lot specific information to anautomated test equipment that can be documented in thetest results due to its diagnosis capability.
Simple Randomized Mergesort on Parallel Disks
Authors: Rakesh Barve, Edward Grove,  F, Scott J Vitter
Venue:  (1996)

%x We consider the problem of sorting a file of N records on the D-disk model of parallel I/O in which there are two sources of parallelism. Records are transferred to and from disk concurrently in blocks of B contiguous records. In each I/O operation, up to one block can be transferred to or from each of the D disks in parallel. We propose a simple, efficient, randomized mergesort algorithm called SRM that uses a forecast-and-flush approach to overcome the inherent difficulties of simple merging on parallel disks. SRM exhibits a limited use of randomization and also has a useful deterministic version. Generalizing the technique of forecasting, our algorithm is able to read in, at any time, the %22right%22 block from any disk, and using the technique of flushing, our algorithm evicts, without any I/O overhead, just the %22right%22 blocks from memory to make space for new ones to be read in. The disk layout of SRM is such that it enjoys perfect write parallelism, avoiding fundamental inefficiencies of previous mergesort algorithms. Using a novel reduction of various maximum occupancy problems we are able to derive an analytical upper bound on SRM`s expected overhead valid for arbitrary inputs. The upper bound derived on expected I/O performance of SRM indicates that SRM is provably better than disk-striped mergesort (DSM) for realistic parameter values D, M, and B. Average-case simulations show further improvement on the analytical upper bound. SRM outperforms DSM even when the number D or parallel disks is small, something that previously proposed optimal external sorting algorithms lacked.
A Comprehensive Layout Methodology and Layout-Specific Circuit Analyses for Three-Dimensional Integrated Circuits
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

In this paper, we describe a comprehensive layout methodology for bonded three-dimensional integrated circuits (3D ICs). In bonded 3D integration technology, parts of a circuit are fabricated on different wafers, and then, the wafers are bonded with a glue layer of Cu or polymer based adhesive. Using our layout methodology, designers can layout such 3D circuits with necessary information on inter-wafer via/contact and orientation of each wafer embedded in the layout. We have implemented the layout methodology in 3DMagic. Availability of 3DMagic has led to interesting research with a wide range of layout-specific circuit analyses, from performance comparison of 2D and 3D circuits to layout-specific reliability analyses in 3D circuits. Using 3DMagic, researchers have designed and simulated an 8-bit encryption processor mapped into 2D and 3D FPGA layouts. Moreover, the layout methodology is an essential element of our ongoing research for the framework of a novel Reliability Computer Aided Design tool, ERNI-3D.
Evaluating the Use of Dominance Trees for C and COBOL
Authors: Elizabeth Burd, Malcolm Munro
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

This paper evaluates the suitability of dominance trees as a means of re-modularizing legacy systems. It uses two factors to assess the suitability of the dominance tree approach as a restructuring mechanism. Firstly, it considers if dominance tree analysis identifies suitable reuse candidates and secondly, if the candidates generated represent an improvement to the structure of the code. Applications from two domains and software written in two development languages are used to evaluate the dominance tree's suitability factors. Sequential versions of the software are used to identify specific changes that are made to the software over time, to ensure that the reuse candidates identified are supportive of software change. The results show that overall the dominance trees are useful for software re-modularization. Furthermore, the results of this study have revealed some interesting observations regarding the general characteristics of software and the process of software change.
A Database for Analyzing Sequential Behavioral Data and Their Associated Cognitive Models
Authors: Bonnie E. John
Venue:  (1994)

Sequential behavioral data, be it verbal protocols, automatically-recorded keystrokes, or complete videotape protocols, can be analyzed at different levels of detail and from different viewpoints. If raw behavioral data is stored in a powerful database, rather than a simple text file, many domains will allow some automatic interpretation of that data. In addition, the raw data can be compared with a traces of an associated computational cognitive model to assess how well the model accounts for the data and, conversely, how much support the behavioral data provides for the components of the model. This report describes a prototype database and user interface, called Trace&Transcription, that is designed to facilitate protocol analysis and cognitive modeling.
Traffic characterization and switch utilization using a deterministic bounding interval dependent traffic model
Authors: E. W. Knightly, Hui Zhang
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Compressed digital video is one of the most important types of traffic in future integrated services networks. It is difficult to support this class of traffic since, on one hand, compressed video is bursty, while on the other hand, it requires performance guarantees from the network. The common belief is that we are unlikely to achieve a high network utilization while providing performance guarantees to such bursty sources. The authors introduce a new deterministic bounding interval-dependent (D-BIND) traffic model, together with tight analysis techniques, to explore the possibility of providing deterministic performance guarantees to VBR traffic while still achieving a reasonable network utilization. The D-BIND model consists of a family of rate-interval pairs where the rate is a bounding rate over the interval length. The model captures the intuitive property that over longer interval lengths, a source may be bounded by a rate lower than its peak rate and closer to its long-term overage rate. While the D-BIND model is a general deterministic model that can be used to characterize a wide variety of sources, the authors focus on MPEG-compressed video. Using two 10 minute traces, they demonstrate the effectiveness of the new model and show that, contrary to common belief, reasonable network utilization can be achieved for compressed video, even when deterministic guarantees are provided.
Inheritance and cofree constructions
Authors: Bart P.F. Jacobs
Venue:  (1995)

The coalgebraic view on classes and objects is elaborated to include inheritance. Inheritance in coalgebraic specification (of classes) will be understood dually to parametrization in algebraic specification. That is, inheritance involves restriction (specialization), where parametrization involves extension. And cofree constructions are ``best'''' restrictions, like free constructions are ``best'''' extensions. To make this view on inheritance precise we need a suitable notion of behaviour preserving morphism between classes, which will be defined as a ``coalgebra map up-to-bisimulation''''.
SenToy: a tangible interface to control the emotions of a synthetic character
Authors: Ana Paiva, Ricardo Chaves, Moisés Piedade, Adrian Bullock, Gerd Andersson, Kristina Höök
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper we describe how to control the emotional states of a synthetic character in a computer game using a tangible interface named SenToy. SenToy is a doll with sensors in its arms, legs and body, which allows the user to influence the emotional state of his controlled character by gesturing with the doll. In general, SenToy works as a new type of interface to the role playing game, FantasyA, where players must exhibit a particular set of emotions and perform a set of actions as a way to evolve in the game. The evaluation of SenToy has shown that the users were able to express the desired emotions to influence the synthetic characters, and that overall payers liked the doll as an interface.
A Hierarchical Architecture for Concurrent Soft Error Detection Based on Current Sensing
Authors: Y. Tsiatouhas, A. Arapoyanni, D. Nikolos, Th. Haniotakis
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Robust circuit design techniques with respect to soft errors gain importance in the era of very deep submicron technologies. On-line testing will play an important role towards this direction. In this paper we propose a hierarchical architecture for concurrent soft error detection. This architecture is based on current sensing techniques and provides very low area overhead, small detection times and negligible performance penalty on the funtional circuit under check.
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
Authors: Huaiyu Liu, Simon S. Lam
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In a system proposed by Plaxton, Rajaraman and Richa(PRR), the expected cost of accessing a replicated objectwas proved to be asymptotically optimal for a static set ofnodes and pre-existence of consistent and optimal neighbortables in nodes [9]. To implement PRR's hypercube routingscheme in a dynamic, distributed environment, such asthe Internet, various protocols are needed (for node joining,leaving, table optimization, and failure recovery). Inthis paper, we first present a conceptual foundation, calledC-set trees, for protocol design and reasoning about consistency.We then present the detailed specification of ajoin protocol. In our protocol, only nodes that are joiningneed to keep extra state information about the join process.We present a rigorous proof that the join protocol generatesconsistent neighbor tables for an arbitrary number ofconcurrent joins. The crux of our proof is based upon inductionon a C-set tree. Our join protocol can also be usedfor building consistent neighbor tables for a set of nodes atnetwork initialization time. Lastly, we present both analyticand simulation results on the communication cost of a joinin our protocol.
Bit Plane Decomposition and the Scanning n-tuple Classifier
Authors: S. Hoque, K. Sirlantzis, M. C. Fairhurst
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper describes a multiple classifier configuration for high performance off-line handwritten character recognition applications. Along with a conventional Scanning n-tupleclassifier (or sn-tuple) implementation, three other sn-tuple systems have been used which are trained using a binary feature set extracted from the contour chain-codes using a novel decomposition technique. The overall accuracy thus achievable by the proposed scheme is much higher than most other classification systems available and the added complexity (over conventional sn-tuple system) is minimal.
Reliability of Internet Hosts - A Case Study from the End User's Perspective
Authors: M. Kalyanakrishnan, R. K. Iyer, J. Patel
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

This paper presents the results of a 40-day reliability study on a set of 97 popular Web sites done from an end user's perspective. Data for the study was acquired by periodically attempting to fetch an HTML file from each Web site and recording the outcome of such attempts. Analysis of the acquired data revealed: (i) 94% of the HTML file fetch requests succeed on the average. (ii) Most failures last less than 15 minutes. (iii) The underlying network plays a dominant role in determining host accessibility: (a) Network related-outages account for a major part of the failures. (b) Some network-related outages rendered more than 70% of the hosts inaccessible. (c) Host-related failures tend to be shorter than failures that might involve the network. (vi) The network connectivity is high on the average with 93% of the sites being accessible at any given time. (vii) Mean Availability of the hosts is high (0.993).
Testing Processes from Formal Specifications with Inputs, Outputs and Data Types
Authors: Grégory Lestiennes, Marie-Claude Gaudel
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Deriving test cases from formal specifications of communicatingprocesses has been studied for a while. Several methodshave been proposed for specifications based on FSM(Finite State Machines), LTS (Labelled Transition Systems),IOTS (Input Output Transition Systems), etc. However, mostapproaches are limited to a finite set of actions, excludingthe possibility of communicating typed values between processes.This article presents a test derivation and selectionmethod based on a model of communicating processes withinputs, outputs and data types, which is closer to actual implementationsof communication protocols.
Crossing-number critical graphs have bounded path-width
Authors: Petr Hliněny
Venue: Journal of Combinatorial Theory Series B (2003)

The crossing number of a graph G, denoted by cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. A graph G is crossing-critical if cr(G - e)<cr(G) for all edges e of G. We prove that crossing-critical graphs have "bounded path-width" (by a function of the crossing number), which roughly means that such graphs are made up of small pieces joined in a linear way on small cut-sets. Equivalently, a crossing-critical graph cannot contain a subdivision of a "large" binary tree. This assertion was conjectured earlier by Salazar (J. Geelen, B. Richter, G. Salazar, Embedding grids on surfaces, manuscript, 2000).
Compression Techniques to Simplify the Analysis of Large Execution Traces
Authors: Abdelwahab Hamou-Lhadj, Timothy C. Lethbridge
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Dynamic analysis consists of analyzing the behavior of a software system to extract its proprieties. There have been many studies that use dynamic information to extract high-level views of a software system or simply help software engineers to perform their daily maintenance activities more effectively. One of the biggest challenges that such tools face is to deal with very large execution traces. By analyzing the execution traces of the software systems we are working on, we noticed that they contain many redundancies that can beremoved. This led us to create a comprehension-driven compression framework that compresses the traces to make them more understandable. In this paper, we present and explain its components. The compression framework is reversible that is the original trace can be reconstructed from its compressed version. In addition to that, we conducted an experiment with the execution traces of two software systems to measure the gain attained by such compression.
Peak Power Reduction in Low Power BIST
Authors: Xiaodong Zhang, Kaushik Roy
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

In order to meet the power and reliability constraints, it is important to reduce both average and peak power during BIST operations. In this paper we propose a Low Power Automatic Test Pattern Generator (LPATPG) with peak power reduction. The technique can be used during on-line testing of large circuits requiring low power consumption. LPATPG can be implemented using linear cellular automata (CA) with appropriate external weighting logic. While the average power is reduced by finding the optimal signal activities (probabilities of signal switching) at the primary inputs, the peak power is reduced by restricting the number of active primary inputs.Results on ISCAS benchmark circuits show that while achieving high fault coverage, average power reduction up to 90%, peak power reduction up to 37% and energy reduction up to 93% can be achieved (compared to equi-probable random pattern generator by linear cellular automata), and the ratio of the number of high power vectors (vectors violate the power limit) in LPATPG sequence to the number of high power vectors in the equi-probable random sequence can be as low as 0_44%.
Free-Form Surface Registration Using Surface Signatures
Authors: Sameh M. Yamany, Aly A. Farag
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper introduces a new free-form surface representation scheme for the purpose of fast and accurate registration and matching. Accurate registration of surfaces is a common task in computer vision. The proposed representation scheme captures the surface curvature information, seen from certain points and produces images, called surface signatures, at these points. Matching signatures of different surfaces enables the recovery of the transformation parameters between these surfaces. We propose to use template matching to compare the signature images. To enable partial matching, another criterion, the overlap ratio, is used. This representation scheme can be used as a global representation of the surface as well as a local one and performs near real-time registration. We show that the signature representation can be used to match objects in 3-D scenes in the presence of clutter and occlusion. Applications presented include free-form object matching, multimodal medical volumes registration and dental teeth reconstruction from intra-oral images.
Evaluating Unavailability of a Repairable System Consisting of Components with Significantly Different Reliabilities
Authors: A. A. Shumskaya
Venue: Cybernetics and Systems Analysis (2003)

A new fast simulation method is proposed for evaluation of unavailability of a repairable system. Its idea is to order failure trajectories according to their ranks that promotes rational experiment organization. The estimates are unbiased and possess a bounded coefficient of variation. A numerical example is considered.
Next Fifty Years: Science in the First Half of the Twenty-First Century
Authors: John Brockman
Venue:  (2002)

:A brilliant ensemble of the worlds most visionary scientists provides twenty-five original never-before-published essays about the advances in science and technology that we may see within our lifetimes. Theoretical physicist and bestselling author Paul Davies examines the likelihood that by the year 2050 we will be able to establish a continuing human presence on Mars. Psychologist Mihaly Csikszentmihalyi investigates the ramifications of engineering high-IQ, geneticially happy babies. Psychiatrist Nancy Etcoff explains current research into the creation of emotion-sensing jewelry that could gauge our moods and tell us when to take an anti-depressant pill. And evolutionary biologist Richard Dawkins explores the probability that we will soon be able to obtain a genome printout that predicts our natural end for the same cost as a chest x-ray. (Will we want to read it? And will insurance companies and governments have access to it?) This fascinating and unprecedented book explores not only the practical possibilities of the near future, but also the social and political ramifications of the developments of the strange new world to come. Also includes original essays by: Lee Smolin Martin Rees Ian Stewart Brian Goodwin Marc D. Hauser Alison Gopnik Paul Bloom Geoffrey Miller Robert M. Sapolsky Steven Strogatz Stuart Kauffman John H. Holland Rodney Brooks Peter Atkins Roger C. Schank Jaron Lanier David Gelernter Joseph LeDoux Judith Rich Harris Samuel Barondes Paul W. Ewald The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player