Search

Wet paper codes were proposed as a tool for constructing steganographic schemes with an arbitrary selection channel that is not shared between the sender and the recipient. In this paper, we describe new approaches to wet paper codes that enjoy low computational complexity and improved embedding efficiency (number of message bits per embedding change). Some applications of wet paper codes to steganography and data embedding in binary images are discussed. [ABSTRACT FROM AUTHOR]

To facilitate the transition from paper-based patient record (PPR) to computer-based patient record (CPR), engineers should try to improve the usability of CPR system. From the point of view of a physician, we reviewed PPRs written by 8 Japanese physicians. We revealed the characteristics of PPR to find out about the barrier to transition from PPR to CPR. Our findings may be helpful to the engineers who are aiming to develop a CPR system. [ABSTRACT FROM AUTHOR]

In this paper we describe the design of a hybrid search that combines simple metadata search with a traditional keyword search over unstructured context data. This paradigm provides the inquirer additional options to narrow the search with some semantic aspects through the XML metadata query. We demonstrate a paper search for a case study of the hybrid search, and describe a data integration hub to integrate those data dispersed on the Net. [ABSTRACT FROM AUTHOR]

This paper analyses the security of dirty paper trellis (DPT) watermarking schemes which use both informed coding and informed embedding. After recalling the principles of message embedding with DPT watermarking, the secret parameters of the scheme are highlighted. The security weaknesses of DPT watermarking are then presented: in the watermarked contents only attack (WOA) setup, the watermarked data-set exhibits clusters corresponding to the different patterns attached to the arcs of the trellis. The K-means clustering algorithm is used to estimate these patterns and a co-occurrence analysis is performed to retrieve the connectivity of the trellis. Experimental results demonstrate that it is possible to accurately estimate the trellis configuration, which enables to perform attacks much more efficient than simple additive white Gaussian noise (AWGN). [ABSTRACT FROM AUTHOR]

Bearing in mind the changeable and complicated needs of business environment, in this paper we examine the necessity of evolution in the traditional decision support techniques. Our aim is to intensify the need for integrated performance measurement and management, as a way to ameliorate the existing tools for decision making, which are currently based on historical data. Because of the nature of challenges and trends in the retail industry, it is considered to be an appropriate application scenario. In addition to that, a framework is proposed and a case study is described as a proof of our claim. Keywords: Performance management, business intelligence, retailing. [ABSTRACT FROM AUTHOR]

Reputation systems play an important role in many Internet communities. They allow individuals to estimate other individual's behavior during interactions. However, a more privacy-friendly reputation system is desirable while maintaining its trustworthiness. This paper presents a fair anonymous submission and review system. The review process is reputation-based and provides better anonymity properties than existing reputation systems. Moreover, the system allows for accountability measures. Anonymous credentials are used as basic blocks. [ABSTRACT FROM AUTHOR]

The aim of this study is to explore trends in computer crime and cybercrime research from 1974 to 2006. All publications for this analysis were drawn from the ISI Web of Science, the Science Citation Index (SCI), and the Social Science Citation Index (SSCI). The ISI Web of Science is considered a powerful and relatively accurate tool in bibliometric studies. About 292 papers related to computer crime and cybercrime were published during this period. The greatest number of these papers was written in English, and the annual output increased significantly after 2003. In the period under study, most papers originated in the USA. Approximately 57% of the publications were articles, and 72% of these articles had single authors. More bibliometric analyses are described in this study, which shows a high scientific production of articles on computer crime and cybercrime publications. [ABSTRACT FROM AUTHOR]

In spite of the importance of natural drawing with input device, the interface between the device and virtual brush's status has been dealt less in literatures. Through this paper, we present a natural interface between pen-tablet device and virtual brush. Proposed system uses pressure instead of z-coordinate of pen to allow drawing with the similar feeling to the real brush. The contribution of this paper is as follows: first, a brush model interacting with pressure is generated. Second, 3D brush model is allowed to be folded back decreasing droplet size intensively according to pen direction changes. [ABSTRACT FROM AUTHOR]

