ppxscal/embedding_network huggingface dataset:
Phero-Trail: a bio-inspired location service for mobile underwater sensor networks
Authors: Luiz Filipe M. Vieira, Uichin Lee, Mario Gerla
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

A SEA Swarm (Sensor Equipped Aquatic Swarm) moves as a group with water current and enables 4D (space and time) monitoring of local underwater events such as contaminants and intruders. For prompt alert reporting, mobile sensors forward events to mobile sinks (i.e., autonomous underwater vehicles) via geographic routing, thus requiring a location service. In this paper, we analyze various design choices to realize an efficient location service in a SEA Swarm. We find that conventional ad hoc network location service protocols cannot be directly used, because the entire swarm moves along water current. We show that maintaining location information in a 2D plane is an optimal design choice. Given this, we propose a bio-inspired location service called a Phero-Trail location service protocol. In Phero-Trail, location information is stored in a 2D upper hull of a SEA Swarm, and a mobile sink uses its trajectory (à la a pheromone trail of ants) projected to the 2D hull to maintain location information. This enables mobile sensors to efficiently locate a mobile sink via an expanding spiral curve search. Our preliminarily results show that Phero-Trail performs better than existing approaches.
XHaskell --- Adding Regular Expression Types to Haskell
Authors: Martin Sulzmann, Kenny Zhuo Lu
Venue: Implementation and Application of Functional Languages: 19th International Workshop, IFL 2007, Freiburg, Germany, September 27-29, 2007. Revised Selected Papers (2008)

We present an extension of Haskell, baptized XHaskell, which combines parametric polymorphism, algebraic data types and type classes found in Haskell with regular expression types, subtyping and regular expression pattern matching found in XDuce. Such an extension proves in particular useful for the type-safe processing of XML data. For example, we can express XQuery and XPath style features via XHaskell combinators. We have implemented the system which can be used in combination with the Glasgow Haskell Compiler.
A Note on Modular Forms on Finite Upper Half Planes
Authors: Yoshinori Hamahata
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

Finite upper half planes are finite field analogues of the Poincaré upper half plane. We introduce modular forms of new type on finite upper half planes, and consider related topics.
German Compounds in Factored Statistical Machine Translation
Authors: Sara Stymne
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

An empirical method for splitting German compounds is explored by varying it in a number of ways to investigate the consequences for factored statistical machine translation between English and German in both directions. Compound splitting is incorporated into translation in a preprocessing step, performed on training data and on German translation input. For translation into German, compounds are merged based on part-of-speech in a postprocessing step. Compound parts are marked, to separate them from ordinary words. Translation quality is improved in both translation directions and the number of untranslated words in the English output is reduced. Different versions of the splitting algorithm performs best in the two different translation directions.
XML Storage and Processing on Mobile Devices
Authors: Raymond K. Wong
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This is especially critical for devices with limited resources such as handheld computers, mobile phones or sensor networks. This presentation describes the requirements for efficiently storing and processing XML data on mobile devices. In particular, it summarizes our previous work on a compact XML storage scheme that supports all XPath navigational operations in near constant time. In addition to supporting efficient queries, the space requirement of the proposed scheme is within a constant factor of the information theoretic minimum, while insertions and deletions can be performed in near constant time as well. As a result, the proposed structure features a small memory footprint that increases cache locality, whilst still supporting standard APIs, such as DOM, and necessary database operations, such as queries and updates, efficiently. Finally, some applications using the proposed storage scheme are presented.
Cooperative caching in wireless multimedia sensor networks
Authors: Nikos Dimokas, Dimitrios Katsaros, Yannis Manolopoulos
Venue: Mobile Networks and Applications (2008)

