ppxscal/embedding_network huggingface dataset:
Satellite Packet Switching with Global Assignments and Batch Poisson Arrivals
Authors: J. W. Mark
Venue: IEEE Transactions on Computers (1978)

A satellite packet switching multiaccess model which employs a global scheduling assignment scheme is described and analyzed for batch Poisson arrivals. System performance in terms of buffer overflow probability and system delay is analyzed and simulated. The numerical results, presented in graphical form, indicate that the performance improves as the population size M increases. For large value of M the queueing delay decays approximately exponentially as the buffer length increases. Our results indicate that the system delay performance of our dynamic assignment (DA) algorithm is significantly better than that of a synchronous time-division multiplexing scheme.
Machine-assisted election auditing
Authors: Joseph A. Calandrino, J. Alex Halderman, Edward W. Felten
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

Election audit procedures usually rely on precinct-based recounts, in which workers manually review all paper ballots from selected polling places, but these recounts can be expensive due to the labor required. This paper proposes an alternative audit strategy that allows machines to perform most of the work. Precincts are recounted using recounting machines, and their output is manually audited using efficient ballot sampling techniques. This strategy can achieve equal or greater confidence than precinct-based auditing at a significantly lower cost while protecting voter privacy better than previous ballot-based auditing methods. We show how to determine which ballots to audit against the recounting machines' records and compare this new approach to precinct-based audits in the context of Virginia's November 2006 election. Far fewer ballots need to be audited by hand using our approach. We also explore extensions to these techniques, such as varying individual ballots' audit probabilities based on the votes they contain, that promise further efficiency gains.
Organic thin-film field-effect transistors with MoO3/Al electrode and OTS/SiO2 bilayer gate insulator
Authors: Y. Bai, X. Liu, L. Chen, Khizar-ul-Haq, M. A. Khan, W. Q. Zhu, X. Y. Jiang, Z. L. Zhang
Venue: Microelectronics Journal (2007)

An organic thin-film transistor (OTFTs) having OTS/SiO"2 bilayer gate insulator and MoO"3/Al electrode configuration between gate insulator and source-drain (S-D) electrodes has been investigated. Thermally grown SiO"2 layer is used as the OTFT gate dielectric and copper phthalocyanine (CuPc) for an active layer. We have found that using silane coupling agents, octadecyltrichlorosilane (OTS) on SiO"2, surface energy of SiO"2 gate dielectric is reduced; consequently, the device performance has been improved significantly. This OTS/SiO"2 bilayer gate insulator configuration increases the field-effect mobility, reduces the threshold voltage and improves the on/off ratios simultaneously. The device with MoO"3/Al electrode has similar source-drain current (I"D"S) compared to the device with Au electrode at same gate voltage. Our results indicate that using double-layer of insulator and modified electrode is an effective way to improve OTFT performance.
An approximate analytical framework for performance analysis of equal gain combining technique over independent Nakagami, Rician and Weibull fading channels
Authors: Hossein Samimi, Paeiz Azmi
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, an approximate analytical method for performance analysis of equal gain combiner (EGC) receiver over independent Nakagami and Rician fading channels is presented. We use a convergent infinite series approach which makes it possible to describe the probability of error of EGC receiver in the form of an infinite series. In this paper, we develop a new approximation method for computation of the required coefficients in this series which lets us to derive simple analytical closed-form expressions with good accuracy compared with the exact results existing in the literatures. Our proposed approximation method only needs the mean and the variance of the fading envelope, which are known for various fading distributions, and hence, bypasses the required integration over the fading envelope distribution while computing the required coefficients. This feature lets us to extend our approximation method for performance analysis of EGC receiver over independent Weibull fading channels where the required integration has not any closed-form or tabulated solutions. To give an application of our developed method, we analyze the probability of error of an EGC receiver for binary, coherent PSK (CPSK) modulation over independent Nakagami, Rician and weibull fading channels and study the effect of the fading conditions on the system performance.
A Low-Cost Drafting System Based on a Personal Computer
Authors: Jiro Yamada, Nagatoshi Saito, Akio Tamura
Venue: IEEE Computer Graphics and Applications (1984)

A hierarchical command structure and separate drafting and display files allow ease of use and quick response in this 2-D drawing system.
A fuzzy rule-based algorithm to improve the performance of statistical process control in quality systems
Authors: Shendy M. El-Shal, Alan S. Morris
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

