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 1111 - 1140 of 1938

Full-Text Articles in Computer Sciences

Localization Of Objects Using Cross-Correlation Of Shadow Fading Noise And Copulas, Mohammed Rana Basheer, Sarangapani Jagannathan Dec 2011

Localization Of Objects Using Cross-Correlation Of Shadow Fading Noise And Copulas, Mohammed Rana Basheer, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

While fading, in general, is detrimental to accurately localizing a target, fading correlation between adjacent receivers may be exploited to improve localization accuracy. Therefore, this paper presents a novel wireless localization scheme that employs a combination of cross-correlation between shadow fading noise and copula technique to recursively estimate the location of a transmitter. a stochastic filter that models multipath fading as an Ornstein-Uhlenbeck process followed by a Generalized Auto Regressive Conditional Heteroskedasticity (GARCH) filtering is proposed to extract shadow fading residuals from measured RSSI values. Subsequently, Student-t Copula function is used to create the log likelihood function, which acts as …

Go to article

Mahalanobis-Taguchi System As A Multi-Sensor Based Decision Making Prognostics Tool For Centrifugal Pump Failures, Ahmet Soylemezoglu, Sarangapani Jagannathan, Can Saygin Dec 2011

Mahalanobis-Taguchi System As A Multi-Sensor Based Decision Making Prognostics Tool For Centrifugal Pump Failures, Ahmet Soylemezoglu, Sarangapani Jagannathan, Can Saygin

Electrical and Computer Engineering Faculty Research & Creative Works

A novel Mahalanobis Taguchi System (MTS) based fault detection, isolation, and prognostics scheme is presented. the proposed scheme fuses data from multiple sensors into a single system level performance metric using Mahalanobis Distance (MD) and generates fault clusters based on MD values. MD thresholds derived from the clustering analysis are used for fault detection and isolation. When a fault is detected, the prognostics scheme, which monitors the progression of the MD values over time, is initiated. Then, using a linear approximation, time to failure is estimated. the performance of the scheme has been validated via experiments performed on a mono-block …

Go to article

Energy-Efficient Real-Time Data Compression In Wireless Sensor Networks, Tommy Szalapski, Sanjay Madria Nov 2011

Energy-Efficient Real-Time Data Compression In Wireless Sensor Networks, Tommy Szalapski, Sanjay Madria

Computer Science Faculty Research & Creative Works

Wireless sensor networks possess significant limitations in storage, bandwidth, and power. Additionally, real-time sensor networks cannot tolerate high latency. While some good compression algorithms exist specific to sensor networks, in this paper we present an energy-efficient method with high compression ratio that reduces latency, storage and bandwidth usage further in comparison with some other recently proposed algorithms. Our Huffman style compression scheme exploits temporal locality and delta compression to provide better bandwidth utilization in the network, thus reducing latency for real time applications. Our performance evaluations show comparable compression ratios and energy savings with a significant decrease in latency compared …

Go to article

A Multi-Tiered Architecture For Content Retrieval In Mobile Peer-To-Peer Networks, Neelanjana Dutta, Raghavendra Kotikalapudi, Abhinav Saxena, Sriram Chellappan Nov 2011

A Multi-Tiered Architecture For Content Retrieval In Mobile Peer-To-Peer Networks, Neelanjana Dutta, Raghavendra Kotikalapudi, Abhinav Saxena, Sriram Chellappan

Computer Science Faculty Research & Creative Works

In this paper, we address content retrieval in Mobile Peer-to-Peer (P2P) Networks. We design a multi-tiered architecture for content retrieval, where at Tier 1, we design a protocol for content similarity governed by a parametera that trades accuracy with search overhead. at Tier 2, we introduce a novel concept called Chained Bloom Filters and design a protocol where popular search items are linked with popular content at each node in an efficient manner for subsequent retrieval. Extensive analysis and numerical simulations demonstrate the effectiveness of our techniques. © 2011 IEEE.

