ppxscal/embedding_network huggingface dataset:
Spam Filtering based on Preference Ranking
Authors: Mingjun Lan, Wanlei Zhou
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

When the average number of spam messages received is continually increasing exponentially, both the Internet Service Provider and the end user suffer[1-3]. The lack of an efficient solution may threaten the usability of the email as a communication means. In this paper we present a filtering mechanism applying the idea of preference ranking. This filtering mechanism will distinguish spam emails from other email on the Internet. The preference ranking gives the similarity values for nominated emails and spam emails specified by users, so that the ISP/end users can deal with spam emails at filtering points. We designed three filtering points to classify nominated emails into spam email, unsure email and legitimate email. This filtering mechanism can be applied on both middleware and at the client-side. The experiments show that high precision, recall and TCR (total cost ratio) of spam emails can be predicted for the preference based filtering mechanisms.
A structured light vision system for out-of-plane vibration frequencies location of a moving web
Authors: Christophe Doignon, Dominique Knittel
Venue: Machine Vision and Applications (2005)

In this paper, we address the problem of the detection of out-of-plane web vibrations by means of a single camera and a laser dots pattern device. We have been motivated by the important economical impact of web vibrations phenomena which occur in winding/unwinding systems. Among many sources of disturbances, out-of-plane vibrations of an elastic moving web are well-known to be one of the most limiting factors for the velocity in the web transport industry.The new technique we proposed for the contact-less estimation of out-of-plane web vibration properties and during the winding process is the main contribution of this work. As far as we know, this is the first time a technique is proposed to evaluate the vibrations of a moving web with a camera. Vibration frequencies are estimated from distance variations of a web cross-section with respect to the camera.Experiments have been performed on a winding plant for elastic fabric with a web width of 10 cm. Distances from the web surface to the camera have been estimated all along an image sequence and the most significant frequencies have been extracted from the variations of this signal (forced and free vibrations) and compared to those provided with strain gauges and also with a simple elastic string model, in motion.
Coordination and Geometric Optimization via Distributed Dynamical Systems
Authors: Jorge Cortés, Francesco Bullo
Venue: SIAM Journal on Control and Optimization (2005)

This paper discusses dynamical systems for disk-covering and sphere-packing problems. We present facility location functions from geometric optimization and characterize their differentiable properties. We design and analyze a collection of distributed control laws that are related to nonsmooth gradient systems. The resulting dynamical systems promise to be of use in coordination problems for networked robots; in this setting the distributed control laws correspond to local interactions between the robots. The technical approach relies on concepts from computational geometry, nonsmooth analysis, and the dynamical system approach to algorithms.
Simplifying reductions
Authors: Gautam, S. Rajopadhye
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benchmarks are ACLs. They often contain reductions: associative and commutative operators applied to a collection of values. They also often exhibit reuse: intermediate values computed or used at different index points being identical. We develop various techniques to automatically exploit reuse to simplify the computational complexity of evaluating reductions. Finally, we present an algorithm for the optimal application of such simplifications resulting in an equivalent specification with minimum complexity.
PTT + IMS = PTM - Towards Community/Presence-based IMS Multimedia Services
Authors: Niklas Blum, Thomas Magedanz
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The specification of the IP Multimedia Subsystem as a service delivery architecture for Next Generation Networks and the introduction of Push-To-Talk (PTT) as an IMSbased service moves VoIP applications for mobile devices already to the market. PTT has gained a strong following in the US market and is on the verge of spreading globally. The Open Mobile Alliance (OMA) currently specifies PTT as an IMS-based service to assure interoperability between different operator domains. Most PTT solution vendors think already about extending PTT with other media types then voice, like video communication, file transfer or service subscription for content push services. Thus, Push- To-MultiMedia (PTM) does not seem to be that far away from market and is well suited as an enabler to provide IMS applications with advanced multimedia communication functionalities. The department for Next Generation Network Integration (NGNI) at Fraunhofer Institute FOKUS has created a PTM application that utilises the IMS architecture. This paper reports about a concept of integrating this PTT/PTM functionality in community-based applications to enable already existing groups and communities with new communication features.
On the Stationarity of Multivariate Time Series for Correlation-Based Data Analysis
Authors: Kiyoung Yang, Cyrus Shahabi
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Multivariate time series (MTS) data sets are common in various multimedia, medical and financial application domains. These applications perform several data-analysis operations on large number of MTS data sets such as similarity searches, feature-subset-selection, clustering and classifications. Correlation-based techniques, such as Principal Component Analysis (PCA), have proven to improve the efficiency of many of the above-mentioned data-analysis operations on MTS, which implies that the correlation coefficientsconcisely represent the original MTS data. However, if the statistical properties (e.g., variance) of MTS data change over time dimension, i.e., MTS data is non-stationary, the correlation coefficients are not stable. In this paper, we propose to utilize the stationarity of the MTS data sets, in order to represent the original MTS data more stably, as well as concisely with the correlation coefficients. That is, before performing any correlation-based data analysis, we first executes the stationarity test to decide whether the MTS data is stationary or not, i.e., whether the correlation is stable or not. Subsequently, for a non-stationary MTS data set, we difference it to render the data set stationary. Even though our approach is general, to focus the discussion we describe our approach within the context of our previously proposed technique for MTS similarity search. In order to show the validity of our approach, we performed several experiments on four real-world data sets. The results show that the performance of our similarity search technique have significantly improved in terms of precision/recall.
CloseMiner: Discovering Frequent Closed Itemsets Using Frequent Closed Tidsets
Authors: N. Gourakishwar Singh, S. Ranbir Singh, Anjana K. Mahanta
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Complete set of itemsets can be grouped into non-overlapping clusters identified by closed tidsets. Each cluster has only one closed itemset and is the superset of all itemsets with the same support. Number of closed itemsets is identical to the number of clusters. Therefore, the problem of discovering closed itemsets can be considered as the problem of clustering the complete set of itemsets by closed tidsets. In this paper, we present CloseMiner, a new algorithm for discovering all frequent closed itemsets by grouping the complete set of itemsets into non-overlapping clusters identified by closed tidsets. An extensive experimental evaluation on a number of real and synthetic databases shows that CloseMiner outperforms Apriori and CHARM.
Trustworthy Web Services Based on Testing
Authors: Weider D. Yu, Passarawarin Supthaweesuk, Dhanya Aravind
Venue: Proceedings of the IEEE International Workshop (2005)

