Search

In composing and using services, user's requirements are subject to uncertainty and changes. It can be difficult for users to maintain an overview of all available services and to make good choices among them. This paper proposes an approach to proactively recommending suitable services to users. Our major contribution is to have devised a novel user-interest model to describe user's interests adaptively. A reasonable way is put forward for picking up suitable services timely and its key problem is defined formally. Important properties of the model are theoretically proved, and the effectiveness of recommendations is verified with prototypical implementation and tryouts in public service area. [ABSTRACT FROM AUTHOR]

In this paper the problem of refining user queries on a trader of location-based services (LBSs) is faced by using two kinds of similarity (structural and semantic). LBSs typically concentrate on providing users with information about points of interest or on the support for navigation and routing tasks. Personalization is a key feature of LBSs that improves their usability and involves a process of gathering user information during interaction with the user. This information can be used to deliver appropriate content and services, tailor made to the user's needs. The approach proposed in the paper can be applied to any kind of location-based services, it is independent from the specific domain, it takes into account spatial information and, finally, it allows the user profiles to be acquired explicitly and implicitly. [ABSTRACT FROM AUTHOR]

This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the message from the source to the destination. In theory, models that have been used oversimplify the problem of route discovery in ad hoc networks. The achievement of this paper is threefold. First we use a more general model in which nodes can have different transmission and interference ranges and we present a new routing algorithm for wireless ad hoc networks that has several nice features. We then combine our algorithm with that of known greedy algorithms to arrive at an average case efficient routing algorithm in the situation that GPS information is available. Finally we show how to schedule unicast traffic between a set of source-destination pairs by providing a proper vertex coloring of the nodes in the wireless ad hoc network. Our coloring algorithm achieves a O(Δ)-coloring that is locally distinct within the 2-hop neighborhood of any node. [ABSTRACT FROM AUTHOR]

Here, we present a generalized notion of online modes of encryption that make one call to a pseudorandom permutation per block of plaintext. This generalization, called "Canonical Form," not only allows for modes of encryption to be written in a common format, but provides for easy proofs of blockwise-adaptive chosen-plaintext (BACPA) security/insecurity. We also develop necessary and sufficient conditions for security of a mode of encryption in Canonical Form. As an application, we write ten modes of encryption in Canonical Form, and we prove the security status (under BACPA) of nine of them. While most of these modes already had proven BACPA security status in previously published papers, it is hoped the more general method specified here will be of use in writing simpler proofs for other modes, including modes of encryption yet to be developed. BACPA is a model for adversaries slightly more powerful than those in traditional chosen-plaintext attack. In particular, instead of forcing the target to encrypt messages of his/her own choosing, the attacker can insert blocks of his/her own choosing into the target's messages [JMV02]. Some modes of encryption which are secure against traditional CPA, for example the ubiquitous Cipher Block Chaining (CBC), are insecure against BACPA. Several papers have been written to explore BACPA and modes of encryption under it. [ABSTRACT FROM AUTHOR]

In this paper we consider a problem of privacy preserving surveillance and monitoring in sensor networks. We propose a framework and a solution of the problem based on multi-party computations. Our approach use pattern matching on data streams from sensors in order to monitor and detect events of interest. We study a privacy preserving pattern matching problem where patterns are defined as sequences of constraints on input data items. We describe a new privacy preserving pattern matching algorithm over an infinite alphabet A where a pattern P is given as a sequence $\{p_{i_1},p_{i_2},...,p_{i_n}\}$ of predicates $p_{i_j}$ defined on A. The algorithm addresses the following problem: given a pattern P and an input sequence t, find privately all positions in t where P matches t. The privacy preserving in the context of this paper means that sensor measurements will be evaluated as predicates pi(ej) privately, that is, sensors will not need to disclose the measurement values to the monitor. [ABSTRACT FROM AUTHOR]

There has been significant effort to build high throughput computing systems out of many distributed multimedia servers. These systems should accommodate a larger number of servers and should handle the ever-growing user demands. Recently, Grid computing has become one of the promising technologies that can deliver such a system. Among the many problems encountered in building Grid computing systems, resource discovery, overhead reduction, workload balancing and fault tolerance are the most challenging. In this paper, we present a resource discovery and allocation mechanism (RDAM) in a computational Grid system. [ABSTRACT FROM AUTHOR]

