ppxscal/embedding_network huggingface dataset:
A New Proof-Number Calculation Technique for Proof-Number Search
Authors: Kazuki Yoshizoe
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

We propose a new simple calculation technique for proof numbers in Proof-Number Search. Search algorithms based on (dis)proof numbers are known to be effective for solving problems such as tsumego, tsume-shogi, and checkers. Usually, the Proof-Number Search expands child nodes with the smallest (dis)proof number because such nodes are expected to be the easiest to (dis)prove the node. However, when many unpromising child nodes exist, (dis)proof numbers are not always a suitable measure for move ordering because unpromising nodes temporarily increase the (dis)proof numbers. For such cases, we propose the use of only some child nodes (instead of all child nodes) for calculating (dis)proof numbers. We call this technique Dynamic Widening.We combined Dynamic Widening with the Depth-first Proof-Number Search (df-pn) algorithm and tested its performance on capturing problems of Go on 19×19 boards. Our results show that the approach is more than 30 times faster than normal df-pn when we generate almost all legal moves (about 300 moves on average). The required time for processing remained approximately four times as long as that of df-pn using heuristic pruning (about 20 moves on average), but the correctness of the search result is guaranteed.
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
Authors: Dorothea Baumeister, Jörg Rothe
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is undecidable. In this paper, we study the three-color and two-color TantrixTM rotation puzzle problems (3-TRP and 2-TRP) and their variants. Restricting the number of allowed colors to three (respectively, to two) reduces the set of available TantrixTM tiles from 56 to 14 (respectively, to 8). We prove that 3-TRP and 2-TRP are NP-complete, which answers a question raised by Holzer and Holzer [7] in the affirmative. Since our reductions are parsimonious, it follows that the problems Unique-3-TRP and Unique-2-TRP are DP-complete under randomized reductions. Finally, we prove that the infinite variants of 3-TRP and 2-TRP are undecidable.
Glasses for passive integrated optical devices
Authors: F. Rehouma, K. E. Aiadi
Venue: Proceedings of the 7th WSEAS International Conference on Microelectronics, Nanoelectronics, Optoelectronics (2008)

Integrated ion exchanged devices on glass seems to be as one of the most promising technologies for the development of optoelectronic field. That is due to the potentiality of glass material, facility and flexibility of the fabrication process, the cost of the elaborated devices and the high performances of these components. In this paper, a review on glasses used for ion exchanged structures is given. The structure and the influence of the composition on the glass properties are presented. The ion exchange technology is described. The relation between the glass compositions and the exchanged ions is treated. Some compositions of glasses suited to this technology and the characteristics of elaborated structures are given. Finally selection criteria of glasses adapted to this technology are proposed.
Cryptanalysis of MinRank
Authors: Jean-Charles Faugère, Françoise Levy-Dit-Vehel, Ludovic Perret
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

In this paper, we investigate the difficulty of one of the most relevant problems in multivariate cryptography --- namely MinRank --- about which no real progress has been reported since [9, 19]. Our starting point is the Kipnis-Shamir attack [19]. We first show new properties of the ideal generated by Kipnis-Shamir's equations. We then propose a new modeling of the problem. Concerning the practical resolution, we adopt a Gröbner basis approach that permitted us to actually solve challenges A and B proposed by Courtois in [8]. Using the multi-homogeneous structure of the algebraic system, we have been able to provide a theoretical complexity bound reflecting the practical behavior of our approach. Namely, when r ¿ the dimension of the matrices minus the rank of the target matrix in the MinRank problem is constant, then we have a polynomial time attack $\mathcal{O}\left( \ln\left( q\right) \,n^{3\,r^{\prime2}}\right) $. For the challenge C [8], we obtain a theoretical bound of 266.3 operations.
Collaborative and Multimodal Communications System Using Immersive Virtual Reality Environment over Ultrahigh-Speed Network
Authors: Tomoyuki Ishida, Akihiro Miyakawa, Yoshitaka Shibata
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Recently, Tele-Immersion Technology is actively researched by the development of Virtual Reality Technology. In a past virtual reality, PC and laptop were chiefly used. Immersive Display and Tiled Display are connected with ultrahigh-speed network, and remote users and various cooperation workings are achieved with Tele-Immersion Technology. In this research, it proposes cooperated Multimodal Communications System that uses this Tele-Immersion Technology. Multimodal Communications System is composed of Verbal Information, Non-verbal Information, and Sensitivity Information. Video communication technology and sensibility information processing technology were fused by using large screen system of Immersive Display and Tiled Display, and new communications with remote users are created.
TestML - A Test Exchange Language for Model-Based Testing of Embedded Software
Authors: Juergen Grossmann, Ines Fey, Alexander Krupp, Mirko Conrad, Christian Wewetzer, Wolfgang Mueller
Venue: Model-Driven Development of Reliable Automotive Services: Second Automotive Software Workshop, ASWSD 2006, San Diego, CA, USA, March 15-17, 2006, Revised Selected Papers (2006)

