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

Computer Sciences Commons™

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

Missouri University of Science and Technology

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 991 - 1020 of 1938

Full-Text Articles in Computer Sciences

Social Group Detection Based Routing In Delay Tolerant Networks, Roy Cabaniss, Srinivasa S. Vulli, Sanjay Madria Nov 2013

Social Group Detection Based Routing In Delay Tolerant Networks, Roy Cabaniss, Srinivasa S. Vulli, Sanjay Madria

Computer Science Faculty Research & Creative Works

When implementing Mobile Ad Hoc Networks, a key characteristic of the network is the mobility pattern of the nodes. Based on the application, nodes can follow semi-predictable patterns, such as the routes followed by Vehicular Ad Hoc Networks, or the more strict schedules followed by aerial reconnaissance. Optimal routing schemes tend to take advantage of information regarding these patterns. In social environments, such as wildlife tracking or sending messages between humans, the devices and/or users will follow regular contact habits, tending to encounter social groups in which they participate. By identifying these groups, the patterns are used to optimize routing …

Go to article

Leveraging Platoon Dispersion For Sybil Detection In Vehicular Networks, Muhammad Al Mutaz, Levi Malott, Sriram Chellappan Oct 2013

Leveraging Platoon Dispersion For Sybil Detection In Vehicular Networks, Muhammad Al Mutaz, Levi Malott, Sriram Chellappan

Computer Science Faculty Research & Creative Works

A Sybil attack is one where an adversary assumes multiple identities with the purpose of defeating the trust of an existing reputation system. When Sybil attacks are launched in vehicular networks, an added challenge in detecting malicious nodes is mobility that makes it increasingly difficult to tie a node to the location of attacks. In this paper, we present an innovative protocol for Sybil detection in vehicular networks. Considering that vehicular networks are cyber-physical systems integrating cyber and physical components, our technique exploits well-grounded results in the physical (i.e., transportation) domain to tackle the Sybil problem in the cyber domain. …

Go to article

Stochastic Optimal Controller Design For Uncertain Nonlinear Networked Control System Via Neuro Dynamic Programming, Hao Xu, Sarangapani Jagannathan Oct 2013

Stochastic Optimal Controller Design For Uncertain Nonlinear Networked Control System Via Neuro Dynamic Programming, Hao Xu, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

The stochastic optimal controller design for the nonlinear networked control system (NNCS) with uncertain system dynamics is a challenging problem due to the presence of both system nonlinearities and communication network imperfections, such as random delays and packet losses, which are not unknown a priori. In the recent literature, neuro dynamic programming (NDP) techniques, based on value and policy iterations, have been widely reported to solve the optimal control of general affine nonlinear systems. However, for real-time control, value and policy iterations-based methodology are not suitable and time-based NDP techniques are preferred. In addition, output feedback-based controller designs are preferred …

Go to article

Efficient Determination Of Spatial Relations Using Composition Tables And Decision Trees, Nathan Eloe, Jennifer Leopold, Chaman Sabharwal, Douglas Mcgeehan Sep 2013

Efficient Determination Of Spatial Relations Using Composition Tables And Decision Trees, Nathan Eloe, Jennifer Leopold, Chaman Sabharwal, Douglas Mcgeehan

Computer Science Faculty Research & Creative Works

In order for Qualitative Spatial Reasoning applications to be both useful and usable, the information feedback loop between the computational engine and the user must be as seamless as possible. Inherently, computational geometry can be quite expensive, and every effort must be made to avoid inefficient or unnecessary calculations. Within the field of Region Connection Calculi, the 9-Intersection model often is used to determine the spatial relation between two regions. Consequently, optimization efforts typically focus on calculations involving the intersections between the interiors, boundaries, and exteriors of the regions, or the use of composition tables to narrow down the possibilities …

Go to article

Smooth Transition Neighborhood Graphs For 3d Spatial Relations, Chaman L. Sabharwal, Jennifer L. Leopold Sep 2013

Smooth Transition Neighborhood Graphs For 3d Spatial Relations, Chaman L. Sabharwal, Jennifer L. Leopold

Computer Science Faculty Research & Creative Works

Distance between two relations can be defined by using some metric based on the qualitative or quantitative representation of the relations [1]. However, qualitative distances cannot be expressed by conventional measures. Most differentiating measures are derived from observation and experience in an ad hoc manner. The outcomes are cognitively acceptable only if they match the user's concept of distance. We have designed an algorithm based on heuristics to derive a conceptual neighborhood supporting smooth transitions between the relations. Herein we present the results of applying the algorithm to the well-known region connection calculus, RCC-8, and to an additional model, VRCC-3D+, …

