Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 22561 - 22590 of 25630

Full-Text Articles in Computer Engineering

Measuring Privacy Loss In Statistical Databases, Vinod Chirayath, Luc Longpre, Vladik Kreinovich Jun 2006

Measuring Privacy Loss In Statistical Databases, Vinod Chirayath, Luc Longpre, Vladik Kreinovich

Departmental Technical Reports (CS)

Protection of privacy in databases has become of increasing importance. While a number of techniques have been proposed to query databases while preserving privacy of individual records in the database, very little is done to define a measure on how much privacy is lost after statistical releases. We suggest a definition based on information theory. Intuitively, the privacy loss is proportional to how much the descriptional complexity of a record decreases relative to the statistical release. There are some problems with this basic definition and we suggest ways to address these problems.


Unimodality, Independence Lead To Np-Hardness Of Interval Probability Problems, Daniel J. Berleant, Olga Kosheleva, Vladik Kreinovich, Hung T. Nguyen Jun 2006

Unimodality, Independence Lead To Np-Hardness Of Interval Probability Problems, Daniel J. Berleant, Olga Kosheleva, Vladik Kreinovich, Hung T. Nguyen

Departmental Technical Reports (CS)

In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events, etc. -- i.e., by characteristics c(p) which are linear in terms of the unknown probabilities pj. If we know interval bounds on some such characteristics ai <= ci(p) <= Ai, and we are interested in a characteristic c(p), then we can find the bounds on c(p) by solving a linear programming problem.

In some situations, we also have additional conditions on the probability distribution -- e.g., we may know that the two variables x1 and x2 are independent, or that the distribution of x1 and x2 is unimodal. We show that adding each of these conditions makes the corresponding interval probability …


How To Measure Loss Of Privacy, Luc Longpre, Vladik Kreinovich Jun 2006

How To Measure Loss Of Privacy, Luc Longpre, Vladik Kreinovich

Departmental Technical Reports (CS)

To compare different schemes for preserving privacy, it is important to be able to gauge loss of privacy. Since loss of privacy means that we gain new information about a person, it seems natural to measure the loss of privacy by the amount of information that we gained. However, this seemingly natural definition is not perfect: when we originally know that a person's salary is between $10,000 and $20,000 and later learn that the salary is between $10,000 and $15,000, we gained exactly as much information (one bit) as when we learn that the salary is an even number -- …


Statistical Data Processing Under Interval Uncertainty: Algorithms And Computational Complexity, Vladik Kreinovich Jun 2006

Statistical Data Processing Under Interval Uncertainty: Algorithms And Computational Complexity, Vladik Kreinovich

Departmental Technical Reports (CS)

No abstract provided.


Sequence Of Linear Programming For Transmission Of Fine-Scalable Coded Content In Bandwidth-Limited Environments, Xiao Su, Tao Wang Jun 2006

Sequence Of Linear Programming For Transmission Of Fine-Scalable Coded Content In Bandwidth-Limited Environments, Xiao Su, Tao Wang

Faculty Publications

In this paper, we propose an optimal peer assignment algorithm on peer-to-peer networks. This algorithm is designed to maximize the quality of transmitting fine-scalable coded content by exploiting the embedding property of scalable coding. To be more realistic, we assume that the requesting peer has a delay constraint to display the content within a certain delay bound, and it also has limited incoming bandwidth. We first use a simple example to illustrate the peer assignment problem, and then formulate this problem as a linear programming problem, followed by a nonlinear programming problem. To efficiently solve the second nonlinear problem, we …


An Experimental Analysis Of The Call Capacity Of Ieee 802.11b Wireless Local Area Networks For Voip Telephony, Brian Keegan, Mark Davis Jun 2006

An Experimental Analysis Of The Call Capacity Of Ieee 802.11b Wireless Local Area Networks For Voip Telephony, Brian Keegan, Mark Davis

Conference papers

In this paper we present the results from an experimental study of the call capacity of an IEEE 802.11b network when using VoIP telephony. Experiments include increasing the number of VoIP users in a wireless test-bed and increasing the level of background traffic until network saturation occurs. The experiments allow us to perform an analysis of the access point (AP) buffer dynamics. Results show that the network is capable of supporting up to 16 VoIP stations (STAs). Due to the operation of the IEEE 802.11 medium access control (MAC) mechanism, the AP acts as a bottleneck for all traffic destined …