Statistical process control (SPC) is an important part of quality control systems in industrial applications. It is widely used to monitor parameters in production processes and detect abnormal parameter values that indicate a fault in the process. Measurements of controlled parameters commonly exhibit random variations that arise from either environmental changes or random variations in the measuring instrument itself. SPC uses control charts to determine whether variations in measurements are due only to random changes within the range expected or whether they indicate a real process fault. Inevitably, traditional control charts sometimes generate Type I errors (false alarms), indicating a process fault when none actually exists, and causing an unnecessary stoppage of the plant. In other cases, Type II errors are generated, where real faults are either not detected at all, or are detected only after some time delay during which product quality has been impaired. This paper describes an investigation into the use of fuzzy logic to modify SPC rules, with the aim of reducing the generation of false alarms and also improving the detection and detection-speed of real faults.
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems
Authors: Sivakumar Viswanathan, Bharadwaj Veeravalli, Thomas G. Robertazzi
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

In this paper, we propose distributed algorithms, referred to as Resource Aware Dynamic Incremental Scheduling (RADIS) strategies. Our strategies are specifically designed to handle large volumes of computationally intensive arbitrarily divisible loads submitted for processing at Cluster / Grid systems involving multiple sources and sinks (processing nodes). We consider a reallife scenario wherein buffer space (memory) available at the sinks (required for holding and processing the loads) vary over time and the loads have deadlines, and propose efficient "pull-based" scheduling strategies with admission control policy that ensures that the admitted loads are processed satisfying their deadline requirements. The design of our proposed strategies adopts the divisible load paradigm, referred to as divisible load theory (DLT), which is shown to be efficient in handling large volume loads. We demonstrate detailed workings of the proposed algorithms via a simulation study using real-life parameters obtained from a major physics experiment.
Implementation and Design of Auto Ranging System with Risk Estimation for Vehicles
Authors: Sheng Lu, Xiao-Li Cao, Zhong-Jian Cai, Gao-Rong Zeng, Tan Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Based on the theory of optical-mechanical-electrical automatic ranging system of vehicles, paper has a discussion and research of the implementation and design of auto ranging system with risk estimation and decision. The hardware is based on MPC5200. And paper includes the design of hardware architecture, software architecture and key techniques, of hardware development, etc. The system adopts the laser-lidar ranging method to get a high precision. Paper focused on the signal processing of laser-lidar and waveforms selection of the detection system.
Rapid Prototyping of Large-scale Analog Circuits With Field Programmable Analog Array
Authors: Faik Baskaya, Brian Gestner, Chris Twigg, Sung Kyu Lim, David V. Anderson, Paul Hasler
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Modern advances in reconfigurable analog technologies are allowing field-programmable analog arrays (FPAAs) to dramatically grow in size, flexibility, and usefulness. This paper presents rapid prototyping results of a bandpass filter as a sample analog circuit using our floating-gate based large-scale FPAA. A major source of parasitics introduced during the circuit mapping process is interconnect switches used for routing. Our goal is to obtain models of the mapped circuits that can be simulated using SPICE in order to observe the impact of interconnect parasitics on the relevant analog metrics. Our results indicate that the mapped analog circuits obtain desired responses even with interconnect parasitics, clearly demonstrating the practicality of our FPAA.
Statistical segmentation and recognition of fingertip trajectories for a gesture interface
Authors: Kazuhiro Morimoto, Chiyomi Miyajima, Norihide Kitaoka, Katunobu Itou, Kazuya Takeda
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

This paper presents a virtual push button interface created by drawing a shape or line in the air with a fingertip. As an example of such a gesture-based interface, we developed a four-button interface for entering multi-digit numbers by pushing gestures within an invisible 2x2 button matrix inside a square drawn by the user. Trajectories of fingertip movements entering randomly chosen multi-digit numbers are captured with a 3D position sensor mounted on the the forefinger's tip. We propose a statistical segmentation method for the trajectory of movements and a normalization method that is associated with the direction and size of gestures. The performance of the proposed method is evaluated in HMM-based gesture recognition. The recognition rate of 60.0% was improved to 91.3% after applying the normalization method.
AntSec, WatchAnt, and AntRep: Innovative Security Mechanisms for Wireless Mesh Networks
Authors: Parag S. Mogre, Kalman Graffi, Matthias Hollick, Ralf Steinmetz
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Wireless Mesh Networks (WMNs) build on user nodes to form the network's routing infrastructure. In particular, the correct forwarding behaviour of each intermediate node on a multihop path from a source node to a destination node is crucial for the functioning of the mesh network. However, current secure routing solutions and misbehaviour detection mechanisms are not sufficient and are mostly inapplicable in mesh networks based on state-of-the-art wireless technology. In particular, hop-by- hop per-link encryption mechanisms break solutions that are based on the overhearing of the wireless channel, which leads to severe problems in the presence of misbehaving nodes.We present AntSec, WatchAnt, and AntRep, which together address the above security gap. AntSec guarantees integrity and authenticity of routing messages, WatchAnt detects misbehaviour in forwarding data messages as well as routing messages and in addition is able to cope with per-link encryption at the MAC layer. AntRep is a reputation management system and helps take punitive action against misbehaving nodes. AntSec, WatchAnt, and AntRep are well suited for WMNs with a quasi-static network topology. Through a thorough evaluation we show the improved routing performance of AntSec working together with WatchAnt and AntRep.
A blended education approach to teaching second-level accounting at the university of South Africa
Authors: Paul Prinsloo, Annelien A. van Rooyen
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

