Advanced Web and Network Technologies, and Applications

Finding all the occurrences of a twig pattern in an XML document is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process twig queries based on region encoding. While each element in source document is given two or more numbers in region-encoding-form index, the size of index grows linearly to the source document. The algorithms based on region encoding perform worse when the source document grows large. In this paper, we address the problem by putting forward a novel index structure, called Clustered Absolute Path Index (CAPI for brief). This index can extremely reduce the size of index and grows slowly as the source document grows large. Based on CAPI, we design novel join algorithms, called Path-Match to process queries without branches, Branch-Filter and RelatedPath-Join to process queries with branches. Experimental results show that the proposed algorithms based on CAPI outperform twig join significantly and have good scalability.

The need for interoperation and data exchange through the Internet has made Extensible Markup Language (XML) a dominant standard language. Much work has already been done on translating relational data into XML documents and vice versa. However, there is not an integrated method to combine them together as a unifying technology for database interoperability on the Internet. Users may not be familiar with various query language syntax. We propose database gateways built on the top of a Relational Database (RDB) and an XML Database (XMLDB). Users can access both databases at the same time through the query language SQL or XQL (an XML query language) to access data stored in either RDB or XMLDB. The translation process adopts query graph translation between a RDB and an XMLDB. Thus, a stepwise procedure of query translation is devised and amenable to implementation. The procedure also provides an XML interface to a RDB as well as a relational interface to XMLDB. A location counter sequence number is used to position tuples in a RDB for subsequent transforming the tuples into the corresponding positioning element instances in the XML documents. As a result, both XMLDB and RDB can co-exist, and be accessible by the users.

In this paper, we propose a series of rules for transforming XML Schema language into standard database schema, specifically based on ODMG 3.0 specifications. Our rules have the following characteristics: First, the rules use XML Schema as a document structure description language because the XML Schema has much stronger capabilities in exchanging data than the DTD has. Second, the rules support both structured and unstructured requests for XML documents, since the types of XML documents can be varied according to the level of integration among enterprises. We expect the rules will be an enabler technology for integrating distributed applications, in which the storage and retrieval of transmitted XML documents are mission-critical.

This paper analyzes and points out the differences of functional dependencies when they are applied in XML documents and relational databases. A concept of functional dependency in XML documents based on path expressions is proposed. The advantage of this definition is that it can represent the functional dependencies not only between the values of attributes and elements, but also between the nodes of elements in an XML documents. Some inference rules of XML functional dependencies also given as a start point and foundation for further research.

Reactivity, the ability to detect events and respond to them automatically through reactive programs, is a key requirement in many present-day information systems. Work on Web Services reflects the need for support of reactivity on a higher abstraction level than just message exchange by HTTP. This article presents the composite event query facilities of the reactive rule-based programming language XChange. Composite events are important in the dynamic world of the Web where applications, or Web Services, that have not been engineered together are composed and have to cooperate by exchanging event messages.

With rapid acceptance of XML technologies, efficient query processing is a critical issue for XML repositories. In this paper, we consider the XML query which can be represented as a query tree with twig patterns. The proposed approach will first quickly retrieve data satisfying fragment paths which consist of only the parent-child relationship, and deal with the ancestor-descendent constraint in the later gluing stage. This approach focuses on where the data need to be “glued” and thus is very efficient. We conduct several experiments to evaluate the performance of the proposed approach. The results show that our system is more efficient than the holistic approach.

Data on the Internet are usually represented and transfered as XML. The XML data is represented as a tree and therefore, object repositories are well-suited to store and query them due to their modeling power. XML queries are represented as regular path expressions and evaluated by traversing each object of the tree in object repositories. Several indexes are proposed to fast evaluate regular path expressions. However, in some cases they may not cover all possible paths because they require a great amount of disk space. In order to efficiently evaluate the queries in such cases, we propose an signature based block traversing which combines the signature method and block traversing. The signature approach shrink the search space by using the signature information attached to each object, which hints the existence of a certain label in the sub-tree. The block traversing reduces disk I/O by early evaluating the reachable objects in a page. We conducted diverse experiments to show that the hybrid approach achieves a better performance than the other naive ones.

As XML becomes prevailing on the Internet, efficient management of XML queries becomes more important. Caching frequent queries can expedite XML query processing. In this paper, we propose a framework to address an NP-hard optimization problem, caching frequent query patterns. We develop several algorithms to respectively generate query subpatterns, check query containment, and choose query subpatterns for caching. Experimental results show that our algorithms are efficient and scalable.

In recent years, more and more XML repositories are emerging, e.g., XML digital library, SIGMOD and DBLP document collections. Since XML is good at representing both structured and unstructured data, to facilitate the usage of this kind of information, it is necessary to support structure-based and content-based (full-text) queries/retrievals over XML repositories. With existing XPath/XQuery Full-Text, user could do search based on cardinality, proximity or distance predicates. In this paper, we propose an efficient approach for the Information Retrieval (IR) style search, especially distance predicates search, on XML documents. Numbering technique is employed to encode XML documents, and then three algorithms are designed to evaluate queries with distance predicates. To improve the performance, some optimization techniques are introduced. Extensive experiments show the effectiveness and efficiency of the proposed approach.

Data on the web is gradually changing format from HTML to XML/XSLT driven by various software and hardware requirements such as interoperability and data-sharing problems between different applications/platforms, devices with vairous capabilities like cell phones, PDAs. This gradual change introduces new challenges in web page and web site classification. HTML is used for presentation of content. XML represents content in a hierarchical manner. XSLT is used to transform XML documents into different formats such as HTML, WML. There are certain drawbacks in HTML and XML classifications for classifying a web page. In this paper we propose a new classification method based on XSLT which is able to combine the advantages of HTML and XML classifications. We also introduce a web classification framework utilizing XSLT classification. Finally we show that using Naïve Bayes classifier XSLT classification outperfoms both HTML and XML classifications.

In this paper, we propose a new framework, called XLogic- Miner, to mine association rules from XML data. We consider the generate-and-test and the frequent-pattern growth approaches. In XLogic-Miner, we propose an novel method to represent a frequent-pattern tree in an object-relational table and exploit a new join operator developed in the paper. The principal focus of this research is to demonstrate that association rule mining can be expressed in an extended datalog program and be able to mine XML data in a declarative way. We also consider some optimization and performance issues.

In this paper, we design an XML document retrieval system for a digital museum. It can support unified retrieval on XML documents based on both document structure and image content. To achieve it, we perform the indexing of XML documents describing Korean porcelains used for a digital museum, based on not only their basic unit of element but also their image color and shape features. In addition, we provide index structures for the unified retrieval based on both document structure and image content. Finally, we implement our XML document retrieval system designed for a digital museum and analyze its performance in terms of insert time and retrieval time for simple queries and composite queries.

Meta modeling is in nature more suitable for enterprises’ large applications and has many advantages over the traditional OO modeling. Up to now how to provide meta modeling support in an XML based data integration has not yet been addressed systematically This paper describes the most distinguished features of meta modeling from the traditional OO modeling and the key issues in the meta modeling enabled XML based data integration applications. Two algorithms: a semantic constraint parsing algorithm and an XML Schema mapping algorithm are discussed in detail.

As a kind of data-driven decision support systems, business intelligence tools focus too much on data. In order to provide the business intelligence system with the ability of process-driven decision making, we introduce the concept of business process management to the current business intelligence system. With the implementation of case-base reasoning and rule-base reasoning technology, the process models can be built and managed efficiently. In this paper we also provide a strategy for data mining experience reuse. Process models in our system are all defined based on XML.

Relational Database storage for XML data is the most affordable and available solution. Meanwhile supporting document order and structure for dynamic XML data in RDBMS still needs more work. We present a new labeling approach for nodes in XML documents, which we call XMask, where each element is identified by two values (1) node Id (2) and node Mask. XMask can efficiently maintain the document structure and order with a short-length label that can fit in a 32-bit integer. We performed experimental evaluation between our approach and an interval approach model using XML data (XRel). Our approach outperformed the interval approach for complex queries.

Leaf recognition and retrieval plays an important role in plant recognition and retrieval and its key issue lies in whether selected features are stable and have good ability to discriminate different kinds of leaves. From the view of plant leaf morphology, domain-related visual features and semantic features of plant leaf are analyzed and extracted first. Then these features are translated into a hierarchy that is easily represented by XML. On such a basis, the leaf image retrieval system proposed in this paper provides two types of retrieval methods, which could give better precision and flexibility. Experiment results prove the effectiveness of selected features and performance superiority of the leaf image retrieval system.

In this paper, we propose a XML-based workflow event logging mechanism, and describe the implementation details of the mechanism so as to be embedded into the e-Chautauqua system that has been recently developed by the CTRL research group as a very large scale workflow management system. Finally, we explain how the XML-based workflow event logs will be applied and used to the workflow mining and rediscovery framework.

Clustering on XML documents is an important task. However, it is difficult to select the appropriate parameters’ value for the clustering algorithms. By integrating outlier detection with clustering, the paper takes a new approach for analyzing the XML documents by structure distance. After stating the XML tree distance, the paper proposes a new clustering algorithm, which stops clustering automatically by utilizing the outlier information and needs only one parameter, whose appropriate value range can be decided in the outlier mining process. The paper adopts the XML dataset with different structure and other real-life datasets to compare it with other clustering algorithms.

