ppxscal/embedding_network huggingface dataset:
Combating web spam with trustrank
Authors: Zoltán Gyöngyi, Hector Garcia-Molina, Jan Pedersen
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Web spam pages use various techniques to achieve higher-than-deserved rankings in a search engine's results. While human experts can identify spam, it is too expensive to manually evaluate a large number of pages. Instead, we propose techniques to semi-automatically separate reputable, good pages from spam. We first select a small set of seed pages to be evaluated by an expert. Once we manually identify the reputable seed pages, we use the link structure of the web to discover other pages that are likely to be good. In this paper we discuss possible ways to implement the seed selection and the discovery of good pages. We present results of experiments run on the World Wide Web indexed by AltaVista and evaluate the performance of our techniques. Our results show that we can effectively filter out spam from a significant fraction of the web, based on a good seed set of less than 200 sites.
Kinematic reductions for uncertain mechanical contact
Authors: Todd D. Murphey
Venue: Robotica (2007)

This paper describes the methods applicable to the modeling and control of mechanical contact, particularly those systems that experience uncertain stick/slip phenomena. Geometric kinematic reductions are used to reduce a system's description from a second-order dynamic model with frictional disturbances coming from a function space to a first-order model with frictional disturbances coming from a space of finite automata over a finite set. As a result, modeling for purposes of control is made more straight-forward by getting rid of some dependencies on low-level mechanics (in particular, the details of friction modeling). Moreover, the online estimation of the uncertain, discrete-valued variables has reduced sensing requirements. The primary contributions of this paper are the introduction of a simplifying representation of friction and formal tests for kinematic reducibility. Results are illustrated using a slip-steered vehicle model and an actuator array model.
A tree-projection-based algorithm for multi-label recurrent-item associative-classification rule generation
Authors: Rafal Rak, Lukasz Kurgan, Marek Reformat
Venue: Data Knowledge Engineering (2008)

Associative-classification is a promising classification method based on association-rule mining. Significant amount of work has already been dedicated to the process of building a classifier based on association rules. However, relatively small amount of research has been performed in association-rule mining from multi-label data. In such data each example can belong, and thus should be classified, to more than one class. This paper aims at the most demanding, with respect to computational cost, part in associative-classification, which is efficient generation of association rules. This task can be achieved using different frequent pattern mining methods. In this paper, we propose a new method that is based on the state-of-the-art tree-projection-based frequent pattern mining algorithm. This algorithm is modified to improve its efficiency and extended to accommodate the multi-label recurrent-item associative-classification rule generation. The proposed algorithm is tested and compared with A priori-based associative-classification rule generator on two large datasets.
Video Object Segmentation with a Potts Model
Authors: Jieyu Zhao, Xiaoquan Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper presents a probabilistic graphical model, a Potts model with external fields, to solve a challenging video object segmentation problem. The video image is represented with a weighted graph. A dynamic Potts model with external fields is used to store the probability distribution of the image pixels. The external fields are important for weighting terms in mixture distributions and thus allow more flexible and robust image segmentation. An online expectation-maximization (EM) algorithm is developed to estimate the parameters of the model. Experimental results on different video clips show the proposed approach is capable of retrieving different objects such as cars, planes, animals and human beings effectively.
Computer Elements
Authors: S. M. Neville
Venue: Computer (1976)

The Computer Elements Technical Committee is one of the oldest of the Computer Society's technical committees, having its origin in the AIEE in 1962-63. Under the insightful leadership of the organizing chairman, W. R. Beam, the original scope included
Toward automated software development
Authors: Doug Smith
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

The ASE conference series is rooted in the 1981 Knowledge-Based Software Assistant (KBSA) document [1] and the ensuing US Air Force Rome Labs research program. KBSA addressed automated tool support for the entire software lifecycle, including project management, requirements, specifications, code generation, and evolution. A core goal of KBSA and ASE is the automated generation of code from requirement-level specifications, which promises benefits in three directions: (1) High Assurance - generation of correct code, as well as certification information as a by-product, (2) Productivity through automation, and (3) High Performance through machine application of best-practice design knowledge. Benefits should also include lowering of the cost of lifecycle ownership, due to automated treatment of evolving requirements. This talk lays out a more modern unifying framework for automated software development that is consistent with these goals [2]. Recent progress in automated support for algorithm design and system development is highlighted
Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms
Authors: Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Network-on-Chip (NoC) architectures with optimized topologies have been shown to be superior to regular architectures (such as mesh) for application specific multiprocessor System-on-Chip (MPSoC) devices. The application specific NoC design problem takes as input the system-level floorplan of the computation architecture, characterized library of NoC components, and the communication performance requirements. The objective is to generate an optimized NoC topology, and routes for the communication traces on the architecture such that the performance requirements are satisfied and power consumption is minimized. The paper discusses a two stage automated approach consisting of i) core to router mapping, and ii) topology and route generation for design of custom NoC architectures. In particular it presents an optimal technique for core to router mapping (stage i), and a factor 2 approximation algorithm for custom topology generation (stage ii). The superior quality of the techniques is established by experimentation with benchmark applications, and comparisons with integer linear programming (ILP) formulations, and heuristic techniques.
Writing blocks: a visualization to support global revising
Authors: Sheng Xu, Hirohito Shibata
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