International trends in open and distance education herald the use of online technologies as essential for any distance education institution that wishes to remain relevant in an increasingly contested market. In the South African context, access to computerised environments is a contested and controversial issue. This paper reports on research undertaken to determine how many of the students who have registered for Accounting at second-year level at the University of South Africa (Unisa) would benefit from a blended education approach.
Research on Similarity Measures between Vague Sets
Authors: Zhenkui Pei, Jian Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Many AI researchers have intensively investigated fuzzy knowledge acquisition. It is considered as a key problem in the fields of expert system, decision analysis, machine learning, ect. We notice that the vague set theory introduced by Gau and Buehrer has been conceived as a new efficient tool to deal with ambiguous data and it has been applied successfully in different fields. A vague set, as a generalization of the concept of fuzzy set, is a set of decision objects, each of which has a grade of membership whose value is a continuous subinterval of [0,1]. It is characterized by a truth-membership function and a false- membership function. In this paper, we analyze the similarity measures between vague sets given in literature. The concept of similarity degree is given. Then we revise them and propose a new kind of similarity measures. The new measures are more rational, thus providing a more useful way to measure the degree of similarity between vague sets.
Fuzzy Bayes and Fuzzy Markov Predictors
Authors: Marcelo Andrade Teixeira, Gerson Zaverucha
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

Two fuzzy probabilistic predictors, the Fuzzy Bayes Predictor (FBP) and the Fuzzy Markov Predictor (FMP), are described and evaluated for the task of single-step monthly electric load forecasting. They are modifications of the Naive Bayes Classifier and Hidden Markov Model (where temporal dependence among the examples is ignored and taken into account, respectively) to enable them to predict numerical values by incorporating features from fuzzy systems. This is a generalization of the regression-by-discretization approach of using classifiers for regression. These hybrid systems are successfully compared with two traditional forecasting methods, Box-Jenkins and Winters exponential smoothing.
A Spreadsheet Approach to Facilitate Visualization of Uncertainty in Information
Authors: Alexander Streit, Binh Pham, Ross Brown
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Information uncertainty is inherent in many problems and is often subtle and complicated to understand. While visualization is a powerful means for exploring and understanding information, information uncertainty visualization is ad hoc and not widespread. This paper identifies two main barriers to the uptake of information uncertainty visualization: firstly, the difficulty of modeling and propagating the uncertainty information; and secondly, the difficulty of mapping uncertainty to visual elements. To overcome these barriers, we extend the spreadsheet paradigm to encapsulate uncertainty details within cells. This creates an inherent awareness of the uncertainty associated with each variable. The spreadsheet can hide the uncertainty details, enabling the user to think simply in terms of variables. Furthermore, the system can aid with automated propagation of uncertainty information, since it is intrinsically aware of the uncertainty. The system also enables mapping the encapsulated uncertainty to visual elements via the formula language and a visualization sheet. Support for such low-level visual mapping provides flexibility to explore new techniques for information uncertainty visualization.
The aesthetics of interactive artifacts: thoughts on performative beauty
Authors: Falk Heinrich
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Nowadays aesthetics and the notion of beauty play an increasingly significant role in interactive art and design products, and consequently in scientific research in these fields. This paper outlines a rudimentary theory of the notion of beauty in interactive artifacts. My argument takes as its starting point Kant's definition of the sentiment of beauty as an act of judgment. This judgment unfolds at two very different but interrelated levels. The first level consists of the participant's physiological aesthetic judgment of the digital system's output. This judgment determines the participant's next (inter-)action and is the basis for performative 'flow'. At the second level beauty is seen as an emergent phenomenon that manifests itself as a reflective sentiment, i.e. as a result of the interplay between already experienced 'flow' and the idea of the interactive artifact's potentiality. The idea of potentiality is on the one hand an intrinsic part of the artificial interaction system (an interactive artifact), but on the other hand is experienced as a transcendental phenomenon that appears to overcome the rigid limits of algorithmic systems. The present paper concretizes my theoretical findings by analyzing two very different interactive artifacts: David Rokeby's Very Nervous System from the early days of digital interactive art and the online community 'Second Life' as an example of a virtual meeting place.
Design of adaptive communication channel buffers for low-power area-efficient network-on-chip architecture
Authors: Avinash Kodi, Ashwini Sarathy, Ahmed Louri
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Network-on-Chip (NoC)architectures provide a scalable solution to the wire delay constraints in deep submicron VLSI designs. Recent research into the ptimization of NoC architectures has shown that the design of buffers in the NoC routers influences the power consumption, area overhead and performance of the entire network. In this paper, we propose a low-power area-efficient NoC architecture by reducing the number of router buffers. As a reduction in the number of buffers degrades the network's performance, we propose to use the existing repeaters along the inter-router links as adaptive channel buffers for storing data when required. We evaluate the proposed adaptive communication channel buffers under static and dynamic buffer allocation in 8 x 8 mesh and folded torus network topologies. Simulation results show that reducing the router buffer size in half and using the adaptive channel buffers reduces the buffer power by 40-52% and leads to a 17-20% savings in overall network power with a 50% reduction in router area. The design with dynamic buffer allocation shows a marginal 1-5% drop in performance, while static buffer allocation shows a 10-20% drop in performance, for various traffic patterns.
New Applications
Authors: M. G. Bienhoff
Venue: Computer (1973)

