ppxscal/embedding_network huggingface dataset:
Hop ID: A Virtual Coordinate-Based Routing for Sparse Mobile Ad Hoc Networks
Authors: Yao Zhao, Yan Chen, Bo Li, Qian Zhang
Venue: IEEE Transactions on Mobile Computing (2007)

Routing in wireless communication systems such as ad hoc networks remains a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, a thrust of research has addressed these problems--the on-demand routing, geographical routing, and virtual coordinates. In this paper, we focus on geographical routing that has been shown to achieve good scalability without flooding; however, this usually requires the availability of location information and can suffer from poor routing performance and severe dead end problems, especially in sparse networks. Specifically, we propose a new Hop ID routing scheme, which is a virtual coordinate-based routing protocol and does not require any location information. This achieves excellent routing performance comparable with that obtained by the shortest path routing schemes. In addition, we design efficient algorithms for setting up the system and adapt to the node mobility quickly, and can effectively route out of dead ends. Extensive analysis and simulation show that the Hop ID based routing achieves efficient routing for mobile ad hoc networks with various density, irregular topologies and obstacles.
A Reconfigurable Power Conscious Core Wrapper and its Application to System-on-Chip Test Scheduling
Authors: Erik Larsson, Zebo Peng
Venue: Journal of Electronic Testing: Theory and Applications (2008)

The increasing test application times required for testing system-on-chips (SOCs) is a problem that leads to higher costs. For modular core based SOCs it is possibly to employ a concurrent test scheme in order to lower the test application times. To allow each core to be tested as a separate unit, a wrapper is inserted for each core, the scan chains at each core are configured into a fixed number of wrapper chains, and the wrapper chains are connected to the test access mechanism. A problem with concurrent testing is that it leads to higher power consumption as several cores are active at a time. Power consumption above the specified limit of a core or above the limit of the system will cause damage and must be avoided. The power consumption must be controlled both at core level as well as on system level. In this paper, we propose a reconfigurable power conscious core wrapper that we include in a preemptive power constrained test scheduling algorithm. The advantages with the wrapper are that the number of wrapper chains at each core can dynamically be changed during test application and the possibility, through clock gating, to select the appropriate test power consumption for each core. The scheduling technique produces optimal solutions in respect to test time and selects wrapper configurations in a systematic manner while ensuring the power limits at core level and system level are not violated. The wrapper configurations are selected such that the number of wrapper configurations as well as the number of wrapper chains at each wrapper are minimized, which minimizes the wrapper logic as well as the total TAM routing. We have implemented the technique and the experimental results show the efficiency of our approach.
Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
Authors: E. E. Ovtchinnikov
Venue: Journal of Computational Physics (2008)

The paper is concerned with algorithms for computing several extreme eigenpairs of Hermitian problems based on the conjugate gradient method. We analyse computational strategies employed by various algorithms of this kind reported in the literature and identify their limitations. Our criticism is illustrated by numerical tests on a set of problems from electronic structure calculations and acoustics.
A CGS-MSM Parallel Genetic Algorithm Based on Multi-agent
Authors: Tinghong Zhao, Zibin Man, Zhijun Wan, Guiquan Bi
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

