ppxscal/embedding_network huggingface dataset:
Software Columbo: What can a bumbling, inarticulate Los Angeles cop teach us about effective communication?
Authors: Philip Yaffe
Venue: Ubiquity (2008)

Decade after decade, perhaps the most popular type of television program has been the detective story, the traditional "who dun it?", presumably because people enjoy being held in suspense. It is therefore instructive to note that one of the most popular TV detective shows of all time has no suspense to it whatsoever.
Deploying defeasible logic rule bases for the semantic web
Authors: Efstratios Kontopoulos, Nick Bassiliades, Grigoris Antoniou
Venue: Data Knowledge Engineering (2008)

Logic is currently the target of the majority of the upcoming efforts towards the realization of the Semantic Web vision, namely making the content of the Web accessible not only to humans, as it is today, but to machines as well. Defeasible reasoning, a rule-based approach to reasoning with incomplete and conflicting information, is a powerful tool in many Semantic Web applications. Despite its strong mathematical background, logic, in general, and defeasible logic, in particular, may overload the user with tons of additional complex semantic relationships among data and metadata of the Semantic Web. To this end, a comprehensible, visual representation of these semantic relationships (rules) would help users understand them and make more use of them. This paper presents VDR-DEVICE, a defeasible reasoning system, designed specifically for the Semantic Web environment. VDR-DEVICE is an integrated development environment for deploying and visualizing defeasible logic rule bases on top of RDF Schema ontologies. The system consists of a number of sub-components, which, though developed autonomously, are combined efficiently, forming a flexible framework. The system employs a defeasible reasoning system that supports direct importing and processing of RDF data and RDF Schema ontologies as well as a number of user-friendly rule base and ontology visualization modules.
On-Demand Medium Access in Multihop Wireless Networks with Multiple Beam Smart Antennas
Authors: Vivek Jain, Anurag Gupta, Dharma P. Agrawal
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

The paper presents a detailed discussion of various issues involved in designing a medium access control (MAC) protocol for multihop wireless networks with nodes employing multiple beam smart antennas. Multiple beam smart antennas can form several beams simultaneously and can initiate concurrent transmissions or receptions in them, thereby increasing the throughput of the bottleneck nodes. Traditional on-demand MAC protocols for omnidirectional and single beam directional antennas based on IEEE 802.11 DCF mechanism cannot take advantage of this unique capability of multiple beam antennas as they do not facilitate concurrent transmissions or receptions by a node. This paper introduces a novel protocol, hybrid medium access control (HMAC) that enables concurrent packet reception (CPR) and concurrent packet transmission (CPT) at a node equipped with multiple beam antennas and is backward compatible with IEEE 802.11 DCF. Simulation results show the superior performance of HMAC in most ad hoc scenarios. Moreover, in some sample topologies throughput of HMAC is close to the theoretical maximum. The paper also presents wireless mesh network architecture with heterogeneous antenna technologies and illustrates the advantages of employing multiple beam smart antennas and HMAC in such networks.
Refactoring and converting a TTCN-2 test suite
Authors: Thomas Dei&#x00df;
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2008)

When deploying TTCN-3&#x00a0;at Nokia, we converted two TTCN-2 test systems to TTCN-3. We explain to which extend we have been able to do the conversion automatically. The conversion tool used provided a syntactically and semantically correct conversion of the TTCN-2 code. We define some improvements made on the tool to increase readability and maintainability of the resulting code. We cover aspects of converting also the non-TTCN-2 parts and describe the experiences we made as a set of lessons learnt.
Memory Management for Real-Time Java: State of the Art
Authors: Filip Pizlo, Jan Vitek
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

The Real-time Specification for Java extends the Java platform to support real-time processing and introduces a region-based memory model, called scoped memory, which side-steps the Java garbage collector. While scoped memory succeeds in protecting real-time tasks from execution time jitter, practical experience points to shortcomings. This paper takes stock of the state of the art in memory management for RTSJ programs.
Constructive stabilization for quadratic input nonlinear systems
Authors: Jianghua Zhong, Daizhan Cheng, Xiaoming Hu
Venue: Automatica (Journal of IFAC) (2008)

