ppxscal/embedding_network huggingface dataset:
Probing the 4-3-2 Edge Template in Hex
Authors: Philip Henderson, Ryan B. Hayward
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

For the game of Hex, we find conditions under which moves into a 4-3-2 edge template are provably inferior.
Visual Analytics: Combining Automated Discovery with Interactive Visualizations
Authors: Daniel A. Keim, Florian Mansmann, Daniela Oelke, Hartmut Ziegler
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

In numerous application areas fast growing data sets develop with ever higher complexity and dynamics. A central challenge is to filter the substantial information and to communicate it to humans in an appropriate way. Approaches, which work either on a purely analytical or on a purely visual level, do not sufficiently help due to the dynamics and complexity of the underlying processes or due to a situation with intelligent opponents. Only a combination of data analysis and visualization techniques make an effective access to the otherwise unmanageably complex data sets possible.Visual analysis techniques extend the perceptual and cognitive abilities of humans with automatic data analysis techniques, and help to gain insights for optimizing and steering complicated processes. In the paper, we introduce the basic idea of Visual Analytics, explain how automated discovery and visual analysis methods can be combined, discuss the main challenges of Visual Analytics, and show that combining automatic and visual analysis is the only chance to capture the complex, changing characteristics of the data. To further explain the Visual Analytics process, we provide examples from the area of document analysis.
Numerical Tests with Gauss-Type Nested Implicit Runge-Kutta Formulas
Authors: Gennady Yu. Kulikov, Sergey K. Shindin
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

In this paper we conduct a detailed numerical analysis of the Gauss-type Nested Implicit Runge-Kutta formulas of order 4, introduced by Kulikov and Shindin in [4]. These methods possess many important practical properties such as high order, good stability, symmetry and so on. They are also conjugate to a symplectic method of order 6 at least. All of these make them efficient for solving many nonstiff and stiff ordinary differential equations (including Hamiltonian and reversible systems). On the other hand, Nested Implicit Runge-Kutta formulas have only explicit internal stages, in the sense that they are easily reduced to a single equation of the same dimension as the source problem. This means that such Runge-Kutta schemes admit a cheap implementation in practice. Here, we check the above-mentioned properties numerically. Different strategies of error estimation are also examined with the purpose of finding an effective one.
A Prolog Based System That Assists Experts to Construct and Simulate Fuzzy Cognitive Maps
Authors: Athanasios Tsadiras
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

The method of Fuzzy Cognitive Map (FCM) is a combination of Fuzzy Logic and Artificial Neural Networks that is heavily used by experts and scientists of a diversity of disciplines, for strategic planning, decision making and predictions. A system that would assist decision makers to represent and simulate their own developed Fuzzy Cognitive Maps would be highly appreciated by them, especially from those that do not possess adequate computer skills. In this paper, a Prolog based system is designed and implemented to assist experts to both construct and simulate of their own FCMs. The representation capabilities of the system and the design choices are discussed and a variety of examples are given to demonstrate the use of the system.
Context Aware Calculation and Deduction
Authors: Amine Chaieb, Makarius Wenzel
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

We address some aspects of a system architecture for mathematical assistants that integrates calculations and deductions by common infrastructure within the Isabelle theorem proving environment. Here calculations may refer to arbitrary extra-logical mechanisms, operating on the syntactic structure of logical statements. Deductions are devoid of any computational content, but driven by procedures external to the logic, following to the traditional "LCF system approach". The latter is extended towards explicit dependency on abstract theory contexts, with separate mechanisms to interpret both logical and extra-logical content uniformly. Thus we are able to implement proof methods that operate on abstract theories and a range of particular theory interpretations. Our approach is demonstrated in Isabelle/HOL by a proof-procedure for generic ring equalities via Gröbner Bases.
Service-Oriented Modeling of CoCoME with Focus and AutoFocus
Authors: Manfred Broy, Jorge Fox, Florian Hölzl, Dagmar Koss, Marco Kuhrmann, Michael Meisinger, Birgit Penzenstadler, Sabine Rittmann, Bernhard Schätz, Maria Spichkova, Doris Wild
Venue: The Common Component Modeling Example: Comparing Software Component Models (2007)