Web Services - Based Autonomic Computing Framework (Wsac), Sherif Atef Gurguis Jun 2006

Web Services - Based Autonomic Computing Framework (Wsac), Sherif Atef Gurguis

Archived Theses and Dissertations

No abstract provided.


Automatic Labeling Of Back Channels, Udit Sajjanhar, Nigel Ward Jun 2006

Automatic Labeling Of Back Channels, Udit Sajjanhar, Nigel Ward

Departmental Technical Reports (CS)

In dialog, the proper production of back-channels is an important way for listeners to cooperate with speakers. Developing quantitative models of this process is important both for improving spoken dialog systems and for teaching second language learners. An essential step for the development of such models is labeling all back-channels in corpora of human-human dialogs. Currently this is done by hand. This report describes a method for automatically identifying back-channels in conversation corpora, using only the patterns of speech and silence by the speaker and the listener in the local context. Tested on Arabic, Spanish, and English, this method identifies …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 8, June 2006, College Of Engineering And Computer Science, Wright State University Jun 2006

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 8, June 2006, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Adaptive Interpolation Algorithms For Temporal-Oriented Datasets, Jun Gao Jun 2006

Adaptive Interpolation Algorithms For Temporal-Oriented Datasets, Jun Gao

School of Computing: Dissertations, Theses, and Student Research

Spatiotemporal datasets can be classified into two categories: temporal-oriented and spatial-oriented datasets depending on whether missing spatiotemporal values are closer to the values of its temporal or spatial neighbors. We present an adaptive spatiotemporal interpolation model that can estimate the missing values in both categories of spatiotemporal datasets. The key parameters of the adaptive spatiotemporal interpolation model can be adjusted based on experience.


Lock-Based Cache Coherence Protocol For Chip Multiprocessors, Ihab Ismail Jun 2006

Lock-Based Cache Coherence Protocol For Chip Multiprocessors, Ihab Ismail

Archived Theses and Dissertations

Chip multiprocessor (CMP) is replacing the superscalar processor due to its huge performance gains in terms of processor speed, scalability, power consumption and economical design. Since the CMP consists of multiple processor cores on a single chip usually with share cache resources, process synchronization is an important issue that needs to be dealt with. Synchronization is usually done by the operating system in case of shared memory multiprocessors (SMP). This work studies the effect of performing synchronization by the hardware through its integration with the cache coherence protocol. A novel cache coherence protocol, called Lock-based Cache Coherence Protocol (LCCP) was …


A Three Core Type Heterogeneous Chip Multiprocessor: Towards An Optimized Cmp Architecture, Ali Yehia Ali Jun 2006

A Three Core Type Heterogeneous Chip Multiprocessor: Towards An Optimized Cmp Architecture, Ali Yehia Ali

Archived Theses and Dissertations

No abstract provided.


Statistical Models Of Reconstructed Phase Spaces For Signal Classification, Richard J. Povinelli, Michael T. Johnson, Andrew C. Lindgren, Felice M. Roberts, Jinjin Ye Jun 2006

Statistical Models Of Reconstructed Phase Spaces For Signal Classification, Richard J. Povinelli, Michael T. Johnson, Andrew C. Lindgren, Felice M. Roberts, Jinjin Ye

Electrical and Computer Engineering Faculty Research and Publications

This paper introduces a novel approach to the analysis and classification of time series signals using statistical models of reconstructed phase spaces. With sufficient dimension, such reconstructed phase spaces are, with probability one, guaranteed to be topologically equivalent to the state dynamics of the generating system, and, therefore, may contain information that is absent in analysis and classification methods rooted in linear assumptions. Parametric and nonparametric distributions are introduced as statistical representations over the multidimensional reconstructed phase space, with classification accomplished through methods such as Bayes maximum likelihood and artificial neural networks (ANNs). The technique is demonstrated on heart arrhythmia …


Location Estimation In A 3d Environment Using Radio Frequency Identification Tags, Adwitiya Akash Jain May 2006

Location Estimation In A 3d Environment Using Radio Frequency Identification Tags, Adwitiya Akash Jain

Theses