Intrusion detection, especially anomaly detection, requires sufficient security background knowledge. It is very significant to recognize system anomaly behavior under the condition of poor domain knowledge. In this paper, the general methods for system calls anomaly detection are summarized and HMM used for anomaly detection is deeply discussed from detection theory, system framework and detection methods. Moreover, combining with experiments, the detection efficiency and real-time performance of HMM with all-states transition and part-states transition are analyzed in detail in the paper. [ABSTRACT FROM AUTHOR]

The interactive digital multimedia broadcasting stands for a convergence application between digital multimedia broadcasting service and wireless internet service. It develops MPEG-4 BIFS (Binary Format for Scene) technologies which is standard component of associated data service for DMB. In this paper, we propose system architecture of the interactive DMB, called the interaction manager. The interactive DMB facilitates to transmit interactive contents and user can easily use these contents by clicking or typing some additional information. The proposed interactive DMB system can capture and response user interaction information by using the return channel. In this paper, we are mainly focused on extracting the event data of the user interaction on the device. We suggest an analyzer to catch the user event and transform into a specific format for bidirectional DMB service system. [ABSTRACT FROM AUTHOR]

Pattern matching is one of the most performance critical components in network intrusion detection and prevention system, which needs to be accelerated by carefully designed architectures. In this paper, we present a highly parameterized multilevel pattern matching architecture (MPM), which is implemented on FPGA by exploiting redundant resources among patterns for less chip area. In practice, MPM can be partitioned to several pipelines for high frequency. This paper also presents a pattern set compiler that can generate RTL codes of MPM with the given pattern set and predefined parameters. One MPM architecture is generated by our compiler based on Snort rules on Xilinx FPGA. The results show that MPM can achieve 4.3Gbps throughput with only 0.22 slices per character, about one half chip area than the most area-efficient architecture in literature. MPM can be parameterized potential for more than 100 Gbps throughput. [ABSTRACT FROM AUTHOR]

This paper presents a method of integrating activity-based costing (ABC) and process simulation in human planning. Our studies have already proposed a method of integrating ABC and process simulation in business process reengineering (BPR) and showed a case study of a chemical plant. Some studies have also already showed some examples of various aspects in manufacturing systems. Although a large number of studies have been made on product-mix/machine loading or scheduling, little is known about human planning. In this paper, effective BPR methodologies to achieve dramatic improvements in business measures of workers' skills and costs based on ABC are discussed. First, two important tools: process simulation method and ABC analysis that can be customized by organizations for their own BPR are shown. As these tools have been separately used, a unified approach of process simulation and ABC analysis for process redesigns based on simulation. Secondly, a method of process simulation design is shown. It is repeated to consider working ratio and running time of resources. Thirdly, a method of ABC analysis that can be customized by organizations is shown. It automatically shows the data that has been gathered from many sources. By utilizing the data, the process simulation is implemented, and the result of simulation gives the data to ABC analysis. Lastly, this paper shows a case study in BPR and the effectiveness of our method. [ABSTRACT FROM AUTHOR]

Higher expectations on supply chain performance force organizations to reinvent themselves in order to cut costs and increase customer service, all to gain competitive advantage. Pursuing the best network of manufacturing, supply and distribution facilities relative the marketplace is therefore on top of many managers "most wanted" list concerning supply chain management. Supply chain planners are thus in need of decision support to be able to establish feasible and sufficient plans. This paper discusses how decision support through advanced planning systems (APS) can assist tactical supply chain planning. A case study is presented showing how APS can act as an enabler in adapting logistics and supply chain principles, as well as reducing costs through streamlining the supply chain. The purpose of this paper is primarily to present findings from a case study regarding supply chain planning with the aid of a master planning APS-module. The case study emphasize that APS in the scope of logistics management have several positive effects on supply chain performance. [ABSTRACT FROM AUTHOR]

H.264/AVC is the newest international video coding standard. This paper presents a novel hardware design for CABAC decoding in H.264/AVC. CABAC is the key innovative technology, but it brings huge challenge for high throughput implementation. The current bin decoding depends on the previous bin, which results in the long latency and limits the system performance. In this paper, the data hazards are analyzed and resolved using the algorithmic features. We present a new pipeline-based architecture using the standard look-ahead technique where the arithmetic decoding engine works in parallel with the context maintainer. An efficient finite state machine is developed to match the requirement of the pipeline controlling and the critical path is optimized for the timing. The proposed implementation can generate one bin per clock cycle at the 160-MHz working frequency. [ABSTRACT FROM AUTHOR]

