ppxscal/embedding_network huggingface dataset:
On Lazy Commutation
Authors: Nachum Dershowitz
Venue: Languages: From Formal to Natural: Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday (2009)

We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating well-foundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used in termination proofs.
An analytical model for a GPU architecture with memory-level and thread-level parallelism awareness
Authors: Sunpyo Hong, Hyesoon Kim
Venue: ACM SIGARCH Computer Architecture News (2009)

GPU architectures are increasingly important in the multi-core era due to their high number of parallel processors. Programming thousands of massively parallel threads is a big challenge for software engineers, but understanding the performance bottlenecks of those parallel programs on GPU architectures to improve application performance is even more difficult. Current approaches rely on programmers to tune their applications by exploiting the design space exhaustively without fully understanding the performance characteristics of their applications. To provide insights into the performance bottlenecks of parallel applications on GPU architectures, we propose a simple analytical model that estimates the execution time of massively parallel programs. The key component of our model is estimating the number of parallel memory requests (we call this the memory warp parallelism) by considering the number of running threads and memory bandwidth. Based on the degree of memory warp parallelism, the model estimates the cost of memory requests, thereby estimating the overall execution time of a program. Comparisons between the outcome of the model and the actual execution time in several GPUs show that the geometric mean of absolute error of our model on micro-benchmarks is 5.4% and on GPU computing applications is 13.3%. All the applications are written in the CUDA programming language.
On a graph property generalizing planarity and flatness
Authors: Hein van der Holst, Rudi Pendavingh
Venue: Combinatorica (2009)

We introduce a topological graph parameter &#x03c3;(G), defined for any graph G. This parameter characterizes subgraphs of paths, outerplanar graphs, planar graphs, and graphs that have a flat embedding as those graphs G with &#x03c3;(G)&#x2264;1,2,3, and 4, respectively. Among several other theorems, we show that if H is a minor of G, then &#x03c3;(H)&#x2264;&#x03c3;(G), that &#x03c3;(K n )=n&#x2212;1, and that if H is the suspension of G, then &#x03c3;(H)=&#x03c3;(G)+1. Furthermore, we show that &#x00b5;(G)&#x2264;&#x03c3;(G) + 2 for each graph G. Here &#x00b5;(G) is the graph parameter introduced by Colin de Verdi&#x00e8;re in [2].
A Mechanism of Active Services for Network based on UCL
Authors: Ling Xing, Jianguo Ma, Youping Li, Zhiwen Liu
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

Uniform Content Locator (UCL) technology builds a bridge among writers, editors and readers for better understanding, which is a foundation for data processing such as receiving quickly, serving intelligently and actively. Besides introducing the concept of UCL, its key technologies are also discussed. Based on the content comprehension of network information, the describable system for information resource is established. After that, the method of automatic information indexing and the mechanism of active services for network based on UCL are brought forward, which can provide users active services intelligently and personally.
CARES: a ranking-oriented CADAL recommender system
Authors: Chenxing Yang, Baogang Wei, Jiangqin Wu, Yin Zhang, Liang Zhang
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

A recommender system is useful for a digital library to suggest the books that are likely preferred by a user. Most recommender systems using collaborative filtering approaches leverage the explicit user ratings to make personalized recommendations. However, many users are reluctant to provide explicit ratings, so ratings-oriented recommender systems do not work well. In this paper, we present a recommender system for CADAL digital library, namely CARES, which makes recommendations using a ranking-oriented collaborative filtering approach based on users' access logs, avoiding the problem of the lack of user ratings. Our approach employs mean AP correlation coefficients for computing similarities among users' implicit preference models and a random walk based algorithm for generating a book ranking personalized for the individual. Experimental results on real access logs from the CADAL web site show the effectiveness of our system and the impact of different values of parameters on the recommendation performance.
Spectral identification of ozone-damaged pine needles
Authors: A. V. Di Vittorio, G. S. Biging
Venue: International Journal of Remote Sensing (2009)

