Digital Commons Network^™

Search And Tracking Algorithms For Rapidly Moving Mobiles, Amy L. Murphy, Gruia-Catalin Roman, George Varghese

All Computer Science and Engineering Research

With the advent of wireless technology and laptops, mobility is an important area of research. A fundamental problem in this area is the delivery of messages to a moving mobile. Current solutions work correctly only for slowly moving nodes that stay in one location long enough for tracking to stabilize. In this paper we consider the problem of message delivery to rapidly moving mobile units. With these algorithms, we introduce a new method for designing algorithms based on the paradigm of considering a mobile unit as a message, and adapting traditional message passing algorithms to mobility. Our first algorithm is …

Modeling Mobile Ip In Mobile Unity, Peter J. Mccann, Gruia-Catalin Roman

All Computer Science and Engineering Research

With recent advances in wireless communication technology, mobile computing is an increasingly important area of research. A mobile system is one where independently executing components may migrate through some space during the course of the computation, and where the pattern of connectivity among the components changes as they move in and out of proximity. Mobile UNITY is a notation and proof logic for specifying and reasoning about mobile systems. In this paper it is argued that Mobile UNITY contributes to the modular development of system specifications because of the declarative fashion in which coordination among components is specified. The packet …

Specification-Driven Optimization, Sheena Day

Dissertations and Theses

Traditionally, optimizing transformations have been built into compilers. The end-user has little or no control over guiding any optimizations that may be applied by the compiler. Moreover, the compiler-writer does not have a simple way to direct the optimizations. Thus, many potentially beneficial opportunities for code optimization may be lost. We have built a system that allows the user to participate in guiding source-to-source transformations via the specification of rewrite rules. A clean separation of the rules from the strategy of applying them makes the system easier to use and modify, compared to other integrated systems. This is especially relevant …

Interactive Gradebook: The Missing (Hyper)Link, Doug Blank, George Holmes, Ryan Wells, Pawel Wolinksi

Computer Science Faculty Research and Scholarship

This paper introduces the notion of the "interactive gradebook," a new niche where intelligent and interactive technologies can help educators teach and students learn.

Functional Radionuclide Imaging Algorithm Based On The Appended Curve Deconvolution Technique And Its Use In The Diagnosis Of Renovascular Hypertension, İrfan Karagöz, Hi̇kmet Bayhan

Turkish Journal of Electrical Engineering and Computer Sciences

In this study, a new method called the pixel basis functional radionuclide imaging (PBFRI) algorithm based on the appended curve deconvolution technique, in order to be able to increase the medical diagnostic capability of a conventional gamma camera, is presented together with the clinical results. In the PBFRI method, retention function of each pixel is obtained from the renograms and cardiac curves generated by processing the filtered segments of the kidney and heart, using a special deconvolution method. The deconvolution operation is done by using the Fourier transform technique. High frequency artifacts presented by the Fourier transform are removed by …

Contributions To Supervised Learning Of Real-Valued Functions Using Neural Networks, Victor David Sanchez Aylas

CCAC Theses and Dissertations

This dissertation presents a new strategy for the automatic design of neural networks. The learning environment addressed is supervised learning from examples. Specifically, Radial Basis Functions (RBF) networks learning real-valued functions of real vectors as in non-linear regression applications are considered. The strategy is based upon the application of strong theoretical relationships between RBF networks and methods from approximation theory, robust statistics, and computational learning theory.

The complexity of the network design is examined in detail from the formal definition of the learning problem to the establishment of the corresponding optimization problem. A novel strategy for the systematic and automatic …

Imaging Electrical Current Density Using Nuclear Magnetic Resonance, B. Murat Eyüpoğlu, Ravinder Reddy, John S. Leigh

Turkish Journal of Electrical Engineering and Computer Sciences

In this study, images of nonuniform and uniform electric current density in conductor phantoms, which contain magnetic resonance active nuclei, are produced using Magnetic Resonance Imaging (MRI). A standard spin echo pulse sequence is used, with the addition of a bipolar current pulse. The flux density parallel to the main magnetic field, generated by the current pulse, is encoded in the phase of the complex MR image. The spatial distribution of magnetic flux density is extracted from the phase image. Current density is calculated using the magnetic flux density. This fairly recent technique is known as Magnetic Resonance Current Density …

Use Of The Magnetic Field Generated By The Internal Distribution Of Injected Currents For Electrical Impedance Tomography (Mr-Eit), Y. Zi̇ya İder, Özlem Bi̇rgül

Turkish Journal of Electrical Engineering and Computer Sciences