Electronic product code (EPC) sensor network is a collection of objects for sensing data. It is crucial to ubiquitous society. It can provide an application service based on situation dependency with its properties. The situation dependency is an emerging concept which can collect location-based and personalized information. With the situation dependency, many industries can serve ubiquitous service for independent users. u-Healthcare is one of ubiquitous service to provide seamless medical treatment. The concept of situation dependency is applied in u-Healthcare with EPC sensor network technology. Due to specialized four properties of EPC sensor network which are driven from this paper, the situation dependency is well-established in u-Healthcare service. In this paper, we defined value and architecture of u-Healthcare service and we analyzed application areas of u-Healthcare. [ABSTRACT FROM AUTHOR]

This paper describes the limiting factors for building a virtual Telematics center which integrates ITS (Intelligent Transportation Systems) information collected by the system of each of the three government agencies. It also provides some details into how some of the obstacles and barriers can be solved such as data standardization, system mechanisms and regulations. There are very few papers and case studies regarding real problems and solutions for integrating systems of different organizations in general, and Telematics, in particular. The processes and outcomes of implementing systems in this study can be useful to develop other ITS and Telematics systems. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to propose a decision making model for the Taiwanese shipping logistics company in China to select the best container distribution center location. The representation of multiplication operation on fuzzy numbers is useful for the decision makers to solve the fuzzy multiple criteria decision making problems of container distribution center location selection. In the past, few papers discussed the representation of multiplication operation on multiple fuzzy numbers. Thus this paper first compute and obtain the representation of multiplication operation on multiple fuzzy numbers. Based on this representation, the decision maker can rank quickly the ordering of each alternative location and then select easily the best one. Finally, the representation of multiplication operation on multiple fuzzy numbers is applied to solve the fuzzy multiple criteria decision making problem of container distribution center location selection in China. [ABSTRACT FROM AUTHOR]

This paper proposes new method for object reference which enables a person to find surrounding objects and develops a navigation system named CoCo. CoCo employs an ultrasonic directional speaker with a rotating base. Ultrasonic wave transmitted by an ultrasonic directional speaker is converted to audible sound when it reflects on floor, wall, or object. Based on this property, CoCo can emit audible sound from arbitrary place using a rotating base. When CoCo navigates a person to an object, CoCo transmits ultrasonic wave so as to hear audible sound continuously from the line between the ultrasonic directional speaker and the object. We designed and implemented an object management system as an application using 3D position sensors and a navigation system CoCo. This paper shows how CoCo navigates a person to an object using position data from an object management system. [ABSTRACT FROM AUTHOR]

There is amble evidence that supports true interactivity, both in the interface and in the presentation methodology, will further enhance learning and knowledge retention among students. The real challenge is how to implement it, measure and evaluate this outcome. This paper presents findings that look into the efficacy of the combination of virtual environments and interactive teaching techniques in enhancing learning and increasing the knowledge retention level of students.It is now widely accepted that the conventional way of lecturing students has certain limitations. E-learning and the use of ICT, interactive tools in the education field has proven to be effective in assisting the teaching and learning experience. It has been observed that the one way communication method of lecturing with limited or no opportunity for feedback from students and audiences in general has a major impact on their attention span and the retention level. There are issues related to the establishment and implementation of interactive learning tools as an aid for teaching and especially in continuous evaluation of students' achievements. We point out that it is not only the 'teaching' tasks that are impacted by the use of ICT but also current methods of evaluation including written examinations which have proven to be time consuming and inaccurate reflection of students' achievements. The introduction of interactive learning and evaluation has several advantages and this paper will give a convincing support to the fact that the advantages are more than the fact that it makesthe teaching and evaluation process easy, simple and rapid. Educators should not fail to adapt and respond to the needs of 21st century bust and multi-tasking students for innovative learning methods, i.e. interactive learning. The role of education institutions and educators in the future will become demand-driven; to satisfy technically sophisticated student clients. The paper recommends that we should not ignore the use of interactive technology used as it should be, as a tool, to enhance sound pedagogical methods, however, we should also be able to measure its contribution in enhancing teaching and learning. It is pertinent to synthesize a framework that encompasses ways to compliment existing methods of teaching with interactive learning. [ABSTRACT FROM AUTHOR]

As extensive amount information is required within a R&D environment, an automated information system could save a considerable amount of time and efforts. There are currently many researches to overcome the information overload phenomenon, including information systems, recommender systems and adaptive hypermedia, and this paper presents an adaptive information providing system utilising some characteristics of these technologies to support R&D and collaborative meeting environments. The system described in this paper aims to present the potential synergy between recommender systems and adaptive hypermedia systems. [ABSTRACT FROM AUTHOR]

