6476795
Content-based alternatives to conventional network monitoring systems
Network monitoring and management rely extensively upon network protocol identification as one of the most basic acts of analysis of network traffic. However, the conventional method of identifying network protocols based upon standard or well-known port numbers is no longer sufficient for modern networks, given the propensities for users and programs to change ports dynamically or use nonstandard ports. Unfortunately, this calls into question the ability of the collection of standard tools to gather reliable network intelligence.
8450010
Analyzing FD Inference in Relational Databases
Abstract This paper deals with the general problem of analyzing fuzzy inference based on functional dependencies (FDs) in database relations. Fuzzy inference, the ability to infer fuzzy set values, generalizes imprecise (set-valued) inference and precise inference. Likewise, fuzzy relational databases generalize their classical and imprecise counterparts by supporting fuzzy information storage and retrieval. Inference analysis is performed using a special abstract model which maintains vital links to classical, imprecise and fuzzy relational database models. These links increase the utility of the inference formalism in practical applications involving “catalytic inference analysis”, including knowledge discovery and database security.
15214066
A genetic algorithm for fragment allocation in a distributed database system
In this paper we explore the distributed database allocation problem, which is intractable. We also discuss genetic algorithms attd how they have been used successfully to solve combinatorial problems. Our experimental results show the GA to be far superior to the greecly heuristic in obtaining optimal and near optimal fragment placements for the allocation problem with various data sets.
45370451
Programmable Security for Object-Oriented Systems
This paper focuses on “programmable security” for object-oriented systems and languages. A primitive distributed object model is used to capture the essence of object behavior and access control schemes. This model can be used to construct virtually any distributed object language or system while supporting a spectrum of decentralized authorization models.
2505382
Catalytic inference analysis: detecting inference threats due to knowledge discovery
Knowledge discovery in databases can be enhanced by introducing "catalytic relations" conveying external knowledge. The new information catalyzes database inference, manifesting latent channels. Catalytic inference is imprecise in nature, but the granularity of inference may be fine enough to create security compromises. Catalytic inference is computationally intensive. However, it can be automated by advanced search engines that gather and assemble knowledge from information repositories. The relentless information gathering potential of such search engines makes them formidable security threats. This paper presents a formalism for modeling and analyzing catalytic inference in "mixed" databases containing various precise, imprecise and fuzzy relations. The inference formalism is flexible and robust, and well-suited to implementation.
44644823
On Modeling Computer Networks for Vulnerability Analysis
Enterprise security must take into account a holistic view of the network. Capturing security and vulnerability attributes of network services and systems is a critical aspect of effective vulnerability analysis and remediation. Unfortunately, this is not always possible due to the overhead associated with tracking distributed resources. Conventional tools create topological maps of a network and extract a signature of the state of individual components. However, these tools require human interpretation to be useful for security. The goal of network modeling for vulnerability analysis is to glean and interpret data from a variety of resources in order to create an abstract model of the security of a network. A sound network model is essential to the analysis of potential threats to a network.
431369
The Information-Processing Difficulty Of Incremental Parsing
When an incremental parser gets the next word, its expectations about upcoming grammatical structures can change. When a word greatly constrains these grammatical expectations, uncertainty is reduced. This elimination of possibilities constitutes information processing work. Formalizing this notion of information processing work yields a complexity metric that predicts human repetition accuracy scores across a systematic class of linguistic phenomena, the Accessibility Hierarchy of relativizable grammatical relations.
7472011
PCFGs with Syntactic and Prosodic Indicators of Speech Repairs
A grammatical method of combining two kinds of speech repair cues is presented. One cue, prosodic disjuncture, is detected by a decision tree-based ensemble classifier that uses acoustic cues to identify where normal prosody seems to be interrupted (Lickley, 1996). The other cue, syntactic parallelism, codifies the expectation that repairs continue a syntactic category that was left unfinished in the reparandum (Levelt, 1983). The two cues are combined in a Treebank PCFG whose states are split using a few simple tree transformations. Parsing performance on the Switchboard and Fisher corpora suggests that these two cues help to locate speech repairs in a synergistic way.
5490143
A Probabilistic Earley Parser as a Psycholinguistic Model
In human sentence processing, cognitive load can be defined many ways. This report considers a definition of cognitive load in terms of the total probability of structural options that have been disconfirmed at some point in a sentence: the surprisal of word wi given its prefix wo...i-1 on a phrase-structural language model. These loads can be efficiently calculated using a probabilistic Earley parser (Stolcke, 1995) which is interpreted as generating predictions about reading time on a word-by-word basis. Under grammatical assumptions supported by corpus-frequency data, the operation of Stolcke's probabilistic Earley parser correctly predicts processing phenomena associated with garden path structural ambiguity and with the subject/object relative asymmetry.