Go to article

A Probabilistic Encryption Based Min/Max Computation In Wireless Sensor Networks, Bharath K. Samanthula, Wei Jiang, Sanjay Madria Sep 2013

A Probabilistic Encryption Based Min/Max Computation In Wireless Sensor Networks, Bharath K. Samanthula, Wei Jiang, Sanjay Madria

Computer Science Faculty Research & Creative Works

Wireless sensor networks (WSNs) have wide range of applications in military, health-monitoring, smart-home applications, and in other commercial environments. The computation of data aggregation functions like MIN/MAX is one of the commonly used tasks in many such WSN applications. However, due to privacy issues in some of these applications, the individual sensor readings should be kept secret from others. That is, the base station should be the only entity who should receive the output of MIN/MAX function and the individual sensor readings should not be revealed either to other sensor nodes or to the root node for confidentiality reasons. Existing …

Go to article

Efficient Spatio-Temporal Information Fusion In Sensor Networks, Brijesh Kashyap Chejerla, Sanjay K. Madria Sep 2013

Efficient Spatio-Temporal Information Fusion In Sensor Networks, Brijesh Kashyap Chejerla, Sanjay K. Madria

Computer Science Faculty Research & Creative Works

Making the sensor data look more meaningful in its representation of an observed entity is the primary goal of sensor data fusion. Due to the energy constraint on sensors, there exists a need for algorithms that minimize the fusion cost while maintaining the validity of the data sent to the base station. Maintaining validity is even more difficult when we have a limited knowledge of the factors that govern an observed sensor entity. To achieve this goal, we modeled the uncertainties in sensor data and fed them into the system, employing recursive data estimation. By doing so, we considered the …

Go to article

Argument Placement Recommendation And Relevancy Assessment In An Intelligent Argumentation System, Feng Li, Nian Liu, Wei Jiang, Xiaoqing Liu Sep 2013

Argument Placement Recommendation And Relevancy Assessment In An Intelligent Argumentation System, Feng Li, Nian Liu, Wei Jiang, Xiaoqing Liu

Computer Science Faculty Research & Creative Works

Argumentation is a critical process for many social activities that need collaborative intelligence. Existing intelligent argumentation systems allow multiple stakeholders from distributed geographical locations to share their opinions and contribute to a decision-making process. In the current system, a stakeholder needs to read all the existing arguments posted by other stakeholders before contributing his/her own ideas/arguments. However, when information accumulates and an argumentation network becomes considerably large, it will cost tremendous time and effort for the stakeholder to read and comprehend all existing arguments. In this paper, we propose methods to implement a recommendation component built into an intelligent argumentation …

Go to article

Mitigating Event Confidentiality Violations In Smart Grids: An Information Flow Security-Based Approach, Thoshitha T. Gamage, Thomas P. Roth, Bruce M. Mcmillin, Mariesa L. Crow Sep 2013

Mitigating Event Confidentiality Violations In Smart Grids: An Information Flow Security-Based Approach, Thoshitha T. Gamage, Thomas P. Roth, Bruce M. Mcmillin, Mariesa L. Crow

Computer Science Faculty Research & Creative Works

Modern smart grids, by and large, merge physical interconnections and cyber controllers. Invariably, this tight coupling results in cyber commands manifesting in the physical layer as observable changes, leading to possible disclosure of sensitive system settings. Thus, cyber event confidentiality of the smart grid is violated. Attacks on confidentiality can ultimately lead to integrity and availability attacks; with adequate knowledge of the system topology, internal settings, and how the physical layer responds to cyber commands, a malicious adversary gains knowledge to attack the system. This work shows how to develop self-obfuscating systems based on information flow security properties that can …

Go to article

The Use Of Development History In Software Refactoring Using A Multi-Objective Evolutionary Algorithm, Ali Ouni, Marouane Kessentini, Houari Sahraoui, Mohamed Salah Hamdi Sep 2013

The Use Of Development History In Software Refactoring Using A Multi-Objective Evolutionary Algorithm, Ali Ouni, Marouane Kessentini, Houari Sahraoui, Mohamed Salah Hamdi

Computer Science Faculty Research & Creative Works