This paper focuses on the cognitive support of the revising activities of writing, especially the global revising activity. Most of previous writing support systems emphasize the support of content generating activities. As for revising, some of these systems have provided automatic spell check and grammar check features. However, revising should not be confined only to these local superficial changes. In this paper, we aim to support the revising activities through providing a new visualization and interaction that encourages writers to revise globally. We have built a system called Writing Blocks to confirm the feasibility of our approach. Our preliminary user study, which was conducted with three subjects, helped us to gain a perspective on the effectiveness of our approach especially in supporting revising scenarios such as the revising of scripts for time-restricted presentations and the revising of global usage of terms in long documents according to their contexts.
Perception of Delayed Stiffness
Authors: Assaf Pressman, Leah J. Welty, Amir Karniel, Ferdinando A. Mussa-Ivaldi
Venue: International Journal of Robotics Research (2007)

Advanced technology has recently provided truly immersive virtual environments with teleoperated robotic devices. In order to control movements from a distance, the human sensorimotor system has to overcome the e fects of delay. Currently, little is known about the mechanisms that underlie haptic estimation in delayed environments. The aim of this research is to explore the e fect of a delay on perception of surfaces sti fness. A forced choice paradigm was used in which subjects were asked to identify the sti fer of two virtual spring-like surfaces based on manipulation without visual feedback. Virtual surfaces were obtained by generating an elastic force proportional to the penetration of the handle of a manipulandum inside a virtual boundary. The elastic force was either an instantaneous function of the displacement, delayed at 30 or 60 milliseconds after the displacement or led the displacement (by means of Kalman predictor) by 50 milliseconds. It was assumed that, to estimate sti fness, the brain relates the experienced interaction forces with the amount of penetration. The results of the experiment indicate a systematic dependence of the estimated sti fness upon the delay between position and force. When the force lagged the penetration, surfaces were perceived as sti fer. Conversely, when the force led the penetration, surfaces were perceived as softer. The perceptual findings were compared with different regression models. This allowed some candidate models to be discarded. To further refine the analysis, a second experiment was carried out in which the delay was introduced only during part of the hand/surface interaction, either while the hand was moving into the spring-like surface or when it was moving out of it. Findings are consistent with sti fness estimates based on dividing the maximum force by the perceived amount of penetration. Findings are not consistent with an estimate of compliance based on the maximum position or local sti fness on the way out nor with linear estimates of sti fness based on the entire force/motion history.
The Organization and Use of Parallel Memories
Authors: P. Budnik, D. J. Kuck
Venue: IEEE Transactions on Computers (1971)

As computer CPUs get faster, primary memories tend to be organized in parallel banks. The fastest machines now being developed can fetch of the order of 100 words in parallel. Unless memory and compiler designers are careful, serious memory conflicts and resulting performance degradation may result. Some of the important questions of design and use of such memories are discussed.
Prediction of Protein-Protein Interacting Sites by Combining SVM Algorithm with Bayesian Method
Authors: Bing Wang, Lu Sheng Ge, De-Shuang Huang, Hau San Wong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The ability to identity protein-protein binding sites has important implications for drug design and understanding cell activity. This paper presents a method that can predict protein binding sites of transient protein-protein interactions using protein residue conservation and evolution information, i.e., spatial sequence profile, sequence information entropy and evolution rate. A two-stage predictor is constructed to predict surface residues are participated into protein-protein interface. The first stage consists of three predictors based on support vector machines (SVM) algorithm. Bayesian discrimination is used at the second stage by considering the predicted labels of spatial neighbor residues. The improvement of prediction performances exploits that binding site tend to form spatial cluster. Our proposed approach is promising which can be verified by its better prediction performance based on a non-redundant data set of transient protein-protein heterodimers.
General Division in the Symmetric Residue Number System
Authors: E. Kinoshita
Venue: IEEE Transactions on Computers (1973)

