ppxscal/embedding_network huggingface dataset:
Perfect Matchings and K 43-Tilings in Hypergraphs of Large Codegree
Authors: Oleg Pikhurko
Venue: Graphs and Combinatorics (2008)

For a k-graph F, let t l (n, m, F) be the smallest integer t such that every k-graph G on n vertices in which every l-set of vertices is included in at least t edges contains a collection of vertex-disjoint F-subgraphs covering all but at most m vertices of G. Let K m k denote the complete k-graph on m vertices. The function $$t_{k-1} (kn, 0, K_k^k)$$(i.e. when we want to guarantee a perfect matching) has been previously determined by K&#x00fc;hn and Osthus [9] (asymptotically) and by R&#x00f6;dl, Ruci&#x0144;ski, and Szemer&#x00e9;di [13] (exactly). Here we obtain asymptotic formulae for some other l. Namely, we prove that for any $$k \ge 4$$and $$k/2 \le l \le k-2$$, $$ t_l(kn, 0, K_k^k) = \left(\frac{1}{2} + o(1)\right) {kn\choose k-l} $$is adjacent to some vertex in S. The domination number &#x03b3;(G) is the minimum cardinality of a dominating set of G. The domination subdivision number sd&#x03b3;(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the domination number. Haynes et al. (Discussiones Mathematicae Graph Theory 21 (2001) 239-253) conjectured that $${\rm sd}_{\gamma} (G) \le \delta(G) + 1$$for any graph G with $$\delta(G) \ge 2$$. In this note we first give a counterexample to this conjecture in general and then we prove it for a particular class of graphs.
From Story-Telling to Educational Gaming: The Bamiyan Valley Case
Authors: Marc Spaniol, Yiwei Cao, Ralf Klamma, Pablo Moreno-Ger, Baltasar Fernández Manjón, José Luis Sierra, Georgios Toubekis
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

Preserving the knowledge of previous generations and passing it to new generations is challenging. This process is usually based on an educational system or in any other kind of face-to-face tradition. However, developing countries usually face a lack of well educated people so that this process is hindered. This is even more problematic for countries having recently struggled through times of war. Hence, we apply a community-centered approach to capturing expert knowledge in non-linear digital stories and repurposing it in the shape of educational games. In particular, we support the vocational training of local employees within a cultural heritage community that aims at preserving Bamiyan Valley in Afghanistan.
Handling Emergent Nondeterminism in Replicated Services
Authors: Joseph Slember, Priya Narasimhan
Venue: Architecting Dependable Systems V (2008)

When distributed applications are replicated for fault tolerance, the presence of even a single nondeterministic service can lead to emergent system-wide nondeterminism that compromises replica consistency. Our approach, Midas identifies and addresses multiple sources of nondeterminism (including system calls, multithreading, etc.) in a multi-service replicated distributed architecture. Midas involves a synergistic combination of compile-time dependency, concurrency and nondeterminism analyses, followed by the performance-sensitive compensation of nondeterminism at runtime. This approach upholds existing application semantics and allows services to continue to be nondeterministic, while yet maintaining their replicas consistent. We demonstrate Midas' scalability through a microbenchmark that shows the underlying tradeoffs under different kinds of dependencies between clients, services and invocations in a distributed system. We also validate our claims by modeling a representative multi-service application using Java Pathfinder.
Sindex: query optimization and access control in a semi-structured database
Authors: David Spooner
Venue:  (2007)

Access control and query optimization are treated as separate functions in database management systems, even though the behavior of both is similar. The point of query optimization is to reduce the amount of data the query engine searches to just that which is relevant to the search. Since the user should never have access to restricted data then it is irrelevant to the user&rsquo;s search and can be ignored by the query engine. In fact, combining them would not only reduce overhead, but would also improve the functionality of both. Access control could improve query optimization by removing forbidden data from the search space along with irrelevant data. Query optimization could improve access control by enabling forbidden data to never be accessed by the query engine. The problem of combining access control and query optimization is especially interesting with tree based semi-structured data. A major part of query optimization for tree based semi-structured data is deciding which branches of the tree need to be searched. Assuming that all descendants of a forbidden node are also forbidden, then the query engine can skip searching any branch that has a forbidden node as the root or is not relevant to the query.The tree based semi-structured data model XML [1] has become widely used in the last decade for storing data because of its flexibility, simplicity, and ease of sharing over the web. XML databases such as Berkeley DBXML [2], IBM&rsquo;s DB2 [4], and Oracle&rsquo;s 10g XML Db [3] have been developed to meet the commercial demand for XML storage. As the size and the viewing audience of XML data have grown so has the need for efficient query and access control methods. This proposal addresses the problems of implementing query optimization and access control together on XML data stored in a database. This thesis presents the Security Index, or SIndex, and describes how it can be used to implement access control and query optimization on an XML database. Also presented is how the SIndex has been implemented in the XML database management system called Berkeley DBXML, and how the DBMS with the SIndex performs compared to other commercial and research DBMS.
The Difficulty Factors Approach to the Design of Lessons in Intelligent Tutor Curricula
Authors: Ryan S. J. D. Baker, Albert T. Corbett, Kenneth R. Koedinger
Venue: International Journal of Artificial Intelligence in Education (2007)