In two dimensional conventional Electrical Impedance Tomography (EIT), volume conductor is probed by means of injected currents, and peripheral voltage measurements are used as input to the reconstruction algorithm. The current that flows in the 2D object creates magnetic fields that are perpendicular to the plane of imaging. Such magnetic fields can be measured using magnetic resonance tomography. In this study, use of this magnetic field generated by the injected currents, for the purpose of reconstructing the conductivity distribution, is studied. Sensitivity matrix relating the magnetic field to the element conductivities is calculated using the Finite Element Method and Biot-Savart …

Measurement Of The Axial-Vector Τ Spectral Functions And Determination Of Αs (M2Τ) From Hadronic Τ Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

An analysis based on 124 000 selected ττ pairs recorded by the ALEPH detector at LEP provides the vector (V)(V) and axial-vector (A)(A) spectral functions of hadronic ττ decays together with their total widths. This allows the evaluation of finite energy chiral sum rules that are weighted integrals over the (V−A)(V−A) spectral functions. In addition, a precise measurement of αsαs along with a determination of nonperturbative contributions at the ττ mass scale is performed. The experimentally and theoretically most robust determination of αs(M2τ)αs(Mτ2) is obtained from the (V+A)(V+A) fit that yields αs(M2τ)=0.334±0.022αs(Mτ2)=0.334±0.022 giving αs(M2Z)=0.1202±0.0027αs(MZ2)=0.1202±0.0027 after the extrapolation to the mass …

Search For Evidence Of Compositeness At Lep I, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

Extensive searches for evidence of compositeness of quarks and leptons have been made in the complete set of ALEPH data from LEP running at the Z peak. These include searches for radiative and weak decays of excited fermions, produced either in pairs or singly, and a scalar partner of the Z. Coupling and branching ratio limits deduced from these searches are presented.

A Global Communication Optimization Technique Based On Data-Flow Analysis And Linear Algebra, Mahmut Kandemir, P. Banerjee, Alok Choudhary, J. Ramanujam

Electrical Engineering and Computer Science - All Scholarship

Reducing communication overhead is extremely important in distributed-memory message-passing architectures. In this paper, we present a technique to improve communication that considers data access patterns of the entire program. Our approach is based on a combination of traditional data-flow analysis and a linear algebra framework, and works on structured programs with conditional statements and nested loops but without arbitrary goto statements. The distinctive features of the solution are the accuracy in keeping communication set information, support for general alignments and distributions including block-cyclic distributions and the ability to simulate some of the previous approaches with suitable modifications. We also show …

Steady State Memetic Algorithm For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

Shape matching techniques are important in machine intelligence, especially in applications such as robotics. Currently, there are three major approaches to shape recognition: statistical, syntactic and neural approaches. This paper presents a fourth approach: evolutionary algorithms. A steady state memetic algorithm is shown to be successful in matching shapes even when they are partially obscured, and even in the presence of noise in the input image.

Integrating Security Into The Curriculum, Cynthia E. Irvine, Shiu-Kai Chin, Deborah Frincke

Electrical Engineering and Computer Science - All Scholarship

The number of skilled practitioners of computer security who are able to address the complexities of modern technology and are familiar with successful approaches to system security is very small. People want security but are faced with two difficulties. First, they do not know how to achieve it in the context of their enterprises. They may not even know of a way to translate organizational procedures into policies, much less implement a set of mechanisms to enforce those policies. Second, they have no way of knowing whether their chosen mechanisms are effective. The recent US Presidential Commission on Critical Infrastructure …

Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts

Electrical Engineering and Computer Science - All Scholarship

This paper demonstrates the use of automatic granularity control as part of dynamic load balancing for irregular, particle-based simulations. Performance optimization techniques are considered in the context of a concurrent Direct Simulation Monte Carlo method used to study the rarefied gas flow inside three-dimensional plasma reactors. Several computational techniques are used to reduce the overall time to deliver realistic threedimensional results. The effectiveness of dynamic load balancing and granularity control are presented for large-scale simulations on distributed-memory multicomputers.

Signal Injection With Perceptual Criteria, T. Engi̇n Tuncer

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, a novel method for increasing the coding performance and information transmission capacity is presented. This method is mainly based on perceptual modelling of input signal such as speech or audio. Presented approach may be seen as an alternative to transforms which dynamically change analysis window for better energy compaction. A perceptual model is established in order to obtain a global masking threshold in frequency below which sounds become inaudible. Certain criteria are developed for identifying the signal injection bands. A new multiband filter design method which is a generalization of windowing method is used to separate the …