Go to article

Energy Efficient, Adaptive And Collaborative Data Sampling In Wireless Sensor Networks, Tommy Szalapski, Sanjay Kumar Madria Nov 2011

Energy Efficient, Adaptive And Collaborative Data Sampling In Wireless Sensor Networks, Tommy Szalapski, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

This paper outlines some interesting research issues and solution approaches related to collaborative data sampling in wireless sensor networks for efficient energy and bandwidth utilization. © 2011 IEEE.

Go to article

A Secure Data Aggregation Based Trust Management Approach For Dealing With Untrustworthy Motes In Sensor Network, Nayot Poolsappasit, Sanjay Madria Nov 2011

A Secure Data Aggregation Based Trust Management Approach For Dealing With Untrustworthy Motes In Sensor Network, Nayot Poolsappasit, Sanjay Madria

Computer Science Faculty Research & Creative Works

Efficient power management is vital for increasing the life of wireless sensor networks (WSN). the main reason is that the radio transmission consumes energy approximately three times comparing to other operations. Thus, techniques such as data aggregation have been widely used in WSN to preserve energy. Despite its appealing and powerful features, data aggregation requires a high level of security as tampering with aggregating data can be suspected due to small bit errors. We propose a comprehensive trust management approach to deal with the potential dishonest and faulty motes in sensor networks. Unlike other trust management approaches, we take into …

Go to article

Model-Free H∞ Stochastic Optimal Design For Unknown Linear Networked Control System Zero-Sum Games Via Q-Learning, Hao Xu, Sarangapani Jagannathan Nov 2011

Model-Free H∞ Stochastic Optimal Design For Unknown Linear Networked Control System Zero-Sum Games Via Q-Learning, Hao Xu, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, stochastic optimal strategy for unknown linear networked control system (NCS) quadratic zero-sum games related to H∞ optimal control in the presence of random delays and packet losses is solved in forward-in-time manner. This approach does not require the knowledge of the system matrices since it uses Q-learning. the proposed stochastic optimal control approach, referred as adaptive dynamic programming (ADP), involves solving the action dependent Q-function Q (z, u, d) of the zero-sum game instead of solving the state dependent value function J (z) which satisfies a corresponding Game Theoretic Riccati equation (GRE). an adaptive estimator (AE) is …

Go to article

Nn/Rise-Based Asymptotic Tracking Control Of Uncertain Nonlinear Systems, Qinmin Yang, Sarangapani Jagannathan, Youxian Sun Nov 2011

Nn/Rise-Based Asymptotic Tracking Control Of Uncertain Nonlinear Systems, Qinmin Yang, Sarangapani Jagannathan, Youxian Sun

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a novel control methodology for the tracking control of a high-order continuous time nonlinear systems with unknown dynamics and external disturbance. the control signal consists of the robust integral of the sign of the error (RISE) feedback signal multiplied with an adaptive gain plus neural network (NN) output. the two-layer NN learns the system dynamics in an online manner while residual reconstruction errors and the external bounded system disturbances are overcome by the RISE signal. Semi-global asymptotic tracking performance is theoretically guaranteed by using the Lyapunov standard method, while the NN weights and all other signals are …

Go to article

Artificial Immune System-Based Diagnostics And Prognostics Scheme And Its Experimental Verification, Gary R. Halligan, Balaje T. Thumati, S. Jagannathan Nov 2011

Artificial Immune System-Based Diagnostics And Prognostics Scheme And Its Experimental Verification, Gary R. Halligan, Balaje T. Thumati, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a novel fault diagnostics and prediction (FDP) scheme is introduced by using artificial immune system (AIS) as an online approximator for a class of nonlinear discrete-time systems. Traditionally, AIS is considered as an offline tool for fault detection (FD). However, in this paper, AIS is utilized as an online approximator in discrete time (OLAD) along with a robust adaptive term in the proposed fault diagnostics observer. using the fact that the system outputs are alone measurable, an output residual is determined by comparing the observer and system outputs and a fault is detected if this output residual …