We have developed AirTransNote, a student notes sharing system to facilitate collaborative and interactive learning in a regular lecture at conventional classrooms. Our former student system employed ultrasonic digital pens to capture student notes on a usual paper sheet. Although the paper-based approach is intuitive for learners, the ultrasonic pen with a PDA created some difficulties when used by senior high school students. In order to eliminate those difficulties, we have introduced anoto-based pens and a data gathering system called "digital pen gateway." Owing to the improved student system, students could easily submit their answers with handling of multiple paper sheets. The teacher could refer the answers to choose students who need assistance during the lecture. Questionnaire results showed that the simpler student interface is quite acceptable, and the system can realize our augmented classroom concept in a practical way. [ABSTRACT FROM AUTHOR]

In sensor networks, queries need to be jointly designed, in order to minimize the power consumption and maximize the lifetime. Data reduction techniques can be employed to decrease the size of data to be transferred in the network, and therefore save energy of sensor nodes. This paper presents a novel method for optimizing multi-query in sensor networks. Our approach is, by using packet combination techniques, to reduce the data size of multiple simultaneous queries, so that the energy for data transmission can be saved to the best extent. A delay item is specified together with the query by the application. Then an optimal query plan can be obtained by studying the best time of sending local data to sink that can lead to the minimum cost. Algorithm is described in detail. Performance analysis is performed to validate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper introduces the invited session of "Intelligent Agents and their Applications" being presented at the 10th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems. This session concentrates on discussing Intelligent Agents and uses some applications to demonstrate the theories reported. An update on last years session [1] is included to report on several key advances in technology that further enable the ongoing development of multi-agent systems. A brief summary of the impediments presented to researchers is also provided to highlight why innovation must be used to sustain the evolution of Artificial Intelligence. This year a variety of challenges and concepts are presented, together with a collection of thoughts about the direction and vision of Intelligent Agents ands their Applciations. [ABSTRACT FROM AUTHOR]

Software watermarking is a technique to protect programs from piracy through embedding secret information into the programs. As software unauthorized use and modification are ubiquitous in the world, progresses in software watermarking will certainly benefit software research and industry. In this paper, we study one of core concepts in this area - informed recognition. To recognize a watermark in a software is to judge the existence of such a watermark in the corresponding software code. [ABSTRACT FROM AUTHOR]

This paper proposes a neural-based method to map facial expressions between human and robot. We applied the method to a sensitivity communication robot, Ifbot, which has been developed by our industry-university joint research project. The method enables the robot to imitate an arbitrary human facial expression. The paper describes the feature extraction from face image, and proposes neural network based parameter matching between human facial expression and Ifbot's facial expression mechanism. This paper also reports the evaluation of the facial expression transmission performance of Ifbot with the proposed system. The evaluation shows the effectiveness of emphasizing emotional expressions and the possibility of using Ifbot as an agent for distance communication. [ABSTRACT FROM AUTHOR]

This paper proposes an association method using Concept-base. Concept-base is a large-scale relational database constructed by some electronic dictionaries and some newspapers. Each concept which is defined in Concept-base has attributes which characterize the concept and weights which show each attribute's importance. Concept-base enables to calculate the depth of relationship (Degree of Association) of two any concepts using attributes and weights. This paper proposes One Word Association Method which associates one word (concept) with some relative words (concepts). Also, a threshold of Degree of Association is defined using the evaluation result of One Word Association Method. Finally, Two Words Association Method is proposed based on the threshold of Degree of Association. [ABSTRACT FROM AUTHOR]

In this paper, we propose gesture recognition in multiple people environment. Our system is divided into two modules: Segmentation and Recognition. In segmentation part, we extract foreground area from input image, and we decide the closest person as a recognition subject. In recognition part, firstly we extract feature point of subject's both hands using contour based method and skin based method. Extracted points are tracked using Kalman filter. We use trajectories of both hands for recognizing gesture. In this paper, we use the simple queue matching method as a recognition method. We also apply our system as an animation system. Our method can select subject effectively and recognize gesture in multiple people environment. Therefore, proposed method can be used for real world application such as home appliance and humanoid robot. [ABSTRACT FROM AUTHOR]

Web-based Geographic Information System(WebGIS) is a key direction towards GIS development. By analysing of the deficiency in the design of conventional WebGIS, this paper proposes an architecture of the intelligent WebGIS based on Multi-Agent, which has been applied in a agricultural WebGIS. In order to solve the key problem of Agent communication, the paper also presents an Agent communication model, which decreases the working capacity to maintain the communication protocl and enhances the system's adaptability and stability. [ABSTRACT FROM AUTHOR]