The recent advances in miniaturization and the creation of low-power circuits, combined with small-sized batteries have made the development of wireless sensor networks a working reality. Lately, the production of cheap complementary metal-oxide semiconductor cameras and microphones, which are able to capture rich multimedia content, gave birth to what is called Wireless Multimedia Sensor Networks (WMSNs). WMSNs will boost the capabilities of current wireless sensor networks, and will fuel several novel applications, like multimedia surveillance sensor networks. WMSNs introduce several new research challenges, mainly related to mechanisms to deliver application-level Quality-of-Service (e.g., latency minimization). To address this goal in an environment with extreme resource constraints, with variable channel capacity and with requirements for multimedia in-network processing, the caching of multimedia data, exploiting the cooperation among sensor nodes is vital. This article presents a cooperative caching solution particularly suitable for WMSNs. The proposed caching solution exploits sensor nodes which reside in "positions" of the network that allow them to forward packets or communicate decisions within short latency. These so-called "mediator" nodes are selected dynamically, so as to avoid the creation of hot-spots in the communication and the depletion of their energy. The mediators are not more powerful than the rest of the nodes, but they have some special role in implementing the cooperation among the sensors. The proposed cooperative caching protocol includes components for locating cached data as well as for implementing data purging out of the sensor caches. The proposed solution is evaluated extensively in an advanced simulation environment, and it is compared to the state-of-the-art cooperative caching algorithm for mobile ad hoc networks. The results confirm that the proposed caching mechanism prevails over its competitor.
An implicit function theorem for regular fuzzy logic functions
Authors: Miguel Campercholi, Diego Vaggione
Venue: Fuzzy Sets and Systems (2008)

Regular fuzzy logic functions are the functions f:[0,1]^n->[0,1] that can be obtained by means of a finite number of compositions from a number of very simple starting functions, which are related to three-valued logic. In this work we prove that if a function f can be implicitly defined by a system of equations involving regular fuzzy logic functions, then f is itself a regular fuzzy logic function. The proof is based on results about regular Kleene algebras and Masao Mukaidono's characterization of regular logic functions.
A Surface-Based Fractal Information Dimension Method for Cortical Complexity Analysis
Authors: Yuanchao Zhang, Jiefeng Jiang, Lei Lin, Feng Shi, Yuan Zhou, Chunshui Yu, Kuncheng Li, Tianzi Jiang
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

In this paper, we proposed a new surface-based fractal information dimension (FID) method to quantify the cortical complexity. Unlike the traditional box-counting method to measure the capacity dimension, our method is a surface-based fractal information dimension method, which incorporates surface area into the probability calculation and thus encapsulates more information of the original cortical surfaces. The accuracy of the algorithm was validated via experiments on phantoms. With the proposed method, we studied the abnormalities of the cortical complexity of the early blind (EB; n=15), compared with matched controls (n=15). We found significantly increased FIDs in the left occipital lobe and decreased FIDs in the right frontal and right parietal lobe in early blind compared with controls. The results demonstrated the potential of the proposed method for identifying cortical abnormalities.
End-to-end accountability in grid computing systems for coalition information sharing
Authors: Elisa Bertino, Wonjun Lee, Anna C. Squicciarini, Bhavani Thuraisingham
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

Accountability is crucial for any computer system. It assures that every action executed in the system can be traced back to some entity. Accountability for grid computing systems is even more crucial given the very large number of users and active entities in these systems. However, so far no comprehensive approach to accountability for grid systems exists. Our work addresses such lack by developing a comprehensive accountability system driven by policies and supported by accountability agents. This paper first discusses the requirements that have driven the design of our accountability system. It then presents the key elements of our approach, namely the accountability data, the accountability policy language, and the agents.
The dynamic flow air visualization around the petrochemistry petroleum coke plant
Authors: Mihai Tãlu, Dumitru Bolcu, Stefan Tãlu, Aurelian Sipos
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

This paper focuses on the simulation and visualization of the 3D aerodynamics flow around the petrochemistry petroleum coke plant. The spatial distributions fields of the velocity, pressure and air density to the impact (collisions) with the structure of installation are given. The numerical simulations permit to simulate real conditions in order to improve accuracy and reliability of predictions. A finite element program was used for analysis and simulation. This may be used in the Computational Fluid Dynamics (CFD) process for the fast and efficient system design.
ReoService: Coordination Modeling Tool
Authors: Christian Koehler, Alexander Lazovik, Farhad Arbab
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Coordination in SOA addresses dynamic topologies of interactions among services. Most efforts up to now have been focused on statically defined composition of services, e.g., using BPEL. To the best of our knowledge, there are no serious means to address the issues of dynamic coordination to accommodate continuously changing requirements. While BPEL is a powerful standard for service composition, it lacks support for typical coordination constraints, like synchronisation, mutual exclusion, and context-dependency.
SMARTMAP: operating system support for efficient data sharing among processes on a multi-core processor
Authors: Ron Brightwell, Kevin Pedretti, Trammell Hudson
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

