ppxscal/embedding_network huggingface dataset:
BMA*: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps
Authors: Dan He
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

The best known algorithm for the one-to-all shortest path problem is Dijkstra's algorithm, which can achieve time complexity O(|E| + |V|log(|V|)) by the implementation of data structures like buckets. While for one-to-some shortest path problem, no matter how small the "some" is, the time complexity of Dijkstra's algorithm remains O(|E| + |V|log(|V|)) and it often still needs to explore a large part of the graph and thus is not efficient. This paper proposes a novel algorithm which computes the shortest paths bidirectionally with A * algorithm multiple times to solve the one-to-some shortest path problem on road maps efficiently, where the size of the destination set is much smaller than the total number of vertices in the graph. The experiments on both randomly generated graphs and real road maps show that our algorithm is more space and time efficient than Dijkstra's algorithm with buckets, one of the most efficient algorithm for one-to-some shortest path problem.
Multi-task Neural Networks for Dealing with Missing Inputs
Authors: Pedro J. García-Laencina, Jesús Serrano, Aníbal R. Figueiras-Vidal, José-Luis Sancho-Gómez
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

Incomplete data is a common drawback in many pattern classification applications. A classical way to deal with unknown values is missing data estimation. Most machine learning techniques work well with missing values, but they do not focus the missing data estimation to solve the classification task. This paper presents effective neural network approaches based on Multi-Task Learning (MTL) for pattern classification with missing inputs. These MTL networks are compared with representative procedures used for handling incomplete data on two well-known data sets. The experimental results show the superiority of our approaches with respect to alternative techniques.
Enriched categories and models for spaces of evolving states
Authors: Timothy Porter
Venue: Theoretical Computer Science (2008)

Partially ordered sets, causets, partially ordered spaces, and their local counterparts are now often used to model systems in computer science and theoretical physics. The order models 'time' which is often not globally given. In this setting, directed paths are important objects of study, as they correspond to an evolving state or particle traversing the system. We model both the 'space' and the directed paths by a simplicially enriched category, and show how to adapt some classical constructions to produce a differential graded enrichment.
An Ontology Supported Meta-interface for the Development and Installation of Customized Web Based Telemedicine Systems
Authors: Jackei H. Wong, Wilfred W. Lin, Allan K. Wong, Tharam S. Dillon
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

The novel and generic meta-interface (MI) paradigm proposed in this paper automates the generation of customized telemedicine software systems (CTSS), directly from the customized application interface (CAI) specifications given. The MI paradigm was tested and verified in the TCM (Traditional Chinese Medicine) telemedicine environment of Nong's Company Limited of the PuraPharm Group, a local Hong Kong TCM telemedicine developer that funded this research. The CAI specification is made by "gluing" together icons selected from the enterprise icon library (IL). The CTSS generation, in effect, extracts the corresponding portion of the subsumption hierarchy from the master ontology, an enterprise standard. Since CTSS prototypes were verified in the Nong's TCM telemedicine environment, they were built with the Nong's master TCM ontology core (onto-core) as the basis and reference. In this light, the ontological extraction for a CAI specification is turned into the local TCM onto-core for the CTSS prototype. The enterprise TCM onto-core, the local TCM onto-core, and the icons in IL all contain formal knowledge derived from the enterprise TCM vocabulary. In Nong's case the enterprise vocabulary is the standard of CTSS terminology, gathered from TCM classics, treatises, and case histories by domain experts with consensus certification. Using CAI as the single input to automate the whole CTSS generation process would eliminate MSPM (multi-site project management) problems. Since the Nong's MC (mobile clinics) based telemedicine system is web-based and pervasive, the CTSS is also referred to as the Nong's web-based telemedicine systems (WTS).
A New Segmentation Method Based on SVM for HIFU Image-Guided System
Authors: Zhao Zhang, Su Zhang, Wei Yang, Ya Zhu Chen, Hong Tao Lu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

High Intensity Focused Ultrasound (HIFU) is one of promising non-invasive thermal ablation techniques of tumor. In this paper, we present a segmentation method based on Support Vector Machine (SVM) for HIFU image-guided system where SVM is used to construct the prior model about the intensity and the shape of the structure from the training set of images and the boundaries. When segmenting a novel image, we improved level set method by incorporating this prior model. Segmentation results are demonstrated on ultrasonic images. It shows that the prior model makes segmentation process more robust and faster.
Commutativity analysis for XML updates
Authors: Giorgio Ghelli, Kristoffer Rose, Jérôme Siméon
Venue: ACM Transactions on Database Systems (TODS) (2008)