We consider some problems about the computation time of evolutionary algorithms in this paper. First, some exact analytic expressions of the mean first hitting times of general evolutionary algorithms in finite search spaces are obtained theoretically by using the properties of Markov chain associated with evolutionary algorithms considered here. Then, by introducing drift analysis and applying Dynkin's Formula, the general upper and lower bounds of the mean first hitting times of evolutionary algorithms are estimated rigorously under some mild conditions listed in the paper. Those results in this paper are commonly useful. Also, the analytic techniques adopted in the paper are widely instructive for analyzing the computation time of evolutionary algorithms in a given search space as long as some specific mathematical arts are introduced accordingly. [ABSTRACT FROM AUTHOR]

Many business solutions provide best practice process templates, both generic as well as for specific industry sectors. However, it is often the variance from template solutions that provide organizations with intellectual capital and competitive differentiation. In this paper, we present a modeling framework that is conducive to constrained variance, by supporting user driven process adaptations. The focus of the paper is on providing a means of utilizing the adaptations effectively for process improvement through effective management of the process variants repository (PVR). In particular, we will provide deliberations towards a facility to provide query functionality for PVR that is specifically targeted for effective search and retrieval of process variants. [ABSTRACT FROM AUTHOR]

This paper proposes a method for sensitivity communication robots which infer their dialogist's emotion. The method is based on the Bayesian approach: by using a Bayesian modeling for prosodic features. In this research, we focus the elements of emotion included in dialogist's voice. Thus, as training datasets for learning Bayesian networks, we extract prosodic feature quantities from emotionally expressive voice data. Our method learns the dependence and its strength between dialogist's utterance and his emotion, by building Bayesian networks. Bayesian information criterion, one of the information theoretical model selection method, is used in the building Bayesian networks. The paper finally proposes a reasoner to infer dialogist's emotion by using a Bayesian network for prosodic features of the dialogist's voice. The paper also reports some empirical reasoning performance. [ABSTRACT FROM AUTHOR]

In this paper, we propose a state transition model using context based approach for gesture analysis. This method defines the analysis situation as five different states; NULL, OBJECT, POSTURE, LOCAL, and GLOBAL. We first infer the situation of the system by estimating the transition of the state model, and then apply different analysis algorithms according to the system state. Gestures are analyzed with the queue-based matching method which is newly proposed in the paper instead of general gesture spotting algorithms. In the algorithm, movement of feature points; face and both hands, is compared directly, so gesture can be recognized quickly without applying any constraints for real world application. The transition of the states can be interpreted as the context of motion and that is estimated with conditional probability between the states in the algorithm. [ABSTRACT FROM AUTHOR]

Social aspects of security of information systems are often discussed in terms of "actual security" and "perceived security". This may lead to the hypothesis that e-voting is controversial because in paper voting, actual and perceived security coincide, whereas they do not in electronic systems. In this paper, we argue that the distinction between actual and perceived security is problematic from a philosophical perspective, and we develop an alternative approach, based on the notion of trust. We investigate the different meanings of this notion in computer science, and link these to the philosophical work of Luhmann, who distinguishes between familiarity, confidence and trust. This analysis yields several useful distinctions for discussing trust relations with respect to information technology. We apply our framework to electronic voting, and propose some hypotheses that can possibly explain the smooth introduction of electronic voting machines in the Netherlands in the early nineties. [ABSTRACT FROM AUTHOR]

This paper presents a security analysis for data hiding methods based on nested lattice codes, extending the analysis provided by previous works. The security is quantified in an information-theoretic sense by means of the information leakage between the watermarked signals seen by the attacker and the secret key used in the embedding process. The theoretical analysis accomplished in the first part of the paper addresses important issues such as the possibility of achieving perfect secrecy and the impact of the embedding rate and channel coding in the security level. In the second part, a practical algorithm for estimating the secret key is proposed, and the information extracted is used for implementing a reversibility attack on real images. [ABSTRACT FROM AUTHOR]

