ppxscal/embedding_network huggingface dataset:
A tool for mapping discovery over revealing schemas
Authors: Verena Kantere, Dimos Bousounis, Timos Sellis
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In a world of wide-scale information sharing, the decentralized coordination has to consolidate a variety of heterogeneity. Shared data are described in different formats, i.e. data structures, values and schemas. Querying manifold such sources entails techniques that can bridge the data formats. Some of these techniques deal with producing mappings for the schemas of data. The existing techniques view complementary aspects of the schema mapping problem. Important ones, consider producing all the possible mappings for a pair of schemas, insinuating any accompanying semantics in the mappings and adapting correct mappings as schemas evolve. Towards this end we have developed a solution that is fine-tuned for the discovery of mappings as schemas of autonomous sources are gradually revealed. In this demonstration we exhibit a new prototype tool that implements this solution. The tool provides a mechanism that realizes discovery of correct mappings as schemas are revealed. Mapping discovery is schema-centric and incorporates new semantics as they are unveiled. Mapping experience is reused and possible mappings are ranked so that the best choice is presented. The core mechanism collaborates with an automatic schema matching tool and the user that lightly guides the mapping process. The demonstration presents two application scenarios that prove the suitability of this prototype tool and the effectiveness of the implemented mapping solution in realistic situations of of data integration and exchange between heterogeneous autonomous sources.
Mining non-derivable frequent itemsets over data stream
Authors: Haifeng Li, Hong Chen
Venue: Data Knowledge Engineering (2009)

Non-derivable frequent itemsets are one of several condensed representations of frequent itemsets, which store all of the information contained in frequent itemsets using less space, thus being more suitable for stream mining. This paper considers a problem that to the best of our knowledge has not been addressed, namely, how to mine non-derivable frequent itemsets in an incremental fashion. We design a compact data structure named NDFIT to efficiently maintain a dynamically selected set of itemsets. In NDFIT, the nodes are divided into four categories to reduce the redundant computational cost based on their properties. Consequently, an optimized algorithm named NDFIoDS is proposed to generate non-derivable frequent itemsets over stream sliding window. Our experimental results show that this method is effective and more efficient than previous approaches.
Historical reflectionsThe rise, fall, and resurrection of software as a service
Authors: Martin Campbell-Kelly
Venue: Communications of the ACM (2009)

A look at the volatile history of remote computing and online software services.
Water flows' management system at the secondary cooling in the continuous steel casting process
Authors: Corina Daniela Cuntan, Ioan Baciu
Venue: WSEAS Transactions on Systems and Control (2008)

In this work it was proposed the structure of a management system for the water flows in the secondary cooling area within the continuous steel casting process. The management system assumes the utilization of some temperature and speed transducers, of which output measures represent the input variables for the Fuzzy regulator. For adapting the output measures from transducers with the inputs of the Fuzzy regulator, it was conceived an adaption system that achieves the variation range 1-100%. For implementing the expert system, it was achieved a base of specific knowledge, introduced by the human expert and materialized as some sets of rules that constitute the reasoned judgement based on which the system is acting by analyzing the variables' real values.
Hybrid chaining scheme for video-on-demand applications based on popularity
Authors: R. Roopalakshmi, R. Ashok Kumar
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

A true Video-on-Demand (VoD) service, specifies the transmission of a dedicated video stream from a video server to the subscribed user. In proxy assisted transmission schemes, although it reduces load on server and increases network efficiency, but when scalability of network increases, server faces significant efficiency degradations. In this paper, we propose a new popularity based chaining approach, which allows the clients to serve video streams to other clients, by means of unicasting. In this way more clients can be chained together. This hybrid scheme results in: (1) Increase in servicing capability of a proxy server, (2) Makes good use of clients uplink bandwidth. (3) Optimum utilization of proxy server resources and also (4) To provide fast and better video streaming service. Our simulation results show that, the utilization of proxy server resources using proposed hybrid scheme are much lower than those of existing chaining scheme. This hybrid scheme is easily deployable and cost - effective, in terms of minimizing the rejection rate of movie requests.
Towards an integrated framework for querying collection of heterogeneous data
Authors: Sujeet Pradhan
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Keywords queries on various data models have been studied in the past. Regardless of the nature of target data, a keyword query poses a common problem: the difficulty in determining a suitable retrieval unit. In this paper, we discuss this problem in a new scenario that assumes several different types of data being stored and queried in a unified framework. A hypothetical general query model that borrows the ideas of our previous model designed for XML and linear video data is presented. We then state the requirements and challenges to realize such a model.
Improving application layer latency for reliable thin-stream game traffic
Authors: Andreas Petlund, Kristian Evensen, Pål Halvorsen, Carsten Griwodz
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

