ppxscal/embedding_network huggingface dataset:
Directed soft arc consistency in pseudo trees
Authors: Toshihiro Matsui, Marius Cǎlin Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hirohsi Matsuo
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent systems. With DCOPs a multi-agent system is represented as a set of variables and a set of constraints/cost functions. We focus on DCOP solvers that employ pseudo-trees. A pseudo-tree is a graph structure for a constraint network that represents a partial ordering of variables. Most pseudo-tree-based search algorithms perform optimistic searches using explicit/implicit backtracking in parallel. However, for cost functions taking a wide range of cost values, such exact algorithms require many search iterations, even if the constraint density is relatively low. Therefore additional improvements are necessary to reduce the search process. A previous study used a dynamic programming-based preprocessing technique that estimates the lower bound values of costs. However, there are opportunities for further improvements of efficiency. In addition, modifications of the search algorithm are necessary to use the estimated lower bounds. The proposed method applies soft arc consistency (soft AC) enforcement to DCOP. In the proposed method, directed soft AC is performed based on a pseudo-tree in a bottom up manner. Using the directed soft AC, the global lower bound value of cost functions is passed up to the root node of the pseudo-tree. The value of each cost function is also reduced. As a result, the original problem is converted to an equivalent problem which is efficiently solved using common search algorithms. The performance of the proposed method is evaluated by experimentation. The results show that it is more efficient than previous methods that estimate the lower bound of costs. Moreover, the proposed method is efficient for approximation algorithms that use bounded errors.
Castle warrior: redefining 21st century network defense
Authors: Monty McDougal
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Historically, network security has often been equated to the medieval practice of building castles and walls to keep intruders at bay. In today's world of network castles, the castle paradigm has largely served us well for the last 15--20 years, but attacks are evolving to counter the once great firewalls that have protected our network castles and our crown jewels. It is time to revisit the castle doctrine and evolve our defenses to address the new targeted threats.
Control of a Bipedal Walking Robot Using a Fuzzy Precompensator
Authors: Soraya Bououden, Foudil Abdessemed, Benali Abderraouf
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

The Computed Torque Control (CTC) is an effective motion control strategy for a biped walking robot, which can ensure globally asymptotic stability. However, CTC scheme requires precise dynamical models of biped robot. To handle this impossibility, we proposed an approach combing CTC and fuzzy logic controller to regulate the dynamic walking of a planar 7 degrees-of-freedom under-actuated biped robot to follow a specified trajectory. A computed torque is used to achieve high speed and high precision tracking while the fuzzy controller behaves remedies for any parameter deviation compensating thus for unknown uncertainties and disturbances. Finally, computer simulation are carried on and results are presented to show tracking capability and effectiveness of the proposed scheme.
Verification of Medical Guidelines using Task Execution with Background Knowledge
Authors: Arjen Hommersom, Perry Groot, Peter Lucas, Michael Balser, Jonathan Schmitt
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

The use of a medical guideline can be seen as the execution of computational tasks, sequentially or in parallel, in the face of patient data. It has been shown that many of such guidelines can be represented as a 'network of tasks', i.e., as a number of steps that have a specific function or goal. To investigate the quality of such guidelines we propose a formalization of criteria for good practice medicine a guideline should comply to. We use this theory in conjunction with medical background knowledge to verify the quality of a guideline dealing with diabetes mellitus type 2 using the interactive theorem prover KIV. Verification using task execution and background knowledge is a novel approach to quality checking of medical guidelines.
A programming abstraction for motion-aware applications running on distributed systems of mobile components
Authors: Martin Däumler, Dirk Müller
Venue: Proceedings of the 1st International Workshop on Context-Aware Middleware and Services: affiliated with the 4th International Conference on Communication System Software and Middleware (COMSWARE 2009) (2009)

