ppxscal/embedding_network huggingface dataset:
A bayesian approach to find random-time probabilities from embedded markov chain probabilities
Authors: Winfried K. Grassmann, Javad Tavakoli
Venue: Probability in the Engineering and Informational Sciences (2007)

The embedded Markov chain approach is widely used in queuing theory, in particular in M/G/1 and GI/M/c queues. In these cases, one has to relate the embedded equilibrium probablities to the corresponding random-time probabilities. The classical method to do this is based on Markov renewal theory, a rather complex approach, especially if the population is finite or if there is balking. In this article we present a much simpler method to derive the random-time probabilities from the embedded Markov chain probabilities. The method is based on conditional probability. Our approach might also be applicable in such situations.
Max-Relevance and Min-Redundancy Greedy Bayesian Network Learning on High Dimensional Data
Authors: Feng Liu, Qiliang Zhu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Existing algorithms for learning Bayesian network require a lot of computation on high dimensional itemsets which affects accuracy especially on limited datasets and takes up a large amount of time. To address the above problem, we propose a novel Bayesian network learning algorithm MRMRG, Max Relevance-Min Redundancy Greedy. MRMRG algorithm is a variant of K2 which is a well-known BN learning algorithm. We also analyze the time complexity of MRMRG. The experimental results show that MRMRG algorithmhasmuch better efficiency and accuracy than most of existing algorithms on limited datasets.
Detecting covert timing channels: an entropy-based approach
Authors: Steven Gianvecchio, Haining Wang
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

The detection of covert timing channels is of increasing interest in light of recent practice on the exploitation of covert timing channels over the Internet. However, due to the high variation in legitimate network traffic, detecting covert timing channels is a challenging task. The existing detection schemes are ineffective to detect most of the covert timing channels known to the security community. In this paper, we introduce a new entropy-based approach to detecting various covert timing channels. Our new approach is based on the observation that the creation of a covert timing channel has certain effects on the entropy of the original process, and hence, a change in the entropy of a process provides a critical clue for covert timing channel detection. Exploiting this observation, we investigate the use of entropy and conditional entropy in detecting covert timing channels. Our experimental results show that our entropy-based approach is sensitive to the current covert timing channels, and is capable of detecting them in an accurate manner.
Special Feature a New Approach to High-Speed Computer Graphics: The Line
Authors: M. Loceff
Venue: Computer (1980)

The design of a better line drawing algorithm led to some general strategies for boosting software efficiency. 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
Variable Sub-carrier in OFDM to Reduce the ICI Due to Carrier Frequency Offset and IQ Imbalance
Authors: Chuanhui Ma, Guillermo E. Atkin, Chi Zhou
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Orthogonal Frequency Division Multiplexing (OFDM) has become one of the promising technologies for the next-generation communication systems to support high-data-rate transmission. However, conventional OFDM systems are sensitive to both the Carrier Frequency Offset (CFO) and the In- phase and Quadrature (IQ) imbalance, which cause the Inter-Carrier Interference (ICI) and greatly degrade the performance. In this paper, we propose a novel OFDM system using a permutated On-Off- Keying Quadrature-Phase-Shift-Keying (OOK-QPSK) modulation to reduce the ICI. The performance analysis and the simulation results show the proposed OFDM system performs better than conventional OFDM systems using QPSK modulation under the impact of both the CFO and the IQ imbalance. Index Terms-- OFDM, CFO, IQ imbalance, ICI, QPSK, Permutation, OOK.
Synthesis of reversible sequential elements
Authors: Min-Lun Chuang, Chun-Yao Wang
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2008)

To construct a reversible sequential circuit, reversible sequential elements are required. This work presents novel designs of reversible sequential elements such as the D latch, JK latch, and T latch. Based on these reversible latches, we construct the designs of the corresponding flip-flops. Then we further discuss the physical implementations of our designs based on electron waveguide Y-branch switch technology. Test costs, including test generation and test application, of reversible sequential circuits with these reversible flip-flops are also discussed. Compared with previous work, the implementation cost of our new designs, including the number of gates and the number of garbage outputs, is significantly reduced. The number of gates in our designs is 47.4&percnt; of the designs in previous work on average. The number of garbage outputs in our designs is 25&percnt; of the designs in previous work on average.
The IPAD System: a Future Management/Engineering/Design Environment
Authors: C. A. Garrocq
Venue: Computer (1975)

