Entropy and set covering

If the set covering constraints are Ax ? 1 and x_j ∈ {0,1}, the prior probability that the jth subset participates in an optimal covering (independently of subset costs) is shown to be given by the principal row eigenvector of A¹A, where $\text{a}{}_{\mathrm{ji}}{}^1\text{= 1 ? a}{}_{\mathrm{ij}}$. These probabilities lead to new and interesting objective functions, which are shown to be equivalent to cross entropy or weighted cross-entropy. The probabilities can also be used to obtain better bounds for heuristic solutions to optimal covering and set representation problems.     

Real exhibitions in a virtual museum

When creating a virtual environment open to the public a number of challenges have to be addressed. The equipment has to be chosen carefully in order to be be able to withstand hard everyday usage, and the application has not only to be robust and easy to use, but has also to be appealing to the user, etc. The current paper presents findings gathered from the creation of a multi-thematic virtual museum environment to be offered to visitors of real world museums. A number of design and implementation aspects are described along with an experiment designed to evaluate alternative approaches for implementing the navigation in a virtual museum environment. The paper is concluded with insights gained from the development of the virtual museum and portrays future research plans.

Comparing spatial clustering tests based on rare to common spatial events

This paper compares the performance of three clustering tests––Rogerson R, Getis-Ord G and Lin-Zeng LR-T––using a range of simulated sample distributions from rare to common spatial events. It is shown that all of the tests are sensitive to high value clustering, and all but G are sensitive to low-value clustering. For a spatial pattern exhibiting negative spatial autocorrelation, R is likely to associate the autocorrelation with clustering when sample size is greater than 20, while LR-T and G are unlikely to accept any presence of negative autocorrelation as clustering.     

Spectral element solutions for the PN neutron transport equations

This paper discusses the application of the Legendre spectral element method to the steady one-velocity P_N equations describing neutron transport in a one-dimensional heterogeneous slab. Emphasis is put on the implementation of the method. Some key elements related to its efficiency are analyzed to prepare further developments in higher dimensions to evaluate benchmark solutions to the simplified P_N equations.     

Imagining a non-biological machine as a legal person

As non-biological machines come to be designed in ways which exhibit characteristics comparable to human mental states, the manner in which the law treats these entities will become increasingly important both to designers and to society at large. The direct question will become whether, given certain attributes, a non-biological machine could ever be viewed as a “legal person.” In order to begin to understand the ramifications of this question, this paper starts by exploring the distinction between the related concepts of “human,” “person,” and “property.” Once it is understood that person in the legal sense can apply to a non-biological entity such as a corporation, the inquiry then goes on to examine the folk psychology view of intentionality and the concept of autonomy. The conclusion reached is that these two attributes can support the view that a non-biological machine, at least in theory, can be viewed as a legal person.

---

Model Checking for a Class of Weighted Automata

A large number of different model checking approaches has been proposed during the last decade. The different approaches are applicable to different model types including untimed, timed, probabilistic and stochastic models. This paper presents a new framework for model checking techniques which includes some of the known approaches and enlarges the class of models to which model checking can be applied to the general class of weighted automata. The approach allows an easy adaption of model checking to models which have not been considered yet for this purpose. Examples for those new model types for which model checking can be applied are max/plus or min/plus automata which are well established models to describe different forms of dynamic systems and optimization problems. In this context, model checking can be used to verify temporal or quantitative properties of a system. The paper first presents briefly our class of weighted automata, as a very general model type. Then Valued Computational Tree Logic (CTL) is introduced as a natural extension of the well known branching time logic CTL. Afterwards, algorithms to check a weighted automaton with respect to a CTL) is introduced as a natural extension of the well known branching time logic CTL. Afterwards, algorithms to check a weighted automaton with respect to a CTL formula are presented. As a last result, bisimulation equivalence is extended to weighted automata and CTL$.     

Embedding fault-free cycles in crossed cubes with conditional link faults

