Digital Commons Network^™

Student Rights And Responsibilities, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Master Of Science Degree Programs, 2000-2001, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Multimedia Kuronthogai, Sellappan Mohan

Student Works (2000-2009)

Project Multimedia Kuronthogai is a Final Year Project (Thesis) offered by the Faculty of Computer Science & Information Technology. This project was divided into Thesis I and Thesis II and supervised by my project supervisor Assoc. Prof. Dr. N.Selvanathan. The moderator for this project is Cik Hannyzzura Affal. Kuronthogai is a one of the Tamil anthologies. It contains 401 poems. The theme of these poems is love and the verse are of the five lands (tinais) in appropriate time. Most of the Tamil literatures are in the form of a book. Only few of them are in Multimedia environment. It …

A Rate-Based End-To-End Multicast Congestion Control Protocol, Sherlia Shi, Marcel Waldvogel

All Computer Science and Engineering Research

Current reliable multicast protocols do not have scalable congestion control mechanisms and this deficiency leads to concerns that multicast deployment may endanger stability of the network. In this paper, we present a sender-based approach for multicast congestion control targeted towards reliable bulk data transfer. We assume that there are a few bottleneck links in a large scale multicast group at any time period and these bottlenecks persist long enough to be identified and adapted to. Our work focus on dynamically identifying the worst congested path in the multicast tree and obtaining TCP-friendly throughput on this selected path. We device novel …

Plugin Management For Active Network, Sumi Y. Choi

All Computer Science and Engineering Research

The purpose of this document is to present the overview of tte plugin management architecture and the description of the software developed for the scalable, high performance active network node project in Washington University, St. Louis. The plugin management is a user space daemon program that runs at the code(plugin) server and at the active network component of a router or a switch port processor. The running programs cooperate to load plugins from the code server to the active network component. This software is intended to be used among multiple platforms.

Data Archiving With The Srb*, Jinghua Zhou

All Computer Science and Engineering Research

We use the SRB (Storage Request Broker) middleware to design and implement a storage archival system which will be used to archive Neuroscience data. As part of the design process, we developed and used an experimenter's workbench to measure SRB performance. These experiments improved our understanding of both the functionality and the performance of the SRB. This technical report describes the scripts in the experimenter's workbench, the archiving scripts, and performance measurements.

On Maintaining Group Membership Data In Ad Hoc Networks, Gruia-Catalin Roman, Qingfeng Huang, Ali Hazemi

All Computer Science and Engineering Research

The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Essential to constructing a consistent view is the ability to know what hosts are within proximity of each other, i.e., form a group in support of the particular application. In this paper we propose an algorithm that allows hosts within communication range to maintain a consistent view of the group membership despite movement and frequent disconnections. The novel features of this algorithm are its reliance on location information and a conservative notion of logical connectivity that creates …

Programming Active Networks Using Active Pipes, Ralph Keller, Jeyashankher Ramamirtham, Tilman Wolf, Bernhard Plattner

All Computer Science and Engineering Research

Active networks allow customized processing of data traffic within the network which can be used by applications to improve the quality of their sessions. To simplify development of active applications in a heterogeneous environment, we propose active network pipes as a programming abstraction to specify transmission and processing requirements. We describe a routing algorithm that maps application session requirements onto network resources and determines an optimal route through the network transiting all required processing sites. Additionally, we propose a network software architecture to implement the functionality required to support active pipes.

Parallel Fpga Programming Over Backplane Chassis, John Lockwood, Tom Mclaughlin, Tom Chaney, Yuhua Chen, Fred Rosenberger, Alex Chandra, Jon Turner

All Computer Science and Engineering Research

For systems with a large number of FPGAs, where a design is instantiated across multiple FPGAs in a chassis, an efficient mechanism of programming the FPGA devices is needed. The mechanism described herein allows multiple FPGAs to be programmed across a backplane. Only a single configuration PROM is required to store the configuration for the multiple instances of the design. When the system boots, all FPGAs are programmed in parallel. This design is applicable to any system which contains a multiple board system which has instances of identical FPGA implementations distributed across the boards. Signal integrity of signals is considered.

Multi-Phase Discrete Particle Swarm Optimization, Buthainah Sabeeh No'man Al-Kazemi, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

