ppxscal/embedding_network huggingface dataset:
Maintaining materialized xpath views over dynamic xml data
Authors: Divyakant Agrawal, Amr El Abbadi
Venue:  (2008)

Materializing views (query results) is a longtime tradition in data management systems. Materialized views are typically used to answer new queries more efficiently than answering them using the base data. When the base data is updated, the materialized views may become inconsistent with it. Maintaining such views is the process of refreshing them according to the base updates. Efficiency and scalability requirements typically mandate that this process be done incrementally rather than by full re-computation. This dissertation addresses the problem of incrementally maintaining views specified using XPath queries over dynamic XML base data. We identify two main scenarios of the problem, and provide solutions for them. The two scenarios are distinguished based on the degree of coupling between the base data system and the view system. If the systems are tightly coupled, then they can exchange non-standard forms of information&mdash;e.g. intermediate query results and internal node identifiers&mdash;which is specifically customized to support the maintenance process. On the other hand, if the systems are loosely coupled, then they can only exchange standard forms of information, e.g. standard XPath queries and their standard XML results. The tight-coupling scenario typically occurs when the base data system itself materializes some views&mdash;transparent to its clients&mdash;to improve the query performance. In this case, the base system and the view system are actually the same. The loose-coupling scenario is typical in the context of SOA (Service Oriented Architecture) systems, e.g. data-centric web services. Our solution for this scenario comprises two main steps: (1) The base system publishes standard XML updates, (2) Each client (view system) uses the published updates to refresh its views. This solution can be viewed as an XML syndication scheme which generalizes the idea of modern web syndication schemes, such as RSS (Really Simple Syndication). Many Data-centric web services use efficient back-end relational databases, while interfacing the outside world through standard XML front-ends. In this case, the publishing step of the syndication scheme requires publishing standard XML updates from relational SQL updates. We discuss a solution for this problem using triggers defined on the back-end relational database.
Travelling wave solutions for a CBS equation in 2 + 1 dimensions
Authors: Maria Luz Gandarias, Maria Santos Bruzon
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

One of the more interesting solutions of the (2 + 1)-dimensional integrable Calogero-Bogoyavlenskii-Schiff (CBS) equation are the soliton solutions. We previously derived a complete group classification for the CBS in (2 +1)-dimensions written as a system of partial differential equations. We now consider the classical Lie symmetries of the CBS equation written in a potential form. We obtain travelling-wave reductions with variable velocity depending on the form of an arbitrary function. The corresponding solutions of the (2 + 1)-dimensional equation involve arbitrary smooth functions. Consequently the solutions exhibit a rich variety of qualitative behaviours. Indeed by making adequate choices for the arbitrary functions, we exhibit periodic and solitary waves.
15 Years of Triple Graph Grammars
Authors: Andy Schürr, Felix Klar
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

Triple graph grammars (TGGs) have been invented 15 years ago as a formalism for the declarative specification of bidirectional graph-to-graph translations. In this paper we present a list of still open problems concerning the interpretation and the expressiveness of TGGs. We will comment on extensions proposed to improve the original approach and the drawbacks that arise thereof. Consequently a more precise formalization of compulsory properties of the translation of triple graph grammars into forward and backward graph translation functions is given. Regarding these properties an interpretation and implementation of negative application conditions is derived that does not destroy the benefits of the original approach. Additionally a new demand-driven forward/backward translation rule application strategy is proposed. It guarantees for the first time automatically a correct ordering of rule applications without imposing any additional requirements on the structure of the regarded graphs.
SymGrid-Par: Designing a Framework for Executing Computational Algebra Systems on Computational Grids
Authors: Abdallah Al Zain, Kevin Hammond, Phil Trinder, Steve Linton, Hans-Wolfgang Loidl, Marco Costanti
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

