ppxscal/embedding_network huggingface dataset:
Deformation retrieval in large areas based on multibaseline DInSAR algorithm: a case study in Cangzhou, northern China
Authors: T. Wu, C. Wang, H. Zhang, Y. X. Tang, L. Tian
Venue: International Journal of Remote Sensing (2008)

The DInSAR technique with a multibaseline is becoming popular nowadays to investigate slow urban deformation. In this paper, we focus on deformation retrieval in large areas, including urban and suburban areas. Based on the multibaseline DInSAR algorithm proposed by Mora, three extensions are derived. First, least-squares adjustment and error-controlling methods are used to obtain stable deformation velocity and height error estimations. The least-squares QR factorizaiton algorithm is emphasized to solve large, linear, and sparse functions. Second, a new complex network is presented to limit noise effects on the Delaunay triangular network. Third, by combining complex and Delaunay networks, large-area deformation is investigated, from centre urban areas to suburban areas. The enhanced algorithm is performed to investigate the subsidence of Cangzhou, Hebei province (northern China) during 1993-1997 by using 9 ERS SLC data. The experimental results show serious subsidence in the region and are validated by levelling data and groundwater wells data. Compared with levelling data, the estimation errors of linear deformation velocity in urban areas are in the range of (-2, 2) mm year-1, and in suburban areas, the errors are in the range of (-26, 15) mm year-1, which is sufficiently feasible to determine the status of subsidence relative to the maximum deformation velocity of about -100 mm year-1. The subsidence centres in urban areas are consistent with the spatial distribution of groundwater wells, which provides evidence that groundwater overexploitation is the main cause of subsidence in Cangzhou. The closure of wells will be a good way to control subsidence in the future.
Construction and Querying of Relational Schema for Ontology Instances Data
Authors: Maciej Falkowski, Czeslaw Jedrzejek
Venue: Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS (2008)

In this paper we present a method of storing semantic RDF instances data in relational databases. This method is based on the "table-per-class" approach, and present an algorithm of automatic relational schema building for ABox data. We also developed query processor that rewrites SPARQL queries to SQL queries and has some inferencing capabilities. Tests on our prototype system demonstrate that the rewritten queries can be answered by RDBMS in an efficient and scalable way.
optimization-based image segmentation by genetic algorithms
Authors: S. Chabrier, C. Rosenberger, B. Emile, H. Laurent
Venue: Journal on Image and Video Processing (2008)

Many works in the literature focus on the definition of evaluation metrics and criteria that enable to quantify the performance of an image processing algorithm. These evaluation criteria can be used to define new image processing algorithms by optimizing them. In this paper, we propose a general scheme to segment images by a genetic algorithm. The developed method uses an evaluation criterion which quantifies the quality of an image segmentation result. The proposed segmentation method can integrate a local ground truth when it is available in order to set the desired level of precision of the final result. A genetic algorithm is then used in order to determine the best combination of information extracted by the selected criterion. Then, we show that this approach can either be applied for gray-levels or multicomponents images in a supervised context or in an unsupervised one. Last, we show the efficiency of the proposed method through some experimental results on several gray-levels and multicomponents images.
Implicit Cooperation Strategies for Multi-robot Search of Unknown Areas
Authors: Monica Anderson, Nikolaos Papanikolopoulos
Venue: Journal of Intelligent and Robotic Systems (2008)

Although explicit coordination of team search may provide solid performance for small team sizes, it has been shown that such methods do not scale to larger teams due to limited communications bandwidth and computational requirements. In addition, methods that rely upon persistent, reliable network connections may have limited applicability to real-world search problems. In this work, we explore implicit cooperation enabled through sharing of search progress information. Prior research shows cooperation paradigms in which team members share a global task list result in interference and duplication of search when members choose the same search areas. Methods that only use local sensor information to identify search targets require fewer message exchanges and create less interference between robots than existing shared approaches. In addition, search progress and completion are more consistent due to the reduction in interference. Results based on simulations and physical experiments are presented that compare performance in terms of time-to-cover, consistency, and interference.
Optimal design of thermally stable proteins
Authors: Ryan M. Bannen, Vanitha Suresh, George N. Phillips, Stephen J. Wright, Julie C. Mitchell
Venue: Bioinformatics (2008)

