An integrated firewall policy validation tool.

Security policies are increasingly being implemented by organisations. Policies are mapped to device configurations to enforce the policies. This is typically performed manually by network administrators. The development and management of these enforcement policies is a difficult and error prone task. This thesis describes the development and evaluation of an off-line firewall policy parser and validation tool. This provides the system administrator with a textual interface and the vendor specific low level languages they trust and are familiar with, but the support of an off-line compiler tool. The tool was created using the Microsoft C#.NET language, and the Microsoft Visual Studio Integrated Development Environment (IDE). This provided an object environment to create a flexible and extensible system, as well as simple Web and Windows prototyping facilities to create GUI front-end applications for testing and evaluation. A CLI was provided with the tool, for more experienced users, but it was also designed to be easily integrated into GUI based applications for non-expert users. The evaluation of the system was performed from a custom built GUI application, which can create test firewall rule sets containing synthetic rules, to supply a variety of experimental conditions, as well as record various performance metrics. The validation tool was created, based around a pragmatic outlook, with regard to the needs of the network administrator. The modularity of the design was important, due to the fast changing nature of the network device languages being processed. An object oriented approach was taken, for maximum changeability and extensibility, and a flexible tool was developed, due to the possible needs of different types users. System administrators desire, low level, CLI-based tools that they can trust, and use easily from scripting languages. Inexperienced users may prefer a more abstract, high level, GUI or Wizard that has an easier to learn process. Built around these ideas, the tool was implemented, and proved to be a usable, and complimentary addition to the many network policy-based systems currently available. The tool has a flexible design and contains comprehensive functionality. As opposed to some of the other tools which perform across multiple vendor languages, but do not implement a deep range of options for any of the languages. It compliments existing systems, such as policy compliance tools, and abstract policy analysis systems. Its validation algorithms were evaluated for both completeness, and performance. The tool was found to correctly process large firewall policies in just a few seconds. A framework for a policy-based management system, with which the tool would integrate, is also proposed. This is based around a vendor independent XML-based repository of device configurations, which could be used to bring together existing policy management and analysis systems.

It's not interaction, it's make believe.

A principal, but largely unexplored, use of our cognition when using interacting technology involves pretending. To pretend is to believe that which is not the case, for example, when we use the desktop on our personal computer we are pretending, that is, we are pretending that the screen is a desktop upon which windows reside. But, of course, the screen really isn't a desktop. Similarly when we engage in scenario- or persona-based design we are pretending about the settings, narrative, contexts and agents involved. Although there are exceptions, the overwhelming majority of the contents of these different kinds of stories are not the case. We also often pretend when we engage in the evaluation of these technologies (e.g. in the Wizard of Oz technique we "ignore the man behind the curtain"). We are pretending when we ascribe human-like qualities to digital technology. In each we temporarily believe something to be the case which is not. If we add the experience of tele- and social-presence to this, and the diverse experiences which can arise from using digital technology which too are predicted on pretending, then we are prompted to propose that human computer interaction and cognitive ergonomics are largely built on pretending and make believe. If this premise is accepted (and if not, please pretend for a moment), there are a number of interesting consequences.

Competências estratégicas de negociação em gestão comercial

Dissertação de Mestrado apresentada à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências Empresariais

A saúde oral em dentição infantil

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Medicina Dentária

Caracterización y diagnóstico de calidad tejeduría en guanga Inga y Camëntsá, departamento del Putumayo, diagnóstico de calidad.

50 hojas : ilustraciones, fotografías.

Dynamic Window-Constrained Scheduling for Real-Time Media Streaming

This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for real-time multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes streams have window-constraints on groups of consecutive packet deadlines. A window-constraint defines the number of packet deadlines that can be missed in a window of deadlines for consecutive packets in a stream. Our algorithm, called Dynamic Window-Constrained Scheduling (DWCS), attempts to guarantee no more than x out of a window of y deadlines are missed for consecutive packets in real-time and multimedia streams. Using DWCS, the delay of service to real-time streams is bounded even when the scheduler is overloaded. Moreover, DWCS is capable of ensuring independent delay bounds on streams, while at the same time guaranteeing minimum bandwidth utilizations over tunable and finite windows of time. We show the conditions under which the total demand for link bandwidth by a set of real-time (i.e., window-constrained) streams can exceed 100% and still ensure all window-constraints are met. In fact, we show how it is possible to guarantee worst-case per-stream bandwidth and delay constraints while utilizing all available link capacity. Finally, we show how best-effort packets can be serviced with fast response time, in the presence of window-constrained traffic.

GreedyDual-Join: Locality-Aware Buffer Management for Approximate Join Processing Over Data Streams

