ppxscal/embedding_network huggingface dataset:
Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation
Authors: Stefan Erickson, Michael J. Jacobson,  Jr., Ning Shang, Shuo Shen, Andreas Stein
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

In this paper, we present for the first time efficient explicit formulas for arithmetic in the degree 0 divisor class group of a real hyperelliptic curve. Hereby, we consider real hyperelliptic curves of genus 2 given in affine coordinates for which the underlying finite field has characteristic > 3. These formulas are much faster than the optimized generic algorithms for real hyperelliptic curves and the cryptographic protocols in the real setting perform almost as well as those in the imaginary case. We provide the idea for the improvements and the correctness together with a comprehensive analysis of the number of field operations. Finally, we perform a direct comparison of cryptographic protocols using explicit formulas for real hyperelliptic curves with the corresponding protocols presented in the imaginary model.
An Approach for Identification of User's Intentions During the Navigation in Semantic Websites
Authors: Rafael Liberato Roberto, Sérgio Roberto Silva
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

The growing need for content customization in websites has fostered the development of systems which try to identify the user's navigation patterns. These may be, normally, identified by means of log file analysis. However, this solution does not identify the semantic intention behind user's navigation. This paper provides an approach to incorporating semantic knowledge to the process of identifying the user's intentions in the navigation of a website with semantic support. The capture of the user's intentions is achieved by the semantic enrichment of the log files and the use of and approach that takes into account the linguistic and cognitive aspects in the development of the user model.
RETROFIT: Reliable Exchanges through Resilient Overlays for Internet Teleoperation
Authors: Karthik Singaram Lakshamanan, Raj Rajkumar
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Emergence of successful teleoperation applications requires the convergence of diverse domains like robotics, machine learning, sensing, actuation, control and communication. We envision these systems to be comprised of mobile robots with sensors and actuators, being continuously controlled over a communications network. Local intelligence at the robot would accomplish the sequence of short-term goals dynamically set forth by the remote controller. We believe that the Internet will serve as a highly useful communication infrastructure for such teleoperation, due to its ubiquitous nature and ease of access. In this paper, we propose techniques to achieve reliable low-latency communication through redundancy, over the existing Internet infrastructure. We present various techniques like multi-path forwarding, pro-active retransmissions, implicit data-fragmentation and proxy forwarding. These techniques help us characterize the design space of Internet communications along the dimensions of reliability and redundancy. We also present our preliminary experiences with these techniques through a case-study of remote vacuum cleaning using the iRobot Roomba.
Automatic Bidding for the Game of Skat
Authors: Thomas Keller, Sebastian Kupferschmid
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

In recent years, researchers started to study the game of Skat. The strength of existing Skat playing programs is definitely the card play phase. The bidding phase, however, has been treated quite poorly so far. This is a severe drawback since bidding abilities influence the overall playing performance drastically. In this paper we present a powerful bidding engine which is based on a k-nearest neighbor algorithm.
New PKI Protocols Using Tamper Resistant Hardware
Authors: Peter Landrock
Venue: Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice (2008)

Keys are indispensable in secure communication, and can only be adequately protected by tamper resistant hardware. Conversely, once you have tamper resistant devices available, you may as well try to make the most of them. In this exposition, we present three novel ideas for the combination of PKI and appropriate use of tamper resistant devices for other purposes than traditional key management. The first isElectronic Negotiable Instruments, such as cash, but there are other important examples, such as Bills of Lading and endorsable checks. The challenge is to prevent double spending without the use of a central registry to keep track of ownership. The second is a new light way digital signature scheme which seems to work well with tamper resistant hardware, but not in software, where it can be broken. We briefly discuss how to make use of this in a transparent PKI solution to be employed by vehicles, which appears to be a hot research topic. Finally we introduce the concept of a digital signature server with central storage of user keys and a central signing facility only, which is operated at the full control of the user using a secure channel for proper authentication. The first and last scenarios have both been deployed in live systems and have been patented, in contrast to the light weight digital signature.
Agent-Based Simulation of Business Processes in a Virtual World
Authors: Branislav Bošanský, Cyril Brom
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Business process modeling (BPM) has proven itself as a useful technique for capturing the work practice in companies. In this paper, we focus on its usage in the domain of company simulation and we present a novel approach combining the clarity of BPM with the strength of agent-based simulations. We describe the enhancement of a general process modeling language, the algorithm transforming these enhanced processes into the definition of agents' behavior, and the architecture of the target multi-agent system simulating the modeled company. The example is given as the implemented prototype of all proposed methods leading towards the simulation of a virtual company.
Actuation Constraints and Artificial Physics Control
Authors: Chris Ellis, R. Paul Wiegand
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Swarm systems for multiagent control rely on natural models of behavior. Such models both predict simulated natural behavior and provide control instructions to the underlying agents. These two roles can differ when, for example, controlling nonholonomic robots incapable of executing some control suggestions from the system. We consider a simple physicomimetics system and examine the effects of actuation constraint on that system in terms of its ability to stabilize in regular formations, as well as the impact of such constraints on learning control parameters. We find that in the cases we considered, Physicomimetics is surprisingly robust to certain types of actuation constraint.
QMC: A Model Checker for Quantum Systems
Authors: Simon J. Gay, Rajagopal Nagarajan, Nikolaos Papanikolaou
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