Traditional distributed systems are intended to hide the system's distribution. Awareness of location within the system or the application is not necessary. In contrast, mobile distributed systems' applications often require awareness of location and even motion. In order to allow abstract generic programming that is unaware of the actual executing system, its distribution has to be hidden to the programmer. So, the need for a programming abstraction that allows considering distribution transparency within the executing system and motion awareness within the application becomes apparent. This would allow developing classes of applications used in different contexts and executed by numerous varying systems. Such a top-down view disburdens the programmer from the complex and error-prone application partitioning and assignment to the sub-systems. Hence, scalability and robustness are improved significantly. We claim that spatiotemporal constraints are a proper way to provide such a top-down approach. We introduce our approach for such constraints and give an application example.
Hyperbolic heat equation as mathematical model for steel quenching of L-shape samples, part 1 (direct problem)
Authors: Margarita Buike, Andris Buikis
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

In the first part of paper we develop mathematical model for 3-D hyperbolic heat equation and construct analytical solution of the 2-D problem for the thin L-shape sample. Solution for 2-D direct problem is obtained in closed analytical form as 2nd kind iterate Fredholm integral equation regarding one space argument and as Volterra integral equation regarding time coordinate.
A fuzzy-rough case-based learning approach for intelligent die design
Authors: Chi Zhou, Feng Ruan, QingXiang Xia, ZhenYuan Huang
Venue: International Journal of Computer Applications in Technology (2009)

Tacit knowledge plays an important role in stamping die design, but it is hard to be mined and reused. This paper presents a fuzzy-rough approach of mining rules from existing successful die designs, which improves learning capability of intelligent stamping die design systems. The core of the learning mechanism includes: (1) a feature-based case representation, (2) fuzzification of feature attributes, (3) a fuzzy classification method to partition the cases into clusters based on similarities, (4) a rough set theory-based approach to compute attribute reduct and mine rules. A case base containing 53 bending features was used to test the proposed approach. 38 If-Then rules were mined after computing, and these rules could preserve the basic properties of the origin decision table. The results show that this approach can speed up the retrieval process of the case-based systems and reduce the difficulties in acquiring and updating rules for the rule-based systems.
A personalised query suggestion agent based on query-concept bipartite graphs and Concept Relation Trees
Authors: Yan Chen, Yan-Qing Zhang
Venue: International Journal of Advanced Intelligence Paradigms (2009)

Queries submitted to a web search engine are usually short and ambiguous. Query suggestion is a way for extending queries to allow search engines to better speculate exact meanings of short and ambiguous queries. This paper proposes a personalised query suggestion agent that uses the Query-Concept bipartite graphs and Concept Relation Trees (CRTs) for query suggestion. The agent dynamically updates weights between Query-Concept and Concept-Concept to personalise suggestions. Simulation results show that the new personalised query suggestion agent works effectively.
Location management for mobile devices
Authors: Erik Wilde
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Location-awareness, in the form of location information about clients and location-based services provided by servers, is becoming increasingly important for networked communications in general, and wireless and mobile devices in particular. The current fragmented landscape of location concepts and location-awareness, however, is not suitable for handling location information on a Web scale. Providing users with mechanisms which allow them to control how they want to expose their location information, and thus allow control over how to share location information with others and services, is a crucial step for better location management for mobile devices. This paper presents a concept for representing location vocabularies, matching and mapping them, how these vocabularies can be used to support better privacy for users of location-based services, and better location sharing between users and services. The concept is based on a language for describing place name vocabularies, which we call “Place Markup Language (PlaceML)”, and on various ways how these vocabularies can be used in a location-aware infrastructure of networked devices.
Live migration of virtual machine based on full system trace and replay
Authors: Haikun Liu, Hai Jin, Xiaofei Liao, Liting Hu, Chen Yu
Venue: Proceedings of the 18th ACM international symposium on High performance distributed computing (2009)

Live migration of virtual machines (VM) across distinct physical hosts provides a significant new benefit for administrators of data centers and clusters. Previous migration schemes focused on transferring the runtime memory state of the VM. Those approaches employed memory pre-copy algorithm to synchronize the migrating VM states, which make VM live migration cost much network traffic and application downtime, especially for memory intensive workloads. This paper describes the design and implementation of a novel approach CR/TR-Motion that adopts checkpointing/recovery and trace/replay technology to provide fast, transparent VM migration. With execution trace logged on the source host, a synchronization algorithm is performed to orchestrate the running source and target VM until they get a consistent state. We also give a formalized characterization about the migration evaluation metrics and make a mathematical analysis about our algorithm. Our scheme can greatly reduce the migration downtime and network bandwidth consumption. Experimental measurements show that our approach can drastically reduce migration overheads compared with pre-copy algorithm: up to 72.4% on application observed downtime, up to 31.5% on total migration time and up to 95.9% on the data to synchronize the VM state, while the application performance overhead due to migration is less than 8.54% on average.
A Flexible API and Editor for SKOS
Authors: Simon Jupp, Sean Bechhofer, Robert Stevens
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