SymGrid-Par is a new framework for executing large computer algebra problems on computational Grids. We present the design of SymGrid-Par, which supports multiple computer algebra packages, and hence provides the novel possibility of composing a system using components from different packages. Orchestration of the components on the Grid is provided by a Grid-enabled parallel Haskell (GpH). We present a prototype implementation of a core component of SymGrid-Par, together with promising measurements of two programs on a modest Grid to demonstrate the feasibility of our approach.
Software Agents Action Securities
Authors: Vojislav Stojkovic, Hongwei Huo
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Software agents may interact with other agents (including software agents, machines, and human beings), ask for services from other agents, and/or give services to other agents. Software agent security ensures that a software agent can protect its information and services. This paper presents some aspects of software agents securities and focuses on software agents action securities.
Evolutive Parametric Approach for Specular Correction in the Dichromatic Reflection Model
Authors: Ramón Moreno, Alicia D'Anjou, Manuel Graña
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Assuming the dichromatic image model we propose a global reduction of specularity effects by means of parametric illumination gradient images obtained by fitting 2D Legendre polynomials to the specular component of the images. Fitting is done applying a (¿ + μ) Evolution Strategy. The method could be applied to static robotic monitoring in teams of robots, where the illumination gradient image could be computed once and applied to successive frames until the illumination conditions change drastically. The method could be useful for the detection of image regions with different chromatic properties.
Chirplet signal decomposition: analysis, algorithms and applications
Authors: Jafar Saniie
Venue:  (2007)

In ultrasonic imaging applications, the detected echoes contain important information pertaining to the physical properties of the propagation path. These echoes often interfere with each other due to the limited resolution of the transducer and may also be corrupted by noise and/or undesired scattering echoes. Consequently, isolating ultrasonic echoes becomes a challenging problem and conventional signal analysis techniques fail to unravel the desire signal information. In this study, chirplet signal decomposition algorithms have been studied by decomposing highly convoluted ultrasonic signals into a linear expansion of chirplets. For signal parameter estimation, two different decomposition techniques are investigated: chirplet signal decomposition based on the chirplet transform (CTSD), and the matching pursuit signal decomposition (MPSD) using statistical estimation methods (i.e., Maximum Likelihood and Maximum a Posteriori). In CTSD algorithm, the parameter vector of chirplets is estimated based on chirplet transform of the ultrasonic signal. By localizing the dominant echo in the chirplet transform of the signal, we can estimate the time-of-arrival, center frequency and amplitude of the dominant echo, then successively estimate the remaining parameters. In an iterative manner, the residual signal is obtained by subtracting the estimated dominant echo from the signal. The decomposition process is repeated until the energy of residual signal becomes below a pre-defined reconstruction condition. As an alternative, in the MPSD algorithm, statistical methods are utilized to iteratively optimize the parameters of chirplets to match the signal and achieve high resolution decomposition. Computer simulations and experimental analysis show that both algorithms provide efficient parameter estimation and robust chirplet signal decomposition. Furthermore, an FPGA-based hardware/software co-design for a fast CTSD algorithm has been successfully developed on Xilinx FPGA platform for real-time applications. This type of study addresses a broad range applications including target detection, deconvolution, object classification, velocity measurement, and ranging system.
Antisocial Networks: Turning a Social Network into a Botnet
Authors: Elias Athanasopoulos, A. Makridakis, S. Antonatos, D. Antoniades, Sotiris Ioannidis, K. G. Anagnostakis, Evangelos P. Markatos
Venue: Proceedings of the 11th international conference on Information Security (2008)

Antisocial Networks are distributed systems based on social networking Web sites that can be exploited by attackers, and directed to carry out network attacks. Malicious users are able to take control of the visitors of social sites by remotely manipulating their browsers through legitimate Web control functionality such as image-loading HTML tags, JavaScript instructions, etc. In this paper we experimentally show that Social Network web sites have the ideal properties to become attack platforms.We start by identifying all the properties of Facebook, a real-world Social Network, and then study how we can utilize these properties and transform it into an attack platform against any host connected to the Internet. Towards this end, we developed a real-world Facebook application that can perform malicious actions covertly. We experimentally measured it's impact by studying how innocent Facebook users can be manipulated into carrying out a Denial-of-Service attack. Finally, we explored other possible misuses of Facebook and how they can be applied to other online Social Network web sites.
Introduction to Software Product Lines
Authors: Patrick Donohoe
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

