19327594
Mobility-Pattern-Based Anomaly Detection Algorithm in Mobile Networks
Numerous approaches have been proposed for intrusion detection in immobile networks. However, little research work has been done in actually implementing them, especially for anomaly detection, in mobile networks. In this paper, we present an efficient mobility-pattern-based (MPB) anomaly detection algorithm. It can effectively identify abnormal mobility patterns of the nodes in mobile networks. In the proposed algorithm, the normal mobility profile of a specific node is characterized by a multi-leaf tree structure in which each node corresponds to a possible destination cluster. A normal mobility profile is generated during the training process through data mining and fuzzy logic techniques. More specifically, data mining techniques are used for cluster classifications, and fuzzy logic techniques are used to integrate the 'similar'' pattern strings after the corresponding cluster generation. These two techniques are also used during the testing process for distinguishing abnormal mobility patterns of the node from those of the normal in mobile networks. Simulation results demonstrate that our proposed MPB anomaly detection algorithm can achieve good performance in terms of detection rate and false alarm rate for nodes with regular movement behaviors by fine tuning the design parameter - threshold, that can be chosen efficiently.
321445
Detection of Masquerade Attacks on Wireless Sensor Networks
We propose two lightweight techniques to detect masquerade attacks on wireless sensor networks (WSN). Our solutions take into consideration, important WSN properties like coverage, connectivity, data aggregation and specific communication patterns. The two proposed techniques complement each other when used concurrently. The mutual guarding (MG) technique does not work when nodes are not completely covered by their neighbors or when adversary has shorter transmission range than the sensor nodes. It also does not protect nodes near the boundary. The SRP technique does not have these drawbacks. In this paper, we present our proposed techniques and analyze their performance in terms of successful masquerade detection rate and traffic and computational overhead.
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.
8951467
Heuristics for selecting robust database structures with dynamic query patterns
The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-making. Achieving such a ‘‘right time/right place’’ duet depends directly on database performance. A database system has been a core component that supports modern business system such as enterprise resource planning (ERP) system that integrates and supports all enterprise processes including product designing and engineering, manufacturing, and other business functions to achieve highest efficiency and effectiveness of operations. We develop and demonstrate through a proof-of-concept case study, a new ‘‘query-driven’’ heuristics for database design that seeks to identify database structures that perform robustly in dynamic settings with dynamic queries. Our focus is the design of efficient structures to process read-only queries in complex environments. Our heuristics begins with detailed analysis of relationships between diverse queries and the performance of different database structures. These relationships are then used in a series of steps that identify ‘‘robust’’ database structures that maintain high performance levels for a wide range of query patterns. We conjecture that our heuristics can facilitate efficient operations and effective decision-making of companies in todays dynamic environment. � 2004 Elsevier B.V. All rights reserved.
31511581
Mutual Exclusion on a Hypercube
Abstract We present a decentralized, symmetric mutual exclusion algorithm that is tailored to the hypercube architecture. Our algorithm has better time complexity than a suitable hypercube adaptation of Maekawa′s O(√N) Mutual Exclusion algorithm. We show that, in the presence of contention, our algorithm has a shorter Blocking Delay than Maekawa′s algorithm. In the absence of contention, our algorithm achieves optimal Round-trip Delay under both the n-port and the one-port communication models.
46325618
Policy Framework for Autonomic Data Managemen
38479721
Optimal polyline tracking for artery motion compensation in coronary angiography
We propose a novel solution to the problem of motion compensation of coronary angiographs. As the heart is beating, it is difficult for the physician to observe closely a particular point (e.g. stenosis) on the artery tree. We propose, to rigidly compensate the sequence so that the area around the point of interest appears stable. This is a difficult problem because the arteries deform in a non-rigid manner and only their 2D X-ray projection is observed. Also, the lack of features around the selected point makes the matching subject to the aperture problem. The algorithm automatically extracts a section of the artery of interest, models it as a polyline, and tracks it. The problem is formulated as an energy minimization problem which is solved using a shortest path in a graph algorithm. The motion compensated sequence can be obtained by translating every pixel so that the point of interest remains stable. We have applied this algorithm to many examples in two sets of angiography data and have obtained excellent results.