We present a programmatic interface (SKOS API) and editor for working with the Simple Knowledge Organisation System SKOS. The SKOS API has been designed to work with SKOS models at a high level of abstraction to aid developers of applications that use SKOS. We describe a SKOS editor (SKOSEd) that is built on the Protege 4 framework using the OWL and SKOS API. As well as exploring the benets of the principled extensibility afforded by this approach, we also explore the limitations placed upon SKOS by restricting SKOSEd to OWL-DL.
Graph Grammar Based Petri Nets Model of Concurrency for Self-adaptive hp-Finite Element Method with Triangular Elements
Authors: Arkadiusz Szymczak, Maciej Paszyński
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

The paper presents the model of concurrency for the self-adaptive hp-Finite Element Method (hp-FEM) with triangular elements. The model concerns the process of an initial mesh generation as well as mesh adaptation. The model is obtained by defining CP-graph grammar productions as basic undivided tasks for both mesh generation and adaptation algorithms. The order of execution of graph grammar productions is set by control diagrams. Finally, the Petri nets are created based on the control diagrams. The self-adaptive hp-FEM algorithm modeled as a Petri net can be analyzed for deadlocks, starvation or infinite execution.
Stability Analysis of a General Class of Continuous-Time Recurrent Neural Networks
Authors: Chaojin Fu, Zhongsheng Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

This paper presents the results of stability analysis of a general class of continuous-time recurrent neural networks. The new stability results includes sufficient conditions for global asymptotic stability. With weaker conditions and less restrictive activation functions, the new stability results improve and extend existing ones. Discussions and examples are given to illustrate and compare the new results with the existing ones.
A self-configuring test harness for web applications
Authors: Jairo Pava, Courtney Enoex, Yanelis Hernandez
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

As web applications become more complex and dependent on numerous web technologies, regression testing becomes a time-consuming and expensive endeavor. Many approaches have been proposed to automate the testing process; however few of the approaches utilize the concepts of autonomic computing to symplify the management of a test harness. In this paper, we introduce a self-configuring autonomic test harness. Our test harness monitors the client-side of a web application to detect which web technologies were used to implement the interface. It then automatically selects a testing tool capable of validating any technology-specific features, generates an automated test script, and runs it on the web application. Test generation is performed using a model-driven approach which encodes test cases in a platform independent manner, and transforms them into platform specific tests using a model of various web technologies. In this way, our approach supports regression testing from the web interface as the application migrates to new technologies. We also present the details of a prototype used to demonstrate the approach.
Biological Database Modeling, 1st edition
Authors: Jake Chen, Amandeep S. Sidhu
Venue:  (2007)

Modern biological research in areas like drug discovery produces a staggering volume of data, and the right modeling tools can help scientists apply it in ways never before imaginable. This collection of next-generation biodata modeling techniques combines innovative concepts, methods, and applications with case studies in genome, microarray, proteomics, and drug discovery projects to help bioinformatics professionals develop ever-more powerful data management systems in any domain. Breaking new ground at the intersection of life sciences and data management, the book introduces practitioners to core biodata modeling techniques, biological database resources, and ontology concepts. It explains the latest envelope-pushing methods and software applications for processing, integrating, and managing biodata.
Semantic Transaction Processing in Mobile Computing
Authors: Fritz Laux, Tim Lessner, Martti Laiho
Venue: Proceeding of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008 (2008)