This paper describes SMARTMAP, an operating system technique that implements fixed offset virtual memory addressing. SMARTMAP allows the application processes on a multi-core processor to directly access each other's memory without the overhead of kernel involvement. When used to implement MPI, SMARTMAP eliminates all extraneous memory-to-memory copies imposed by UNIX-based shared memory strategies. In addition, SMARTMAP can easily support operations that UNIX-based shared memory cannot, such as direct, in-place MPI reduction operations and one-sided get/put operations. We have implemented SMARTMAP in the Catamount lightweight kernel for the Cray XT and modified MPI and Cray SHMEM libraries to use it. Micro-benchmark performance results show that SMARTMAP allows for significant improvements in latency, bandwidth, and small message rate on a quad-core processor.
Necessary Conditions for the Impulsive Time-Optimal Control of Finite-Dimensional Lagrangian Systems
Authors: Kerim Yunt
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

In this work, necessary conditions for the impulsive time-optimal control of finite-dimensional Lagrangian systems are stated. The conditions are obtained by the application sub-differential calculus techniques to extended-valued lower semi-continuous functionals. The considered functional is a generalized Bolza functional that is evaluated on multiple intervals. Contrary to the approach in literature so far, the instant of possibly impulsive transition is considered as an instant of Lebesgue measure zero. This approach is in comparison to other impulsive necessary conditions consistent with different hybrid system modeling methods in which transitions happen instantaneously. The necessary conditions provide necessary criteria for the determination of optimal transition times and locations.
Reliability of Cross-Validation for SVMs in High-Dimensional, Low Sample Size Scenarios
Authors: Sascha Klement, Amir Madany Mamlouk, Thomas Martinetz
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

A Support-Vector-Machine (SVM) learns for given 2-class-data a classifier that tries to achieve good generalisation by maximising the minimal margin between the two classes. The performance can be evaluated using cross-validation testing strategies. But in case of low sample size data, high dimensionality might lead to strong side-effects that can significantly bias the estimated performance of the classifier. On simulated data, we illustrate the effects of high dimensionality for cross-validation of both hard- and soft-margin SVMs. Based on the theoretical proofs towards infinity we derive heuristics that can be easily used to validate whether or not given data sets are subject to these constraints.
Evolving Neural Networks for Online Reinforcement Learning
Authors: Jan Hendrik Metzen, Mark Edgington, Yohannes Kassahun, Frank Kirchner
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

For many complex Reinforcement Learning problems with large and continuous state spaces, neuroevolution (the evolution of artificial neural networks) has achieved promising results. This is especially true when there is noise in sensor and/or actuator signals. These results have mainly been obtained in offline learning settings, where the training and evaluation phase of the system are separated. In contrast, in online Reinforcement Learning tasks where the actual performance of the systems during its learning phase matters, the results of neuroevolution are significantly impaired by its purely exploratory nature, meaning that it does not use (i. e. exploit) its knowledge of the performance of single individuals in order to improve its performance during learning. In this paper we describe modifications which significantly improve the online performance of the neuroevolutionary method Evolutionary Acquisition of Neural Topologies (EANT) and discuss the results obtained on two benchmark problems.
Modularity of Confluence
Authors: Vincent Oostrom
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in that it factors through the decreasing diagrams technique for abstract rewriting systems, is constructive in that it gives a construction for the converging rewrite sequences given a pair of diverging rewrite sequences, and general in that it extends to opaque constructor-sharing term rewriting systems. We show that for term rewrite systems with extra variables, confluence is not preserved under decomposition, and discuss whether for these systems confluence is preserved under composition.
Unambiguous Boolean grammars
Authors: Alexander Okhotin
Venue: Information and Computation (2008)

Boolean grammars are an extension of context-free grammars, in which conjunction and negation may be explicitly used in the rules. In this paper, the notion of ambiguity in Boolean grammars is defined. It is shown that the known transformation of a Boolean grammar to the binary normal form preserves unambiguity, and that every unambiguous Boolean language can be parsed in time O(n^2). Linear conjunctive languages are shown to be unambiguous, while the existence of languages inherently ambiguous with respect to Boolean grammars is left open.
Critical success factors for service-oriented small businesses in the e-commerce environment
Authors: Easwar Nyshadham
Venue:  (2008)