The novel field of quantum computation and quantum information has been growing at a rapid rate; the study of quantum information in particular has led to the emergence of communication and cryptographic protocols with no classical analogues. Quantum information protocols have interesting properties which are not exhibited by their classical counterparts, but they are most distinguished for their applications in cryptography. Notable results include the unconditional security proof [1] of quantum key distribution. This result, in particular, is one of the reasons for the widespread interest in this field. Furthermore, the implementation of quantum cryptography has been demonstrated in non-laboratory settings and is already an important practical technology. Implementations of quantum cryptography have already been commercially launched and tested by a number of companies including MagiQ, Id Quantique, Toshiba, and NEC. The unconditional security of quantum key distribution protocols does not automatically imply the same degree of security for actual systems, of course; this justifies the need for systems modelling and verification in this setting.
Information systems in Japanese government
Authors: Yoshikazu Sekiguchi, Kim V. Andersen
Venue: Information Polity (1999)

In this article we focus on information systems (IS) in Japanese government. We concentrate on the nature of IS-use and the major challenges faced for the future path of IS-use in local government. The governments have low budgets for IS use, a low penetration rate, and almost no IS use in the communication with citizens, companies, other departments, or inside the organizations. Impacts are accordingly restricted to mainly conventional IS applications such as word processing, accounting, and taxation. However, local governments and national governments are determined to increase their utilization and we have found emerging visible signs of these changes such as one-stop shopping, tele-access to governmental information, digital libraries, office automation, etc. We identify four major challenges facing local governments: (1) rebuilding the organizational content, procedures, and frontier; (2) using IS applications to support intra- and interorganizational communication; (3) developing a clear IS-strategy with respect to goals, means, time-span and evaluation semi; and (4) having politicians supporting the IS strategy.
Application of Wavelet Packet Transform to Network Anomaly Detection
Authors: Christian Callegari, Stefano Giordano, Michele Pagano
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

In the last few years, the number and impact of security attacks over the Internet have been continuously increasing. Since it seems impossible to guarantee complete protection to a system by means of the "classical" prevention mechanisms, the use of Intrusion Detection Systems (IDSs) has emerged as a key element in network security. In this paper we address the problem considering different methods, based on the Wavelet Packet Transform, for detecting anomalies in the network traffic, taking into account both the best basis and the value of transformed coefficients.The performance comparison among the different solutions shows that very little information about network anomalies is carried by the best basis selection, while the "distance" between the transformed coefficients leads to very interesting results, highlighting the effectiveness of the proposed approaches.
Cooperation between the Inference System and the Rule Base by Using Multiobjective Genetic Algorithms
Authors: Antonio Márquez, Francisco Alfredo Márquez, Antonio Peregrín
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper presents an evolutionary Multiobjective learning model achieving positive synergy between the Inference System and the Rule Base in order to obtain simpler and still accurate linguistic fuzzy models by learning fuzzy inference operators and applying rule selection. The Fuzzy Rule Based Systems obtained in this way, have a better trade-off between interpretability and accuracy in linguistic fuzzy modeling applications.
Fuzzy radicals and prime fuzzy ideals of ordered semigroups
Authors: Xiang-Yun Xie, Jian Tang
Venue: Information Sciences: an International Journal (2008)