In this paper stabilization of nonlinear systems with quadratic multi-input is considered. With the help of control Lyapunov function (CLF), a constructive parameterization of controls that globally asymptotically stabilize the system is proposed. Two different cases are considered. Firstly, under certain regularity assumptions, the feasible control set is parameterized, and continuous feedback stabilizing controls are designed. Then for the general case, piecewise continuous stabilizing controls are proposed. The design procedure can also be used to verify whether a candidate CLF is indeed a CLF. Several illustrative examples are presented as well.
Macromolecular Mechanochemistry
Authors: Cleopatra Vasiliu-Oprea, Florin Dan
Venue:  (2007)

This is part II of volume I of this book: The book is divided into the following sections: Polystage feature of mechanochemical process Polymer mechanochemistry deformation Mechano-degradation Influence of some factors on mechano-chemical degradation Effect of mechano-degradation on the structure and properties of polymers Polymer fracture Fracture of composite materials
Searching for the Great Chain of Being Using Google Print
Authors: Shai Ophir
Venue: The Information Society (2007)

Luciano Floridi coined the term "ideometry" in 1995, as a new approach for analyzing large corpora of text and finding hidden patterns. However, the technology for implementing this approach was lacking until now. With the arrival of Google Print, we now have a large-scale online library for research. On another front, Lovejoy argued in 1933 that ideas evolve from each other in a "Chain of Being" and that there is a small number of "unit ideas" that compose all great ideas through history. Since then there has been much debate about the pros and cons of this theory. Ideometry, using Google Print, may provide clarifying insights.
Boundary Control of Pdes: A Course on Backstepping Designs
Authors: Miroslav Krstic
Venue:  (2008)

This concise and highly usable textbook presents an introduction to backstepping, an elegant new approach to boundary control of partial differential equations (PDEs). Backstepping provides mathematical tools for converting complex and unstable PDE systems into elementary, stable, and physically intuitive "target PDE systems" that are familiar to engineers and physicists. The text s broad coverage includes parabolic PDEs; hyperbolic PDEs of first and second order; fluid, thermal, and structural systems; delay systems; PDEs with third and fourth derivatives in space; real-valued as well as complex-valued PDEs; stabilization as well as motion planning and trajectory tracking for PDEs; and elements of adaptive control for PDEs and control of nonlinear PDEs. It is appropriate for courses in control theory and includes homework exercises and a solutions manual that is available from the authors upon request. Audience: This book is intended for both beginning and advanced graduate students in a one-quarter or one-semester course on backstepping techniques for boundary control of PDEs. It is also accessible to engineers with no prior training in PDEs. Contents: List of Figures; List of Tables; Preface; Introduction; Lyapunov Stability; Exact Solutions to PDEs; Parabolic PDEs: Reaction-Advection-Diffusion and Other Equations; Observer Design; Complex-Valued PDEs: Schrodinger and Ginzburg Landau Equations; Hyperbolic PDEs: Wave Equations; Beam Equations; First-Order Hyperbolic PDEs and Delay Equations; Kuramoto Sivashinsky, Korteweg de Vries, and Other Exotic Equations; Navier Stokes Equations; Motion Planning for PDEs; Adaptive Control for PDEs; Towards Nonlinear PDEs; Appendix: Bessel Functions; Bibliography; Index
Isomorphism criterion for monomial graphs
Authors: Vasyl Dmytrenko, Felix Lazebnik, Raymond Viglione
Venue: Journal of Graph Theory (2005)