The Web Services technology allows software components independently developed in disparate platforms to communicate in a seamless manner. They constitute a loosely-coupled, distributed system that is highly scalable. But, they also inherit the vulnerabilities of such systems. As Web Services increase in complexity and connectivity, the associated security risks also increase exponentially. Many of the security breaches can be traced back to poor testing. In this paper, research on security vulnerabilities in SOAP-based Web Services is presented. The security context of traditional Web applications is compared to that of Web Services. An attempt is made to map common attack patterns to security testing requirements with regard to Web Services.
Designing desirability in an augmentative and alternative communication device
Authors: Jonathon Allen
Venue: Universal Access in the Information Society (2005)

This paper discusses work carried in the context of a study addressing the design and development of a wearable communication aid for people who are illiterate and cannot speak. People with such disabilities often depend on electronic augmentative and alternative communication devices for interpersonal communication. A central theme of the paper, however, is that such products, and products intended for people with disabilities more generally, have characteristics that inadequately attend to users&#x2019; needs&#x2014;in particular many devices pay insufficient regard to the psychological and sociological impact the devices have upon their users. The paper briefly discusses an empirical case study targeted to design and develop the Portland Communication Aid (PCA). The process of establishing user requirements, and in particular the notion of designer-facilitated participatory design, is discussed. The resulting prototype of the PCA is briefly explained along with a discussion of the importance of product semantics in the design of assistive technology.
Engineering modelling and design subject to model uncertainties and manufacturing tolerances
Authors: John W. Bandler
Venue: ACM SIGSIM Simulation Digest (1977)