Over 5,000 blind people in the Boston area have a new friend in a talking computer system that allows them to type letter-perfect correspondence, proofread manuscripts, calculate bookkeeping problems, and write computer programs. 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
Two Methods for the Efficient Analysis of Memory Address Trace Data
Authors: A. J. Smith
Venue: IEEE Transactions on Software Engineering (1977)

The high cost of analyzing long memory address traces has limited most researchers to short traces and analysis algorithms that are linear in the length of the trace. We suggest two methods that permit a trace to be shortened in length by one to two orders of magnitude (or more) for later further analysis. The Stack Deletion Method eliminates all references in the trace to the top k levels of the LRU stack. The Snapshot Method records the reference bits of the pages in the original tape at discrete intervals and uses these bits to generate a new trace. Extensive measurements are presented, from which we conclude that there is little or no loss in accuracy using reduced traces for many purposes for a wide range of memory sizes and degrees of reduction.
Development of a Self Adaptive Genetic Algorithm
Authors: K. Tahera, R. N. Ibrahim, P. B. Lochert
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Genetic Algorithms have been used to solve difficult optimization problems in a number of fields. However, in order to solve a problem with GA, the user has to specify a number of parameters. This parameter tuning is a difficult task as different genetic operators are suitable in different application areas. This paper proposes a scheme for genetic algorithms where the genetic operators are changed randomly. The proposed approach aims to mimic the nature more closely. In this approach, inhomogeneous crossover and selection techniques are used. A gendered reproduction is also applied where the number of children is produced depending on the fertility rate. In addition, parents may adopt a new child. The age and death age are added to balance between exploration and exploitation of the search space. Using these simple approaches, the diversity of the population can be maintained efficiently. The experimental results of the proposed algorithm based on a mechanical design problem show promising results.
Grouping and Aggregate queries Over Semantic Web Databases
Authors: Dawit Seid, Sharad Mehrotra
Venue: Proceedings of the International Conference on Semantic Computing (2007)

As a growing number of applications represent data as semantic graphs like RDF (Resource Description Format) and the many entity-attribute-value formats, query languages for such data are being required to support operations beyond graph pattern matching and inference queries. Specifically the ability to express aggregate queries is an important feature which is either lacking or is implemented with little attention to the peculiarities of the data model. In this paper, we study the meaning and implementation of grouping and aggregate queries over RDF graphs. We first define grouping and aggregate operators algebraically and then show how the SPARQL query language can be extended to express grouping and aggregate queries.
Applying layout algorithms to hand-drawn graphs
Authors: Peter Reid, Fred Hallett-Hook, Beryl Plimmer, Helen Purchase
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Hand-drawing a node-and-edge graph is a simple visual problem solving technique; however as the graph is built it can easily get untidy and confusing. It is more difficult to understand and interpret a confusing graph. By applying edge morphing techniques and a force-directed algorithm the hand-drawn graph can retain its informal appearance while its layout is improved. Graphs will be more readily understood, making the problem solving process easier.