Let q be a prime power, &Fopf;q be the field of q elements, and k,&thinsp;m be positive integers. A bipartite graph G&thinsp;=&thinsp;Gq(k,&thinsp;m) is defined as follows. The vertex set of G is a union of two copies P and L of two-dimensional vector spaces over &Fopf;q, with two vertices (p1,&thinsp;p2) &isin; P and [ l1,&thinsp;l2] &isin; L being adjacent if and only if p2&thinsp;+&thinsp;l2&thinsp;=&thinsp;p <stack>1k</stack>l <stack>1m</stack>. We prove that graphs Gq(k,&thinsp;m) and Gq&prime;(k&prime;,&thinsp;m&prime;) are isomorphic if and only if q&thinsp;=&thinsp;q&prime; and &lcub;gcd&thinsp;(k,&thinsp;q&thinsp;-&thinsp;1), gcd&thinsp;(m,&thinsp;q&thinsp;-&thinsp;1)&rcub;&thinsp;=&thinsp;&lcub;gcd&thinsp;(k&prime;,&thinsp;q&thinsp;-&thinsp;1),gcd&thinsp;(m&prime;,&thinsp;q&thinsp;-&thinsp;1)&rcub; as multisets. The proof is based on counting the number of complete bipartite INFgraphs in the graphs. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 48: 322&ndash;328, 2005
Geometrical recovery of missing data for shape from motion
Authors: Sungshik Koh
Venue: International Journal of Computer Mathematics (2007)

This paper studies the geometrical recovery of an incomplete observation matrix for converting existing 2D video sequences to 3D content. In situations when converting previously recorded monoscopic video to 3D, several entries of the observation matrix have not been observed and other entries have been perturbed by the influence of noise. In such cases, there is no simple solution for SVD factorization for shape from motion. In this paper, a new recovery algorithm is proposed for recovering missing feature points, by minimizing the influence of noise, using iteratively geometrical correlations between a 2D observation matrix and 3D shape. Results in practical situations demonstrated with synthetic and real video sequences verify the efficiency and flexibility of the proposed method.
Incorporating oligopoly, CO2 emissions trading and green certificates into a power generation expansion model
Authors: Pedro Linares, Francisco Javier Santos, Mariano Ventosa, Luis Lapiedra
Venue: Automatica (Journal of IFAC) (2008)

This paper presents a generation expansion model for the power sector which incorporates several features that make it very interesting for application to current electricity markets: it considers the possible oligopolistic behavior of firms, and incorporates relevant policy instruments, carbon emissions trading and tradable green certificates. It combines powerful traditional tools related to the detailed system operation with techniques for modeling the economic market equilibrium and a formulation for the resolution of the emissions permit and tradable green certificates market equilibrium. The model is formulated as a Linear Complementarity Problem (LCP) which allows the optimization problem for each firm considering the power, carbon and green certificate markets to be solved simultaneously. The model has been implemented in GAMS. An application to the Spanish power system is also presented.
Simulation Based Evaluation of Methods for Improving Database Systems Efficiency
Authors: Iwona Pozniak-Koszalka, Dawid Pichen
Venue: Proceedings of the Third International Conference on Systems (2008)

In this paper, we present the designed and implemented experimentation system giving on to make more complex investigations in database problems area. The objective of experiments is to evaluate methods and algorithms for improving efficiency of database systems. We concentrate on software and hardware altering methods, including indexing, joining tables, manipulations relevant to a data buffer, library and a dictionary, using RAID arrays and hard drive issues. Some results of investigations are presented and discussed.
Extended Hausdorff distance for spatial objects in GIS
Authors: D. Min, L. Zhilin, C. Xiaoyong
Venue: International Journal of Geographical Information Science (2007)

Distance is a fundamental concept in spatial sciences. Spatial distance is a very important parameter to measure the relative positions between spatial objects and to indicate the degree of similarity between neighbouring objects. Indeed, spatial distance plays an important role in many areas such as neighbourhood analysis, structural similarity measure, image (or object) matching, clustering analysis, and so on. In this paper, existing computational models for the distance between spatial objects are evaluated and their problems pointed out; then, the concept of the Hausdorff distance is introduced as a metric indicator for different types of spatial objects. This distance is extended to a uniform representation by the introduction of the quantile, leading to the extended Hausdorff distance. Indeed, the so-called extended Hausdorff distance is, in fact, a kind of metric characterized by the minimum distance, the Hausdorff distance, and the median Hausdorff distance. The first two can be used for measuring the dispersion and the last one for measuring the central tendency of the distance distribution between spatial objects. A method termed the ε-buffer has been proposed for the computation of the median Hausdorff distance. Finally, potential applications are discussed.
Mimetic space – unravelled
Authors: Rajmil Fischman
Venue: Organised Sound (2008)

