Earticle

On-line communities on the Internet are highly self-organizing, dynamic and ubiquitous. The prime interest of peers in this community is often sharing common interest, even when compromising privacy. This paper presents a peer coordination strategy and a data sharing process for peers on the Internet which allows them to discover their common interest in terms of sets of frequently visited URLs. To this end, an algorithm was developed that allows the user to collect URLs of common interest from peers who are currently visiting the same URLs as the user. Using the algorithm, sample data was collected by randomly following links on popular websites to simulate the algorithm in operation. Experiments were then performed to compare the number of discovered frequently visited URL sets and association rules with the overhead induced by our network. An extended discussion on the experiments performed is presented, by which the viability of the proposed model is demonstrated.

Generally the result data from DNA chip experiments have lots of gene expression information. Scientists want to get perspective insight or want to find intuitive fact from that data. Hierarchical clustering is the most widely used method for analysis of gene expression data. In this paper, we address leaf-ordering, which is a post-processing for the dendrograms – a sort of edge-weighted binary trees – created by hierarchical clustering and we present a new approach for leaf-ordering scheme. And we show the comparison results for our approach and the existing approach.

In Wireless Sensor Networks (WSNs), these sensor nodes cooperate with each other to form a network without using any infrastructure. WSNs has a wide application. But the security of WSNs is still an important issue. Some existing approaches mainly rely on cryptography to ensure data authentication and integrity. These approaches only address part of the problem of security in WSNs. However, these approaches are not sufficient for the unique characteristics and novel misbehaviors encountered in WSNs. Recently, the use of reputation systems has become an important mechanism in WSNs. In this paper we propose a reputation and trust mathematical framework for WSNs which borrows tools from probability, statistics and mathematics analysis. We have suggested a new term certainty used in trust system and we argued that the positive or negative outcomes for a certain event is not enough information to make a decision in WSNs. We build up a reputation space and trust space in WSNs, and define a transformation from reputation space to trust space. Finally, we discuss some important properties of them and provide a basement in the trust and reputation for future research in WSNs. And we point out some open problems in reputation and trust system in WSNs.

In this paper, we present a novel Context-aware Workflow Management Engine (CWME) which offers seamless control and coordination of ubiquitous networked devices in a heterogeneous, autonomous, and distributed (HAD) environment. CWME adopts the concept from contemporary Business Process Management (BPM) systems where end users are allowed to design or customize activities and workflows involving network devices. A working CWME prototype has been developed as a proof of concept and tested using a device simulator. During the workflow design phase, a Feature Interaction Detection Engine (FIDE) is adopted in our system to detect all possible operation conflicts between the devices. During workflow execution phase, we propose Justified-Event-Condition -Action (JECA) rule and a Case-Based Reasoning (CBR) to enhance CWME's exception handling capability.

Filipino culture places a high value on education. For the majority of the Filipinos, the only best thing for a child to acquire and secure a better future is through education. So, they want more effective education system. E-Learning is still an emerging market in the Philippines. Its use is still sporadic and most users represent only a small segment of the Philippines education and business communities. The study wants to correct analysis and right direction presentation for Philippine remote education environment.

The VoIP(Voice over IP) has been worldwide used and already put to practical use in many fields. However, it is needed to ensure secret of VoIP call in a special situation. It is relatively difficult to eaves-drop the commonly used PSTN in that it is connected with 1:1 circuit. However, it is difficult to ensure the secret of call on Internet because many users can connect to the Internet at the same time. Therefore, this paper suggests a new model of Internet telephone for eavesdrop prevention enabling VoIP(using SIP protocol) to use the VPN protocol and establish the probability of practical use comparing it with Internet telephone.

Up to now studies on the fusion of travel time from various detectors have been conducted based on the variance ratio of the intermittent data mainly collected by GPS or probe vehicles. The fusion model based on the variance ratio of intermittent data is not suitable for the license plate recognition AVIs that can deal with vast amount of data. This study was carried out to develop the fusion model based on travel time acquired from the license plate recognition AVIs and the point detectors. In order to fuse travel time acquired from the point detectors and the license plate recognition AVIs, the optimized fusion model and the proportional fusion model were developed in this study. As a result of verification, the optimized fusion model showed the superior estimation performance. The optimized fusion model is the dynamic fusion ratio estimation model on real time base, which calculates fusion weights based on real time historic data and applies them to the current time period. The results of this study are expected to be used effectively for National Highway Traffic Management System to provide traffic information in the future. However, there should be further studies on the proper distance for the establishment of the AVIs and the license plate matching rate according to the lanes for AVIs to be established.

Task scheduling under a grid environment is an important research area, on which much attention has been paid. However, either in the meta-task scheduling problems or DAG (Direct Acyclic Graph) scheduling problems, it is usually assumed that tasks are submitted to dedicated hosts and that these tasks are processed in FIFO (First In First Out) order. This is not practical in a grid, in which a host may be shared between grid users and its owner and local tasks, which belong to resource owners, may compete with grid tasks for the hosts. EBGSA (Estimation Based Grid Scheduling Approach) is proposed, which allows for the simultaneous processing of grid tasks and local tasks. In EBGSA we use history information about the execution of tasks to estimate the performance of non-dedicated hosts. Two heuristic scheduling algorithms, MCT (Minimum Completion Time) and Min-min, are selected to perform the simulation experiment. Both experiments obtain a smaller makespan, proving EBGSA feasible for grid task scheduling.

Trusted operating systems (OS) provide the basic security mechanisms and services that allow a computer system to protect, distinguish, and separate classified data. Trusted operating systems have been developed since the early 1980s and began to receive National Security Agency (NSA) evaluation in 1984. The researches about trusted OS are proceeding over the world, and new product type using the loadable security kernel module (LSKM) or dynamic link library (DLL) is being developed. Most important concept in this paper is Security Level proposed by Dr. Tai-hoon Kim, because this concept should be considered in every operational environment. This paper assumed security level 1st proposed by Dr. Taihoon Kim, and proposes a special type of product using LSKM and specific conditions for operational environment should be.