One of the widely used techniques for evolving software systems is refactoring, a maintenance activity that improves design structure while preserving the external behavior. Exploring past maintenance and development history can be an effective way of finding refactoring opportunities. Code elements which undergo changes in the past, at approximately the same time, bear a good probability for being semantically related. Moreover, these elements that experienced a huge number of refactoring in the past have a good chance for refactoring in the future. In addition, the development history can be used to propose new refactoring solutions in similar contexts. In this …

Go to article

Pre-Distribution Scheme For Data Sharing In Mobile Cloud Computing, Chaitanya Vemulapalli, Sanjay Kumar Madria, Mark Linderman Aug 2013

Pre-Distribution Scheme For Data Sharing In Mobile Cloud Computing, Chaitanya Vemulapalli, Sanjay Kumar Madria, Mark Linderman

Computer Science Faculty Research & Creative Works

computing gave rise to a new computing paradigm called Mobile Cloud Computing (MCC) that gives the flexibility to access information and computing resources anywhere anytime. In many applications, mobile nodes capture images/video clips and exchange with other mobile peers (on demand) and use local access points for efficient smooth distribution of information in the wireless network. In such a situation, a three-way data management and dissemination technique is helpful because it provides both data management and distribution at different levels of granularity. The main motivation of this paper is that we seek a balance between accessing information from a remote …

Go to article

High Memory Passive Rfid Tags With Multimodal Sensor Design And Application To Asset Monitoring In-Transit, Haifeng Niu, S. Jagannathan Aug 2013

High Memory Passive Rfid Tags With Multimodal Sensor Design And Application To Asset Monitoring In-Transit, Haifeng Niu, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, new passive Radio Frequency Identification (RFID) tags with multimodal sensors and a high on-tag memory is proposed. First, the features preferred on the new passive RFID tags are motivated followed by a detailed description on the design and fabrication of the tags. Next, the performance of the tags in terms of read range is evaluated. The experiments results show that proposed tags have a range of 5.8 meters when all sensors are disabled while the range reduces when sensors are enabled. However, it is demonstrated that the range can be enhanced to 8 meters by using energy …

Go to article

A Similarity Measure For Comparing Xacml Policies, Dan Lin, Prathima Rao, Rodolfo Ferrini, Elisa Bertino, Jorge Lobo Aug 2013

A Similarity Measure For Comparing Xacml Policies, Dan Lin, Prathima Rao, Rodolfo Ferrini, Elisa Bertino, Jorge Lobo

Computer Science Faculty Research & Creative Works

Assessing similarity of policies is crucial in a variety of scenarios, such as finding the cloud service providers which satisfy users' privacy concerns or finding collaborators which have matching security and privacy settings. Existing approaches to policy similarity analysis are mainly based on logical reasoning and Boolean function comparison. Such approaches are computationally expensive and do not scale well for large heterogeneous distributed environments (like the cloud). In this paper, we propose a policy similarity measure as a lightweight ranking approach to help one party quickly locate parties with potentially similar policies. In particular, given a policy P, the similarity …

Go to article

Etis - Efficient Trust And Identity Management System For Federated Service Providers, Makarand V. Bhonsle, Nayot Poolsappasit, Sanjay K. Madria Aug 2013

Etis - Efficient Trust And Identity Management System For Federated Service Providers, Makarand V. Bhonsle, Nayot Poolsappasit, Sanjay K. Madria

Computer Science Faculty Research & Creative Works

With the expectation of ever-increasing network of service providers due to Cloud and Web services explosion, security of user information is a major concern when it comes to the implementation of these services. This paper addresses the issue of identity management in a typical service providers' environment without the need for a trusted third party to federate the user identity for acquainted service providers. We leverage the establishment of trust between cross-domain service providers (SPs) to themselves rather than relying on a third party that brokers the trust between service providers. The hence formed network of SPs is then ready …

Go to article

Arrival Time Based Traffic Signal Optimization For Intelligent Transportation Systems, Vamsi Paruchuri, Sriram Chellappan, Rathinasamy B. Lenin Aug 2013

Arrival Time Based Traffic Signal Optimization For Intelligent Transportation Systems, Vamsi Paruchuri, Sriram Chellappan, Rathinasamy B. Lenin

Computer Science Faculty Research & Creative Works

