ppxscal/embedding_network huggingface dataset:
A New Concept in Impact Printing
Authors: J. Tschinkel
Venue: Computer (1975)

While the impact printer has been developed to a very high level of performance in terms of printing quality and speed, no fundamental changes have been made to the printed format. All printing is currently done, as it has been for years, on the "standard" computer form measuring 11 inches high and 14-7/8 inches wide. Typically, a line is 132 characters long; there are 6 lines per inch and the characters are generally upper case only. The paper is fan fold, available in various thicknesses or weights, and is multi-formed with interlaced carbon. 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
Gossiping on MANETs: the beauty and the beast
Authors: Roy Friedman, Daniela Gavidia, Luis Rodrigues, Aline Carneiro Viana, Spyros Voulgaris
Venue: ACM SIGOPS Operating Systems Review (2007)

Gossip protocols have emerged as a powerful technique for implementing highly scalable and robust services, such as information dissemination and aggregation. The fact that gossip protocols require very little or no structure to operate makes them particularly appealing to apply in dynamic systems, where topology changes are common (for instance, due to frequent faults or high churn rates). Therefore, gossip protocols seem particularly well fit to operate in wireless self-organizing networks. Unfortunately, these networks have a number of characteristics that impede the deployment of gossip protocols designed for wired networks. In this work we identify the inherent differences in communication between wired and wireless networks and their impact on the design and implementation of gossip protocols. In particular, our comparison includes drawing a distinction between the gossiping primitives suitable for each of these environments. In the context of this analysis, we conclude by presenting a list of open research questions.
SCARNA
Authors: Yasuo Tabei, Koji Tsuda, Taishin Kin, Kiyoshi Asai
Venue: Bioinformatics (2006)

Motivation: The functions of non-coding RNAs are strongly related to their secondary structures, but it is known that a secondary structure prediction of a single sequence is not reliable. Therefore, we have to collect similar RNA sequences with a common secondary structure for the analyses of a new non-coding RNA without knowing the exact secondary structure itself. Therefore, the sequence comparison in searching similar RNAs should consider not only their sequence similarities but also their potential secondary structures. Sankoff's algorithm predicts the common secondary structures of the sequences, but it is computationally too expensive to apply to large-scale analyses. Because we often want to compare a large number of cDNA sequences or to search similar RNAs in the whole genome sequences, much faster algorithms are required. Results: We propose a new method of comparing RNA sequences based on the structural alignments of the fixed-length fragments of the stem candidates. The implemented software, SCARNA (Stem Candidate Aligner for RNAs), is fast enough to apply to the long sequences in the large-scale analyses. The accuracy of the alignments is better or comparable with the much slower existing algorithms. Availability: The web server of SCARNA with graphical structural alignment viewer is available at Contact: scarna@m.aist.go.jp Supplementary information: The data and the supplementary information are available at .
Microsystems Opinion: Critique of the F8 Microprocessor
Authors: D. Caulkins
Venue: Computer (1977)

The Fairchild F8 is a control microprocessor whose architecture is considerably different from most machines in the same price and performance class. Good computer architecture is consistent, symmetrical, and coherent; the programmer is provided with the maximum amount of information possible after each operation and his freedom of action is limited as little as possible. A machine with these qualities behaves in the way one expects it to behave; it is free of special cases and peculiar quirks. The F8 falls considerably short of meeting these goals. It predates most equivalent micros; its designers seem to have had little contact with others doing similar things. This background has resulted in a machine combining brilliant design concepts with ugly flaws. 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
A Connection Degree-Based Rough Sets Model and its Application to Knowledge Reduction
Authors: Liuling Dai, Bing Huang, Dongxiao Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Knowledge reduction is one of the most important issues in rough sets theory. Many works are related to connection-degree-based rough sets model to treat incomplete information systems. However, the model is not used to knowledge reduction. In this paper, a connection-degree-based rough sets model is proposed and used to knowledge reduction. Two ways for knowledge reduction are proposed and the relationships between them are shown. A knowledge reduction algorithm is also shown for incomplete information systems. The algorithm is based on elementary discernibility matrix and the significance degree of an attribute. Examples are used to show that the validity of the algorithm.
Generalized sidelobe canceller based combined acoustic feedback- and noise cancellation
Authors: Geert Rombouts, Ann Spriet, Marc Moonen
Venue: Signal Processing (2008)