Reactive distributed systems, including business information systems and embedded control systems, require systematic software engineering approaches that can manage the complexity of the system and the development. This helps to ensure resulting implementations of high quality within reasonable cost and time frames. The CoCoME POS system (see Chapter 3) is a telling example that combines elements of both system classes.
A dynamic scheduler for balancing HPC applications
Authors: Carlos Boneti, Roberto Gioiosa, Francisco J. Cazorla, Mateo Valero
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Load imbalance cause significant performance degradation in High Performance Computing applications. In our previous work we showed that load imbalance can be alleviated by modern MT processors that provide mechanisms for controlling the allocation of processors internal resources. In that work, we applied static, hand-tuned resource allocations to balance HPC applications, providing improvements for benchmarks and real applications. In this paper we propose a dynamic process scheduler for the Linux kernel that automatically and transparently balances HPC applications according to their behavior. We tested our new scheduler on an IBM POWER5 machine, which provides a software-controlled prioritization mechanism that allows us to bias the processor resource allocation. Our experiments show that the scheduler reduces the imbalance of HPC applications, achieving results similar to the ones obtained by hand-tuning the applications (up to 16%). Moreover, our solution reduces the application's execution time combining effect of load balance and high responsive scheduling.
Fuzzy Kernel Ridge Regression for Classification
Authors: Youngsik Choi, Jisung Noh
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

We present a robust version of kernel ridge regression for classification, which can gracefully handle outliers. We first show that the ridge regression can be reduced to the proximal support vector machine (PSVM) which has been successfully applied in classification problems. In order to incorporate robust-ness into kernel ridge regression, we reformulate and derive a fuzzy version of kernel ridge regression so that each sample can contribute to formation of a decision boundary according to its corresponding fuzzy class membership. We also present how to determine the fuzzy class membership values. Experiments over synthetic and real data sets demonstrate superiority of the proposed method, comparing with traditional methods such as support vector machines (SVMs).
Targeting Physically Addressable Memory
Authors: David R. Piegdon, Lexi Pimenidis
Venue: Proceedings of the 4th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2007)

This paper introduces new advances in gaining unauthorised access to a computer by accessing its physical memory via various means. We will show a unified approach for using IEEE1394, also known as firewire, file descriptors and other methods to read from and write into a victim's memory. Thereafter we will show the power of this ability in several example attacks: stealing private SSH keys, and injecting arbitrary code in order to obtain interactive access with administrator privileges on the victim's computer.These advances are based on data structures that are required by the CPU to provide virtual address spaces for each process running on the system. These data structures are searched and parsed in order to reassemble pages scattered in physical memory, thus being able to read and write in each processes virtual address space.The attacks introduced in this paper are adaptable to all kinds of operating system and hardware combinations. As a sample target, we have chosen Linux on an IA-32 system with the kernel-options CONFIG_NOHIGH MEM or CONFIG_HIGHMEM4G, CONFIG_VMSPLIT_3G and CONFIG_PAGE_OFFSET= 0xC0000000.
Computing D-convex hulls in the plane
Authors: Vojtěch Franěk, Jiří Matoušek
Venue: Computational Geometry: Theory and Applications (2009)

A function f:R^d->R is called D-convex, where D is a set of vectors in R^d, if its restriction to each line parallel to a nonzero v@?D is convex. The D-convex hull of a compact set A@?R^d is the intersection of the zero sets of all nonnegative D-convex functions that are 0 on A. Matousek and Plechac provided an algorithm for computing the D-convex hull of a finite set in R^d for D consisting of d linearly independent vectors (in this case one speaks about separately convex hulls). Here we present a (polynomial-time) algorithm for the D-convex hull of a finite point set in the plane for arbitrary finite D.
Identity management throughout one's whole life
Authors: Marit Hansen, Andreas Pfitzmann, Sandra Steinbrecher
Venue: Information Security Tech. Report (2008)