The crossed cube, which is a variation of the hypercube, possesses some properties that are superior to those of the hypercube. In this paper, we show that with the assumption of each node incident with at least two fault-free links, an n-dimensional crossed cube with up to 2n−5 link faults can embed, with dilation one, fault-free cycles of lengths ranging from 4 to 2 ⁿ . The assumption is meaningful, for its occurrence probability is very close to 1, and the result is optimal with respect to the number of link faults tolerated. Consequently, it is very probable that algorithms executable on rings of lengths ranging from 4 to 2 ⁿ can be applied to an n-dimensional crossed cube with up to 2n−5 link faults.

Detection of Redundant Code Using R 2 D 2

We present the R ² D ² redundancy detector. R ² D ² identifies redundant code fragments in large software systems written in Lisp. For each pair of code fragments, R ² D ² uses a combination of techniques ranging from syntax-based analysis to semantics-based analysis, that detects positive and negative evidences regarding the redundancy of the analyzed code fragments. These evidences are combined according to a well-defined model and sufficiently redundant fragments are reported to the user. R ² D ² explores several techniques and heuristics to operate within reasonable time and space bounds and is designed to be extensible.     

Optimum Control of a Certain Class of Servomechanism†

Linear control systems governed by the vector matrix differential equation x = A x + B u have been considered. It has been shown how to find the optimum control u so that the system, starting from an initial position x(0), is steered to a state specifying the first p coordinates of the system in time t _o fixed in advance, the values attained by the (n—p) coordinates being immaterial, where n is the dimension of the system. The optimization considered here is with regard to the norm of u supposed to belong to L _m E _r space.     

Graph-Theoretical Analysis of the Swiss Road and Railway Networks Over Time

Recent research of complex networks has significantly contributed to the understanding how networks can be classified according to its topological characteristics. However, transport networks attracted less attention although their importance to economy and daily life. In this work the development of the Swiss road and railway network during the years 1950–2000 is investigated. The main difference between many of the recently studied complex networks and transport networks is the spatial structure. Therefore, some of the well-established complex network measures may not be applied directly to characterise transport networks but need to be adapted to fulfil the requirements of spatial networks. Additionally, new approaches to cover basic network characteristics such as local network densities are applied. The focus of the interest hereby is always not only to classify the transport network but also to provide the basis for further applications such as vulnerability analysis or network development. It could be showed that the proposed measures are able to characterise the growth of the Swiss road network. To proof the use of local density measures to explain the robustness of a network however needs further research.

SocioTelematics: Harnessing social interaction-relationships in developing automotive applications

In a cooperative convoy, a vehicle interacts with other vehicles, service providers and infrastructure systems to make the travel safe and convenient. Through these interactions a vehicle can share its domain-specific information–acquired from service providers and infrastructure–with other vehicles in the convoy. Such interactions are subject to defined agreements and constraints between the entities (i.e., vehicle to vehicle, vehicle to service provider, and so on), which we refer as (social) interaction-relationships. Such relationships, however, may need to adapt with the changes of requirements. Also a driver may want to automate certain interactions to reduce distraction during driving. A cooperative convoy telematics system should support collaboration (i.e., allow drivers to share specific travel information) and coordination (i.e., allow drivers to automate interactions), and be able to adapt to cope with the changes of requirements.In this paper, we address these issues and demonstrate how our social interaction-relationships modelling technique can be exploited to develop a telematics system, called SocioTelematics, providing such functionalities. This system allows collaboration and coordination preferences explicitly specified and updated to cope with the changes. In particular, our service oriented implementation enhances adaptability of the system, making it easily deployable and changeable. We have implemented a prototype system based on a client–server architecture where the client application is developed for Android and the server is running on the Amazon cloud. The system’s performance and resource consumption were quantified using real life experiments that show the feasibility of our approach.     

A decomposition of Moran's I for clustering detection