In the residue number system, the arithmetic operations of addition, subtraction, and multiplication are executed in the same period of time without the need for interpositional carry. There is a hope for high-speed operation if residue arithmetic is used for digital computation. The division process, which is one of the difficulties of this operation, is developed in the symmetric residue number system. The method described here is iterative in nature and requires the availability of two tables of the symmetric residue representations of a certain kind of integer. An algorithm for general division is derived, and the way of choosing the entries which are used to find a quotient is discussed.
Using word similarity to eradicate junk emails
Authors: Maria S. Pera, Yiu-Kai Ng
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Emails are one of the most commonly used modern communication media these days; however, unsolicited emails obstruct this otherwise fast and convenient technology for information exchange and jeopardize the continuity of this popular communication tool. Waste of valuable resources and time and exposure to offensive content are only a few of the problems that arise as a result of junk emails. In addition, the monetary cost of processing junk emails reaches billions of dollars per year and is absorbed by public users and Internet service providers. Even though there has been extensive work in the past dedicated to eradicate junk emails, none of the existing junk email detection approaches has been highly successful in solving these problems, since spammers have been able to infiltrate existing detection techniques. In this paper, we present a new tool, JunEX, which relies on the content similarity of emails to eradicate junk emails. JunEX compares each incoming email to a core of emails marked as junk by each individual user to identify unwanted emails while reducing the number of legitimate emails treated as junk, which is critical. Conducted experiments on JunEX verify its high accuracy.
Moment Invariants for the Analysis of 2D Flow Fields
Authors: Michael Schlemmer, Manuel Heringer, Florian Morr, Ingrid Hotz, Martin Hering-Bertram, Christoph Garth, Wolfgang Kollmann, Bernd Hamann, Hans Hagen
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present a novel approach for analyzing two-dimensional (2D) flow field data based on the idea of invariant moments. Moment invariants have traditionally been used in computer vision applications, and we have adapted them for the purpose of interactive exploration of flow field data. The new class of moment invariants we have developed allows us to extract and visualize 2D flow patterns, invariant under translation, scaling, and rotation. With our approach one can study arbitrary flow patterns by searching a given 2D flow data set for any type of pattern as specified by a user. Further, our approach supports the computation of moments at multiple scales, facilitating fast pattern extraction and recognition. This can be done for critical point classification, but also for patterns with greater complexity. This multi-scale moment representation is also valuable for the comparative visualization of flow field data. The specific novel contributions of the work presented are the mathematical derivation of the new class of moment invariants, their analysis regarding critical point features, the efficient computation of a novel feature space representation, and based upon this the development of a fast pattern recognition algorithm for complex flow structures.
Synthesis of test purpose directed reactive planning tester for nondeterministic systems
Authors: Jüri Vain, Kullo Raiend, Andres Kull, Juhan P. Ernits
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

We describe a model-based construction of an online tester for black-box testing of the implementation under test(IUT). The external behaviour of the IUT is modelled as an output observable nondeterministic EFSM with the assumption that all transition paths are feasible. A test purpose is attributed to the IUT model by a set of Boolean variables called traps that are used to measure the progress of the test run. These variables are associated with the transitions of the IUT model. The situation where all traps have been reached means that the test purpose has been achieved. We present a way to construct a tester that at runtime selects a suboptimal test path from trap to trap by finding the shortest path to the next unvisited trap. The principles of reactive planning are implemented in the form of the decision rules of selecting the shortest paths at runtime. The decision rules are constructed in advance from the IUT model and the test purpose. Preliminary experimental results confirm that this method clearly out performs random choice and is better than the anti-ant algorithm in terms of resultant test sequence length to achieve the test purpose
Probabilistic Analysis of a Molecular Quantum-Dot Cellular Automata Adder
Authors: Timothy J. Dysart, Peter M. Kogge
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Since nanoelectronic devices are likely to be defective and error-prone, developing an understanding of circuit reliabilities and critical components will be required. To this end, this paper examines reliability considerations of several sample circuits when implemented in a molecular QCA technology. Probabilistic transfer matrices are used to analyze an XOR, crossover, adder, and an adder using triple modular redundancy. This provides insight in answering how reliable emerging circuit components must be to have a reliable circuit and which of these components are the most critical. As will be shown, component error rates must be at or below 10-4 for an adder to function with 99% reliability and that the straight wire and majority gate are the most critical components to each circuit's reliability. It is also shown that the common assumption made in triple modular redundancy theory that only gates fail is insufficient for QCA.
Point/Counterpoint
Authors: Donald Ferguson, Richard Veryard
Venue: IEEE Software (2007)