Let S be an ordered semigroup. A fuzzy subset of S is, by definition, an arbitrary mapping f: S->[0,1], where [0,1] is the usual interval of real numbers. Motivated by studying prime fuzzy ideals in rings, semigroups and ordered semigroups, and as a continuation of Kehayopulu and Tsingelis's works in ordered semigroups in terms of fuzzy subsets, in this paper we introduce the notion of ordered fuzzy points of an ordered semigroup S, and give a characterization of prime fuzzy ideals of an ordered semigroup S. We also introduce the concepts of weakly prime fuzzy ideals, completely prime fuzzy ideals, completely semiprime fuzzy ideals and weakly completely prime fuzzy ideals of an ordered semigroup S, and establish the relationship between the five classes of ideals. Furthermore, we characterize weakly prime fuzzy ideals, completely semiprime fuzzy ideals and weakly completely prime fuzzy ideals of S by their level ideals. Finally, we introduce and investigate the fuzzy radicals of ordered semigroups by means of ordered fuzzy points, and prove that the fuzzy radical of every completely semiprime fuzzy ideal of an ordered semigroup S can be expressed as the intersection of all weakly completely prime fuzzy ideals containing it. As an application of the results of this paper, the corresponding results of semigroups (without order) are also obtained.
State-Dependent Exploration for Policy Gradient Methods
Authors: Thomas Rückstieß, Martin Felder, Jürgen Schmidhuber
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

Policy Gradient methods are model-free reinforcement learning algorithms which in recent years have been successfully applied to many real-world problems. Typically, Likelihood Ratio (LR) methods are used to estimate the gradient, but they suffer from high variance due to random exploration at every time step of each training episode. Our solution to this problem is to introduce a state-dependent exploration function (SDE) which during an episode returns the same action for any given state. This results in less variance per episode and faster convergence. SDE also finds solutions overlooked by other methods, and even improves upon state-of-the-art gradient estimators such as Natural Actor-Critic. We systematically derive SDE and apply it to several illustrative toy problems and a challenging robotics simulation task, where SDE greatly outperforms random exploration.
A Robust Model for Traffic Signs Recognition Based on Support Vector Machines
Authors: Min Shi, Haifeng Wu, Hasan Fleyeh
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Road and traffic sign recognition has been of great interest for many years. This paper presents an approach to recognize Swedish road and traffic signs by using support vector machines. We focus on recognizing seven categories of traffic sign shapes and five categories of speed limit signs. Two kinds of features, binary image and Zernike moments, are used for representing the data to the SVM for training and test. We compare and analyze the performances of the SVM recognition model using different feature representations and different kernels and SVM types through recognizing 350 traffic sign shapes and 250 speed limit signs. Experiments have shown excellent results, which have achieved 100% accuracy on sign shapes classification and 99% accuracy on speed limit signs classification.
An adaptive and customizable feedback system for VR-based training simulators
Authors: Maite Lopez-Garate, Alberto Lozano-Rodero, Luis Matey
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

This paper describes a proposal to build an intelligent feedback selection system for Virtual Reality-based training simulators. The system is aimed at generating multimodal feedback in real-time for advising the students while training with the simulator. Focused on driving tasks, we analyze how to customize the system to exhibit different behaviors. We examine educational and human factors that have influence on the behavior, so that the instructors can use or refine the behavior they prefer in each training session. The selection process is based on the analysis of the information coming from a diagnostic component and adapts the feedback to the performance of each student, since the process takes into account whether previous feedbacks were ineffective. The objective is to emulate the behavior of the instructor. In this way, the feedback system can be helpful for him/her, as while the system decides which the appropriate feedback is, the instructor can focus on other instructional tasks.
Secure Interaction Models for the HealthAgents System
Authors: Liang Xiao, Paul Lewis, Srinandan Dasmahapatra
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