Motivation: For many biotechnological purposes, it is desirable to redesign proteins to be more structurally and functionally stable at higher temperatures. For example, chemical reactions are intrinsically faster at higher temperatures, so using enzymes that are stable at higher temperatures would lead to more efficient industrial processes. We describe an innovative and computationally efficient method called Improved Configurational Entropy (ICE), which can be used to redesign a protein to be more thermally stable (i.e. stable at high temperatures). This can be accomplished by systematically modifying the amino acid sequence via local structural entropy (LSE) minimization. The minimization problem is modeled as a shortest path problem in an acyclic graph with nonnegative weights and is solved efficiently using Dijkstra's method. Contact: mitchell@biochem.wisc.edu
Stochastic image warping for improved watermark desynchronization
Authors: Angela D'Angelo, Mauro Barni, Neri Merhav
Venue: European Journal of Information Systems (2008)

The use of digital watermarking in real applications is impeded by the weakness of current available algorithms against signal processing manipulations leading to the desynchronization of the watermark embedder and detector. For this reason, the problem of watermarking under geometric attacks has received considerable attention throughout recent years. Despite their importance, only few classes of geometric attacks are considered in the literature, most of which consist of global geometric attacks. The random bending attack contained in the Stirmark benchmark software is the most popular example of a local geometric transformation. In this paper, we introduce two new classes of local desynchronization attacks (DAs). The effectiveness of the new classes of DAs is evaluated from different perspectives including perceptual intrusiveness and desynchronization efficacy. This can be seen as an initial effort towards the characterization of the whole class of perceptually admissible DAs, a necessary step for the theoretical analysis of the ultimate performance reachable in the presence of watermark desynchronization and for the development of a new class of watermarking algorithms that can efficiently cope with them.
Edge-centric modulo scheduling for coarse-grained reconfigurable architectures
Authors: Hyunchul Park, Kevin Fan, Scott A. Mahlke, Taewook Oh, Heeseok Kim, Hong-seok Kim
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

Coarse-grained reconfigurable architectures (CGRAs) present an appealing hardware platform by providing the potential for high computation throughput, scalability, low cost, and energy efficiency. CGRAs consist of an array of function units and register files often organized as a two dimensional grid. The most difficult challenge in deploying CGRAs is compiler scheduling technology that can efficiently map software implementations of compute intensive loops onto the array. Traditional schedulers focus on the placement of operations in time and space. With CGRAs, the challenge of placement is compounded by the need to explicitly route operands from producers to consumers. To systematically attack this problem, we take an edge-centric approach to modulo scheduling that focuses on the routing problem as its primary objective. With edge-centric modulo scheduling (EMS), placement is a by-product of the routing process, and the schedule is developed by routing each edge in the dataflow graph. Routing cost metrics provide the scheduler with a global perspective to guide selection. Experiments on a wide variety of compute-intensive loops from the multimedia domain show that EMS improves throughput by 25% over traditional iterative modulo scheduling, and achieves 98% of the throughput of simulated annealing techniques at a fraction of the compilation time.
Robust safety of timed automata
Authors: Martin Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
Venue: Formal Methods in System Design (2008)

Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturbation in the timing of actions may lead to completely different behaviors of the automaton. Following several recent works, we consider a relaxation of this semantics, in which guards on transitions are widened by Δ>0 and clocks can drift by ¿>0. The relaxed semantics encompasses the imprecisions that are inevitably present in an implementation of a timed automaton, due to the finite precision of digital clocks.We solve the safety verification problem for this robust semantics: given a timed automaton and a set of bad states, our algorithm decides if there exist positive values for the parameters Δ and ¿ such that the timed automaton never enters the bad states under the relaxed semantics.
On the Bayes risk in information-hiding protocols
Authors: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden
Venue: Journal of Computer Security (2008)

Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be regarded as a hypothesis-testing problem. We consider the Bayesian approach to the problem, and investigate the probability of error associated to the MAP (maximum a posteriori probability) inference rule. Our main result is a constructive characterization of a convex base of the probability of error, which allows us to compute its maximum value (over all possible input distributions), and to identify upper bounds for it in terms of simple functions. As a side result, we are able to improve the Hellman-Raviv and the Santhi-Vardy bounds expressed in terms of conditional entropy. We then discuss an application of our methodology to the Crowds protocol, and in particular we show how to compute the bounds on the probability that an adversary break anonymity.
Multiple-objective scheduling and real-time dispatching for the semiconductor manufacturing system
Authors: Y. F. Lee, Z. B. Jiang, H. R. Liu
Venue: Computers and Operations Research (2009)