State Of Art In Realistic Head Modeling For Electro-Magnetic Source Imaging Of The Human Brain, Nevzat G. Gençer, İ. Oğuz Tanzer, M. Kemal Özdemi̇r, Can E. Acar, Mert Sungur

Turkish Journal of Electrical Engineering and Computer Sciences

Electric currents produced by the neural activity in the brain create electric potentials on the scalp and magnetic field distribution outside the scalp. Measuring electric and magnetic fields provides a means to understand the spatio-temporal distribution of the neural activity. The representations of the intracellular electric current of active cell populations based on bimodal data are called electro-magnetic source image (EMSI). With the recent development of large arrays of magnetic sensors, and systems for measuring scalp voltages at more than 100 locations, it is now feasible to implement computational methods that employ numerical models which incorporate the correct geometry and …

Object-Oriented Programming And Parallelism, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Initially, object-orientation and parallelism originated and developed as separate and relatively independent areas. During the last decade, however, more and more researchers were attracted by the benefits from a potential marriage of the two powerful paradigms. Numerous research projects and an increasing number of practical applications were aimed at different forms of amalgamation of parallelism with object-orientation. It has been realized that parallelism is a inherently needed enhancement for the traditional object-oriented programming (OOP) paradigm, and that object orientation can add significant flexibility to the parallel programming paradigm.

Searches For Charginos And Neutralinos In E+E- Collisions At √S = 161 And 172 Gev, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

The data recorded by the ALEPH detector at centre-of-mass energies of 161, 170, and 172 GeV are analysed for signals of chargino and neutralino production. No evidence of a signal is found, although candidate events consistent with the expectations from Standard Model processes are observed. Limits at 95% C.L. on the production cross sections are derived and bounds on the parameters of the Minimal Supersymmetric Standard Model are set. The lower limit on the mass of the lightest ch is 85.5 GeV/c2GeV/c2 for gaugino-like charginos (μ=−500GeV/c2μ=−500GeV/c2), and 85.0 GeV/c2GeV/c2 for Higgsino-like charginos (M2=500GeV/c2M2=500GeV/c2), for heavy sneutrinos (Mν~≥200GeV/c2Mν~≥200GeV/c2) and tanβ=2–√tan⁡β=2. The …

Study Of B0s Oscillations And Lifetime Using Fully Reconstructed D̄S Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A search for B0sBs0 oscillations is performed using approximately 4 million Z→qq¯Z→qq¯ events collected by the ALEPH experiment during 1991–1995. B0sBs0 candidates are partially reconstructed by combining tracks with fully reconstructed D−sDs− candidates. The B0sBs0 production flavour is estimated from the sign of the opposite hemisphere charge, a fragmentation kaon in the same hemisphere, or a lepton in the opposite hemisphere. From a total sample of 1620 candidates, with a B0sBs0 purity estimated to be 22%, all values of ΔmsΔms below 3.9 ps−1−1 and between 6.5 and 8.8 ps−1−1 are excluded at 95% CL. From the same sample, the B0sBs0 …

Percentile Blobs For Image Similarity, Nicholas Howe

Computer Science: Faculty Publications

We present a new algorithm called PBSIM for computing image similarity, based upon a novel method of extracting bloblike features from images. In tests on a classification task using a data set of over 1000 images, PBSIM shows significantly higher accuracy than algorithms based upon color histograms, as well as previously reported results for another approach based upon bloblike features.

Evaluating Information Modeling Methods – A Review, Keng Siau, M. Rossi

Research Collection School Of Computing and Information Systems

Hundreds of modeling methods are in existence today, yet practitioners and researchers are zealously “producing” new modeling methods. The “blooming” of modeling methods is not the problem; the lack of standardized techniques for evaluating them is. To further complicate the matter, most of the modeling methods are introduced based on common sense and intuition. Theoretical foundations and empirical evidence are severely lacking. With the current state of affairs, evaluation of modeling methods has become necessary. Comparing modeling methods provides us with the necessary knowledge and understanding on the strengths and weaknesses of each method. This knowledge can also guide us …

Aegis Data Analysis And Reduction (Adar) In Support Of The Aegis Weapon System (Aws), June Bullard Gaines

Theses and Dissertations

The AEGIS Weapons System (AWS), part of the AEGIS Combat System (ACS), is an integral part of the defense system on U.S. Navy AEGIS-class ships. AEGIS Data Analysis and Reduction (ADAR) has been developed to assist in the evaluation of the AWS data. ADAR, along with the AWS and ACS, has evolved through the years to accommodate advances in technology and computer programming languages. Additionally, ADAR has evolved so that users located at sites other than the Naval Surface Warfare System Dahlgren Division (NSWCDD), Dahlgren, Virginia, can reduce tactical system data and perform data analysis using the reduced data.