Road Transportation is a crucial component of today's society, which drives several facets of our lives. The goal of intelligent transportation systems (ITS) is to improve the effectiveness, efficiency, and safety of the transportation system. Traffic signals are an elementary component of all road transportation systems. In order to maximize the productivity of a city, traffic signals must be able to efficiently control the flow of vehicles. Traditionally, current traffic signal optimization is based on traffic arrival rates, either estimated or forecasted. In this paper, we illustrate that arrival time-based solutions can outperform arrival rate-based approaches. To the best of …

Go to article

Fixed Final Time Optimal Adaptive Control Of Linear Discrete-Time Systems In Input-Output Form, Qiming Zhao, Hao Xu, S. Jagannathan Jul 2013

Fixed Final Time Optimal Adaptive Control Of Linear Discrete-Time Systems In Input-Output Form, Qiming Zhao, Hao Xu, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, the fixed final time adaptive optimal regulation of discrete-time linear systems with unknown system dynamics is addressed. First, by transforming the linear systems into the input/output form, the adaptive optimal control design depends only on the measured outputs and past inputs instead of state measurements. Next, due to the time-varying nature of finite-horizon, a novel online adaptive estimator is proposed by utilizing an online approximator to relax the requirement on the system dynamics. An additional error term corresponding to the terminal constraint is defined and minimized overtime. No policy/value iteration is performed by the novel parameter update …

Go to article

Incentive Compatible Privacy-Preserving Data Analysis, Murat Kantarcioglu, Wei Jiang Jun 2013

Incentive Compatible Privacy-Preserving Data Analysis, Murat Kantarcioglu, Wei Jiang

Computer Science Faculty Research & Creative Works

In many cases, competing parties who have private data may collaboratively conduct privacy-preserving distributed data analysis (PPDA) tasks to learn beneficial data models or analysis results. Most often, the competing parties have different incentives. Although certain PPDA techniques guarantee that nothing other than the final analysis result is revealed, it is impossible to verify whether participating parties are truthful about their private input data. Unless proper incentives are set, current PPDA techniques cannot prevent participating parties from modifying their private inputs. This raises the question of how to design incentive compatible privacy-preserving data analysis techniques that motivate participating parties to …

Go to article

On Compressing Data In Wireless Sensor Networks For Energy Efficiency And Real Time Delivery, Tommy Szalapski, Sanjay Madria Jun 2013

On Compressing Data In Wireless Sensor Networks For Energy Efficiency And Real Time Delivery, Tommy Szalapski, Sanjay Madria

Computer Science Faculty Research & Creative Works

Wireless sensor networks possess significant limitations in storage, bandwidth, processing, and energy. Additionally, real-time sensor network applications such as monitoring poisonous gas leaks cannot tolerate high latency. While some good data compression algorithms exist specific to sensor networks, in this paper we present TinyPack, a suite of energy-efficient methods with high-compression ratios that reduce latency, storage, and bandwidth usage further in comparison with some other recently proposed algorithms. Our Huffman style compression schemes exploit temporal locality and delta compression to provide better bandwidth utilization important in the wireless sensor network, thus reducing latency for real time sensor-based monitoring applications. Our …

Go to article

An Efficient And Probabilistic Secure Bit-Decomposition, Bharath K.K. Samanthula, Hu Chun, Wei Jiang May 2013

An Efficient And Probabilistic Secure Bit-Decomposition, Bharath K.K. Samanthula, Hu Chun, Wei Jiang

Computer Science Faculty Research & Creative Works

Many secure data analysis tasks, such as secure clustering and classification, require efficient mechanisms to convert the intermediate encrypted integers into the corresponding encryptions of bits. The existing bit-decomposition algorithms either do not offer sufficient security or are computationally inefficient. In order to provide better security as well as to improve efficiency, we propose a novel probabilistic-based secure bit-decomposition protocol for values encrypted using public key additive homomorphic encryption schemes. The proposed protocol guarantees security as per the semi-honest security definition of secure multi-party computation (MPC) and is also very efficient compared to the existing method. Our protocol always returns …

Go to article

Search-Based Refactoring Using Recorded Code Changes, Ali Ouni, Marouane Kessentini, Houari Sahraoui May 2013

Search-Based Refactoring Using Recorded Code Changes, Ali Ouni, Marouane Kessentini, Houari Sahraoui

Computer Science Faculty Research & Creative Works

