Nowadays, the growth of internet has been accompanied by the growth of web services (e.g e-government, e-health, e-commerce). Web services collect data, especially individuals, from users and use them for various purp...
详细信息
Nowadays, the growth of internet has been accompanied by the growth of web services (e.g e-government, e-health, e-commerce). Web services collect data, especially individuals, from users and use them for various purposes. Sometimes, web services need to release the data they own to third parties. Because privacy is an important concern in web services, there are several research efforts have been devoted to address issues related to the development of privacy-preserving data management techniques. In [3], Agrawal et. al. has introduced Hippocratic Database incorporating privacy protection in relational database systems. In this paper, we’ll proposed the use of Hippocratic Database to ensure the privacy in web services. We use a scenario for driving license renewal by Road Transport Department in order to illustrate this.
This chapter presents our solution to the CoCoME assignment that is based on the SOFA 2.0 (software Appliances) hierarchical component model. The solution involves (i) modeling architecture in SOFA meta-model, (ii) sp...
详细信息
Super-peer P2P systems strike a balance between searching efficiency in centralized P2P systems and the autonomy, load balancing and robustness provided by pure P2P systems. A super-peer is a node in a super-peer P2P ...
详细信息
Super-peer P2P systems strike a balance between searching efficiency in centralized P2P systems and the autonomy, load balancing and robustness provided by pure P2P systems. A super-peer is a node in a super-peer P2P system that maintains the central index for the information shared by a set of peers within the same cluster. The central index handles the searching request on behalf of the connecting set of peers and also passes on the request to neighboring super-peers in order to access additional indices and peers. In this paper, we study the behavior of query answering in super-peer P2P systems with the aim of understanding the issues and tradeoffs in designing a scalable super-peer system. We focus on where to post queries in order to retrieve the result and investigate the implications for three different architectures: caching queries at the peer; caching only at the super-peer; and an ordinary P2P system without any caching facilities. We are adopting the existing equation on measuring the network cost for query answering in super-peer systems. In addition, we are adapting the same equation for super-peer system with caching facilities while answering their queries. Using these equations, the cost of query processing for these architectures is compared. The paper discusses the tradeoffs between architectures with respect to caching, highlights the effect of key parameter values on system performance, and ends by considering whether certain knowledge domains are more appropriate for particular architectures.
In this paper, we proposed an efficient algorithm, TOPK_CLOSED, for mining top-k closed itemsets. This algorithm mines top-k closed itemsets using best-first search. The closed itemsets with the highest supports are f...
详细信息
In this paper, we proposed an efficient algorithm, TOPK_CLOSED, for mining top-k closed itemsets. This algorithm mines top-k closed itemsets using best-first search. The closed itemsets with the highest supports are firstly found from this algorithm. Consequently, the method quickly finds top-k closed itemsets, which leads to an efficient pruning unnecessary itemsets and stop mining rapidly. In addition, this algorithm can generate closed itemsets without keeping candidates in main memory.
Robustness and reliability with respect to the successful completion of a schedule are crucial requirements for scheduling in multi-agent systems because agent autonomy makes execution environments dynamic and nondete...
详细信息
Robustness and reliability with respect to the successful completion of a schedule are crucial requirements for scheduling in multi-agent systems because agent autonomy makes execution environments dynamic and nondeterministic. We introduce a model to incorporate trust which indicates the probability that an agent will comply with its commitments into scheduling, thus improving the predictability and stability of the schedule. To deal with exceptions during execution, we adapt and evolve the schedule at runtime by interleaving the processes of evaluation, scheduling, execution and monitoring in the life cycle of a plan. Experiments show that schedules maximizing participantspsila trust are more likely to survive and succeed in open and dynamic environments. The results also prove that the proposed plan evaluation approach conforms with the simulation result, thus being helpful for plan selection.
Access to computer networks and systems is most often based on the use of conventional passwords nowadays. However, users have difficulty remembering a password that is long and random-appearing. So, they create short...
详细信息
Access to computer networks and systems is most often based on the use of conventional passwords nowadays. However, users have difficulty remembering a password that is long and random-appearing. So, they create short, simple, and insecure passwords. Graphical passwords have been designed to try to make passwords more memorable and easier for people to use, to create and, therefore, more usable and secure. Using a graphical password, users click on images rather than type conventional passwords. We have designed a usable graphical password system focusing in the usability features to the users, called Jetafida. In this paper we describe the Jetafida usability features, and the system usability features had been tested by questionnaire survey. This done by thirty computer students participates and uses the system for three times in different times to see the usability features achieved in the system. Where these features are ease of use, ease to create, ease to memorize, ease to learn and the overall system design and layout. The results show that the participants found that the proposed usable graphical password system has been achieving the usability features built in.
Component-based softwareengineering (CBSE) is becoming popular due to the benefits of software reuse and the availability of many alternatives of reusable components. By reusing existing software components that have...
详细信息
Component-based softwareengineering (CBSE) is becoming popular due to the benefits of software reuse and the availability of many alternatives of reusable components. By reusing existing software components that have already been tested, software engineers may reduce errors and shorten the time to market the system under development. However, software engineers still have a problem in selecting the existing reusable components as well as difficulties in determining the quality of the developed components for future reuse. Therefore, an appropriate component evaluation framework is extremely needed to harvest the full benefits of software reuse. In this paper, we present the comparative evaluation of the state-of-the-art component evaluation approaches with an emphasize on reusability. The results presented in this paper are very useful in achieving the ultimate aim of our research i.e. providing a holistic component evaluation approach that may assist software engineer both in the selection of the existing reusable components and the development of new reusable components.
Adopting new tools and technologies on a development process can be a risky endeavor. Will the project accept the new technology? What will be the impact? Far too often the project is forced to adopt the new technolog...
详细信息
Recent advances in microarray technology allow scientists to measure expression levels of thousands of genes simultaneously in human tissue samples. This technology has been increasingly used in cancer research becaus...
详细信息
Recent advances in microarray technology allow scientists to measure expression levels of thousands of genes simultaneously in human tissue samples. This technology has been increasingly used in cancer research because of its potential for classification of the tissue samples based only on gene expression levels. A major problem in these microarray data is that the number of genes greatly exceeds the number of tissue samples. Moreover, these data have a noisy nature. It has been shown from literature review that selecting a small subset of informative genes can lead to an improved classification accuracy. Thus, this paper aims to select a small subset of informative genes that is most relevant for the cancer classification. To achieve this aim, an approach using two hybrid methods has been proposed. This approach is assessed on two well-known microarray data. The experimental results have shown that the gene subsets are very small in size and yield better classification accuracy as compared with other previous works as well as four methods experimented in this work. In addition, a list of informative genes in the best subsets is also presented for biological usage.
This chapter overviews the scope, goals and timeline of the modeling contest CoCoME. It also describes the input the competing teams received and, furthermore, explains how the peer reviewing process went ahead, and h...
详细信息
暂无评论