The test statistics I_h, I_c, and I_n are derived by decomposing the numerator of the Moran's I test for high-value clustering, low-value clustering, and negative autocorrelation, respectively. Formulae to compute the means and variances of these test statistics are derived under a random permutation test scheme, and the p-values of the test statistics are computed by asymptotic normality. A set of simulations shows that test statistic I_h is likely to be significant only for high-value clustering, test statistic I_c is likely to be significant only for low-value clustering, and test statistic I_n is likely to be significant only for negatively correlated spatial structures. These test statistics were used to reexamine spatial distributions of sudden infant death syndrome in North Carolina and the pH values of streams in the Great Smoky Mountains. In both analyses, low-value clustering and high-value clustering were shown to exit simultaneously.     

Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities

We present a technique for inducing functional programs from few, well chosen input/output-examples (I/O-examples). Potential applications for automatic program or algorithm induction are to enable end users to create their own simple programs, to assist professional programmers, or to automatically invent completely new and efficient algorithms. In our approach, functional programs are represented as constructor term rewriting systems (CSs) containing recursive rules. I/O-examples for a target function to be implemented are a set of pairs of terms (F(i_i),o_i) meaning that F(i_i)—denoting application of function F to input i_i—is rewritten to o_i by a CS implementing the function F. Induction is based on detecting syntactic regularities between example terms. In this paper we present theoretical results and describe an algorithm for inducing CSs over arbitrary signatures/data types which consist of one function defined by an arbitrary number of rules with an arbitrary number of non-nested recursive calls in each rule. Moreover, we present empirical results based on a prototypical implementation.     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.     

Agent-based multimedia presentation and adaptation service

In this paper, we aim to provide adaptive multimedia services especially video ones to end-users in an efficient and secure manner. Users moving outside the office should be able to maintain an office-like environment at their current locations. First, the agents within our proposed architecture negotiate the different communication and interaction factors autonomously and dynamically. Moreover, we needed to develop a user agent in addition to service and system agents that could negotiate the requirements and capabilities at run time to furnish best possible service results. Thus we designed and integrated a video indexing and key framing service within our overall agent-based architecture. We integrated this video indexing and content-based analysis service to adapt the video content according to run time conditions. We designed a video XML schema to validate the media content out of this multimedia service according to specific requirements and features, as we will describe later.

An effective and efficient parallel approach for random graph generation over GPUs

The widespread usage of random graphs   has been highlighted in the context of database applications for several years. This because such data structures turn out to be very useful in a large family of database applications ranging from simulation to sampling, from analysis of complex networks to study of randomized algorithms, and so forth. Amongst others, Erd?s–Rényi _Γv,p${\Gamma }_{v,p}$ is the most popular model to obtain and manipulate random graphs. Unfortunately, it has been demonstrated that classical algorithms for generating Erd?s–Rényi based random graphs do not scale well in large instances and, in addition to this, fail to make use of the parallel processing capabilities of modern hardware. Inspired by this main motivation, in this paper we propose and experimentally assess a novel parallel algorithm for generating random graphs under the Erd?s–Rényi model that is designed and implemented in a Graphics Processing Unit (GPU), called PPreZER. We demonstrate the nice amenities due to our solution via a succession of several intermediary algorithms, both sequential and parallel, which show the limitations of classical approaches and the benefits due to the PPreZER algorithm. Finally, our comprehensive experimental assessment and analysis brings to light a relevant average speedup gain of PPreZER over baseline algorithms.     

Direct and Indirect Estimation of Leaf Area Index,fAPAR, and Net Primary Production of Terrestrial Ecosystems