Test processes in the automotive industry are tool-intensive and affected by technologically heterogeneous test infrastructures. In the industrial practice a product has to pass tests at several levels of abstraction such as Model-in-the-Loop (MIL), Software-in-the-Loop (SIL) and Hardware-in-the-Loop (HIL) tests. Different test systems are applied for this purpose (e.g. dSPACE MTest, dSPACE Automation Desk, National Instruments Teststand) and almost each test system requests its own proprietary test description language. The exchange of tests between different test systems and the reuse of tests between different test levels is normally not possible. Efforts to integrate these heterogeneous test environments, to address test exchange in a general manner and to standardize and harmonize the existing language environment are still at the beginning and not tailored towards the requirements of the automotive domain. To keep the whole development and test process efficient and manageable, the definition of an integrated and seamless approach is required. TestML --- the test exchange language we present in this article --- is defined to overcome the technological obstacles (different test language syntax and semantics, different data formats and interface descriptions) that almost automatically accompany the application of heterogeneous test tools and test infrastructures. TestML supports the exchange of tests between different test notations in a heterogeneous tool environment. In this paper, we introduce the XML schema of TestML and demonstrate the efficiency of the interchange format by giving examples from the model-based development of electronic control units. Tool support is illustrated by an application with Simulink/Stateflow.
Designing a secure e-tender submission protocol
Authors: Rong Du, Ernest Foo, Colin Boyd
Venue: Electronic Commerce Research (2008)

This paper investigates the fundamental difference between a simple e-tender box and a traditional physical tender box, and highlights a series of security traps created by the functional differences. Based on our findings, we have defined the security requirements for an e-tender submission protocol. We also discuss functional limitations of cryptographic technologies. As a result, two secure e-tender submission protocols are proposed which enable a secure e-tender submission. Protocols are assumed to run under the condition that all tendering parties (principal and tenderers) are dishonest players. Our informal and formal security analysis show that these protocols meet their security goals under well known collusion scenarios. Because security is a process not a product, our approach will have broad industry application for developing secure electronic business processes in areas other than e-tendering.
An extensible and adaptable model for system software
Authors: Paniti Netinant
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

As software engineering moves into its fourth decade, system software suffers from many of the strengths and some of the frailties that are experienced by humans. Software engineering approaches its midlife with many accomplishments already achieved, but with significant work yet to do. Aspect-oriented models have shown to be an effective means of capturing and communicating system software design. However, there are more models than software design models: We believe that aspect oriented models work for system software development on several aspects. In this paper, we explore what we have come to understand as crucial aspects of an extensible and adaptable model for system software. We present an extensible and adaptable model in which system software is decomposed into a set of architectural abstractions. A design pattern is described that supports the separation of concerns among the components of the abstractions. The proposed model provides a formal methodology for the architectural design and specification of system software.
A Symmetry-Based Method for the Determination of Vertebral Rotation in 3D
Authors: Tomaž Vrtovec, Franjo Pernuš, Boštjan Likar
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

In the past, a number of methods were proposed for quantitative assessment of vertebral rotation from three-dimensional (3D) images. However, these methods were based on manual identification of distinctive anatomical landmarks, required manual determination of cross-sections from 3D images, and measured only axial vertebral rotation instead of the rotation in 3D. In this paper, we propose an automated method for quantitative assessment of vertebral rotation in 3D that is based on finding the planes of vertebral symmetry by matching image intensity gradients on both sides of each plane. The method was evaluated on 28 images of normal and pathological vertebrae, obtained by computed tomography (CT) and magnetic resonance (MR). For each vertebra, final angle displacements of 200 initial angle displacements, uniformly distributed within 30° from manually obtained reference angles, were obtained. The results show that by the proposed method, vertebral rotation can be successfully estimated in 3D with an average accuracy of 1.0° and precision of 0.5°.
QoS-Oriented Reputation-Aware Query Scheduling in Data Grids
Authors: Rogério Luís Carvalho Costa, Pedro Furtado
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

