Typescript, etc. / Digitized by Kansas Correctional Industries

Thesis (Ph. D.)--University of Texas at Austin, 1999. / Vita. Includes bibliographical references (leaves 152-155) and index. Available also in a digital version from Dissertation Abstracts.

Thesis (M.A.)--York University, 2005. Graduate Programme in Mathematics and Statistics. / Typescript. Includes bibliographical references (leaves 92-94). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url%5Fver=Z39.88-2004&res%5Fdat=xri:pqdiss &rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR11823

"Complex event processing (CEP) has become increasingly important in modern applications, ranging from supply chain management for RFID tracking to real-time intrusion detection. These monitoring applications must detect complex event pattern sequences in event streams. However, the state-of-art in the CEP literature such as SASE, ZStream or Cayuga either do not support the specification of nesting for pattern queries altogether or they limit the nesting of non-occurrence expressions over composite event types. A recent work by Liu et al proposed a nested complex event pattern expression language, called NEEL (Nested Complex Event Language), that supports the specification of the non-occurrence over complex expressions. However, their work did not carefully consider predicate handling in these nested queries, especially in the context of complex negation. Yet it is well-known that predicate specification is a critical component of any query language. To overcome this gap, we now design a nested complex event pattern expression language called NEEL+, as an extension of the NEEL language, specifying nested CEP queries with predicates. We rigorously define the syntax and semantics of the NEEL+ language, with particular focus on predicate scoping and predicate placement. Accordingly, we introduce a top-down execution paradigm which recursively computes a nested NEEL+ query from the outermost query to the innermost one. We integrate predicate evaluation as part of the overall query evaluation process. Moreover, we design two optimization techniques that reduce the computation costs for processing NEEL+ queries. One, the intra-query method, called predicate push-in, optimizes each individual query component of a nested query by pushing the predicate evaluation into the process of computing the query rather than evaluating predicates at the end of the computation of that particular query. Two, the inter-query method, called predicate shortcutting, optimizes inter-query predicate evaluation. That is, it evaluates the predicates that correlate different query components within a nested query by exploiting a light weight predicate short cut. The NEEL+ system caches values of the equivalence attributes from the incoming data stream. When the computation starts, the system checks the existence of the attribute value of the outer query component in the cache and the predicate acts as a shortcut to early terminate the computation. Lastly, we conduct experimental studies to evaluate the CPU processing resources of the NEEL+ System with and without optimization techniques using real-world stock trading data streams. Our results confirm that our optimization techniques when applied to NEEL+ in a rich variety of cases result in a 10 fold faster query processing performance than the NEEL+ system without optimization."

"The real-time detection of anomalous phenomena on streaming data has become increasingly important for applications ranging from fraud detection, financial analysis to traffic management. In these streaming applications, often a large number of similar continuous outlier detection queries are executed concurrently. In the light of the high algorithmic complexity of detecting and maintaining outlier patterns for different parameter settings independently, we propose a shared execution methodology called SOP that handles a large batch of requests with diverse pattern configurations. First, our systematic analysis reveals opportunities for maximum resource sharing by leveraging commonalities among outlier detection queries. For that, we introduce a sharing strategy that integrates all computation results into one compact data structure. It leverages temporal relationships among stream data points to prioritize the probing process. Second, this work is the first to consider predicate constraints in the outlier detection context. By distinguishing between target and scope constraints, customized fragment sharing and block selection strategies can be effectively applied to maximize the efficiency of system resource utilization. Our experimental studies utilizing real stream data demonstrate that our approach performs 3 orders of magnitude faster than the start-of-the-art and scales to 1000s of queries."