Enterprises adopt the autonomous Grid computing as their ICT infrastructures in order to improve business flexibility and scalability. In this technology adoption process, Grid solution providers take roles as technology deciders and distributors. This paper investigates the effective decision factors that influence enterprises' technology choices through a survey among Grid solution providers. The survey evaluates the relative importance of decision factors using the conjoint analysis method. Survey results show that the interoperability is the most indispensable element to successfully install the Grid in enterprise ICT infrastructures. Based on the findings, this paper explains the market context that impacts the revealed technology choices. [ABSTRACT FROM AUTHOR]

In this paper, a load balancing method using ring network in the Grid database is proposed. Past research proposed to solve unbalanced load problem. But, past techniques can not be applied as the Grid database has a number of systems and user's request always changes dynamically. The proposed method connects each node having the same replicated data through ring network. If workload overflows in some node, user's request is transferred to a linked node which has the target data. And, this node stops another request from processing until the workload has significantly decreased. Then, to stop request forwarding from a previous node, it changes the link structure by sending a message to the previous node. Through performance evaluation, this paper shows that the proposed method has increased performance and is more suitable to the Grid database than the existing methods. [ABSTRACT FROM AUTHOR]

Clustering a peer-to-peer (P2P) network into distinct semantic clusters can efficiently improve the search efficiency and enhance scalability of the network. This paper considers P2P systems in which peers employ taxonomy hierarchy to describe the contents of their objects, and presents a taxonomy-based approach for constructing semantics-based super-peer networks. By dynamically clustering peers in taxonomy-based semantic space based on the semantics of their data and organizing the clusters into semantic routing overlays, an efficient query-routing algorithm can be used among these clusters. Preliminary evaluation indicates that our approach achieves a competitive trade-off between search latencies and overheads, and load-balancing among super-peers is well maintained. [ABSTRACT FROM AUTHOR]

The Optical Burst Switching (OBS) technology emerged as an alternative switching paradigm for the optical transport layer. Its biggest disadvantage (high data losses) has been the focus of numerous research papers. This paper proposes a data loss reduction technique, which relies on the combination of global network coordination between network nodes and local contention resolution. Via full-scale network simulation it is demonstrated that the proposed scheme has improved performance in terms of data losses and resource utilization, compared to its constituent mechanisms alone. Furthermore, the effectiveness of the mechanism has proven to be less sensitive to load variations in the medium and high load ranges. Additionally, its complexity and deployment cost are low, due to the absence of immature optical components in the network. [ABSTRACT FROM AUTHOR]

In this paper we discuss the use of the Session Initiation Protocol (SIP) as part of the control plane of an application aware Optical Burst Switching (OBS) network, able to support Grid computing applications. The paper presents the possible alternatives for the architecture of such control plane and reports of an experiment in an existing OBS test-bed where this approach was successfully tested in practice. [ABSTRACT FROM AUTHOR]

Automatic story unit segmentation is an essential technique for content based video retrieval and summarization. A good video story unit has complete content and natural boundary in visual and acoustic perception, respectively. In this paper, a method of acoustic perception friendly story unit segmentation for broadcast soccer video is proposed. The approach combines replay detection, view pattern and non-speech detection to segment story units. Firstly, a replay detection method is implemented to find the highlight events in soccer video. Secondly, based on positions of replay clips, an FSM (Fine State Machine) is used to obtain rough starting points of story units. Finally, audio boundary alignment is employed to locate natural audio boundaries for acoustic perception. The algorithm is tested on several broadcast soccer videos. The story units segmented by algorithms with and without audio alignment are compared in acoustic perception. The experimental results indicate the performance of the proposed algorithm is encouraging and effective. [ABSTRACT FROM AUTHOR]

Supporting multimedia search has emerged as an important research topic. There are three paradigms on the research spectrum that ranges from the least automatic to the most automatic. On the far left end, there is the pure manual labeling paradigm that labels multimedia content, e.g., images and video clips, manually with text labels and then use text search to search multimedia content indirectly. On the far right end, there is the content-based search paradigm that can be fully automatic by using low-level features from multimedia analysis. In recent years, a third paradigm emerged which is in the middle: the annotation paradigm. Once the concept models are trained, this paradigm can automatically detect/annotate concepts in unseen multimedia content. This paper looks into this annotation paradigm. Specifically, this paper argues that within the annotation paradigm, the relationship-based annotation approach outperforms other existing annotation approaches, because individual concepts are considered jointly instead of independently. We use two examples to illustrate the argument. The first example is on image annotation and the second one is on video annotation. Experiments indeed show that relationship-based annotation approaches render superior performance. [ABSTRACT FROM AUTHOR]