An effective approach to support XML updates is to use XQuery extended with update operations. This approach results in very expressive languages which are convenient for users but are difficult to optimize or reason about. A crucial question underlying many static analysis problems for such languages, from optimization to view maintenance, is whether two expressions commute. Unfortunately, commutativity is undecidable for most existing XML update languages. In this article, we propose a conservative analysis for an expressive XML update language that can be used to determine commutativity. The approach relies on a form of path analysis that computes upper bounds for the nodes that are accessed or modified in a given expression. Our main result is a theorem that can be used to identify commuting expressions. We illustrate how the technique applies to concrete examples of query optimization in the presence of updates.
From page-centric to portlet-centric Web development: Easing the transition using MDD
Authors: Oscar Díaz, Arantza Irastorza, Jesús Sánchez Cuadrado, Luis M. Alonso
Venue: Information and Software Technology (2008)

Portlet syndication is the next wave following the successful use of content syndication in current portals. Portlets can be regarded as Web components, and the portal as the component container where portlets are aggregated to provide higher-order applications. This perspective requires a departure from how current Web portals are envisaged. The portal is no longer perceived as a set of pages but as an integrated set of Web components that are now delivered through the portal. From this perspective, the portal page now acts as a mere conduit for portlets. Page and page navigation dilute in favor of portlet and portlet orchestration. However, the mapping from portlet orchestration (design time) to page navigation (implementation time) is too tedious and error prone. For instance, the fact that the same portlet can be placed in distinct pages produces code clones that are repeated along the pages that contain this portlet. This redundancy substantiates in the first place the effort to move to model-driven development. This work uses the eXo platform as the target PSM, and the PIM is based on Hypermedia Model Based on Statecharts. The paper shows how this approach accounts for portal validation/verification to be conducted earlier at the PIM level, and streamlines both design and implementation of eXo portals. A running example is used throughout the paper.
Gambit: A Prototyping Approach to Video Game Design
Authors: T. Larrabee
Venue: IEEE Software (1984)

Video game designers don't have to be assembly language programmers. Their creative talents can be expressed in a prototyping language.
Database reverse engineering tools
Authors: Natash Ali Mian, Tauqeer Hussain
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

Almost every information system processes and manages huge data stored in a database system. For improvement and maintenance of legacy systems, the conceptual models of such systems are required. With the growing complexity of information systems and the information processing requirements, the need for database reverse engineering is increasing every day. Different Computer Assisted Software Engineering (CASE) tools have been developed as research projects or as commercial products which reverse engineer a given database to its conceptual schema. This paper explores the capabilities of existing CASE tools and evaluates to which extent these tools can successfully reverse engineer a given database system. It also identifies the constructs of a conceptual model which are not yet supported by the database reverse engineering tools. This research provides motivation for software engineers to develop CASE tools which can reverse engineer the identified constructs and can therefore improve the productivity of reverse engineers.
Localization using signal strength: to range or not to range?
Authors: Gianni Giorgetti, Sandeeep K.S. Gupta, Gianfranco Manes
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

Received Signal Strength (RSS) data collected within a wireless network can be used to obtain either range estimates or connectivity information. Both approaches lead to localization schemes that require no additional hardware. It is not clear, however, when a range-based scheme should be used in favor of a connectivity-based one. We use analysis of the Fisher information and the Cramér-Rao Bound (CRB) to characterize the error of both approaches. We find the existence of a critical connectivity value, below which the use of RSS data for range-based localization is counter-productive. We show that an approximation of the critical connectivity value can be computed as a function of the network size and the parameters of the propagation model.
2nd International Workshop on Measurement-Based Cockpits for Distributed Software and Systems Engineering Projects (SOFTPIT 2008)
Authors: Marcus Ciolkowski, Jens Heidrich, Marco Kuhrmann, Jürgen Münch
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