Implementing efficient scheduling and dispatching policies is a critical means to gain competitiveness for modern semiconductor manufacturing systems. In contemporary global market, a successful semiconductor manufacturer has to excel in multiple performance indices, consequently qualified scheduling approaches should provide efficient and holistic management of wafer products, information and manufacturing resources and make adaptive decisions based on real-time processing status to reach an overall optimized system performance. To cope with this challenge, a timed extended object-oriented Petri nets (EOPNs) based multiple-objective scheduling and real-time dispatching approach is proposed in this paper. Four performance objectives pursued by semiconductor manufacturers are integrated into a priority-ranking algorithm that serves as the initial scheduling guidance, and then all wafer lots will be dynamically dispatched by the hybrid real-time dispatching control system. A set of simulation experiments validate the proposed multiple-objective scheduling and real-time dispatching algorithm may achieve satisfactory performances.
Character emotion experience in virtual environments
Authors: Nelson Zagalo, Ana Torres
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

The present paper presents an emotion module from an authoring tool of interactive storytelling being developed within the European Project&#x2014;INSCAPE. The Atmosphere Editor (AE) is an INSCAPE software plug-in. Its aim is to help authors to easily create virtual interactive scenes that are recognized as emotional in order to contribute to higher coherence of their content and simultaneously to emphasize their communication purposes. It works through the attribution of emotional meaning to virtual environments and characters classes that act on the virtual story-world. Therefore, it is designed to produce a semantic intervention in the story but does not intend to transcend the storyteller work. AE presents then a taxonomy capable of sustaining the communicational optimization of the interactive narratives at an emotional level. The AE intervention develops in addition a possible pedagogical virtue permitting the learning by the story authors about potential emotional uses of specific virtual parameters. It permits also the INSCAPE user to understand the emotional semantics canons of the interactive virtual stories.
Optimization and dynamical systems algorithms for finding equilibria of stochastic games
Authors: Arun Sen, David F. Shanno
Venue: Optimization Methods Software (2008)

We present two new algorithms for computing Nash equilibria of stochastic games. One is a global random start algorithm based on nonlinear programming, while the other combines a dynamical system with nonlinear programming to find stable equilibria. Promising numerical results are presented.
Comparison of atmospheric correction algorithms for TM image in inland waters
Authors: Shaoqi Gong, Jiazhu Huang, Yunmei Li, Haijun Wang
Venue: International Journal of Remote Sensing (2008)

In order to extract quantitative water-leaving information from the Thematic Mapper (TM) image accurately in inland waters, atmospheric correction is a necessary step. Based on former researchers' results, the paper presents two atmospheric correction algorithms based on meteorological data (MD) and on Moderate Resolution Imaging Spectroradiometer (MODIS) Vicarious Calibration (MVC) for TM image in inland waters according to the theory of radiative transfer. Studying Taihu lake, China, in this paper we derived water remote sensing reflectance from a TM image of 26 July 2004 by these two atmospheric correction algorithms and we compare the results with that of dark object subtraction (DOS) and 6S code. The results show that the effect of atmospheric correction based on meteorological data and MODIS Vicarious Calibration is much better than that of DOS and 6S code. Although the MD is more accurate, MVC may be an ideal choice for TM images in inland water because TERRA MODIS images can be acquired easily than collecting meteorological data at the time of satellites passing over.
Intelligent learning system for online learning
Authors: Fatma Cemile Serçe, Ferda Nur Alpaslan, Lakhmi C. Jain
Venue: International Journal of Hybrid Intelligent Systems (2008)

The paper presents an Adaptive Intelligent Learning System (AILS) designed to be used with any Learning Management System (LMS). The adaptiveness provides uniquely identifying and monitoring the learner's learning process according to the learner's profile. AILS has been implemented as a multi-agent system. The agents were developed as JADE agents. The paper presents the learning model, system components, agent behavior in learner scenarios, the ontologies used in agent communications, and the adaptive strategies. The sample application of the AILS to a dummy LMS is also given.
A multiscale feature fusion approach for classification of very high resolution satellite imagery based on wavelet transform
Authors: X. Huang, L. Zhang, P. Li
Venue: International Journal of Remote Sensing (2008)