RFID tag location estimation in a 3D environment is investigated. The location of the tag with unknown coordinates can be estimated with certain accuracy. However, accuracy can be improved using the knowledge based on measurement of additional reference tags with known location. This thesis studies the mathematical formulation and practical realization of location sensing using RFID tags.

Deviating from the standard use of RFID technology which employs one tag reader to identify the presence of tag, here multiple tag readers with known location are used to estimate the physical location of an individual tag, with/without the help of few reference …


Classification, Testing And Optimization Of Intrusion Detection Systems, Javier Leon May 2006

Classification, Testing And Optimization Of Intrusion Detection Systems, Javier Leon

Theses

Modem network security products vary greatly in their underlying technology and architecture. Since the introduction of intrusion detection decades ago, intrusion detection technologies have continued to evolve rapidly. This rapid change has led to the introduction of a wealth of security devices, technologies and algorithms that perform functions originally associated with intrusion detection systems.

This thesis offers an analysis of intrusion detection technologies, proposing a new classification system for intrusion detection systems. Working closely with the development of a new intrusion detection product, this thesis introduces a method of testing related technologies in a production environment by outlining and executing …


New Hybrid Automatic Repeat Request (Harq) Scheme For 4x4 Mimo System, Based On The Extended Alamouti Quasi-Orthogonal Space-Time Bloc Coding (Q-Stbc), In Invariant And Variant Fading Channel, Jordi Ferrer Torras May 2006

New Hybrid Automatic Repeat Request (Harq) Scheme For 4x4 Mimo System, Based On The Extended Alamouti Quasi-Orthogonal Space-Time Bloc Coding (Q-Stbc), In Invariant And Variant Fading Channel, Jordi Ferrer Torras

Theses

A new Hybrid Automatic Repeat reQuest (HARQ) combining scheme for a 4x4 Multiple Input Multiple Output (MIMO) system in invariant and variant fading channel conditions is proposed and analized. Based on the Extended Alamouti Quasi-orthogonal Space-Time Block Coding (Q-STBC), the use of the so-called Alternative Matrices for transmission, depending on the Channel State Information (CSI) received as feedback, is compared to other existing solutions.

Sign changes and permutations in the retransmission sequences allow reducing the interference while exploiting the spatial diversity to introduce some gain in the signal power. The best transmission order is selected by the Determinant Criterion, which …


Microswitches With Sputtered Au, Aupd,Au-On-Aupt, And Auptcu Alloy Electric Contacts, Ronald A. Coutu Jr., J. R. Reid, R. Cortez, R. E. Strawser, P. E. Kladitis May 2006

Microswitches With Sputtered Au, Aupd,Au-On-Aupt, And Auptcu Alloy Electric Contacts, Ronald A. Coutu Jr., J. R. Reid, R. Cortez, R. E. Strawser, P. E. Kladitis

Electrical and Computer Engineering Faculty Research and Publications

This paper is the first to report on a new analytic model for predicting microcontact resistance and the design, fabrication, and testing of microelectromechanical systems (MEMS) metal contact switches with sputtered bimetallic (i.e., gold (Au)-on-Au-platinum (Pt), (Au-on-Au-(6.3at%)Pt)), binary alloy (i.e., Au-palladium (Pd), (Au-(3.7at%)Pd)), and ternary alloy (i.e., Au-Pt-copper (Cu), (Au-(5.0at%)Pt-(0.5at%)Cu)) electric contacts. The microswitches with bimetallic and binary alloy contacts resulted in contact resistance values between 1-2Omega. Preliminary reliability testing indicates a 3times increase in switching lifetime when compared to microswitches with sputtered Au electric contacts. The ternary alloy exhibited approximately a 6times increase in switch lifetime with contact resistance …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 7, May 2006, College Of Engineering And Computer Science, Wright State University May 2006

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 7, May 2006, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Combining Multiple Scoring Systems For Video Target Tracking Based On Rank-Score Function Variation, D. Frank Hsu, Damian M. Lyons, Jizhou Ai May 2006

Combining Multiple Scoring Systems For Video Target Tracking Based On Rank-Score Function Variation, D. Frank Hsu, Damian M. Lyons, Jizhou Ai

Faculty Publications