Due to the increasing dependence on semi-structured data, there exists a requirement to model, design, and manipulate self-describing, schema-based, semi-structured data models (e.g. XML) and the associated semantics at a higher level of abstraction than at the instance level. In this paper, we propose to model dynamic properties of a layered XML view model, at the conceptual level, using eXtensible Semantic (XSemantic) nets.

Web site semantic content verification can be a tedious and error prone task. In this paper we propose a framework for syntactic validation and semantic verification based on the logic programming language XCentric. The high declarative model of this language based on a new unification algorithm along with an interface to semistructured data provides an elegant framework for semantic error detection. The result is an easy to follow model to improve website quality and management.

This paper investigates the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of wireless nodes, a QoS multicast call will be blocked if there does not exist a single multicast tree that has the requested bandwidth, even though there is enough bandwidth in the system to support the call. We propose a new QoS multicast routing scheme that uses multiple trees. The aggregate bandwidth of multiple trees can meet the bandwidth requirement and the delay from the source to the farthest destination node shall not exceed a pre-specified bound. Two strategies for constructing multiple trees are studied. The simulation results show that the new scheme significantly improves the request success rate and makes a better use of network resources.

Wireless sensor networks have emerged as a promising solution for a large number of monitoring applications. Sensor nodes are capable of measuring real world phenomena, storing, processing and transferring these measurements. However, users are interested in event monitored by sensors, but not the sensor itself or the massive irrelevant readings from sensors. Users often issue event queries such as “Where did happen hailstone in sensor network from 3:00 to 5:00?” Since battery supply of sensors is limited, energy-efficient query processing in sensor networks has become an important research problem. This paper presents an improved data-centric storage strategy, called CM-DCS, and also proposes two event query processing algorithms based on CM-DCS and local storage. The energy consumption of sensors for three storage strategies namely external storage, local storage and data-centric storage are analyzed and compared. The paper also studies the influence of the number of sensor nodes and node density on energy consumption. Analytical and experimental results show that in most cases the event query processing algorithm based on CM-DCS can save more energy than those algorithms based on external storage and local storage strategies.

In this paper we consider a distributed and efficient information dissemination and retrieval system for wireless sensor networks. In such a system each sensor node operates autonomously with no central node of control in the network, and it can be a data source as well as a data sink. We aim at developing energy efficient protocols that disseminate information to any nodes that are interested in. Two protocols are proposed, one is based on the quorum scheme and the other is based on the home-agent scheme. The proposed protocols have two advantages: 1) High success rate for data retrieval; 2) Fully distributed. The theoretical analysis and simulation results show their significant improvements on energy efficiency over the previous protocols.

Security schemes of pairwise key establishment, which enable sensors to communicate with each other securely, play a fundamental role in research on security issue in wireless sensor networks. A general framework for key predistribution is presented, based on the idea of Key Distribution Center and polynomial pool schemes. By utilizing nice properties of Hierarchical Hypercube model, a new security mechanism for key predistribution based on such model is also proposed. Theoretic analysis and experimental figures show that the new algorithm has better performance and provides higher possibilities for sensors to establish pairwise key, compared with previous related works.

WSAN (Wireless Sensor and Actor Network) has become a promising direction in research. However, up to now, little work has been done in WSAN, especially in security issues. In this paper, we first discuss several challenges in security of WSAN. Aiming at these challenges, we propose our key establishment scheme for heterogeneous nodes in WSAN. In our scheme, authentication and key establishment can be finished with just one round-trip communication. Further more, our scheme is especially designed for heterogeneous architectures. Capability of resource-rich actors are fully used. Finally, our scheme and existing schemes for Ad Hoc Networks and WSN (Wireless Sensor Network) are compared and analyzed.

In wireless sensor networks (WSNs), a large number of sensor nodes are deployed over a large area and long distances and multi-hop communication is required between nodes. So managing numerous wireless sensor nodes directly is very complex, and is not efficient. The management of WSNs must be autonomic self-managed with a minimum of human interference, and robust to changes in network states. To do this, we propose a scalable self-management framework for WSNs called SNOWMAN (SeNsOr netWork MANagement) framework. Our SNOWMAN framework is based on hierarchical management architecture and on the policy-based network management (PBNM) paradigm. SNOWMAN can reduce the costs of managing sensor nodes and of the communication among them using hierarchical clustering architecture. SNOWMAN can also provide administrators with a solution to simplify and automate the management of WSNs using PBNM paradigm.

The resource constraints of wireless sensor network make it easy to attack and hard to protect. Although carefully designed cryptography and authentication help to make WSN securer, they are not good at dealing with compromised node and ageing node, whose misbehavior may impair the function of WSN. Behavior-based trust mechanism, which is a variant of reputation-based trust in eCommerce, can be used to address this problem. The framework and related techniques of behavior-based trust are discussed in this paper.

Sensor webs consisting of nodes with limited battery power and wireless communication are deployed to collect useful information from a variety of environments. A new challenge in the wireless sensor networks (WSN) is the compromised nodes problem. Compromised nodes may exhibit arbitrary behavior and may collude with other compromised nodes. In this paper, we propose a novel security strategy with assistant cluster heads, SSACH, which focuses on limiting the attack from compromised nodes. It adds the Assistant Cluster Heads (ACH) so as to monitor Cluster Head (CH) and take precautions against the inside attack.

This paper presents the design and performance of a novel medium access control (MAC) protocol, called Reservation CSMA/CA for QoS (Quality of Service) support in mobile ad-hoc networks. The reservation CSMA/CA protocol is based on a hierarchical approach consisting of two sublayers. The lower sublayer of the protocol is designed to support asynchronous data traffic using CSMA/CA, while the upper sublayer is designed for QoS support by making a slot reservation via the three-way handshake. The bandwidth efficiency can be maximized with the slot reuse as much as possible. The proposed protocol has been validated using the ns network simulator with wireless and mobility extensions. The simulation results show that the reservation CSMA/CA offers the higher throughput with the higher load for real-time periodic traffic compared to the IEEE 802.11 standard, while providing deterministic delay performance.

The idea of partial coverage is provided in this paper, which means that the distance among data trends gathered by neighbor sensors is so small that, in some period, we can cluster those sensors, and replace the cluster with certain sensor in this cluster to form the virtual sensor network topology. But adopting this approach, we need to solve two problems: 1) how to characterize the distance among data trends (rather than raw data) of different sensors; 2) based on the distance, how to form the cluster and use the virtual network to represent the whole sensor network within certain error range. For the first problem, the Jensen-Shannon Divergence (JSD) is used to characterize the distance among different distributions which represent the data trend of sensors. Then, based on JSD, a hierarchical clustering algorithm is provided to form the virtual sensor network topology. Finally, the performance of our approach is evaluated through simulation.

Enlightened by the congestion linkage in the traditional Internet, the novel concept of bottleneck node is proposed in this paper, which is crucial to the lifetime of the wireless sensor network deployed randomly. Due to the computation complexity and the operational deployment, the quasi-bottleneck node is presented to replace the theoretical bottleneck node in the practical scenario. Theoretical analysis shows the probability of the presence of quasi-bottleneck nodes stands at high level and an algorithm to find out this kind of nodes is presented. Simulation proves the correctness of the algorithm and shows the effect of these nodes on the network behavior, such as energy consumption and packet lost rate. At last, two effective solutions to decrease the energy consumption of the quasi-bottleneck nodes are presented.

Event-based ad hoc query processing is one of the most important functions of wireless sensor networks. Data centric storage algorithm is carried out to solve the problem but the traditional algorithm neglects that events will last for a time. During this time, the relationship between the query frequency and the data production frequency will change, which is an important feature to affect the energy consumption of the event-based ad hoc query processing in sensor networks. In this paper, we propose an adaptive data transmission algorithm, which takes the relationship into account. Experiments shows that our adaptive algorithm can save more energy than the traditional data centric storage algorithm.

We propose a method for determining where to aggregate data from sensor nodes using Fermat’s point to save energy in wireless sensor networks. Unlike most aggregation schemes, our method does not need to construct any tree for aggregation of data. Simulation results show that Fermat’s point can be the most effective aggregation point in terms of energy efficiency and thus the network lifetime.

Energy consumption in Wireless Sensor Network (WSN) remains a challenging problem. Better Solutions of this problem not only can prolong the lifetime of WSNs, but also can support more complex protocols to improve the network performance. We propose an approach of inductive charging, by using mobile nodes to deliver power to deployed active sensors. Infrequently visited by mobile nodes, the sensors can perpetually work without any human intervention. In order to power a WSN of a large number of sensor nodes in wide geographical range effectively, we propose three schemes for inductive charging. Simulation results demonstrate the effectiveness of these algorithms.

Currently, Wireless Sensor Networks (WSNs) are formed by hundreds of low energy and low cost micro-electro-mechanical systems. Routing and low power consumption have become important research issues to interconnect this kind of networks. However, conventional Quality of Service routing models, are not suitable for ad hoc sensor networks, due to the dynamic nature of such systems. This paper introduces a new QoS-driven routing algorithm, named

SIR

:

S

ensor

I

ntelligence

R

outing. We have designed an artificial neural network based on Kohonen self organizing features map. Every node implements this artificial neural network forming a distributed intelligence and ubiquitous computing system.