In order to solve problem of the speed of convergence and early-maturing of the serial genetic algorithm, people begin to study the parallel genetic algorithm. However most researcher devoted to study the single way parallel genetic algorithm(PGA), while solving some combination optimizing problem, have made good result, but as to the more complicated combination optimizing problem, all have certain deficiencies. This paper propose a coarse grain size-master slaver model PGA(CGS-MSM PGA), which is make up of several coarse grain size PGA(CGS-PGA) that is combine of several master-slaver model parallel genetic algorithm(MSM-PGA), and every sub-algorithm is one Agent. This algorithm has improved the speed and precision of calculation greatly through the good communication coordination among many Agents, utilized the advantages of CGS-PGA and MSM-PGA, overcome the shortcoming of their two.
A Global Constraint for Total Weighted Completion Time
Authors: András Kovács, J. Christopher Beck
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n 4) algorithm is proposed, which makes use of the preemptive mean busy time relaxation of the scheduling problem. The solution to this problem is used to test if an activity can start at each start time in its domain in solutions that respect the upper bound on the cost of the schedule. Empirical results show that the proposed global constraint significantly improves the performance of constraint-based approaches to single-machine scheduling for minimizing the total weighted completion time. Since our eventual goal is to use the global constraint as part of a larger optimization problem, we view this performance as very promising. We also sketch the application of the global constraint to cumulative resources and to problems with multiple machines.
Improving Evolutionary Algorithms with Scouting: High---Dimensional Problems
Authors: Konstantinos Bousmalis, Jeffrey O. Pfaffmann, Gillian M. Hayes
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Evolutionary Algorithms (EAs) are common optimization techniques based on the concept of Darwinian evolution. During the search for the global optimum of a search space, a traditional EA will often become trapped in a local optimum. The Scouting-Inspired Evolutionary Algorithms (SEAs) are a recently---introduced family of EAs that use a cross---generational memory mechanism to overcome this problem and discover solutions of higher fitness. The merit of the SEAs has been established in previous work with a number of two and three-dimensional test cases and a variety of configurations. In this paper, we will present two approaches to using SEAs to solve high---dimensional problems. The first one involves the use of Locality Sensitive Hashing (LSH) for the repository of individuals, whereas the second approach entails the use of scouting---driven mutation at a certain rate, the Scouting Rate. We will show that an SEA significantly improves the equivalent simple EA configuration with higher---dimensional problems in an expeditious manner.
An Expansion Tester for Bounded Degree Graphs
Authors: Satyen Kale, C. Seshadhri
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an expansion bound &alpha;, and a parameter &epsilon;> 0, accepts the graph with high probability if its expansion is more than &alpha;, and rejects it with high probability if it is &epsilon;-far from any graph with expansion &alpha;' with degree bound d, where &alpha;' < &alpha; is a function of &alpha;. For edge expansion, we obtain $\alpha' = \Omega(\frac{\alpha^2}{d})$, and for vertex expansion, we obtain $\alpha' = \Omega(\frac{\alpha^2}{d^2})$. In either case, the algorithm runs in time $\tilde{O}(\frac{n^{(1+\mu)/2}d^2}{\epsilon\alpha^2})$ for any given constant &mu;> 0.
MIRG: A Multimedia Information Retrieval GRID System
Authors: Tae-Beom Lim, Sang Boem Lim, Kyoungro Yoon, James Lee, Seok-Pil Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Advanced in IT technologies change everyday people's life and also bring big change in the way of doing businesses and manufacture. Nowadays people faced with full of data that cannot be traced and managed by one person. Especially, digital multimedia contents are created and distributed by virtually everybody in the internet environments. And the information that the user want usually scattered around the multiple service providers and other user’s personal devices. We believe GRID is one of the good ways to find and acquire the digital contents easily, accurately and quickly among different storage resources. This paper proposes a new GRID (MIRG: Multimedia Information Retrieval GRID) system which provide fast and reliable multimedia information retrieval service based on the ETSI 102 822 standard in Web-Service environment.
Note: An improved algorithm for the longest induced path problem on k-chordal graphs
Authors: Tetsuya Ishizeki, Yota Otachi, Koichi Yamazaki
Venue: Discrete Applied Mathematics (2008)

Gavril [F. Gavril, Algorithms for maximum weight induced paths, Information Processing Letters 81 (2002) 203-208] showed that the length of a longest induced path for graphs having no induced cycles on more than k vertices can be computed in O(n^km) time where n and m denote the number of vertices and edges, respectively. In this paper, we present an O(n^k) time algorithm for the same problem.
OpenPGP-Based Financial Instruments and Dispute Arbitration
Authors: Daniel A. Nagy, Nadzeya V. Shakel
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

In this paper, we present some guidelines for implementing various financial instruments for the purposes of credit and payment, including protocols for commercial transactions, dispute resolution, and establishing credit reputation. We strive to employ only widely used, standardized cryptography and keep the proposed procedures as simple as possible on the conceptual level. Also, we want all the documents to resemble their paper-based counterparts as closely as possible and be readable by humans, while also facilitating automated processing by computers. The presented results are being actively implemented within the ePoint System framework.
Harmful Contents Classification Using the Harmful Word Filtering and SVM
Authors: Wonhee Lee, Samuel Sangkon Lee, Seungjong Chung, Dongun An
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