Tracking of video targets is the process of estimating the current and predicting the future state of a target from a sequence of video sensor measurements. Multitarget video tracking is complicated by the fact that targets can occlude one another and affect video feature measurements in a highly non-linear and difficult to model fashion., Tracking multiple targets that undergo repeated mutual occlusions is a challenging problem with several issues to be addressed. In this paper we propose a multisensory fusion approach to the problem of multitarget video tracking with occlusion. Each sensory cue is treated as a scoring system on …


Economics Of Engineering Design Under Interval (And Fuzzy) Uncertainty: Case Study Of Building Design, Carlos M. Ferregut, Jan Beck, Araceli Sanchez, Vladik Kreinovich May 2006

Economics Of Engineering Design Under Interval (And Fuzzy) Uncertainty: Case Study Of Building Design, Carlos M. Ferregut, Jan Beck, Araceli Sanchez, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the main objectives of engineering design is to find a design that is the cheapest among all designs that satisfy given constraints. Most of the constraints must be satisfied under all possible values within certain ranges. Checking all possible combinations of values is often very time-consuming. In this paper, we propose a faster algorithm for checking such constraints.


Growth Rates Under Interval Uncertainty, Janos Hajagos, Vladik Kreinovich May 2006

Growth Rates Under Interval Uncertainty, Janos Hajagos, Vladik Kreinovich

Departmental Technical Reports (CS)

For many real-life systems ranging from financial to population-related to medical, dynamics is described by a system of linear equations. For such systems, the growth rate lambda can be determined as the largest eigenvalue of the corresponding matrix A. In many practical situations, we only know the components of the matrix A with interval (or fuzzy) uncertainty. In such situations, it is desirable to find the range of possible values of lambda. In this paper, we propose an efficient algorithm for computing lambda for a practically important case when all the components of the matrix A are non-negative.


Interval And Fuzzy Techniques In Business-Related Computer Security: Intrusion Detection, Privacy Protection, Mohsen Beheshti, Jianchao Han, Luc Longpre, Scott A. Starks, J. Ivan Vargas, Gang Xiang May 2006

Interval And Fuzzy Techniques In Business-Related Computer Security: Intrusion Detection, Privacy Protection, Mohsen Beheshti, Jianchao Han, Luc Longpre, Scott A. Starks, J. Ivan Vargas, Gang Xiang

Departmental Technical Reports (CS)

E-commerce plays an increasingly large role in business. As a result, business-related computer security becomes more and more important. In this talk, we describe how interval and fuzzy techniques can help in solving related computer security problems.


Bilinear Models From System Approach Justified For Classification, With Potential Applications To Bioinformatics, Richard Aló, Francois Modave, Vladik Kreinovich, David Herrera, Xiaojing Wang May 2006

Bilinear Models From System Approach Justified For Classification, With Potential Applications To Bioinformatics, Richard Aló, Francois Modave, Vladik Kreinovich, David Herrera, Xiaojing Wang

Departmental Technical Reports (CS)

When we do not know the dynamics of a complex system, it is natural to use common sense to get a reasonable first approximation -- which turns out to be a bilinear dynamics. Surprisingly, for classification problems, a similar bilinear approximation turns out to be unexpectedly accurate. In this paper, we provide an explanation for this accuracy.


Helping Students To Become Researchers: What We Can Gain From Russian Experience, Vladik Kreinovich, Ann Q. Gates, Olga Kosheleva May 2006

Helping Students To Become Researchers: What We Can Gain From Russian Experience, Vladik Kreinovich, Ann Q. Gates, Olga Kosheleva

Departmental Technical Reports (CS)

The fact that many internationally renowned scientists have been educated in the former Soviet Union shows that many features of its education system were good. In this session, we briefly describe the features that we believe to have been good. Some of these features have already been successfully implemented (with appropriate adjustments) in affinity research groups at the Department of Computer Science of the The University of Texas at El Paso (UTEP).


End-To-End Latency Of A Fault-Tolerant Corba Infrastructure, Wenbing Zhao, Louise E. Moser, P. Michale Melliar-Smith May 2006

End-To-End Latency Of A Fault-Tolerant Corba Infrastructure, Wenbing Zhao, Louise E. Moser, P. Michale Melliar-Smith

Electrical and Computer Engineering Faculty Publications