A new informed image watermarking algorithm is presented in this paper, which can achieve the information rate of 1/64 bits/pixel with high robustness. Firstly, the LOT (Locally Optimum Test) detector based on HMM in wavelet domain is developed to tackle the issue that the exact strength for informed embedding is unknown to the receiver. Then based on the LOT detector, the dirty-paper code for informed coding is constructed and the metric for the robustness is defined accordingly. Unlike the previous approaches of informed watermarking which take the informed coding and embedding process separately, the proposed algorithm implements a jointly coding and embedding optimization for high capacity and robust watermarking. The Genetic Algorithm (GA) is employed to optimize the robustness and distortion constraints simultaneously. Extensive simulations are carried out which demonstrates that the proposed algorithm achieves significant improvements in performance against JPEG, gain attack, low-pass filtering and so on. [ABSTRACT FROM AUTHOR]

SystemC is a popular open source library in C++ for developing embedded system design, from the abstract System Level Design until the accurate Register Transfer Level Design. SystemC simulation, however, runs in console mode (text-based), thus making it difficult for user to interact with the simulation. To extend the capabilities of SystemC simulation, it is necessary to create Graphical User Interface. In this paper we recommend to use RapidPLUS tool for making the interface for embedded system prototype to reduce time to market. We also propose the connectivity between RapidPLUS and SystemC by using socket communication that attached in JavaBean RapidPLUS object [ABSTRACT FROM AUTHOR]

Recently, the battery and low-power H/W technologies for mobile and wearable computing devices have been advanced rapidly. But on the other hand the computation and communication demands of the embedded applications are increasing more rapidly. Therefore, the application developers are still required to develop their codes to utilize the available energy as efficient as possible. The provision of software power measurement with reasonable accuracy, consistency and low overhead is an indispensable factor for software power engineering. In this paper, we present a time-triggered mechanism for providing energy consumption profiles in the level of C functions. The similar mechanisms have already been introduced at the previous researches such as PowerScope and ePRO. Instead, we, in this paper, introduce our efforts to extend these researches to incorporate power domains and DVS(Dynamic Voltage Scaling), then interpret these mechanisms as the view of time-triggered approach for better understanding to the relationships among timer interrupt, context switching, DAQ triggering, multi-channel DAQ delay, and etc. From our experimental results, we could conclude that the time-triggered approach for the function level energy measurement properly worked with low overheads and produced consistent energy consumption profiles on the DVS-applied program codes running upon the platforms supporting multiple power domains. [ABSTRACT FROM AUTHOR]

In a pervasive environment, context aware services are necessary to enable collaborate and communicate with others in order to provide proper service to users. Each service can be designed with individual context information which represents different perspective over the context. This paper proposes an advanced context management model with context alignment among heterogeneous context aware services. This model enable the interaction between context information producer devices and context information consumer devices and as well as their insertion in an open environment. And this paper show how this model can be used in context aware middleware. [ABSTRACT FROM AUTHOR]

This paper proposes an architecture of source-end DDoS protection system on IXP2400 network processor, which monitors traffic from the source network and polices traffic at the source without affecting the traffic from other network. The proposed architecture includes usual IPv4 forwarder with additional modules for source filtering, packet classification and flow control, and uses modified non-parametric CUSUM algorithm. We analyze the major shortcomings of previous approaches, and present basic performance analysis. The proposed system can handle 65,000 aggregated flows, and can operate at OC-48 line rate. [ABSTRACT FROM AUTHOR]

The necessity to split the endpoint identity and locator has been understood since sometime both from routing and security perspective. Today endpoints are identified by IP address that is location dependent and attributed by ISPs, whereas the identity neither depends on location nor on ISP. So splitting the routing and identification space is expected to make network operation such as mobility, multihoming and traffic engineering transparent for the end user. While in the operator side the use of a single space for routing and identification brings scaling issues. The operators will benefit from the split by decreased routing table size. Within IETF/IRTF solutions are being developed to separate the IP layer into Endpoint Identifier (EID) space and routing locator (RLOC) space in the form of Locator/ID Separation Protocol (LISP). In LISP the Identifier (ID) has the format of a IPv4 or IPv6 address. This architecture provides ID to locator resolution so that the packets can be routed through the Internet. This paper proposes a solution that considers an Endpoint Identifier (EID) as the combination of a domain name and a cryptographic Identifier (cryptoID). Such EIDs are hosted in a mixed DNS/Distributed Hash Table (DHT) architecture. Resolution involves a DNS and a DHT resolution. We show how the use of DNSSEC enhances the routing algorithm of the DHT resolution, and present advantages a such an architecture in term of deployment and future use of the Internet. [ABSTRACT FROM AUTHOR]