Go to article

An Online Model-Based Fault Diagnosis Scheme For Hvac Systems, Balaje T. Thumati, Miles A. Feinstein, James W. Fonda, Alfred Turnbull, Fay J. Weaver, Mark E. Calkins, S. Jagannathan Nov 2011

An Online Model-Based Fault Diagnosis Scheme For Hvac Systems, Balaje T. Thumati, Miles A. Feinstein, James W. Fonda, Alfred Turnbull, Fay J. Weaver, Mark E. Calkins, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a model-based fault detection and isolation (FDI) scheme with online fault learning capabilities is proposed for HVAC systems. an observer comprising of an online approximator in discrete-time (OLAD) and a robust term is used for detection. a fault is detected if the generated detection residual, which is defined as the error between the observer outputs and HVAC system states, exceeds an apriori chosen threshold. the OLAD term in the FD observer learns the fault dynamics online while the robust term guarantees asymptotic estimation of the system states. Subsequent to detection, a fault isolation observer, which comprises of …

Go to article

Performance Improvement For Collection Operations Using Join Query Optimization, Venkata Krishna Suhas Nerella, Sanjay Kumar Madria, Thomas Weigert Nov 2011

Performance Improvement For Collection Operations Using Join Query Optimization, Venkata Krishna Suhas Nerella, Sanjay Kumar Madria, Thomas Weigert

Computer Science Faculty Research & Creative Works

Programming languages with explicit support for queries over collections allow programmers to express operations on collections more abstractly than relying on their realization in loops or through provided libraries. Join optimization techniques from the field of database technology support efficient realizations of such language constructs. We describe an algorithm that performs run-time query optimization and is effective for single runs of a program. the proposed approach relies on histograms built from the data at run time to estimate the selectivity of joins and predicates in order to construct query plans. Information from earlier executions of the same query during run …

Go to article

Investigating Combinatorial Approaches In Virtual Screening On Human Inducible 6-Phosphofructo-2-Kinase/Fructose-2,6-Bisphosphatase (Pfkfb3): A Case Study For Small Molecule Kinases, Robert B. Crochet, Michael C. Cavalier, Minsuh Seo, Jeong Do Kim, Young Sun Yim, Seung Jong Park, Yong Hwan Lee Nov 2011

Investigating Combinatorial Approaches In Virtual Screening On Human Inducible 6-Phosphofructo-2-Kinase/Fructose-2,6-Bisphosphatase (Pfkfb3): A Case Study For Small Molecule Kinases, Robert B. Crochet, Michael C. Cavalier, Minsuh Seo, Jeong Do Kim, Young Sun Yim, Seung Jong Park, Yong Hwan Lee

Computer Science Faculty Research & Creative Works

Efforts toward improving the predictiveness in tier-based approaches to virtual screening (VS) have mainly focused on protein kinases. Despite their significance as drug targets, small molecule kinases have been rarely tested with these approaches. In this paper, we investigate the efficacy of a pharmacophore screening-combined structure-based docking approach on the human inducible 6-phosphofructo-2-kinase/fructose-2,6-bisphosphatase, an emerging target for cancer chemotherapy. Six out of a total 1364 compounds from NCI's Diversity Set II were selected as true actives via throughput screening. Using a database constructed from these compounds, five programs were tested for structure-based docking (SBD) performance, the MOE of which showed …

Go to article

Confidentiality Preserving Security Properties For Cyber-Physical Systems, Thoshitha T. Gamage, Thomas P. Roth, Bruce M. Mcmillin Nov 2011

Confidentiality Preserving Security Properties For Cyber-Physical Systems, Thoshitha T. Gamage, Thomas P. Roth, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