In order to successfully conduct global development projects, one crucial success factor is the existence of well-specified and coordinated distributed development processes. Therefore, it is necessary to have efficient management and controlling mechanisms in place. Many companies are currently establishing so-called software cockpits for systematic quality assurance and management support. A software cockpit is comparable to an aircraft cockpit, which centrally integrates all relevant information for monitoring, controlling, and management purposes. In practice, a variety of simple dashboards approaches for project control exists. However, approaches supporting advanced management techniques and allowing for organization-wide data collection, interpretation, and visualization are rarely implemented. The goal of this workshop is to discuss techniques, methods, and tools for the measurement-based management of globally distributed software development projects and to share experiences among researchers and practitioners. Efficiently managing distributed development projects (multi-sited and multi-organizational) implies many challenges that need to be addressed by software engineering research. Typical research questions address the problems of how to cope with different cultures or heterogeneous organizational structures, platforms, measurement systems, and process maturities. Other research areas include the establishment of data security, transparency, confidence in integrated data and interpretation models, and well-coordinated development processes and interfaces.
Theory of Real Computation According to EGC
Authors: Chee Yap
Venue: Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006 Revised Papers (2008)

The Exact Geometric Computation (EGC) mode of computation has been developed over the last decade in response to the widespread problem of numerical non-robustness in geometric algorithms. Its technology has been encoded in libraries such as LEDA, CGAL and Core Library. The key feature of EGC is the necessity to decide zero in its computation. This paper addresses the problem of providing a foundation for the EGC mode of computation. This requires a theory of real computation that properly addresses the Zero Problem. The two current approaches to real computation are represented by the analytic school and algebraic school. We propose a variant of the analytic approach based on real approximation. To capture the issues of representation, we begin with a reworking of van der Waerden's idea of explicit rings and fields. We introduce explicit sets and explicit algebraic structures. Explicit rings serve as the foundation for real approximation: our starting point here is not ¿, but $\mathbb{F}\subseteq \mathbb{R}$, an explicit ordered ring extension of ¿ that is dense in ¿. We develop the approximability of real functions within standard Turing machine computability, and show its connection to the analytic approach. Current discussions of real computation fail to address issues at the intersection of continuous and discrete computation. An appropriate computational model for this purpose is obtained by extending Schönhage's pointer machines to support both algebraic and numerical computation. Finally, we propose a synthesis wherein both the algebraic and the analytic models coexist to play complementary roles. Many fundamental questions can now be posed in this setting, including transfer theorems connecting algebraic computability with approximability.
Fuzzy Optimization Problems with Critical Value-at-Risk Criteria
Authors: Yan-Kui Liu, Zhi-Qiang Liu, Ying Liu
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Based on value-at-risk (VaR) criteria, this paper presents a new class of two-stage fuzzy programming models. Because the fuzzy optimization problems often include fuzzy variables defined through continuous possibility distribution functions, they are inherently infinite- dimensional optimization problems that can rarely be solved directly. Thus, algorithms to solve such optimization problems must rely on intelligent computing as well as approximating schemes, which result in approximating finite-dimensional optimization problems. Motivated by this fact, we suggest an approximation method to evaluate critical VaR objective functions, and discuss the convergence of the approximation approach. Furthermore, we design a hybrid algorithm (HA) based on the approximation method, neural network (NN) and genetic algorithm (GA) to solve the proposed optimization problem, and provide a numerical example to test the effectiveness of the HA.
Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums
Authors: Bing Chen, Shenggui Zhang, T. C. Cheng
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

In this paper, we prove that a 2-connected weighted graph G contains either a Hamilton cycle or a cycle of weight at least 2m/3 if it satisfies the following conditions: (1) $\sum_{i=1}^3d^w(v_i)\ge m$, where v 1,v 2 and v 3 are three pairwise nonadjacent vertices of G, and two of them are nonadjacent vertices of an induced claw or an induced modified claw; (2) In each induced claw and each induced modified claw of G, all edges have the same weight. This extends several previous results on the existence of heavy cycles in weighted graphs.
Roadmap towards Lifecycle Support for Highly Distributed Web-Based Systems
Authors: Frederic Majer, Patrick Freudenstein, Martin Nussbaumer
Venue: Proceedings of the 2008 Eighth International Conference on Web Engineering (2008)