A primary objective of the Earth Observing System (EOS) is to develop and validate algorithms to estimate leaf area index (L), fraction of absorbed photosynthetically active radiation (f_APAR), and net primary production (NPP) from remotely sensed products. These three products are important because they relate to or are components of the metabolism of the biosphere and can be determined for terrestrial ecosystems from satellite-borne sensors. The importance of these products in the EOS program necessitates the need to use standard methods to obtain accurate ground truth estimates of L, f_APAR, and NPP that are correlated to satellite-derived estimates. The objective of this article is to review direct and indirect methods used to estimate L, f_APAR, and NPP in terrestrial ecosystems. Direct estimates of L, biomass, and NPP can be obtained by harvesting individual plants, developing allometric equations, and applying these equations to all individuals in the stand. Using non-site-specific allometric equations to estimate L and foliage production can cause large errors because carbon allocation to foliage is influenced by numerous environmental and ecological factors. All of the optical instruments that indirectly estimate L actually estimate “effective” leaf area index (L_E) and underestimate L when foliage in the canopy is nonrandomly distributed (i.e., clumped). We discuss several methods, ranging from simple to complex in terms of data needs, that can be used to correct estimates of L when foliage is clumped. Direct estimates of above-ground and below-ground net primary production (NPP_A and NPP_B, respectively) are laborious, expensive and can only be carried out for small plots, yet there is a great need to obtain global estimates of NPP. Process models, driven by remotely sensed input parameters, are useful tools to examine the influence of global change on the metabolism of terrestrial ecosystems, but an incomplete understanding of carbon allocation continues to hamper development of more accurate NPP models. We summarize carbon allocation patterns for major terrestrial biomes and discuss emerging allocation patterns that can be incorporated into global NPP models. One common process model, light use efficiency or epsilon model, uses remotely sensed f_APAR, light use efficiency (LUE) and carbon allocation coefficients, and other meteorological data to estimates NPP. Such models require reliable estimates of LUE. We summarize the literature and provide LUE coefficients for the major biomes, being careful to correct for inconsistencies in radiation, dry matter and carbon allocation units.     

Mapping of heavy metal pollution in stream sediments using combined geochemistry, field spectroscopy, and hyperspectral remote sensing: A case study of the Rodalquilar mining area, SE Spain

The aim of this study is to derive parameters from spectral variations associated with heavy metals in soil and to explore the possibility of extending the use of these parameters to hyperspectral images and to map the distribution of areas affected by heavy metals on HyMAP data. Variations in the spectral absorption features of lattice OH and oxygen on the mineral surface due to the combination of different heavy metals were linked to actual concentrations of heavy metals. The ratio of 610 to 500 nm (R_610,500 nm) in the visible and near-infrared (VNIR) range, absorption area at 2200 nm (Area_2200 nm), and asymmetry of the absorption feature at 2200 nm (Asym_2200 nm) showed significant correlations with concentrations of Pb, Zn, and As, respectively. The resulting spectral gradient maps showed similar spatial patterns to geochemical gradient maps. The ground-derived spectral parameters showed a reliable quantitative relationship with heavy metal levels based on multiple linear regression. To examine the feasibility to applying these parameters to a HyMAP image, image-derived spectral parameters were compared with ground-derived parameters in terms of R², one-way ANOVA, and spatial patterns in the gradient map. The R_1344,778 nm and Area_2200 nm parameters showed a weak relationship between the two datasets (R² > 0.5), and populations of spectral parameter values, Depth_500 nm, R_1344,778 nm, and Area_2200 nm derived from the image pixels were comparable with those of ground-derived spectral parameters along a section of the stream channel. The pixels classified in the rule image of Depth_500 nm, R_1344,778 nm, and Area_2200 nm derived from a HyMAP image showed similar spatial patterns to the gradient maps of ground-derived spectral parameters. The results indicate the potential applicability of the parameters derived from spectral absorption features in screening and mapping the distribution of heavy metals. Correcting for differences in spectral and spatial resolution between ground and image spectra should be considered for quantitative mapping and the retrieval of heavy metal concentrations from HyMAP images.     

Attitude study of on-line terminal operators on work-station arrangements

A questionnaire survey was conducted covering 75 on-line terminal operators at a large gas utility. They were asked to give preference ratings to alternative arrangements with regard to panelling, seating, background music, and the location of a terminal on the desk. The majority of the respondents preferred an open space layout to layouts with some panels, and some background music to no music. These results are in conformity with the findings of most past studies. As to seating arrangements, they gave the highest preference to a random arrangement made independent of the employee's sex or sensority. With respect to the location of a terminal, the lefthand side of the operator was rated highest by about half of the respondents, and the center of the desk by one quarter of them.