In query-driven sensor networks, query is generally disseminated to the whole sensor. When the query needs information on a specific area, it is unnecessary for the query to be flooded over the entire network. In this paper, we propose a query delivery scheme which does not flood the query over the entire area but only to a restricted area. Also, our scheme also offers fault tolerance capability in order to prolong the network lifetime and to provide reliability for query transmissions. A performance evaluation shows that the total energy consumption can be significantly reduced and the sensor network lifetime can be prolonged by our scheme.

The application of wireless sensor network in control systems can bring some advantages, such as the flexibility and the feasibility of network deployment at low costs. While it also raises some new challenges. First, the limited communication resources are shared by several control loops. Second, the wireless and multi-hop character of sensor network makes the resources scheduling more difficult. Thus, how to allocate the limited communication and computing resources effectively is an important problem. In this paper, this problem is formulated as an optimal sampling frequency assignment problem, where the objective function is to maximize the effectiveness of control systems, subject to channel capacity constraints. Then an iterative distributed algorithm based on local buffer information is proposed, which has features of low computational complexity and well scalability. Finally, the simulation results show that the proposed solution can achieve the optimal quality of the control system in a distributed way. Meanwhile, it is capable of seeking the optimal point automatically when the network load changes.

Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environment monitoring applications. Most architectures of wireless sensor networks (WSN) are built as homogeneous networks, where all sensor nodes have the same structure. But it is not suitable for cluster-based WSN. By using multi-antenna sensor node (MASN) as the cluster head (CH), we import multi-input-multi-output (MIMO) and single-input-multi-output (SIMO) communication modes into WSN. In this network scenario, tremendous energy saving is possible when transmission range is larger than a given threshold. This paper motivates and describes the realization of the inhomogeneous network, special communication scheme and simulation of energy consumption and delay model of it.

Since sensor nodes have limited battery power, it is desirable to select a minimum set of working sensor nodes which should be involved in sensing and forwarding data to the sink. In this paper, we propose a topology scheme which selects a minimum set of working nodes in the sensor network field to avoid wasting excessive energy by turning off too many redundant nodes. Our scheme offers a solution for configuring network topology with a minimal number of working nodes. Simulations show that our scheme extends the lifetime of the dense sensor networks, and achieves the desired robust coverage as well as satisfactory connectivity to the sink in an energy efficient fashion.

This paper proposes a new multipath routing protocol called

maximally disjoint multipath AODV (MDAODV)

, which exploits maximally node- and link-disjoint paths. The key idea is to extend the route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received. Our simulation study shows that MDAODV outperforms the conventional multipath routing protocol based on AODV as well as the basic AODV protocol in terms of packet delivery ratio, and results in about 15 ~ 50 % less routing overhead.

In this paper, we propose an energy efficient design for window query processing in sensor networks. A new design is structured to process the window queries. The use of distributed form of spatial indexing introduces greater flexibility and robustness as compared to the previous centralized approach, which lacked proper semantics and evaluation of window queries, in sensor networks. A distributed spatial routing tree efficiently distributes the structure to each node in the sensor network. The MBR of the region where its children and the node itself are located is stored by each parent. The measure of the extent of overlapping determines the inclusion/exclusion of sensor nodes to evaluate the query. Reduction in the number of nodes participating in the query reduces the communication power seeked, thus elongating the life of the embedded sensor system.

Sensor localization has become an essential requirement for realistic applications over Wireless Sensor Networks (WSN).In this paper, we propose a novel location algorithm based on mean received signal strength (RSS) measurements. It incorporates Chan’s hyperbolic position location algorithm and the extended Kalman filtering to achieve an accurate estimation. We have verified the scheme mentioned in the paper performed better than conventional received signal strength indicator (RSSI) location algorithm for the static location estimator in indoor sensor networks.

In this paper, we describe a secure cluster-routing protocol based on clustering scheme in ad hoc networks. This work provides scalable, threshold authentication scheme in ad hoc networks. We present detailed security threats against ad hoc multi-layer routing protocols. Our proposed protocol designs an end-to-end authentication protocol that relies on mutual trust between nodes in other clusters. The scheme strategy takes advantage of threshold authenticated key configuration in large ad hoc networks. We propose an authentication scheme that uses certificates containing an asymmetric key using the threshold cryptography scheme, thereby reducing the computational overhead and successfully defeating all identified attacks.

Wireless sensor networks cannot have meaningful work without connecting with TCP/IP based network. In this paper, we analyze and compare all the existing solutions for connecting sensor networks with TCP/IP network, then based on the analysis result we present the basic design principle and key idea for connecting sensor networks with TCP/IP network. After comparing with related researches we claim that our solution can cover most of the benefits of related researches.

For secure sensor network communication, we propose a key establishment mechanism applying polynomial-based key predistribution scheme under the clustered sensor network architecture, and propose authentication mechanism. Every pair of neighboring nodes can calculate its own pairwise key using polynomial shares predistributed. Gateway nodes interconnecting the clusters play the role of stepping stones. For hop-by-hop authentication, every node adds MAC computed using pairwise key between its upstream node and itself. Broadcast authentication can be achieved using one-time digital signature.

Applications of sensor networks have become an emerging technology which can monitor a specific area and collect environmental data around the district. The energy of sensor nodes is tightly constrained so that there is a need to control the power consumption in node operations such as transmission and routing. In this paper, we carry out analysis on energy-aware routing in order to minimize the path loss. Our goal is to prolong the network lifetime and ease the management of sensor networks.

A sensor network application that should be deployed densely selects particular nodes and configures network topology with them to construct a long-lived network. Only the active nodes participate in message transmission through a routing path and the other nodes turn off their radios to save energy. Previous approaches have been tried to reduce the number of active nodes to construct an energy efficient network topology. However, they preclude the existence multiple active nodes within a small area. The crowded active nodes can reduce network efficiency since they make frequent collisions of messages. In this paper, we propose a self-configuring sensor network topology scheme, that can achieve scalable, robust and energy efficient sensor network based on distance between active nodes. Our scheme may uniformly distribute active nodes in a sensor field and get good energy utilization.

This paper describes global IPv6 address auto-configuration mechanism for MANET(Mobile Ad-hoc Network) nodes connected to the Internet via one or more gateways. IPv6 Duplicate Address Detection(DAD) process cannot be applicable for MANET without modification either because of the multi-hop problem or DAD time bound. In this paper, we propose a stateless auto-configuration that overcomes multi-hop problem. We solve the multi-hop problem by having some ad-hoc routable nodes doing DAD for the new node that is willing to accept DAD. These auto-configuration steps specifically include generation of link-local address and verification of its uniqueness. It further defines the processes of creating globally routable address and a new duplicate address detection mechanism. Once a host configures its interfaces, it becomes possible to communicate in multi-hop environment. We call this new scheme as Tunneled DAD (T-DAD).

Development of energy efficient MAC algorithms that provide both high reliability and easy implementation property is the current major focus in wireless sensor network research. In this paper, the general coordinated sleeping algorithm is combined with fast collision resolution MAC algorithm to achieve high energy efficiency and high performance at the same time. By observing that the sporadic traffic characteristic of WSNs and the operational characteristic of the station in packet transmission in perfectly scheduled algorithm, we propose the fast collision resolution MAC with coordinated sleeping algorithm. Through the various simulation studies, the proposed algorithm shows significant performance improvements in wireless sensor networks.

Sensor deployment is an important issue in designing sensor networks. In this paper, particle swarm optimization (PSO) approach is applied to maximize the coverage based on a probabilistic sensor model in mobile sensor networks and to reduce cost by finding the optimal positions for the cluster-head nodes based on a well-known energy model. During the coverage optimization process, sensors move to form a uniformly distributed topology according to the execution of algorithm at base station. The simulation results show that PSO algorithm has faster convergence rate than genetic algorithm based method while achieving the goal of energy efficient sensor deployment.

Locations of moving or missing objects are getting important information for context-aware applications which try to get the locality of an object, and then provide services pertaining to the object. To position an object, most systems use a predefined coordinate to compute object location while sensing the appearance of the target object. Usually, it is troublesome and costs much to define the base coordinate in advance for most object positioning systems, especially when the target object is locating in an unknown environment. To reduce the cost and complexity of object locating system and improve the accuracy of location, this paper proposed an Object Finding System based on RFID technology to identify the localities of target objects in buildings. In this paper, we introduce the design concepts of the proposed system as well as the algorithms used to calculate the object locations. In addition, the experimental results show that it is a feasibility study.

Location information is very important in the sensor network. Therefore, cryptography methods are being used to protect the information in wireless sensor network even though cryptography methods consume the large amount of additional energy. One of the final goals in the wireless sensor network is to maximize the life time of sensor node because sensor nodes have very limited power. Therefore, this paper proposes the energy efficient security method which uses relative coordinate instead of physical coordinate to reduce the energy consumption. Location information description with relative coordinate makes the caught data meaningless and can protect the data without using cryptography methods.

Many multi-process scheduling schemes have been developed to utilize system resources efficiently. In the previous researches, most of the scheduling schemes were focused on how to allocate computing resources efficiently. However, in the environment of wireless sensor networks, scheduling policy for power resources of mobile device is also essential as high power drain of mobile sensor device will lead to immediate non-functioning of device due to limited capacity of its battery. Sensor nodes can also be powered by rechargeable power resources such as solar cell or gravitation. In these cases, residual energy of rechargeable power resource is dynamic over time. This motivated us to design a scheduling policy based on rechargeable power resource for increasing the network life time and reducing the response time of service. In this paper, we present and evaluate six process scheduling schemes based on execution time and energy consumption of process.

