Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algorithms (11)
- Codes (8)
- Logic programming (8)
- Logic (7)
- Neural networks (6)
-
- Semantics (6)
- Programming (5)
- Parallel algorithms (4)
- Parallel computing (4)
- Deadlock detection (3)
- Decoding (3)
- Reasoning (3)
- Simulated annealing (3)
- Sorting (3)
- Static analysis (3)
- Block codes (2)
- Combinational circuits (2)
- Communicating agents (2)
- Concurrent programming (2)
- Concurrent programs (2)
- Data allocation (2)
- Data partitioning (2)
- Decision trees (2)
- Fast Fourier transform (2)
- Formal verification (2)
- Generic algorithms (2)
- Genetic algorithms (2)
- Householder reduction (2)
- Hypercube (2)
- ISR-PRAM (2)
Articles 1 - 30 of 178
Full-Text Articles in Physical Sciences and Mathematics
Liboblivious: A C++ Library For Oblivious Data Structures And Algorithms, Scott D. Constable, Steve Chapin
Liboblivious: A C++ Library For Oblivious Data Structures And Algorithms, Scott D. Constable, Steve Chapin
Electrical Engineering and Computer Science - Technical Reports
Infrastructure as a service (IaaS) is an enormously beneficial model for centralized data computation and storage. Yet, existing network-layer and hardware-layer security protections do not address a broad category of vulnerabilities known as side-channel attacks. Over the past several years, numerous techniques have been proposed at all layers of the software/hardware stack to prevent the inadvertent leakage of sensitive data. This report discusses a new technique which integrates seamlessly with C++ programs. We introduce a library, libOblivious, which provides thin wrappers around existing C++ standard template library classes, endowing them with the property of memory-trace obliviousness.
Formal Verification Of A Modern Boot Loader, Scott D. Constable, Rob Sutton, Arash Sahebolamri, Steve Chapin
Formal Verification Of A Modern Boot Loader, Scott D. Constable, Rob Sutton, Arash Sahebolamri, Steve Chapin
Electrical Engineering and Computer Science - Technical Reports
We introduce the Syracuse Assured Boot Loader Executive (SABLE), a trustworthy secure loader. A trusted boot loader performs a cryptographic measurement (hash) of program code and executes it unconditionally, allowing later-stage software to verify the integrity of the system through local or remote attestation. A secure loader differs from a trusted loader in that it executes subsequent code only if measurements of that code match known-good values. We have applied a rigorous formal verification technique recently demonstrated in practice by NICTA in their verification of the seL4 microkernel. We summarize our design philosophy from a high level and present our …
A Formally Verified Heap Allocator, Arash Sahebolamri, Scott D. Constable, Steve J. Chapin
A Formally Verified Heap Allocator, Arash Sahebolamri, Scott D. Constable, Steve J. Chapin
Electrical Engineering and Computer Science - Technical Reports
We present the formal verification of a heap allocator written in C. We use the Isabelle/HOL proof assistant to formally verify the correctness of the heap allocator at the source code level. The C source code of the heap allocator is imported into Isabelle/HOL using CParser and AutoCorres. In addition to providing the guarantee that the heap allocator is free of bugs and therefore is suitable for use in security critical projects, our work facilitates verification of other projects written in C that utilize Isabelle and AutoCorres.
Single Eye Or Camera With Depth Perception, Philipp Kornreich, Bart Farell
Single Eye Or Camera With Depth Perception, Philipp Kornreich, Bart Farell
Electrical Engineering and Computer Science - Technical Reports
An imager that can measure the distance from each pixel to the point on the object that is in focus at the pixel is described here. This is accomplished by the use of short lightguide sections combined with each pixel light sensor. In the eye the rods and cones are the fiber like lightguide sections. The lens selects the object point who’s range is to be determined at the particular pixel. The lens reproduces the light pattern of the object point at the image point with the addition of a phase proportional to the distance from object point to image …
Identifying And Analyzing Pointer Misuses For Sophisticated Memory-Corruption Exploit Diagnosis, Mingwei Zhang, Aravind Prakash, Xiaolei Li, Zhenkai Liang, Heng Yin
Identifying And Analyzing Pointer Misuses For Sophisticated Memory-Corruption Exploit Diagnosis, Mingwei Zhang, Aravind Prakash, Xiaolei Li, Zhenkai Liang, Heng Yin
Electrical Engineering and Computer Science - Technical Reports
Software exploits are one of the major threats to internet security. To quickly respond to these attacks, it is critical to automatically diagnose such exploits and find out how they circumvent existing defense mechanisms.
Outlier Detection Using Modified-Ranks And Other Variants, Huaming Huang, Kishan Mehrotra, Chilukuri K. Mohan
Outlier Detection Using Modified-Ranks And Other Variants, Huaming Huang, Kishan Mehrotra, Chilukuri K. Mohan
Electrical Engineering and Computer Science - Technical Reports
Rank based algorithms provide a promising approach for outlier detection, but currently used rank-based measures of outlier detection suffer from two deficiencies: first they take a large value from an object whose density is high even though the object may not be an outlier and second the distance between the object and its nearest cluster plays a mild role though its rank with respect to its neighbor. To correct for these deficiencies we introduce the concept of modified-rank and propose new algorithms for outlier detection based on this concept.
A New Cohesion Metric And Restructuring Technique For Object Oriented Paradigm, Mehmet Kaya, Jim Fawcett
A New Cohesion Metric And Restructuring Technique For Object Oriented Paradigm, Mehmet Kaya, Jim Fawcett
Electrical Engineering and Computer Science - Technical Reports
When software systems grow large during maintenance, they may lose their quality and become complex to read, understood and maintained. Developing a software system usually requires teams of developers working in concert to provide a finished product in a reasonable amount of time. What that means is many people may read each component of the software system such as a class in object oriented programming environment.
Exploring Non-Typical Memcache Architectures For Decreased Latency And Distributed Network Usage., Paul G. Talaga, Steve J. Chapin
Exploring Non-Typical Memcache Architectures For Decreased Latency And Distributed Network Usage., Paul G. Talaga, Steve J. Chapin
Electrical Engineering and Computer Science - Technical Reports
Memcache is a distributed in-memory data store designed to reduce database load for web applications by caching frequently used data across multiple machines. While memcache already offers excellent performance, we explore how data-locality can increase performance under certain environments and workloads.
Scuta: A Server-Side Access Control System For Web Applications, Xi Tan, Wenliang Du, Tongbo Luo, Karthick Jayaraman
Scuta: A Server-Side Access Control System For Web Applications, Xi Tan, Wenliang Du, Tongbo Luo, Karthick Jayaraman
Electrical Engineering and Computer Science - Technical Reports
The Web is playing a very important role in our lives, and is becoming an essential element of the computing infrastructure. Unfortunately, its importance makes it the preferred target of attacks. Web-based vulnerabilities now outnumber traditional computer security concerns. A recent study shows that over 80 percent of web sites have had at least one serious vulnerability. We believe that the Web’s problems, to a large degree, are caused by the inadequacy of its underlying access control systems. To reduce the number of vulnerabilities, it is essential to provide web applications with better access control models that can adequately address …
Electromagnetic-Thermal Analysis Study Based On Hfss-Ansys Link, Mahmoud El Sabbagh
Electromagnetic-Thermal Analysis Study Based On Hfss-Ansys Link, Mahmoud El Sabbagh
Electrical Engineering and Computer Science - Technical Reports
In this work, rigorous thermal analysis is done for the first time based on the link between Ansoft HFSS and ANSYS. High-frequency results obtained from HFSS including surface loss density and volume loss density are imported into ANSYS. The thermal analysis run into ANSYS incorporates accurately the non-uniform power distribution in the microwave structure and hence predicts very well the thermal map for high-power applications. Experimental results confirm the developed approach.
Wyner’S Common Information For Continuous Random Variables - A Lossy Source Coding Interpretation, Ge Xu, Wei Liu, Biao Chen
Wyner’S Common Information For Continuous Random Variables - A Lossy Source Coding Interpretation, Ge Xu, Wei Liu, Biao Chen
Electrical Engineering and Computer Science - Technical Reports
Wyner’s common information can be easily generalized for continuous random variables. We provide an operational meaning for such generalization using the Gray-Wyner network with lossy source coding. Specifically, a Gray-Wyner network consists of one encoder and two decoders. A sequence of independent copies of a pair of random variables (X, Y ) ~ p(x, y) is encoded into three messages, one of them is a common input to both decoders. The two decoders attempt to reconstruct the two sequences respectively subject to individual distortion constraints. We show that Wyner’s common information equals the smallest common message rate when the total …
The Common Information For N Dependent Random Variables, Wei Liu, Ge Xu
The Common Information For N Dependent Random Variables, Wei Liu, Ge Xu
Electrical Engineering and Computer Science - Technical Reports
This paper generalizes Wyner’s definition of common information of a pair or random variables to that of N random variables. We prove coding theorems that show the same operational meanings for the common information of two random variables generalize to that of N random variables. As a byproduct of our proof, we show that the Gray-Wyner source coding network can be generalized to N source sequences with N decoders. We also establish a monotone property of Wyner’s common information which is in contrast to other notions of the common information, specifically Shannon’s mutual information and Gács and Körner’s common randomness. …
A Human Visual System-Driven Image Segmentation Algorithm, Renbin Peng, Pramod Varshney
A Human Visual System-Driven Image Segmentation Algorithm, Renbin Peng, Pramod Varshney
Electrical Engineering and Computer Science - Technical Reports
This paper presents a novel image segmentation algorithm driven by human visual system (HVS) properties. Quality metrics for evaluating the segmentation result, from both region-based and boundary-based perspectives, are integrated into an objective function. The objective function encodes the HVS properties into a Markov random fields (MRF) framework, where the just-noticeable difference (JND) model is employed when calculating the difference between the image contents. Experiments are carried out to compare the performances of three variations of the presented algorithm and several representative segmentation algorithms available in the literature. Results are very encouraging and show that the presented algorithms outperform the …
Rank-Based Outlier Detection, H. Huang, Kishan Mehrotra, Chilukuri K. Mohan
Rank-Based Outlier Detection, H. Huang, Kishan Mehrotra, Chilukuri K. Mohan
Electrical Engineering and Computer Science - Technical Reports
We propose a new approach for outlier detection, based on a new ranking measure that focuses on the question of whether a point is “important” for its nearest neighbors; using our notations low cumulative rank implies the point is central. For instance, a point centrally located in a cluster has relatively low cumulative sum of ranks because it is among the nearest neighbors of its own nearest neighbors. But a point at the periphery of a cluster has high cumulative sum of ranks because its nearest neighbors are closer to the points. Use of ranks eliminates the problem of density …
Voice Commands To Control Recording Sessions, J. Marty Goddard
Voice Commands To Control Recording Sessions, J. Marty Goddard
Electrical Engineering and Computer Science - Technical Reports
In this report, the music recording workflow is described, with support for voice commands. Natural command grammars are proposed, allowing the user to name items, and issue commands on items identified by name. Recognition accuracy is examined within the contexts of single-phrase commands, and of versatile command grammars which enable the referring to items by name.
Performance Limit Of Image Segmentation Algorithms, Renbin Peng, Pramod Varshney
Performance Limit Of Image Segmentation Algorithms, Renbin Peng, Pramod Varshney
Electrical Engineering and Computer Science - Technical Reports
Image segmentation is a very important step in image analysis, and performance evaluation of segmentation algorithms plays a key role both in developing efficient algorithms and in selecting suitable methods for the given tasks. Although a number of publications have appeared on segmentation methodology and segmentation performance evaluation, little attention has been given to statistically bounding the performance of image segmentation algorithms. In this paper, a modified Cramér–Rao bound combined with the Affine bias model is employed to determine the performance limit of image segmentation algorithms. A fuzzy segmentation formulation is considered, of which hard segmentation is a special case. …
Polarity-Coincidence-Array Based Spectrum Sensing For Multiple Antenna Cognitive Radios In The Presence Of Non-Gaussian Noise, Thakshila Wimalajeewa, Pramod Varshney
Polarity-Coincidence-Array Based Spectrum Sensing For Multiple Antenna Cognitive Radios In The Presence Of Non-Gaussian Noise, Thakshila Wimalajeewa, Pramod Varshney
Electrical Engineering and Computer Science - Technical Reports
One of the main requirements of the cognitive radio (CR) systems is the ability to perform spectrum sensing in a reliable manner in challenging environments that arise due to propagation channels which undergo multipath fading and non-Gaussian noise. While most existing literature on spectrum sensing has focused on impairments introduced by additive white Gaussian noise (AWGN), this assumption fails to model the behavior of certain types of noise in practice. In this paper, the use of a non-parametric and easily implementable detection device, namely polarity-coincidence-array (PCA) detector, is proposed for the detection of weak primary signals with a cognitive radio …
Efficient Heuristic Search Algorithms For Soft-Decision Decoding Of Linear Block Codes, Ching-Cheng Shih, C. R. Wulff, Carlos R.P. Hartmann, Chilukuri K. Mohan
Efficient Heuristic Search Algorithms For Soft-Decision Decoding Of Linear Block Codes, Ching-Cheng Shih, C. R. Wulff, Carlos R.P. Hartmann, Chilukuri K. Mohan
Electrical Engineering and Computer Science - Technical Reports
This paper deals with maximum-likelihood soft-decision decoding as well as suboptimal soft-decision decoding of linear block codes. In this paper we present a novel and efficient hybrid decoding algorithm for (n, k) linear block codes. This algorithm consists of three new decoding algorithms: M A*, H*, and Directed Search. It hybridizes these three algorithms to take advantage of their strengths and make the decoding more efficient. The first algorithm, M A*, is a modified Algorithm A* that conducts a heuristic search through a code tree of the transmitted code when the decoding problem is transformed into a problem of graph-search …
Probabilistic Analysis Of The Median Rule: Asymptotics And Applications, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Probabilistic Analysis Of The Median Rule: Asymptotics And Applications, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
The solution of integer optimization problems by relaxation methods consists of three parts. First, the discrete problem is converted into a continuous optimization problem, which is generally more tractable. Second, the relaxed problem is solved efficiently, yielding a optimal solution in the continuous space. Finally, an assignment procedure is used to map this solution to a "suitable" discrete solution. One heuristic - we call it the relaxation heuristic - that often guides the choice and design of assignment algorithms is: "given a continuous optimal solution, the corresponding integer optimal solution is likely to be nearby" (with respect to some well …
Unsupervised Algorithms For Learning Emergent Spatio-Temporal Correlations, Chaitanya Tumuluri
Unsupervised Algorithms For Learning Emergent Spatio-Temporal Correlations, Chaitanya Tumuluri
Electrical Engineering and Computer Science - Technical Reports
Many applications require the extraction of spatiotemporal correlations among dynamically emergent features of non-stationary distributions. In such applications it is not possible to obtain an a priori analytical characterization of the emergent distribution. This paper extends the Growing Cell Structures (GCS) network and presents two novel (GIST and GEST) networks, which combine unsupervised feature-extraction and Hebbian learning, for tracking such emergent correlations. The networks were successfully tested on the challenging Data Mapping problem, using an execution driven simulation of their implementation in hardware. The results of the simulations show the successful use of the GIST and GEST networks for extracting …
Simulations Between Programs As Cellular Automata, Howard A. Blair, Fred Dushin, Polar Humenn
Simulations Between Programs As Cellular Automata, Howard A. Blair, Fred Dushin, Polar Humenn
Electrical Engineering and Computer Science - Technical Reports
We present cellular automata on appropriate digraphs and show that any covered normal logic program is a cellular automaton. Seeing programs as cellular automata shifts attention from classes of Herbrand models to orbits of Herbrand interpretations. Orbits capture both the declarative, model-theoretic meaning of programs as well as their inferential behavior. Logically and intentionally different programs can produce orbits that simulate each other. Simple examples of such behavior are compellingly exhibited with space-time diagrams of the programs as cellular automata. Construing a program as a cellular automaton leads to a general method for simulating any covered program with a Horn …
Designing Dependencies, Howard A. Blair
Designing Dependencies, Howard A. Blair
Electrical Engineering and Computer Science - Technical Reports
Given a binary recursively enumerable relation R, one or more logic programs over a language L can be constructed and interconnected to produce a dependency relation D on selected predicates within the Herbrand base BL of L isomorphic to R. D can be, optionally, a positive, negative or mixed dependency relation. The construction is applied to representing any effective game of the type introduced by Gurevich and Harrington, which they used to prove Rabin's decision method for S2S, as the dependency relation of a logic program. We allow games over an infinite alphabet of possible moves. We use this representation …
Using Passion System On Lu Factorization, Haluk Rahmi Topcuoglu, Alok Choudhary
Using Passion System On Lu Factorization, Haluk Rahmi Topcuoglu, Alok Choudhary
Electrical Engineering and Computer Science - Technical Reports
Parallel I/0 subsystems are added to massively parallel computers in order to lessen I/0 bottleneck to some extent. Up to now, a few number of parallel software systems have been designed and implemented to assist programmers in I/0 intensive applications; PASSION is one of them. By providing parallel I/0 support at the language, compiler and run-time level, PASSION system explores the large design space of parallel systems. The target of this paper is to show the performance benefits of using PASSION I/0 libraries at runtime in comparison with using conventional parallel I/0 primitives for high performance parallel I/0 in LU …
A Statistical Approach To Mpeg Video Stream Characterization, Kubilay Cardakli
A Statistical Approach To Mpeg Video Stream Characterization, Kubilay Cardakli
Electrical Engineering and Computer Science - Technical Reports
As video consumes a significant percentage of the available network bandwidth, understanding video bandwidth requirements will translate into better network control schemes. In this study, several commercially available video streams are statistically analyzed and several modeling approaches are developed. The segmentation techniques are found to be rewarding. However, the improvements due to complexity of the polynomial models are insignificant.
A Domain-Specific Parallel Programming System Ii. Automatic Data Partitioning, Elaine Wenderholm
A Domain-Specific Parallel Programming System Ii. Automatic Data Partitioning, Elaine Wenderholm
Electrical Engineering and Computer Science - Technical Reports
εm is a high-level programming system which puts parallelism within the reach of scientists who are not sophisticated programmers. εm both restricts and simplifies the programming interface, and thereby eases both the conceptual task of the programmer and the analytical task of the compiler. The εm compiler performs automatic data structure definition, scheduling and data partitioning. This document presents the automatic data partitioning algorithm used in εm.
Weighted Coverings And Packings, G. D. Cohen, Iiro Honkala, S. N. Litsyn, H. F. Mattson Jr
Weighted Coverings And Packings, G. D. Cohen, Iiro Honkala, S. N. Litsyn, H. F. Mattson Jr
Electrical Engineering and Computer Science - Technical Reports
In this paper we introduce a generalization of the concepts of coverings and packings in Hamming space called weighted coverings and packings. This allows us to formulate a number of well-known coding theoretical problems in a uniform manner. We study the existence of perfect weighted codes, discuss connections between weighted coverings and packings, and present many constructions for them.
Semantics Vs. Syntax Vs. Computations Machine Models For Type-2 Polynomial-Time Bounded Functionals (Preliminary Draft), James S. Royer
Semantics Vs. Syntax Vs. Computations Machine Models For Type-2 Polynomial-Time Bounded Functionals (Preliminary Draft), James S. Royer
Electrical Engineering and Computer Science - Technical Reports
This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals, a.k.a. the Mehlhorn-Cook class of type-2 polynomial-time functionals. We develop a direct, polynomial-time analog of effective operation, where the time bound on computations is modeled after Kapron and Cook's scheme for their basic polynomial-time functionals. We show that (i) if P = NP, these polynomial-time effective operations are strictly more powerful on R (the class of recursive functions) than the basic feasible functions, and (ii) there is an oracle relative to which these polynomial-time effective operations and the basic feasible functionals have the …
Multiprocessor Document Allocation: A Neural Network Approach, Abdulaziz Sultan Al-Sehibani, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Multiprocessor Document Allocation: A Neural Network Approach, Abdulaziz Sultan Al-Sehibani, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
We consider the problem of distributing the documents to a given set of processors so that the load on each processor is as equal as possible and the amount of communication is as small as possible. This is an NP-Complete problem. We apply continuous as well as discrete Hopfield neural networks to obtain suboptimal solutions for the problem. These networks perform better than a genetic algorithm for this task proposed by Frieder et al. [4]; in particular, the continuous Hopfield network performs extremely well.
Characterization Of A Class Of Sigmoid Functions With Applications To Neural Networks, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Characterization Of A Class Of Sigmoid Functions With Applications To Neural Networks, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
Sigmoid functions, whose graphs are "S-shaped" curves, appear in a great variety of contexts, such as the transfer functions in many neural networks. Their ubiquity is no accident; these curves are the among the simplest non-linear curves, striking a graceful balance between linear and non-linear behavior.
Covering Radius 1985-1994, G. D. Cohen, S. N. Litsyn, Antoine C. Lobstein, H. F. Mattson Jr
Covering Radius 1985-1994, G. D. Cohen, S. N. Litsyn, Antoine C. Lobstein, H. F. Mattson Jr
Electrical Engineering and Computer Science - Technical Reports
We survey important developments in the theory of covering radius during the period 1985-1994. We present lower bounds, constructions and upper bounds, the linear and nonlinear cases, density and asymptotic results, normality, specific classes of codes, covering radius and dual distance, tables, and open problems.