We present an approach to designing intelligent tutoring systems, termed the Difficulty Factors Approach. In this approach, the designer investigates, at each iteration of the design cycle, which skills and concepts are difficult for students, and what factors underlie those difficulties. We show that this approach complements existing design principles, producing data that helps designers apply principles in context. We also show that by continuing to investigate student difficulties throughout the design process, it is possible to discover difficulty factors initially obscured by other difficulty factors. We give an example of the application of the Difficulty Factors Approach in the context of the development of a cognitive tutor lesson on scatterplots.
An IACO and HPSO Method for Spatial Clustering with Obstacles Constraints
Authors: Xueping Zhang, Jiayao Wang, Dexian Zhang, Zhongshan Fan
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper, we propose an Improved Ant Colony Optimization (IACO) and Hybrid Particle Swarm Optimization (HPSO) method for Spatial Clustering with Obstacles Constraints (SCOC). In the process of doing so, we first use IACO to obtain the shortest obstructed distance, and then we develop a novel HPKSCOC based on HPSO and K-Medoids to cluster spatial data with obstacles. The experimental results demonstrate that the proposed method, performs better than Improved K-Medoids SCOC in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC.
Testing the Intermediate Disturbance Hypothesis: Effect of Asynchronous Population Incorporation on Multi-Deme Evolutionary Algorithms
Authors: Juan J. Merelo, Antonio M. Mora, Pedro A. Castillo, Juan L. Laredo, Lourdes Araujo, Ken C. Sharman, Anna I. Esparcia-Alcázar, Eva Alfaro-Cid, Carlos Cotta
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

In P2P and volunteer computing environments, resources are not always available from the beginning to the end, getting incorporated into the experiment at any moment. Determining the best way of using these resources so that the exploration/exploitation balance is kept and used to its best effect is an important issue. The Intermediate Disturbance Hypothesis states that a moderate population disturbance (in any sense that could affect the population fitness) results in the maximum ecological diversity. In the line of this hypothesis, we will test the effect of incorporation of a second population in a two-population experiment. Experiments performed on two combinatorial optimization problems, MMDP and P-Peaks, show that the highest algorithmic effect is produced if it is done in the middle of the evolution of the first population; starting them at the same time or towards the end yields no improvement or an increase in the number of evaluations needed to reach a solution. This effect is explained in the paper, and ascribed to the intermediate disturbance produced by first-population immigrants in the second population.
Structuring technological information for technology roadmapping: data mining approach
Authors: Byungun Yoon, Robert Phaal, David Probert
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Most of research in technology roadmapping has focused on practical applications of technology roadmap, and methods to enhance its operational process. Thus, despite a demand for supports through well-organized information, little attentions have been paid to a study on how/which information can be utilized in a technology roadmapping. Therefore, this paper aims to propose a methodology to structure technological information in order to support the process. To this end, four methods are suggested to provide useful and substantial information: summary, information extraction, search and clustering. This research identifies the characteristics of data which can be potentially used in roadmapping and presents an approach to yielding important information from such raw data through various data mining techniques including text mining, multi-dimensional scaling and K-means clustering. Moreover, this paper explains how this approach can be applied in each step of roadmapping (preliminary, mapping and managing steps).
Governing Environments for Agent-Based Traffic Simulations
Authors: Michael Schumacher, Laurent Grangier, Radu Jurca
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

Multiagent systems may be elegantly modeled and designed by enhancing the role of the environment in which agents evolve. In particular, the environment may have the role of a governing infrastructure that regulates with laws or norms the actions taken by the agents. The focus of modeling and design is thus shifted from a subjective view of agents towards a more objective view of the whole multiagent system. In this paper, we apply the idea of a governing environment to model and design a multi-agent system that micro-simulates the Swiss highway network. The goal of the simulation is to show how traffic jams and accordion phenomena may be handled with appropriate local regulations on speed limits. A natural modeling would give segments the capacity to regulate the speed based on observed local events. We developed the simulation platform from scratch in order to accommodate our design choices and a realistic complexity. This paper presents in details our modeling choices, and first experimental results.
Holonic based approach to machine vision
Authors: F. B. Marin, A. Epureanu, M. Banu, V. Marinescu
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

