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

Engineering Commons™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 21031 - 21060 of 25663

Full-Text Articles in Engineering

Virtual Wired Transmission Scheme - A Novel Technique For Efficient Mobile Adhoc Networks, Manikya Vinay Rali Jul 2009

Virtual Wired Transmission Scheme - A Novel Technique For Efficient Mobile Adhoc Networks, Manikya Vinay Rali

Electrical & Computer Engineering Theses & Dissertations

This thesis proposes a method called virtual wired transmission scheme for ad hoc networks. The scheme is an efficient method to improve network performance parameters such as energy efficiency, capacity, interference, network throughput, etc. Performance parameters improvement can be done at different layers of the network architecture for mobile ad hoc networks. However most of the research efforts are concentrated on Physical, MAC and Network layers. In this thesis, a MAC protocol with a major MAC layer modification is proposed in combination with the usage of directional antennas, developing a novel method called virtual wired transmission scheme. In virtual wired …


A Wireless Sensor Data Fusion Framework For Contaminant Detection, Joshua Kiepert Jul 2009

A Wireless Sensor Data Fusion Framework For Contaminant Detection, Joshua Kiepert

Boise State University Theses and Dissertations

In the search for more effective instruments to collect data for the identification of threats to security, health, and safety, new tools must be designed to meet the challenges of a diverse set of possible applications. The extensive range of potential applications raises the need for a general purpose system capable of addressing a wide variety of deployment environments. This thesis focuses on a wireless sensor network framework for collecting environmental data in an effort to develop a sensing solution that fits within many design spaces. The framework includes reconfigurable wireless sensor node hardware, firmware, and software for interfacing sensor …


Exploring Inter-Concept Relationship With Context Space For Semantic Video Indexing, Xiao-Yong Wei, Yu-Gang Jiang, Chong-Wah Ngo Jul 2009

Exploring Inter-Concept Relationship With Context Space For Semantic Video Indexing, Xiao-Yong Wei, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Semantic concept detectors are often individually and independently developed. Using peripherally related concepts for leveraging the power of joint detection, which is referred to as context-based concept fusion (CBCF), has been one of the focus studies in recent years. This paper proposes the construction of a context space and the exploration of the space for CBCF. Context space considers the global consistency of concept relationship, addresses the problem of missing annotation, and is extensible for cross-domain contextual fusion. The space is linear and can be built by modeling the inter-concept relationship through annotation provided by either manual labeling or machine …


Learning And Inferencing In User Ontology For Personalized Semantic Web Search, Xing Jiang, Ah-Hwee Tan Jul 2009

Learning And Inferencing In User Ontology For Personalized Semantic Web Search, Xing Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

User modeling is aimed at capturing the users’ interests in a working domain, which forms the basis of providing personalized information services. In this paper, we present an ontology based user model, called user ontology, for providing personalized information service in the Semantic Web. Different from the existing approaches that only use concepts and taxonomic relations for user modeling, the proposed user ontology model utilizes concepts, taxonomic relations, and non-taxonomic relations in a given domain ontology to capture the users’ interests. As a customized view of the domain ontology, a user ontology provides a richer and more precise representation of …


Radial Ebg Cell Layout For Gps Patch Antennas, Giuseppe Ruvio, Max Ammann, Xiulong Bao Jun 2009

Radial Ebg Cell Layout For Gps Patch Antennas, Giuseppe Ruvio, Max Ammann, Xiulong Bao

Articles

A novel radial layout for mushroom-like electromagnetic-bandgap (EBG) cells surrounding a printed circularly-polarised patch antenna is proposed. Two radial EBG configurations surrounding a circular patch are compared to a reference patch on a conventional ground plane of the same dimension. The radial shape and displacement of the EBG cells around the patch offers improvements in terms of gain and axial-ratio compared to the reference antenna and is more suitable for circular geometries compared to conventional Cartesian layouts. In particular, the distance between the patch and the surrounding EBG cells is independent of the cell period, which can be arbitrarily chosen, …


Using Timed-Release Cryptography To Mitigate The Preservation Risk Of Embargo Periods, Rabia Haq, Michael L. Nelson Jun 2009

Using Timed-Release Cryptography To Mitigate The Preservation Risk Of Embargo Periods, Rabia Haq, Michael L. Nelson

Computer Science Presentations

PDF of a powerpoint presentation from the 2009 ACM/IEEE Joint Conference on Digital Libraries, Austin, Texas, June 15-19, 2009. Also available on Slideshare.


Probabilistic Interpretation Of Fuzzy Transforms And Fuzzy Control, Irina Perfilieva, Vladik Kreinovich Jun 2009