As World Wide Web is more popularized nowadays, it is also creating many problems due to uncontrolled flood of information. The pornographic, violent and other harmful information freely available to the youth, who must be protected by the society, or other users who lack the power of judgment or self-control is creating serious social problems. To resolve those harmful words, various methods proposed and studied. This paper proposes and implements the protecting system that protects internet youth user from harmful contents. To effectively classify harmful/harmless contents, this system uses two steps of classification: harmful word filtering and SVM learning based filtering. We achieved result that the average precision of 92.1%.
UU Database: A Spoken Dialogue Corpus for Studies on Paralinguistic Information in Expressive Conversation
Authors: Hiroki Mori, Tomoyuki Satake, Makoto Nakamura, Hideki Kasuya
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The Utsunomiya University (UU) Spoken Dialogue Database for Paralinguistic Information Studies, now available to the public, is introduced. The UU database is intended mainly for use in understanding the usage, structure and effect of paralinguistic information in expressive Japanese conversational speech. This paper describes the outline, design, building, and key properties of the UU database, to show how the corpus meets the demands of speech scientists and developers who are interested in the nature of expressive dialogue speech.
A quickly trainable hybrid SOM-based document organization system
Authors: Renato Fernandes Corrêa, Teresa Bernarda Ludermir
Venue: Neurocomputing (2008)

The large volume of nowadays document collections has increased the need of fast trainable document organization systems. This paper presents and evaluates a hybrid system to self-organization of massive document collections based on self-organizing map (SOM). The hybrid system uses prototypes generated by a clustering algorithm to train the document maps, thus reducing the training time of large maps. We test the system with k-means and modified leader clustering algorithms. The experiments are carried out with the Reuters-21758 v1.0 and 20 Newsgroup collections. The performance of the system is measured in terms of text categorization effectiveness on test set and training time. Experimental results show that the proposed system generates effective document maps in less time than SOM. However, the hybrid system using k-means generates better document maps than the one using modified leader at the cost of more long training time.
Inference of Reference Immutability
Authors: Jaime Quinonez, Matthew S. Tschantz, Michael D. Ernst
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Javari is an extension of Java that supports reference immutability constraints. Programmers write readonly type qualifiers and other constraints, and the Javari typechecker detects mutation errors (incorrect side effects) or verifies their absence. While case studies have demonstrated the practicality and value of Javari, a barrier to usability remains. A Javari program will not typecheck unless all the references in the APIs of libraries it uses are annotated with Javari type qualifiers. Manually converting existing Java libraries to Javari is tedious and error-prone.We present an algorithm for inferring reference immutability in Javari. The flow-insensitive and context-sensitive algorithm is sound and produces a set of qualifiers that typecheck in Javari. The algorithm is precise in that it infers the most readonly qualifiers possible; adding any additional readonly qualifiers will cause the program to not typecheck. We have implemented the algorithm in a tool, Javarifier, that infers the Javari type qualifiers over a set of class files.Javarifier automatically converts Java libraries to Javari. Additionally, Javarifier eases the task of converting legacy programs to Javari by inferring the mutability of every reference in a program. In case studies, Javarifier correctly inferred mutability over Java programs of up to 110 KLOC.
Discovering and Exploiting Program Phases
Authors: Timothy Sherwood, Erez Perelman, Greg Hamerly, Suleyman Sair, Brad Calder
Venue: IEEE Micro (2003)

In a single second, a modern processor can execute billions of instructions and a program's behavior can change many times. Some programs change behavior drastically, switching between periods of high and low performance, yet system design and optimization typically focus on average system behavior. Instead of assuming average behavior, it is now time to model and optimize phase-based program behavior.
Simulations for American Option Pricing Under a Jump-Diffusion Model: Comparison Study between Kernel-Based and Regression-based Methods
Authors: Hyun-Joo Lee, Seung-Ho Yang, Gyu-Sik Han, Jaewook Lee
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

There is no exact analytic formula for valuing American option even in the diffusion model because of its early exercise feature. Recently, Monte Carlo simulation (MCS) methods are successfully applied to American option pricing, especially under diffusion models. They include regression-based methods and kernel-based methods. In this paper, we conduct a performance comparison study between the kernel-based MCS methods and the regression-based MCS methods under a jump-diffusion model.
Improve Flow Accuracy and Byte Accuracy in Network Traffic Classification
Authors: Haitao He, Chunhui Che, Feiteng Ma, Xiaonan Luo, Jianmin Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Most of the current network traffic classification approaches employ single classifier method with achieving lower accuracy under small training set. Different from high flow accuracy, byte accuracy, as an important metric for network traffic classification, is usually ignored by many researchers. To address these two problems, this paper proposes a novel classification algorithm. It combines ensemble learning with cost-sensitive learning, which enables the classification model to achieve high flow accuracy as well as byte accuracy. By evaluating our algorithm with the real 7-day traces collected at the edge of the campus network, the results show that it can averagely obtain flow accuracy of 94% as well as byte accuracy of 81%.
Computing Convex Hulls by Automata Iteration
Authors: François Cantin, Axel Legay, Pierre Wolper
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

