Qualitative representation of spatial knowledge in two-dimensional space

Various relation-based systems, concerned with the qualitative representation and processing of spatial knowledge, have been developed in numerous application domains. In this article, we identify the common concepts underlying qualitative spatial knowledge representation, we compare the representational properties of the different systems, and we outline the computational tasks involved in relation-based spatial information processing. We also describesymbolic spatial indexes, relation-based structures that combine several ideas in spatial knowledge representation. A symbolic spatial index is an array that preserves only a set of spatial relations among distinct objects in an image, called the modeling space; the index array discards information, such as shape and size of objects, and irrelevant spatial relations. The construction of a symbolic spatial index from an input image can be thought of as a transformation that keeps only a set of representative points needed to define the relations of the modeling space. By keeping the relative arrangements of the representative points in symbolic spatial indexes and discarding all other points, we maintain enough information to answer queries regarding the spatial relations of the modeling space without the need to access the initial image or an object database. Symbolic spatial indexes can be used to solve problems involving route planning, composition of spatial relations, and update operations.     

A PROTOTYPE GRID FRAMEWORK FOR THE CHEMICAL PROCESS INDUSTRIES

This article presents a GRID framework for distributed computations in the chemical process industries. We advocate a generic agent-based GRID environment in which chemical processes can be represented, simulated, and optimized as a set of autonomous, collaborative software agents. The framework features numerous advantages in terms of scalability, software reuse, security, and distributed resource discovery and utilization. It is a novel example of how advanced distributed techniques and paradigms can be elegantly applied in the area of chemical engineering to support distributed computations and discovery functions in chemical process engineering. A prototype implementation of the proposed framework for chemical process design is presented to illustrate the concepts.     

Experimental Investigation of FRP-Strengthened RC Beam-Column Joints

The results of a comprehensive experimental program, aimed at providing a fundamental understanding of the behavior of shear-critical exterior reinforced concrete (RC) joints strengthened with fiber reinforced polymers (FRP) under simulated seismic load, are presented in this study. The role of various parameters on the effectiveness of FRP is examined through 2/3-scale testing of 18 exterior RC joints. Conclusions are drawn on the basis of certain load versus imposed displacement response characteristics, comprising the strength (maximum lateral load), the stiffness, and the cumulative energy dissipation capacity. The results demonstrate the important role of mechanical anchorages in limiting premature debonding, and they provide important information on the role of various parameters, including: area fraction of FRP; distribution of FRP between the beam and the column; column axial load; internal joint (steel) reinforcement; initial damage; carbon versus glass fibers; sheets versus strips; and effect of transverse beams.     

Simulation of water and nitrogen dynamics in soils during wastewater applications by using a finite-element model

A mathematical model was developed to simulate water movement, mass transport, and nitrogen transformations in soils during wastewater applications. The model is one-dimensional and based on the Galerkin finite-element method. The submodel of mass transport of nitrogen incorporates the convection-dispersion processes of ammonium and nitrate nitrogen, nitrification, denitrification, ammonium exchange and uptake of ammonium and nitrate ions. The accuracy and validity of the proposed model was examined by comparison with an explicit-implicit finite-difference model results. The model was used for simulation of water and nitrogen dynamics during wastewater application in homogeneous and multi-layered soils under different N concentration, rate, duration and scheduling of application.     

Supporting inconsistent rules in database systems

When a set of rules generates (conflicting) values for a virtual attribute of some tuple, the system must resolve the inconsistency and decide on a unique value that is assigned to that attribute. In most current systems, the conflict is resolved based on criteria that choose one of the rules in the conflicting set and use the value that it generated. There are several applications, however, where inconsistencies of the above form arise, whose semantics demand a different form of resolution. We propose a general framework for the study of the conflict resolution problem, and suggest a variety of resolution criteria, which collectively subsume all previously known solutions. With several new criteria being introduced, the semantics of several applications are captured more accurately than in the past. We discuss how conflict resolution criteria can be specified at the schema or the rule-module level. Finally, we suggest some implementation techniques based on rule indexing, which allow conflicts to be resolved efficiently at compile time, so that at run time only a single rule is processed.An earlier version of this work appeared under the title Conflict Resolution of Rules Assigning Values to Virtual Attributes inProceedings of the 1989 ACM-Sigmod Conference, Portland, OR, June 1989, pp. 205–214.Partially supported by the National Science Foundation under Grant IRI-9157368 (PYI Award) and by grants from DEC, HP, and AT&T.Partially supported by the National Science Foundation under Grant IRI-9057573 (PYI Award), IBM, DEC, and the University of Maryland Institute for Advanced Computer Studies (UMIACS).     

Isentropic exponents of real gases and application for the air at temperatures from 150 K to 450 K