The design of a new aerospace vehicle is a complex, long-term process. At the onset, a set of objectives is identified in the areas of mission, weight, performance, payload, etc., which are specified with a fairly good knowledge of the available design technology and constraints. The designer possesses a fund of accumulated experience and knowledge that he applies, with imagination and intuition, to meet the requirements and constraints he has been given. The knowledge and experience of the designer are more and more frequently being delegated to the computer; intuition and imagination can never be. In spite of the extensive use of computers in portions of the design process, total turnaround times are long; drudgery interrupts and stalls the engineer. The total project data is segmented and scattered throughout the design team to such an extend that accessing, coordinating, and updating become difficult and complex. The team gets the job done, but only after painfully tedious effort.
Determination of compressive residual stress in a doubly-clamped microbeam according to its buckled shape
Authors: Cheng Luo, Anand Francis, Xinchuan Liu
Venue: Microelectronic Engineering (2008)

In this work, an analytical relationship is derived for a doubly-clamped microbeam when it buckles after release from the substrate. In terms of the relationship, compressive residual stress in the doubly-clamped microbeam can be determined according to its buckled shape, allowing one to find the compressive residual stress directly without much experimental effort. This relationship has been used to determine compressive residual stresses in four types of doubly-clamped SiO"2 microbeams. In addition, four methods have been applied to find the elongations of these SiO"2 microbeams, and the corresponding results are compared. Finally, the residual stresses in doubly-clamped SiO"2 microbeams predicted according to the derived relationship are compared with those found in SiO"2 microcantilevers, and the results have a good match.
A Multiprocessor Interface
Authors: Kim Eckert
Venue: IEEE Micro (1982)

The presence of "smart" peripherals in a microcomputer system makes it, in effect, a multiprocessor system. This view led to the design of a simple, general-purpose interface.
Towards Automatic Measurement of Probabilistic Processes
Authors: Lin Song, Yuxin Deng, Xiaojuan Cai
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

In this paper we propose a metric for finite processes in a probabilistic extension of CSP. The kernel of the metric cor- responds to trace equivalence and most of the operators in the process algebra is shown to satisfy non-expansiveness property with respect to this metric. We also provide an al- gorithm to calculate the distance between two processes to a prescribed discount factor in polynomial time. The al- gorithm has been implemented in a tool that helps us to measure processes automatically.
Generalized quasirandom graphs
Authors: László Lovász, Vera T. Sós
Venue: Journal of Combinatorial Theory Series B (2008)

We prove that if a sequence of graphs has (asymptotically) the same distribution of small subgraphs as a generalized random graph modeled on a fixed weighted graph H, then these graphs have a structure that is asymptotically the same as the structure of H. Furthermore, it suffices to require this for a finite number of subgraphs, whose number and size is bounded by a function of |V(H)|.
Scan-Based Tests with Low Switching Activity
Authors: Santiago Remersaro, Xijiang Lin, Sudhakar M. Reddy, Irith Pomeranz, Janusz Rajski
Venue: IEEE Design Test (2007)

Supply current and power dissipation during scan-based test can be far higher than during normal circuit operation, owing to excessive switching activity caused by the tests. Excessive switching activity can occur during scan shift and test response capture. Higher peak-current demands can cause supply voltage droops, making good chips fail at-speed tests. Higher average switching activity causes higher power dissipation and chip temperature, which in turn can cause hot spots and damage circuits under test. This article investigates a method to derive tests with reduced switching activity during scan shift and test response capture. The method does not require additional hardware or modifications to the scan chains. The authors present experimental results on benchmark and industrial circuits.
A Graph Modeling of Semantic Similarity between Words
Authors: Marco A. Alvarez, SeungJin Lim
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The problem of measuring the semantic similarity between pairs of words has been considered a fundamental operation in data mining and information retrieval. Nevertheless, developing a computational method capable of generating satisfactory results close to what humans would perceive is still a difficult task somewhat owed to the subjective nature of similarity. In this paper, it is presented a novel algorithm for scoring the semantic similarity (SSA) between words. Given two input words w_1 and w_2, SSA exploits their corresponding concepts, relationships, and descriptive glosses available in WordNet in order to build a rooted weighted graph G_sim. The output score is calculated by exploring the concepts present in Gsim and selecting the minimal distance between any two concepts c_1 and c)2 of w_1 and w_2 respectively. The definition of distance is a combination of: 1) the depth of the nearest common ancestor between c_1 and c_2 in G_sim, 2) the intersection of the descriptive glosses of c_1 and c_2, and 3) the shortest distance between c_1 and c_2 in G_sim. A correlation of 0.913 has been achieved between the results by SSA and the human ratings reported by Miller and Charles [15] for a dataset of 28 pairs of nouns. Furthermore, using the full dataset of 65 pairs presented by Rubenstein and Goodenough [20], the correlation between SSA results and the known human ratings is 0.903, which is higher than all other reported algorithms for the same dataset. The high correlations of SSA with human ratings suggest that SSA would be convenient in solving several data mining and information retrieval problems.
The scheme of things: streams versus generators
Authors: William Clinger
Venue: ACM SIGPLAN Lisp Pointers (1987)