The development of video games is a complex software engineering activity bringing together large multidisciplinary teams under stringent constraints. While much has been written about how to develop video games, there has been as yet little attempt to view video game development from a quality perspective, attempting to enumerate the quality attributes that must be satisfied by game implementations, and to relate implementation techniques to those quality attributes. In this paper, we discuss desired quality attributes of 3D computer games, and we use the development of our own Life is a Village game to illustrate architectural tactics that help achieve these desired qualities. [ABSTRACT FROM AUTHOR]

In this paper we propose a Data Integration System based on an ontology as Global Representation. The paper briefly introduces the motivations and the benefits that the use of an ontology brings to a Data Integration System, which is also formally defined. The paper, in particular, focuses on the limitation of the proposed system to handle the different relations that can exist between concepts of an ontology. We divide the relations that can be defined in an ontology in two different sets: Mapped relations, which we consider atomic relations and Derived relations, which can be generated by combining mapped relations using SWRL rules. Some examples of the different kind of relations are reported to clarify the concepts and a new definition of Mapping in the Data Integration System is proposed, in order to define the atomic relations. The paper ends with considerations about the problems that still need to be considered. [ABSTRACT FROM AUTHOR]

Two major problems in constructing data federations (for example, data warehouses and database federations) concern achieving and maintaining consistency and a uniform representation of the data on the global level of the federation. The first step in creating uniform representations of data is known as data extraction, whereas data reconciliation is concerned with resolving data inconsistencies. Our approach to constructing a global conceptual schema as the result of integrating a collection of (semantically) heterogeneous component schemas is based on the concept of exact views. We show that a global schema constructed in terms of exact views integrates component schemas in such a way that the global schema is populated by exactly those instances allowed by the local schemas (and in special cases, also the other way around). In this sense, the global schema is equivalent to the set of component schemas from which the global schema is derived. This paper describes a modeling framework for data federations based on the Object-Role Modeling (ORM) approach. In particular, we show that we can represent exact views within ORM, providing the means to resolve in a combined setting data extraction and reconciliation problems on the global level of the federation. [ABSTRACT FROM AUTHOR]

It is common for literature on context-awareness to focus on specific application domains or on the development of models and frameworks to facilitate context-awareness. In this study, however, we take a step back from such work in order to investigate how regular people may already be employing, or trying to employ, context-awareness in their everyday lives using existing mobile tools (such as mobile phones, paper notepads, etc.). We believe that an understanding of these existing real-world uses and needs of context-awareness will help to better inform and direct research efforts in this domain. Towards this aim we present the findings of a user study in which twelve randomly selected individuals recorded a diary on their use of mobile tools over the period of two days. The findings clearly demonstrate that people do indeed currently employ a wide variety of contexts and context-aware behaviours, albeit in a manner that is often imperfect and at a sub-conscious level. [ABSTRACT FROM AUTHOR]

Security is becoming one of the major concerns for web applications and other Internet based services, which are becoming pervasive in all kinds of business models and organizations. Web applications must therefore include, in addition to the expected value offered to their users, reliable mechanisms to ensure their security. In this paper, we focus on the specific problem of preventing cross-site scripting attacks against web applications. We present a study of this kind of attacks, and survey current approaches for their prevention. The advantages and limitations of each proposal are discussed, and an alternative solution is introduced. Our proposition is based on the use of X.509 certificates, and XACML for the expression of authorization policies. By using our solution, developers and/or administrators of a given web application can specifically express its security requirements from the server side, and require the proper enforcement of such requirements on a compliant client. This strategy is seamlessly integrated in generic web applications by relaying in the SSL and secure redirect calls. [ABSTRACT FROM AUTHOR]

Group communication significantly influences the performance of data parallel applications. It is required often in two situations: one is array redistribution from phase to phase; the other is array remapping after loop partition. Nevertheless, the important factor that influences the efficiency of group communication is often neglected: a larger communication idle time may occur when there is node contention and difference among message lengths during one particular communication step. This paper is devoted to develop an efficient scheduling strategy using the compiling information provided by array subscripts, array distribution pattern and array access period. Our strategy not only avoids inter-processor contention, but it also minimizes real communication cost in each communication step. Our experimental results show that our strategy has better performance than the traditional implement of MPI_Alltoallv, alltoall based scheduling, and greedy scheduling. [ABSTRACT FROM AUTHOR]