Notre Travail s’inscrit dans le cadre théorique du traitement informatique des langues, élaboré et développé au sein du laboratoire Lexiques, Dictionnaires, Informatique (LDI), à l’université de Paris 13. Nous avons proposé l’étude de la notion de cause et de finalité en arabe contemporain, à partir d’un corpus varié. Cette étude se subdivise en deux grands axes. D’abord, il nous a paru nécessaire d’analyser le phénomène, tel qu’il était traité dans la tradition grammaticale arabe. A ce niveau, nous avons concentré notre analyse sur les notions fondamentales et leurs répercussions sur les choix méthodiques des grammairiens et les résultats de leurs descriptions. Montrant l’insuffisance de ces descriptions, plus particulièrement, au niveau de la distinction syntactico-sémantique entre les connecteurs, notre approche trouve sa raison d’application. Nous avons, donc, décrit les emplois des connecteurs causaux et finaux, tout en argumentant leur statut prédicatif de second ordre. Ce nouveau statut attribué à ces connecteurs (verbaux, nominaux, adjectivaux, prépositionnels, ou encore comme locations) conçoit la phrase complexe, comme une structure triadique, à la différence de l’approche grammaticale et linguistique arabe (conception dyadique). La description syntactico-sémantique a permis de montrer qu’on ne peut pas réduire les connecteurs à des simples éléments polysémiques. Chacun apporte une nuance sémantique à l’expression de la cause et de de la finalité. Toutefois, bien que la cause et la finalité s’interfèrent à plusieurs niveaux, elles se distinguent à la base d’une orientation logico-sémantique. L’orientation « rétrospective » caractérise la valeur causale de l’expression, alors que l’orientation « prospective » distingue l’expression finale. Bref, ce travail essaie d’apporter une nouvelle analyse sur un sujet qui n’a pas été traité dans la linguistique arabe. / Our work is conducted within the theoretical framework of computer language processing, designed and developed in the laborary “Lexiques, Dictionnaires, Informatiques” (LDI), at the University of Paris 13. We proposed the study of the concept of cause and purpose in contemporary Arabic language, based on a varied corpus. This study is two-fold. First, we felt it necessary to analyze the phenomenon, as it was treated in the Arab grammatical tradition. At this level, we focused our analysis on the basic concepts and their implications on systematic selection of grammarians’ methodology and the findings of their descriptions. Our approach finds its reason for application by showing the inadequacy of these descriptions. Our approach finds its reason for distinction between connectors. We, therefore, describe the cause and purpose connectors, while arguing their predicative second-class status. This new status assigned to these connectors (verbal, nominal, adjectival, prepositional, or as special) perceives the complex sentence as a triadic structure, unlike the Arabic linguistic and grammatical approach (dyadic design). The syntactic-semantic description showed that we cannot reduce connectors to mere items of meaning. Each brings a semantic nuance to the expression of the cause and the purpose. However, although the cause and purpose do interfere at several levels, they still differ on the basis of a logical-semantic orientation. The “retrospective” orientation characterizes the causal value of the expression, while the “prospective” one distinguishes the expression of purpose. In short, this work tries to bring a new analysis of a topic that was not dealt with in the Arabic linguistics.

I have added support for predicate dispatching, a powerful generalization of other dispatching mechanisms, to the Common Lisp Object System (CLOS). To demonstrate its utility, I used predicate dispatching to enhance Weyl, a computer algebra system which doubles as a CLOS library. My result is Dispatching-Enhanced Weyl (DEW), a computer algebra system that I have demonstrated to be well suited for both users and programmers.

Thesis--Bonn. / Extra t.p. with thesis statement inserted. Includes bibliographical references (p. 39-41).

vii, 216 leaves ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, Dept. of Philosophy, 1979

The use of predicate transformers to model the action of sequential programs has allowed the construction of a refinement calculus for expressing the formal verification of the top-down development of sequential programs. It is shown that predicate transformers may also be used to model real-time processes. The notions of precondition and postcondition in the sequential refinement calculus are replaced by the notions of assumption and effect. In this way the formal development of real-time processes may also be expressed within the refinement calculus. Notations are developed for the specification and implementation of real-time processes within the framework of the refinement calculus. Several case-studies are presented to demonstrate the utility of this approach.