Distributed decision support systems designed for healthcare use can benefit from services and information available across a decentralised environment. The sophisticated nature of collaboration among involved partners who contribute services or sensitive data in this paradigm, however, demands careful attention from the beginning of designing such systems. Apart from the traditional need of secure data transmission across clinical centres, a more important issue arises from the need of consensus for access to system-wide resources by separately managed user groups from each centre. A primary concern is the determination of interactive tasks that should be made available to authorised users, and further the clinical resources that can be populated into interactions in compliance with user clinical roles and policies. To this end, explicit interaction modelling is put forward along with the contextual constraints within interactions that together enforce secure access, the interaction participation being governed by system-wide policies and local resource access being governed by node-wide policies. Clinical security requirements are comprehensively analysed, prior to the design and building of our security model. The application of the approach results in a Multi-Agent System driven by secure interaction models. This is illustrated using a prototype of the HealthAgents system.
A numerical method for finding multiple co-existing solutions to nonlinear cooperative systems
Authors: Xianjin Chen, Jianxin Zhou, Xudong Yao
Venue: Applied Numerical Mathematics (2008)

In this paper, a local min-orthogonal method is developed to solve cooperative nonlinear elliptic systems for multiple co-existing solutions. A characterization of co-existing critical points of a dual functional is established and used as a mathematical justification for the method. The method is then implemented to numerically solve two coupled nonlinear Schrodinger equations which model spatial vector solitons propagating in a saturable bulk nonlinear medium for multiple co-existing solutions.
Extracting and Querying Relations in Scientific Papers
Authors: Ulrich Schäfer, Hans Uszkoreit, Christian Federmann, Torsten Marek, Yajing Zhang
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

High-precision linguistic and semantic analysis of scientific texts is an emerging research area. We describe methods and an application for extracting interesting factual relations from scientific texts in computational linguistics and language technology. We use a hybrid NLP architecture with shallow preprocessing for increased robustness and domain-specific, ontology-based named entity recognition, followed by a deep HPSG parser running the English Resource Grammar (ERG). The extracted relations in the MRS (minimal recursion semantics) format are simplified and generalized using WordNet. The resulting `quriples' are stored in a database from where they can be retrieved by relation-based search. The query interface is embedded in a web browser-based application we call the Scientist's Workbench. It supports researchers in editing and online-searching scientific papers.
Physiological Laws of Sensory Visual System in Relation to Scaling Power Laws in Biological Neural Networks
Authors: Isabel Gonzalo-Fonrodona, Miguel A. Porras
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

Measurements of some visual functions (visual fields, acuity and visual inversion) versus intensity of stimulus, including facilitation, carried out by Justo Gonzalo in patients with central syndrome, are seen to follow Stevens' power law of perception. The characteristics of this syndrome, which reveals aspects of the cerebral dynamics, allow us to conjecture that Stevens' law is in these cases a manifestation of the universal allometric scaling power law associated with biological neural networks. An extension of this result is pointed out.
A Learning Approach to Early Bug Prediction in Deployed Software
Authors: Saeed Parsa, Somaye Arabi, Mojtaba Vahidi-Asl
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

In this paper the use of Support Vector Machines to build programs behavioral models predicting misbehaviors while executing the programs, is described. Misbehaviors can be detected more precisely if the model is built considering both the failing and passing runs. It is desirable to create a model which even after fixing the detected bugs is still applicable. To achieve this, the use of a bug seeding technique to test all different execution paths of the program in both failing and passing executions is suggested. Our experiments with a test suite, EXIF, demonstrate the applicability of our proposed approach.
Utility-Based Uplink Power Control in CDMA Wireless Networks with Real-Time Services
Authors: Timotheos Kastrinogiannis, Eirini-Eleni Tsiropoulou, Symeon Papavassiliou
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

In this paper we address the problem of efficient power allocation in the uplink of CDMA wireless networks, emphasizing on the support of real-time services' QoS prerequisites. The corresponding problem is formulated as a non-cooperative game where users aim selfishly at maximizing their utility-based performance under the imposed physical limitations. A user's utility reflects its degree of satisfaction with respect to its actual throughput performance, QoS requirements fulfillment, and the corresponding power consumption. The existence and uniqueness of a Nash equilibrium point of the proposed Uplink Power Control (UPC) game is proven, where all users have attained a targeted SINR value or transmit with their maximum power, leading essentially to an SINR-balanced network. The properties of equilibrium in a pure optimization theoretical framework are studied, and the tradeoffs between users' overall throughput performance and real-time services strict QoS requirements in channel aware resource allocation processes are revealed and quantified. Finally, a distributed iterative algorithm for computing UPC game's equilibrium is proposed and its efficiency is illustrated via simulation and analysis.