ppxscal/embedding_network huggingface dataset:
Expanding the search for digital preservation solutions: adopting PREMIS in cultural heritage institutions
Authors: Daniel Gelaw Alemneh
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This paper will present some preliminary result on factors that affect the adoption of PREMIS (Preservation Metadata Implementation Strategies) in cultural heritage institutions. The study employed a web-based survey to collect data from 123 participants in 20 countries as well as a semi-structured, follow-up telephone interview with a smaller sample of the survey respondents. Roger's diffusion of innovation theory was used as a theoretical framework. The main constructs considered for the study were relative advantage, compatibility, complexity, trialability, observability, and institution readiness. The study yielded both qualitative and quantitative data, and preliminary analysis showed that all six factors influence the adoption of PREMIS in varying degrees.
IGTASC: a model for institution-governed trusted and autonomic service cooperation
Authors: Ji Gao, Hexin Lv
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Because of the inherent non-controllability of business services across different management domains, constructing virtual organizations, by creating service cooperation in Internet computing environment, has been confronted with the challenge of so-called "trust" crisis that the success and benefit of cooperation cannot be ensured. Thereby, this paper proposes a model for Institution-Governed Trusted and Autonomic Service Cooperation, called IGTASC, in order to conquer this crisis.
Successive iteration and positive solutions for a second-order multi-point boundary value problem on a half-line
Authors: Xingqiu Zhang
Venue: Computers Mathematics with Applications (2009)

This paper deals with the existence of positive solutions for some second-order multi-point boundary value problem on the half-line. Our approach is based on the fixed point theorem and the monotone iterative technique. Without the assumption of the existence of lower and upper solutions, we obtain not only the existence of positive solutions for the problems, but also establish iterative schemes for approximating the solutions.
Elastic management of cluster-based services in the cloud
Authors: Rafael Moreno-Vozmediano, Ruben S. Montero, Ignacio M. Llorente
Venue: Proceedings of the 1st workshop on Automated control for datacenters and clouds (2009)

In this paper we analyze the deployment of generic clustered services on top of a virtualized infrastructure layer that combines a VM manager (the OpenNebula engine) and a cloud resource provider (Amazon EC2). The use of this virtualization layer between the service and the physical infrastructure extends the classical benefits of VM platforms to distributed infrastructures. Additionally, the integration of the cloud in this layer allows us to give additional capacity to the services using an external provider, thus complementing the local infrastructure without notice from the users or affecting the service workload. This flexible approach, which separates the resource provisioning from the service management, provides important benefits: elastic service capacity to adapt it to its dynamic workload; physical infrastructure partitioning to isolate it from other running services; and support for heterogeneous configurations tailored for each service class. The feasibility of the proposed approach is analyzed for two different clustered services: a classical computing cluster and a web server.
Topology Design for Service Overlay Networks with Economic and QoS Constraints
Authors: Davide Adami, Christian Callegari, Stefano Giordano, Michele Pagano, Teresa Pepe
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

Service Overlay Networks (SON) have emerged as an efficient way to provide end-to-end Quality of Service (QoS) support in the Internet, as required by real-time services.The deployment of a SON is a capital-intensive investment. Thus, minimizing the economic cost is one of the key objectives for the SON operator. Moreover, end-to-end performance must be enhanced, so as to provide innovative value-added services. This paper, addresses the problem of cost and performance optimization of a SON. More specifically, we propose a set of algorithms for the selection of a SON topology, which minimizes the economic cost while taking also into account performance constraints.
Symmetries of 2-D Images: Cases without Periodic Translations
Authors: Lewis D. Griffin
Venue: Journal of Mathematical Imaging and Vision (2009)

The different ways in which images, defined as scalar functions of the Euclidean plane, can be symmetrical is considered. The symmetries analyzed are relative to the class of image isometries, each of which is a combined spatial and intensity isometry. All symmetry types, apart from those with discrete periodic translations, are derived. Fifteen such types are found, including one that has not previously been reported. The novel type occurs when an image has a continuous line of centres of symmetry each like the one found in the Taiji (Yin-Yang) symbol.
Towards privacy preserving data reconciliation for criminal justice chains
Authors: Sunil Choenni, Jan van Dijk
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