Probabilistic Interpretation Of Fuzzy Transforms And Fuzzy Control, Irina Perfilieva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical applications, it turns out to be useful to use the notion of fuzzy transform: once we have non-negative functions A1(x), ..., An(x), with A1(x) + ... + An(x) = 1, we can then represent each function f(x) by the coefficients Fi which are defined as the ratio of two integrals: of f(x) * Ai(x) and of Ai(x). Once we know the coefficients Fi, we can (approximately) reconstruct the original function f(x) as F1 * A1(x) + ... + F …


Engineering Design Under Imprecise Probabilities: Computational Complexity, Vladik Kreinovich Jun 2009

Engineering Design Under Imprecise Probabilities: Computational Complexity, Vladik Kreinovich

Departmental Technical Reports (CS)

In engineering design problems, we want to make sure that a certain quantity c of the designed system lies within given bounds -- or at least that the probability of this quantity to be outside these bounds does not exceed a given threshold. We may have several such requirements -- thus the requirement can be formulated as bounds [Fc(x); Fc(x)] on the cumulative distribution function Fc(x) of the quantity c; such bounds are known as a p-box.

The value of the desired quantity c depends on the design parameters a and the parameters b characterizing the environment: c = f(a; …


Measurement's Result And Its Error As Fuzzy Variables: Background And Perspectives, Gennady N. Solopchenko, Konstantin K. Semenov, Vladik Kreinovich, Leon Reznik Jun 2009

Measurement's Result And Its Error As Fuzzy Variables: Background And Perspectives, Gennady N. Solopchenko, Konstantin K. Semenov, Vladik Kreinovich, Leon Reznik

Departmental Technical Reports (CS)

The possibility of using fuzzy variables for describing measurands and their error characteristics is investigated. The elementary arithmetic operations within the limits of such representation are considered.


Looking For Entropy Rate Constancy In Spoken Dialog, Alejandro Vega, Nigel Ward Jun 2009

Looking For Entropy Rate Constancy In Spoken Dialog, Alejandro Vega, Nigel Ward

Departmental Technical Reports (CS)

The entropy constancy principle describes the tendency for information in language to be conveyed at a constant rate. We explore the possible role of this principle in spoken dialog, using the ``summed entropy rate,'' that is, the sum of the entropies of the words of both speakers per second of time. Using the Switchboard corpus of casual dialogs and a standard ngram language model to estimate entropy, we examine patterns in entropy rate over time and the distribution of entropy across the two speakers. The results show effects that can be taken as support for the principle of constant entropy, …


Equations Without Equations: Challenges On A Way To A More Adequate Formalization Of Causality Reasoning In Physics, Roberto Araiza, Vladik Kreinovich, Juan Ferret Jun 2009

Equations Without Equations: Challenges On A Way To A More Adequate Formalization Of Causality Reasoning In Physics, Roberto Araiza, Vladik Kreinovich, Juan Ferret

Departmental Technical Reports (CS)

Not all mathematical solutions to physical equations are physically meaningful: e.g., if we reverse all the molecular velocities in a breaking cup, we get pieces self-assembling into a cup. The resulting initial conditions are "degenerate": once we modify them, self-assembly stops. So, in a physical solution, the initial conditions must be "non-degenerate".

A challenge in formalizing this idea is that it depends on the representation. Example 1: we can use the Schroedinger equation to represent the potential field V(x)=F(f,...) as a function of the wave function f(x,t) and its derivatives. The new equation dF/dt=0 is equivalent to the Schroedinger equation, …


General Direction Routing Protocol, Sean Michael Lydon Jun 2009

General Direction Routing Protocol, Sean Michael Lydon

Master's Theses

The General Direction Routing Protocol (GDRP) is a Wireless Sensor Network (WSN)

multi-path routing protocol which abstracts localization information (commonly GPS

coordinates) into relative direction information in order to perform routing decisions. By

generating relative direction information GDRP is able to operate with fewer precision

requirements than other protocols. This abstraction also allows the integration of other emerging

hardware-based localization techniques, for example, Beamforming Sensor Arrays.

GDRP does not specifically address the next hop a packet should take, but instead specifies a

direction it should travel. This direction abstraction allows for multiple paths to be taken through

the network thus …


Affine Region Tracking And Augmentation Using Mser And Adaptive Sift Model Generation, Matthew James Marano Jun 2009

Affine Region Tracking And Augmentation Using Mser And Adaptive Sift Model Generation, Matthew James Marano

Master's Theses

Relatively complex Augmented Reality (AR) algorithms are becoming widely available due to advancements in affordable mobile computer hardware. To take advantage of this a new method is developed for tracking 2D regions without a prior knowledge of an environment and without developing a computationally expensive world model. In the method of this paper, affinely invariant planar regions in a scene are found using the Maximally Stable Extremal Region (MSER) detector. A region is selected by the user to define a search space, and then the Scale Invariant Feature Transform (SIFT) is used to detect affine invariant keypoints in the region. …


Jdiet: Footprint Reduction For Memory-Constrained Systems, Michael John Huffman Jun 2009

Jdiet: Footprint Reduction For Memory-Constrained Systems, Michael John Huffman

Master's Theses

Main memory remains a scarce computing resource. Even though main memory is becoming more abundant, software applications are inexorably engineered to consume as much memory as is available. For example, expert systems, scientific computing, data mining, and embedded systems commonly suffer from the lack of main memory availability.

This thesis introduces JDiet, an innovative memory management system for Java applications. The goal of JDiet is to provide the developer with a highly configurable framework to reduce the memory footprint of a memory-constrained system, enabling it to operate on much larger working sets. Inspired by buffer management techniques common in modern …


Gene Order Phylogeny And The Evolution Of Methanogens, Haiwei Luo, Zhiyi Sun, William Arndt, Jian Shi, Robert Friedman, Jijun Tang Jun 2009

Gene Order Phylogeny And The Evolution Of Methanogens, Haiwei Luo, Zhiyi Sun, William Arndt, Jian Shi, Robert Friedman, Jijun Tang

Faculty Publications

Methanogens are a phylogenetically diverse group belonging to Euryarchaeota. Previously, phylogenetic approaches using large datasets revealed that methanogens can be grouped into two classes, “Class I” and “Class II”. However, some deep relationships were not resolved. For instance, the monophyly of “Class I” methanogens, which consist of Methanopyrales, Methanobacteriales and Methanococcales, is disputable due to weak statistical support. In this study, we use MSOAR to identify common orthologous genes from eight methanogen species and a Thermococcale species (outgroup), and apply GRAPPA and FastME to compute distance-based gene order phylogeny. The gene order phylogeny supports two classes of methanogens, but it …


Communications And Positioning In Wireless Networks, Yao Zhao Jun 2009

Communications And Positioning In Wireless Networks, Yao Zhao

Dissertations

My doctoral research for the past three years is presented in this report. My research mainly focuses on the communications and positioning for wireless networks and is composed of three parts. First, I explored a new Turbo frequency equalization technique for multiple-input multiple-output (MIMO) wireless communications systems to improve the performance of wireless communications. In the second part of my research, I studied the multiple antenna cooperative communications from the perspective of information theories. The third part of my work is dedicated to extensive research on positioning technology for wireless networks using knowledge of the estimation theory in signal processing.


Comparison Of Efficiency In Pathfinding Algorithms In Game Development, Nikhil Krishnaswamy Jun 2009

Comparison Of Efficiency In Pathfinding Algorithms In Game Development, Nikhil Krishnaswamy

Technical Reports

This paper is the summary of a study done to assess the efficiency of three different pathfinding algorithms in a game-like environment. “Efficiency” is, in this case, defined as finding the shortest path possible in the least amount of time possible, and is tracked using a number of metrics, including the number of visitations made by a particular algorithm to any node in the graph tree, and the physical length of the traversable path in the game world. The three algorithms were tested using randomly generated sets of nodes in three different navigable environments in order to assess if any …


Software Quality Attribute Measurement And Analysis Based On Class Diagram Metrics, Dalia Rizk Jun 2009

Software Quality Attribute Measurement And Analysis Based On Class Diagram Metrics, Dalia Rizk

Archived Theses and Dissertations

Software quality measurement lies at the heart of the quality engineering process. Quality measurement for object-oriented artifacts has become the key for ensuring high quality software. Both researchers and practitioners are interested in measuring software product quality for improvement. It has recently become more important to consider the quality of products at the early phases, especially at the design level to ensure that the coding and testing would be conducted more quickly and accurately. The research work on measuring quality at the design level progressed in a number of steps. The first step was to discover the correct set of …


Design And Implementation Of A Byzantine Fault Tolerance Framework For Web Services, Wenbing Zhao Jun 2009

Design And Implementation Of A Byzantine Fault Tolerance Framework For Web Services, Wenbing Zhao

Electrical and Computer Engineering Faculty Publications

Many Web services are expected to run with high degree of security and dependability. To achieve this goal, it is essential to use a Web services compatible framework that tolerates not only crash faults, but Byzantine faults as well, due to the untrusted communication environment in which the Web services operate. In this paper, we describe the design and implementation of such a framework, called BFT-WS. BFT-WS is designed to operate on top of the standard SOAP messaging framework for maximum interoperability. It is implemented as a pluggable module within the Axis2 architecture, as such, it requires minimum changes …


A Graph-Based Approach To Symbolic Functional Decomposition Of Finite State Machines, Piotr Szotkowski, Mariusz Rawski, Henry Selvaraj Jun 2009

A Graph-Based Approach To Symbolic Functional Decomposition Of Finite State Machines, Piotr Szotkowski, Mariusz Rawski, Henry Selvaraj

Electrical & Computer Engineering Faculty Research

This paper discusses the symbolic functional decomposition method for implementing finite state machines in field-programmable gate array devices. This method is a viable alternative to the presently widespread two-step approaches to the problem, which consist of separate encoding and mapping stages; the proposed method does not have a separate decomposition step instead, the state's final encoding is introduced gradually on every decomposition iteration. Along with general description of the functional symbolic decomposition method's steps, the paper discusses various algorithms implementing the method and presents an example realisation of the most interesting algorithm. In the end, the paper compares the results …


Internet-Scale Reactive Routing And Mobility, Daniel B. Nelson Jun 2009

Internet-Scale Reactive Routing And Mobility, Daniel B. Nelson

Master's Theses

Since its commercialization, the Internet has grown exponentially. A large variety of devices can communicate creating advanced services for a diverse ecosystem of applications. However, as the number of Internet hosts has grown, the size of routing tables required to correctly route data between them has also increased exponentially. This growth rate necessitates increasingly frequent upgrades to routing device hardware, providing them with additional memory for fast-access storage of route information. These upgrades are both physically and fiscally untenable, and a new Internet routing solution is necessary for future growth.

This research focuses around an incrementally deployable, reactive routing system …


Store And Forward Routing For Sparse Pico-Satellite Sensor Networks With Data-Mules, Trevor Joseph Koritza Jun 2009

Store And Forward Routing For Sparse Pico-Satellite Sensor Networks With Data-Mules, Trevor Joseph Koritza

Master's Theses

Satellites are playing an increasingly important role in collecting scientific information, providing communication services, and revolutionizing navigation. Until recently satellites were large and very expensive, creating a high barrier to entry that only large corporations and government agencies could overcome. In the past few years the CubeSat project at California Polytechnic University in San Luis Obispo (Cal Poly) has worked to refine the design and launching of small, lightweight, and less expensive satellites called pico-satellites, opening space up to a wider audience. Now that Cal Poly has the launch logistics and hardware under control, a new problem has arisen. These …


A Graphical Approach To Testing Real-Time Embedded Devices, Steven M. Day Jun 2009

A Graphical Approach To Testing Real-Time Embedded Devices, Steven M. Day

Master's Theses

Software Testing is both a vital and expensive part of the software development lifecycle. Improving the testing process has the potential for large returns. Current testing methodologies used to test real-time embedded devices are examined and the weaknesses in them are exposed. This leads to the introduction of a new graphical testing methodology based on flowcharts. The new approach is both a visual test creation program and an automated execution engine that together frame a new way of testing. The new methodology incorporates flow-based diagrams, visual layouts, and simple execution rules to improve upon traditional testing approaches. The new methodology …


A System For Natural Language Unmarked Clausal Transformations In Text-To-Text Applications, Daniel Miller Jun 2009

A System For Natural Language Unmarked Clausal Transformations In Text-To-Text Applications, Daniel Miller

Master's Theses

A system is proposed which separates clauses from complex sentences into simpler stand-alone sentences. This is useful as an initial step on raw text, where the resulting processed text may be fed into text-to-text applications such as Automatic Summarization, Question Answering, and Machine Translation, where complex sentences are difficult to process. Grammatical natural language transformations provide a possible method to simplify complex sentences to enhance the results of text-to-text applications. Using shallow parsing, this system improves the performance of existing systems to identify and separate marked and unmarked embedded clauses in complex sentence structure resulting in syntactically simplified source for …


Extraction Of Causal-Association Networks From Unstructured Text Data, Brett N. Bojduj Jun 2009

Extraction Of Causal-Association Networks From Unstructured Text Data, Brett N. Bojduj

Master's Theses

Causality is an expression of the interactions between variables in a system. Humans often explicitly express causal relations through natural language, so extracting these relations can provide insight into how a system functions. This thesis presents a system that uses a grammar parser to extract causes and effects from unstructured text through a simple, pre-defined grammar pattern. By filtering out non-causal sentences before the extraction process begins, the presented methodology is able to achieve a precision of 85.91% and a recall of 73.99%. The polarity of the extracted relations is then classified using a Fisher classifier. The result is a …


Machine Annotation Of Traditional Irish Dance Music, Bryan Duggan Jun 2009

Machine Annotation Of Traditional Irish Dance Music, Bryan Duggan

Doctoral

The work presented in this thesis is validated in experiments using 130 realworld field recordings of traditional music from sessions, classes, concerts and commercial recordings. Test audio includes solo and ensemble playing on a variety of instruments recorded in real-world settings such as noisy public sessions. Results are reported using standard measures from the field of information retrieval (IR) including accuracy, error, precision and recall and the system is compared to alternative approaches for CBMIR common in the literature.


Demonstration Of Bias-Controlled Algorithmic Tuning Of Quantum Dots In A Well (Dwell) Midir Detectors, Woo-Yong Jang, Majeed M. Hayat, J. Scott Tyo, Ram S. Attaluri, Thomas E. Vandervelde, Yagya D. Sharma, Rajeev Shenoi, Andreas Stintz, Elizabeth R. Cantwell, Steven C. Bender, Sang Jun Lee, Sam Kyu Noh, Sanjay Krishna Jun 2009

Demonstration Of Bias-Controlled Algorithmic Tuning Of Quantum Dots In A Well (Dwell) Midir Detectors, Woo-Yong Jang, Majeed M. Hayat, J. Scott Tyo, Ram S. Attaluri, Thomas E. Vandervelde, Yagya D. Sharma, Rajeev Shenoi, Andreas Stintz, Elizabeth R. Cantwell, Steven C. Bender, Sang Jun Lee, Sam Kyu Noh, Sanjay Krishna

Electrical and Computer Engineering Faculty Research and Publications

The quantum-confined Stark effect in intersublevel transitions present in quantum-dots-in-a-well (DWELL) detectors gives rise to a midIR spectral response that is dependent upon the detector's operational bias. The spectral responses resulting from different biases exhibit spectral shifts, albeit with significant spectral overlap. A postprocessing algorithm was developed by Sakoglu that exploited this bias-dependent spectral diversity to predict the continuous and arbitrary tunability of the DWELL detector within certain limits. This paper focuses on the experimental demonstration of the DWELL-based spectral tuning algorithm. It is shown experimentally that it is possible to reconstruct the spectral content of a target electronically without …


On Modeling And Mitigating New Breed Of Dos Attacks, Amey Bhaskar Shevtekar May 2009

On Modeling And Mitigating New Breed Of Dos Attacks, Amey Bhaskar Shevtekar

Dissertations

Denial of Service (DoS) attacks pose serious threats to the Internet, exerting in tremendous impact on our daily lives that are heavily dependent on the good health of the Internet. This dissertation aims to achieve two objectives:1) to model new possibilities of the low rate DoS attacks; 2) to develop effective mitigation mechanisms to counter the threat from low rate DoS attacks.