We propose a combination of the well-known generalized sidelobe canceller (GSC) or Griffiths-Jim beamformer, and the so-called PEM-AFROW algorithm for joint estimation under closed loop conditions of a room impulse response and a desired speech signal model, resulting in a system for multimicrophone combined acoustic feedback and noise cancellation. For specific applications (e.g. public address systems), the computational complexity may be reduced dramatically compared to state-of-the-art proactive acoustic feedback cancellers, while feedback cancellation performance is only marginally degraded.
Polylinear Decomposition of Synchronous Sequential Machines
Authors: C. Halatsis
Venue: IEEE Transactions on Computers (1978)

The paper presents systematic procedures for decomposing a sequential machine into submachines some or all of which are realized by polylinear sequential circuits. This polylinear decomposition is based upon classes of subsets of the set of states which possess the substitution property rather than upon partitions with substitution property. These classes are easily found using the backward state transition function of the machine and enables one to treat uniformly and simultaneously the problems of state minimization, machine decomposition in the classical or the polylinear way, finding the lattice of the partitions with substitution property, and periodic decomposition based upon classes that correspond to cyclic partitions. Procedures are developed for deriving optimal all polylinear decompositions and "good" partial polylinear decompositions of a machine.
1st International Workshop on Tools for Managing Globally Distributed Software Development (TOMAG 2007)
Authors: Chintan Amrit, Jos van Hillegersberg, Frank Harmsen
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

The advent of global distribution of software development has made managing collaboration and coordination among developers more difficult due to various reasons including physical distance, differences in time, cultural differences etc. A nearly total absence of informal communication among developers makes coordinating work in a globally distributed setting more critical. The goal of this workshop is to provide an opportunity for researchers and industry practitioners to explore both the state-of-the art in tools and methodologies for managing global software development (GSD).
Detection of Web Defacements by means of Genetic Programming
Authors: Eric Medvet, Cyril Fillon, Alberto Bartoli
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Web site defacement, the process of introducing unauthorized modifications to a web site, is a very common form of attack. Detecting such events automatically is very difficult because web pages are highly dynamic and their degree of dynamism may vary widely across different pages. In this paper we propose a novel detection approach based on Genetic Programming (GP), an established evolutionary computation paradigm for automatic generation of algorithms. What makes GP particularly attractive in this context is that it does not rely on any domain-specific knowledge, whose description and synthesis is invariably a hard job. In a preliminary learning phase, GP builds an algorithm based on a sequence of readings of the remote page to be monitored and on a sample set of attacks. Then, we monitor the remote page at regular intervals and apply that algorithm, which raises an alert when a suspect modification is found. We developed a prototype based on a broader web detection framework we proposed earlier and we tested our approach over a dataset of 15 dynamic web pages, observed for about a month, and a collection of real web defacements. We compared the results to those of a solution we developed earlier, whose design embedded a substantial amount of domain specific knowledge, and the results clearly show that GP may be an effective approach for this job.
Parallel analysis for lightweight network incident detection using nonlinear adaptive systems
Authors: Ruo Ando, Yoshiyasu Takefuji
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The rapid increasing of security incidents imposes a great burden on Internet users and system administrators. In this paper we discuss a parallel analysis for lightweight network incident detection using nonlinear adaptive systems. We run AID (anomaly intrusion detection) and MID (misuse intrusion detection) systems in parallel. Two detectors generate binary output misuse = {YES/NO} and anomaly = {YES/NO}. Then, we can determine whether we need to perform network or security operation. We apply clustering algorithm for AID and classification algorithm for MID. The nonlinear adaptive system is trained for running MID and AID in parallel. Proposed parallel system is more lightweight and simple to operate even if the number of incident patterns is increased. Experimental results in the case where false positive is frequently caused show that our method is functional with a recognition rate of attacks less than 10%, while finding the anomaly status. Also, performance evaluation show that proposed system can work with reasonable CPU utilization compared with conventional serial search based system.
Fault-Tolerant Sensor Coverage for Achieving Wanted Coverage Lifetime with Minimum Cost
Authors: Zhijun Yu, Jie Wang
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

