02175nas a2200217   4500008004100000245005500041210005500096260000900151300001200160490000700172520145700179653002401636653002901660653004201689653002301731653002501754653002601779100001701805700001801822856011701840       2012                        eng d00aMiddleware model for adapting dynamic requirements0 aMiddleware model for adapting dynamic requirements  c2012  a20 - 280 v103 aMaking 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.10aAdaptability Metric10aAspect-Oriented Approach10aAspect-Oriented Reflective Middleware10aDynamic Adaptation10aDynamic Requirements10aReflective Middleware1 aSuganthi, S.1 aNadarajan, R.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84857583024&partnerID=40&md5=38c4e35715ea15a7d59be1dfde2d18d101581nas a2200193   4500008004100000245010100041210006900142260000900211300001400220490000600234520089200240653002201132653002801154653002601182100002601208700001801234700001801252856011701270       2009                        eng d00aCache Pre-fetching and Replacement strategies for location dependent data in mobile environments0 aCache Prefetching and Replacement strategies for location depend  c2009  a185 - 1900 v73 aIn 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.10aCache replacement10aLocation dependent data10aPrefetching algorithm1 aJane, Mary, Magdalene1 aIlayaraja, N.1 aNadarajan, R.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-73249124769&partnerID=40&md5=c2445ecd7a2b48db9d0be250bd2dc45e01928nas a2200205   4500008004100000245008000041210006900121260000900190300001200199490000600211520125600217653002201473653002201495653002201517100001401539700001701553700001701570700001801587856011701605       2008                        eng d00aRestricted continuous KNN queries on road networks with caching enhancement0 aRestricted continuous KNN queries on road networks with caching   c2008  a38 - 500 v63 aUsing 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.10aNavigation system10aNetwork databases10aSpatial databases1 aSafar, M.1 aEbrahimi, D.1 aJane, M.M.F.1 aNadarajan, R.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849106703&partnerID=40&md5=cc8d24f89ed2e864614cd064ddf33afc