This paper describes a successful adaptation of the Particle Swarm Optimization algorithm to discrete optimization problems. In the proposed algorithm, particles cycle through multiple phases with differing goals. We also exploit hill climbing. On benchmark problems, this algorithm outperforms a genetic algorithm and a previous discrete PSO formulation.

Measurement Of The Z Resonance Parameters At Lep, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

The properties of the Z resonance are measured from the analysis of 4.5 million Z decays into fermion pairs collected with the ALEPH detector at LEP. The data are consistent with lepton universality. The resonance parameters are measured to be MZ=(91.1885±0.0031)GeV/c2MZ=(91.1885±0.0031)GeV/c2, ΓZ=(2.4951±0.0043)ΓZ=(2.4951±0.0043) GeV, σ0had=(41.559±0.058)σhad0=(41.559±0.058) nb and, combining the three lepton flavours, Rℓ=20.725±0.039Rℓ=20.725±0.039. The corresponding number of light neutrino species is Nν=2.983±0.013Nν=2.983±0.013 and the strong coupling constant is αs(MZ)=0.114±0.004±0.002QCD+0.005log10[MH150GeV/c2]αs(MZ)=0.114±0.004±0.002QCD+0.005log10⁡[MH150GeV/c2]. The lepton pair forward-backward asymmetry is measured to be A0,ℓFB=0.0173±0.0016AFB0,ℓ=0.0173±0.0016 from which the effective weak mixing angle is derived: sin2θlepteff=0.23089±0.00089sin2⁡θefflept=0.23089±0.00089. The measurement of the leptonic width Γℓℓ=84.02±0.15Γℓℓ=84.02±0.15 MeV leads to a determination …

Imprecise Answers In Distributed Environments: Estimation Of Information Loss For Multi-Ontology Based Query Processing, Eduardo Mena, Vipul Kashyap, Arantza Illarramendi, Amit P. Sheth

Kno.e.sis Publications

The World Wide Web is fast becoming a ubiquitous computing environment. Prevalent keyword-based search techniques are scalable, but are incapable of accessing information based on concepts. We investigate the use of concepts from multiple, real-world pre-existing, domain ontologies to describe the underlying data content and support information access at a higher level of abstraction. It is not practical to have a single domain ontology to describe the vast amounts of data on the Web. In fact, we expect multiple ontologies to be used as different world views and present an approach to "browse" ontologies as a paradigm for information access. …

Optimization Techniques For Data Intensive Decision Flows, Richard Hull, Francois Llirbat, Bharat Kumar, Gang Zhou, Guozhu Dong, Jianwen Su

Kno.e.sis Publications

For an enterprise to take advantage of the opportunities afforded by electronic commerce it must be able to make decisions about business transactions in near-real-time. In the coming era of segment-of-one marketing, these decisions will be quite intricate, so that customer treatments can be highly personalized, reflecting customer preferences, the customer's history with the enterprise, and targeted business objectives. This paper describes a paradigm called “decision flows” for specifying a form of incremental decision-making that can combine diverse business factors in near-real-time.

This paper introduces and empirically analyzes a variety of optimization strategies for decision flows that are “data-intensive”, i.e. …

Codeweave: Exploring Fine-Grained Mobility Of Code, Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin Roman

All Computer Science and Engineering Research

This paper explores the range of constructs and issues facing the designer of mobile code systems which allow for the unit of mobility to be finer-grained than that of execution. Mobile UNITY, a notation and proof logic for mobile computing, provides for this research a clean abstract setting, i.e., unconstrained by compilation and performance considerations traditionally associated with programming language design. Within the context of Mobile UNITY, we take the extreme view that every line of code and every variable declaration is potentially mobile, i.e., it may be duplicated and/or moved from one program contxt to another on the same …

Recognition And Verification Of Design Patterns, Michael P. Plezbert, Ron K. Cytron

All Computer Science and Engineering Research

In this paper we consider the automatic discovery of design (programming) patterns. While patterns have surfaced as an effective mechanism for authoring and understanding compelx software, popular languages lack facilities for direct specification of patterns or verification of pattern usage in program specifications. Static analysis for patterns is provably undecidable; we focus on discovery and verification of patterns by analyzing dynamic sequences of method calls on object. We show a proof-of-concept of our approach by presenting the results of analyzing a Java program for Iterator patterns.

Lime: A Middleware For Physical And Logical Mobility, Gian Pietro Picco, Amy L. Murphy, Gruia-Catalin Roman