The work in this paper presents recent advances in developing a theory of information flow security specifically geared towards preserving the event confidentiality in Cyber-Physical Systems (CPSs). Preserving the confidentiality of sensitive internal actions is a unique challenge in CPSs due to the inherent external observability of such systems and the tight coupling between their cyber and physical domains. the far-reaching objective of this work is to develop a science of self-obfuscating systems based on the composition of simple building blocks. a model of Nondeducibility composes the building blocks under information flow security properties. to this end, this work presents …

Go to article

Maximum Lifetime Coverage Preserving Scheduling Algorithms In Sensor Networks, Maggie X. Cheng, Xuan Gong Nov 2011

Maximum Lifetime Coverage Preserving Scheduling Algorithms In Sensor Networks, Maggie X. Cheng, Xuan Gong

Computer Science Faculty Research & Creative Works

In wireless sensor networks, when each target is covered by multiple sensors, sensors can take turns to monitor the targets in order to extend the lifetime of the network. in this paper, we address how to improve network lifetime through optimal scheduling of sensor nodes. We present two algorithms to achieve the maximum lifetime while maintaining the required coverage: A linear programming-Based exponential-time exact solution, and an approximation algorithm. Numerical simulation results from the approximation algorithm are compared to the exact solution and show a high degree of accuracy and efficiency. © 2010 Springer Science Business Media, LLC.

Go to article

An Engineered Approach To Stem Cell Culture: Automating The Decision Process For Real-Time Adaptive Subculture Of Stem Cells, Dai Fei Elmer Ker, Lee E. Weiss, Silvina N. Junkers, Mei Chen, Zhaozheng Yin, Mike F. Sandbothe, Seungil Huh, Sungeun Eom, Ryoma Bise, Elvira Osuna-Highley, Takeo Kanade, Phil Gordon Campbell Nov 2011

An Engineered Approach To Stem Cell Culture: Automating The Decision Process For Real-Time Adaptive Subculture Of Stem Cells, Dai Fei Elmer Ker, Lee E. Weiss, Silvina N. Junkers, Mei Chen, Zhaozheng Yin, Mike F. Sandbothe, Seungil Huh, Sungeun Eom, Ryoma Bise, Elvira Osuna-Highley, Takeo Kanade, Phil Gordon Campbell

Computer Science Faculty Research & Creative Works

Current cell culture practices are dependent upon human operators and remain laborious and highly subjective, resulting in large variations and inconsistent outcomes, especially when using visual assessments of cell confluency to determine the appropriate time to subculture cells. Although efforts to automate cell culture with robotic systems are underway, the majority of such systems still require human intervention to determine when to subculture. Thus, it is necessary to accurately and objectively determine the appropriate time for cell passaging. Optimal stem cell culturing that maintains cell pluripotency while maximizing cell yields will be especially important for efficient, cost-effective stem cell-based therapies. …

Go to article

Paim: Peer-Based Automobile Identity Management In Vehicular Ad-Hoc Network, Anna Squicciarini, Dan Lin, Alessandro Mancarella Nov 2011

Paim: Peer-Based Automobile Identity Management In Vehicular Ad-Hoc Network, Anna Squicciarini, Dan Lin, Alessandro Mancarella

Computer Science Faculty Research & Creative Works

The emerging Vehicular Ad-hoc Network (VANET) technology will enable many exciting applications such as vehicular safety assistance and mobile entertainment. One of the key challenges toward successful roll-out of VANET applications is to provide security and privacy preserving mechanisms for users. Existing efforts on this topic rely heavily on infrastructure like road-side units which however are not available everywhere. to minimize the dependence on infrastructure, we propose a novel Peer-Based Automobile Identity Management (PAIM) Framework which is mainly based on vehicle-to-vehicle communication. PAIM supports dynamic event-Based moving zones formed by vehicles sharing common interest. PAIM achieves the level of privacy …

Go to article

Decentralized Optimal Control Of A Class Of Interconnected Nonlinear Discrete-Time Systems By Using Online Hamilton-Jacobi-Bellman Formulation, Shahab Mehraeen, Sarangapani Jagannathan Nov 2011