Identity management has to comprise all areas of life throughout one's whole lifetime to gain full advantages, e.g., ease-of-use for all kinds of digital services, authenticity and authorisation, reputation and user-controlled privacy. To help laying the foundations for identity management applicable to people's whole life, we describe the formation of digital identities happening numerous times within one's physical life, i.e., their establishment, evolvement and termination, and derive building blocks for managing these digital identities from the needs of individuals and of society. The identity attributes occurring and developing can be categorised according to their sensitiveness and the security requirements individuals have regarding them. We give an analysis of the sensitivity of identities and their attributes w.r.t. privacy and security both from a legal and individual's perspective. This leads to how systems for identity management throughout one's whole life should be designed using the building blocks derived.
Architecture for Autonomous Distributed Real-Time Embedded Systems
Authors: Ke Liang, Xingshe Zhou, Kailong Zhang, Ruiqing Sheng
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Unmanned vehicles (UVs) have become more and more widely used. And augmenting their autonomy is an urgent demand in order to make them play a bigger role. This paper presents a multi-agent architecture for UV’s Distributed Real-time Embedded (DRE) system. It can support the autonomous operation of UV from two aspects: (1) at the global, task scheduling among multi UVs can be completed autonomously based on a mixed negotiation mechanism with less communication overhead, taking various dynamic and stochastic factors into account, such as arrival of new task, risk of UV loss; (2) at the local, an Adaptive Resource Manager (ARM) is introduced. On basis of the feedback loop theory, it can improve the local autonomy by allocating resources efficiently and enabling the system to adapt to fluctuations in input workload, resource availability and operating conditions.
A User Modeling Server for Contemporary Adaptive Hypermedia: An Evaluation of the Push Approach to Evidence Propagation
Authors: Michael Yudelson, Peter Brusilovsky, Vladimir Zadorozhny
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Despite the growing popularity of user modeling servers, little attention has been paid to optimizing and evaluating the performance of these servers. We argue that implementation issues and their influence on server performance should become the central focus of the user modeling community, since there is a sharply increasing real-life load on user modeling servers, This paper focuses on a specific implementation-level aspect of user modeling servers --- the choice of push or pull approaches to evidence propagation. We present a new push-based implementation of our user modeling server CUMULATE and compare its performance with the performance of the original pull-based CUMULATE server.
Improving Customer Support Processes: A Case Study
Authors: Marko Jäntti, Niko Pylkkänen
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

IT organizations need systematic methods to manage the increasing number of service requests and software problems reported by customers. A large number of open problems can rapidly increase the costs of software maintenance and development. Therefore, an IT organization needs a well-defined customer support model. However, existing customer support models have one major shortcoming: a lack of process description that shows the interaction between different support processes (incident management, problem management and change management) and their activities. In this paper, we use a constructive research method to build an improved process model for customer support. Additionally, we present findings of a case study that focused on improving support processes in a medium-sized Finnish IT company. The research question in this paper is: What is the role of the problem management process in customer support?
Local and variable neighborhood search for the k-cardinality subgraph problem
Authors: Jack Brimberg, Nenad Mladenović, Dragan Urošević
Venue: Journal of Heuristics (2008)

The minimum weighted k-cardinality subgraph problem consists of finding a connected subgraph of a given graph with exactly k edges whose sum of weights is minimum. For this NP-hard combinatorial problem, only constructive types of heuristics have been suggested in the literature. In this paper we propose a new heuristic based on variable neighborhood search metaheuristic rules. This procedure uses a new local search developed by us. Extensive numerical results that include graphs with up to 5,000 vertices are reported. It appears that VNS outperforms all previous methods.
Uncovering Fraud in Direct Marketing Data with a Fraud Auditing Case Builder
Authors: Fletcher Lu
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

This paper illustrates an automated system that replicates the investigative operation of human fraud auditors. Human fraud auditors often utilize fraud detection methods that exploit structure in database tables to uncover outliers that may be part of a fraud case. From the uncovered outliers, an auditor will build a case of fraud by searching data related to the outlier possibly across many different databases and tables within these different databases. This paper illustrates an industrial implementation of an adaptive fraud case building system that uses machine learning to conduct the search and decision-making process with an automated outlier detection component. This system was successfully applied to uncover fraud cases in real marketing data.
Contract-Directed Synthesis of Simple Orchestrators
Authors: Luca Padovani
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

The availability of repositories of Web service descriptions enables interesting forms of dynamic Web service discovery, such as searching for Web services exposing a specified behavior --- or contract. This calls for a formal notion of contract equivalence satisfying two contrasting goals: being as coarse as possible so as to favor Web services reuse, and guaranteeing smooth client/service interaction. We study an equivalence relation under the assumption that interactions are controlled by orchestrators. We build a simple orchestration language on top of this theory and we show how to synthesize orchestrators out of Web services contracts.
3D Reconstruction of Large Scale City Models as a Support to Sustainable Development
Authors: Jean-Philippe Pons, Souheil Soubra
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