This paper presents an image processing procedure to detect and measure the insert and blade holder profiles and positions. A holonic approach is considered in this paper whereby objects identification in the scene is performed by basic regions (color based identification) merging in wider regions to meet geometrical description. Specifying relationships between the image components and formulating queries that search for objects, their other associated characteristics, is performed by a language for this specific problem. The proposed method is shown to be effective and suitable for the unmanned measurement of insert and blade holder online identification. Moreover, the proposed approach has the potential to deal with scene object identification problems.
Independent Component Analysis and Support Vector Machine combined for Brands Identification of Milk Powder Based on Visible and Short-Wave Near-Infrared Spectroscopy
Authors: Di Wu, Shuijuan Feng, Xiaojing Chen, Haiqing Yang, Yong He
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The aim of this paper is to investigate the potential of Visible and short-wave near-infrared spectroscopy (Vis/SWNIR) technique used for brand discrimination of milk powder. Fifty samples for each brand were studied. Based on the independent components (ICs) as the input variable obtained from fast fixed-point independent component analysis (FastICA), Least-squares Support Vector Machine (LS-SVM) was applied to building the prediction model. The discrimination rate of LS-SVM model which was established based on FastICA was reached at 100 %. LS-SVM model and partial least squares model, which were both established based on the whole measurement region, were also established. The identification results of these two models are worse than LS-SVM which was established based on ICs. It is concluded that Vis/ SWNIR technique is available for the brand identification of milk powder fast and non-destructively.
Composition of Interactive Web Services Based on Controller Synthesis
Authors: Philippe Balbiani, Fahima Cheikh, Guillaume Feuillade
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

We study an abstract form of service composition where Web services are represented as nondeterministic communicating automata. Considering the case in which communication is done via channels able to hold at most one message at a time, the service composition problem consists, given a client service, a goal service and a community of available services, to determine whether there exists a mediator service able to communicate with the client and the services of the given community in such a way that their global behavior satisfies the client service request expressed as the given goal service. We demonstrate the decidability of this problem via a reduction to a decidable control problem.
Mobile Learning and Student Perspectives: An mReality Check!
Authors: Elaine Lawrence, Agnieszka Bachfischer, Laurel Evelyn Dyson, Andrew Litchfield
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

In this paper the authors report on the results of a survey aimed at ascertaining the opinions of contemporary university students on the use of mobile devices as learning tools. Four hundred and forty two postgraduate and undergraduate students from an Australian university completed the online survey. The authors analyzed both quantitative and qualitative data focusing on the ramifications for m-learning practices in university environments. Mobile Technology Acceptance Factors are used to highlight important findings from the survey.
Towards Compliance of Agents in Open Multi-agent Systems
Authors: Jorge Gonzalez-Palacios, Michael Luck
Venue: Software Engineering for Multi-Agent Systems V: Research Issues and Practical Applications (2007)

With the introduction of large-scale open systems, the need for managing interactions between agents, and in particular for managing the entry of a new agent into an existing system, becomes an increasingly more important objective. Without such management, there may be significant implications for the performance of such systems, negating the benefits to be gained from openness. In this paper, we sketch a process by which open multi-agent systems may be engineered, through the establishment of a system specification to be used by designers of agents that will enter the system, and by the system itself to check that an agent entering a system complies with the system constraints. While not fully detailed, the paper provides an initial model and a clear direction as to how such a system may be constructed, offering a new way of developing open multi-agent systems.
The Main Devices of Foregrounding in the Information Structure of Georgian Sentences
Authors: Rusudan Asatiani
Venue: Logic, Language, and Computation: 6th International Tbilisi Symposium on Logic, Language, and Computation,TbiLLC 2005 Batumi, Georgia, September 12-16, 2005. Revised Selected Papers (2007)