In many organizations different databases contain different kind of data concerning the same entity. This may have several good reasons. However, to have an integral and unified view of an entity, data reconciliation is of crucial importance. In this paper, we present an approach for data reconciliation that is based on available schemata of data sources and the content of the sources. The different schemata of data sources are used to determine what parts of the schemata pertain to the same entity type. The content of the sources is used to determine the association between different attributes stored in different sources. In establishing the relationships between different attributes, we have exploited the knowledge of domain experts as well. On the basis of the collected information with regard to a set of attributes, we assign a similarity measure to these attributes. Once we have identified the set of attributes that is similar, we reconcile two entities on the basis of the similarity measure. We illustrate the effectiveness of our approach by means of a real-life case in the field of police and justice.
Hoeffding and Bernstein races for selecting policies in evolutionary direct policy search
Authors: Verena Heidrich-Meisner, Christian Igel
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Uncertainty arises in reinforcement learning from various sources, and therefore it is necessary to consider statistics based on several roll-outs for evaluating behavioral policies. We add an adaptive uncertainty handling based on Hoeffding and empirical Bernstein races to the CMA-ES, a variable metric evolution strategy proposed for direct policy search. The uncertainty handling adjusts individually the number of episodes considered for the evaluation of a policy. The performance estimation is kept just accurate enough for a sufficiently good ranking of candidate policies, which is in turn sufficient for the CMA-ES to find better solutions. This increases the learning speed as well as the robustness of the algorithm.
3D motion data analysis and visualisation for technology-enhanced learning and heritage preservation
Authors: Kia Ng
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

This paper discusses interactive multimedia framework and tools that have been developed under the i-Maestro EC IST project (www.i-maestro.org) for technology-enhanced music education, and focuses on one of the applications which explores 3D motion capture data for real-time analysis and feedback to support the learning processes. The multi-modal data (3D motion, sensor, audio and video) captured with the system offers a more complete and more detailed description of a musical performance. Another project, CASPAR (Cultural, Artistic and Scientific knowledge for Preservation, Access and Retrieval - www.casparpreserves.eu) which is developing a framework for digital preservation uses the multi-modal data for the contemporary arts ?est-bed in order to offer musicologist of the future a better records and description of the playing style and interpretation that may not be easily extracted/understood from a video recording.
Using artificial reaction force to design compliant mechanism with multiple equality displacement constraints
Authors: Zhenyu Liu, Jan G. Korvink
Venue: Finite Elements in Analysis and Design (2009)

Monolithic compliant mechanisms are elastic workpieces which transmit force and displacement from an input position to an output position. Continuum topology optimization is suitable to generate the optimized topology, shape and size of such compliant mechanisms. The optimization strategy for a single input single output compliant mechanism under volume constraint is known to be best implemented using an optimality criteria or similar mathematical programming method. In this standard form, the method appears unsuitable for the design of compliant mechanisms which are subject to multiple outputs and multiple constraints. Therefore an optimization model that is subject to multiple design constraints is required. With regard to the design problem of compliant mechanisms subject to multiple equality displacement constraints and an area constraint, we here present a unified sensitivity analysis procedure based on artificial reaction forces, in which the key idea is built upon the Lagrange multiplier method. Because the resultant sensitivity expression obtained by this procedure already compromises the effects of all the equality displacement constraints, a simple optimization method, such as the optimality criteria method, can then be used to implement an area constraint. Mesh adaptation and anisotropic filtering method are used to obtain clearly defined monolithic compliant mechanisms without obvious hinges. Numerical examples in 2D and 3D based on linear small deformation analysis are presented to illustrate the success of the method.
Surveying the complementary role of automatic data analysis and visualization in knowledge discovery
Authors: Enrico Bertini, Denis Lalanne
Venue: Proceedings of the ACM SIGKDD Workshop on Visual Analytics and Knowledge Discovery: Integrating Automated Analysis with Interactive Exploration (2009)

The aim of this work is to survey and reflect on the various ways to integrate visualization and data mining techniques toward a mixed-initiative knowledge discovery taking the best of human and machine capabilities. Following a bottom-up bibliographic research approach, the article categorizes the observed techniques in classes, highlighting current trends, gaps, and potential future directions for research. In particular it looks at strengths and weaknesses of information visualization and data mining, and for which purposes researchers in infovis use data mining techniques and reversely how researchers in data mining employ infovis techniques. The article further uses this information to analyze the discovery process by comparing the analysis steps from the perspective of information visualization and data mining. The comparison permits to bring to light new perspectives on how mining and visualization can best employ human and machine skills.
The XTREEM Methods for Ontology Learning from Web Documents
Authors: Marko Brunzel
Venue: Proceeding of the 2008 conference on Ontology Learning and Population: Bridging the Gap between Text and Knowledge (2008)