No part of the economic community can now escape from the urgent issues related to global warming, carbon footprint and reducing energy consumption. Nevertheless, the construction sector is particularly under pressure. Indeed, it is one of the biggest consumers of energy. It also largely contributes to the massive use of some critical resources (such as energy, water, materials and space...) and is responsible for a large portion of greenhouse gas emissions. In that context, the paper explores new approaches for urban planning by combining Virtual Environments and Simulations to address sustainability issues. These approaches are based on the possibilities of reconstructing 3D models of the built environment using standard photographs taken with off-the shelf hand-held digital cameras. The 3D models can then be combined with simulations in order to address sustainable urban development issues.
Array OL Descriptions of Repetitive Structures in VHDL
Authors: Stephen Wood, David Akehurst, Gareth Howells, Klaus Mcdonald-Maier
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

With the continuing advances in semiconductor technology driving the rise in complexity of electronic embedded systems, there is a demand for the development of high level modelling environments for computer-aided design. The modelling of highly repetitive structures in graphical form poses a particular challenge if a hierarchical approach is not adopted. This paper proposes a mechanism for describing such component structures in a compact form based upon extensions of the Array Oriented Language (Array-OL). An example is given as to how the structure described is subsequently mapped into VHDL code.
Toward Automatic Motion Control
Authors: Jane Wilhelms
Venue: IEEE Computer Graphics and Applications (1987)

Motion control for computer animation is a rich area for new research. The trend toward greater complexity in animation makes the development of more convenient and automatic methods of motion control important. Most commonly used motion control methods, such as keyframing and scripts, require a great deal of user effort to design acceptable animations. More automic methods will allow the production of sophisticated animation with less user effort. These methods include dynamic analysis, path planning and collision avoidance, stimulus-response control, and learning algorithms.
Error associated with the direction of arrival estimation in the presence of material bodies
Authors: Nuri Yilmazer, Arijit De, Tapan K. Sarkar
Venue: Digital Signal Processing (2008)

In many adaptive processing it is assumed that the direction of arrival of (DOA) of the signals is known. For a radar problem this is true as we know along which direction we transmitted the beam and therefore we expect the radar return to be arriving from that direction. However, this assumption is questionable when there are material bodies near or along its path. Here, we address the question as to what happens to the direction of propagation when the electromagnetic wave encounters a material body near or along its path for the noise free case. Thus the objective is to calculate the error associated with the prediction of DOA when the free space is not empty. We illustrate the error associated with the estimation of the DOA when there is a perfect electric conducting (PEC) sphere and a dielectric sphere along/near the path of propagation. A PEC and dielectric will diffract the incident electromagnetic energy. We evaluate the scattered far fields at a few points away from the obstacle. From the measured field points we predict the DOA of the signal of interest. The simulations have been carried out using an electromagnetic simulator and a DOA estimation algorithm using the Matrix Pencil Method. The examples deal with the case of both one- and two-dimensional antenna arrays and how they interpret the diffracted signals.
Stained Glass Rendering with Smooth Tile Boundary
Authors: Sanghyun Seo, Hochang Lee, Hyunchul Nah, Kyunghyun Yoon
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

We introduce a new glass tile generation method for simulating Stained Glass using region segmentation algorithm and cubic spline interpolation method. We apply a Mean shift segmentation algorithm to a source image to extract a shape of glass tile. We merge regions by user input and use morphological operation to remove the invalid shape. To make the shape of glass tile, we apply cubic spline interpolation and obtain the leading and the region with smooth boundary. Next, we re-segment the region using the spline curves. Finally we apply the transformed colors to each region to create a whole glass tile.
Formal Verification of a Flash Memory Device Driver --- An Experience Report
Authors: Moonzoo Kim, Yunja Choi, Yunho Kim, Hotae Kim
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

Flash memory has become virtually indispensable in most mobile devices. In order for mobile devices to operate successfully, it is essential that flash memory be controlled correctly through the device driver software. However, as is typical for embedded software, conventional testing methods often fail to detect hidden flaws in the complex device driver software. This deficiency incurs significant development and operation overhead to the manufacturers.In order to compensate for the weaknesses of conventional testing, we have applied NuSMV, Spin, and CBMC to verify the correctness of a multi-sector read operation of the Samsung OneNANDTM flash device driver and studied their relative strengths and weaknesses empirically. Through this project, we verified the correctness of the multi-sector read operation on a small scale. The results demonstrate the feasibility of using model checking techniques to verify the control algorithm of a device driver in an industrial setting.