@article {304,
	title = {Middleware model for adapting dynamic requirements},
	journal = {Journal of Digital Information Management},
	volume = {10},
	year = {2012},
	note = {Export Date: 10 July 2014},
	month = {2012},
	pages = {20 - 28},
	abstract = {Making a distributed system adaptable to the dynamic variations in the user requirements is a big challenge in software industries. It is identified that the solution for the adaptability of such dynamic variations can be achieved through reflective middleware. In this paper an efficient solution is proposed by combining aspect oriented approach with reflective middleware. The significant feature of the proposed aspect oriented reflective middleware model is capturing the dynamic variations in the functionalities of the system as aspects. The three major components defined in this model to implement dynamic adaptability are Aspect Generator, Aspect Weaver and Remote Method Invoker. Aspect Generator component is used to define dynamic requirements as aspects. Aspect Weaver provides service to weave the dynamic requirements with the application components associated with that requirement. Remote Method Invoker is the meta layer component, which provides the platform for the Aspect Weaver to execute its service. The metric to measure the efficiency of the system adaptability has also been proposed here. The adaptability approach implemented through this model has been evaluated and proved as an efficient solution using this metric. This model has also been evaluated at an architectural level using formal analysis to prove that the dynamic requirements can be incorporated without affecting the existing functionalities of the system.},
	keywords = {Adaptability Metric, Aspect-Oriented Approach, Aspect-Oriented Reflective Middleware, Dynamic Adaptation, Dynamic Requirements, Reflective Middleware},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84857583024\&partnerID=40\&md5=38c4e35715ea15a7d59be1dfde2d18d1},
	author = {Suganthi, S. and Nadarajan, R.}
}
@article {180,
	title = {Cache Pre-fetching and Replacement strategies for location dependent data in mobile environments},
	journal = {Journal of Digital Information Management},
	volume = {7},
	year = {2009},
	note = {Export Date: 10 July 2014},
	month = {2009},
	pages = {185 - 190},
	abstract = {In this paper, new strategies for prefetching and cache replacement are proposed. The proposed pre-fetching algorithm considers the geographical and semantic adjacency between queried items. The strategy is to pre-fetch the most probable secondary service as a by-product of the execution of a query to a primary service. Association rule mining is used for determining the secondary item that should be pre-fetched. The latter part of the paper deals with a cache replacement algorithm PAID+ (Probability Area Inverse Distance +) which takes into account the access probability and distance between the mobile client and the service item which suits a pre-fetching environment. The experimental evaluations using synthetic datasets show the cache pre-fetch and replacement policy PAID+ are effective in improving the system performance in terms of the cache hit ratio of mobile clients.},
	keywords = {Cache replacement, Location dependent data, Prefetching algorithm},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249124769\&partnerID=40\&md5=c2445ecd7a2b48db9d0be250bd2dc45e},
	author = {Mary Magdalene Jane, F. and Ilayaraja, N. and Nadarajan, R.}
}
@article {161,
	title = {Restricted continuous KNN queries on road networks with caching enhancement},
	journal = {Journal of Digital Information Management},
	volume = {6},
	year = {2008},
	note = {Cited By (since 1996):2Export Date: 10 July 2014},
	month = {2008},
	pages = {38 - 50},
	abstract = {Using a Global Positioning System (GPS) in the car navigation system enables the driver to perform a wide range of queries, from locating the car position, to finding a route from a source to a destination, or dynamically selecting the best route in real time. With spatial network databases (SNDB), objects are restricted to move on pre-defined paths (e.g., roads) that are specified by an underlying network. In our previous work, we proposed a novel approach, termed Progressive incremental Network Expansion (PINE), to efficiently Support several spatial queries. In this work, we utilize our developed PINE system to efficiently support Restricted Continuous K Nearest Neighbors (RCKNNs) queries. RCKNN continously finds the K nearest objects to a query point an a given path that are within a specified distance bound. Our solution addresses a new type of query that is plausible to many applications where the answer to the query not only depends an the distances of the nearest neighbors, but also on the user ar application needs. By distinguishing between two types of split points, we reduce the number of computations required to retreive the RCKNNs of moving object. We futher define a caching model to expedite RCKNN query response time.},
	keywords = {Navigation system, Network databases, Spatial databases},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849106703\&partnerID=40\&md5=cc8d24f89ed2e864614cd064ddf33afc},
	author = {Safar, M. and Ebrahimi, D. and Jane, M.M.F. and Nadarajan, R.}
}