We study how to select and arrange multiple types of wireless sensors to build a star network that meets the coverage, the lifetime, the fault-tolerance, and the minimumcost requirements, where the network lifetime, the acceptable failure probability of the network, and the failure rate of each type of sensors are given as parameters. This problem is NP-hard. We model this problem as an integer linear programming minimization problem. We then present an efficient approximation algorithm to find a feasible solution to the problem, which provides a sensor arrangement and a scheduling. We show that, through numerical experiments, our approximation provides solutions with approximation ratios less than 1.4.
Virtual limitations: a comparison of Sims 2 and Half Life games engines for machinima narrative
Authors: Diana Ford
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

This paper presents an alternative model to conventional feature filmmaking using two different games engines SIMS 2 and Half Life 2. This alternative method of narrative drama, i.e. telling stories via a hybrid machinima medium, is important in highlighting some of the potential that the new media 'auteur' approach provides individual filmmakers. By reflecting on the production processes that this new mode of digital narrative enables, the paper identifies some limitations of the machinima movement at a crucial time where emerging practitioners and industry are embracing this hybrid medium rhetorically as the 'salvation' to new narrative-making. The approach undertaken here is to demonstrate the application of representative scenes produced from a feature film thriller script, entitled Blue Skin, written specifically with this research in mind and trialed in two different games engines: SIMS 2 and Half Life 2. The methodology draws from my PhD research that explores the machinima medium as a novel mode of relating 'realist' genre narratives. By comparing the similarities and differences in the production process with the final 'demo' look, it is proposed that each different games engines affect genre, both subtly and substantially, and thereby intrinsically changes the dynamics of 'same' story being 'told' and 'received' Furthermore, the paper demonstrates that the capacity of machinima to evolve and challenge the cinematic paradigm of auteur filmmaking by telling stories in this hybrid and virtual domain.
Multi-Cycle Measuring and Data Fusion for Large End Face Run-Out of Tapered Roller
Authors: Shengli Lu, Qi Lu, Weichang Liang
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The large end face run-out is a kind of shape and position tolerance, and is an important index in deciding the class of the tapered roller. The auto-measuring and sorting equipments for the tapered roller introduced in this article is an intelligent measuring equipment that orientates in pursuing measurement and choosing of every tapered roller on grinding spot. According to professional standard about the tapered roller, the large end face run-out (notated as SDW) must be measured dynamically during revolving on normal V-shape table. In order to eliminate the disturbance caused by electromagnetism interference and machine vibration, this equipment adopts multi-cycle measuring under single sensor, making better use of the regeneration of the sampling signal and based on analysis of the main factors leading to the large end face run-out and signal characteristics. On the other hand, two kinds of signal-characteristics-based data association threshold filtering algorithm and an improved weight arithmetic mean data fusion algorithm are applied on data processing software embedded in it. This equipment has been proved by practical application and has obtained a Chinese patent.
Sharing of SRAM tables among NPN-equivalent LUTs in SRAM-based FPGAs
Authors: Jason Meyer, Fatih Kocan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This article introduces a novel lookup table (LUT) and its usage in the configurable logic block (CLB) architectures for SRAM-based field-programmable gate array (FPGA) architectures. The proposed CLB allows sharing of SRAM tables of LUTs among NPN-equivalent functions to reduce the size of memories used for storing the functions and also reduces the number of configuration bits required. We measured many different characteristics of FPGAs using our new CLB architecture, including area, delay, routing, and power requirements. We experimentally found that for many different FPGA architectures, CLBs can share one-fourth of their SRAM tables between two basic logic elements (BLEs), which reduced both power consumption and area without negatively affecting routing or wirelength, and there was only a negligible increase in critical path delay of 0.27%. Specifically, we find that FPGAs consisting of CLBs with 16 BLEs and 34 inputs can be implemented with eight normal SRAMs and four SRAMs shared between two BLEs, for an overall reduction of four out of sixteen SRAM tables per CLB. With this new CLB architecture, we measured an approximate reduction in overall power consumption of 2% and an estimated reduction in area of 3%.
Automatic Genre Classification of TV Programmes Using Gaussian Mixture Models and Neural Networks
Authors: Maurizio Montagnuolo, Alberto Messina
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper we investigate the problem of automatically identifying the genre of TV programmes. The approach here proposed is based on two foundations: Gaussian Mixture Models (GMMs) and Artificial Neural Networks (ANNs). Firstly, we use Gaussian mixtures to model the probability distributions of low-level audiovisual features. Secondly, we use the parameters of each mixture model as new feature vectors. Finally, we train a multilayer perceptron (MLP), usingGMM parameters as input data, to identify seven television programme genres. We evaluated the effectiveness of the proposed approach testing our system on a large set of data, summing up to more than 100 hours of broadcasted programmes.
Generalised compositing
Authors: Philip Willis
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