A wide range of networked games send data with very high interarrival-time between packets and with small payloads in each packet. We call these transmission patterns "thin streams". Reliability, when needed for game traffic, is usually achieved through TCP or by using retransmission schemes modelled on TCP. These retransmission schemes can result in very large delays if the stream is thin [9]. Viewed in the light of the time-dependent nature of game traffic, large delays can be severely impeding to the game experience. In order to reduce application-layer latency when packets are lost, we have implemented modifications to TCP in the Linux kernel. The changes are only active when thin-stream properties are detected, thus not affecting TCP behaviour when the stream is not thin. In this paper, we show the latency improvements from these thin-stream modifications. As a case study, we have used the game BZFlag to test the mechanisms, and present statistics from these tests. The experimental results show that our modifications allow TCP to recover earlier from packet loss. This latency reduction was then shown to improve the difference between perceived and actual player positions in the BzFlag game.
Large-scale atomistic approach to random-dopant-induced characteristic variability in nanoscale CMOS digital and high-frequency integrated circuits
Authors: Yiming Li, Chih-Hong Hwang, Ta-Ching Yeh, Tien-Yeh Li
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Modeling of device variability is crucial for the accuracy of timing in circuits and systems, and the stability of high-frequency application. Unfortunately, due to the randomness of dopant position in device, the fluctuation of device gate capacitance is nonlinear and hard to be modeled in current compact models. Therefore, a large-scale statistically sound "atomistic" device/circuit coupled simulation approach is proposed to characterize the random-dopant-induced characteristic fluctuations in 16-nm-gate CMOS integrated circuits concurrently capturing the discrete-dopant-number- and discrete-dopant-position-induced fluctuations. The variations of transition time of digital circuit (inverter, NAND, and NOR gates) and high-frequency characteristic of common-source amplifier are estimated. For the digital circuits, the function-dependent and circuit-topology-dependent characteristic fluctuations resulted from random nature of discrete dopants is for the first time discussed. This study provides an insight into random-dopant- induced intrinsic timing and high-frequency characteristic fluctuations. The accuracy of the simulation technique is confirmed by the use of experimentally calibrated transistor physical model.
Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data
Authors: Stephen J. Willson
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

Given a collection of rooted phylogenetic trees with overlapping sets of leaves, a compatible supertree $S$ is a single tree whose set of leaves is the union of the input sets of leaves and such that $S$ agrees with each input tree when restricted to the leaves of the input tree. Typically with trees from real data, no compatible supertree exists, and various methods may be utilized to reconcile the incompatibilities in the input trees. This paper focuses on a measure of robustness of a supertree method called its ``radius" $R$. The larger the value of $R$ is, the further the data set can be from a natural correct tree $T$ and yet the method will still output $T$. It is shown that the maximal possible radius for a method is $R = 1/2$. Many familiar methods, both for supertrees and consensus trees, are shown to have $R = 0$, indicating that they need not output a tree $T$ that would seem to be the natural correct answer. A polynomial-time method Normalized Triplet Supertree (NTS) with the maximal possible $R = 1/2$ is defined. A geometric interpretion is given, and NTS is shown to solve an optimization problem. Additional properties of NTS are described.
Fault classifier of rotating machinery based on weighted support vector data description
Authors: Yong Zhang, Xiao-Dan Liu, Fu-Ding Xie, Ke-Qiu Li
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presents a novel fuzzy classifier for fault diagnosis of rolling machinery based on support vector data description (SVDD) and kernel possibilistic c-means clustering. The proposed method considers the effect of negative samples, which should be rejected by positive class, to the SVDD classifier. Firstly, we compute weights of training samples to the given positive class using the kernel PCM algorithm. Then according to weights, we select some meaning samples to construct a new training set, and train these samples with the proposed weighted SVDD algorithm. The proposed method is applied to the fault diagnosis of rolling element bearings, and experimental results show that the proposed method can reliably separate different fault conditions, and reduce the effect of outliers to classification results.
The NLC-width and clique-width for powers of graphs of bounded tree-width
Authors: Frank Gurski, Egon Wanke
Venue: Discrete Applied Mathematics (2009)