Transaction processing is of growing importance for mobile computing. Booking tickets, flight reservation, banking, ePayment, and booking holiday arrangements are just a few examples for mobile transactions. Due to temporarily disconnected situations the synchronisation and consistent transaction processing are key issues. Serializability is a too strong criteria for correctness when the semantics of a transaction is known. We introduce a transaction model that allows higher concurrency for a certain class of transactions defined by its semantic. The transaction results are “escrow serializable” and the synchronisation mechanism is non-blocking. Experimental implementation showed higher concurrency, transaction throughput, and less resources used than common locking or optimistic protocols.
A Web data extraction approach to harvesting data from online sources
Authors: Richi Nayak, Magnus Haugaasen
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

With the Web becoming a main source of data representation, businesses have opportunities to gather data from various independent web sources and condense these data into specialized services. However, there is no unified structure of web pages and therefore extracting data from sources can be a complex task. We present a solution to locate and extract data from a large group of online bookmaker pages to provide a real-time service to deliver price on sporting events.
Mapping strategy for web-driven magazines with personalized advertisement and content
Authors: Fabio Giannetti
Venue: Multimedia Tools and Applications (2009)

"There will always (I hope) be print books, but just as the advent of photography changed the role of painting or film changed the role of theater in our culture, electronic publishing is changing the world of print media. To look for a one-to-one transposition to the new medium is to miss the future until it has passed you by."--Tim O'Reilly (2002). It is not hard to envisage that publishers will leverage subscribers' information, interest groups' shared knowledge and others sources to enhance their publications. While this enhances the value of the publication through more accurate and personalized content, it also brings a new set of challenges to the publisher. Content is now driven by web and in a truly automated system, that is, no designer "re-touch" intervention is envisaged. This paper introduces an exploratory mapping strategy to allocate web driven content in a highly graphical publication like a traditional magazine. Two major aspects of the mapping are covered, those enable different level of flexibility and address different content flowing strategies. The last contribution is an evaluation of existing standards, which potentially can leverage this work to incorporate flexible mapping, and subsequently, composition capabilities. The work published here is an extended version of the article presented at the Eight ACM Symposium on Document Engineering in fall 2008 (Giannetti 2008).
A Method of Geometric Analysis of Condorcet Function
Authors: Xiaodong Xu, Xu Liu
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

Voting is usually used in democratic society for decision-making, but majority circle is inevitable, if choosing that method. It is complex to by combinatory to compute the probability of majority circle, instead of that, geometry is an intuitive and simple method, besides, it can show the relationship between the different combination and majority circle. First, compute the probability of majority circle by combinatory, and then denote candidate triangle and result-profile triangle. Finally analyze each preference combination and its voting result, what's more, if voting majority circle occurs, compute the probability.
Teacher Perception of the Use of Information Technology in Teaching: A School Case in Hong Kong
Authors: Stephen Ping Wah Kong, Percy Lai Yin Kwok
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper attempts to explore into teacher perception of using information technology (IT) in education by examining four major domains, namely, teacher perception of their computer training, computer facilities and assistance available, their confidence and comfortability in using computer in daily lessons, and their perception of their roles in using IT in classrooms. On one hand, a semi-structured survey revealed that there were positive impacts of teacher perception on the usage of computer in classrooms and highlighted teachers' preferences of adopting teacher-centered approach in teaching with IT. On the other hand, a semi-structured interview reflected that the teaching staff members worked harmoniously and school administration was supportive. However, cross-subject or cross-curricular collaborative projects among teachers were rare. Finally, some recommendations are made to promote the use of IT in teaching concerning school-based collaborative culture, conceptual and strategic issues in e-leadership and inter-regional / intra-regional resource bank for teaching and learning.
Real-time texture synthesis using s-tile set
Authors: Feng Xue, You-Sheng Zhang, Ju-Lang Jiang, Min Hu, Xin-Dong Wu, Rong-Gui Wang
Venue: Journal of Computer Science and Technology (2007)

This paper presents a novel method of generating a set of texture tiles from samples, which can be seamlessly tiled into arbitrary size textures in real-time. Compared to existing methods, our approach is simpler and more advantageous in eliminating visual seams that may exist in each tile of the existing methods, especially when the samples have elaborate features or distinct colors. Texture tiles generated by our approach can be regarded as single-colored tiles on each orthogonal direction border, which are easier for tiling and more suitable for sentence tiling. Experimental results demonstrate the feasibility and effectiveness of our approach.