In the area of wireless sensor networks, achieving minimum energy consumption is a very important research issue. A number of energy efficient protocols have been proposed, mostly based on a layered design approach, which means that they are focused on designing optimal strategies for “single” layer only. In this paper, we take an alternative approach i.e., a cross-layer design, and present a new MAC protocol named MAC-CROSS. In this new approach, the interactions between MAC and Routing layers are fully exploited to achieve energy efficiency for wireless sensor networks. More precisely, in the proposed MAC-CROSS algorithm, routing information at the network layer is utilized for the MAC layer such that it can maximize a sleep duration of each node. Through implementation on a Mica Mote platform and simulation study using the NS-2, we evaluate a performance of the presented MAC-CROSS and prove its substantial performance gains.

Sensor networks is an Ad-Hoc network consist of large amount of sensors. These sensors are distributed in a huge area. Each of the small, cheap, intelligent sensors has processor, memory and wireless transmission ability. These sensors collect or monitor the surroundings in real-time and process these data to obtain the detailed and accurate information from their covered area. Information from sensors must be combined with its location to make sense, so the location of sensors is very important in sensor network applications. Localization of sensors becomes one of the key techniques in sensor networks. A power-efficient localization algorithm is proposed in this paper. It uses few anchors(the sensors whose location is known) to implement the localization of other nodes without special devices such as GPS. This algorithm not only has the lower time cost and communication cost, but also needs only a few anchor nodes whose distribution is independent. Experimental results and analysis show that the localization algorithm proposed in this paper has higher accuracy, lower power cost and better expansibility. It is very suitable for large scale sensor networks.

The Residual Energy-Based MAC Protocol (REB MAC) presented in this paper is aimed to solve the problems of how to reduce the collisions from interfering nodes in event-driven wireless sensor networks, how to promote the communication efficiency of the system and how to ensure a balance energy consumption of WSN, etc. We combine node’s residual energy with node’s orientation in a shared wireless channel, and provide different back-off intervals for nodes having different residual-energy and in different orientation so as to reduce the collisions among neighbor nodes and promote the communication efficiency of the system. In many sensor applications, not all the nodes that sense an event need to report it. Only some of them need to report. So this paper provides a design of using parts of nodes for data transmission so that we can save the energy and balance the energy consumption between neighbor nodes.

Sensors are employed in many applications to monitor entities such as environment temperature or illumination. Because of limited resources (e.g., battery power and wireless bandwidth), it is impractical for the database to track continuous changing readings from sensors at all times. Consequently, database may produce incorrect query results based on recorded data. However, if the error between the recorded value and the actual value is bounded, probabilistic approach can be applied to process queries over the imprecise data in database. The paper proposes a quality of result based probabilistic range query processing method. Two measures are defined to evaluate the quality of result. A probability model is proposed to estimate the quality of returned results. Based on the model, an algorithm is developed to choose the probability threshold according to user’s requirement on the quality of result.

One of the main challenges in wireless sensor networks is to maximize network life time and to minimize power consumption. We propose an energy efficient mechanism for selecting active node which involved in sensing operation in a given dense field. Unlike traditional approaches, this architecture can obtained the complete self-organization of nodes as well as the connectivity of the network. This mechanism can reduce the communication cost by decreasing the number of sensing nodes in highly dense area. Our results show that the dynamic scheduling mechanism of our proposed scheme allows them to outperform existing mechanisms over a variety of scenarios. Our simulation results show that our mechanism reduces the number of transmitted packets in dense sensing area.

Grid-enabled Medical Image Processing Application System (MIP-Grid) based on OGSA-DAI techniques aims at providing high performance medical image process services in a large distributed grid computing environment. The MIP-Grid is designed using web services technologies and standards and is based on the test-bed of ShanghaiGrid. It is composed of six modules including user management, image management, medical image management, task schedule, account and monitor. It provides support for authorization, account, schedule and monitor. The various image process algorithms are implemented as web services by Java and are deployed in the nodes of MIP-Grid. OGSA-DAI provides an extension to the OGSA framework by allowing access to and integration of data held in heterogeneous data resources. MIP-Grid is based on OGSA-DAI middleware. The advantage of the MIP-Grid is scalability, flexibility and reusability and is potential to become a mainstream grid application enabling technology.

Computational Grid is a cooperative computing environment which collects all kinds of high performance software and hardware computing resources distributed in WAN and provides networked computing services. For the sake of improving the self-adaptability of resource management and accelerating the application and development of Computational Grid, an evaluating model of a computational grid node’s QOS is put forward which is based on the whole running conditions and the execution results of computational grid jobs on the node. Applied in NPU Campus Computational Grid, this model achieves good effect.

This paper proposes a layered workflow architecture that is used for not only distributing workflows’ information onto Grid or P2P resources but also scheduling the enactment of workflows. The layered architecture proposed in this paper, which we call

Enterprize Workflow Grid Architecture

, is targeting on maximizing the usability of computing facilities in the enterprize as well as the scalability of its underlined workflow management system in coping with massively parallel and very large scale workflow applications.

Scientific and industry research heavily depend on the scientific data and archives. There are lots of different, non-interoperable resources in Metropolis. By using Grid, putting the scientific resources together to form a shared metropolis research platform can facilitate the research processes, which could lead to enhance metropolis technique force and innovation ability, i.e, the integration of various biological databases and the data mining service can greatly help the biologist to search, analyze biological sequences. The architecture of the SRP and its main services are introduced in this paper. The way how to integration of scientific data and archives are discussed in detail.

University Digital Museum Grid (UDMGrid) has been developed to provide one-stop information services about kinds of digital specimens in the form of grid services. In order to speed up the way to make the digital specimen information resources interoperable based on semantic annotation using ontologies, three toolkits have been exploited to support the ontology building and the semantic annotation about the university digital museum information resources. These include toolkits for ontology editing, web content semantic annotation, and database content semantic annotation.

Workflow mechanism is used into grid system to combine multiple grid services to implement complex grid application. But the workflow is not programmable, and is not flexible enough for users as well. In this paper, a Distributed Programmable Grid System (DPGS) is put forward. In DPGS, a course-grained parallel programming interface GridPPI is implemented. Through it, user could couple multiple web services in DPGS to completed complicated requests. Based on Globus Toolkit 3.9.3, the DPGS provides a simply organized, extendable and scalable grid environment for grid designer to design and deploy traditional or new applications.

Knowledge discovery in spatial databases represents a particular case of discovery, allowing the discovery of relationships that exist between spatial and non-spatial data. Spatial reasoning ought to play a very important role in spatial data mining, but the research combined SR and SDM are very few. This paper describes the conception and implementation of SRSDM, the tool for data mining in spatial databases based on spatial reasoning method. Most spatial data mining systems only support topological relation, nearly all previous GIS and AI researches focused on single spatial aspect . Those were quite inadequate for practical applications. We propose a new spatial knowledge representation which integrates topology, direction, distance and size relations. SRSDM includes three parts: extracting spatial relations, frameworks for traditional or new data mining algorithms.

Intrusion tolerance is capability of Internet systems withstanding attacks and intrusions under unsafe environment. This paper presents the architecture of an intrusion tolerant system using group communication. A distributed group membership algorithm is described which introduces a strategy

detecting failure in local servers and announcing them to remote servers

to avoid the side effects of remote failure detection. The paper also points out that stability of failure detector is a necessary condition but not sufficient condition of algorithm cease. On analyzing the essential of block, block detection and avoidance mechanism is designed. Finally, we have developed a group membership prototype system on WAN condition. Experiment results show the algorithm has well performance in complicated Internet condition.

Radio frequency identification (RFID) provides a quick, flexible, and reliable electronic means to detect, identify, track, and manage a variety of items. It has the potential to significantly alter how processes occur and how companies operate. Currently, the development of RFID and Grid technologies has opened the door to many new RFID applications, many of which require transaction support. This paper proposes a transaction commit protocol which can ensure reliable execution of RFID applications in Grid environment, and a transaction compensating approach to undo committed sub-transactions. Reliable RFID applications can be realized by the proposed protocol effectively.

Importance and need of grid process scheduling have been increased in accordance with development of grid computing. In order to distribute and utilize grid processors efficiently, grid computing system needs scheduling policies that manage and schedule grid process. This paper reviews current scheduling policies and proposes an efficient scheduling model which is called the predictive process scheduling model. For efficient scheduling, this paper presents the processing time prediction algorithm to resolve problems of grid scheduling. The predictive process scheduling model predicts processing times of processors, allocates a job to a processor with minimum processing time, and minimizes overall system execution times. For performance evaluation, this paper measures turn-around time, job loss, throughput, and utilization. Empirical results show that the predictive process scheduling model operates with the less 69.5% of turn-around time and the less 76.4% of job loss and improves the more 119.6 % of throughput and the more 117.8% of utilization than those of existing scheduling models such as random scheduling and round-robin scheduling.

Grid provides an integrated computer platform composed of differentiated and distributed systems. In this paper, aiming at the heterogeneity and dynamism of a grid system, a novel fault-tolerant grid-scheduling model is presented based on Stochastic Petri Net. On the other hand, a new grid-scheduling strategy, the united strategy for the availability factor and expected accomplishing time (

USAT

), is put forward, In the end, the performance of the scheduling strategy based on the fault-tolerant grid-scheduling model is analyzed by SPNP software package. The numerical results show that