In this paper, we present some new results on impossible differential cryptanalysis of reduced AES, which update the best known impossible differential attacks on reduced AES. First, we present some new attacks on 6-round AES (for all the three key length). Second, we extend to 7-round AES, also for all the three key variants. Especially for 128-bit keys, the best known results can attack up to 7 rounds using square attack and collision attack respectively, but their complexity are both marginal either on data or on time (ie. require nearly the entire codebook, or close to key exhaustive search). In this sense, our attack is the first non-marginal one on 7-round AES with 128-bit keys. Thirdly, we extend to 8 rounds for 256-bit keys, which is also non-marginal compared with the best non-related-key attacks so far. Finally, we give an improvement of the 7-round attack for 192-bit keys in R.C.W.Phan's paper, which makes the time complexity reduced greatly. [ABSTRACT FROM AUTHOR]

This paper presents Anahy, a programming environment for cluster computing. Anahy is presented in terms of its programming interface (API) and its scheduling mechanism. The main features of this environment are the specification of a POSIX thread-based API and the use of dynamic scheduling techniques based on Directed Acyclic Task Graphs (DAG). The main advantage obtained with these features is the dissociation between the description of the concurrency of an application and its parallel execution. The paper examines how Anahy builds a DAG describing the dependencies among tasks at execution time from a multithreaded program and how this DAG is handled by the runtime to apply dynamic scheduling techniques. The paper concludes discussing three case studies of applications developed in the context of Anahy environment. [ABSTRACT FROM AUTHOR]

This paper presents the use of the Multimedia C (MMC) language to develop multimedia applications. The MMC language was designed to support operations with multimedia extensions included in all modern microprocessors. Although the idea to extend high programming languages to support vector operations is not novel, we show that integration of multimedia extensions into C is valuable. This is specially true for idiomatic expressions which are difficult for a compiler to identify. The MMC language has been used to develop some of the most frequently used multimedia kernels. The presented experiments on these scientific and multimedia applications have yielded good performance improvements. Although this paper discusses the use of MMC, the key features of the MMC language and implementation of its compiler are also presented. [ABSTRACT FROM AUTHOR]

An optimization algorithm for dynamic Bayesian networks (DBN) based on Bayesian optimization algorithm (BOA) is developed for learning and constructing the DBN structure. In this paper, we first introduce some basic theories and concepts of probability model evolutionary algorithm. Then we describe, the basic mode for constructing DBN diagram and the mechanism of DBN structure learning based on BOA. The DBN structure learning based on BOA consists of two parts. The first part is to obtain the structure and parameters of DBN in terms of a good solution, and the second part is to produce new groups according to the obtained DBN structure. In this paper, the DBN learning is achieved by genetics algorithm based on a greedy mechanism. The DBN inference is performed by a forward-simulation algorithm. Simulation results are provided to demonstrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Generalization problem is a key problem in NN society, which can be grouped into two classes: the generalization problem with unlimited size of training sample and that with limited size of training sample. The generalization problem with limited size of training sample is considered in this paper. Similar to margin maximization criterion in SVM, we propose a margin maximization training algorithm for BP network to further improve the generalization ability of BP network. Experimental results show that the margin maximization training algorithm proposed in this paper does improve the performance of BP network, and shows a comparable performance with SVM. [ABSTRACT FROM AUTHOR]

Chaotic noise cancellation has potential application in both secret communication and radar target identification. To solve the problem of parameter estimation in chaotic noise, a novel radial basis function neural network (RBF-NN) -based chaotic time series data modeling method is presented in this paper. Together with the spectral analysis technique, the algorithm combines neural network's ability to approximate any nonlinear function. Based on the flexibility of RBF-NN predictor and classical amplitude spectral analysis technique, this paper proposes a new algorithm for parameter estimation in chaotic noise. Analysis of the proposed algorithm's principle and simulation experiments results are given out, which show the effective of the proposed method. We conclude that the study has potential application in various fields as in secret communication for narrow band interference rejection or attenuation and in radar signal processing for weak target detection and identification in sea clutter. [ABSTRACT FROM AUTHOR]

In this paper we present a system, DoLSuD, for the automatic discovery of relevant substructures in a document layout. DoLSuD, Document Layout Substructure Discovery, extracts, analyzes and describes the visual content of structured documents, such as catalogs, in order to discover repeating and distinctive substructures in the document layout and to establish relations between textual and image content. The paper presents the system along with experimental results and the web based service which utilizes the analysis results. [ABSTRACT FROM AUTHOR]