Over the past decades, many techniques and tools have been developed to record the sequence of applied refactoring to improve design quality. We start from the observation that these recorded code changes can be used to propose new refactoring solutions in similar contexts. In addition, this knowledge can be combined with structural and semantic information, used by existing work, to improve the automation of refactoring. In this paper, we propose a multi-objective optimization approach to find the best sequence of refactoring's that maximizes the use of refactoring applied in the past to similar contexts, minimizes semantic errors and minimizes the …

Go to article

An Approach For Optimization Of Object Queries On Collections Using Annotations, Venkata Krishna Suhas Nerella, Sanjay K. Madria, Thomas Weigert May 2013

An Approach For Optimization Of Object Queries On Collections Using Annotations, Venkata Krishna Suhas Nerella, Sanjay K. Madria, Thomas Weigert

Computer Science Faculty Research & Creative Works

Object oriented programming languages have raised the level of abstraction by supporting the object querying on collections. Programming languages can execute first class query constructs, using query optimization techniques from the database field, for run time optimizations. Existing approaches, however, such as Java Query Language (JQL), which executes such query constructs on collections have high run time overhead. Therefore, we propose an approach to reduce the burden of run time overhead by performing most of the query optimization for object queries on collections at compile time. This approach both analyzes the source code and obtains the metadata provided through annotations. …

Go to article

Localization Of Rfid Tags Using Stochastic Tunneling, M. R. Basheer, S. Jagannathan May 2013

Localization Of Rfid Tags Using Stochastic Tunneling, M. R. Basheer, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a novel localization scheme in the 3D wireless domain that employs cross correlation in backscattered signal power from a cluster of radio frequency identification (RFID) tags to estimate their location. Spatially co-located RFID tags, energized by a common tag reader, exhibit correlation in their received signal strength indicator (RSSI) values. Hence, for a cluster of RFID tags, the posterior distribution of their unknown radial separation is derived as a function of the measured RSSI correlations between them. The global maxima of this posterior distribution represent the actual radial separation between the RFID tags. The radial separations are …

Go to article

Approximate String Matching By Position Restricted Alignment, Manish Patil, Xuanting Cai, Sharma V. Thankachan, Rahul Shah, Seung Jong Park, David Foltz May 2013

Approximate String Matching By Position Restricted Alignment, Manish Patil, Xuanting Cai, Sharma V. Thankachan, Rahul Shah, Seung Jong Park, David Foltz

Computer Science Faculty Research & Creative Works

Given a collection of strings, goal of the approximate string matching is to efficiently find the strings in the collection that are similar to a query string. In this paper, we focus on edit distance as measure to quantify the similarity between two strings. Existing q-gram based methods to address this problem use inverted indexes to index the q-grams of given string collection. These methods begin by generating the q-grams of query string (disjoint or overlapping) and then merge the inverted lists of these q-grams. Several filtering techniques have been proposed so as to segment inverted lists to relatively shorter …

Go to article

Modeling And Verification Of Security Properties For Critical Infrastructure Protection, Ravi Akella, Bruce M. Mcmillin Apr 2013

Modeling And Verification Of Security Properties For Critical Infrastructure Protection, Ravi Akella, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

Recently, studies have revealed new security issues in critical infrastructures, emphasizing the need for verification of security properties. Any mechanism to verify the security of such systems should merge the cyber and physical aspects in a unified way. This paper proposes a novel direction using process algebras to model and verify security properties within a cyber-physical system (CPS). Specifically, we adopt the π-calculus to perform security analysis of a representative CPS, an advanced electric smart grid. We present the verification of an information flow security property, non- deducibility, defined in terms of more discriminating behavioral equivalences available in π-calculus compared …

Go to article

Visualizing Graph Features For Fast Port Scan Detection, Maggie Cheng, Quanmin Ye, Robert F. Erbacher Apr 2013

Visualizing Graph Features For Fast Port Scan Detection, Maggie Cheng, Quanmin Ye, Robert F. Erbacher

Computer Science Faculty Research & Creative Works

Detection of sophisticated network scans, such as low and slow scans, requires correlation of large amounts of network data over long periods of time. The volume of data obfuscating such scans can be overwhelming and makes computation challenging. Such scans pose network security risks since identifying running services, the goal of executing such scans, is the first step in launching an attack on the scanned host. To detect sophisticated scans, we propose the integration of graph feature extraction techniques with visualization to simultaneously optimize computational complexity and human analyst time. The integrated approach uses graph modeling and preprocessing to make …

Go to article

Vulnerability Analysis Of A Smart Grid With Monitoring And Control System, Maggie Xiaoyan Cheng, Mariesa Crow, Robert F. Erbacher Apr 2013