USAT

strategy can reduce these bad effects of dynamic and autonomic resources to some extent so as to guarantee quality of service (QoS).

In this study, a multi-agent web text mining system on the grid is developed to support enterprise decision-making. First, an individual intelligent learning agent that learns about underlying text documents is presented to discover the useful knowledge for enterprise decision. In order to scale the individual intelligent agent with the large number of text documents on the web, we then provide a multi-agent web text mining system in a parallel way based upon grid technology. Finally, we discuss how the multi-agent web text mining system on the grid can be used to implement text mining services.

The decentralized structure together with the features of self-organization and fault-tolerance makes peer-to-peer network a promising information-sharing model. However, the efficient content-based location remains a challenge of large scale peer-to-peer network. In this paper we present SemreX, a semantic overlay for desktop literature documents sharing in peer-to-peer networks. We present a semantic overlay algorithm by which peers are locally clustered together according to their semantic similarity and long-range connections are rewired for short-cut in the peer-to-peer networks. Experiment results show that routing in the semantic overlay greatly improves the recall of search as well as reduces routing hops and messages.

According to the requirement of high-availability, real-time and high performance in cooperative system, an

Extensible Dynamic Fault Tolerance model

(xDFT) is proposed in the paper. xDFT model dynamically sets load quality of server node with variability of system load to change server redundancy. It not only improves the service efficiency, but also implements load balancing in a more efficient and simply way.

Grid computing can provide significant computational power which can be applied to remotely sensed data processing. But not all the users in the field of remote sensing have the required knowledge of the grid computing. In this paper, we introduce a Grid-based programming environment (GPE) for remotely sensed data processing. User who doesn’t have the knowledge of how to deal with transactions of the Grid computing environment can program with it. Although GPE isn’t fit for the algorithms in which there exists strong correlation, it works well with the other algorithms and accelerates the computation evidently.

In this paper we propose a novel technique for multimedia service using multicast delivery in wireless network. It supports seamless multimedia service that uses basic tree and their neighboring mobile nodes (NMNs) in wireless network. The basic trees are generated based on hop-counts from each mobile node (MN) toward base node (BN). Each MN has some NMNs (1-hop away) which are composing the upper, lower or peer MNs within its transmission range and are located at different basic trees. MN joins to a specific multicast (Mcast) group through its basic tree. For protecting seamless service according to mobility of MNs that have already joined Mcast group, those MNs send periodically Mcast join message to their NMNs when they move to the other basic trees, and registers to those basic trees. In this case NMNs that received Mcast join message send it to their upper MN over the same basic tree when they don’t join Mcast group just like wired Mcast. But the MNs on the new basic tree do not send Mcast streams until the moved MN registers to a new basic tree for reducing the amount of traffic.

The wide acceptance of the grid technology has created pressure to add some features that were not part of its original design, such as security, privacy, and quality-of-service support. In this paper, we have proposed the enhanced grid security and privacy (EGSP) system architecture including EGSP system model, identity protection system, onion routing system, reputation system, and security technology. We also present a network simulation of the model and analyze its scalability.

Metropolitan-Area Grid (MAG) normally deals with a more limited computation and data-intensive problems on geographically distributed and smaller range resources. Therefore, in a MAG, resource scheduling is distinguished from other Grid. Current research on performance evaluation of resource scheduling in MAG is based on simulation techniques, which can only consider a limited range of scenarios. In this paper, we propose a centralized resource scheduling model in a MAG and give a formal framework via Stochastic Process Algebras (SPA) to deal with this problem. Within this framework, we model and analyze the performance of resource scheduling, allowing for a wide variety of job and data scheduling algorithms. Moreover, we can evaluate the combined effectiveness of job and data scheduling algorithms, rather than study them separately.

Grid and agent communities both develop concepts and mechanisms for open distributed systems, albeit from different perspectives. How to apply the agent technology in Grid infrastructure to facilitate distributed system integration (virtual organization formation) becomes an interest topic in recent years. In this paper, we investigate the issue and present an agent grid intelligent platform, called AGrIP, from the implementation point of view. AGrIP is based on the FIPA-compliant multi-agent environment MAGE and has four different layers, which apply the agent interface services for interaction and communication. It can integrate legacy systems and enables interoperability between distributed heterogeneous systems (organizations), expedite dissemination and retrieval of data, automate operator tasks and support the decision-making process. Up to date, it has been applied to several practice projects as the robust infrastructure. We will expound its recent application in Agent Grid Based City Emergency Inter-Act Project as an illustration.

Wireless metropolitan grid promises to offer various broadband services to citizens anywhere with low cost. The problem of throughput and scalability are still critical challenges for the success. In this paper, we propose and evaluate scalable backbone architecture which employs super nodes with asymmetric capability to reduce the hop count as well as increase the scalability. Multi-channel multi-radio approach is utilized to increase the throughput. A detailed performance evaluation shows that the deployment of about 20% super nodes can increase the network throughput by a factor of up to 5 compared with the conventional single channel multi hop architecture.

An innovative WIS (Web Information System) based on grid environment is presented in this paper. At first, we talk about related technologies using in the area. Then, we give out the detailed design and implementation of an experimental WIS system. Finally, we sum up our work and point out future work we are preparing to do.

In the past few years, Knowledge discovery communities have contributed a rich set of methods and tools that had been used for the analysis of large data sets. On the other hand, Grids are increasingly being used for collaborative work. Grid users would similarly benefit from having access to databases, mainly, those involved in collaborative data analysis of large datasets and those requiring sharing of data. OGSA-DAI provides an extension to the OGSA framework by allowing access to and integration of data held in heterogeneous data resources. In this paper we survey some issues, which focus on the extension of the Grid technology to Knowledge Discovery Services that are designed and being implemented on top of OGSA-DAI Grid Services. The proposed architecture defines a set of additional layers to implement the services of distributed knowledge discovery process.

Distributed managed clusters have appeared in recent years, and computing intensive scientific problems request large-scale clusters. However, many of the traditional heartbeat mechanisms do not fit large-scale distributed managed clusters. In this paper, we propose a switch-based heartbeat mechanism named

heartbeat ring

, which adapts to large-scale distributed managed clusters. Heartbeat ring mechanism has the prominent advantages in simplicity, scalability and adaptability, and so on. Finally, based on a prototype implemented on Linux platform, experiment evaluation is presented.

Most traffic flow models are based on the traffic data from inductive loops. However, this paper is to model the road situation with GPS data of floating vehicles. The relationship of the time and the passing velocity through a road segment is presented in the models which can reflect urban traffic situation. Moreover, a parallel algorithm is proposed to build the models and its task scheduling policy can make the efficiency of CPUs be about 75% in the heterogeneous computing platform. The experimental results also indicate it.

First of all, the factors that cause difficulty in CAD/CAE/CAM/PDM integrating are analyzed, and a Web Service-based service-oriented architecture (SOA) is introduced in this paper. Besides, based on the special requirement, characteristic of die design and the analysis, a new approach for integrating CAD/CAE/CAM/PDM by adopting Web Service is presented. Furthermore, a service-oriented architecture of generalized Die CAD system is given based on Web Service. The advantage of the architecture is finally expatiated.

Poor interpretability of current transportation systems has become an obstacle to further develop the intelligent transportation systems (ITS). Our design and implementation of intelligent transportation information service systems (ITIS) focuses on integrating heterogeneous data, transportation systems, and resources by using the grid technique. The ITIS project will refine and summarize the business model in Shanghai transportation information service system, design and set up open standards for intelligent transportation information service and simulation, develop grid supporting platform for transportation information service, integrate and fuse massive dynamic transportation data and legacy transportation systems, construct high performance computing (HPC) platform and dynamic parallel transportation simulation platform. ITIS will provide various high-level transportation information services for both citizens and government, which include optimal dynamic bus riding planning service, dynamic on-board navigation service, bus arrival-time prediction service, network optimization and simulation system, large-scale traffic-flow simulation system. Using these services will help to reduce the traffic congestion and other traffic problems, enhancing the transportation intelligence.

A Service-oriented Manufacturing Grid (MG) System according to OGSA named MGRID is presented and discussed in detail. In MGRID, various manufacturing resources compose the foundation of applications above it. To virtualize the resources, we present an encapsulation model based on Web Service Resource Framework (WSRF) specification. To solve the problem of dynamic organization of manufacturing job, we design a job management system, which accomplishes dynamic composition of manufacturing services. At last, a prototype is given to demonstrate our method.

Meteorology is a complex, interdisciplinary area. Meteorology Grid Computing tries to offer a flexible, secure, coordinated resource sharing and problem-resolving environment by making good use of semantic grid ideas. In this paper, a semantic architecture in Meteorology Grid Computing is presented. With the architecture, we firstly discussed the Semantic Computing Service according to the semantic descriptions of grid computing resource. Then Semantic Data Access Service is illuminated by constructing automatic metadata mapping, which provides users with the convenience to quickly access data storage facilities in on-demand manner. Finally, Meteorology Grid Expert System is presented, and it will offer meteorology knowledge environments to facilitate the forecasters and scientists with analyzing the future weather situation.