We revisit the assumptions behind traditional image compositing techniques. By analysing the process we separate the colour operations from those for coverage and show that this usefully leads to a more general compositing equation than previously used. We then examine the colour operations in more detail and show how new operations can easily be incorporated in a standard compositor. Practical examples show the new approach and reveal some beneficial effects, not previously achievable within a compositor.
IEEE Pervasive Computing 2007 Annual Index, Volume 6
Venue: IEEE Pervasive Computing (2007)

IEEE Pervasive Computing's 2007 annual index includes a complete author index and a list of all articles and departments published this year. The PDF file is free, and all titles link to their Computer Society Digital Library abstracts. Pervasive Computing subscribers can also access the HTML file, which includes internal links for coauthors.
Modeling and Performance Analysis of Telephony Gateway REgistration Protocol
Authors: Kushal Kumaran, Anirudha Sahoo
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Telephony gateways are devices that interface between IP telephony networks and the PSTN. A telephony proxy or location server (LS) that attempts to connect a call for an end user may need to choose between multiple candidate gateways. Gateways need to send updates of their dynamic resource information periodically to the LS which is used by LS while choosing a gateway. Telephony Gateway REgistration Protocol (TGREP) is an IETF proposed standard used by gateways for this purpose. To the best of our knowledge, there is no study done on the performance of TGREP and we believe that this is the first paper on performance modeling of TGREP system. In this paper, we propose an analytical model for TGREP system and then use the model to evaluate different gateway selection algorithms proposed by us in this paper. We validate our model using simulation results. We also present an adaptive update mechanism in which the overhead of sending dynamic resource information is reduced without significant effect on call blocking probability. We outline a few important conclusions from this study that are quite contrary to what IP telephony providers might resort to while deploying TGREP.
An Improved Approach Based on FCM Using Feature Fusion for Medical Image Retrieval
Authors: Xiaoying Tai, Weihua Song
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Herein we describe a system for Gastroscopic image which supports image retrieval by content. Attention is focused on content-based approaches for the efficient representation and retrieval of medical images. A new improved image retrieval method with more robustness based on image entropy is proposed, which can be defined as spatial weighted entropy. Then a feature fusion algorithm of medical image retrieval based on FCM using spatial weighted entropy combining with color correlogram is presented. A prototype system which supports query by example is designed and implemented on windows 2003 operating system, using VC# and SQL server 2000.The performance of the method is illustrated using examples from an image database composed of 1361 Gastroscopic images, and the comparison of the retrieval results shows that the approach proposed in this paper is effective.
Arithmetic on a distributed-memory quantum multicomputer
Authors: Rodney Van Meter, W. J. Munro, Kae Nemoto, Kohei M. Itoh
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2008)

We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and the network topology. The tradeoff of choosing between gates executed remotely, through &ldquo;teleported gates&rdquo; on entangled pairs of qubits (telegate), versus exchanging the relevant qubits via quantum teleportation, then executing the algorithm using local gates (teledata), is examined. We show that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized. A node size of only a few logical qubits performs adequately provided that the nodes have two transceiver qubits. A linear network topology performs acceptably for a broad range of system sizes and performance parameters. We therefore recommend pursuing small, high-I/O bandwidth nodes and a simple network. Such a machine will run Shor's algorithm for factoring large numbers efficiently.
A Quantitative Analysis of the Utilization of Associative Memories in Data Management
Authors: C. R. DeFiore
Venue: IEEE Transactions on Computers (1974)

An associative approach to data management is developed, and a methodology for measuring the performance and effectiveness of this approach is provided. Mathematical models which quantitatively describe retrieval, storage requirements, updating, and flexibility are developed for both a class of current sequential systems and an associative system. Utilizing these models, a comparison is made between the two systems under certain assumptions so that for given classes of data management problems, one can determine which system is more favorable.