Deploying wireless LANs (WLAN) at large scale is mainly affected by reliability, availability, performance, and security. These parameters will be a concern for most of managers who want to deploy WLANs. Most importantly, the security issue became the predominant factor in WLAN design. Different Intrusion detection mechanisms have been addressed in research papers, but with little being focused on internal intrusion and prevention. In this paper an efficient security method has been proposed. It is based on detecting rogue access points as well as rogue bridge access points and denying their access to the WLAN. In addition a new method of mutual authentication between DHCP server at the AP and wireless client has been introduced. This would allow client to detect rogue DHCP server and stop the association with it. It also allows registered DHCP server to detect unauthorized client and deny its request. Moreover the DHCP server would synchronize with the AP or intelligent LAN switch to drop packets from unauthorized client who might use static IP to get access to the network. [ABSTRACT FROM AUTHOR]

RFID, as an emerging technology, has very huge potential in today's social and business developments. Security and Privacy are one of the important issues in the design of practical RFID protocols. In this paper, we focus on RFID authentication protocol. RFID mutual authentication is used to ensure that only an authorized RFID reader can access to the data of RFID tag while the RFID tag is confirmed that it releases data to the authenticated RFID reader. This paper will propose an anonymous mutual authentication protocol for RFID tag and reader. RFID tag is anonymous to RFID reader so that privacy can be preserved. In addition, mutual authentication does not need to rely on a back-end database. [ABSTRACT FROM AUTHOR]

This paper considers large-scale dense wireless sensor networks with path-constrained mobile sink. From the viewpoints of improving data equilibrium and energy-saving, we propose an enhanced energy efficient communication protocol in which a partition algorithm of overlapping time based on data equilibrium is designed to minimize the data variance and disequilibrium from each node. We present a data equilibrium information diffusion method to control the amount of collected data to avoid the waste of data and energy. Simulations under OMNET++ and MATLAB show that with protocol and algorithms proposed in this paper we can achieve better performance than other conventional methods in terms of data equilibrium rate, network lifetime and energy dissipation equilibrium rate. [ABSTRACT FROM AUTHOR]

Consider a wireless ad hoc network with random access channel. We present a model that takes into account topology, routing, random access in MAC layer (governed by IEEE 802.11orslotted aloha) and forwarding probability. In this paper , we are focusing to study the effect of cooperation on the stability and throughput of ad-hoc network. Forwarding packets of other nodes is an example of activity that requires such a collaboration. Hence, it may not be in interest of a node to always forward the requesting packet. We propose a new approach (based on cycle of transmissions) to derive throughput of multi-hop routes and stability of forwarding queues. With this cycle approach, we correct the analytical expressions derived in [2] and discover that their results are valid only in particular cases such as symmetric networks. However, in this paper, we get extended results for general network case. Moreover, we confirm that (i) the forwarding queues in a system of weighted fair queues has a special property and (ii) the end to end throughput of a connection does not depend on the load of the intermediate forwarding queues between a source and a destination. We perform extensive simulations and verify that the analytical results exactly match the results obtained from simulations. [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]

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]

In this paper, we discuss a robot vision in order to perceive humans and the environment around a mobile robot. We developed a tele-operated mobile robot with a pan-tilt mechanism composed of a camera and a laser range finder (LRF). The output from the camera is color information, and the output of LRF is distance information to objects from the robot. In this paper, we propose a method of sensor fusion to extract a human from the measured data by integrating these outputs based on the concept of synthesis. Finally, we show experimental results of the proposed method. [ABSTRACT FROM AUTHOR]

This paper presents an improved statistical learning algorithm for feature generation in pattern recognition and signal processing. It is approximately derived from geometrical interpretation of the Fisher linear discriminant analysis (FLDA). The principal component analysis (PCA) is popular for data compression and feature extraction. Furthermore, iterative learning algorithms for obtaining eigenvectors in PCA have been presented in such fields. Their effectiveness has been demonstrated in many applications. However, recently FLDA has been often used in many fields, especially face image recognition. The drawback of FLDA is a long computational time based on a large-sized covariance matrix and the issue that the within-class covariance matrix is usually singular. Generally, in FLDA, the inverse matrix of the within-class covariance matrix cannot be obtained, since data dimension is generally higher than the number of data and then it includes many zero eigenvalues. In order to overcome this difficulty, a new iterative feature generation method, the simple-FLDA was proposed by authors. In this paper, further improvement is introduced into the simple-FLDA and its effectiveness is demonstrated for preliminary personal identification problem. [ABSTRACT FROM AUTHOR]