How to improve the reliability and quality of video delivery has great influence on the extensible and high-quality video services. Grid computing, for dynamic share and collaboration among all kinds of resources, can provide a solution for optimizing video delivery. This paper proposes a conceptual system of video delivery grid. First, the paper provides the model of video delivery grid, and discusses how to select distributed services and create a service flow dynamically. Then, the paper describes the design of video delivery grid based on Globus. Moreover, the prototype of video delivery grid is implemented. The efficiency of this solution was shown by the experiments in the video conference system.

In 2004, Kim et al. proposed an improvement to Byun et al.’s client to client password-authenticated key exchange(C2C-PAKE) protocol in a cross-realm setting. However, the current paper demonstrates that Kim et al.’s C2C-PAKE protocol is susceptible to a one-way man-in-the-middle attack and a password-compromise impersonation attack. Also, we presents an enhancement to resolve such problems.

Web services have been enjoying great popularities in recent years. The high usability of the Web service is becoming a new focus for research. According to the demands of Web services, we present a fault-tolerant Web services architecture named FTWS based on the service approach and the reflection approach. Its characteristics are: (1) The fault-tolerant mechanisms are transparent, easy to use and also flexibly customized; (2) The fault-tolerant properties are flexibly configured; (3) The target service programmers almost needn’t to care the fault-tolerant mechanisms. The Architecture is set forth in detail in the article. The workflow of the system is narrated by three states of a fault-tolerant Web service.

The up- and mid-stream of Huaihe River Basin is a complex system of reservoirs and river-ways. It is difficult for flood control and reservoir scheduling. It is ineffective to perform sequential computations for optimal scheduling of multi-reservoir due to the system complexity. In this paper, we implemented the multi-reservoir optimal scheduling algorithm in a Grid environment. Key components as multiple Protocols were developed within the layers of Grid architecture. The proposed Grid computing architecture provides an innovative design of multi-reservoir optimal scheduling system for increasing the accuracy of flood control and speedup of computing.

Web component supports service-oriented development. This paper presents a logic foundation of Web Component and its rational inference capability. After the role of Web Component is analyzed, a semantic framework to describe Web Component with a modal logic is explored. The dynamic and intelligence of Web Component is addressed.

Grids, as one implementation of public computing, can be deployed by some middleware to integrate all kinds of resources across institutional boundaries, to tackle complex problems in scientific and engineering computation, data storage, scientific visualization, etc. In this paper, we propose a public computing grid framework built upon the hierarchical combination of two popular middleware products, Globus Toolkit (GT) and Sun Grid Engine (SGE). The communication between them can be conducted by Transfer-queue Over Globus (TOG). We discuss issues related to the deployment and the usage of this kind of hybrid grids. We examine it using serial programs and parallel program codes, and compare it with the grids deployed by only GT or SGE, respectively. The case studies imply that this hybrid grid is suitable for loosely coupled applications with high computational complexity.

This paper proposes a high-level scripting language, which can be used to express workflow for scientific and engineering tasks running on Computing Grid. Since it is difficult for common computing users to explore the grid computing resource successfully without computer-experts’ help; it is feasible that computing users should be presented an easy-study-and-use language to express their workflow and it is up to computer-expert to realize an interpreter to translate the scripting-language file into XML scripting language file. Furthermore, this destination file should conform to specification of BPEL4WS such that the prototype system realized will hold good expansibility.

This paper discusses the order-based deadlock prevention protocol with parallel requests (ODP

3

) [1]. From the analysis of theorems about ODP

3

, we found that the conclusions of paper [1] are not correct. The ODP

3

method is not free from deadlock and live-lock. An example is given to illustrate our deduction.

Because of the dynamic characteristics of a manufacturing system, long-term production plan and schedule are not feasible, neither is complete analysis of the manufacturing system and process in advance. In the paper, after the gap between theoretic researches and practical applications of workshop scheduling is analyzed, the hierarchical framework of agile manufacturing oriented workshop scheduling and control based on MAS is put forward. According to practical application requirements, traditional Petri net is expanded and RCPN is put forward to model workshop activities. Then, the architecture of workshop scheduling system based on RCPN is presented. Finally, the scheduling system that adopts 3-layer B/S/D mode is developed on Internet/Intranet by using Web database and Java The application of the system developed has been used at machine tool large parts workshop of Shaanxi Qinchuan Machinery Development Co., Ltd and the system has been proved to be effective.

In this paper, a web service composite platform is introduced which aims to compose the services dynamically. And more importantly, in order to get a most qualified composite service, a selection task needs to be done. And after carefully study on the special features of composite service, a relatively new QoS model is proposed in this paper based on which we also give the way of how to use this model to select the most appropriate composite service among several potential composite services.

Recent measurement studies show that the object popularity distribution in Kazaa file sharing systems deviates significantly from the Zipf distribution which is commonly seen for the World Wide Web. We measure a real BitTorrent network and we figure its object popularity distribution, which also shows, on a log-log scale, a non-Zipf curve with flattened head. The fetch-at-most-once behavior of peer-to-peer (P2P) client is responsible for such a non-Zipf distribution and we propose two mathematical models to describe this. The models are based on different probability assumptions, though both indicate flatter heads in object popularity distribution curves than Zipf would predict. Our models provide theoretic tools to analyze differences between P2P file-sharing system and Web systems.

Internet has entered the age led by ICP (Internet Content Provider). Helping users to locate relevant information in an efficient manner is very important both to users and to ICP services. This paper presents a new approach that employs a modified fuzzy ART network to group users dynamically based on their Web access patterns. Such a user clustering method should be performed prior to ICPs as the basis to provide personalized service. The experimental results of this clustering technique show the promise of our system.

This paper presents an interactive news announcer robot system IRIOS that performs on the humanoid robot, Robovie. IRIOS satisfies the interest trend requirement and the topic change requirement for a capricious user by Time Conscious(TC)-TfIdf vector. The results of experiments showed that TC-TfIdf strategy satisfied both requirements while other strategies did not.

Recently, RFID (Radio Frequency Identification) technology is practically applied to a number of logistics processes as well as asset management, and RFID is also expected to be permeated in our daily life with the name of ’Ubiquitous Computing’ or ‘Ubiquitous Network’ within the near future. The R&D groups in global now have paid attention to integrate RFID with mobile devices as well as to associate with the existing mobile telecommunication network. Such a converged technology and services would lead to make new markets and research challenges. However, the privacy violation on tagged products has become stumbling block. We propose light-weight security mechanism which is constructed by mobile RFID security mechanism based on WIPI (Wireless Internet Platform for Interoperability). WIPI-based light-weight mobile RFID security platform can be applicable to various mobile RFID services that required secure business applications in mobile environment.

Mobile information community develops quickly, as mobile telecommunication technology matches to the third generation. XML-based GIS becomes a global standard and the foundation. Recent developed Geography Markup Language (GML) allows integration of GIS location-based services, telematics, and intelligent transportation systems. In this paper, we propose a tourism information system for supporting the location based service of GIS applications. The system implements thin-client/server technology for mobile Web mapping service. The system includes traditional GIS system for navigation service and location finder POI services. The system for location and POI determination with design concerns are presented. An experimental user interface of PDA within the system is illustrated for the system procedures.

Bio-inspired approach for network security is appealing because of the obvious analogies between the security of network systems and the survival of biological species. However, nearly all the existing researches only focus on some facets of network security using partial security mechanisms of biosystem. In this paper, a comprehensive bio-inspired model for network security is proposed to fully exhibit the performances by which the biology achieves security. The analysis shows that the model can not only provide a framework for researchers but also offer some new research angles for pursuers in the field.

The paper analyzes the state of the art of partner selection and enumerates the advantage of partner selection based on gray relation analysis comparing to the other algorithms of partner selection. Furthermore, partner selection system based on gray relation for an Agile Virtual Enterprise (AVE) is analyzed and designed based on the definition and characteristics of the AVE. According to J2EE mode, the architecture of partner selection system is put forward and the system is developed using JSP, EJB and SQL Server.

Static single assignment (SSA) is a key technique in compiler optimization. Lengauer-Tarjan is a fast algorithm for finding dominators in a flow-graph during the implementation of SSA. There are many useless calls to the recursive function EVAL in Lengauer-Tarjan, and it causes to execute many calls and returns. To solve these problems, an algorithm searching for real-time best-point, which is called RTBP (Real-Time Best-Point), is presented. The criterions related to RTBP are introduced. The causes of capacity differences between RTBP-based Lengauer-Tarjan and EVAL-based Lengauer-Tarjan are comparatively analyzed in theory. Then a static experiment is projected for illustration. Being used in Lengauer-Tarjan, RTBP can save a great deal of runtime and storage space. In a good many circumstances, the Lengauer-Tarjan based on RTBP is more efficient than EVAL-based Lengauer-Tarjan.

This paper presents the study of a XML-based geospatial metadata system. After a brief review about relevant XML technology, a data structure of XML document is introduced. The conversion between relational database and XML document are discussed, with emphasis on the algorithm of function form, XML file, and the algorithm appraisement. The deployment of the XML technology system on the geospatial metadata system with public traffic transfer algorithm is given.

The process to explore application integration for enterprise information system is called Enterprise Application Integration (EAI). Generally, EAI that based on the peer-to-peer has many limitations, such as poor extensibility, difficulty of management, and high-cost etc. These disadvantages can be overcome by Web services technology which helps to integrate large-scale, distributed enterprise applications together. This paper presents a framework of EAI which based on Web services, and gives discussions on its major functional modules.