Needles were collected from ponderosa and Jeffrey pine trees at three sites in the Sierra Nevada, and were assembled into 504 samples and grouped according to five dominant live needle conditions-green, winter fleck, sucking insect damage, scale insect damage, and ozone damage-and a random mixture. Reflectance and transmittance measurements of abaxial and adaxial surfaces were obtained at ca 0.3 nm spectral resolution from 400-800 nm, and binned to simulate Airborne Visible and Infrared Imaging Spectrometer (AVIRIS) data. There were no significant differences in optical properties between the two surfaces. Ozone-damaged needles were collected from Jeffrey pine trees at one site, and exhibited significantly different (family-wise α = 0.01) reflectance and transmittance signatures-and significantly different signature slopes-at both spectral resolutions, from green and winter fleck needles from the same site. Ozone-damaged needles had significantly different (family-wise α = 0.01) abaxial surface reflectance and reflectance slope signatures from all other groups of needles, at both spectral resolutions. In comparison with three chlorophyll reflectance indices, a new red fall index (RFI) provides high classification accuracies for ozone-damaged and non-ozone-damaged pine needles (overall acc. = 94%; κ = 59%). Thus, ozone-damaged Jeffrey pine needles have a unique spectral signature in relation to dominant needle conditions of ponderosa and Jeffrey pine trees.
Spinning relations: high-speed networks for distributed join processing
Authors: Philip W. Frey, Romulo Goncalves, Martin Kersten, Jens Teubner
Venue: Proceedings of the Fifth International Workshop on Data Management on New Hardware (2009)

By leveraging modern networking hardware (RDMA-enabled network cards), we can shift priorities in distributed database processing significantly. Complex and sophisticated mechanisms to avoid network traffic can be replaced by a scheme that takes advantage of the bandwidth and low latency offered by such interconnects. We illustrate this phenomenon with cyclo-join, an efficient join algorithm based on continuously pumping data through a ring-structured network. Our approach is capable of exploiting the resources of all CPUs and distributed main-memory available in the network for processing queries of arbitrary shape and datasets of arbitrary size.
GUPTDSS: Grid Based Urban Public Transport Decision Support System
Authors: Yu Wang, Haigang Song, Liu Hong, Xueguang Chen
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

The Grid-based Urban Public Transport Decision Support System (GUPTDSS) is developed to establish an open high-level information environment to support transport information management and decision-making for solving traffic problems. GUPTDSS is characterized with stronger computing and resource sharing abilities to cope with the problems that the traditional Advanced Public Transport Systems could hardly resolve, such as large-scale transport data storage, high-performance transport simulation, and cross-domain cooperation etc. This paper presents an overview of services provided by the developed GUPTDSS and the architecture in which they fit. A set of system methods are discussed as well, including semantic representation of metadata model, distributed data management, and safety strategy etc. A case study is conducted to validate this architecture.
Decoupled DIMM: building high-bandwidth memory system using low-speed DRAM devices
Authors: Hongzhong Zheng, Jiang Lin, Zhao Zhang, Zhichun Zhu
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

The widespread use of multicore processors has dramatically increased the demands on high bandwidth and large capacity from memory systems. In a conventional DDR2/DDR3 DRAM memory system, the memory bus and DRAM devices run at the same data rate. To improve memory bandwidth, we propose a new memory system design called decoupled DIMM that allows the memory bus to operate at a data rate much higher than that of the DRAM devices. In the design, a synchronization buffer is added to relay data between the slow DRAM devices and the fast memory bus; and memory access scheduling is revised to avoid access conflicts on memory ranks. The design not only improves memory bandwidth beyond what can be supported by current memory devices, but also improves reliability, power efficiency, and cost effectiveness by using relatively slow memory devices. The idea of decoupling, precisely the decoupling of bandwidth match between memory bus and a single rank of devices, can also be applied to other types of memory systems including FB-DIMM. Our experimental results show that a decoupled DIMM system of 2667MT/s bus data rate and 1333MT/s device data rate improves the performance of memory-intensive workloads by 51% on average over a conventional memory system of 1333MT/s data rate. Alternatively, a decoupled DIMM system of 1600MT/s bus data rate and 800MT/s device data rate incurs only 8% performance loss when compared with a conventional system of 1600MT/s data rate, with 16% reduction on the memory power consumption and 9% saving on memory energy.
Flight dynamics for UAV formations
Authors: Teodor-Viorel Chelaru, Valentin Pana, Adrian Chelaru
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

The purpose of this paper is to describe the flight of an Unmanned Aerial Vehicles (UAV) formation by using 6 degrees of freedom (6 DOF) models. The problem of flight formation will be approached in a simple manner, by using 3 DOF models, as well as using the complex equations that describe the movement of the 6 DOF for UAV. This theoretical development allows us to define a control structure based on direct commands, which is useful in practical applications. The work will present and will analyze the calculus results for each developed solutions. The novelty of this paper consists in definition and test of some practical solutions for an algorithm that can control an UAV formation. This algorithm allows descripting the flight of a single UAV, as well as the entire formation. The conclusions will focus the practical possibility of implementing such algorithm on a UAV formation.
Facebook as an academic tool for ICT lecturers
Authors: Conja Colete, Carina de Villiers, Sumarie Roodt
Venue: Proceedings of the 2009 Annual Conference of the Southern African Computer Lecturers' Association (2009)