Vulnerability Analysis Of A Smart Grid With Monitoring And Control System, Maggie Xiaoyan Cheng, Mariesa Crow, Robert F. Erbacher

Computer Science Faculty Research & Creative Works

Large scale power outage is typically the consequence of cascading failures propagated through a power system. To mitigate failure propagation, wide area monitoring and control system is introduced. However, as the physical system is tightly coupled with the cyber system, new threats are introduced due to possible cyber-attacks and failures of the communication system. This paper presents a new framework for vulnerability analysis. Under this framework, we can identify the vulnerable components and the critical components of a cyber physical system. Distinct from previous work, our model considers the interaction between the different components of the cyber physical system and …

Go to article

Data Replication In Cooperative Mobile Ad-Hoc Networks: A Game Theoretic Replication Algorithm Using Volunteers' Dilemma, Dan Hirsch, Sanjay Madria Apr 2013

Data Replication In Cooperative Mobile Ad-Hoc Networks: A Game Theoretic Replication Algorithm Using Volunteers' Dilemma, Dan Hirsch, Sanjay Madria

Computer Science Faculty Research & Creative Works

The mobile computing environment provides many benefits such as ubiquitous access to computing but includes constraints on resources such as available bandwidth and battery life. Replication is a widely recognized method for balancing the demands of storage space with bandwidth and battery life. We propose a novel scheme that seeks to strategically balance these constrained resources through a cooperative game-theory approach for replication in a mobile environment. Our replication strategy relies on the cooperation of the nodes within the network to make replica caching decisions which are spatiotemporally local-optimal for the network from an energy and bandwidth conservation standpoint. In …

Go to article

Neural Network-Based Optimal Adaptive Output Feedback Control Of A Helicopter Uav, David Nodland, Hassan Zargarzadeh, Sarangapani Jagannathan Apr 2013

Neural Network-Based Optimal Adaptive Output Feedback Control Of A Helicopter Uav, David Nodland, Hassan Zargarzadeh, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

Helicopter unmanned aerial vehicles (UAVs) are widely used for both military and civilian operations. Because the helicopter UAVs are underactuated nonlinear mechanical systems, high-performance controller design for them presents a challenge. This paper introduces an optimal controller design via an output feedback for trajectory tracking of a helicopter UAV, using a neural network (NN). The output-feedback control system utilizes the backstepping methodology, employing kinematic and dynamic controllers and an NN observer. The online approximator-based dynamic controller learns the infinite-horizon Hamilton-Jacobi-Bellman equation in continuous time and calculates the corresponding optimal control input by minimizing a cost function, forward-in-time, without using the …

Go to article

Simulation And Detection Of Unintended Electromagnetic Emissions From Super-Regenerative Receivers, Jake Hertenstein, S. Jagannathan Mar 2013

Simulation And Detection Of Unintended Electromagnetic Emissions From Super-Regenerative Receivers, Jake Hertenstein, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

A novel method for detecting the presence of the unintended electromagnetic emissions (UEE) from radio receivers is examined without a priori data or training. As an extension of previous research, the behavior of the super-regenerative receiver (SRR) is modeled and simulated with fractional Brownian noise to verify the detection model. This model shows that the presence of noise in the feedback circuit of the SRR is responsible for the characteristic frequency distribution of the receiver's UEE. A second-order self-similarity model is used to estimate the Hurst parameter as a detection threshold for the presence of long-range dependent noise that is …

Go to article

Maintainability Defects Detection And Correction: A Multi-Objective Approach, Ali Ouni, Marouane Kessentini, Houari Sahraoui, Mounir Boukadoum Mar 2013

Maintainability Defects Detection And Correction: A Multi-Objective Approach, Ali Ouni, Marouane Kessentini, Houari Sahraoui, Mounir Boukadoum

Computer Science Faculty Research & Creative Works

Software defects often lead to bugs, runtime errors and software maintenance difficulties. They should be systematically prevented, found, removed or fixed all along the software lifecycle. However, detecting and fixing these defects is still, to some extent, a difficult, time-consuming and manual process. In this paper, we propose a two-step automated approach to detect and then to correct various types of maintainability defects in source code. Using Genetic Programming, our approach allows automatic generation of rules to detect defects, thus relieving the designer from a fastidious manual rule definition task. Then, we correct the detected defects while minimizing the correction …

Go to article

First Prev Next Last