With this article I'm changing the series title to "The Scheme of Things". The original title was a weak pun on the technical term environment. An environment, you see, associates names with their meanings. In the Scheme environment, for example, the word "environment" has the meaning just stated, while in some other parts of the programming language world the word "environment" has a less technical meaning that refers to the stuff that comes with a programming system. One of my purposes has been to explain the meaning of terms in the Scheme environment. Sometimes a word like "environment" or "stream" means something different in Scheme than it does in some other dialect of Lisp, usually because the Scheme terminology follows that of another well-established language or group of languages.
Implementing Mass Storage Facilities in Operating Systems
Authors: D. L. Boyd
Venue: Computer (1978)

The appearance in the commercial marketplace of online auxiliary memory devices with very large capacities has resulted in several new and interesting problems. These problems include new applications of the devices (generally called mass storage facilities or MSF's) for storage of on-line data, the need for new data structures organized about the physical characteristics of the MSF, problems in performance, enhancement of automatic device and data control, enhancement of automatic memory management systems, increased concern for data integrity, and the continuing need for more memory protection capability.
Simulation-based Model Mapping Approach
Authors: Jinkui Hou, Huahong Yu, Guodong Huang
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Model transformations are touted to play a key role in model-driven software development. The mapping relations between different models are the foundation and basis for the transformation. A classification for different level mappings was proposed and defined formally by abstractly analyzing the characteristics of syntax and semantic features of modeling languages. On this basis, a further study about the simulation-based mapping approach was conducted to explore the definition process for mapping relations and the cardinal principles should be followed. The UML-based class model used as a source and the C programming language used as the target are shown in the case study to help interpreting the ideas. It may not only be a theoretical guidance for model transformation, but also can be a measurement for validating the mapping rules between models at different abstract levels.
Virtual Organization: A New Approach in IT
Authors: Mohammad Reza Nami, Djamshid Tavangarian
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Recently, advances in computer networks have affected marketing and business systems so that traditional business systems have been metamorphosed. The increasing demands for extended products and services along with advances in IT industry have motivated researchers to create Virtual Organizations (VOs) in order to better respond to business opportunities and produce qualitative services and products. In this paper, a thorough survey of VOs, is presented including definitions, characteristics, issues, and challenges. Keywords: ICT, Collaborative Networks, Virtual Organization, Virtual organization Breeding Environment (VBE).
Normalized information-based divergences
Authors: J. -F. Coeurjolly, R. Drouilhet, J. -F. Robineau
Venue: Problems of Information Transmission (2007)

This paper is devoted to the mathematical study of some divergences based on mutual information which are well suited to categorical random vectors. These divergences are generalizations of the "entropy distance" and "information distance." Their main characteristic is that they combine a complexity term and the mutual information. We then introduce the notion of (normalized) information-based divergence, propose several examples, and discuss their mathematical properties, in particular, in some prediction framework.
Real-time 3D Hand Shape Estimation based on Image Feature Analysis and Inverse Kinematics
Authors: Weiying Chen, Ryuji Fujiki, Daisaku Arita, Rin-ichiro Taniguchi
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Vision-based hand shape estimation is a challenging task, since the hand presents a motion of high degrees of freedom and since self-occlusions of different fingers bring a lot of uncertainty for the occluded parts. Considering that the influence of self-occlusions may be reduced by observing multiple images, we propose a multiple view system to obtain hand features, with using previous information that facilitates very robust feature extraction. The extracted features are then used to compute approximate global state of hand and perform preliminary estimation of the local state of each finger by Inverse Kinematics (IK). By minimizing the estimation error between groups of model features and groups of image features, some model parameters are refined and IK is recomputed, which contributes to enhance estimation accuracy. To reduce the estimation complexity due to the high degrees of freedom of the hand, we combine IK with the motion constraints of articulated hand. The effectiveness of our approach is demonstrated with experiments on a number of different hand motions with finger articulation and global hand rotation under complex background.
Flow Shop Scheduling with No-wait Flexible Lot Streaming using Adaptive Genetic Algorithm
Authors: KwanWoo Kim, In-Jae Jeong
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In this paper, we propose a flow shop scheduling problem with no-wait flexible lot streaming. The problem involves the splitting of order quantities of different products into sublots and the consideration of alternative machines with different processing times. Sublots of a particular product are not allowed to intermingle, that is sublots of different products must be no-preemptive. The objective of the problem is the minimization of makespan. An adaptive genetic algorithm is proposed which is composed of three main steps: first step is a position-based crossover of products and four kinds of local search-based mutations to generate better generations. Second step is an iterative hill-climbing to improve the current generation. The last step is the adaptive regulation of crossover and mutation rates. Experimental results are presented for various sizes of problems to describe the performance of the proposed four local search-based mutations in adaptive algorithm.
Curved paper rectification for digital camera document images by shape from parallel geodesics using continuous dynamic programming
Authors: Katsuhito Fujimoto, Jun Sun, Hiroaki Takebe, Misako Suwa, Satoshi Naoi
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Methods to rectify distortion of digital camera document images of curved papers have become important for camera-based image recognition. In this paper we propose a novel distortion rectification method based on "shape from parallel geodesics. This method considers the following features: parallel lines corresponding to character strings or ruled lines of tables on extended surface become parallel geodesics on a curved paper surface and a smoothly curved paper can be modeled by a ruled surface, that is, a sweep surface of rulings. The projected geodesics and the projected rulings exist in the input image derived from perspective transformation. The presented method extracts the projected geodesics, estimates the projected rulings in the input image, estimates the ruled surface that models the curved paper, and generates the corrected image, in this order. It can estimate the ruled surface model directly by numerical operations of differentiation, integration and matrix inversion without any iterative calculation. We also report on experiments that show the effectiveness of the proposed method.
Computer Music Composition: The Polyphonic POD System
Authors: B. Truax
Venue: Computer (1978)

A computer music system allows the composer to work with musical structure in a highly controllable and predictive way, and enables him to compose, modify, and synthesize an expanded range of musical expression. 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
Module assignment for pin-limited designs under the stacked-Vdd paradigm
Authors: Yong Zhan, Tianpei Zhang, Sachin S. Sapatnekar
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper addresses the module assignment problem in pin-limited designs under the stacked-Vdd circuit paradigm. A partition-based algorithm is presented for efficiently assigning modules at the floorplanning level so as to reuse currents between the Vdd domains, and minimize the power wasted during the operation of the circuit. Experimental results on a DLX architecture show that compared with assigning modules to different Vdd rails using a bin-packing technique, the circuit generated by our algorithm has 32% lower wasted power, on average. In addition, experiments on a 3D IC example show that our module assignment approach is equally effective in reducing the power waste in 3D ICs.
An Improved PSO and Its Application in Research on Reservoir Operation Function of Long-Term
Authors: Ming Zhang, Chengjun Li, Xiaohui Yuan, Yongchuan Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

An improved Particle Swarm Optimization called IPSO is presented in this article. By importing mutation operator and adopting self-adapting inertia, the IPSO overcomes the local convergence problem and slow later convergence problem of the basic PSO effectively. The variance analysis is applied to evaluate the optimization effectiveness of key parameters of IPSO. In order to test the performance of IPSO, it is applied to the research on the function of reservoir long-term operation. In the case study, the reservoir operation function achieved by IPSO is tested and the superiority is apparent compared with two other ones that are obtained by PSO and through regression analysis on the simulation operation course gained by the progressive optimization arithmetic respectively. The application results fully show that IPSO is a promising and valuable optimization method, meaning that a novel and effective solution is provided for complex optimization problems.
Structural Health Monitoring of a rotor blade during statical load test
Authors: Lars Schubert, Martin Kuttner, Bernd Frankenstein, Dieter Hentschel
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The paper describes a structural health monitoring concept based on the evaluation of acoustic Lamb waves. Using a suitable damage indicator like the correlation coefficient it is possible to detect and localize defects in the observed structure. The functional capability was shown in statical test of a part of a rotor blade.
Table-Driven Code Generation
Authors: S. L. Graham
Venue: Computer (1980)

This research shows that the systematic organization provided by table-driven methods provides many more benefits than the ad hoc code generation techniques of the past.