This paper introduces the reader to the design considerations and implementation in the development of a client server system for GE Healthcare Technologies (GEHT). It assesses the viability of using new technology to implement a secure reliable distributed system. It also discusses the advantages of the new Microsoft.Net platform over established technologies. Finally, it concludes that the new system can provide data capture and retrieval functionality using a mobile computing device to pass data to an information system for GEHT employees across the globe. Throughout the report the design documentation is represented in the form UML documents to enable the reader to comprehend the workflow and lines of communication of the proposed system.

The paper focuses on the implements of distributed parallel computing on Scilab, a wide-used Grid environment. Netbutterfly Grid Computing System (NGCS) is designed , Some of key issues, such as the architecture of NGCS ,job distributing, system communications, fault tolerance and security problem are analyzed and discussed. And a new science computing method is advanced. Finally, an example on Grid computing environments is presented. The experiment shows that it’s the results are satisfying.

XML becomes a standard format for data interchanges on Internet, especially in E-commerce. Although XML technology has been widely used, the research and development on XML security is still at the early stage. The control of XML access is important for protecting XML documents from being illegally modified or accessed. Most of available models utilize a single level check point. In this paper, we proposed an access control model with dual level access control: file-level and element-level (or attribute-level). The model allows adopt the XBLP policy with file-level security, while employs Hide-Node View for element-level security. The architecture framework of the access control model and implementation are briefly described.

Appearance of GridFTP in Grid won’t substitute the old data transfer protocols, however, existing data servers confuse the users and applications. There is no unified data accessing approach. This paper proposes an implementation of web based adaptive Grid data transfer solution over multiple protocols. The system is made up of three tiers: a transfer core named PAFTP, transfer service based on WSRF, and portlet application. The core hides diversity of various protocols and provides a universal interface to higher level data access. This solution not only offers multi-protocol reliable data transfer, simple file operation and monitoring on transfer status, but also emphasizes performance of mass file transfer.

In this paper we propose an optimal search strategy for web-based 3D model retrieval. Special considerations are given to the determination of the target’s initial probability distributions. Two optimal search strategies are derived by using Lagrange multiplier method. Experimental results shows that this approach is more efficient than random search.

This paper describes our efforts to develop visualization service on the Grid. The focus of this paper is our work on grid-enabling the ParaView, a widely used parallel visualization software package. Upon the analysis of the ParaView source code, the architecture as well as the implementation of ParaView-based client side cooperation of object visualization has been presented. Furthermore, the deployment of the collaborative ParaView as a visualization service in the Grid has been addressed.

Grid computing is the cutting-edge computing technology which is promising to aggregate large-scale and geographically-distributed computing resources for next generation of computing. Though the Grid computing is popular in today’s IT infrastructure, the concrete service-oriented Grid environment (system) is difficult to develop. Quality of Grid Services (QoGS) shields the heterogeneity of available resources. Such a QoGS requires interoperability between Grid resources and a consistent developer’s interface, which must be specified by feasible and applicable virtual organizations (VO). In addition, an economic model of Grid community may also be considered. With the consideration of the behaviors and characteristics of such desirable Grid systems, an architecture and model of service-based BSP or ServiceBSP (service-based Bulk-Synchronous Parallelism) is proposed, at the aim at establishing a high interoperation and high quality cooperation between each Grid service, while developing an efficient mechanism to evaluate the performances of Grid applications.

In recent years, with the rapid development of network technique and network bandwidth, the network attacking events for web servers such as DOS/PROBE are becoming more and more frequent. In order to detect these types of intrusions in the new network environment more efficiently, this paper applies new machine learning methods to intrusion detection and proposes an efficient algorithm based on vector quantization and support vector machine for intrusion detection (VQ-SVM). The algorithm firstly reduces the network auditing dataset by using VQ techniques, produces a codebook as the training example set, and then adopts fast training algorithm for SVM to build intrusion detection model on the codebook. The experiment results indicate that the combined algorithm of VQ-SVM can greatly improve the learning and detecting efficiency of the traditional SVM-based intrusion detection model.

The rapid growth of data exchange on the networks has brought on many critical problems that require an answer. Generally, Internet data exchange systems are based on traditional client/server architecture, which models are less scalable and bring on especially high maintenance cost in the data ex-change domain. For these reasons, we present a workflow-based message-oriented middleware (WMOM) system model for asynchronous communication platforms. The model combines workflow mechanism and message-oriented middleware. It not only makes applications to be isolated from communication network, but also improve the flexibility and scalability.

There exists a difference between traditional control mode and Web interface based one. Operation consistency of Web interfaces is not guaranteed by the traditional control mode. This paper presents a Petri-net based approach to analyze the design of Web interface. The proposed method can be used to identify interface inconsistency and convert interface operation model featured by Petri-net for increase the coverage ability of graph; hence improving the graph. Finally, the paper describes the consistency rules for various operations using XML protocol with the aim at achieving standardize operations of user interface.

A new multilevel transaction schedule algorithm based on transaction segments is proposed as a high-ready-wait algorithm. A multilevel transaction is divided into several transaction segments. High security level transaction segments are executed if there aren’t any conflicted low security level transaction segments. Transaction segments are committed in an increasing order of security levels in multilevel transactions. This algorithm eliminates the read-firstly semantic dependency and write-firstly semantic dependency in multilevel transactions without using multi-version, so it can be implemented using un-trusted codes. The algorithm is described and proved that it is A-CIS-correct in this paper.

Combining the paths similarity and the pages content similarity, a novel clustering algorithm is presented. The actions character of users is revealed more exactly by clustering. The data scale is reduced by a long way during clustering. Based on the clusters, the user navigation patterns are generated by mining the Web log. The experiment result shows that the user navigation interest conversion patterns mined from Web log are typical and intuitionistic.

Recently many enterprises have established their own software component repositories. Because of the physical isolation to each other and independent decision on the classifying and specification mechanisms, the repositories form a distributed and heterogeneous system, hindering the reusability of component resource. Due to the infeasibility of integrating all the repositories physically, it is necessary to use a collaborative way to integrate such repositories and form a logically uniform architecture with consistent user interface and retrieval mechanism, to improve the reuse of software components. In this paper we propose an architecture of integrated system based on intelligent agent, and make use of ASM in its architecture design, which can be validated formally. This architecture implements the required fundamental functionality.

It is difficult to collect information over Gigabit networks for infor-mation audit. In the paper, the information audit system adopts the network processor to collect and analyze the date in the low level of network. Through taking an advanced research on current algorithm, some improvements of the Bayes categorization algorithm have been made as well as the proposal of a text categorization model of the minimal risk Bayes decision. In addition, it considers the risk probability of mistaking the related text for unrelated text during the text categorization. The experiments results show that it promotes the precision of text categorization.

This paper discusses the consistency of component composition and Web service composition, therefore all kinds of distortions during component composition are defined and analyzed, and then some distortion cases are discussed, and from the view of the semantic of function behavior qualitative analysis is conducted of the possible distortion cases that several composition modes may lead to, in order to evaluate the system distortion and provide a evaluate model for distortion testing.

It is challenge for an interoperable multi-agent system (MAS) to understand the communications among software agents. With the standardization of ontology, the semantic Web services can make the communication more flexible and automated. This paper presents an ontology-based, runtime semantic solution for solving the interacting problem between two agents. The paper demonstrates how to employ the OWL description and service ontology to a Request for Quote (RFQ) scenario, and how to develop a methodology for runtime semantics.

During the process large-scale XPath queries against fast XML streams on Internet, a bottleneck occurs due to the lack of memory for filtering. This paper presents an effective automaton method to reduce the memory need by diminishing the tedious operators (such as “//” and “*”) in XPath expressions. The method contains a product automata to convert XPath to the actual path; thus to reduce the complexity in search space. The proposed method was implemented in MFSA (

M

ulti-

F

inite

S

tates

A

utomata) system for filtering queries of subscribers. The empirical evidence shows its efficiency and stability when the scale of queries is large.

Transitive signature is a new and useful cryptology tool for information security, Internet security, and e-commercial security. Most of the current transitive signature schemes are stateful, which increases the store cost and impacts the computing efficiency of signing algorithm. In this paper, a new practical method is introduced to transform the state transitive signature schemes to the stateless ones without loss their security. According to the proposed method, three concrete stateless transitive signature schemes based on Factoring and RSA are presented respectively. Under the moderate assumption, two schemes are secure against the adaptive chosen-message attacks in random oracle model.

The emergence of Web services opens a new way of Web application design and development. It has led to more interest into Web service composition, which is an active area of research. The formidable problem of efficient and effective composition of existing Web services is the subject of much current attention. The study of modeling is one of the most important parts and a key layer of Web service composition. Therefore, there is a need for modeling techniques and tools for reliable Web services composition. In this paper, we propose a method used an Advanced Object-Oriented Petri Net (AOOPN) to model and evaluation the process of Web services composition. This method is expressive enough to capture the semantics of complex Web services combinations.

Due to the resources in the Grid are heterogeneous and geographically distributed, the management of resources and application scheduling in large-scale distributed Grid environment is a complex undertaking. Intelligent agents can play an important role in solving these problems. In this paper we formulated this problem as a multi-agent game with the players being agents purchasing service from a common server. We strive to highlight major challenges in managing resources in a Grid computing environment and present some of our recent works on multi-agent negotiation strategies for resource management and scheduling in grid environment. The proposed approach is to realize multiple negotiation models/protocols/strategies that can be selected by the system automatically to adapt to computation needs as well as changing computing resource environment.