Decentralized Optimal Control Of A Class Of Interconnected Nonlinear Discrete-Time Systems By Using Online Hamilton-Jacobi-Bellman Formulation, Shahab Mehraeen, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, the direct neural dynamic programming technique is utilized to solve the Hamilton-Jacobi-Bellman equation forward-in-time for the decentralized near optimal regulation of a class of nonlinear interconnected discrete-time systems with unknown internal subsystem and interconnection dynamics, while the input gain matrix is considered known. Even though the unknown interconnection terms are considered weak and functions of the entire state vector, the decentralized control is attempted under the assumption that only the local state vector is measurable. the decentralized nearly optimal controller design for each subsystem consists of two neural networks (NNs), an action NN that is aimed to …

Go to article

Promoting Distributed Accountability In The Cloud, Smitha Sundareswaran, Anna Squicciarini, Dan Lin, Shuo Huang Sep 2011

Promoting Distributed Accountability In The Cloud, Smitha Sundareswaran, Anna Squicciarini, Dan Lin, Shuo Huang

Computer Science Faculty Research & Creative Works

Cloud computing enables highly scalable services to be easily consumed over the Internet on an as-needed basis. a major feature of the cloud services is that users' data is usually processed remotely in unknown machines that users do not own or operate. While enjoying the convenience brought by this new emerging technology, users' fears of losing control of their own data (particularly financial and health data) can become a significant barrier to the wide adoption of cloud services. to address this problem, in this paper, we propose a novel highly decentralized information accountability framework to keep track of the actual …

Go to article

Roar: A Reference Ontology For Anatomical Relations, Alton B. Coalter, Jennifer L. Leopold Sep 2011

Roar: A Reference Ontology For Anatomical Relations, Alton B. Coalter, Jennifer L. Leopold

Computer Science Faculty Research & Creative Works

The ontology has become a useful model for organizing knowledge. This is particularly true in the field of biomedicine, where individual ontologies have been created for specific data domains ranging from genomics through species morphologies to human anatomical reference ontologies. Although specific sets of relationships have been proposed to improve the accuracy and consistency of such ontologies, there has been little to nothing proposed concerning the organization of those relationships. to help address this deficiency, herein we present a Reference Ontology of Anatomical Relations (ROAR). ROAR extends the concepts used in existing biomedical ontologies by defining and hierarchically organizing temporal, …

Go to article

Security Requirements Analysis, Specification, Prioritization And Policy Development In Cyber-Physical Systems, Kenneth Kofi Fletcher, Xiaoqing Liu Sep 2011

Security Requirements Analysis, Specification, Prioritization And Policy Development In Cyber-Physical Systems, Kenneth Kofi Fletcher, Xiaoqing Liu

Computer Science Faculty Research & Creative Works

In recent past, the security of cyber-physical systems (CPSs) has been the subject of major concern. One of the reasons is that CPSs are often applied to mission-critical processes. Also, the automation CPSs bring in managing physical processes, and the detail of information available to them for carrying out their tasks, make securing them a prime importance. Securing CPSs is a difficult task as systems are interconnected. in order to achieve a continuous secured CPS environment, there is the need for an integrated methodology to analyze, specify and prioritize security requirements and also to develop policies to meet them. First, …

Go to article

Near Optimal Control Of Mobile Robot Formations, Travis Dierks, Bryan Brenner, S. Jagannathan Sep 2011