Structuring of information proceeds through the foregrounding of certain parts of the information. In general, foregrounding can be realized on various linguistic levels and it is possible to distinguish: Conceptual,Functional, Discourse and Pragmatic devices, which can be represented by various formal means: Phonetic-Phonological, Morphological-Syntactic and Lexical-Pragmatic. All the devices can co-occur during the information packaging. Some of them are obligatory and are on the high level of the hierarchically organized processes of foregrounding (e.g. conceptual or functional foregrounding); some of them are optional and they are defined by the specific discourse and/or pragmatic values of a sentence (e.g. focus or topic); some forms of foregrounding are implicational (e.g. sometimes reordering implies emphasis of intonation) and so on. The relations between the different kinds of foregrounding are language specific, but it seems possible to speak about universal models of formalization of the information structures. In Georgian there is no morphological topic marker, but all other devices of foregrounding are possible. The paper examines the main models of such devices. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Plenary lecture IX: adapting a blowdown type wind tunnel for ground effect simulation tests
Authors: Richard Selescu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

In the paper are shortly presented the main results of some researches performed by the author regarding the adapting of an intermittent (blowdown type) wind tunnel for testing models of terrestrial (road transportation) vehicles, (air) vehicles with ground effect, or which evolve in the ground proximity (the cases of aircraft take-off running and lift-off), as well as for aircraft half models testing (the so called "reflection-plane testing"). This new obtained installation includes a large series of automatic systems (mechanical, measuring and driving), which must accomplish all the envisaged testing requirements. The essential advantage of this kind of solution, with respect to that of a continuous closed (usually nonpressurized) wind tunnel adapting, consists in obtaining much larger values of the test Reynolds number, given by the correspondingly higher values of the stagnation pressure (in the blowdown wind tunnel settling chamber). So far, as we know, nowhere in the world has been considered the problem of adapting a pressurized intermittent type wind tunnel to aerodynamic tests with correct ground effect simulation. The main part of this adaptation is the moving belt mechanical system (considered to be installed at the floor of the modified wind tunnel three-dimensional transonic test section), whose task is to assure the elimination of the velocity nonuniformity effect, introduced by the boundary layer on the respective wall of the wind tunnel, without any irreversible alteration of the geometry and kinematics of the installation above.
A lazy developer approach: building a JVM with third party software
Authors: Nicolas Geoffray, Gaël Thomas, Charles Clément, Bertil Folliot
Venue: Proceedings of the 6th international symposium on Principles and practice of programming in Java (2008)

The development of a complete Java Virtual Machine (JVM) implementation is a tedious process which involves knowledge in different areas: garbage collection, just in time compilation, interpretation, file parsing, data structures, etc. The result is that developing its own virtual machine requires a considerable amount of man/year. In this paper we show that one can implement a JVM with third party software and with performance comparable to industrial and top open-source JVMs on scientific applications. Our proof-of-concept implementation uses existing versions of a garbage collector, a just in time compiler, and the base library, and is robust enough to execute complex Java applications such as the OSGi Felix implementation and the Tomcat servlet container.
Improved Distributed Simulation of Sensor Networks Based on Sensor Node Sleep Time
Authors: Zhong-Yi Jin, Rajesh Gupta
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

Sensor network simulators are important tools for the design, implementation and evaluation of wireless sensor networks. Due to the large computational requirements necessary for simulating wireless sensor networks with high fidelity, many wireless sensor network simulators, especially the cycle accurate ones, employ distributed simulation techniques to leverage the combined resources of multiple processors or computers. However, the large overheads in synchronizing sensor nodes during distributed simulations of sensor networks result in a significant increase in simulation time. In this paper, we present a novel technique that could significantly reduce such overheads by minimizing the number of sensor node synchronizations during simulations. We implement this technique in Avrora, a widely used parallel sensor network simulator, and achieve a speedup of up to 11 times in terms of average simulation speed in our test cases. For applications that have lower duty cycles, the speedups are even greater since the performance gains are proportional to the sleep times of the sensor nodes.
Reverse engineering of a symmetric object
Authors: Minho Chang, Sang C. Park
Venue: Computers and Industrial Engineering (2008)

This paper presents a procedure to find an approximate symmetry plane from a point cloud for the reverse engineering of a symmetric object. Even if, the point cloud acquired from a symmetric object does not have exact symmetry planes in the mathematical sense, the data usually carries adequate symmetric information for reverse engineering. To generate a CAD model satisfying the original aesthetic and functional design, it is essential to extract approximate symmetry planes. This paper proposes a new procedure to extract a symmetry plane, and it includes a registration step, aligning three-dimensional models. To improve the computational efficiency of the proposed procedure, the registration step has been modified by using the inherent attributes of the problem: (1) the measured point data may include noise and (2) the point cloud might be partially asymmetric. The proposed procedure has been implemented and proven to be efficient enough to handle very heavy data sets including millions of entities (points and triangles).