This paper deals principally with engineering design problems in which either a large volume of production is envisaged, e.g., integrated circuits, or in which only a few units are to be custom made, e.g., filters for satellite applications. All designs are considered subject to manufacturing tolerances (e.g., on physical dimensions), material uncertainties, (e.g., on temperature), model uncertainties (e.g., on equivalent circuits) and so on. Attention is directed in this presentation towards the modelling, the design and the manufacture of electrical circuits such as filters, amplifiers and switching circuits. Hence, certain undesirable effects which deteriorate performance may be due to electromagnetic coupling and mismatched terminations, particularly at high frequencies.
Coarticulation: an approach for generating concurrent plans in Markov decision processes
Authors: Khashayar Rohanimanesh, Sridhar Mahadevan
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We study an approach for performing concurrent activities in Markov decision processes (MDPs) based on the coarticulation framework. We assume that the agent has multiple degrees of freedom (DOF) in the action space which enables it to perform activities simultaneously. We demonstrate that one natural way for generating concurrency in the system is by coarticulating among the set of learned activities available to the agent. In general due to the multiple DOF in the system, often there exists a redundant set of admissible sub-optimal policies associated with each learned activity. Such flexibility enables the agent to concurrently commit to several subgoals according to their priority levels, given a new task defined in terms of a set of prioritized subgoals. We present efficient approximate algorithms for computing such policies and for generating concurrent plans. We also evaluate our approach in a simulated domain.
An Integrated Approach for Combining BDD and SAT Provers
Authors: Rolf Drechsler, Gorschwin Fey, Sebastian Kinder
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based on Boolean Satisfiability (SAT). Recent studies have shown that BDDs and SAT are orthogonal, i.e. there exist problems where BDDs work well, while SAT solvers fail and vice versa. Beside this, the techniques are very different in general. E.g. SAT solvers try to find a single solution and BDDs represent all solutions in parallel. In this paper the first integrated approach is presented that combines BDDs and SAT within a single data structure. This hybrid approach combines the advantages of the two techniques, i.e. multiple solutions can be computed while the memory requirement remains small. First experimental results demonstrate the quality of the approach in comparison to BDDs and SAT solvers.
IDGraphs: Intrusion Detection and Analysis Using Histographs
Authors: Pin Ren, Yan Gao, Zhichun Li, Yan Chen, Benjamin Watson
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

Traffic anomalies and attacks are commonplace in today's networks and identifying them rapidly and accurately is critical for large network operators. For a statistical intrusion detection system (IDS), it is crucial to detect at the flow-level for accurate detection and mitigation. However, existing IDS systems offer only limited support for 1) interactively examining detected intrusions and anomalies, 2) analyzing worm propagation patterns, 3) and discovering correlated attacks. These problems are becoming even more acute as the traffic on today's high-speed routers continues to grow. IDGraphs is an interactive visualization system for intrusion detection that addresses these challenges. The central visualization in the system is a flow-level trace plotted with time on the horizontal axis and aggregated number of unsuccessful connections on the vertical axis. We then summarize a stack of tens or hundreds of thousands of these traces using the Histographs[23] technique, which maps data frequency at each pixel to brightness. Users may then interactively query the summary view, performing analysis by highlighting subsets of the traces. For example, brushing a linked correlation matrix view highlights traces with similar patterns, revealing distributed attacks that are difficult to detect using standard statistical analysis. We apply IDGraphs system to a real network router data-set with 179M flow-level records representing a total traffic of 1.16TB. The system successfully detects and analyzes a variety of attacks and anomalies, including port scanning, worm outbreaks, stealthy TCP SYN floodings, and some distributed attacks.
Calibrating quantum chemistry: A multi-teraflop, parallel-vector, full-configuration interaction program for the Cray-X1
Authors: Zhengting Gan, Robert J. Harrison
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

We describe an efficient parallel and vector algorithm for solving huge eigen-vector problems in quantum chemistry. An automatically adaptive, single-vector, iterative diagonalization method was also developed to reduce the memory requirement and avoid an I/O bottleneck. Our initial full-configuration interaction calculation solved for an eigenvector with 65 billion coefficients and was performed on 432 MSPs of the Oak Ridge National Laboratory Cray-X1. One matrixvector multiplication took about 4 minutes, with 25 iterations being required for a tightly converged result. The aggregate performance was 3.4TFLOP/s (62% of peak speed).
A corpus for OCR research on mathematical expressions
Authors: Utpal Garain, B. Chaudhuri
Venue: International Journal on Document Analysis and Recognition (2005)