Near Optimal Control Of Mobile Robot Formations, Travis Dierks, Bryan Brenner, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, the infinite horizon optimal tracking control problem is solved online and forward-in-time for leader-follower based formation control of nonholonomic mobile robots. using the backstepping design approach, the dynamical controller inputs for the robots are approximated from nonlinear optimal control techniques in order to track the control velocities designed to keep the formation. the proposed nonlinear optimal control technique, referred to as adaptive dynamic programming, uses neural networks (NN's) to solve the optimal formation control problem in discrete-time in the presence of unknown internal dynamics and a known control coefficient matrix. All NN's are tuned online using novel …

Go to article

Cross-Layer Throughput Optimization With Power Control In Sensor Networks, Maggie Xiaoyan Cheng, Xuan Gong, Lin Cai, Xiaohua Jia Sep 2011

Cross-Layer Throughput Optimization With Power Control In Sensor Networks, Maggie Xiaoyan Cheng, Xuan Gong, Lin Cai, Xiaohua Jia

Computer Science Faculty Research & Creative Works

In wireless sensor networks, transmission power has a significant impact on network throughput as wireless interference increases with transmission power, and interference negatively impacts the network throughput. in this paper, we try to improve the network throughput through cross-layer optimization. We first present two algorithms to compute the transmission power of each node with the objectives of minimizing the total transmission power and minimizing the total interference, respectively, from which we can obtain a network topology that ensures a connected path from each source to the sink; then, we compute the maximum achievable throughput from the obtained topology by using …

Go to article

Providing End-To-End Secure Communications In Wireless Sensor Networks, Wenjun Gu, Neelanjana Dutta, Sriram Chellappan, Xiaole Bai Sep 2011

Providing End-To-End Secure Communications In Wireless Sensor Networks, Wenjun Gu, Neelanjana Dutta, Sriram Chellappan, Xiaole Bai

Computer Science Faculty Research & Creative Works

In many Wireless Sensor Networks (WSNs), providing end to end secure communications between sensors and the sink is important for secure network management. While there have been many works devoted to hop by hop secure communications, the issue of end-to-end secure communications is largely ignored. in this paper, we design an end-to-end secure communication protocol in randomly deployed WSNs. Specifically, our protocol is based on a methodology called differentiated key pre-distribution. the core idea is to distribute different number of keys to different sensors to enhance the resilience of certain links. This feature is leveraged during routing, where nodes route …

Go to article

A Trustworthiness Fusion Model For Service Cloud Platform Based On D-S Evidence Theory, Rong Hu, Jianxun Liu, Xiaoqing Frank Liu Aug 2011

A Trustworthiness Fusion Model For Service Cloud Platform Based On D-S Evidence Theory, Rong Hu, Jianxun Liu, Xiaoqing Frank Liu

Computer Science Faculty Research & Creative Works

Trustworthiness plays an important role in service selection and usage. However, it is not easy to define and compute the service trustworthiness because of its subject meaning and also the different views on it. in this paper, we describe the meaning of trustworthiness and the computation method for trustworthiness fusion. through extracting trustworthiness from service provider, service requestor and service broker, we creatively adopted D-S (Dempster-Shafer) evident theory to fuse the tripartite trustworthiness. Finally, we completed some comparison experiments on our web service supermarket platform and certified the efficiency of our method. © 2011 IEEE.

Go to article

Special Issue On Approximate Dynamic Programming And Reinforcement Learning, Silvia Ferrari, Jagannathan Sarangapani, Frank L. Lewis Aug 2011

Special Issue On Approximate Dynamic Programming And Reinforcement Learning, Silvia Ferrari, Jagannathan Sarangapani, Frank L. Lewis

Electrical and Computer Engineering Faculty Research & Creative Works

No abstract provided.

Go to article

Online Optimal Control Of Nonlinear Discrete-Time Systems Using Approximate Dynamic Programming, Travis Dierks, Sarangapani Jagannathan Aug 2011

Online Optimal Control Of Nonlinear Discrete-Time Systems Using Approximate Dynamic Programming, Travis Dierks, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, the optimal control of a class of general affine nonlinear discrete-time (DT) systems is undertaken by solving the Hamilton Jacobi-Bellman (HJB) equation online and forward in time. the proposed approach, referred normally as adaptive or approximate dynamic programming (ADP), uses online approximators (OLAs) to solve the infinite horizon optimal regulation and tracking control problems for affine nonlinear DT systems in the presence of unknown internal dynamics. Both the regulation and tracking controllers are designed using OLAs to obtain the optimal feedback control signal and its associated cost function. Additionally, the tracking controller design entails a feedforward portion …

Go to article

Dsg-N²: A Group-Based Social Routing Algorithm, Roy Cabaniss, James M. Bridges, Andrew Wilson, Sanjay Madria Jun 2011

Dsg-N²: A Group-Based Social Routing Algorithm, Roy Cabaniss, James M. Bridges, Andrew Wilson, Sanjay Madria

Computer Science Faculty Research & Creative Works

Devices in a mobile ad-hoc environment can follow different movement patterns based on the application environment. Some environments, such as mass transit systems, follow regular and predictable patterns. Others, such as an aerial monitoring network, generally follow random paths. Optimal routing schemes tend to take advantage of information regarding movement patterns available in social interaction domains. in a social environment like wildlife tracking or monitoring socio-human interactions, the devices and/or users will follow regular contact habits, tending to encounter social groups in which they participate. in this paper, by dynamically identifying these groups, the patterns are used to speed routing …

Go to article

Localization Of Objects Using Stochastic Tunneling, Mohammed Rana Basheer, Sarangapani Jagannathan Jun 2011

Localization Of Objects Using Stochastic Tunneling, Mohammed Rana Basheer, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a novel wireless localization scheme in the three-dimensional domain that employs stochastic optimization with tunneling transformation to recursively estimate the location of wireless tags in a network from pair wise signal strength measurements. Spatially co-located wireless tags, receiving signals from a common transmitter, exhibit correlation in their Received Signal Strength Indicator (RSSI) values. Hence in a network of wireless tags, with pair wise correlation coefficients available, posterior distribution of the unknown tag separation is used to relatively localize them using maximum a posteriori (MAP) Estimator. However, due to the non-convex/non-tractable nature of this posterior distribution, deterministic optimization …

Go to article

K-Out-Of-N Oblivious Transfer Based On Homomorphic Encryption And Solvability Of Linear Equations, Mummoorthy Murugesan, Wei Jiang, Ahmet Erhan Nergiz, Serkan Uzunbaz Mar 2011

K-Out-Of-N Oblivious Transfer Based On Homomorphic Encryption And Solvability Of Linear Equations, Mummoorthy Murugesan, Wei Jiang, Ahmet Erhan Nergiz, Serkan Uzunbaz

Computer Science Faculty Research & Creative Works

Oblivious Transfer (OT) is an important cryptographic tool, which has found its usage in many crypto protocols, such as Secure Multiparty Computations, Certified E-mail and Simultaneous Contract Signing. in this paper, we propose three k-out-of-n OT (OTkn) protocols based on additive homomorphic encryption. Two of these protocols prohibit malicious behaviors from a receiver. We also achieve efficient communication complexity bounded by O(l·n) in bits, where l is the size of the encryption key. the computational complexity is comparable to the most efficient existing protocols. Due to the semantic security property, the sender cannot get receiver's selection. When the receiver tries …

Go to article

A3p: Adaptive Policy Prediction For Shared Images Over Popular Content Sharing Sites, Anna Squicciarini, Smitha Sundareswaran, Dan Lin, Josh Wede Jan 2011

A3p: Adaptive Policy Prediction For Shared Images Over Popular Content Sharing Sites, Anna Squicciarini, Smitha Sundareswaran, Dan Lin, Josh Wede

Computer Science Faculty Research & Creative Works

More and more people go online today and share their personal images using popular web services like Picasa. While enjoying the convenience brought by advanced technology, people also become aware of the privacy issues of data being shared. Recent studies have highlighted that people expect more tools to allow them to regain control over their privacy. in this work, we propose an Adaptive Privacy Policy Prediction (A3P) system to help users compose privacy settings for their images. in particular, we examine the role of image content and metadata as possible indicators of users' privacy preferences. We propose a two-level image …

Go to article

First Prev Next Last