In this paper, we investigate the use of Facebook as an academic tool by lecturers in Information Systems and Computer Science departments in Southern Africa. Students' methods of engagement are very different than it was many years ago and the way students communicate and interact have changed because of new technologies. We found that very few lecturers are exploring the use of one such new technology, namely Facebook, to enhance their teaching.
A re-examination on features in regression based approach to automatic MT evaluation
Authors: Shuqi Sun, Yin Chen, Jufeng Li
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Student Research Workshop (2008)

Machine learning methods have been extensively employed in developing MT evaluation metrics and several studies show that it can help to achieve a better correlation with human assessments. Adopting the regression SVM framework, this paper discusses the linguistic motivated feature formulation strategy. We argue that "blind" combination of available features does not yield a general metrics with high correlation rate with human assessments. Instead, certain simple intuitive features serve better in establishing the regression SVM evaluation model. With six features selected, we show evidences to support our view through a few experiments in this paper.
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata
Authors: Christian Choffrut, Serge Grigorieff
Venue: Theoretical Computer Science (2009)

We consider the first-order theory of the free infinitely generated monoid with the usual predicates ''prefix'' and ''equal length'' along with the predicate ''equal last letter''. The associated definable relations are related to the algebras of relations recognized by different types of multitape automata which are natural extensions of the famous Rabin-Scott multitape automata and the synchronous automata. We investigate these classes of automata and solve decision issues concerning them.
Designing World Closures for Knowledge-Based System Engineering
Authors: Krzysztof Goczyła, Teresa Grabowska, Wojciech Waloszek, Michał Zawadzki
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

With development of knowledge-based components software engineers face new challenges to integrate knowledge-based components with other ones. This task requires defining a communication language between components and a process of interchanging information. The paper focuses on the conversation between knowledge-based and data-based components. A language to define Data View Manifest, describing data required by a data-based component, is specified. Moreover, the way of transforming required knowledge into data by a knowledge-based component is defined.
Optimal partial questioning in large dimensional AHP
Authors: Michele Fedrizzi, Silvio Giove
Venue: Proceeding of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008 (2009)

In this paper we propose a flexible method for optimally choosing and sequencing in time a subset of pairwise comparisons between the alternatives in large--dimensional AHP problems. Two criteria are taken into account in defining the choice rule: the fair involvement of all the alternatives in the pairwise comparisons and the consistency of the elicited judgements. The combination of the two criteria guarantees the best reliability of the already collected information. The method indicates at each step the two alternatives to be next compared and stops the process taking into account both the reliability of the already elicited judgements and the necessity of bounding the potentially large number of judgements to be submitted to the decision maker.
Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Authors: Partha Bhowmick, Bhargab B. Bhattacharya
Venue: Fundamenta Informaticae (2009)

There are several algorithms for digitization of a real disc (circle) to derive a digital disc, and also for finding the real disc corresponding to a digital disc. However, the correspondence of a digital disc with a regular polygon in the real plane is not well studied. This paper presents some theories and related experiments on setting the correspondence from a digital disc to its polygonal cover in the real plane. For an ideal regular polygon covering a digital disc, all the grid points of the digital disc should lie on and inside the polygon, and vice versa. That an ideal regular polygon corresponding to a digital disc is possible for some of the digital discs, especially for the ones having smaller radii, is shown. Further, for a disc whose ideal regular polygon is not possible, an approximate polygon, tending to the ideal one, is possible, in which the error of approximation can be controlled by the number of vertices of the approximate polygon. These (ideal or approximate) polygonal covers of digital discs have several applications in many problems of point set pattern matching. We have reported the conditions under which an ideal regular polygon always exists corresponding to a digital disc, and the conditions under which the existence of an ideal regular polygon becomes uncertain. Experimental results have been given to demonstrate the possibilities of approximation and the trade-off in terms of error versus the number of vertices in the approximate polygon.
LKIF Core: Principled Ontology Development for the Legal Domain
Authors: Rinke Hoekstra, Joost Breuker, Marcello Di Bello, Alexander Boer
Venue: Proceeding of the 2009 conference on Law, Ontologies and the Semantic Web: Channelling the Legal Information Flood (2009)

