28922091
Policy driven data administration
This paper describes architecture for Policy Driven Data Administration (PDDA), a system for managing data using policies. The architecture supports policy specification, deployment and execution requirements of a system that can autonomically manage data based on pre-specified policies.
14792710
Enabling analysts in managed services for CRM analytics
Data analytics tools and frameworks abound, yet rapid deployment of analytics solutions that deliver actionable insights from business data remains a challenge. The primary reason is that on-field practitioners are required to be both technically proficient and knowledgeable about the business. The recent abundance of unstructured business data has thrown up new opportunities for analytics, but has also multiplied the deployment challenge, since interpretation of concepts derived from textual sources require a deep understanding of the business. In such a scenario, a managed service for analytics comes up as the best alternative. A managed analytics service is centered around a business analyst who acts as a liaison between the business and the technology. This calls for new tools that assist the analyst to be efficient in the tasks that she needs to execute. Also, the analytics needs to be repeatable, in that the delivered insights should not depend heavily on the expertise of specific analysts. These factors lead us to identify new areas that open up for KDD research in terms of 'time-to-insight' and repeatability for these analysts. We present our analytics framework in the form of a managed service offering for CRM analytics. We describe different analyst-centric tools using a case study from real-life engagements and demonstrate their effectiveness.
22023969
Some issues in privacy data management
A method and apparatus is provided for aligning and press-fitting connector terminals into a substrate. The terminals are initially supported together by a bandolier strip, and an alignment tool aligns the terminals with apertures in the substrate to which the terminals will be press-fitted. A pressing tool engages the shanks of the terminals to fold the bandolier away from the terminals and thereafter press the terminals into the apertures.
10962942
Towards bringing database management task in the realm of IT non-experts
Internet enabled services have led to an increase in the size and complexity of the database making the database administration task very complex. This necessitates the hiring of skilled personnel for the management of data, which is a bane for industries, especially in developing countries. We at IBM India research Lab, have been developing technologies (i.e. database administration tools), wherein the database administrator, who may be inexperienced person, can define error-free policies for managing and maintaining the distributed information repositories, and can define data access privileges to users at fine as well as at coarse-grained level using natural language like constructs. These policies represent the actions that need to be carried out when specific database/temporal events occur within the system or externally and are notified to the system. In this paper, we discuss the architecture of our policy based database administration and access control system and outline some of the technical challenges in this area.
20290151
Web Page Ranking Based on Events
Search results of web search engines are displayed according to their ranking function, which is a function of the in-links and the out-links of the web page. Users are generally overwhelmed by the thousands of results retrieved by the search engine, few of which are useful. Most of the search engine users are interested in the latest information about the searched keywords. Such pages containing the latest information about an event (or incident) are not always ranked high by the search engines due to the lack of sufficient in-links pointing to these web pages. For example, if a search query “DaWaK” is given to Google, the users are generally interested in the latest information i.e., the home page of DaWaK 2004 conference, which is not ranked in the top 10 results returned by Google. In this paper we address the problem of ranking the web pages based on events (or incidents) related to the searched keywords. We provide a method for finding patterns that constitute events in the search results returned by a conventional search engine and then rank the web pages based on these event patterns. We also describe a mechanism whereby our technique can be used inside the ranking function of a conventional search engine such as Google. We provide experimental results that validate the efficiency and use of our technique in capturing the user intentions.
7664269
Management of Conflicting Obligations in Self-Protecting Policy-Based Systems
Policy-based management of business systems is increasingly becoming the norm for autonomic computing since these systems can adapt to the changing needs and increasing complexity of the underlying organizations or enterprises. One of the vital characteristics of these systems is self-protection, ie., the ability to secure information and resources, by anticipating, detecting, identifying and protecting against any form of unauthorised access and permitting all authorised accesses based on the users' roles and pre-established policies. In this paper, we focus on one aspect of self-protecting autonomous systems, which is, how to automatically enforce privacy policies related to data handling, for compliance and auditing purposes. The automatic management of privacy sensitive information based on enterprise policies that are driven by a combination of user preferences, internal objectives and external regulations is a key aspect to any enterprise to prevent misuse of this information. These policies extend beyond simple authorization rules, and also mandate obligations to be enforced under certain conditions. One issue in the automatic enforcement of obligations is the presence of conflicts among different obligations which mandate different actions on the same resource, based on different conditions in which the resource is accessed. In this paper we propose algorithms for detecting and resolving conflicts among obligations in both static and runtime environments. We then briefly describe our prototype obligation management system with the conflict resolution module that achieves the automated enforcement of obligations for data-handling based on privacy policies
17889083
Managing computing resources in active intranets
The objective of this paper is to present an economic pricing-based resource management technique for Intranets that has the capability of managing Intranet resources from an organizational perspective. We discuss the adoption of this pricing scheme at three stages: application level, node level, and data-stream level implementations. These three levels demonstrate how a pricing based approach can be used with the current technology and also be migrated to evolving network architectures such as active networks.
8269092
Color and texture fusion: application to aerial image segmentation and GIS updating
Abstract This paper describes a new algorithm for combining color and texture information for the segmentation of color images. The algorithm uses maximum likelihood classification combined with a certainty based fusion criterion. The algorithm was validated using mosaics of real color textures. It was also tested on real outdoor color scenes and aerial images. This algorithm is part of a more complex system, which is currently being designed to assist an operator in updating an old map of an area using aerial images.
26822142
Minitrack Introduction
1276171
Using Lagrangean Relaxation for Service Location Planning with QoS Constraints in Large-Scale Networks
Current trends in computing indicate that there is a great potential for service oriented computing and similar technologies, such as Cisco's Application Oriented Networks, where services provide a higher-level of abstraction to traditional applications. In such cases, providing and consuming services and establishing a relationship between consumers (users of services) and producers (providers of services) are still challenging and vastly researched aspects. We define a service location planning problem (SLP) that is novel in the approach it takes to match consumers to producers, such that the cost of providing services is minimized while taking into account quality of service constraints of throughput and delay. In previous work, we presented an integer linear programming (ILP) model to formulate the service location planning problem. In this paper, we present Lagrangean Relaxation of the model for large-scale networks. We use the approach of Trick [3] to decrease computational overheads.
11252982
Segmentation of range images as the search for geometric parametric models
Segmentation of range images has long been considered in computer vision as an important but extremely difficult problem. In this paper we present a new paradigm for the segmentation of range images into piecewise continuous surfaces. Data aggregation is performed via model recovery in terms of variable-order bi-variate polynomials using iterative regression. Model recovery is initiated independently in regularly placed seed regions in the image. All the recovered models are potential candidates for the final description of the data. Selection of the models is defined as a quadratic Boolean problem, and the solution is sought by the WTA (winner-takes-all) technique, which turns out to be a good compromise between the speed of computation and the accuracy of the solution. The overall efficiency of the method is achieved by combining model recovery and model selection in an iterative way. Partial recovery of the models is followed by the selection (optimization) procedure and only the “best” models are allowed to develop further.The major novelty of the approach lies in an effective combination of simple component algorithms, which stands in contrast to methods which attempt to solve the problem in a single processing step using sophisticated means. We present the results on several real range images.