To cope with the increased complexity of today’s Web-based systems, approaches facilitating operations, maintenance and evolution of heterogeneous and distributed systems landscapes are vital. In particular, due to the complex interdependencies between their distributed system parts, assuring that services are delivered at a high level of quality is challenging. To this end, we present the integrated information map (i2map) as an aspect-oriented approach. It considers these interdependencies as first-class citizens and provides sophisticated services addressing the lifecycle support of distributed systems. We exemplarily demonstrate the approach’s potential in the context of ontology-based evaluation of service level agreements in a highly interrelated system landscape.
Studies on Shape Feature Combination and Efficient Categorization of 3D Models
Authors: Tianyang Lv, Guobao Liu, Jiming Pang, Zhengxuan Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In the field of 3D model retrieval, the combination of different kinds of shape feature is a promising way to improve retrieval performance. And the efficient categorization of 3D models is critical for organizing models. The paper proposes a combination method, which automatically decides the fixed weight of different shape features. Based on the combined shape feature, the paper applies the cluster analysis technique to efficiently categorize 3D models according to their shape. The standard 3D model database, Princeton Shape Benchmark, is adopted in experiment and our method shows good performance not only in improving retrieval performance but also in categorization.
Approximation with smaller order polynoms of EMF characteristics of thermocouples in the measurement systems
Authors: Costin Cepisca, Covrig Mircea, Sorin Dan Grigorescu, Cornelia Cepisca
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

The temperature - versus - voltage relationship of a thermocouple is not linear. The thermocouple tables have a polynomial form. In the digital measurement systems the calculation of high-order polynomials is a time consuming task for the computer. We can also save time by using a lower order polynomial for a smaller temperature range. This paper presents a method for obtaining the smaller order polynoms for the approximation of real temperature-emf characteristic of thermocouples.
Using Knowledge Tracing in a Noisy Environment to Measure Student Reading Proficiencies
Authors: Joseph E. Beck, June Sison
Venue: International Journal of Artificial Intelligence in Education (2006)

Constructing a student model for language tutors is a challenging task. This paper describes using knowledge tracing to construct a student model of reading proficiency and validates the model. We use speech recognition to assess a student's reading proficiency at a subword level, even though the speech recognizer output is at the level of words and is statistically noisy. Specifically, we estimate the student's knowledge of 80 letter to sound mappings, such as ch making the sound /K/ in "chemistry." At a coarse level, the student model did a better job at estimating reading proficiency for 47.2% of the students than did a standardized test designed for the task. Although not quite as strong as the standardized test, our assessment method can provide a report on the student at any time during the year and requires no break from reading to administer. Our model's estimate of the student's knowledge on individual letter to sound mappings is a significant predictor of whether he will ask for help on a particular word. Thus, our student model is able to describe student performance both at a coarse- and at a fine-grain size.
Natural Conjugate Gradient on Complex Flag Manifolds for Complex Independent Subspace Analysis
Authors: Yasunori Nishimori, Shotaro Akaho, Mark D. Plumbley
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

We study the problem of complex-valued independent subspace analysis (ISA). We introduce complex flag manifolds to tackle this problem, and, based on Riemannian geometry, propose the natural conjugate gradient method on this class of manifolds. Numerical experiments demonstrate that the natural conjugate gradient method yields better convergence compared to the natural gradient geodesic search method.
Using Adaptable Design to Classify Interactions Within a Distributed Control Architecture
Authors: Christopher Dan Fletcher, Robert William Brennan, Peihua Gu
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

In this paper we apply Adaptable Design (AD) theory to the problem of fault monitoring and recovery in real-time distributed control systems. The approach draws on the close match between the functional architecture of a modular mechanical design and the functional architecture of distributed mechatronic systems and is based on the classification of interactions between the modules in these systems. The results of this work show that AD theory is applicable to fault monitoring and recovery in real-time distributed control and also has the potential for broader applications in the design of distributed mechatronic systems.
E-Commerce Security: The Categorical Role of Computers in Forensic Online Crime
Authors: Fahim Akhter
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Computer forensic technology with the encapsulation of prevention issues could protect data and information from hackers. Despite being a new field, great advancement have been made in computer crime investigation to protect information and data. Powerful evidence processing tools have been developed and there is a move towards standardization. The purpose of this paper is to generate an interest in and awareness of computer forensics by providing some basic information. This paper emphasizes the role of computers in crime and to give guidance for dealing with computers in that role. The fundamental purpose of categories discussed in this paper is to emphasize the role of computers in crime and to give guidance for dealing with computers in that role. These categories can be used to develop procedures for dealing with digital evidence and investigating crimes involving computers. These guidelines are still in their early stages, especially with regards to digital evidence.