This …

Java Grande Forum Report: Making Java Work For High-End Computing, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This document describes the Java Grande Forum and includes its initial deliverables.Theseare reports that convey a succinct set of recommendations from this forum to SunMicrosystems and other purveyors of Java™ technology that will enable GrandeApplications to be developed with the Java programming language.

Segmentation Of Printed Circuit Board Images Into Basic Patterns, Madhav Moganti, Fikret Ercal

Computer Science Faculty Research & Creative Works

Segmentation is the first and foremost step in the inspection of the printed circuit boards. In this paper a new technique for the segmentation of printed circuit board (PCB) images is presented. The technique basically segments a given PCB into small windows containing primitive PCB subpatterns. The technique proposed exploits the simplicity and the homogeneity of the PCB images and is inherently parallel. A detailed discussion of the experiments and the results obtained is also presented. © 1993 Academic Press.

A Hierarchical Filtering-Based Monitoring Architecture For Large-Scale Distributed Systems, Ehab Salem Al-Shaer

Computer Science Theses & Dissertations

On-line monitoring is essential for observing and improving the reliability and performance of large-scale distributed (LSD) systems. In an LSD environment, large numbers of events are generated by system components during their execution and interaction with external objects (e.g. users or processes). These events must be monitored to accurately determine the run-time behavior of an LSD system and to obtain status information that is required for debugging and steering applications. However, the manner in which events are generated in an LSD system is complex and represents a number of challenges for an on-line monitoring system. Correlated events axe generated concurrently …

A Transaction Model For Mobile Computing, Sanjay Kumar Madria, Bharat Bhargava

Computer Science Faculty Research & Creative Works

We introduce a prewrite operation before a write operation in a mobile transaction to improve data availability. A prewrite operation does not update the state of a data object but only makes visible the value that the data object will have after the commit of the transaction. Once the transaction has read all the values and declares all the prewrites, it can precommit at a mobile host. The remaining transaction's execution is shifted to the stationary host. Writes on a database consume both time and resources at the stationary host and are therefore delayed. A pre-committed transaction's prewrite values are …

Systolic Algorithm For Processing Rle Images, Hao Feng, Fikret Erçal, Filiz Bunyak

Computer Science Faculty Research & Creative Works

Image difference operation is commonly used in on-line automated printed circuit board (PCB) inspection systems as well as many other image processing applications. In this paper, we describe a new systolic algorithm and its system architecture which computes image differences in run-length encoded (RLE) format. The efficiency of this operation greatly affects the overall performance of the inspection system. It is shown that, for images with a high similarity measure, the time complexity of the systolic algorithm is a small constant. A formal proof of correctness for the algorithm is also given in the paper.

Database Security: Evaluation Of A Multi-Policy Access Control Model, Fei Dong

Dissertations and Theses @ UNI

As an increasing number of organizations become dependent on access to their data stored in the database, the need for adequate security measures is becoming more and more critical. Enforcing data protection means safeguarding data from unauthorized or improper disclosures or modifications. Access control policies should be independent of the mechanisms that will implement the physical control of access: this allows control mechanism to be available for different policies. Although considerable work was done on access control models and related mechanisms for databases (Castano & Fugini, 1994), current access control models and mechanisms are not flexible enough to meet the …

On The Structure Of Graphs With Few P4s, Luitpold Babel, Stephan Olariu

Computer Science Faculty Publications

We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing — in some local sense — only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the internal nodes correspond to three types of graph operations, while the leaves are basic graphs with a simple structure. The paper extends and generalizes known results about cographs, P₄-reducible graphs, and P₄-sparse graphs.

Buckets: Aggregative, Intelligent Agents For Publishing, Michael L. Nelson, Kurt Maly, Stewart N. T. Shen, Mohammad Zubair

Computer Science Faculty Publications

Buckets are an aggregative, intelligent construct for publishing in digital libraries. The goal of research projects is to produce information. This information is often instantiated in several forms, differentiated by semantic types (report, software, video, datasets, etc.). A given semantic type can be further differentiated by syntactic representations as well (PostScript version, PDF version, Word version, etc.). Although the information was created together and subtle relationships can exist between them, different semantic instantiations are generally segregated along currently obsolete media boundaries. Reports are placed in report archives, software might go into a software archive, but most of the data and …