We investigate adaptive buffer management techniques for approximate evaluation of sliding window joins over multiple data streams. In many applications, data stream processing systems have limited memory or have to deal with very high speed data streams. In both cases, computing the exact results of joins between these streams may not be feasible, mainly because the buffers used to compute the joins contain much smaller number of tuples than the tuples contained in the sliding windows. Therefore, a stream buffer management policy is needed in that case. We show that the buffer replacement policy is an important determinant of the quality of the produced results. To that end, we propose GreedyDual-Join (GDJ) an adaptive and locality-aware buffering technique for managing these buffers. GDJ exploits the temporal correlations (at both long and short time scales), which we found to be prevalent in many real data streams. We note that our algorithm is readily applicable to multiple data streams and multiple joins and requires almost no additional system resources. We report results of an experimental study using both synthetic and real-world data sets. Our results demonstrate the superiority and flexibility of our approach when contrasted to other recently proposed techniques.

Performance Analysis of a WWW Server

This paper addresses the problem of analyzing performance of WWW servers. The web has experienced a phenomenal growth and has become the most popular Internet application. As a consequence of its large popularity, the Internet has suffered from various performance problems, such as network congestion and overloaded servers. These days, it is not uncommon to find servers refusing connections because they are overloaded. Performance has always been a key issue in the design and operation of on-line systems. With regard to Internet, performance is also critical, because users want fast and easy access to all objects (i.e., documents, pictures, audio, and video) available on the net. Thus, it is important to understand WWW performance issues. This paper focuses on the performance analysis of a Web server. Using a synthetic benchmark (WebStone), we analyze three different Web server software running on top of a Windows NT platform and performing some typical WWW tasks.

Generalized Methods for Discovering Frequent Poly-Regions in DNA

The problem of discovering frequent poly-regions (i.e. regions of high occurrence of a set of items or patterns of a given alphabet) in a sequence is studied, and three efficient approaches are proposed to solve it. The first one is entropy-based and applies a recursive segmentation technique that produces a set of candidate segments which may potentially lead to a poly-region. The key idea of the second approach is the use of a set of sliding windows over the sequence. Each sliding window covers a sequence segment and keeps a set of statistics that mainly include the number of occurrences of each item or pattern in that segment. Combining these statistics efficiently yields the complete set of poly-regions in the given sequence. The third approach applies a technique based on the majority vote, achieving linear running time with a minimal number of false negatives. After identifying the poly-regions, the sequence is converted to a sequence of labeled intervals (each one corresponding to a poly-region). An efficient algorithm for mining frequent arrangements of intervals is applied to the converted sequence to discover frequently occurring arrangements of poly-regions in different parts of DNA, including coding regions. The proposed algorithms are tested on various DNA sequences producing results of significant biological meaning.

Discovering Frequent Poly-Regions in DNA Sequences

The problem of discovering frequent arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence is studied, and two efficient approaches are proposed to solve it. The first approach is entropy-based and uses an existing recursive segmentation technique to split the input sequence into a set of homogeneous segments. The key idea of the second approach is to use a set of sliding windows over the sequence. Each sliding window keeps a set of statistics of a sequence segment that mainly includes the number of occurrences of each item in that segment. Combining these statistics efficiently yields the complete set of regions of high occurrence of the items of the given alphabet. After identifying these regions, the sequence is converted to a sequence of labeled intervals (each one corresponding to a region). An efficient algorithm for mining frequent arrangements of temporal intervals on a single sequence is applied on the converted sequence to discover frequently occurring arrangements of these regions. The proposed algorithms are tested on various DNA sequences producing results with significant biological meaning.

Neural Pattern Recognition With Multi-Scale Pyramidal Coding and Selective Attention

A new neural network architecture for spatial patttern recognition using multi-scale pyramida1 coding is here described. The network has an ARTMAP structure with a new class of ART-module, called Hybrid ART-module, as its front-end processor. Hybrid ART-module, which has processing modules corresponding to each scale channel of multi-scale pyramid, employs channels of finer scales only if it is necesssary to discriminate a pattern from others. This process is effected by serial match tracking. Also the parallel match tracking is used to select the spatial location having most salient feature and limit its attention to that part.

Developing wireless measurement system for building deployed capacitive sensors with optimized RF front end circuit

In this paper, a prototype of miniaturized, low power, bi-directional wireless sensor node for wireless sensor networks (WSN) was designed for doors and windows building monitoring. The capacitive pressure sensors have been developed particularly for such application, where packaging size and minimization of the power requirements of the sensors are the major drivers. The capacitive pressure sensors have been fabricated using a 2.4 mum thick strain compensated heavily boron doped SiGeB diaphragm is presented. In order to integrate the sensors with the wireless module, the sensor dice was wire bonded onto TO package using chip on board (COB) technology. The telemetric link and its capabilities to send information for longer range have been significantly improved using a new design and optimization process. The simulation tool employed for this work was the Designerreg tool from Ansoft Corporation.