This article is a development, refinement and expansion of a paper presented at the Electroacoustic Music Studies Conference, 2007 (EMS07). It aims to provide a framework and terminology for the discussion, analysis and creation of music that articulates mimetic discourse and structure. In doing so, it also intends to enable parallel and complementary analytical approaches to those concerned with the aural and spatial aspects of musical articulation. It proposes the notion of multidimensional mimetic space, taking as its point of departure Emmerson's Language Grid (Emmerson 1986), and constructing additional axes representing compositional continua, similar in function to those proposed by spectromorphology (Smalley 1986), but applicable to mimetic material. The argument considers the mimetic implications of both purely acousmatic music and works that combine the acousmatic with live performance. After a brief consideration of the relationship between mimetic space and space-form (Smalley 2007a), the discussion concludes with a perspective on narrative as a component of mimetic space; providing an extensive discussion of issues pertinent to the idea of signifier space, which was originally introduced in the preceding paper.
Computer reconstruction of the coherent-mode structure of and optical field from the radiometric measurements data
Authors: Andrey S. Ostrovsky, Carolina Rickenstorff Parrao
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

The problem of computer reconstruction of the coherent-mode structure of an optical field with unknown cross-spectral density function is considered. It is proposed the alternative coherent-mode representation of a source which does not involve the solution of the Fredholm integral equation but may be obtained from the results of radiometric measurements. The basic concept is illustrated by the example of the alternative coherent-mode representation calculated for the 1-D Lambertian source.
Power-Aware Test Framework for Network-on-Chip
Authors: Byung-Gyu Ahn, Jun-Mo Jung, Jong-Wha Chong
Venue: Proceedings of the Third International Conference on Systems (2008)

In this paper, we propose the power-aware test framework for Network-on-Chip (NoC). First, the possibility of using embedded processor and on-chip network are introduced and evaluated with benchmark system to test the other embedded cores. Second, a new generation method of test pattern, which is called ‘don’t care mapping’, is presented to reduce the power consumption of on-chip network. The experimental results show that the power consumption is reduced up to 8% at the communication components.
International workshop on multicore software engineering (IWMSE 2008)
Authors: Victor Pankratius, Walter F. Tichy
Venue: Companion of the 30th international conference on Software engineering (2008)

We have reached a major turning point: microprocessor performance can no longer be improved by increasing clock frequencies; instead, higher performance will have to come from parallelism. As multi/manycore processors with multiple CPUs on a chip become standard and affordable for everyone, software engineers face the challenge of parallelizing applications of all sorts. However, compared to sequential applications, our repertoire of tools and methods for cost-effectively developing reliable, parallel applications is spotty. The mission of this workshop is to bring together researchers and practitioners with diverse backgrounds in order to advance the state of the art in software engineering for multi/manycore parallel applications. This is the first workshop specifically focusing on software engineering challenges of multi/manycore.
Parallel algorithms for higher-dimensional convex hulls
Authors: N. M. Amato
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We give fast randomized and deterministic parallel methods for constructing convex hulls in R/sup d/, for any fixed d. Our methods are for the weakest shared-memory model, the EREW PRAM, and have optimal work bounds (with high probability for the randomized methods). In particular, we show that the convex hull of n points in R/sup d/ can be constructed in O(log n) time using O(n log n+n/sup [d/2]/) work, with high probability. We also show that it can be constructed deterministically in O(log/sup 2/ n) time using O(n log n) work for d=3 and in O(log n) time using O(n/sup [d/2]/ log/sup c([d/2]-[d/2]/) n) work for d/spl ges/4, where c>0 is a constant which is optimal for even d/spl ges/4. We also show how to make our 3-dimensional methods output-sensitive with only a small increase in running time. These methods can be applied to other problems as well.
Extraction de connaissances dans les r&eacute;seaux ad hoc inter-v&eacute;hicules
Authors: Bruno Defude, Thierry Delot, Jose-Luis Zechinelli Martini, Nicolas Cenerario, Sergio Ilarri
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