This tutorial introduces the essential activities and underlying practice areas of software product line development. It reviews the basic concepts of software product lines, discusses the costs and benefits of product line adoption, introduces the SEI's Framework for Software Product Line Practice, and describes approaches to applying the practices of the framework.
Stepwise Induction of Multi-target Model Trees
Authors: Annalisa Appice, Saso Džeroski
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Multi-target model trees are trees which predict the values of several target continuous variables simultaneously. Each leaf of such a tree contains several linear models, each predicting the value of a different target variable. We propose an algorithm for inducing such trees in a stepwise fashion. Experiments show that multi-target model trees are much smaller than the corresponding sets of single-target model trees and are induced much faster, while achieving comparable accuracies.
Modeling of Environmental Effects on Bridge Components: Possibilities of Cellular Programming
Authors: Jan Podroužek, Drahomír Novák, Břetislav Teplý, Dita Vořechovská
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The early deterioration of concrete structures due to the effects of external aggressive environment is well known. This paper presents cellular automata approach to the problem of lifetime assessment of concrete structures, particularly bridges, under the diffusive attack of external aggressive agents. The diffusion process is modeled by cellular automata technique as a 2D task describing more realistically the spatial variability of e.g. the chloride ingress within dynamic environment. The effectiveness of the proposed methodology arises from the transparent implementation yet complex behavior of two selected numerical case studies.
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
Authors: Yehuda Lindell, Benny Pinkas, Nigel P. Smart
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running system which provides security against malicious adversaries according to rigorous security definition and without using the random oracle model. We ran experiments showing that the protocol is practical. In addition we show that there is little benefit in replacing subcomponents secure in the standard model with those which are only secure in the random oracle model. Throughout we pay particular attention to using the most efficient subcomponents in the protocol, and we select parameters for the encryption schemes, commitments and oblivious transfers which are consistent with a security level equivalent to AES-128.
Monte Carlo Based Algorithm for Fast Preliminary Video Analysis
Authors: Krzysztof Okarma, Piotr Lech
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

In the paper a fast statistical image processing algorithm for video analysis is presented. Our method can be used on colour as well as grayscale or even binary images. The main component of the proposed approach is based on statistical analysis using the Monte Carlo method. A video's statistical information is acquired by specifying a logical condition for the Monte Carlo technique. The results of the algorithm depend on the correct choice of threshold values; thus the application area is limited by the adaptability of the thresholds to videos with large heterogeneity: e.g. videos with objects moving into and out of the scene, rapidly varying illumination, etc.
The CDC 6600 Project
Authors: James E. Thornton
Venue: IEEE Annals of the History of Computing (1980)

This article is an account of the development of the Control Data 6600 computer first developed in 1964. Of historical interest is the design team approach adopted by Control Data in which a small staff of engineers was isolated from the main operations of the company. Some review is made of the design process as well as the unique features of the machine. The article also includes some comments in retrospect about the results of certain of the initial design objectives.
Quantification of Metabolites in Swine Brain by ^1H MR Spectroscopy Using LCModel and QUEST: A Comparison Study
Authors: Z. W. Shen, Y. W. Chen, H. Y. Wang, Y. Lin, J. K. He, W. W. Liu, F. Y. Chen, R. H. Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Magnetic Resonance Spectroscopy (MRS) is a non-invasive technique in which biochemical information can be obtained in vivo. LCModel and QUEST are two quantization tools for magnetic resonance spectroscopy. In this paper, a comparison between LCModel and QUEST is presented. After a description of the methods, we compared their performance on quantification of dominant metabolites in the brains of a health swine and a hypoxic ischemic one. In order to acquire the absolute concentration, external reference method and water reference were used. Both tools can fit a smooth curve and a baseline. With water reference in LCModel, absolute concentrations of NAA, Cr, and Cho can be obtained accurately and the concentration of Lac can also be measured. The metabolite concentrations using external reference were compared with the two kinds of software. Both LCModel and QUEST are valuable tools in quantification of absolute concentration in vivo.
Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem
Authors: Guangmin Wang, Zhongping Wan, Xianjia Wang, Yibing Lv
Venue: Computers Mathematics with Applications (2008)

The bilevel programming problems are useful tools for solving the hierarchy decision problems. In this paper, a genetic algorithm based on the simplex method is constructed to solve the linear-quadratic bilevel programming problem (LQBP). By use of Kuhn-Tucker conditions of the lower level programming, the LQBP is transformed into a single level programming which can be simplified to a linear programming by the chromosome according to the rule. Thus, in our proposed genetic algorithm, only the linear programming is solved by the simplex method to obtain the feasibility and fitness value of the chromosome. Finally, the feasibility of the proposed approach is demonstrated by the example.
Intrinsic System Model of the Genetic Algorithm with α-Selection
Authors: André Neubauer
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Genetic algorithms are random heuristic search (RHS) algorithms which can be theoretically described with the help of a dynamical system model. This model characterises the stochastic trajectory of a population using a deterministic heuristic function and its fixed points. For practical problem sizes the determination of the fixed points is unfeasible even for the simple genetic algorithm (SGA). In this paper the novel intrinsic system model is introduced for the genetic algorithm with &alpha;-selection and the corresponding unique fixed point is determined. It is shown that this model is compatible with the equivalence relation imposed by schemata. In addition to the theoretical analysis experimental results are presented which confirm the theoretical predictions.
Composition Techniques for Rule-Based Model Transformation Languages
Authors: Dennis Wagelaar
Venue: Proceedings of the 1st international conference on Theory and Practice of Model Transformations (2008)