In the last few years, the Grid technology has emerged as an important tool for many scientific and commercial global organizations. In grid-based systems, intelligent job scheduling is used to achieve Service Level Objectives (SLOs) and to provide some kind of Quality of Service (QoS) differentiation between users or applications. In data grids, the grid infra-structure is used to provide transparent access to geographically distributed data, which may be replicated in order to increase availability and performance. In this work, we deal with QoS-oriented query scheduling in data grids. Although there exist several works on job scheduling in Grids, QoS-oriented query scheduling in grid-based databases is still an open issue. For instance, how can we provide guarantees against response-time expectations? Our proposal uses a reputation system to answer this problem satisfactorily. We also present experimental results that prove the benefits of proposed strategies.
Enhanced Graph Based Genealogical Record Linkage
Authors: Cary Sweet, Tansel Özyer, Reda Alhajj
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

Record linkage is an essential social problem that has received considerable attention for over two centuries. With the popularity of computers, automated systems started to be realized for better record linkage systems. In this paper, we look at improving the latest techniques in record linkage, from the perspective of genealogy, to obtain results that require decreased human intervention. The increased benefit will be measured against the mainstream string and entity comparison techniques.
The numerical measure of symmetry for 3d stick creatures
Authors: Wojciech Jaśkowski, Maciej Komosinski
Venue: Artificial Life (2008)

This work introduces a numerical, continuous measure of symmetry for 3D stick creatures and solid 3D objects. Background information about the property of symmetry is provided, and motivations for developing a symmetry measure are described. Three approaches are mentioned, and two of them are presented in detail using formal mathematical language. The best approach is used to sort a set of creatures according to their symmetry. Experiments with a mixed set of 84 individuals originating from both human design and evolution are performed to examine symmetry within these two sources, and to determine if human designers and evolutionary processes prefer symmetry or asymmetry.
Managing query and update transactions under quality contracts in web-databases
Authors: Huiming Qu
Venue:  (2007)

In modern Web-database systems, users typically perform read-only queries, whereas all write-only data updates are performed in the background, concurrently with queries. For most of these services to be successful and their users to be kept satisfied, two criteria need to be met: user requests must be answered in a timely fashion and must return fresh data. This is relatively easy when the system is lightly loaded and, as such, both queries and updates can be executed quickly. However, this goal becomes practically hard to achieve in real systems due to the high volumes of queries and updates, especially in periods of flash crowds. In this work, we argue it is beneficial to allow users to specify their preferences and let the system optimize towards satisfying user preferences, instead of simply improving the average case. We believe that this user-centric approach will empower the system to gracefully deal with a broader spectrum of workloads. Towards user-centric web-databases, we propose a Quality Contracts framework to help users express their preferences over multiple quality specifications. Moreover, we propose a suite of algorithms to effectively perform load balancing and scheduling for both queries and updates according to user preferences. We evaluate the proposed framework and algorithms through a simulation with real traces from disk accesses and from a stock information website. Finally, to increase the applicability of Quality Contracts enhanced Web-database systems, we propose an algorithm to help users adapt to the Web-database system behavior and maximize their query success ratio.
Model-Driven Development of Model Transformations
Authors: Pieter Gorp
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

The "model-driven development of model transformations" requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, the thesis underlying this paper evaluates and extends state-of-the-art model transformation approaches. For example, the thesis contributes a new language construct for modeling subgraph-copy operations. Perhaps surprisingly, this thesis intentionally does not propose a fundamentally new transformation language and toolset. Instead, the thesis is based on a small UML profile for controlled graph transformation. The profile only relies on class diagrams, activity diagrams, and the UML's extension mechanism. The proposed techniques have emerged from several case studies that involve model evolution, model refinement, as well as model synchronization.
A Novel Approach for Blind Channel Equalization
Authors: A. Özen, A. Güner, O. Çakır, E. Tuğcu, B. Soysal, I. Kaya
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

The Constant Modulus Algorithm (CMA), while the most commonly used blind equalization technique, converges very slowly. The convergence rate of the CMA is quite sensitive to the adjustment of the step size parameter used in the update equation as in the Least Mean Squares (LMS) algorithm. A novel approach in adjusting the step size of the CMA using the fuzzy logic based outer loop controller is presented in this paper. It also presents a computational study and simulation results of this newly proposed algorithm compared to other variable step size CMA such as conventional CMA, Normalized CMA (N-CMA) [1], Modified CMA (M-CMA) [2], CMA-Soft Decision Directed (CMA-SDD) [3]. The simulation results have demonstrated that the proposed algorithm has considerably better performance than others.
Global phenomena from local rules: peer-to-peer networks and crystal steps
Authors: James A. Yorke, Dionisios Margetis
Venue:  (2007)