This paper is concerned with research on OCR (optical character recognition) of printed mathematical expressions. Construction of a representative corpus of technical and scientific documents containing expressions is discussed. A statistical investigation of the corpus is presented, and usefulness of this analysis is demonstrated in the related research problems, namely, (i) identification and segmentation of expression zones from the rest of the document, (ii) recognition of expression symbols, (iii) interpretation of expression structures, and (iv) performance evaluation of a mathematical expression recognition system. Moreover, a groundtruthing format has been proposed to facilitate automatic evaluation of expression recognition techniques.
An Efficient Generalized Deadlock Detection and Resolution Algorithm in Distributed Systems
Authors: Nacer Farajzadeh, Mehdi Hashemzadeh, Morteza Mousakhani, Abolfazl T. Haghighat
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper we propose a distributed deadlock detection algorithm on the basis of history-based edge chasing which resolves the deadlock as soon as detects it without waiting for the probe to return back. This action reduces the average persistence time of the deadlock in compare with other similar algorithms in distributed systems. Our proposed algorithm detects and resolves the deadlocks, whether the initiator directly or indirectly involves them and the useless messages in simultaneous execution of the algorithm are avoided by giving the priorities to the processes. It can also manage the simultaneous execution of the algorithm by its unique characteristic, using other nodes involved in deadlocks and prevents the detection of same deadlocks. We also minimized the information being carried in the probe offering a method to encode the information existed in probe in our suggested algorithm. Our algorithm is comparable with the best algorithms in case of its time complexity, the number of the messages and its efficiency.
Descriptional complexity of rewriting P systems
Authors: Mutyam Madhu
Venue: Journal of Automata, Languages and Combinatorics (2004)

In this paper we generalize to rewriting P systems some measures of descriptional complexity defined for context-free grammars and analyze these measures in lieu with those for the context-free grammars.
Problem oriented protocol design
Authors: David M. Nicol, Paul F. Reynolds,  Jr.
Venue: ACM SIGSIM Simulation Digest (1985)

The prevention of deadlock in certain types of distributed simulation systems requires special synchronization protocols. These protocols often create an excessive amount of performance-degrading communication; yet a protocol with the minimum amount of communication may not lead to the fastest network finishing time. We propose a protocol that attempts to balance the network's need for auxiliary synchronization information with the cost of providing that information. Using an empirical study, we demonstrate the efficiency of this protocol. Also, we show that the synchronization requirements at different interfaces may vary; an integral part of our proposal assigns a protocol to an interface according to the interface's synchronization needs.
A New Multi-Processor Architecture for Parallel Lazy Cyclic Reference Counting
Authors: Rafael Dueire Lins
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Reference counting is the memory management technique of most widespread use today. This paper presents a new multi-processor architecture for parallel cyclic reference counting. In this architecture, there is no direct Mutator-Collector communication and synchronization is kept minimal.
Fast dictionary attacks on passwords using time-space tradeoff
Authors: Arvind Narayanan, Vitaly Shmatikov
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to brute-force dictionary attacks, many organizations enforce complicated password-creation rules and require that passwords include numerals and special characters. We demonstrate that as long as passwords remain human-memorable, they are vulnerable to "smart-dictionary" attacks even when the space of potential passwords is large.Our first insight is that the distribution of letters in easy-to-remember passwords is likely to be similar to the distribution of letters in the users' native language. Using standard Markov modeling techniques from natural language processing, this can be used to dramatically reduce the size of the password space to be searched. Our second contribution is an algorithm for efficient enumeration of the remaining password space. This allows application of time-space tradeoff techniques, limiting memory accesses to a relatively small table of "partial dictionary" sizes and enabling a very fast dictionary attack.We evaluated our method on a database of real-world user password hashes. Our algorithm successfully recovered 67.6% of the passwords using a 2 x 109 search space. This is a much higher percentage than Oechslin's "rainbow" attack, which is the fastest currently known technique for searching large keyspaces. These results call into question viability of human-memorable character-sequence passwords as an authentication mechanism.
G2DGA: an adaptive framework for internet-based distributed genetic algorithms
Authors: Johan Berntsson
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

The Internet is different from traditional parallel computing environments, and Distributed Genetic Algorithms (DGAs) for the Internet need to be designed to address these differences. This paper presents a framework for Internet island model DGAs that uses adaptation methods to maintain efficiency and robustness in a volatile and dynamic run-time environment. The applicability of the methods is demonstrated on benchmark tests, and a real-world optimization problem in VLSI design.
Place Metaphors in Educational Cyberworlds: a Virtual Campus Case Study
Authors: Ekaterina Prasolova-Forland, Alexei Sourin, Olga Sourina
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In the recent years, the usage of 3D cyberworlds for educational purposes has increased. The metaphors behind the design of virtual places are quite diverse, from replication of real universities to art museums and scientific labs. Based on the results of a case study we have performed, this paper provides an initial set of requirements for a cyberworld representing an existing university. In this connection, we analyze place metaphors and associated design features of the Virtual Campus of Nanyang Technological University in Singapore in the context of related work. Finally, we discuss the correspondence between the identified metaphors and associated educational goals, providing directions for further development of the Virtual Campus.