Maintain confidentiality, privacy and security research in data mining (PPDM) is one of the biggest trends. Recent advances in data collection, data dissemination and related technologies have inaugurated a new era of research where existing data mining algorithms should be reconsidered from a different point of view, this of privacy preservation. We propose a simple PCA based transformation ap...

Prediction and classification are very important functions for a knowledge discovery system. To improve the traffic safety, a prediction model using a neural network is proposed as part of knowledge discovery enhancement for the Critical Analysis Reporting Environment (CARE). CARE was designed to provide information to assist in the reduction of fatalities, injuries, and economic losses caused ...

For good performance of every computer program, good cache utilization is crucial. In numerical linear algebra libraries, good cache utilization is achieved by explicit loop restructuring (mainly loop blocking), but it requires a complicated memory pattern behavior analysis. In this paper, we describe a new source code transformation called dynamic loop reversal that can increase temporal and s...

In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produces a finite structure consisting of a hypergraph decorated with transitions (Petri graph) which can be seen as an approximation of the Winskel style unfolding of the graph transformation system. The fact that any rea...

Jyoti V. Prasad, Padmashree G. Venugopala P. S Abstract—Due to the reason that the Internet had gained its popularity in day-to-day life, the technology needed for the Internet is also changing rapidly. The information passing through the Internet is usually in the digital form. Since the processing of digital content on the Internet is easier and protecting one's intellectual property becomes ...

The perfectly synchronized round model provides the powerful abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We present an implementation of this abstraction in a distributed system with general message omissions. Protocols devised using our abstraction (i.e., in the perfectly synchronized round model) are automatically ...