Model transformation languages have matured to a point where people have started experimenting with model transformation definitions themselves in addition to the language they are written in. In addition to the transformation language properties, the properties of model transformation definitions themselves become important, such as scalability, maintainability and reusability. Composition of model transformations allows for the creation of smaller, maintainable and reusable model transformation definitions that can scale up to a larger model transformation. There are two kinds of composition for model transformations. External composition deals with chaining separate model transformations together by passing models from one transformation to another. Internal composition composes two model transformation definitions into one new model transformation, which typically requires knowledge of the transformation language. This paper focuses on internal composition for two rule-based model transformation languages. One is the ATLAS Transformation Language, which serves as our implementation vehicle. The other is the QVT Relations language, which is a standard transformation language for MOF. We propose a composition technique called module superimposition. We discuss how module superimposition interacts with other composition techniques in ATL, such as helpers, called rules and rule inheritance. Together, these techniques allow for powerful composition of entire transformation modules as well as individual transformation rules. By applying superimposition to QVT Relations, we demonstrate that our composition technique is relevant outside the ATL language as well. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Microprocessor-based Cryptoprocessor
Authors: Christian Muller-Schloer
Venue: IEEE Micro (1983)

By adding this IEEE 796 module to his workstation or personal computer, a user can put "electronic envelopes" around his e-mail messages.
Pose Insensitive 3D Retrieval by Poisson Shape Histogram
Authors: Pan Xiang, Chen Qi Hua, Fang Xin Gang, Zheng Bo Chuan
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

With the rapid increase of available 3D models, content-based 3D retrieval is attracting more and more research interests. Histogram is the most widely in constructing 3d shape descriptor. Most existing histogram based descriptors, however, will not remain invariant under rigid transform. In this paper, we proposed a new kind of descriptor called poisson shape histogram. The main advantage of the proposed descriptor is not sensitive for rigid transform. It can remain invariant under rotation as well. To extract poisson shape histogram, we first convert the given 3d model into voxel representation. Then, the poisson solver with dirichlet boundary condition is used to get shape signature for each voxel. Finally, the poisson shape histogram is constructed by shape signatures. Retrieving experiments for the shape benchmark database have proven that poisson shape histogram can achieve better performance than other similar histogram-based shape representations.
An Improved Algorithm for Medical Image Segmentation
Authors: Ting-lei Huang, Xue Bai
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The main objective of medical image segmentation is to extract and characterize anatomical structures with respect to some input features or expert knowledge. Traditional two-dimensional Otsu method for medical image segmentation is time–consuming computation and become an obstacle in real time application systems. This paper describes a way of medical image segmentation using optimized two-dimensional Otsu method based on improved genetic algorithm (GA). In proposed algorithm, the probability-ties of crossover are adaptively varied depending on the ranking value of individuals instead of fitness, and dyadic mutation operator was presented to take the place of the traditional one. The experimental results show that the new optimized method dramatically reduces the operating time in medical image segmentation while ensures the final image segmentation quality.
Making a Robot Learn to Play Soccer Using Reward and Punishment
Authors: Heiko Müller, Martin Lauer, Roland Hafner, Sascha Lange, Artur Merke, Martin Riedmiller
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

In this paper, we show how reinforcement learning can be applied to real robots to achieve optimal robot behavior. As example, we enable an autonomous soccer robot to learn intercepting a rolling ball. Main focus is on how to adapt the Q-learning algorithm to the needs of learning strategies for real robots and how to transfer strategies learned in simulation onto real robots.
Robustness in Interaction Systems
Authors: Mila Majster-Cederbaum, Moritz Martens
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

We treat the effect of absence/failure of ports or components on properties of component-based systems. We do so in the framework of interaction systems, a formalism for component-based systems that strictly separates the issues of local behavior and interaction, for which ideas to establish properties of systems were developed.We propose how to adapt these ideas to analyze how the properties behave under absence or failure of certain components or merely some ports of components. We demonstrate our approach for the properties local and global deadlock-freedom as well as liveness and local progress.