ppxscal/embedding_network huggingface dataset:
Spartan gaussian random fields for geostatistical applications: Non-constrained simulations on square lattices and irregular grids
Authors: Dionissios T. Hristopulos
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

Spartan spatial random fields (SSRF's) are special cases of Gibbs random fields designed for simulating processes with correlated spatial variability. The SSRF's possess a probability distribution that is determined from "interactions" motivated from physical or geometric constraints, as opposed to data-oriented covariance measures. The interactions involve a frugal set of model parameters, which can be estimated from the data at small computational cost. Potential applications of SSRF's include the interpolation and simulation of environmental, health, and geophysical data sets, as well image compression. In this paper we develop methods for simulating Spartan fields without constraints on regular lattices and irregular grids in two space dimensions. We focus on the FGC Spartan model that includes fluctuations of a scalar field, its gradient and its curvature, according to a Gaussian energy functional. The methods described can be extended to more general SSRF models with Gaussian fluctuations.
Structured channel estimation methods for cooperative underwater communication
Authors: Nicholas Richard, Urbashi Mitra
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

This paper examines structured methods to perform channel estimation for cooperative underwater acoustic communication networks. A simplified channel model based on a geometric ray-tracing model is proposed. For this new model, an iterative structured channel estimation method is developed. The optimal training sequence for the method is determined. The proposed method exploits the sparse nature of underwater acoustic channels and inter-channel relationships, providing performance improvements over unstructured methods in the modest to low SNR region and robustness above that of structured single channel estimators. The efficacy of the proposed method is evaluated via simulations and compared to Cramer-Rao bounds.
Genetic Programming for Predicting Protein Networks
Authors: Beatriz Garcia, Ricardo Aler, Agapito Ledezma, Araceli Sanchis
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

One of the definitely unsolved main problems in molecular biology is the protein-protein functional association prediction problem. Genetic Programming (GP) is applied to this domain. GP evolves an expression, equivalent to a binary classifier, which predicts if a given pair of proteins interacts. We take advantages of GP flexibility, particularly, the possibility of defining new operations. In this paper, the missing values problem benefits from the definition of if-unknown, a new operation which is more appropriate to the domain data semantics. Besides, in order to improve the solution size and the computational time, we use the Tarpeian method which controls the bloat effect of GP. According to the obtained results, we have verified the feasibility of using GP in this domain, and the enhancement in the search efficiency and interpretability of solutions due to the Tarpeian method.
Some Recent Results in Metric Temporal Logic
Authors: Joël Ouaknine, James Worrell
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model checking problems for fragments of MTL with respect to different semantic models. We show that these fragments have widely differing complexities: from polynomial space to non-primitive recursive and even undecidable. However we show that the most commonly occurring real-time properties, such as invariance and bounded response, can be expressed in fragments of MTL for which model checking, if not satisfiability, can be decided in polynomial or exponential space.
Interoperability between Heterogeneous Federation Architectures: Illustration with SAML and WS-Federation
Authors: Mikaël Ates, Christophe Gravier, Jeremy Lardon, Jacques Fayolle, Bruno Sauviac
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Digital identity management intra and inter information systems, and, service oriented architectures, are the roots of identity federation. This kind of security architectures aims at enabling information system interoperability. Existing architectures, however, do not consider interoperability of heterogeneous federation architectures, which rely on different federation protocols.In this paper, we try to initiate an in-depth reflection on this issue, through the comparison of two main federation architecture specifications: SAML and WS-Federation. We firstly propose an overall outline of identity federation. We furthermore address the issue of interoperability for federation architectures using a different federation protocol. Afterwards, we compare SAML and WS-Federation. Eventually, we define the ways of convergence, and therefore, of interoperability.
How the SAGE Development Began
Authors: George E. Valley,  Jr.
Venue: IEEE Annals of the History of Computing (1985)

Events leading to the adoption of voice telephone lines for air-defense operational messages are described. This process paved the way for the use of operational data lines in the SAGE (Semi-Automatic Ground Environment) system. The paper describes the early considerations leading to the use of a digital computer in SAGE, and how Whirlwind was chosen to be that computer. The context of the development of magnetic core memory is illuminated. The attitudes of engineering professionals toward digital equipment are reviewed. The author reveals how the name "Ground Environment" was created.
Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit Flattening
Authors: Ralph Matthes
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

Nested datatypes are families of datatypes that are indexed over all types such that the constructors may relate different family members. Moreover, the argument types of the constructors refer to indices given by expressions where the family name may occur. Especially in this case of true nesting, there is no direct support by theorem provers to guarantee termination of functions that traverse these data structures.A joint article with A. Abel and T. Uustalu (TCS 333(1---2), pp. 3---66, 2005) proposes iteration schemes that guarantee termination not by structural requirements but just by polymorphic typing. They are generic in the sense that no specific syntactic form of the underlying datatype "functor" is required. In subsequent work (accepted for the Journal of Functional Programming), the author introduced an induction principle for the verification of programs obtained from Mendler-style iteration of rank 2, which is one of those schemes, and justified it in the Calculus of Inductive Constructions through an implementation in the theorem prover Coq.The new contribution is an extension of this work to generalized Mendler iteration (introduced in Abel et al, cited above), leading to a map fusion theorem for the obtained iterative functions. The results and their implementation in Coq are used for a case study on a representation of untyped lambda calculus with explicit flattening. Substitution is proven to fulfill two of the three monad laws, the third only for "hereditarily canonical" terms, but this is rectified by a relativisation of the whole construction to those terms.
Leverage competencies: what financial executives need to lead, First edition
Authors: Frederick Militello, Michael Schwalberg
Venue:  (2002)

Financial leaders can no longer succeed on financial skills alone: "soft" leadership skills are now crucial to success. Leverage Competencies shows how eight great companies are helping their financial managers become outstanding business leaders. Discover how these companies are promoting creativity, adaptability, communications, teamwork, strategic vision, innovation, entrepreneurial drive, and core corporate values - and how you can make it happen in your organization.
Timcogs: An Educational, Computer Graphics Timber-Marking Simulator
Authors: Jeffrey Welty, John Moser, Michael Bailey
Venue: IEEE Computer Graphics and Applications (1985)

Visualizing complex timber-marking and tree-growth concepts gives forestry students new insights into the problems, confidence in practical techniques, and invaluable experience.
HERON: a zournas digital virtual musical instrument
Authors: Panagiotis Tzevelekos, Anastasia Georgaki, Georgios Kouroupetroglou
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

The Virtual Zournas, a digital Virtual Musical Instrument (VMI) developed under the project HERON, following a physical modeling approach, is presented, along with a classification scheme of real double-reed woodwind zournas and their characteristic acoustic analysis. Use-case scenarios of VMI zournas are also given regarding different user groups, including composers, performers, music teachers and musical instrument craftsmen. Aesthetical issues, limitations of the current version and thoughts on the anthropological and technological character of such tools are also discussed.
Support Vector Machines, Data Reduction, and Approximate Kernel Matrices
Authors: Xuanlong Nguyen, Ling Huang, Anthony D. Joseph
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

The computational and/or communication constraints associated with processing large-scale data sets using support vector machines (SVM) in contexts such as distributed networking systems are often prohibitively high, resulting in practitioners of SVM learning algorithms having to apply the algorithm on approximate versions of the kernel matrix induced by a certain degree of data reduction. In this paper, we study the tradeoffs between data reduction and the loss in an algorithm's classification performance. We introduce and analyze a consistent estimator of the SVM's achieved classification error, and then derive approximate upper bounds on the perturbation on our estimator. The bound is shown to be empirically tight in a wide range of domains, making it practical for the practitioner to determine the amount of data reduction given a permissible loss in the classification performance.
Differences between Operator Reactions on Positions of Visual Feedback of Haptic Stimuli, in a Crossed or Uncrossed Position of Laparoscopic Tools
Authors: Eleonora P. Westebring-Van Der Putten, Sandra Bedaf, Monique Winters, Richard H. Goossens
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

At present Laparoscopic surgeries are performed regularly. In practice, no augmented feedback on pinch force is currently available. However,research has proven this to be useful. This research explored the location of a visual feedback signal on pinch force. The reaction time and amount of errors of two different positions of a feedback signal was studied. Firstly, the feedback signal was placed next to the endoscopic view and secondly, it was placed near the tips. Each experiment contained a crossed and an uncrossed tool configuration and was performed with and without view of the tips. It was expected that in the crossed tool conditions problems could occurred as a result of the (non) existence of spatial compatibility between feedback stimulus and response goal. Based on reaction time, it can be concluded that the best position for a visual feedback signal on pinch forces is on top of the instrument tip.
Pattern Matching in DCA Coded Text
Authors: Jan Lahoda, Bořivoj Melichar, Jan Žd'árek
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

A new algorithm searching all occurrences of a regular expression pattern in a text is presented. It uses only the text that has been compressed by the text compression using antidictionaries without its decompression. The proposed algorithm runs in ${\mathcal O}(2^m\cdot||{\rm AD}||^2+n_c+r)$ worst case time, where m is the length of the pattern, AD is the antidictionary, n C is the length of the coded text and r is the number of found matches.
Location Management Cost Estimation for PCS Using Neural Network
Authors: Demin Li, Jie Zhou, Jiacun Wang, Guoliang Wei
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

The fluid-flow model is suitable for vehicle traffic on highways but not for pedestrian movements at variable velocities. Considering the change of a mobile's velocity within a short time is limited due to physical restrictions, therefore a mobile user's future velocity is likely to be correlated with its past and current velocity. Since Gauss-Markov model captures the essence of the correlation of a mobile's velocity in time, we propose a Gauss-Markov process based fluid model that it is suitable for both vehicle traffic on highways and pedestrian in street, and presents the total cost estimation of location management for the Gauss-Markov process based fluid model.Considering the importance of memory level in the Gauss-Markov model, we estimate the parameter using neural network. Considering the measurements of updating and paging cost is not consecutive but contain missing observations, we propose the methods of location management total cost estimation with missing measurement for PCS, and utilize the Kalman filter to deduce the steady covariance of the estimation error of total cost per unit time. A numerical example is given to illustrate the use of the proposed approach.
Pervasive awareness applications: aesthetic and ludic aspects
Authors: Monica Divitini, Irene Mavrommati
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

This paper presents a workshop organized in conjunction with DIMEA2008 with focus on ludic and aesthetic aspects of Pervasive Awareness Systems. The workshop aims at bringing together different perspectives on the topic and challenge mainstream assumptions underlying the design of these systems. The workshop combines presentations and hands-on activities with the aim to promote interactivity and creativity.
Annotations: A Way to Interoperability in DL
Authors: Maristella Agosti, Nicola Ferro
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

This paper discusses how annotations and interoperability relate together and affect each other in digital library settings. We analyse interoperability and annotations in the light of the evolution of the field of digital libraries and provide recommendations for successful interoperable annotations towards the European Digital Library.
Prioritisation, Resources and Search Terms: A Study of Decision-Making at the Virtual Reference Desk
Authors: Simon Attfield, Stephann Makri, James Kalbach, Ann Blandford, Stephen Gabrielle, Mark Edwards
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

The reinterpretation of the traditional reference service in an online context is the virtual reference desk. Placing reference services into an online setting, however, presents many challenges. We report a study and analytic framework which addresses support for decision-making during virtual enquiry work. Focusing on specialist law-libraries, the study shows that enquirers do not volunteer important information to the service and that asynchronous communication media and some social obstacles present barriers to prompting. Also, previous enquiries are frequently used to inform current enquiry strategies but barriers exist in accessing this information. We conclude that email is an inadequate medium for supporting virtual reference services, and that system should support automatic, speculative matching between new enquiry content and integrated enquiry knowledge bases. The contribution of the framework is to offer a structured approach to evaluation in multiple virtual reference contexts and enable rapid convergence on barriers to efficient and effective service.
An Extension of SPARQL for RDFS
Authors: Marcelo Arenas, Claudio Gutierrez, Jorge Pérez
Venue: Semantic Web, Ontologies and Databases: VLDB Workshop, SWDB-ODBIS 2007, Vienna, Austria, September 24, 2007, Revised Selected Papers (2008)

RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet consensus in the Semantic Web community on how to define a query language for RDFS. In this paper, we introduce a language for querying RDFS data. This language is obtained by extending SPARQL with nested regular expressions that allow to navigate through an RDF graph with RDFS vocabulary. This language is expressive enough to answer SPARQL queries involving RDFS vocabulary, by directly traversing the input graph.
Plenary lecture II: chaotic cryptosystems
Authors: Alaa Fahmy
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

One-dimensional chaotic maps have been used to construct private-key block/stream cryptosystem with or without error propagation property. The constructed cryptosystem is based on the main features of one-dimensional chaotic maps, mainly the sensitive dependence on initial conditions and the unpredictability of chaos. The ciphertext is obtained by iterating the inverse map with an initial condition, which represents the plaintext. The number of iterations N are determined by the plaintext's accuracy digits p, i.e.,. N=p/log102 iterations. At that point, all information about the initial condition is lost. A proposed private-key stream cryptosystem, based on logistic map, has been introduced. Moreover, two-dimensional chaotic map has been used for compression as well as encryption. Various techniques for the construction of the Message Authentication Code (MAC) have been presented. The methods for resolving the problem of disputes have been discussed. A new signature scheme, based on chaotic map, has been presented. This signature scheme allows any receiver to recognise the sender's signature but not to forge it. The signature cannot be verified without cooperation of the signer.
Wireless sensor network deployment for water use efficiency in irrigation
Authors: John McCulloch, Paul McCarthy, Siddeswara Mayura Guru, Wei Peng, Daniel Hugo, Andrew Terhorst
Venue: Proceedings of the workshop on Real-world wireless sensor networks (2008)

Australia is facing a severe water shortage due to below-average rainfall received over the past decade. The agricultural industry is significantly affected by this shortage due to its high water demands. It is important to adopt changes in agricultural practices and employ innovative ideas for the agricultural industry to maintain its current rate of production. Sensor technology can be used to study soil dynamics based on information gathered at regular intervals, and the data collected can be used as feedback to improve irrigation efficiency. In this paper, we describe our experiences in the design, development and deployment of a wireless sensor network to improve water use efficiency for pasture production. Sensor nodes, called sensor pods, were developed using off the shelf components. The design of the sensor pod was a challenging task as the installation has to withstand seasonal weather changes, and be resistant to damages that may be inflicted by cattle in the field. Each sensor pod measures soil moisture, temperature and humidity. Granular matrix sensors are used to measure soil moisture at three different ground depths. Temperature and humidity are measured using the Tmote Sky's on-board sensors. 70 sensor pods were deployed at the TIAR (Tasmanian Institute for Agricultural Research) Elliott Research Farm near Burnie, in the North West of Tasmania, Australia, at the end of December 2007. Preliminary results are now available. The data gathered will be used to develop efficient data evaluation techniques so that irrigation regimes can be automated. This will lead to precision agricultural techniques involving the close monitoring of the field state, and the use of real time data to drive more efficient irrigation practices.
Ontology-based context synchronization for ad hoc social collaborations
Authors: Jason J. Jung
Venue: Knowledge-Based Systems (2008)

To efficiently support collaborations between people (agents) in real-time, we propose an ontology-based platform for acquainting the most relevant users (e.g., colleagues and classmates), according to their context. Thereby, we modeled two kinds of contexts with semantic information derived from ontologies; (i) personal context, and (ii) consensual context, integrated from several personal contexts. More importantly, we formulate measurement criteria to compare them. Consequently, groups can be dynamically organized with respect to the similarities among several aspects of personal context. In particular, users can engage in complex collaborations related to multiple semantics. For experimentation, we implemented a social browsing system based on context synchronization.
A Framework for Learning in Humanoid Simulated Robots
Authors: Esther Luna Colombini, Alexandre Silva Simöes, Antônio Cesar Martins, Jackson Paul Matsuura
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

One of the most important characteristics of intelligent activity is the ability to change behaviour according to many forms of feedback. Through learning an agent can interact with its environment to improve its performance over time. However, most of the techniques known that involves learning are time expensive, i.e., once the agent is supposed to learn over time by experimentation, the task has to be executed many times. Hence, high fidelity simulators can save a lot of time. In this context, this paper describes the framework designed to allow a team of real RoboNova-I humanoids robots to be simulated under USARSim environment. Details about the complete process of modeling and programming the robot are given, as well as the learning methodology proposed to improve robot's performance. Due to the use of a high fidelity model, the learning algorithms can be widely explored in simulation before adapted to real robots.