Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Image segmentation (2)
- Neighborhood sets (2)
- Outlier detection (2)
- Ranking (2)
- Wyner's common information (2)
-
- ANSYS (1)
- Access control (1)
- Affine bias mode (1)
- Ansoft HFSS (1)
- Caching (1)
- Circularly symmetric binary source (1)
- Clustering (1)
- Code restructuring (1)
- Cognitive radio (1)
- Continuous random variables (1)
- Cramér–Rao bound (1)
- Dictation Speech Recognition (1)
- Distributed Fault Mitigation (1)
- Distributed Real-time System (1)
- Distribution approximation (1)
- Extract class (1)
- Fault-tolerance (1)
- Finite-element method (1)
- Gaussian random variables (1)
- Graph theory (1)
- Gray-Wyner source coding network (1)
- Human visual system (1)
- Just-noticeable difference (1)
- Keyword Spotting Recognition (1)
- Lossy source coding (1)
- Publication
- Publication Type
Articles 1 - 14 of 14
Full-Text Articles in Physical Sciences and Mathematics
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 Distributed Approach For Fault Mitigation In Large Scale Distributed Systems, Mina Jung
A Distributed Approach For Fault Mitigation In Large Scale Distributed Systems, Mina Jung
Electrical Engineering and Computer Science - Dissertations
In a large scale real-time distributed system, a large number of components and the time criticality of tasks can contribute to complex situations. Providing predictable and reliable service is a paramount interest in such a system. For example, a single point failure in an electric grid system may lead to a widespread power outage like the Northeast Blackout of 2003. System design and implementation address fault avoidance and mitigation. However, not all faults and failures can be removed during these phases, and therefore run-time fault avoidance and mitigation are needed during the operation. Timing constraints and predictability of the system …
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 …
Reference Set Metrics For Multi-Objective Algorithms, Chilukuri K. Mohan, Kishan Mehrotra
Reference Set Metrics For Multi-Objective Algorithms, Chilukuri K. Mohan, Kishan Mehrotra
Electrical Engineering and Computer Science - All Scholarship
Several metrics and indicators have been suggested in the past to evaluate multi-objective evolutionary and non-evolutionary algo- rithms. However, these metrics are known to have many problems that make their application sometimes unsound, and sometimes infeasible. This paper proposes a new approach, in which metrics are parameter- ized with respect to a reference set, on which depend the properties of any metric.