753928
Policy mediation for multi-enterprise environments
Existing software infrastructures and middleware provide uniform security services across heterogeneous information networks. However few, if any, tools exist that support access control policy management for and between large enterprise information networks. Insiders often exploit gaps in policies to mount devastating attacks. This paper presents a Policy Machine and Policy Mediation Architecture for coordinating diverse policies in large information networks. The language-based approach adopted by each of these technologies permits local and global access control policy validation with static analysis and other formal techniques. Together the Policy Machine and Policy Mediation Architecture comprise an effective system for closing policy gaps in multi-enterprise environments.
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.
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.
59657780
Getting Useful Gender Statistics from English Text
Gender, understood as a lexical feature, is important for anaphora because it narrows down the number of possible referents involved in a typical pronoun resolution situation. This work describes an automatic method for obtaining reliable guesses about the gender of entities in a corpus using free text. By using a simple but unreliable anaphora algorithm repeatedly over a large corpus, the probable genders of referenced entities can be compiled and given a salience ranking. These statistics are an inexpensive way to add on gender-feature information to a statistical anaphora resolution algorithm.
5567072
Surprising Parser Actions and Reading Difficulty
An incremental dependency parser's probability model is entered as a predictor in a linear mixed-effects model of German readers' eye-fixation durations. This dependency-based predictor improves a baseline that takes into account word length, n-gram probability, and Cloze predictability that are typically applied in models of human reading. This improvement obtains even when the dependency parser explores a tiny fraction of its search space, as suggested by narrow-beam accounts of human sentence processing such as Garden Path theory.
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.