This paper proposes a new persistent storage to efficiently manage OWL Web ontologies. The Semantic Web is recognized as a next direction for progress of the current Web. To realize the Semantic Web, various technologies have been developed. Especially, OWL (Web Ontology Language) is the most important and state-of-the-art technology toward the ideal Semantic Web. However, most of research is being focused on designing and building OWL documents (OWL Ontology). One of the most important issues is how to efficiently and persistently store a very large OWL data into database management systems. In this paper, we propose a persistent storage system to achieve the purpose. This paper describes the performance evaluation result on the load time. The experiment result explicitly shows that our proposal provides more enhanced performance comparing with the existing systems. [ABSTRACT FROM AUTHOR]

This paper presents a middleware based on SOA (Service-Oriented Architecture) for context-awareness in a home network with ubiquitous computing. The context-awareness middleware addresses design issues such as heterogeneity, dynamicity, and extensibility issues of ubiquitous computing environment. We also suggest a context model supporting semantic level interoperability of context. In this paper, first we model context metadata ontology as well as context information ontology for the context-awareness middleware. Then we explain a service-oriented context-awareness middleware based on the context model which is introduced in this paper. [ABSTRACT FROM AUTHOR]

One of the particulars to be considered for effective servicing of wireless Internet to mobile terminal is the information of terminal environment. It is because time cost is required in producing mobile contents to suit environment of the connected terminal. In other words, in order to provide mobile web service by considering terminal characteristics, methods to minimize response time and server capacity in accordance with transcoding time in server are required. In this paper, response time to occur in the course of mobile web contents servicing was analyzed and, as a solution for this, Pre-Service method was introduced. Also, this paper suggests two methods in Pre-Service process for selecting optimize content in Cache. One is Device Profile Aware Selection using mobile device information. The other is Content Aware Selection using component information of requested content. Performance level of each method proposed was compared through experiment and the result of analysis was described. [ABSTRACT FROM AUTHOR]

Now, the study of UWB signal's propagation attenuation model concentrates mainly on residential indoor environment. In this paper, the monitor of the personnel and equipments in tunnel of coal mine is regarded as application background, the environment in coal mine is looked as a kind of special indoor environment. On the basis of residential indoor UWB propagation model, the tunnel of coal mine is divided into near-field region and far-field region according to Fresnel theory. The propagation mode of UWB signal is mainly multimode in near-field region and mainly waveguide in far-field region. Considering the additional ullage factors that caused by the factors of tunnel, such as personnel and coal transports and slicers etc at the same time, this paper puts forward the UWB signal propagation attenuation model in coal mine. Aiming at the parameter of symbol BER, comparison and analysis that based on the existing residential indoor propagation attenuation model and the model of this paper is done. [ABSTRACT FROM AUTHOR]

In this paper, a speech emotion recognition agent for mobile communication service is proposed. The proposed system can recognize five emotional states - neutral, happiness, sadness, anger, and annoyance from the speech captured by a cellular phone in real time and then it calculates the degree of affection such as love, truthfulness, weariness, trick, friendship of the person who you are interesting to know through the mobile phone. In general, a speech acquired by a cellular phone contains noise due to the mobile network and environmental noise. Thus it can causes serious performance degradation due to the distortion in emotional features of the query speech. In order to alleviate the effect of these noises, we adopt a MA (Moving Average) filter which has relatively simple structure and low computational complexity. Then a feature optimization method is implemented to further improve and stabilize the system performance. For a practical application, we create an agent that can measure the degree of affection from the person who you want to know on the mobile phone. Two pattern classification methods, k-NN and SVM with probability estimates, are compared for estimating the degree of affection. The experimental results indicate that the proposed method provides very stable and successful emotional classification performance as 72.5% over five emotional states and it shows the feasibility of the agent for mobile communication services. [ABSTRACT FROM AUTHOR]

This paper attempts to make a summary of current models used to evaluate the performance of IEEE 802.11 DCF and develops a new modeling to analyze the packet delay. The main contribution of this paper is that we found the backoff process of DCF can be considered as a Bernoulli Trials process. The new modeling based on the Bernoulli Trials can be a standard to analyze and validate other analytical methods. It can avoid confusion and conflicting produced by different simulation and calculating methods. In contrast to traditional work in the literature, we use our modeling to calculate the average backoff windows and average packet delay. At the same time, verify the analytical results by Monte Carlo and OPNET. The conclusion shows that the new modeling and analysis are comprehensible, simple and accurate. [ABSTRACT FROM AUTHOR]