This paper considers the problem of computing the real convex hull of a finite set of n-dimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The convex hull can then be directly computed from this limit in the form of an automaton-based representation of the corresponding set of real vectors. The technique is quite general and has been implemented. Also, our result fits in a wider scheme whose objective is to improve the techniques for converting automata-based representation of constraints to formulas.
Legal expert systems in social administration: From fearing computers to fearing accountants
Authors: Jörgen S. Svensson
Venue: Information Polity (2002)

In the nineteen-eighties, the Tessec expert system was developed and several studies showed that this system could improve administrative decision making under the Netherlands' General Assistance Act. Despite this favourable evaluation, Dutch municipalities did not adopt Tessec and the development of the system was halted. Now, at the beginning of the 21st century, there is a series of new expert systems on the Dutch market, the MR-systems. These MR-systems perform the same tasks as Tessec and are in fact very similar. There is however one important difference: the MR-systems are widely used. In this article, the author tries to find a sound explanation for both the failure of Tessec, and the success of the MR systems. As he argues, this explanation can be found in a shift in attitude towards the role of legislation during the past decade. This shift has facilitated the adoption of legal expert systems.
Impact of dummy metal filling strategy dedicated to inductors integrated in advanced thick copper RF BEOL
Authors: C. Pastore, F. Gianesello, D. Gloria, E. Serret, Ph. Benech
Venue: Microelectronic Engineering (2008)

A complete strategy to manage dummy fills inside a large spectrum of integrated RF inductors realized in an advanced thick copper RF back end of line (BEOL) is presented here. The main motivation of this paper is first to evaluate through a design of experiment (DOE) modeling, the impact on RF inductor performances of dummy metal fills inserted inside the coils, and then determine the right metal fill density to insert in order to be compliant with Digital metal density rules without degrading their electrical performances.
An OVAL-based active vulnerability assessment system for enterprise computer networks
Authors: Xiuzhen Chen, Qinghua Zheng, Xiaohong Guan
Venue: Information Systems Frontiers (2008)

Many security problems are caused by vulnerabilities hidden in enterprise computer networks. It is very important for system administrators to have knowledge about the security vulnerabilities. However, current vulnerability assessment methods may encounter the issues of high false positive rates, long computational time, and requirement of developing attack codes. Moreover, they are only capable of locating individual vulnerabilities on a single host without considering correlated effect of these vulnerabilities on a host or a section of network with the vulnerabilities possibly distributed among different hosts. To address these issues, an active vulnerability assessment system NetScope with C/S architecture is developed for evaluating computer network security based on open vulnerability assessment language instead of simulating attacks. The vulnerabilities and known attacks with their prerequisites and consequences are modeled based on predicate logic theory and are correlated so as to automatically construct potential attack paths with strong operation power of relational database management system. The testing results from a series of experiments show that this system has the advantages of a low false positive rate, short running periods, and little impact on the performance of audited systems and good scalability. The security vulnerabilities, undetectable if assessed individually in a network, are discovered without the need to simulate attacks. It is shown that the NetScope system is well suited for vulnerability assessment of large-scale computer networks such as campus networks and enterprise networks. Moreover, it can also be easily integrated with other security tools based on relational databases.
Enforcing User-Aware Browser-Based Mutual Authentication with Strong Locked Same Origin Policy
Authors: Sebastian Gajek, Mark Manulis, Jörg Schwenk
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

The standard solution for mutual authentication between human users and servers on the Internet is to execute a TLS handshake during which the server authenticates using a X.509 certificate followed by the authentication of the user either with own password or with some cookie stored within the user's browser. Unfortunately, this solution is susceptible to various impersonation attacks such as phishing as it turned out that average Internet users are unable to authenticate servers based on their certificates.In this paper we address security of cookie-based authentication using the concept of strong locked same origin policy for browsers introduced at ACM CCS'07. We describe a cookie-based authentication protocol between human users and TLS-servers and prove its security in the extended formal model for browser-based mutual authentication introduced at ACM ASIACCS'08. It turns out that the small modification of the browser's security policy is sufficient to achieve provably secure cookie-based authentication protocols considering the ability of users to recognize images, video, or audio sequences.