15984449
Visual information retrieval
New updated! The latest book from a very famous author finally comes out. Book of visual information retrieval, as an amazing reference becomes what you need to get. What's for is this book? Are you still thinking for what the book is? Well, this is what you probably will get. You should have made proper choices for your better life. Book, as a source that may involve the facts, opinion, literature, religion, and many others are the great friends to join with.
8323337
Modeling Functional Data Sources as Relations
In this paper we present a model of functional access to data that, we argue, is suitable for modeling a class of data repositories characterized by functional access, such as web sites. We discuss the problem of modeling such data sources as a set of relations, of determining whether a given query expressed on these relations can be translated into a combination of functions defined by the data sources, and of finding an optimal plan to do so.
2635468
A System for Managing Alternate Models in Model-Based Mediation
In [1,3], we have described the problem of model-based mediation (MBM) as an extension of the global-as-view paradigm of information integration. The need for this extension arises in many application domains where the information sources to be integrated not only differ in their export formats, data models, and query capabilities, but have widely different schema with very little overlap in attributes. In scientific applications, the information sources come from different subdisciplines, and despite their poorly overlapping schema, can be integrated because they capture different aspects of the same scientific objects or phenomena, and can be conceptually integrated due to scientific reasons. In the MBM paradigm, a “mediation engineer” consults with domain experts to explicitly model the “glue knowledge” using a set of facts and rules at the mediator. Integrated views are defined in MBM on top of the exported schemas from the information sources together with the glue knowledge source that ties them together. We have successfully applied the MBM technique to develop the KIND mediator or Neuroscience information sources [1]-[4]. To accomplish this, sources in the MBM framework export their conceptual models (CMs), consisting of the logical schema, domain constraints, and object contexts, i.e., formulas that relate their conceptual schema with the global domain knowledge maintained at the mediator. Thus model-based mediation has a hybrid approach to information integration - on the one hand at the mediator integrated views are defined over source CMs and the Knowledge Map using a global-as-view approach; on the other hand, object-contexts of the source are defined as local-as-view.
9743987
Complex Visual Activity Recognition Using a Temporally Ordered Database
We propose using a temporally ordered database for complex visual activity recognition. We use a temporal precedence relation together with the assumption of fixed bounded temporal uncertainty of occurrence time of an atomic activity and comparatively large temporal extent of the complex activity. Under these conditions we identify the temporal structure of complex activities as a semiorder and design a database that has semiorder as its data model. A query algebra is then defined for this data model.
14666453
An Interpolated Volume Data Model
Publisher Summary This chapter explores the basic functionality of the volume data model. It considers examples from biology and volumes of measurement from quantum physics. The data model is similar in the two cases, but the operations that are commonly used are quite different. In the second case, for instance, one is often interested in conditions on the behavior of local differential operators, such as zero-flow surfaces, while in the biological case one has a mix of value conditions and geometric condition. With these two application fields, this chapter highlights the generality and flexibility of the model. The system is based on a commercial database, augmented with specialized functions to manipulate the volume data model. The chapter demonstrates various operations specifying queries both using a graphical user interface and entering them directly in structured query language (SQL) augmented with the volume algebra operations.
28954888
Modeling shape and topology of 3D images of biological specimens
This paper presents an efficient way of representing the geometry and topology of 3D images of biological specimens derived from electron microscopy. A vector quantization algorithm is used in order to select a reduced set of interior points that best approximates the probability density function of the original volumetric data. Object's geometry and topology are obtained from the point set by the use of the alpha shapes theory.
14465668
The economics of network management
Why are pricing issues the key to infrastructure investment and future growth of the Internet? The Economics of network management I t is not surprising that researchers in network technology are utilizing ideas from the field of economics since it provides the conceptual understanding of underlying constructs such as usage and resource allocation. Proper resource allocation plays a key role in improving network performance. There are two primary approaches to economic resource allocation: quantity limits, and pricing. The former has the advantage of low accounting costs. However, it requires central administration and, for network users wishing to purchase more quantity than allocated, a pricing schedule has to be developed. The pricing approach does not enforce any quantity limits. Instead, users self-select the quantity they are willing to purchase at prevailing prices. The pricing approach decentralizes the resource allocation problem but has higher accounting costs since usage needs to be monitored and billed. The role of pricing as a resource allocation mechanism will be examined here, since central administration of quotas would be difficult in a global network. Furthermore, a pricing mechanism may still be needed to meet user demands in e-commerce. While the short-term role of economic pricing is to manage the network resources more efficiently, in the long run it could play an important role in the design of new network protocols. For example, new technological developments with priority classes in the IPv6 Internet protocol [3] will present the challenge of defining an economic basis for priority allocation. The Internet traffic-pricing problem for e-commerce subsumes traditional telecommuni-cation pricing policies and is much more complex. Traditional telecommunication systems offer a single quality level for their services on a given type of network, for example, the ability to carry voice data at a desired rate on a telephone network. However, in e-commerce there is a rich collection of services that require different levels of service quality over the same data communication network. For example, during a telnet session a user requires a high-speed and low-volume data transfer for real-time interaction with a server. On the other hand, a video conference needs clarity and coordination in picture and sound, necessitating a much more complex set of service quality attributes, such as synchronization of information sent via different interoperable applications (video, audio, and text). In addition, audio and video applications require high-volume and high-speed transfers with low variability in data transfer rates. These …
13088866
Specification-based anomaly detection: a new approach for detecting network intrusions
Unlike signature or misuse based intrusion detection techniques, anomaly detection is capable of detecting novel attacks. However, the use of anomaly detection in practice is hampered by a high rate of false alarms. Specification-based techniques have been shown to produce a low rate of false alarms, but are not as effective as anomaly detection in detecting novel attacks, especially when it comes to network probing and denial-of-service attacks. This paper presents a new approach that combines specification-based and anomaly-based intrusion detection, mitigating the weaknesses of the two approaches while magnifying their strengths. Our approach begins with state-machine specifications of network protocols, and augments these state machines with information about statistics that need to be maintained to detect anomalies. We present a specification language in which all of this information can be captured in a succinct manner. We demonstrate the effectiveness of the approach on the 1999 Lincoln Labs intrusion detection evaluation data, where we are able to detect all of the probing and denial-of-service attacks with a low rate of false alarms (less than 10 per day). Whereas feature selection was a crucial step that required a great deal of expertise and insight in the case of previous anomaly detection approaches, we show that the use of protocol specifications in our approach simplifies this problem. Moreover, the machine learning component of our approach is robust enough to operate without human supervision, and fast enough that no sampling techniques need to be employed. As further evidence of effectiveness, we present results of applying our approach to detect stealthy email viruses in an intranet environment.
3086074
An Exercise in Fault-Containment: Self-Stabilizing Leader Election
Self-stabilizing algorithms are designed to guarantee convergence to some desired stable state from arbitrary initial states arising out of an arbitrarily large number of faults. However, in a well-designed system, the simultaneous occurrence of a large number of faults is rare. It is therefore desirable to design algorithms that are not only self-stabilizing, but also have the ability to recover very fast from a bounded number of faults. As an illustration, we present a simple self-stabilizing leader election protocol that recovers in O(1) time from a state with a single transient fault on oriented rings. Only the faulty node and its two neighbors change their state during convergence to a stable state. Thus, the effect of a single fault is tightly contained around the fault. The technique for transforming a self-stabilizing algorithm into its fault-contained version is simple and general, and can be applied to other problems as well that satisfy certain properties.
11198288
Why the Information Explosion Can Be Bad for Data Mining, and How Data Fusion Provides a Way Out
One may claim that the exponential growth in the amount of data provides great opportunities for data mining. Reality can be different though. In many real world applications, the number of sources over which this information is fragmented grows at an even faster rate, resulting in barriers to widespread application of data mining and missed business opportunities. Let us illustrate this paradox with a motivating example from database marketing. In marketing, direct forms of communication are becoming increasingly popular. Instead of broadcasting a single message to all customers through traditional mass media such as television and print, the most promising potential customers receive personalized offers through the most appropriate channels. So it becomes more important to gather information about media consumption, attitudes, product propensity etc. at an individual level. Basic, company specific customer information resides in customer databases, but market survey data depicting a richer view of the customer are only available for a small sample or a disjoint set of reference customers. Collecting all this information for the whole customer database in a single source survey would certainly be valuable but is usually a very expensive proposition. The common alternative within business to
14215965
On the Covering Steiner Problem
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with edge-costs, and some subsets of vertices called groups, with each group being equipped with a non-negative integer value (called its requirement); the problem is to find a minimum-cost tree which spans at least the required number of vertices from every group. When all requirements are equal to 1, this is the Group Steiner problem.