Formatting information: A beginner's introduction to typesetting with LATEX

This book originally accompanied a 2-day course on using the LATEX typesetting system. It has been extensively revised and updated and can now be used or self-study or in the classroom. It is aimed at users of Linux, Macintosh, or Microsoft Windows but it can be used with LATEX systems on any platform, including other Unix workstations, mainframes, and even your Personal Digital Assistant (PDA).

The relevance of bacterial isoprenoid biosynthetic pathways for host-microbe interactions

This thesis was undertaken to investigate the relevance of two bacterial isoprenoid biosynthetic pathways (Mevalonate (MVAL) and 2-C-methyl-D-erythritol 4-phosphate (MEP)) for host-microbe interactions. We determined a significant reduction in microbial diversity in the murine gut microbiota (by next generation sequencing) following oral administration of a common anti-cholesterol drug Rosuvastatin (RSV) that targets mammalian and bacterial HMG-CoA reductase (HMG-R) for inhibition of MVAL formation. In tandem we identified significant hepatic and intestinal off-target alterations to the murine metabolome indicating alterations in inflammation, bile acid profiles and antimicrobial peptide synthesis with implications on community structure of the gastrointestinal microbiota in statin-treated animals. However we found no effect on local Short Chain Fatty Acid biosynthesis (metabolic health marker in our model). We demonstrated direct inhibition of bacterial growth in-vitro by RSV which correlated with reductions in bacterial MVAL formation. However this was only at high doses of RSV. Our observations demonstrate a significant RSV-associated impact on the gut microbiota prompting similar human analysis. Successful deletion of another MVAL pathway enzyme (HMG-CoA synthase (mvaS)) involved in Listeria monocytogenes EGDe isoprenoid biosynthesis determined that the enzyme is non-essential for normal growth and in-vivo pathogenesis of this pathogen. We highlight potential evidence for alternative means of synthesis of the HMG-CoA substrate that could render mvaS activity redundant under our test conditions. Finally, we showed by global gene expression analysis (Massive Analysis of cDNA Ends (MACE RNA-seq) a significant role for the penultimate MEP pathway metabolite (E)-4-hydroxy-3-methyl-2-but-2-enyl pyrophosphate (HMBPP) in significant up regulation of genes of immunity and antigen presentation in THP-1 cells at nanomolar levels. We infected THP-1 cells with wild type or HMBPP under/over-producing L. monoctyogenes EGDe mutants and determined subtle effects of HMBPP upon overall host responses to Listeria infection. Overall our findings provide greater insights regarding bacterial isoprenoid biosynthetic pathways for host-microbe/microbe-host dialogue.

Excitation of highly conjugated (porphinato)palladium(II) and (porphinato)platinum(II) oligomers produces long-lived, triplet states at unit quantum yield that absorb strongly over broad spectral domains of the NIR.

Transient dynamical studies of bis[(5,5'-10,20-bis(2,6-bis(3,3-dimethylbutoxy)phenyl)porphinato)palladium(II)]ethyne (PPd(2)), 5,15-bis{[(5'-10,20-bis(2,6-bis(3,3-dimethylbutoxy)phenyl)porphinato)palladium(II)]ethynyl}(10,20-bis(2,6-bis(3,3-dimethylbutoxy)phenyl)porphinato)palladium(II) (PPd(3)), bis[(5,5'-10,20-bis(2,6-bis(3,3-dimethylbutoxy)phenyl)porphinato)platinum(II)]ethyne (PPt(2)), and 5,15-bis{[(5'-10,20-bis(2,6-bis(3,3-dimethylbutoxy)phenyl)porphinato)platinum(II)]ethynyl}(10,20-bis(2,6-bis(3,3-dimethylbutoxy)phenyl)porphinato)platinum(II) (PPt(3)) show that the electronically excited triplet states of these highly conjugated supermolecular chromophores can be produced at unit quantum yield via fast S(1) → T(1) intersystem crossing dynamics (τ(isc): 5.2-49.4 ps). These species manifest high oscillator strength T(1) → T(n) transitions over broad NIR spectral windows. The facts that (i) the electronically excited triplet lifetimes of these PPd(n) and PPt(n) chromophores are long, ranging from 5 to 50 μs, and (ii) the ground and electronically excited absorptive manifolds of these multipigment ensembles can be extensively modulated over broad spectral domains indicate that these structures define a new precedent for conjugated materials featuring low-lying π-π* electronically excited states for NIR optical limiting and related long-wavelength nonlinear optical (NLO) applications.