"Point Argument: Transition to Service Centric: Tools Drive Business-Model Development," by Donald Ferguson. Well-defined tools are the primary requirement to support the industrial transition to service-oriented architecture. "Counterpoint Argument: Toward Organizational Maturity," by Richard Veryard. Tools don't bring the changes in organization and management practices necessary to use them properly. This department is part of a special issue on service-centric software systems.
Finding a Common Motif of RNA Sequences Using Genetic Programming: The GeRNAMo System
Authors: Shahar Michal, Tor Ivry, Omer Cohen, Moshe Sipper, Danny Barash
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

We focus on finding a consensus motif of a set of homologous or functionally related RNA molecules. Recent approaches to this problem have been limited to simple motifs, require sequence alignment, and make prior assumptions concerning the data set. We use genetic programming to predict RNA consensus motifs based solely on the data set. Our system -- dubbed GeRNAMo (Genetic programming of RNA Motifs) -- predicts the most common motifs without sequence alignment and is capable of dealing with any motif size. Our program only requires the maximum number of stems in the motif, and if prior knowledge is available the user can specify other attributes of the motif (e.g., the range of the motif's minimum and maximum sizes), thereby increasing both sensitivity and speed. We describe several experiments using either ferritin iron response element (IRE); signal recognition particle (SRP); or microRNA sequences, showing that the most common motif is found repeatedly, and that our system offers substantial advantages over previous methods.
Simulation, implementation and performance evaluation of a diversity enabled WCDMA mobile terminal
Authors: Jean-François Frigon, Ahmed M. Eltawil, Babak Daneshrad, Eugene Grayver, Yuan Li, Gennady Poberezhskiy
Venue: Wireless Personal Communications: An International Journal (2007)

Smart antenna array technology has been shown to greatly improve the performance of wireless communication systems. In this article, we describe the impact of smart antenna array processing at the mobile terminal for Wideband Code Division Multiple Access (WCDMA) cellular networks. Using system simulations we demonstrate the quality of service, network coverage, and network capacity improvement provided by a WCDMA dual antenna receiver and we establish a relationship between this improvement and the link level performance. We then describe a receiver architecture for a dual antenna WCDMA mobile receiver. The proposed receiver was implemented, as part of a complete mobile terminal solution, in an ASIC using a 0.18 μm, 1.8 V CMOS technology. The ASIC was integrated with RF, analog and digital components in a PCMCIA card form factor. The PCMCIA is a 3GPP compliant user equipment and has been submitted to standardized performance and conformance tests. Experimental measurements gathered with the PCMCIA card illustrate the impact of a diversity enabled mobile data terminal on the link level performance. For various propagation environments and transmission data rates, improvements in the range of 2.7 --- 10 dB in the required DPCH I c/I or for a 1% Block Error Rate (BLER) were observed. These measurements are within 1.4 dB of the ideal link level simulations which indicates that the predicted improvement at the network level should also materialize. The results presented in this paper show the tremendous potential of smart antenna arrays in 3G WCDMA cellular networks and establish diversity as a viable solution for high-speed cellular communications.
Ontology development for biological systems
Authors: Alexander D. Diehl, Jamie A. Lee, Richard H. Scheuermann, Judith A. Blake
Venue: Bioinformatics (2007)

Summary: We recently implemented improvements to the representation of immunology content of the biological process branch of the Gene Ontology (GO). The aims of the revision were to provide a comprehensive representation of immunological processes and to improve the organization of immunology related terms in the GO to match current concepts in the field of immunology. With these improvements, the GO will better reflect current understanding in the field of immunology and thus prove to be a more valuable resource for knowledge representation in gene annotation and analysis in the areas of immunology related to genomics and bioinformatics. Availability: http://www.geneontology.org Contact: adiehl@informatics.jax.org
Fighting Spam on Social Web Sites: A Survey of Approaches and Future Challenges
Authors: Paul Heymann, Georgia Koutrika, Hector Garcia-Molina
Venue: IEEE Internet Computing (2007)

In recent years, social Web sites have become important components of the Web. With their success, however, has come an increasing flux of spam. If left unchecked, spam threatens to undermine resource sharing, interactivity, and openness. The authors survey three categories of potential countermeasures: those based on detection, demotion, and prevention. Although many of these countermeasures have been proposed before for email and Web spam, the authors find that their applicability to social Web sites differs. How should we evaluate spam countermeasures for social Web sites, and what future challenges might we face?