Adoption and use of ecommerce by small businesses is generally understood to be rather slow, though the reasons are unclear. In this research, the factors (called critical success factors) affecting the adoption and continued use of e-commerce technologies are studied. Three well known theoretical frameworks and views from strategy literature have traditionally provided theoretical reasons for identifying factors a small business would use to successfully employ e-commerce technologies in their organization, viz., the technology-organization-environment (TOE) framework, the chain of causality (C of C) and the resource-based view (RBV). In this study, a model called the critical success factors model, was developed to study adoption and use of e-commerce technologies by service-oriented small businesses. The model utilizes factors identified by the three established frameworks and contextualized them to small business and e-commerce. The model is empirically tested using data collected from (146) small business firms. Analyses and results suggest that the employee's computer expertise, the decision maker's ability and willingness to innovate, and the degree to which ecommerce technologies integrate with existing infrastructure significantly affect the longevity of system use. Therefore it is suggested that a manager (small business owner) planning an e-commerce system should try to be innovative in the use of e-commerce applications and technologies in their organization, hire skilled people to handle their e-commerce systems, and carefully analyze the benefits versus the costs of integrating e-commerce systems with existing infrastructure.
Identifying and Understanding Architectural Risks in Software Evolution: An Empirical Study
Authors: Odd Petter Slyngstad, Jingyue Li, Reidar Conradi, M. Ali Babar
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

Software risk management studies commonly focus on project level risks and strategies. Software architecture investigations are often concerned with the design, implementation and maintenance of the architecture. However, there has been little effort to study risk management in the context of software architecture. We have identified risks and corresponding management strategies specific to software architecture evolution as they occur in industry, from interviews with 16 Norwegian IT-professionals. The most influential (and frequent) risk was "Lack of stakeholder communication affected implementation of new and changed architectural requirements negatively". The second most frequent risk was "Poor clustering of functionality affected performance negatively". Architects focus mainly on architecture creation. However, their awareness of needed improvements in architecture evaluation and documentation is increasing. Most have no formally defined/documented architecture evaluation method, nor mention it as a mitigation strategy. Instead, problems are fixed as they occur, e.g. to obtain the missing artefacts.
Fuzzy multiattribute evaluation of R&D projects using a real options valuation model
Authors: A. Çağrı Tolga, Cengiz Kahraman
Venue: International Journal of Intelligent Systems (2008)

R&D project selection decision is very important in two ways. First, in many organizations, R&D budget represents huge investment. Project selection decisions could be thought with the strategic objectives and plans of the firm. Second, R&D projects' organizational returns are multidimensional in nature and risky in terms of projected outcome. Real options approach helps to calculate this risky side of the selection process. This paper considers that multidimensional side of the R&D project selection process. Another consideration is the vagueness in the evaluation process. The fuzzy analytic hierarchy process, which takes monetary (fuzzy real option value) and nonmonetary (capability, success probability, trends, etc.) criteria into account, is used to make this selection among alternative R&D projects. A real case study is given to illustrate the application of the proposed approach. &copy; 2008 Wiley Periodicals, Inc.
A Conceptual Graph Description of Medical Data for Brain Tumour Classification
Authors: Madalina Croitoru, Bo Hu, Srinandan Dashmapatra, Paul Lewis, David Dupplaw, Liang Xiao
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

HealthAgents proposes an agent-based distributed decision support system for brain tumour diagnosis and prognosis which employs Magnetic Resonance Imaging and Magnetic Resonance Spectroscopy techniques and genomic profiles. From a knowledge representation view point the distributed nature and the heterogeneity of the data to be integrated pose a number of challenging problems. This paper shows how Conceptual Graphs can be employed to describe the data sources in the HealthAgents system. Such knowledge representation based description of data allows for reasoning power when querying and for data modularisation capabilities.
Fragmentation and Frontier Evolution for Genetic Algorithms Optimization in Music Transcription
Authors: Nuno Fonseca, Ana Paula Rocha
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

Although traditional approaches in evolutionary computation encode each individual to represent the entire problem, the idea that an individual could be used to represent only part of it, is not new. Several different approaches exist that are based on decomposing the problem in smaller blocks/fragments, but the act of fragmentation can in some cases create unresolved issues, particularly on the fragments frontiers. This paper presents a method for optimizing some genetic algorithms applications, by fragment the problem in smaller ones, but keeping attention to frontier issues. While this paper focus on the application of the method to the music transcription problem, the proposed approach can be used on many other scenarios (signal processing, image analysis, etc.).
Data modeling at conceptual level: object-role modeling (ORM)
Authors: Daniel Ioan Hunyadi, Mircea Adrian Musan
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

This paper provides an overview of Object-Role Modeling (ORM), a fact-oriented method for performing information analysis at the conceptual level. It provides both a graphical and textual languages and a procedure which guides the use of the languages. The article is structured in two main parts. The first part presents an overview of ORM along a real example, while the second part of the article makes a comparison between ORM and UML from the conceptual data modeling perspective.