This paper describes a metamodeling strategy of Service Level Agreements for Digital Video Broadcasting services based on Service Level Agreement Language(SLAng). The purpose of the paper is to provide a detailed analysis of SLAs in this domain and provide a motivation for modeling and automating their management. We also discuss why precise and machine readable SLAs can improve the levels of automation in SLA Management thereby reducing potential violations. The meta-modeling approach based on the Model Driven Architecture(MDA) described in this paper also simplifies the integration of a SLA Management systems with other infrastructure that delivers the service to the client. [ABSTRACT FROM AUTHOR]

We demonstrate in the paper that user movement has great influences on the system performance of mobile cellular networks. We also develop a system model to study to what extent the influences will be, with focusing on the user movement simulation. We concern the parameters that determine the system performance of mobile cellular networks. We show partially in this paper that these parameters vary while user movement changes, but the effects are interactive. Since handoff calls are given a higher priority over new calls and GC mechanism is employed, our analysis shows that a mature mobile cellular network should make use of user movement characteristics and dynamically adjust its reservation threshold of the handoff call requests. Extensive simulation results validate our analysis. [ABSTRACT FROM AUTHOR]

Recently, information communication market is reorganized focused on the digital convergence service used for integrating the communication, broadcasting and internet media by connecting the communication equipment, broadcasting equipment and computer via a network. The mobility support protocol enabling the effective handover between heterogeneous networks is emerged as the hot issue in relation with these next generation communication networks. In this paper, we are to suggest the MIH Vertical handover procedure required for the implementation of MIH over MIPv4 Low-Latency vertical handover by analyzing the handover performance in the overlap area between wireless networks using the vertical handover function of MIPv4 Mobile IP Technology of IETF and considering the expected problems. Also, we are to suggest the MIH L2-Trigger generation algorithm required for deciding the optimal handoff. We evaluate the vertical handover performance of MIPv4 low-latency in the overlap area between wireless networks by using the NS-2 and applying the IEEE 802.21 MIH (Media Independent Handover) based on the suggested technique and algorithm. [ABSTRACT FROM AUTHOR]

Architecting service-oriented systems is a complex design activity. It involves making trade-offs among a number of interdependent design decisions, which are drawn from a range of concerns by various software stakeholders. In order to achieve effective and efficient SOC design we believe a careful study of architectural styles that can form the reference architecture is important. Hence, this paper provides a study of architectural styles for the reference architecture of SOC-based software systems. We propose a classification scheme for the architecture styles. These architectural styles are extracted from existing research projects and industry practices based on our classification scheme. For all those identified styles, we present an evolution trend driven by engineering principles for Internet-scale systems. As a result, this paper moves the first step towards creating a Reference Architecture that can be utilised to provide sensible guidance on the design of Web services application architecture. [ABSTRACT FROM AUTHOR]

Location Fingerprinting (LF) is a promising location technique for many awareness applications in pervasive computing. However, as research on LF systems goes beyond basic methods there is an increasing need for better comparison of proposed LF systems. Developers of LF systems are also lacking good frameworks for understanding different options when building LF systems. This paper proposes a taxonomy to address both of these problems. The proposed taxonomy has been constructed from a literature study of 51 papers and articles about LF. For researchers the taxonomy can also be used as an aid when scoping out future research in the area of LF. [ABSTRACT FROM AUTHOR]

One of the outcomes of DARPA's HPCS program has been the creation of three new high productivity languages: Chapel, Fortress, and X10. While these languages have introduced improvements in language expressiveness and programmer productivity, several technical challenges still remain in delivering high performance with these languages. In the absence of optimization, the high-level language constructs that improve productivity can result in order-of-magnitude runtime performance degradations. This paper addresses the problem of efficient code generation for high level array accesses in the X10 language. Two aspects of high level array accesses in X10 are important for productivity but also pose significant performance challenges: the high level accesses are performed through Point objects rather than integer indices, and variables containing references to arrays are rank-independent. Our solution to the first challenge is to extend the X10 compiler with automatic inlining and scalar replacement of Point objects. Our partial solution to the second challenge is to use X10's dependent type system to enable the programmer to annotate array variable declarations with additional information for the rank and region of the variable, and to allow the compiler to generate efficient code in cases where the dependent type information is available. Although this paper focuses on high level array accesses in X10, our approach is applicable to similar constructs in other languages. Our experimental results for single-thread performance demonstrate that these compiler optimizations can enable high-level X10 array accesses with implicit ranks and Points to improve performance by up to a factor of 5.4× over unoptimized X10 code, and to also achieve performance comparable (from 48% to 100%) to that of lower-level Java programs. These results underscore the importance of the optimization techniques presented in this paper for achieving high performance with high productivity. [ABSTRACT FROM AUTHOR]