ppxscal/embedding_network huggingface dataset:
Isoperimetric Problem and Meta-fibonacci Sequences
Authors: B. V. Bharadwaj, L. S. Chandran, Anita Das
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Let G = (V,E) be a simple, finite, undirected graph. For S ¿ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$, such that (u,v) ¿ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ¿ V ¿, the edge and vertex isoperimetric value at i is defined as b e (i,G) = min S ¿ V; |S| = i |¿(S,G)| and b v (i,G) = min S ¿ V; |S| = i |¿(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i.Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book "Gödel, Escher, Bach. An Eternal Golden Braid". The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i ¿ 1 ¿ a(i ¿ 1)) + a(i ¿ 2 ¿ a(i ¿ 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 ¿ 2a(i), for each i ¿ 1.We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.
Hierarchical Agglomerative Clustering of Short-Circuit Faults in Transmission Lines
Authors: Claudomir Cardoso, Yomara Pires, Jefferson Morais, Aldebaro Klautau
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

Data mining can play a fundamental role in modern power systems. However, a major problem is to extract useful information from the currently available non-labeled digitized time series. This work proposes a new methodology based on hierarchical clustering for labeling faults that occurred in transmission lines. A graphical user interface can benefit from the complementary information provided by the methodology. These faults are responsible for the majority of the disturbances and cascading blackouts. Simulation results using the public dataset UFPA faults are presented to validate the proposed method.
WebIBC: Identity Based Cryptography for Client Side Security in Web Applications
Authors: Zhi Guan, Zhen Cao, Xuan Zhao, Ruichuan Chen, Zhong Chen, Xianghao Nan
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

The growing popularity of web applications in the last few years has led users to give the management of their data to online application providers, which will endanger the security and privacy of the users. In this paper, we present WebIBC, which integrates public key cryptography into web applications without any browser plugins. The public key of WebIBC is provided by identity based cryptography, eliminating the need of public key and certificate online retrieval; the private key is supplied by the fragment identifier of the URL inspired by BeamAuth. The implementation and performance evaluation demonstrate that WebIBC is secure and efficient both in theory and practice.
An Improved Collision Attack on MD5 Algorithm
Authors: Shiwei Chen, Chenhui Jin
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

The research on the attack algorithm for a MD5 collision is one of the focuses in cryptology nowadays. In this paper, by analyzing the properties of the nonlinear Boolean functions used in MD5 and the differences in term of XOR and subtraction modulo 2 32, we prove that some sufficient conditions presented by Jie Liang and Xuejia Lai are also necessary to guarantee the differential path and give a set of necessary and sufficient conditions to guarantee the output differences of the last two steps. Then we present an improved collision attack algorithm on MD5 by using the set of necessary and sufficient conditions. Finally, we analyze the computational complexity of our attack algorithm which is 0.718692 times of that of the previous collision attack algorithms.
Parallel Crawling and Capturing for On-Line Auction
Authors: Cheng-Hsien Yu, Shi-Jen Lin
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

The on-line auction is one of the most successful types of electronic marketplaces and has been the subject of many academic studies. In recent years, empirical research on on-line auction has been flourishing because of the availability of large amounts of high-quality bid data from on-line auction sites. Researcher can provide buyers and sellers with useful information, and help prevent fraud and reduce purchase cost. However, the increasingly large volumes of bid data have made data collection increasingly complex and time consuming, and there are no effective resources that can adequately support this work. So this study focuses on the parallel crawling and capturing of on-line auctions from the automatic agent perspective to help researchers collect auction data more effectively. The issues in this study include parallel crawling architecture, crawling strategies, content capturing strategies, and prototype system implementation. Finally we conduct an empirical experiment on eBay U.S. and Ruten Taiwan to evaluate the performance of our parallel crawling and capturing. The results of this study show that our parallel crawling and capturing methodology is able to work in the real world and generate good performance outcomes.
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
Authors: Michele Zorzi, Ramesh R. Rao
Venue: IEEE Transactions on Mobile Computing (2003)

In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its energy and latency performance. A simplified analysis is given first, some relevant trade offs are highlighted, and parameter optimization is pursued. Further, a semi-Markov model is developed which provides a more accurate performance evaluation. Simulation results supporting the validity of our analytical approach are also provided.
Relaxing Goodness Is Still Good
Authors: Gordon J. Pace, Gerardo Schneider
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

Polygonal hybrid systems (SPDIs) are planar hybrid systems, whose dynamics are defined in terms of constant differential inclusions, one for each of a number of polygonal regions partitioning the plane. The reachability problem for SPDIs is known to be decidable, but depends on the goodness assumption -- which states that the dynamics do not allow a trajectory to both enter and leave a region through the same edge. In this paper we extend the decidability result to generalised SPDIs (GSPDI), SPDIs not satisfying the goodness assumption, and give an algorithmic solution to decide reachability of such systems.
Mathematical model for storing and effective processing of directed graphs in semistructured data management systems
Authors: A. Malikov, Y. Gulevskiy, D. Parkhomenko
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Methods for managing semistructured data, represented as directed graphs are presented and analyzed. Relational structures for storage and original mathematical methods for effective management of semistructured data are suggested. Benchmarks results of data base queries are given. Advantages and disadvantages of such mathematical apparatus practical use are defined.
Overview of the WiQA Task at CLEF 2006
Authors: Valentin Jijkoun, Maarten Rijke
Venue: Evaluation of Multilingual and Multi-modal Information Retrieval: 7th Workshop of the Cross-Language Evaluation Forum, CLEF 2006, Alicante, Spain, September 20-22, 2006, Revised Selected Papers (2007)

We describe WiQA 2006, a pilot task aimed at studying question answering using Wikipedia. Going beyond traditional factoid questions, the task considered at WiQA 2006 was to return--given an source page from Wikipedia--to identify snippets from other Wikipedia pages, possibly in languages different from the language of the source page, that add new and important information to the source page, and that do so without repetition.A total of 7 teams took part, submitting 20 runs. Our main findings are two-fold: (i) while challenging, the tasks considered at WiQA are do-able as participants achieved impressive scores as measured in terms of yield, mean reciprocal rank, and precision, (ii) on the bilingual task, substantially higher scores were achieved than on the monolingual tasks.
Enterprise management software approaches for economical selective outsourcing by managed service providers
Authors: Marlyn Kemper Littman
Venue:  (2008)

Organizations of all types and sizes are increasingly dependent upon reliable network interconnectivity for facilitating information exchange in a global economy. Given the expanding mix of technologies and complexity of networked environments, companies frequently struggle to contain rising operational costs, optimize resource effectiveness, and retain focus on strategic objectives. Selectively outsourcing network services and computer infrastructure provides organizations with an alternative strategy to increase efficiency, improve financial performance, and become more competitive. A symbiotic arrangement is subsequently formed when the outsourcing vendor, also termed the managed service provider (MSP), is able to economically satisfy the unique needs of each customer. A fundamental problem for the MSP involves effectively and efficiently balancing individual customer needs and requirements within the existing set of base services to remain economically viable. More specifically, the existing set of base services and processes must be capable of delivering exponential value to enable management of evolving technologies. The MSP forms a critical advantage by supporting an operational environment comprised of software applications that are relevant, accurate, economical, timely, and reliable to facilitate proven processes and meet customer service level agreements (SLAs). The goal of this research was to propose an economically bounded software engineering framework and proof-of-concept monitoring application suite for effective, efficient, and extensible network management automation. A mixed methods research approach was based on the survey of secondary marketing data representing 42 commercial and open source management solutions. The findings were synthesized with the literature to describe management capabilities supporting converged networks. Additionally, software prototypes were developed to demonstrate strategic elements of the enterprise management system. Finally, quasi-experiments of eight management queries indicated significant differences between communication protocols when responding to a similar request. The results indicated that no single protocol was efficient and effective in satisfying the needs of enterprise management under all conditions. The author recommended careful selection and assessment of each management query to optimize the ability for the MSP to economically scale while meeting customer expectations. Further, the MSP should be capable of providing adaptable monitoring mechanisms, and encourage the use of exception-based and publish/subscribe data acquisition.
Object following control for wheeled mobile robots
Authors: Adrian Korodi, Alexandru Codrean, Liviu Banita, Vlad Ceregan, Anamaria Butaru, Radu Carnaru
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The number of researches focusing on wheeled mobile robots is increasing. One of the important tasks realized by the wheeled mobile robots is the object following task. Particularly, this task is used for cooperative robots, or for reaching a detected object in the environment. The aim of this paper is to provide a control strategy for wheeled mobile robots realizing the object following task. Infrared and sonar sensors are used to provide the inputs for the controller. The control strategy takes into consideration that the robot moves in a dynamic environment and it has to follow the target object regardless of other interfering elements.
Benefits of Anticipations in Cognitive Agents
Authors: Martin V. Butz, Giovanni Pezzulo
Venue: The Challenge of Anticipation: A Unifying Framework for the Analysis and Design of Artificial Cognitive Systems (2008)

This book proposes the anticipatory approach for the design of cognitive agents. That is, we propose to implement anticipatory mechanisms in artificial cognitive systems to generate highly flexible and adaptive systems that can efficiently cope with dynamic environments. While the first two chapters identified several different facets of anticipatory mechanisms, this chapter focuses on the benefits and potential drawbacks of using these types of anticipatory mechanisms in cognitive systems. We focus hereby on the explicit forms of anticipation defined in the previous chapter.Thus, this chapter intends to answer questions such as: "What are the specific advantages of anticipatory mechanisms and capabilities?", or "Why should we endow artificial cognitive agents with anticipation?", as well as, "Are there any disadvantages in doing so?"This chapter first identifies three general potential beneficial aspects of anticipations and then provides concrete examples of the impact of anticipation in several cognitive functions such as motor control, learning, attention, and social interaction. Section 3.3 points out that anticipations might not always be advantageous and may sometimes interfere with effective behavioral execution--especially when the involved predictions are inaccurate or not synchronized well.Finally, we summarize and draw conclusions.
Cooperative Management Framework for Inter-domain Routing System
Authors: Ning Hu, Peng Zou, Peidong Zhu, Xin Liu
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

The inter-domain routing system consists of many interconnected Autonomous Systems (ASes) which are independently operated and usually have different routing policies. Due to lack of effective coordinative mechanism, policy conflicts may arise, which can cause various problems in performance, security and robustness. To facilitate the collaboration among ASes, we propose an ISP-oriented inter-domain routing system cooperative management framework CMF based on the self-organization method. CMF provides fundamental support to the ISP's cooperation which includes organization structure, mechanisms and applications. CMF can help ISPs alleviate the side effect caused by the autonomy and selfishness of AS. The framework is generic solution, which can be used not only in inter-domain routing operation, but also in other related fields such as intrusion detection and network measurement.
A Formal Approach for User Interaction Reconfiguration of Safety Critical Interactive Systems
Authors: David Navarre, Philippe Palanque, Sandra Basnyat
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

The paper proposes a formal description technique and a supporting tool that provide a means to handle both static and dynamic aspects of input and output device configurations and reconfigurations. More precisely, in addition to the notation, the paper proposes an architecture for the management of failure on input and output devices by means of reconfiguration of in/output device configuration and interaction techniques. Such reconfiguration aims at allowing operators to continue interacting with the interactive system even though part of the hardware side of the user interface is failing. These types of problems arise in domains such as command and control systems where the operator is confronted with several display units. The contribution presented in the paper thus addresses usability issues (improving the ways in which operators can reach their goals while interacting with the system) by increasing the reliability of the system using diverse configuration both for input and output devices.
BIRD: Biomedical Information Integration and Discovery with Semantic Web Services
Authors: Juan Miguel Gomez, Mariano Rico, Francisco García-Sánchez, Ying Liu, Marília Terra Mello
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

Biomedical research is now information intensive; the volume and diversity of new data sources challenges current database technologies. The development and tuning of database technologies for biology and medicine will maintain and accelerate the current pace for innovation and discovery. New promising application fields such as the Semantic Web and Semantic Web Services can leverage the potential of biomedical information integration and discovery, facing the problem of semantic heterogeneity of biomedical information sources in a variety of storage and data formats widely distributed both across the Internet and within individual organizations. In this paper, we present BIRD, a fully-fledged biomedical information integration solution that combines natural language analysis and semantically-empowered techniques to ascertain how the user needs can be best fit. Our approach is backed with a proof-of-concept implementation where the breakthrough and efficiency of integrating the biomedical publications database PubMed, the Database of Interacting Proteins (DIP) and the Munich Information Center for Protein Sequences (MIPS) has been tested.
Integration of an Omnidirectional Visual System with the Control Architecture of Psikharpax
Authors: Loic Lacheze, Ryad Benosman, Jean-Arcady Meyer
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

This article describes the robotic integration of a robust omnidirectional visual system with a control architecture inspired by neural structures in a rat's brain. The visual system relies on an optimal recursive sampling of images into subimages that remains stable under translation and makes self-localization and object recognition possible. The control architecture affords navigation and action selection capacities. The operationality of both systems is demonstrated through a series of experiments assessing their capacity to maintain the energy level of a robot within the limits of a given viability zone.
Feature Description Systems for Clusters by Using Logical Rule Generations Based on the Genetic Programming and Its Applications to Data Mining
Authors: Jianjun Lu, Yunling Liu, Shozo Tokinaga
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

This paper deals with the realization of retrieval and feature description systems for clusters by using logical rule generations based on the Genetic Programming (GP). At first, whole data is divided into several clusters and the rules are improved based the GP. The fitness of individuals is defined in proportion to the hits of corresponding logical expression to the samples in targeted cluster c, but also in inversely proportion to the hits outside the cluster c. The GP method is applied to various real world data by showing effective performance compared to conventional methods.
Approximation by GP box-splines on a four-direction mesh
Authors: Costanza Conti, Laura Gori, Francesca Pitolli, Paul Sablonnière
Venue: Journal of Computational and Applied Mathematics (2008)

On a four-directional uniform mesh of the plane, we define and study C^0 Gori-Pitolli (abbreviated as GP) quadratics and C^1 GP quartics generated by integer translates of GP box-splines generalizing respectively the classical C^1 quadratic box-spline and one of the C^2 quartic box-splines. More specifically, we study the approximation of a bivariate function f by some quasi-interpolants and interpolants with values in these generalized spline spaces.
Towards Privacy in Personal Data Management
Authors: P. S. Efraimidis, G. Drosatos, F. Nalbadis, A. Tasidou
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

We present a personal data management framework called Polis, which abides by the following principle: Every individual has absolute control over her personal data, which reside only at her own side. Preliminary results indicate that beyond the apparent advantages of such an environment for users’ privacy, everyday transactions remain both feasible and straightforward.
Web Usability on the Nintendo Wii Platform
Authors: Valentina Franzoni, Osvaldo Gervasi, Sergio Tasso, Simonetta Pallottelli
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

The aim of the present study is to propose a set of guidelines for designing Internet web sites usable and accessible with the Nintendo Wii console. After an accurate analysis of usability issues and the definition of the typical Wii Internet user, twelve usability guidelines will be described. The named guidelines are focused on the visibility, understandability, clickability and compatibility issues. To prove the effectiveness of the guidelines we have applied them to a test web site. We carried out a comparison test on a sample of forty individuals, selected among the various categories of the potential users of the Nintendo Wii console. The analysis of the resulting information confirms that the revised web site according to our guidelines is more usable and the improvement is more pronounced for weak categories (elderly and individuals with no experience with web browsing). Furthermore the adoption of the guidelines reduces the gap between users with different expertise, accessing a web site with the console.
Criminals Become Tech Savvy
Authors: Elias Levy
Venue: IEEE Security and Privacy (2004)

This installment of Attack Trends looks at the growing convergence of technically savvy computer crackers with financially motivated criminals. Historically, most computer crime on the Internet has not been financially motivated: It was the result of either curious or malicious technical attackers, called crackers. This changed as the Internet became more commercialized, with more of the public going online. Financially motivated actors in the fauna of the Internet's seedy underbelly—spammers and fraudsters—soon joined crackers to exploit this new potential goldmine.