Summary Three real gas isentropic exponentsk _Tv,k _rv,k _pT are introduced, which when used in place of the classical isentropic exponentk=c _p/c in the ideal gas isentropic change equations, the latter may describe very accurately the isentropic change of real gases. The usual practice of employing exponentk may lead to considerably incorrect results even when the value ofk corresponds to the correct local value ofc _p/c _v of the real gas under examination. The numerical values of the new exponents are calculated in the case of real air for temperatures from 150 K to 450 K and pressures from 1 bar to 1000 bar. It is seen that at low temperatures and high pressures the values of the new exponents differ considerably from the values of the classical exponentk. Therefore, the error resulting by approximating, as is usually the case, the behaviour of real gases by the ideal gas isentropic change equations in a stepwise fashion with exponentk instead of the new exponents, is considerable. It follows that exponentk, which appears in various relations in thermodynamics, fluid mechanics, gasdynamics, heat transfer etc., should be suitably replaced by combinations of the three exponents. Related numerical examples, made in the case of real air, showed that the use ofk leads (in the temperature and pressure ranges examined) to a 5% error in the calculation of blowby rate in internal combustion enginers, high pressure compressors or steam turbines and to a 50% error in the calculation of the isentropic expansion or compression.Nomenclature A _ij,B _i,N _ij,O _ij,Q _ij Coefficients - c Velocity - c _p Specific heat under constant pressure - c _v Specific heat under constant volume - h Specific enthalpy - k Isentropic exponent,k=c _p/c _v - k _pT Real gas isentropic exponent corresponding to the pair of variablesp,T - k _pv Real gas isentropic exponent corresponding to the pair of variablesp, v - k _Tv Real gas isentropic exponent corresponding to the pair of variablesT,v - M Mach number,M=c/ - p Pressure - p _c Pressure at the critical point - R Constant of the air,R=287.22 J/kg K - s Specific entropy - T Temperature - T _c Temperature at the critical point - v Specific volume - v _c Specific volume at the critical point - z Compressibility factor - Sound velocity - T Temperature increment With 14 Figures     

An efficient algorithm for partially matched services in internet of services

Internet of Things (IoT) connects billions of devices in an Internet-like structure. Each device encapsulated as a real-world service which provides functionality and exchanges information with other devices. This large-scale information exchange results in new interactions between things and people. Unlike traditional web services, internet of services is highly dynamic and continuously changing due to constant degrade, vanish and possibly reappear of the devices, this opens a new challenge in the process of resource discovery and selection. In response to increasing numbers of services in the discovery and selection process, there is a corresponding increase in number of service consumers and consequent diversity of quality of service (QoS) available. Increase in both sides’ leads to the diversity in the demand and supply of services, which would result in the partial match of the requirements and offers. This paper proposed an IoT service ranking and selection algorithm by considering multiple QoS requirements and allowing partially matched services to be counted as a candidate for the selection process. One of the applications of IoT sensory data that attracts many researchers is transportation especially emergency and accident services which is used as a case study in this paper. Experimental results from real-world services showed that the proposed method achieved significant improvement in the accuracy and performance in the selection process.     

Index-based query processing on distributed multidimensional data

This work introduces decentralized query processing techniques based on MIDAS, a novel distributed multidimensional index. In particular, MIDAS implements a distributed k-d tree, where leaves correspond to peers, and internal nodes dictate message routing. MIDAS requires that peers maintain little network information, and features mechanisms that support fault tolerance and load balancing. The proposed algorithms process point and range queries over the multidimensional indexed space in only O(log n) hops in expectance, where n is the network size. For nearest neighbor queries, two processing alternatives are discussed. The first, termed eager processing, has low latency (expected value of O(log n) hops) but may involve a large number of peers. The second, termed iterative processing, has higher latency (expected value of O(log² n) hops) but involves far fewer peers. A detailed experimental evaluation demonstrates that our query processing techniques outperform existing methods for settings involving real spatial data as well as in the case of high dimensional synthetic data.     

A modeling approach on the TelosB WSN platform power consumption

Substantial characteristics of wireless sensor networks, such as autonomy and miniature size, are achieved at the expense of restricted energy resources. Optimal resource management is thus among the most important challenges in WSNs development and its success requires accurate and practical models based on detailed insight concerning the factors contributing to the overall power consumption of a WSN mote. To achieve such awareness, that will enable models development, appropriate measuring test-beds and methodologies are needed, facilitating reliable and accurate power consumption measurements of critical functionalities.To cover the need for energy models that precisely define the power consumption behavior of WSN hardware platforms, this paper contributes with a measuring methodology including three steps: the design and implementation of a measuring system for a wide range of power consumption thresholds, the identification, isolation and measurement of elementary functionalities of a WSN platform with respect to their contribution to the overall mote power consumption, and the extraction of valuable conclusions based on the respective measurements resulting in the composition of a practical, yet accurate power consumption model.     

Evaluation Techniques for Generalized Path Pattern Queries on XML Data

Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path patterns or tree patterns. Current applications of XML require querying of data whose structure is complex or is not fully known to the user, or integrating XML data sources with different structures. These applications have motivated recently the introduction of query languages that allow a partial specification of path patterns in a query. In this paper, we consider partial path queries, a generalization of path pattern queries, and we focus on their efficient evaluation under the indexed streaming evaluation model. Our approach explicitly deals with repeated labels (that is, multiple occurrences of the same label in a query). We show that partial path queries can be represented as rooted dags for which a topological ordering of the nodes exists. We present three algorithms for the efficient evaluation of these queries. The first one exploits a structural summary of data to generate a set of path patterns that together are equivalent to a partial path query. To evaluate these path patterns, we extend a previous algorithm for path-pattern queries so that it can work on path patterns with repeated labels. The second one extracts a spanning tree from the query dag, uses a stack-based algorithm to find the matches of the root-to-leaf paths in the tree, and merge-joins the matches to compute the answer. Finally, the third one exploits multiple pointers of stack entries and a topological ordering of the query dag to apply a stack-based holistic technique. We analyze our algorithms and perform extensive experimental evaluations. Our experimental results show that the holistic algorithm outperforms the other ones. Our approaches are the first ones to efficiently evaluate this class of queries in the indexed streaming model.