A novel methodology based on multiscale spectral and spatial information fusion using wavelet transform is proposed in order to classify very high resolution (VHR) satellite imagery. Conventional wavelet-based feature extraction methods employ single windows of a fixed size, which are not satisfactory as the VHR imagery contains complex and multiscale objects. In this paper, spectral and spatial features are extracted based on a set of concentric windows around a central pixel in order to integrate the information across different windows/scales. The proposed method is made up of three blocks: (1) the conventional wavelet-based feature extraction methods are extended from single band processing to multispectral bands, and from single window to multi-windows, (2) two multiscale fusion algorithms are proposed to exploit the multiscale spectral and spatial information and (3) a support vector machine (SVM), a relatively new method of machine learning, is used to classify the multiscale spectral-spatial feature sets. The proposed classification method is evaluated on two VHR datasets and the results show that the multiscale approach can improve the classification accuracy in homogeneous areas while simultaneously preserving accuracy in edge regions.
Genome-scale classification of metabolic reactions and assignment of EC numbers with self-organizing maps
Authors: Diogo A. R. S. Latino, Qing-You Zhang, João Aires-de-Sousa
Venue: Bioinformatics (2008)

Motivation: The automatic perception of chemical similarities between metabolic reactions is required for a variety of applications ranging from the computer-aided validation of classification systems, to genome-scale reconstruction (or comparison) of metabolic pathways, to the classification of enzymatic mechanisms. Comparison of metabolic reactions has been mostly based on Enzyme Commission (EC) numbers, which are extremely useful and widespread, but not always straightforward to apply, and often problematic when an enzyme catalyzes several reactions, when the same reaction is catalyzed by different enzymes, when official full EC numbers are unavailable or when reactions are not catalyzed by enzymes. Different methods should be available to compare metabolic reactions. Simultaneously, methods are required for the automatic assignment of EC numbers to reactions still not officially classified. Results: We have proposed the MOLMAP reaction descriptors to numerically encode the structural transformations resulting from a chemical reaction. Here, such descriptors are applied to the mapping of a genome-scale database of almost 4000 metabolic reactions by Kohonen self-organizing maps (SOMs), and its screening for inconsistencies in EC numbers. This approach allowed for the SOMs to assign EC numbers at the class, subclass and sub-subclass levels for reactions of independent test sets with accuracies up to 92, 80 and 70%, respectively. Different levels of similarity between training and test sets were explored. The approach also led to the identification of a number of similar reactions bearing differences at the EC class level. Availability: The programs to generate MOLMAP descriptors from atomic properties included in SDF files are available upon request for evaluation. Contact: jas@fct.unl.pt Supplementary information: Supplementary data are available at Bioinformatics online.
Behavioral Compatibility of Web Services
Authors: Zhangbing Zhou, Sami Bhiri, Walid Gaaloul, Lei Shu, Manfred Hauswirth
Venue: Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS (2008)

Current methods for compatibility analysis consider only direct service interactions where no mismatches are allowed. However mismatches usually exist among Web services, and their interactions are often carried out with the help of mediators. In addition, current approaches don't give precise evaluation of partial compatibility which is useful for ranking and selecting candidate services.In this paper, we consider compatibility beyond direct service interaction where mediation can be applied. We present an approach to check if two business processes can be mediated or not. Our approach also enables better evaluation of compatibility by quantifying the degree of compatibility as a number between 0 and 1.
Identifying appropriate methodologies and strategies for vertical mining with incomplete data
Authors: Faris Alqadah, Zhen Hu, Lawrence J. Mazlack
Venue: WSEAS Transactions on Computers (2008)

Many data mining methods are dependent on recognizing frequent patterns. Frequent patterns lead to the discovery of association rules, strong rules, sequential episodes, and multi-dimensional patterns. All can play a critical role in helping corporate and scientific institutions to understand and analyze their data. Patterns should be discovered in time and space efficient manner. Discovered patterns have authentic value when they accurately describe data trends; and, do not exclusively reflect noise or chance encounters. Vertical data mining algorithms key advantage is that they can outperform their horizontal counterparts in terms of both time and space efficiency. Little work has addressed how incomplete data influences vertical data mining. Consequently, the quality and utility of vertical mining algorithms results remains ambiguous as real data sets often contain incomplete data. This paper considers how to establish methodologies that deal with incomplete data in vertical mining; additionally, it seeks to develop strategies for determining the maximal utilization that can be mined from a dataset based on how much and what data is missing.
Enhancing process-adaptation capabilities with web-based corporate radar technologies
Authors: Prateek Jain, Peter Z. Yeh, Kunal Verma, Alex Kass, Amit Sheth
Venue: Proceedings of the first international workshop on Ontology-supported business intelligence (2008)

Dynamic business processes are capable of adapting themselves to internal events but lack the ability to adapt to external events. Corporate radars are capable of mining the Web for external events of interest to produce structured representations of these events but are not capable of adapting themselves based on these events. In this position paper, we advocate and propose a system that integrates these two approaches to enhance the capability of process-adaptation engines, greatly increasing the scope of events they can respond to.