All Computer Science and Engineering Research

LIME is a middleware supporting the development of applications that exhibit physical mobility of hosts, logical mobility of agents, or both. LIME adopts a coordination perspective inspired by work on the Linda model. The context for computation, represented in Linda by a globally accessible, persistent tuple space, is represented in LIME by transient sharing of the tuple spaces carried by each individual mobile unit. Linda tuple spaces are also extended with a notion of location and with the ability to react to a given state. The hypothesis underlying our work is that the resulting model provides a minimalist set of …

Almi: An Application Level Multicast Infrastructure, Dimitrios Pendarakis, Sherlia Shi, Dinesh Verma, Marcel Waldvogel

All Computer Science and Engineering Research

The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems such as reliability, flow and congestion control, security and access control. Motivated by these problems, we have designed and implemented ALMI, an application level group communication middleware, which does not rely on network infrastructure support and thus, allows accelerated deployment and simplified configuration at the cost of a relatively small increase in traffic load. ALMI is tailored toward support of multicast groups of relatively small …

Design Tradeoffs For Embedded Network Processors, Tilman Wolf, Mark Franklin, Edward W. Spitznagel

All Computer Science and Engineering Research

Demands for flexible processing has moved general-purpose processing into the data path of networks. With the development of System-On-a-Chip technology, it is possible to put several processors with memory and I/O components on a single ASIC. We present a model of such a system with a simple performance metric and show how the number of processors and cache sizes can be optimized for a given workload. Based on a telecommunications benchmark we show the results of such an optimization and discuss how specialied hardware and appropriate scheduling can further improve system performance.

Synthesizer, A Pattern Language For Designing Digital Modular Synthesis Software, Thomas V. Judkins, Christopher D. Gill

All Computer Science and Engineering Research

Synthesizer is a pattern language for designing digital synthesizers using modular synthesis in software to generate sound. Software developed according to this pattern language emulates the abilities of an analog synthesizer. Modular synthesis is one of the oldest sound synthesis techniques. It was used in the earliest analog synthesizers, like the Moog [1] and ARP [2]. These machines introduced the oscillator-filter-amplifier paradigm, where sound generated by an oscillator is passed through a series of filters and amplifers before being sent to a speaker. These first machines had physical modules through which electrical signals were passed. These modules can be emulated …

Profile-Based Routing: A New Framework For Mpls Traffic Engineering, Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede

All Computer Science and Engineering Research

We present a new algorithm and framework for dynamic routing of bandwidth guaranteed flows. The problem is motivated by the need to dynamically set up bandwidth guaranteed paths in carrier and ISP networks. Traditional routing algorithms such as minimum hop routing or widest path routing do not take advantage of any knowledge about the traffic distribution or ingress-egress pairs, and therefore can often lead to severe network underutilization. Our work is inspired by the recently proposed "minimum interference routing" algorithm (MIRA) of Kodialam and Lakshman, but it improves on their approach in several ways. Our main idea is to use …

Hello, World: A Simple Application For The Field Programmable Port Extender (Fpx), John Lockwood, David Lim

All Computer Science and Engineering Research

The FPX provides simple and fast mechanisms to process cells or packets. By performing all computations in FPGA hardware, cells and packets can be processing at the full line speed of the card [currently 2.4 Gbits/sec]. A sample application, called 'Hello World' has been developed that illustrates how easily an application can be implemented on the FPX. This application uses the FPGA hardware to search for a string on a particular flow and selectively replace contents of the payload. The resulting circuit operates at 119 MHz on a Xilinx XCV 1000E-FG680-7, and occupies less than 1% of the available gates …

The Design And Performance Of Meta-Programming Mechanisms For Object Request Broker Middleware, Nanbor Wang, Kirthika Parameswaran, Douglass Schmidt

All Computer Science and Engineering Research

Distributed object computing (DOC) middleware shields developers from many tedious and error-prone aspects of programming distribued applications. Without proper support from the middleware, however, it can be hard to evolve distributed applications after they are deployed. Therefore, DOC middleware should support meta-programming mechanisms, such as smart proxies and interceptors, that improve the adaptability of distributed applications by allowing their behavior to be modified without drastically changing existing software. This paper presents three contributions to the study of metaprogramming mechanisms for DOC middleware. First, it illustrates, compares, and contrasts several meta-programming mechanisms from an application developer's perspective. Second, it outlines the …