Ontology Learning is up to now dominated by techniques which use text as input. There are only few methods which use a different data source. The techniques which use highly structured data as input have the disadvantage that such data sources are rare. On the other side, there are enormous amounts of Web content present today. We present the XTREEM (Xhtml TREE Mining) methods which enable Ontology Learning from Web Documents. Those methods rely on the semi-structure of Web Documents. The added value of Web document markup is exploited by the XTREEM methods. We show methods for the acquisition of terms, synonyms and semantic relations. The XTREEM techniques are based on the structure of Web documents; they are domain and language independent. There is no need for NLP software nor for training. They do not rely on domain or document collection specific resources or background knowledge, such as patterns, rules or other heuristics; nor do they rely on manually assembling a document collection.
Using Satellite Resources for Scientific Inquiry
Authors: Beaumie Kim, Manetta Calinger, Debbie Denise Reese
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

NASA Learning Technologies is a development effort to create learning tools that provide access to NASA content and data in an engaging and dynamic manner. The present study is the initiation of the design research for one of those developed tools, which provides access to the satellite imagery and scientific visualizations on a 3D globe. NASA education's challenge is not the incorporation of authentic high-tech resources. Rather, it is the preparation for educational use with well-defined science topics. The results of this study suggest that using this tool within a motivating context and an appropriate learning activity could provide positive impacts on science understanding and learning experiences.
Improved genetic algorithm for optimal design of fuzzy classifier
Authors: P. Ganesh Kumar, D. Devaraj
Venue: International Journal of Computer Applications in Technology (2009)

One of the important issues in the design of fuzzy classifier is the formation of fuzzy if-then rules and the membership functions. This paper presents a Genetic Algorithm (GA) approach to obtain the optimal rule-set and the membership function. To develop the fuzzy system the membership functions and rule-set are encoded into the chromosome and evolved simultaneously using GA. Advanced genetic operators are applied to improve the performance of the GA in designing the fuzzy classifier. The performance of the proposed approach is demonstrated through development of fuzzy classifier for Iris, Wine and tcpdump data. From the simulation study, it is found that the improved GA produces a fuzzy classifier which has minimum number of rules and high classification accuracy. Statistical analysis of the test results shows the superiority of the proposed algorithm over the existing methods.
Modelling of Voltri terminal Europe in Genoa using system dynamic model simulation
Authors: R. Revetria, F. Oliva, M. Mosca
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

The Voltri Terminal Europe is one of the more important terminal of the Mediterranean Sea, having a strategic position in Europe and a good operational efficiency. The terminal has been modelled using Systems Dynamics in order to provide a way of integrating ERP and Data Mining into a Decision Cockpit.
Social Responsibility among deliberative agents
Authors: Paolo Turrini, Mario Paolucci, Rosaria Conte
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

In this paper we aim at giving a formal characterization of the notion of responsibility in multi-agent systems. A clearer view of responsibility is critical for regulating multiagent settings: to understand what kinds of responsibility are at stake in a given scenario can help predict system's future behaviour and improve its efficiency. However, although attempts of formal theories of responsibility are increasing, they usually reduce it to causation, while we underline the importance of a theory of responsibility before a damage could ever take place. We propose an objective notion of responsibility, grounded upon cognitive, social, and material powers. In turn, aversive power-essential to account for antehoc responsibility-will be based on social damage, seen as reduction of one's power. Furthermore, the multiagent dimension of the phenomenon will be addressed: shared versus collective responsibility will be distinguished. We will apply a modification of the ATEL --R* language (Alternating Time Epistemic Logic with Recall), dealing with goals and past history in order to characterize all the necessary ingredients (goals, ability, powers, awareness of strategies, damage) of multiagent responsibility in several scenarios. System validities will be given and discussed, and a brief discussion of results together with ideas for future work will conclude the paper.
Generation and recognition of digital planes using multi-dimensional continued fractions
Authors: Thomas Fernique
Venue: Pattern Recognition (2009)

This paper extends, in a multi-dimensional framework, pattern recognition techniques for generation or recognition of digital lines. More precisely, we show how the connection between chain codes of digital lines and continued fractions can be generalized by a connection between tilings and multi-dimensional continued fractions. This leads to a new approach for generating and recognizing digital hyperplanes.
Technical Section: Discrete Laplace-Beltrami operators for shape analysis and segmentation
Authors: Martin Reuter, Silvia Biasotti, Daniela Giorgi, Giuseppe Patanè, Michela Spagnuolo
Venue: Computers and Graphics (2009)