This paper presents an efficient method of obstacle recognition system and HRI (human robot interaction) system specialized for biped walking robot. This method transmits the information regarding obstacle conditions to a biped walking robot. In the present paper, we describe a cascade of boosted classifier using adaboost algorithm as a obstacle region extracting module from input images. Besides, PCA is applied as a feature extracting module from the obstacle region and a hierarchical support vector machine is applied as an obstacle recognizing module. The data from vision system is combined with information from other sensors and the walking assist commands transmit to the biped walking robot. From the results of experiments, the proposed method can be applied to biped walking robot effectively. [ABSTRACT FROM AUTHOR]

Building a collection of electronic documents, e.g. corpus, is a cornerstone for the research in information retrieval, text mining and knowledge management. In literature, very few papers have discussed the necessary concerns for building a corpus and explained the building process systematically. In this paper, we explain our work of building an enterprise corpus called manufacturing corpus version 1 (MCV1) for corporate knowledge management purpose. Relevant issues, e.g. input texts, category labels and policies, as well as its parallel coding process and quality measurements are discussed. The real-world automated text classification experiments based on MCV1 show the soundness of its coding process. Finally, suggestions are made on how the proposed approach can be implemented in a more economical manner. [ABSTRACT FROM AUTHOR]

Timed Coloured Petri net (TCPN) has been utilized as a visual formalism for the modeling of complex systems. A module of basic traffic system of TCPN model is successfully constructed in this paper. Especially, a supervisor of an urban traffic light system, which consists of five intersections with multiple phases, is implemented by the new methodology. And all the traffic operations are ruled by the control logic of TCPN. In addition, a new design tool is proposed and it is efficiently to state and solve the problem of traffic signal timing plans. Finally, a supervisor of the traffic light system is completed whose operation flow is modeled by the TCPN models. [ABSTRACT FROM AUTHOR]

Clickstream can be a rich source of data for analysing user behaviour, but the volume of these logs makes it difficult to identify and categorise behavioural patterns. In this paper, we introduce the Automatic Pattern Discovery (APD) method, a technique for automated processing of Clickstream data to identify a user's browsing patterns. The paper also includes case study that is used to illustrate the use of the APD and to evaluate its performance. [ABSTRACT FROM AUTHOR]

Radio Frequency Identification (RFID) has come under the spotlight as technology supporting ubiquitous society. But now, we face several security problems and challenges in RFID systems. Recent papers have reported that RFID systems have to achieve the following requirements: (1) Indistinguishability, (2) Forward Security, (3) Replay Attack resistance, (4) Tag Killing resistance, and (5) Ownership Transferability. We have to design RFID system that achieves the above-mentioned requirements. The previous security methods achieve only some of them individually, and no RFID system has been constructed that achieves all requirements. In this paper, we propose an RFID security method that achieves all requirements based on a hash function and a symmetric key cryptosystem. In addition, our proposed method provides not only high-security but also high-efficiency. [ABSTRACT FROM AUTHOR]

Recently, a local-search heuristic algorithm called Extremal Optimization (EO) has been successfully applied in some combinatorial optimization problems. However, there are only limited papers studying on the mechanism of EO applied to the numerical optimization problems so far. This paper presents the studies on the applications of EO to numerical constrained optimization problems with a set of popular benchmark problems. To enhance and improve the search performance and efficiency of EO, we developed a novel EO strategy with population based search. The newly developed EO algorithm is named population-based EO (PEO). Additionally, we adopted the adaptive Lévy mutation, which is more likely to generate an offspring that is farther away from its parent than the commonly employed Gaussian mutation. Compared with three state-of-the-art stochastic search methods with six popular benchmark problems, it has been shown that our approach is a good choice to deal with the numerical constrained optimization problems. [ABSTRACT FROM AUTHOR]

This paper discusses the asymptotic convergence of evolutionary algorithms based on finite search space by using the properties of Markov chains and Perron-Frobenius Theorem. First, some convergence results of general square matrices are given. Then, some useful properties of homogeneous Markov chains with finite states are investigated. Finally, the geometric convergence rates of the transition operators, which is determined by the revised spectral of the corresponding transition matrix of a Markov chain associated with the EA considered here, are estimated by combining the acquired results in this paper. [ABSTRACT FROM AUTHOR]