Our work focus on data management in Vehicular Ad Hoc Networks (VANETs). Many pieces of information may be exchanged in such networks, for instance to warn drivers when a potentially dangerous event arises (accident, emergency braking, obstacle in the road, etc.) or to try to assist them (available parking spaces, traffic congestions, real-time traffic conditions, etc.). Existing systems only use the data exchanged to warn the driver. Then, the data is considered obsolete and is deleted. In this paper, we rather propose to aggregate the data once it becomes obsolete. Our objective is to produce additional knowledge to be used by drivers when no relevant data has been communicated by neighbouring vehicles. For example, it becomes so possible to dynamically detect potentially dangerous road segments or to determine the areas where the probability to find an available parking space is high when none has been received.
Differential games of N players in stochastic systems with controlled diffusion terms
Authors: Shang Quang Tun, Sung Xung Li
Venue: Automation and Remote Control (2008)

Differential Games of N players defined by stochastic systems with controlled diffusion terms are considered. Necessary conditions of equilibrium strategy are obtained. These conditions are specified for the linear quadratic differential game of N players in terms of differential Riccati equation for program and positional equilibrium situations.
A mobile SIP: IP mobility support using SIP
Authors: Chai Kiat Yeo, Bu Sung Lee, Feng Zhong
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Mobile IP has been around for some time but has yet to make a major impact. This is due partly to the infrastructure set-up required. In this paper, we describe Mobile SIP (MSIP), which uses the widely deployed SIP server together with an innovative IP-to-IP address mapping scheme, to provide terminal mobility. From our analysis, we show that MSIP is much more efficient than Mobile IP in terms of hop count as well as overhead.
A telecommunications web services platform for third party network access and SOA-based service delivery
Authors: Eric W. Burger, Sharath Rajasekar, Phelim O'Doherty, Anders Lundqvist, Thomas Grönberg
Venue: Proceedings of the 2007 Workshop on Middleware for next-generation converged networks and applications (2007)

This paper describes a case study in the use of a network gatekeeper we developed to enable a telecommunications Services-Oriented Architecture for the purposes of exposing a service provider network to third parties. Service provider revenue growth will inevitably be software-centric, with the move to software-based systems in the Next Generation Network. Web Services and SOA are quickly becoming a critical component of software middleware to address this need. Initially proven in the IT enterprise space, service providers are adopting SOA and Web Services. For example, at the edge of their networks, service providers are adopting Telecom Web Services for third party access. In the core of their networks, they are adopting IMS Application Server-hosted services. In this paper, we discuss the specific requirements and architectural aspects for both scenarios and point to the applicable trends that impact this domain. We illustrate how Web Services and SOA serve as the foundation for reliable services that can be built more efficiently than with traditional approaches without compromising reliability and manageability.
A segmentation-based approach for temporal analysis of software version repositories
Authors: Harvey Siy, Parvathi Chundi, Daniel J. Rosenkrantz, Mahadevan Subramaniam
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2008)

Time series segmentation is a promising approach to discover temporal patterns from time-stamped numeric data. A novel approach to apply time series segmentation to discern temporal information from software version repositories is proposed. Data from such repositories, both numeric and non-numeric, are represented as item-set time series data. A dynamic programming algorithm for optimal segmentation is presented. The algorithm automatically produces a compacted item-set time series that can be analyzed to identify temporal patterns. The effectiveness of the approach is illustrated by analyzing version control repositories of several open-source projects to identify time-varying patterns of developer activity. The experimental results show that the segmentation algorithm produces segments that capture meaningful information and is superior to the information content obtained by arbitrarily segmenting software history into regular time intervals. Copyright &copy; 2008 John Wiley & Sons, Ltd. A preliminary version [1] of this paper appears in the proceedings of the 2007 International Conference On Software Maintenance (ICSM '07), Paris, France.