Shape analysis plays a pivotal role in a large number of applications, ranging from traditional geometry processing to more recent 3D content management. In this scenario, spectral methods are extremely promising as they provide a natural library of tools for shape analysis, intrinsically defined by the shape itself. In particular, the eigenfunctions of the Laplace-Beltrami operator yield a set of real-valued functions that provide interesting insights in the structure and morphology of the shape. In this paper, we first analyze different discretizations of the Laplace-Beltrami operator (geometric Laplacians, linear and cubic FEM operators) in terms of the correctness of their eigenfunctions with respect to the continuous case. We then present the family of segmentations induced by the nodal sets of the eigenfunctions, discussing its meaningfulness for shape understanding.
Transport-diffusion models with nonlinear boundary conditions and solution by generalized collocation methods
Authors: E. De Angelis, R. Revelli, L. Ridolfi
Venue: Computers Mathematics with Applications (2009)

This paper deals with the derivation of a class of nonlinear transport and diffusion models implemented with nonlinear boundary conditions. Mathematical tools to treat the initial-boundary value problems are developed, based on generalized collocation methods, focused on the treatment of nonlinear boundary conditions in one space dimension. Applications refer to a problem of interest in applied sciences.
Data mining model for atmospheric pollutants from elevated point sources
Authors: Fayez Gebali, M. F. Yassin
Venue: Proceedings of the 2009 conference on Information Science, Technology and Applications (2009)

We discuss here a datacube model for pollutant dispersion form an elevated point source in the presence of wind gusts. The value of interest is flux of pollutant deposition versus several attributes such as pollutant type, location, geographical scale, etc. The model takes into account random variations in wind speed and instrumentation noise. We consider the case of a neutrally buoyant plume emitted from an elevated point source in a turbulent boundary layer. The results show that wind turbulence is an important factor in the dispersion plume distribution and leads to spreading the distribution due to wind mixing.
Completely mechanical quick changeable joints for multipurpose explosive ordnance disposal robots
Authors: E. faruk Kececi
Venue: Robotica (2009)

This paper is an investigation of completely mechanical quick changeable joints for multipurpose explosive ordnance disposal (EOD) robots. With the assistance of a quick changeable joint, an ordinary EOD robot becomes a multipurpose robot with an end effector which can be switched during the task. This exchangeable end effector permits the robot to perform more complex duties. Making the joint completely mechanical increases its capacity and decreases its complexity of control and risk of failure. In this paper, the design, manufacturing, and testing stages are explained for four quick changeable joints each possessing different physical working principles. The test results reveal the best design for a multipurpose EOD robot and give ideas for other uses of quick changeable joints. Employing the quick changeable joints in other mobile robot applications can increase a robot's capacity and efficiency.
Limits to the Autonomy of Agents
Authors: Merel Noorman
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

The concept of autonomous artificial agents has become a pervasive feature in computing literature. The suggestion that these artificial agents will move increasingly closer to humans in terms of their autonomy has reignited debates about the extent to which computers can or should be considered autonomous moral agents. This article takes a closer look at the concept of autonomy and proposes to conceive of autonomy as a context-dependent notion that is instrumental in understanding, describing and organizing the world. Based on the analysis of two distinct conceptions of autonomy, the argument is made that the limits to the autonomy of artificial agents are multiple and flexible dependent on the conceptual frameworks and social contexts in which the concept acquires meaning. A levelling of humans and technologies in terms of their autonomy is therefore not an inevitable consequence of the development of increasingly intelligent autonomous technologies, but a result of normative choices.
Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming
Authors: Sylvain Mouret, Ignacio E. Grossmann, Pierre Pestiaux
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

This paper aims at solving a nonconvex mixed integer nonlinear programming (MINLP) model used to solve a refinery crude-oil operations scheduling problem. The model is mostly linear but contains bilinear products of continuous variables in the objective function. It is possible to define a linear relaxation of the model leading to a weak bound on the objective value of the optimal solution. A typical method to circumvent this issue is to discretize the continuous space and to use linear relaxation constraints based on variables lower and upper bounds (e.g. McCormick convex envelopes) on each subdivision of the continuous space. This work explores another approach involving constraint programming (CP). The idea is to use an additional CP model which is used to tighten the bounds of the continuous variables involved in bilinear terms and then generate cuts based on McCormick convex envelopes. These cuts are then added to the mixed integer linear program (MILP) during the search leading to a tighter linear relaxation of the MINLP. Results show large reductions of the optimality gap of a two step MILP-NLP solution method due to the tighter linear relaxation obtained.