The k-power graph of a graph G is a graph with the same vertex set as G, in that two vertices are adjacent if and only if, there is a path between them in G of length at most k. A k-tree-power graph is the k-power graph of a tree, a k-leaf-power graph is the subgraph of some k-tree-power graph induced by the leaves of the tree. We show that (1) every k-tree-power graph has NLC-width at most k+2 and clique-width at most k+2+max{@?k2@?-1,0}, (2) every k-leaf-power graph has NLC-width at most k and clique-width at most k+max{@?k2@?-2,0}, and (3) every k-power graph of a graph of tree-width l has NLC-width at most (k+1)^l^+^1-1, and clique-width at most 2@?(k+1)^l^+^1-2.
Towards an Extended Model of User Interface Adaptation: The Isatine Framework
Authors: Víctor López-Jaquero, Jean Vanderdonckt, Francisco Montero, Pascual González
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

In order to cover the complete process of user interface adaptation, this paper extends Dieterich's taxonomy of user interface adaptation by specializing Norman's theory of action into the Isatine framework. This framework decomposes user interface adaptation into seven stages of adaptation: goals for adaptation, initiative, specification, application, transition, interpretation, and evaluation. The purpose of each stage is defined and could be ensured respectively by the user, the interactive system, a third party, or any combination of these entities. The potential collaboration between these entities suggests defining additional support operations such as negotiation, transfer, and delegation. The variation and the complexity of adaptation configurations induced by the framework invited us to introduce a multi-agent adaptation engine, whose each agent is responsible for achieving one stage at a time (preferably) or a combination of them (in practice). In this engine, the adaptation rules are explicitly encoded in a knowledge base, from which they can be retrieved on demand and executed. In particular, the application of adaptation rules is ensured by examining the definition of each adaptation rule and by interpreting them at run-time, based on a graph transformation system. The motivations for this multi-agent system are explained and the implementation of the engine is described in these terms. In order to demonstrate that this multi-agent architecture allows an easy reconfigurability of the interactive system to accom modate the various adaptations defined in the framework, a case study of a second-hand car-selling system is detailed from a simple adaptation to progressively more complex ones.
Explicit methods for fractional differential equations and their stability properties
Authors: Luciano Galeone, Roberto Garrappa
Venue: Journal of Computational and Applied Mathematics (2009)

The use of explicit methods in the numerical treatment of differential equations of fractional order is an area not yet widely investigated. In this paper stability properties of some multistep methods of explicit type are investigated and new methods with larger intervals of stability are proposed. Some numerical experiments are presented in order to validate theoretical results.
Analysis of multiple process flows in an ASIC fab with a detailed photolithography area model
Authors: Kamil Erkan Kabak, Cathal Heavey, Vincent Corbett
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

ASIC fabs are characterized by multiple process flows. This is mainly due to the highly diversified product portfolios within such fabs. In this study, we first examined the cycle time for individual process flows in a medium volume ASIC fab. We compared these process flows in terms of overall cycle time and using a cycle time index. Secondly, focusing on photolithography we developed a simulation model that employs cycle time data to analyze the impacts of process flow diversity. Thirdly, we used this model to examine the impact on cycle time of changing the volumes of wafer starts on different process flows. The detailed results of simulation experiments along with the concluding remarks are given at the end of the study.
On-line LDA: Adaptive Topic Models for Mining Text Streams with Applications to Topic Detection and Tracking
Authors: Loulwah AlSumait, Daniel Barbará, Carlotta Domeniconi
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

This paper presents Online Topic Model (OLDA), a topic model that automatically captures the thematic patterns and identifies emerging topics of text streams and their changes over time. Our approach allows the topic modeling framework, specifically the Latent Dirichlet Allocation (LDA) model, to work in an online fashion such that it incrementally builds an up-to-date model (mixture of topics per document and mixture of words per topic) when a new document (or a set of documents) appears. A solution based on the Empirical Bayes method is proposed. The idea is to incrementally update the current model according to the information inferred from the new stream of data with no need to access previous data. The dynamics of the proposed approach also provide an efficient mean to track the topics over time and detect the emerging topics in real time. Our method is evaluated both qualitatively and quantitatively using benchmark datasets. In our experiments, the OLDA has discovered interesting patterns by just analyzing a fraction of data at a time. Our tests also prove the ability of OLDA to align the topics across the epochs with which the evolution of the topics over time is captured. The OLDA is also comparable to, and sometimes better than, the original LDA in predicting the likelihood of unseen documents.
A Model-Driven Development Approach Focusing Human Interaction
Authors: Stefan Link, Philip Hoyer, Tilmann Kopp, Sebastian Abeck
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Human interaction like entering some data, making decisions etc. has to be dealt with as an integral part of today's business processes and the supporting IT likewise. Hence, human interaction leads to an increased complexity in software development and software systems. Current business- and model-driven development approaches provide promising means to deal with this complexity. Diverse aspects of the business process and the supporting software system are captured in models and automatically transformed to the source code of a desired platform. In the context of human interaction however, there remains a lack of precise models for specifying human interaction aspects. Thus, an extensive manual development and configuration effort is necessary leading to expensive software, badly configured interfaces and frustratedusers. In this article, we therefore demonstrate a model-driven development approach focusing on human interaction as an integral part of business processes and software systems likewise. A case study fortifies the applicability of our approach.
Parallel ILP for distributed-memory architectures
Authors: Nuno A. Fonseca, Ashwin Srinivasan, Fernando Silva, Rui Camacho
Venue: Machine Learning (2009)