Even simple, deterministic rules can generate interesting behavior in dynamical systems. This dissertation examines some real world systems for which fairly simple, locally defined rules yield useful or interesting properties in the system as a whole. In particular, we study routing in peer-to-peer networks and the motion of crystal steps. Peers can vary by three orders of magnitude in their capacities to process network traffic. This heterogeneity inspires our use of "proportionate load balancing," where each peer provides resources in proportion to its individual capacity. We provide an implementation that employs small, local adjustments to bring the entire network into a global balance. Analytically and through simulations, we demonstrate the effectiveness of proportionate load balancing on two routing methods for de Bruijn graphs, introducing a new "reversed" routing method which performs better than standard forward routing in some cases. The prevalence of peer-to-peer applications prompts companies to locate the hosts participating in these networks. We explore the use of supervised machine learning to identify peer-to-peer hosts, without using application-specific information. We introduce a model for "triples," which exploits information about nearly contemporaneous flows to give a statistical picture of a host's activities. We find that triples, together with measurements of inbound vs. outbound traffic, can capture most of the behavior of peer-to-peer hosts. An understanding of crystal surface evolution is important for the development of modern nanoscale electronic devices. The most commonly studied surface features are steps, which form at low temperatures when the crystal is cut close to a plane of symmetry. Step bunching, when steps arrange into widely separated clusters of tightly packed steps, is one important step phenomenon. We analyze a discrete model for crystal steps, in which the motion of each step depends on the two steps on either side of it. We find an time-dependence term for the motion that does not appear in continuum models, and we determine an explicit dependence on step number.
FPH: first-class polymorphism for Haskell
Authors: Dimitrios Vytiniotis, Stephanie Weirich, Simon Peyton Jones
Venue: ACM SIGPLAN Notices (2008)

Languages supporting polymorphism typically have ad-hoc restrictions on where polymorphic types may occur. Supporting "firstclass" polymorphism, by lifting those restrictions, is obviously desirable, but it is hard to achieve this without sacrificing type inference. We present a new type system for higher-rank and impredicative polymorphism that improves on earlier proposals: it is an extension of Damas-Milner; it relies only on System F types; it has a simple, declarative specification; it is robust to program transformations; and it enjoys a complete and decidable type inference algorithm.
Stability of GPBiCG_AR Method Based on Minimization of Associate Residual
Authors: Moe Thuthu, Seiji Fujino
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

GPBi-CG method is an attractive iterative method for the solution of a linear system of equations with nonsymmetric coefficient matrix. However, the popularity of GPBi-CG method has diminished over time except for the minority. In this paper, we consider a new algorithm based on minimization of the associate residual of 2-norm in place of reconstruction of the algorithm. We refer to a method with new algorithm as GPBiCG with Associate Residual (abbreviated as GPBiCG_AR) method. Moreover we will introduce preconditioned GPBiCG_AR (abbreviated as P_GPBiCG_AR). Then, we will support that GPBiCG_AR and P_GPBiCG_AR methods yield safety convergence through numerical experiments.
Structure in threes: modelling organization-oriented software architectures built upon multi-agent systems
Authors: Matthias Wester-Ebbinghaus, Daniel Moldt
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Software systems are subject to increasing complexity and in need of efficient structuring. Multi-agent system research has come up with approaches for an organization-oriented comprehension of software systems. However, when it comes to the collective level of organizational analysis, multi-agent system technology lacks clear development concepts. To overcome this problem while preserving the earnings of the agent-oriented approach, this paper propagates a shift in perspective from the individual agent to the organization as the core metaphor of software engineering targeting at very large systems. According to different levels of analysis drawn from organization theory, different types of organizational units are incorporated into a reference architecture for organization-oriented software systems.
Time Delay Estimation Basing on Narrow-Band Signal in Multipath Environments
Authors: Yingyun Li, Hong Ma
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

A new super-resolution algorithm for time delay estimation (TDE) of multipath propagation signals base on least square criterion was proposed. The idea was to decompose the observed data into their signal components and then to estimate the amplitude and time delay of each signal components separately, using cubic slpline interpolation and basing on least square criterion. The algorithm iterated back and forth, using signal components reconstructs observed data, to let the reconstructs data was the best estimation of the observed data. Computer simulations shows that the algorithm provides super-resolution and accuracy time delay estimation in low signal-to-noise ratio, narrowband signal and multipath environments.