Computational science is an important and urgent field with multi-disciplinary research. Many science and engineering explorations rely on mature, efficient computational algorithms and implementations, practical and reliable numerical methods, and large-scale computation systems. Since scientific computation consumes many computer resources. And some function quality parameter such as error or max loop times, impact much on function executing. Applying Web services to scientific computation differs from other usage situation of Web services. This paper described the service template as the data structure to discover services, and discuss the algorithm of the similarity degree between ST and SO based on QOS of Web service.

A common framework, which can be used to analyze the two-party security protocols, is proposed in this paper. With the common framework, a common program is developed in order that any two-party security protocol can be automatically analyzed through SMV with slight modification of the common program. Finally, we illustrate the feasibility and efficiency of the common program analysis with the SSL 3.0 protocol as a case study.

In this work, an integrated Web-based model integrating a number of components has been proposed to analyze, manage and retrieve biological information. In particular, we deal with Expressed Sequence Tags (EST) data that is an important resource for gene identification, genome annotation and comparative genomics. A high-performance and user-friendly three-tier Web application consisting of EST modeling and database (ESTMD) has been developed to facilitate the retrieval and analysis of EST information. It provides a variety of Web services and tools for searching raw, cleaned and assembled EST sequences, genes and Gene Ontology, as well as pathway information. It can be accessed at http://129.130.115.72:8080/estweb/index.html.

Wireless computing becomes most popular with the development of mobile computers. Cache technique in wireless computing is crucial because it facilitates the data access at clients for reducing servers’ loading, hence improve the performance. However, conventional cache technique requires coherence between servers and clients because of frequent disconnection. The cache invalidation strategy becomes an ideal method. In this paper, a category on the cache invalidation is proposed. To evaluate system performance, a mathematical model is proposed. It will develop high performance cache technique for practical wireless mobile computing.

The continuous blending of boundaries between personal and corporate data leads to overall enterprise information and knowledge pervading not only common but personal data sources. To fully sharing potentially useful information within entire enterprise, there are growing needs of a generic, interoperable, and flexible infrastructure to integrate and coordinate information across corporate and individual desktops on semantic or knowledge level. In this context, we introduce ESD, a desktop information sharing infrastructure based on Semantic Grid vision to achieve adaptive and intelligence information sharing across enterprise corporate and personal desktops. A primary framework for ESD is introduced based on the analysis of key criteria in realizing the vision of an infrastructure for information sharing, management, searching, and navigating on desktop grid. Focuses of this position paper are placed on the background, vision and the outline of ESD approach.

Wireless Sensor Networks (WSN) is a research hotspot in recent years and has yielded many fruitful results. However, the biomedical applications of WSN haven’t received significant development due to its many unique challenges for the engineers and physicians. In this paper, a system architecture solution of body area network (BAN), our so called project “MediMesh”, is presented. A biomedical dedicated BAN node hardware platform is devised to fit the medical monitoring application. The sensor node is built up especially for healthcare monitoring while the biocompatibility and portability are considered. A light weight network protocol is designed considering the radiation effect and communication overhead. After data acquisition from sink stations, a data publishing system based on web service technology is implemented for typical hospital environment. The publishing of biomedical data is realized through 3 phases: first storing the data automatically in a database, then creating information sharing service by using Web Service technology, and finally allowing data access by the physicians and end users.

Component technology plays a key role in the field of software reuse. Components can be reused under various business environments through its changeability .This paper proposes a feature-based semantics model of reusable component, which describes semantics of components by using domain feature space and expresses changeability of components through five kinds of changeable mechanisms of domain features. In addition, this study proposes a self-contained classification of features according to enterprise business model, divides semantics structure and hierarchical relation of three kinds of components, and sets up mapping relations between semantics model of component and business model. The model is verified through the case study of a Web-based information platform for logistics enterprise.

In this paper a distributed IDS systematic model based on mobile agents is proposed and the functions of key modules are described in detail. Then the key modules are implemented in mobile agent platform-IBM Aglets and the results of experiments are discussed and analyzed quantitatively.

Debugging can help programmers to locate the reasons for incorrect program behaviors. The dynamic and heterogeneous characteristics of computational grid make it much harder to utilize the traditional parallel debuggers to debug grid applications for their defects in architecture. In this paper, we propose a new parallel debugging environment based on grid services, which support the information sharing and resource interoperation. Some new debugging functionalities oriented to Grid applications are appended. The architecture of the proposed debugging environment has high portability and scalability.

E-mail pervades many aspects of our lives and is becoming indispensable communication method in areas such as commerce, government, production and general information dissemination. To maintain the security and usability of the e-mail system, every effort must be made to efficient monitoring e-mail traffic and protecting against various types of spam maker. In this paper, we design and implement a web-based 3D visualization system, monitoring the e-mail traffic and providing based on statistic suspicious activities analysis. Our system also provides convenient interactive user interface for selecting interest watching object and different type of analysis method. Our results indicate that analysts can efficient examine the e-mail traffic and rapidly discover abnormal user activities.

Software composition is one of major technologies in component-based software engineering. The combination of Internet computing and software engineering prompts great potentials for future software industrials, and extend the scope of software applications. For example, Web service-based software development becomes the next generation software to be used in distributed systems. In this paper, presents a newly-developed software architecture using Web service based composition technique.

Event injection is a new technique for evaluating dependability of target system, and it’s developed on the basis of fault injection techniques. This paper proposed an event injection system for assessing dependability of computer network system, analyzed the event injection in details, and described the course of event injection and the key techniques. Finally, the testing results of the response time and average flow speed of network server by DoS attack experiments are given.

The response taxonomy is a key to realizing automatic an intrusion response system as it provides theoretical framework for responding coherently to attacks. This paper presents a new taxonomy called 5W2H on the basis of analyzing the taxonomies, and the application prototype running over IBM Aglet is given.

The WWW can be viewed as digraph with Web nodes and arcs, where the Web nodes correspond to HTML files having page contents and the arcs correspond to hypertext links interconnected with the Web pages. The Web cycle resolution is one of the problems to derive a meaningful structure out of the complex WWW graphs. We formalize our view of the Web structure from Web as a graph approach to an algorithm in terms of proofing the repetitive cycles. We formalize the Web model that prevents the Web structuring algorithm from being bewildered by the repetitive cycles. The complexity of the corresponding algorithm has been addressed fairly enhanced than the previous approaches.

The several moving object query languages have been designed to deal with moving objects effectively. However most of them are not enough to manage vehicles in transportation system. So, to analyze vehicle information in transportation effectively, we propose the web-based transportation vehicle management system supporting a Moving Object Structured Query Language. The developed system can manage vehicles through examining the history data of vehicles such as departure time, overlapped trajectories, and the distance among vehicles and provide the vehicle information on the internet and a PDA through concurrently processing the query language transmitted from clients.

This paper discusses issues in web-based cooperative design for SoC and gives the web-based design flow. Good partitioning is the precondition of web-based cooperative design. Then the paper focuses on the issue of architecture exploration, improved a partitioning algorithm. The proposed greedy partitioning algorithm introduces a guiding function which is decided by four factors: criticality, saved time, frequency and area of tasks. It stresses the tasks on the critical path, and can improve the resource use efficiency and maximize the system performance.

The paper introduces MVC design pattern briefly, then discusses the Struts framework based on J2EE MVC pattern and finally gives the development procedure of how to design Web application with Struts framework. From this we can see that software framework and component reuse can enhance the efficiency of software development, offer clear responsibilities between Web page designers and software developers and improve system maintainability and extensibility.

In this paper, we propose an efficient grid-based multi-scale PCA method in the large face database. This method divides the large face database into some small sub-face databases by maximizing the variance in the face sub-database and minimizing the variance between the face sub-databases, then it segments the recognition process into the local coarse profile recognition process and accurate detailed geometric sub-component analysis process, and assigns the local coarse profile recognition process to the nodes of the multimedia service grid to reduce the recognition time. Our experimental results show that with the increase of the face database, this method not only reduces the recognition time, but also remarkably increases the recognition precision, compared with other PCA methods.

This paper presents a grid-based parallel elastic graph matching face recognition method. We firstly divide the face into several sub-regions by geometric features decomposing algorithm, and match the sub-regions of probe face image with the corresponding sub-regions of the sample faces by sub-region elastic graph matching algorithm, and these matching processes can be assigned onto a lot of nodes in the multimedia service grid and scheduled by the optimal costs algorithm. Eventually, we obtain the match degrees between the probe face and the sample faces by integrating the weighted matched results of sub-regions. We carried out extensive experiments on the special face database and HMMC standard face recognition database. Compared with the previous algorithms, our algorithm offers better recognition accuracy and more rapid recognition speed.

The paper expatiated the practical demands of information resource and technology with modern manufacturing enterprise, and analyzed the causation forming islands of information in allusion to information system construction of enterprise. And adopting the enterprise application an integrated application framework of enterprise Business Process Management (e-BPM) based on Web service with distributed network is introduced. It will promote the enterprise integration effectively of all kinds of legacy systems and new application systems, and more accelerated the information project implement of Aero manufacturing.