View-Centric Reasoning About Parallel And Distributed Computation, Marc L. Smith

Retrospective Theses and Dissertations

The development of distributed applications has not progressed as rapidly as its enabling technologies. In part, this is due to the difficulty of reasoning about such complex systems. In contrast to sequential systems, parallel systems give rise to parallel events, and the resulting uncertainty of the observed order of these events. Loosely coupled distributed systems complicate this even further by introducing the element of multiple imperfect observers of these parallel events. The goal of this dissertation is to advance parallel and distributed systems development by producing a parameterized model that can be instantiated to reflect the computation and coordination properties …

Electroanalysis Using Differential Pulse Methods And Stripping Techniques., Enda Howard

Masters

Application of a differential pulse waveform to a microelectrode or a rotating disk electrode results in a peaked response for amperometric redox reactions. Based on these observations models were proposed and tested for these methods. Simulations of the models were carried out by inputting the relevant equations into Microsoft Excel. The microelectrode study revealed a good correlation between one model and the numerical derivative of the current following a linear sweep potential waveform. Experimentally the derivative can be obtained numerically following a linear sweep. The alternative differential pulse waveform requires more sophisticated equipment and the response can be affected by …

Security In Distributed Systems - A Framework For Different Application Types, Ingo Stengel

Theses

Security is a factor which decides upon the applicability of distributed applications. Therefore this thesis deals with security in distributed systems. The complexity of the existing distributed technologies makes it necessary to reduce the number of distributed technologies considered in this thesis, i.e. concentrating on: Java, Mobile Agents and CORBA, where only Java-based mobile agents will be considered.

After a short review of basic security principles including firewalls, existing security problems in the above mentioned distributed technologies are analysed. Additional generic problems in distributed systems are outlined.

Solutions are referring to two different areas: those regarding security problems with firewalls …

Computational Finance Models, Michael Gene Hilgers

Business and Information Technology Faculty Research & Creative Works

The author discusses his involvement in developing computational finance software. These computational finance models attempt to model the randomness of a stock's price. At a fixed future time, a stock's price is modeled as a random variable with a normal distribution centered about the current price adjusted with a simple growth multiplier. The standard deviation of this normal distribution depends on the length of time into the future one peers and the volatility of the market. As the market becomes more volatile and we look further ahead, the less likely the stock will have a price near the adjusted current …

Fages' Theorem And Answer Set Programming, Yuliya Lierler, Esta Erdem, Vladimir Lifschitz

Computer Science Faculty Proceedings & Presentations

We generalize a theorem by François Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negotiation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as SMODELS and DLV is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelä is discussed as an example.

Supervised Adaptive Resonance Theory And Rules, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Supervised Adaptive Resonance Theory is a family of neural networks that performs incremental supervised learning of recognition categories (pattern classes) and multidimensional maps of both binary and analog patterns. This chapter highlights that the supervised ART architecture is compatible with IF-THEN rule-based symbolic representation. Specifi­cally, the knowledge learned by a supervised ART system can be readily translated into rules for interpretation. Similarly, a priori domain knowl­edge in the form of IF-THEN rules can be converted into a supervised ART architecture. Not only does initializing networks with prior knowl­edge improve predictive accuracy and learning efficiency, the inserted symbolic knowledge can also …

Some Remarks On Fair Exchange Protocol, Jianying Zhou, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Fair exchange turns out to be an increasingly important topic due to the rapid growth of electronic commerce. An exchange is deemed to be fair if at the end of exchange, either each party receives the expected item or neither party receives any useful information about the other’s item. Several protocols for fair exchange have been proposed in recent years. In this paper, we first examine a newly published fair exchange protocol and point out its flaws and weaknesses. We then put forward a more efficient and secure protocol and give an informal analysis.

Persistence Framework For Multiple Legacy Databases Of Patient Information Systems, Chin Heong Khor

Student Works (2000-2009)

The use of object-oriented technologies has led to a gap between object-oriented applications and legacy relational databases. A persistence framework can fill this gap by providing services to convert and store objects in relational databases and other forms of storage. A persistent object lasts beyond the execution of the application and can be retrieved at a later time. This project involves the development of an object persistence framework in the Java language to work with different storage mechanisms. while concentrating on transparency and reusability aspects. The persistence framework is made up of reusable and extendable sets of classes that provide …