This paper presents an evaluation of the end-to-end latency of a fault-tolerant CORBA infrastructure that we have implemented. The fault-tolerant infrastructure replicates the server applications using active, passive and semi-active replication, and maintains strong replica consistency of the server replicas. By analyses and by measurements of the running fault-tolerant infrastructure, we characterize the end-to-end latency under fault-free conditions. The main determining factor of the run-time performance of the fault-tolerant infrastructure is the Totem group communication protocol, which contributes to the end-to-end latency primarily in …


Mobile Messaging In The Pacific Rim, Thomas Asmuth May 2006

Mobile Messaging In The Pacific Rim, Thomas Asmuth

SWITCH

This article explores the growth of mobile messaging across the Pacific Rim, focusing on how cultural, economic, and infrastructural factors shape its use.


Paper Session V: Steganography And Terrorist Communications - Current Information And Trends - Tools, Analysis And Future Directions In Steganalysis In Context With Terrorists And Other Criminals, William Eyre, Marcus Rogers Apr 2006

Paper Session V: Steganography And Terrorist Communications - Current Information And Trends - Tools, Analysis And Future Directions In Steganalysis In Context With Terrorists And Other Criminals, William Eyre, Marcus Rogers

Annual ADFSL Conference on Digital Forensics, Security and Law

In ancient times, users communicated using steganography, “…derived from the Greek words steganos, meaning ‘covered’, and graphein, meaning ‘to write.’” (Singh, 1999, p.5) Steganography facilitates secret, undetected communication. In modern times, in the context of the Global War on Terror, national intelligence and law enforcement agencies need tools to detect hidden information (steganography) in various types of media, most specifically to uncover the placement of hidden information in images. This paper will look at steganography in general terms, presenting the theory of some common steganographic techniques and touching on some theoretical work in steganography. Then a discussion of how to …


Paper Session V: Forensic Software Tools For Cell Phone Subscriber Identity Modules, Wayne Jansen, Rick Ayers Apr 2006

Paper Session V: Forensic Software Tools For Cell Phone Subscriber Identity Modules, Wayne Jansen, Rick Ayers

Annual ADFSL Conference on Digital Forensics, Security and Law

Cell phones and other handheld devices incorporating cell phone capabilities (e.g., smart phones) are ubiquitous. Besides placing calls, cell phones allow users to perform other tasks such as text messaging and phonebook entry management. When cell phones and cellular devices are involved in a crime or other incident, forensic specialists require tools that allow the proper retrieval and speedy examination of data present on the device. For devices conforming to the Global System for Mobile Communications (GSM) standards, certain data such as dialed numbers, text messages, and phonebook entries are maintained on a Subscriber Identity Module (SIM). This paper gives …


Paper Session Iv: Development And Delivery Of Coursework - The Legal/Regulatory/Policy Environment Of Cyberforensics, John W. Bagby, John C. Ruhnka Apr 2006

Paper Session Iv: Development And Delivery Of Coursework - The Legal/Regulatory/Policy Environment Of Cyberforensics, John W. Bagby, John C. Ruhnka

Annual ADFSL Conference on Digital Forensics, Security and Law

This paper describes a cyber-forensics course that integrates important public policy and legal issues as well as relevant forensic techniques. Cyber-forensics refers to the amalgam of multi-disciplinary activities involved in the identification, gathering, handling, custody, use and security of electronic files and records, involving expertise from the forensic domain, and which produces evidence useful in the proof of facts for both commercial and legal activities. The legal and regulatory environment in which electronic discovery takes place is of critical importance to cyber-forensics experts because the legal process imposes both constraints and opportunities for the effective use of evidence gathered through …


Paper Session Iv: Toward Understanding Digital Forensics As A Profession: Defining Curricular Needs (***Research In Process ***), Michelle Wolf, Alan Shafer, Michael Gendron Apr 2006

Paper Session Iv: Toward Understanding Digital Forensics As A Profession: Defining Curricular Needs (***Research In Process ***), Michelle Wolf, Alan Shafer, Michael Gendron

Annual ADFSL Conference on Digital Forensics, Security and Law

This research paper presents research in process which attempts to define the common body of knowledge (CBK) of digital forensics. Digital forensics is not well defined not does it have a generally accepted CBK. The first three phases of completed research, in a four-phase research process are discussed. The early results have created a preliminary CBK, and final validation is underway.