In this paper we describe a legal core ontology that is part of the Legal Knowledge Interchange Format: a knowledge representation formalism that enables the translation of legal knowledge bases written in different representation formats and formalisms. A legal (core) ontology can play an important role in the translation of existing legal knowledge bases to other representation formats, in particular as the basis for articulate knowledge serving. This requires that the ontology has a firm grounding in commonsense and is developed in a principled manner. We describe the theory and methodology underlying the LKIF core ontology, compare it with other ontologies, introduce the concepts it defines, and discuss its use in the formalisation of an EU directive.
A live storage migration mechanism over wan and its performance evaluation
Authors: Takahiro Hirofuchi, Hidemoto Nakada, Hirotaka Ogawa, Satoshi Itoh, Satoshi Sekiguchi
Venue: Proceedings of the 3rd international workshop on Virtualization technologies in distributed computing (2009)

Live migration of virtual machines is a key technology for the next generation of IaaS cloud services, contributing to dynamic portability and mobility of VM-based services among datacenters. The practical use of live migration, however, is still limited inside a single datacenter. In WAN environments, network latencies cause inevitable I/O performance degradation of remotely-shared storage between source and destination sites; which is required to continue disk access of VMs before/after live migration. In our previous work, we proposed a transparent, relocatable I/O mechanism for VM migration, which enables VM disk images to be completely migrated to remote nodes without any modification of virtual machine monitors. In this paper, we present detailed performance evaluation of the proposed system, emulating a realistic WAN environment between remote datacenters. Experiments showed the proposed system achieved feasible I/O performance for various workloads including I/O intensive applications. Its background copy mechanism efficiently prefetches not-yet-cached blocks by exploiting the available bandwidth of WAN, thereby minimizing temporary performance degradation of the migrating VM system.
Bayesian model checking for multivariate outcome data
Authors: Catherine M. Crespi, W. John Boscardin
Venue: Computational Statistics Data Analysis (2009)

Bayesian models are increasingly used to analyze complex multivariate outcome data. However, diagnostics for such models have not been well developed. We present a diagnostic method of evaluating the fit of Bayesian models for multivariate data based on posterior predictive model checking (PPMC), a technique in which observed data are compared to replicated data generated from model predictions. Most previous work on PPMC has focused on the use of test quantities that are scalar summaries of the data and parameters. However, scalar summaries are unlikely to capture the rich features of multivariate data. We introduce the use of dissimilarity measures for checking Bayesian models for multivariate outcome data. This method has the advantage of checking the fit of the model to the complete data vectors or vector summaries with reduced dimension, providing a comprehensive picture of model fit. An application with longitudinal binary data illustrates the methods.
SAscha: Supporting the Italian Public Cooperation System with a Rich Internet Application for Semantic Web Services
Authors: Alessandro Adamou
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

We present SAscha, a web browser-based application for authoring semantic Web Service descriptions by the SAWSDL standard. Even though it was conceived in a specific real domain scenario, i.e. the Italian framework for service interoperability, it is in fact a general-purpose SAWSDL tool that showcases a singular feature set including, but not limited to, simplicity of use, availability as an infrastructural service and XML Schema support. Although upper-level ontologies are expected to be stored in an ad-hoc repository, SAscha allows for OWL ontologies being stored anywhere locally or on the web. 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
Statistics for Innovation: Statistical Design of "Continuous" Product Innovation, 1st edition
Authors: Pasquale Erto
Venue:  (2009)

The objective of this book is to illustrate statistical methodologies that incorporate physical and numerical experiments and that allow one to schedule and plan technological innovation, similar to any other productive activity. This methodology should be implemented through a structured procedure aimed at reducing the high rate of commercial failure characterizing actual innovation processes. In fact, it is well known that: i) The rate of commercial failure of a innovative idea is very high (9094 out of 100 proposals for innovation undergo substantial failure in the EU and in the USA). ii) Low reliability in the long run and sensitivity to usage conditions are the factors that determine the failure of the innovation. The definition of an iterative design activity is an objective that can be reached by subdividing the complex innovation process into "short" steps in experimental statistics research. The approach adopted to analyze customer needs and the tools used to reduce unwanted variability form the framework for the statistical design of "continuous" product innovation. Starting from the observation that product innovation is achieved when a "quality" that is able to satisfy a new customer need is conferred on the product and survives over real operating conditions and time, this book illustrates the operative steps required to perform the whole innovation process iteratively.
Possibilistic networks for information retrieval
Authors: M. Boughanem, A. Brini, D. Dubois
Venue: International Journal of Approximate Reasoning (2009)

This paper proposes an information retrieval (IR) model based on possibilistic directed networks. The relevance of a document w.r.t a query is interpreted by two degrees: the necessity and the possibility. The necessity degree evaluates the extent to which a given document is relevant to a query, whereas the possibility degree evaluates the reasons of eliminating irrelevant documents. This new interpretation of relevance led us to revisit the term weighting scheme by explicitly distinguishing between informative and non-informative terms in a document. Experiments carried out on three standard TREC collections show the effectiveness of the model.