A new stealthy DDoS attack model referred to as the "quiet" attack is proposed in this dissertation. The attack traffic consists of TCP traffic only. Widely used botnets in today's various attacks and newly introduced network feedback control …


Deployed Software Analysis, Madeline M. Diep May 2009

Deployed Software Analysis, Madeline M. Diep

School of Computing: Dissertations, Theses, and Student Research

Profiling can offer a valuable characterization of software behavior. The richer the characterization is, the more effective the client analyses are in supporting quality assurance activities. For today's complex software, however, obtaining a rich characterization with the input provided by in-house test suites is becoming more difficult and expensive. Extending the profiling activity to deployed environments can mitigate this shortcoming by exposing more program behavior reflecting real software usage. To make profiling of deployed software plausible, however, we need to take into consideration that there are fundamental differences between the development and the deployed environments. Deployed environments allow for less …


Cybercrime And The 2012 London Olympics, Denis Edgar-Nevill May 2009

Cybercrime And The 2012 London Olympics, Denis Edgar-Nevill

Annual ADFSL Conference on Digital Forensics, Security and Law

The London 2012 Olympics is just three years away and the clock is ticking to put in place plans get it right. The potential for cybercrime to cause harm during this event is very great; harm to national reputation, harm to the reputation to the Olympic movement, and harm to individuals competing, watching or officiating. This paper considers the need to address these risks by taking a look at what has happened in the past at sporting events and the rising wave of electronic security threats and fraud facilitated by computers at recent Olympics. The problems for law enforcement are …