The growth of machine-generated relational databases, both in the sciences and in industry, is rapidly outpacing our ability to extract useful information from them by manual means. This has brought into focus machine learning techniques like Inductive Logic Programming (ILP) that are able to extract human-comprehensible models for complex relational data. The price to pay is that ILP techniques are not efficient: they can be seen as performing a form of discrete optimisation, which is known to be computationally hard; and the complexity is usually some super-linear function of the number of examples. While little can be done to alter the theoretical bounds on the worst-case complexity of ILP systems, some practical gains may follow from the use of multiple processors. In this paper we survey the state-of-the-art on parallel ILP. We implement several parallel algorithms and study their performance using some standard benchmarks. The principal findings of interest are these: (1) of the techniques investigated, one that simply constructs models in parallel on each processor using a subset of data and then combines the models into a single one, yields the best results; and (2) sequential (approximate) ILP algorithms based on randomized searches have lower execution times than (exact) parallel algorithms, without sacrificing the quality of the solutions found.
Automatic sea floor characterization based on underwater acoustic image processing
Authors: Cristian Molder, Mircea Boscoianu, Mihai I. Stanciu, Iulian C. Vizitiu
Venue: WSEAS Transactions on Signal Processing (2008)

Automatic sea floor characterization is mainly based on the signal or image processing of the data acquired using an active acoustic system called sediment sonar. Each processing method suits a specific type of sonar, such as the monobeam, the multibeam, or the side-scan sonar. Most types of sonar offer a two dimensional view of the sea floor surface. Therefore, a high resolution image results which can be further analyzed. The inconvenient is that the sonar cannot view inside of the sea floor for a deeper analysis. Therefore, lower frequency acoustic systems are used for in-depth sea floor penetration (boomer, sparker, airguns or sub-bottom profilers). In this case, a mono dimensional signal results. Previous studies on the low-frequency systems are mainly based on the visual inspection by a geological human expert. To automatize this process, we propose the use of feature sets based on the transposed expert fuzzy reasoning. Two features are extracted, the first based on the sea floor contour and the second based on the sub-bottom sediment texture.
Studying Irreversible Transitions in a Model of Cell Cycle Regulation
Authors: Paolo Ballarini, Tommaso Mazza, Alida Palmisano, Attila Csikasz-Nagy
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Cells life follows a cycling behaviour which starts at cell birth and leads to cell division through a number of distinct phases. The transitions through the various cell cycle phases are controlled by a complex network of signalling pathways. Many cell cycle transitions are irreversible: once they are started they must reach completion. In this study we investigate the existence of conditions which lead to cases when irreversibility may be broken. Specifically, we characterise the elements of the cell cycle signalling network that are responsible for the irreversibility and we determine conditions for which the irreversible transitions may become reversible. We illustrate our results through a formal approach in which stochastic simulation analysis and model checking verification are combined. Through probabilistic model checking we provide a quantitative measure for the probability of irreversibility in the ''Start'' transition of the cell cycle.
Compilation and worst-case reaction time analysis for multithreaded Esterel processing
Authors: Marian Boldt, Claus Traulsen, Reinhard von Hanxleden
Venue: EURASIP Journal on Embedded Systems (2008)

The recently proposed reactive processing architectures are characterized by instruction set architectures (ISAs) that directly support reactive control fow including concurrency and preemption. These architectures provide efficient execution platforms for reactive synchronous programs; however, they do require novel compiler technologies, notably with respect to the handling of concurrency. Another key quality of the reactive architectures is that they have very predictable timing properties, which make it feasible to analyze their worst-case reaction time (WCRT). We present an approach to compile programs written in the synchronous language Esterel onto a reactive processing architecture that handles concurrency via priority-based multithreading. Building on this compilation approach, we also present a procedure for statically determining tight, safe upper bounds on the WCRT. Experimental results indicate the practicality of this approach, withWCRT estimates to be accurate within 22% on average.