In this paper we propose some extensions of the business process modeling notation (BPMN) to be able to evaluate the overall cost of business process diagrams. The BPMN is very expressive, and a general treatment of this problem is very complex. Therefore, it seems reasonable to define classes of business process diagrams capturing real processes and to develop efficient analysis methods for these classes. In the paper we define some relevant subsets of the BPMN, extend them with the concept of cost, and provide computational models for each class, in most cases reducing them to existing problems for which efficient solutions already exist. [ABSTRACT FROM AUTHOR]

Business services are deliveries of capabilities to consumers. The way such capabilities are selected, combined and delivered makes for the flexibility in services provision compared to, for example, manufacturing of tangible goods. The coordination (‘orchestration’) of services is an essential requirement for the delivery of more complex services. However, current technologies for web service orchestration assume a procedural ‘program-like’ approach that as we argue in this paper reduces the flexibility to adapt the composite service in response to changing requirements. This paper proposes that service orchestration should be carried out at the business level, preserving the business semantics and transformed if required to specific orchestration execution models such as BPEL4WS, using MDA techniques. Keywords: Service composition, Service orchestration, Service semantics, IDEF0, MDA, BPEL4WS. [ABSTRACT FROM AUTHOR]

The theory of regions and the algorithms for synthesizing a Petri net model from a transition system, which are based on this theory, have interesting practical applications – in particular in the design of electronic circuits. In this paper, we show that this theory can be also applied for mining the underlying process from the user interactions with a document management system. To this end, we combine an algorithm that we called activity mining with such Petri net synthesis algorithms. We present the basic idea of this approach, show some first results, and compare them with classical process mining techniques. The main benefit is that, in combination, the activity mining algorithm and the synthesis algorithms do not need a log of the activities, which is not available when the processes are supported by a document management system only. [ABSTRACT FROM AUTHOR]

In this paper, we evaluate the feasibility of distributed control of shared resources in user-managed networks. This paradigm has become possible with the advent of broadband wireless networking technologies such as IEEE 802.11. One of the most popular applications in these networks is peer-to-peer (P2P) file exchange. Node cooperation can optimize the usage of shared "external" accesses to the Internet (set of links between the user network and the Internet). In a previous paper, we evaluated different agent-oriented distributed control schema, based on the concept of credit limits, on ideal mesh networks subject to uniform traffic. Each node in the mesh network chooses to behave as a cooperator or a defector. Cooperators may assist in file exchange, whereas defectors try to get advantage of network resources without providing help in return. Before this paper was completed, we observed that popular P2P protocols like eMule, Kazaa and BitTorrent were evolving towards the same credit-oriented strategies we previously proposed. Now, we realistically model both user network traffic and topology, and evaluate a new advanced agent-based distributed control scheme. The simulation results in this paper confirm on realistic networks the main conclusion in our previous research: autonomous node agents become cooperators in their permanent state when they take decisions from local information, checking that file exchange services offered to neighbor nodes do not exceed appropriate credit limits. Keywords: P2P, agents, network management, mesh networks. [ABSTRACT FROM AUTHOR]

This paper presents a consensus-based algorithm for resolving inconsistency in Web-based recommendation systems. In such systems it is possible that a user have his own usage path (the way of usage of the system) and system can recommend individual usage path for new user. The problem of determining a new path for a new user is the subject of this paper. An algorithm for solving this problem will be described below and some results of the experiments with this algorithm will be presented. [ABSTRACT FROM AUTHOR]

Trust plays a fundamental role in multi-agent systems in which tasks are delegated or agents must rely on others to perform actions that they themselves cannot do. Dating from the mid-1980s, the Belief-Desire-Intention architecture (BDI) is the longest-standing model of intelligent agency used in multi-agent systems. Part of the attraction of BDI is that it is amenable to logical formalisms such as Wooldridge's Logic Of Rational Agents (LORA). In a previous paper the present authors introduced a model of trust, here named the Ability-Belief-Commitment-Desire (ABCD) model, that could be implemented within the BDI framework. This paper explores the definition of the ABCD model within the LORA formalism. [ABSTRACT FROM AUTHOR]