Computer Engineering Commons^™

Linear Neural Networks Revisited: From Pagerank To Family Happiness, Vladik Kreinovich

Departmental Technical Reports (CS)

The study of Artificial Neural Networks started with the analysis of linear neurons. It was then discovered that networks consisting only of linear neurons cannot describe non-linear phenomena. As a result, most currently used neural networks consist of non-linear neurons. In this paper, we show that in many cases, linear neurons can still be successfully applied. This idea is illustrated by two examples: the PageRank algorithm underlying the successful Google search engine and the analysis of family happiness.

Density-Based Fuzzy Clustering As A First Step To Learning The Rules: Challenges And Possible Solutions, Gözde Ulutagay, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, it is necessary to cluster given situations, i.e., to divide them into groups so that situations within each group are similar to each other. This is how we humans usually make decisions: instead of taking into account all the tiny details of a situation, we classify the situation into one of the few groups, and then make a decision depending on the group containing a given situation. When we have many situations, we can describe the probability density of different situations. In terms of this density, clusters are connected sets with higher density separated by sets …

Measuring Robustness Of Feature Selection Techniques On Software Engineering Datasets, Huanjing Wang, Taghi Khoshgoftaar, Randall Wald

Computer Science Faculty Publications

Feature Selection is a process which identifies irrelevant and redundant features from a high-dimensional dataset (that is, a dataset with many features), and removes these before further analysis is performed. Recently, the robustness (e.g., stability) of feature selection techniques has been studied, to examine the sensitivity of these techniques to changes in their input data. In this study, we investigate the robustness of six commonly used feature selection techniques as the magnitude of change to the datasets and the size of the selected feature subsets are varied. All experiments were conducted on 16 datasets from three real-world software projects. The …

How To Encourage Imperfect Individuals To Care More About Society In General: A Utility-Theory Approach, Vladik Kreinovich

Departmental Technical Reports (CS)

A Simple Physics-Motivated Equivalent Reformulation Of P=Np That Makes This Equality (Slighty) More Plausible, Jaime Nava, Vladik Kreinovich

Departmental Technical Reports (CS)

In our opinion, one of the reasons why the problem P=NP? is so difficult is that while there are good intuitive arguments in favor of P=/=NP, there is a lack of intuitive arguments in favor of P=NP. In this paper, we provide such an argument -- based on the fact that in physics, many dependencies are scale-invariant, their expression does not change if we simply change the unit in which we measure the corresponding input quantity (e.g., replace meters by centimeters). It is reasonable to imagine similar behavior for time complexity t_A(n) of algorithms A: that the form …

How Accurately Should We Write On The Board? When Marking Comments On Student Papers?, Martine Ceberio, Olga Kosheleva

Departmental Technical Reports (CS)

Writing on the board is an important part of a lecture. Lecturers' handwriting is not always perfect. Usually, a lecturer can write slower and more legibly, this will increase understandability but slow down the lecture. In this paper, we analyze an optimal trade-off between speed and legibility.

I-Complexity And Discrete Derivative Of Logarithms: A Symmetry-Based Explanation, Vladik Kreinovich, Jaime Nava

Departmental Technical Reports (CS)

In many practical applications, it is useful to consider Kolmogorov complexity K(s) of a given string s, i.e., the shortest length of a program that generates this string. Since Kolmogorov complexity is, in general, not computable, it is necessary to use computable approximations K_~(s) to K(s). Usually, to describe such an approximations, we take a compression algorithm and use the length of the compressed string as K_~(s). This approximation, however, is not perfect: e.g., for most compression algorithms, adding a single bit to the string $s$ can drastically change the value K_~(s) -- while …

A New Justification For Weighted Average Aggregation In Fuzzy Techniques, Jaime Nava

Departmental Technical Reports (CS)

In many practical situations, we need to decide whether a given solution is good enough, based on the degrees a_i to which different criteria are satisfied. In this paper, we show that natural requirements lead to the weighted average decision, according to which a solution is acceptable if w₁ * a₁ + ... + w_n * a_n > t for some weights w_i and threshold t.

Computation In Quantum Space-Time Could Lead To A Super-Polynomial Speedup, Vladik Kreinovich, Michael Zakharevich

Departmental Technical Reports (CS)

How To Tell When A Product Of Two Partially Ordered Spaces Has A Certain Property?, Francisco Zapata, Olga Kosheleva, Karen Villaverde

Departmental Technical Reports (CS)

In this paper, we describe how checking whether a givenproperty F is true for a product A₁ X A₂ of partiallyordered spaces can be reduced to checking several relatedproperties of the original spaces A_i.

This result can be useful in the analysis of propertiesof intervals [a,b] = {x: a <= x <= b}over general partially ordered spaces -- such as the spaceof all vectors with component-wise order or the set of allfunctions with component-wise ordering f <= g <-->for all x (f(x) <= g(x)). When we consider sets of pairs ofsuch objects A₁ X A₂, it is natural to define the orderon this set in terms of orders in A₁ and A₂ -- this is, e.g.,how ordering and intervals are defined on the set R² of all2-D vectors.

This result …

A Cross-Layer Design For The Performance Improvement Of Real-Time Video Transmission Of Secondary Users Over Cognitive Radio Networks, Haiyan Luo, Song Ci, Dalei Wu

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

Cognitive radio (CR) has been proposed as a promising solution to improve connectivity, self-adaptability, and efficiency of spectrum usage. When used in video applications, user-perceived video quality experienced by secondary users is a very important performance metric to evaluate the effectiveness of CR technologies. However, most of the current research only considers spectrum utilization and effectiveness at medium access control (MAC) and physical layers, ignoring the system performance of the upper layers. Therefore, in this paper, we aim to improve the user experience of secondary users for wireless video services over CR networks. We propose a quality-driven cross-layer optimized system …

An Investigation Into Segmenting Traffic Images Using Various Types Of Graph Cuts, Jonathan Dinger

All Theses

In computer vision, graph cuts are a way of segmenting an image into multiple areas. Graphs are built using one node for each pixel in the image combined with two extra nodes, known as the source and the sink. Each node is connected to several other nodes using edges, and each edge has a specific weight. Using different weighting schemes, different segmentations can be performed based on the properties used to create the weights. The cuts themselves are performed using an implementation of a solution to the maximum flow problem, which is then changed into a minimum cut according to …

Dynamics And Control Of The Shoot-The-Moon Tabletop Game, Peng Xu

All Theses

The classic table-top game Shoot-the-Moon has interesting dynamics despite its simple structure, consisting of a steel ball rolling on two cylindrical rods. The two sloped rods are hinged at the lower ends and allowed to freely slide in a slot at the higher end. The ball can amazingly roll upward along the rods under carefully manipulation of the rods. There is also an interaction between ball rotation and translation that cause the ball to ``shoot'' (quickly accelerate).
In this thesis, the kinematics are developed for Shoot-the-Moon and then equations of motion are derived using both Lagrangian and Newtonian approaches. The …

Full Custom Vlsi Design Of On-Line Stability Checkers, Chris Y. Lee

Master's Theses

A stability checker is a clocked storage element, much like a flip-flop, which detects unstable and late signals in the pipeline of a digital system. The On-line stability checker operates concurrently with its associated circuit-under-test (CUT). This thesis describes the full custom very-large-scale integration (VLSI) design and testing process of On-Line Stability Checkers. The goals of this thesis are to construct and test Stability Checker designs, and to create a design template for future class projects in the EE 431 Computer-Aided Design (CAD) of VLSI Devices course at Cal Poly.

A method for concurrent fault testing called On-line Stability Checking …

Classification For Mass Spectra And Comprehensive Two-Dimensional Chromatograms, Xue Tian

School of Computing: Dissertations, Theses, and Student Research

Mass spectra contain characteristic information regarding the molecular structure and properties of compounds. The mass spectra of compounds from the same chemically related group are similar. Classification is one of the fundamental methodologies for analyzing mass spectral data. The primary goals of classification are to automatically group compounds based on their mass spectra, to find correlation between the properties of compounds and their mass spectra, and to provide a positive identification of unknown compounds.

This dissertation presents a new algorithm for the classification of mass spectra, the most similar neighbor with a probability-based spectrum similarity measure (MSN-PSSM). Experimental results demonstrate …

On The Complexity Of Grid Coloring, Daniel Christopher Apon

Graduate Theses and Dissertations

This thesis studies problems at the intersection of Ramsey-theoretic mathematics, computational complexity, and communication complexity. The prototypical example of such a problem is Monochromatic-Rectangle-Free Grid Coloring. In an instance of Monochromatic-Rectangle-Free Grid Coloring, we are given a chessboard-like grid graph of dimensions n and m, where the vertices of the graph correspond to squares in the chessboard, and a number of allowed colors, c. The goal is to assign one of the allowed colors to each vertex of the grid graph so that no four vertices arranged in an axis-parallel rectangle are colored monochromatically. Our results include: 1. A conditional, …

Reliable Ethernet, Aleksandr Movsesyan

Master's Theses

Networks within data centers, such as connections between servers and disk arrays, need lossless flow control allowing all packets to move quickly through the network to reach their destination. This paper proposes a new algorithm for congestion control to satisfy the needs of such networks and to answer the question: Is it possible to provide circuit-less reliability and flow control in an Ethernet network? TCP uses an end-to-end congestion control algorithm, which is based on end-to-end round trip time (RTT). Therefore its flow control and error detection/correction approach is dependent on end-to-end RTT. Other approaches utilize specialized data link layer …

Stereoscopic Vision In Vehicle Navigation., Behnoush Abdollahi 1986-

Electronic Theses and Dissertations

Traffic sign (TS) detection and tracking is one of the main tasks of an autonomous vehicle which is addressed in the field of computer vision. An autonomous vehicle must have vision based recognition of the road to follow the rules like every other vehicle on the road. Besides, TS detection and tracking can be used to give feedbacks to the driver. This can significantly increase safety in making driving decisions. For a successful TS detection and tracking changes in weather and lighting conditions should be considered. Also, the camera is in motion, which results in image distortion and motion blur. …

File System Simulation: Hierarchical Performance Measurement And Modeling, Hai Quang Nguyen

Graduate Theses and Dissertations

File systems are very important components in a computer system. File system simulation can help to predict the performance of new system designs. It offers the advantages of the flexibility of modeling and the cost and time savings of utilizing simulation instead of full implementation. Being able to predict end-to-end file system performance against a pre-defined workload can help system designers to make decisions that could affect their entire product line, involving several million dollars of investment. This dissertation presents detailed simulation-based performance models of the Linux ext3 file system and the PVFS parallel file system. The models are developed …

Characterizing Multi-Walled Carbon Nanotube Synthesis For Field Emission Applications, Benjamin L. Crossley, Nathan Glauvitz, Betty T. Quinton, Ronald A. Coutu Jr., Peter J. Collins

Electrical and Computer Engineering Faculty Research and Publications

No abstract provided.

Wireless Embedded Smart Cameras: Performance Analysis And Their Application To Fall Detection For Eldercare., Alvaro Pinto

Department of Electrical and Computer Engineering: Dissertations, Theses, and Student Research

Wireless Embedded Smart Camera Networks has received a lot of attention from academia and industry because they are small in size and easy to deploy, and they offer a multitude of attractive applications. They can be used for embedded single unit applications, or can be networked for multi-camera applications.

We first analyze three different operation scenarios for a wireless vision sensor network wherein different levels of local processing is performed. A detailed quantitative comparison of three operation scenarios are presented in terms of energy consumption and latency. This quantitative analysis provides the motivation for performing high-level local processing and decision …

Molecular Dynamics Simulation Based On Hadoop Mapreduce, Chen He

School of Computing: Dissertations, Theses, and Student Research

Molecular Dynamics (MD) simulation is a computationally intensive application used in multiple fields. It can exploit a distributed environment due to inherent computational parallelism. However, most of the existing implementations focus on performance enhancement. They may not provide fault-tolerance for every time-step.

MapReduce is a framework first proposed by Google for processing huge amounts of data in a distributed environment. The simplicity of the programming model and fault- tolerance for node failure during run-time make it very popular not only for commercial applications but also in scientific computing.

In this thesis, we develop a novel communication-free and each time-step fault- …

Networks - Ii: Closed-Form Expressions For Correlation Function And Power Density Spectrum In Mimo Mobile-To-Mobile Channels Using Two-Erose-Ring Model, Muahammad Riaz, Noor M. Khan

International Conference on Information and Communication Technologies

This paper presents an extensive study of MIMO channels in mobile-to-mobile environment. Recently proposed two-erose-ring model is reviewed for more details, and closed-form mathematical expressions for space-time correlations and power spectral density for MIMO mobile-to-mobile communication channels are derived. Using the correlation function, we analyze and compare capacity and diversity gains for two-ring model and two-erose-ring model. Furthermore, we compared the results with the existing models.

Networks - Ii: A High Bandwidth Covert Channel In Network Protocol, Mehdi Hussain

International Conference on Information and Communication Technologies

Covert channel is secret communication path, which existence is not expected in original system of design. It allows different users access to the same information, at the same time, but from different points-of-view. It is being more and more studying due to the grooming of internet. Always high-bandwidth network covert channel pose the significant risk of detection over network. Although the existing technique utilized the reserved bits of header, timestamp, initial sequence number, packet length etc for network covert channel, to some extend these have good temper resistance. But when increase their covert data capacity they becomes to fail to …

Network Security: A Review Of Salient Security Aspects Of The Universal Mobile Telecommunication System (Umts), F. Imran, M. Hussain

International Conference on Information and Communication Technologies

Wireless communication is known as key to global development. Wireless and mobile communication is gaining more importance in our life. Protecting information is one the aspects which we need to focus on the wireless networks. Universal mobile telecommunication system (UMTS) is evolution of the third generation mobile communication system. It was built on the success of global system for mobile communication (GSM). Universal mobile telecommunication system's security is also built on global system for mobile communication (GSM). The paper reviews the literature of the security aspects of the Universal mobile telecommunication system. A critical evaluation of the proposed solutions is …

Networks - Ii: Modified On Demand Transmission Power Control For Wireless Sensor Networks, Mirza M Yasir Masood, Ghufran Ahmed, Noor M. Khan

International Conference on Information and Communication Technologies

On Demand Transmission Power Control (ODTPC) is a well known transmission power control strategy that is used to reduce high power consumption in wireless sensor networks (WSNs). In this paper, we propose an extension to ODTPC and thus, a modified version of ODTPC is proposed named MODTPC. Simulation results show that performance of MODTPC is better than ODTPC in terms of efficiency and energy saving.

Image Processing – I: Spatial Domain Lossless Image Data Compression Method, Syed Ali Hassan, Mehdi Hussain

International Conference on Information and Communication Technologies

Images has very significant role in digital media. However, generally digital imaging generates large amounts of data it need to be compressed, without loss of relevant information or simply lossless compression. This paper presents a novel lossless image compression technique in spatial domain. The proposed algorithm divide the image into no. of blocks uses variable bits to store each block pixels. Calculation of variable bits is dependent on pixel values of each block. The advantage of proposed scheme, it is dependent upon pixels correlation with in a block. Experimental results show that our proposed algorithm gives better compression efficiency as …

Network Security: A Secure Architecture For Open Source Voip Solutions, Fahad Sattar, M. Hussain, Kashif Nisar

International Conference on Information and Communication Technologies

Voice over IP “VoIP” is a form of voice speech that uses data networks, for transmission of voice traffic over IP-based networks to transmit voice signals. The signal is correctly encoded at one end of the communication channel, sent as packets through the data network, then decoded at the receiving end and transformed back into a voice signal. It has a potential and offering a choice to the traditional telephony systems due to its high resource utilization and cost efficiency. Meanwhile, Wireless Local Area Networks (WLANs) have become an ever present networking technology that has been deployed around the world. …

Real-Time Divisible Load Scheduling For Cluster Computing, Anwar Mamat

School of Computing: Dissertations, Theses, and Student Research

Cluster computing has become an important paradigm for solving large-scale problems. However, as the size of a cluster increases, so does the complexity of resource management and maintenance. Therefore, automated performance control and re- source management are expected to play critical roles in sustaining the evolution of cluster computing. The current cluster scheduling practice is similar in sophistication to early supercomputer batch scheduling algorithms, and no consideration is given to desired quality-of-service (QoS) attributes. To fully avail the power of computational clusters, new scheduling algorithms that provides high performance, QoS assurance, fault-tolerance, energy savings and streamlined management of the cluster …

Networks - I: Interference Mitigation In 4g System Using Smart Antenna, Asad Ali Siddiqui, Muhammad Mazhar Manzoor, Aamir Ijaz, Adnan Umar Khan, Imran Ahmed Awan, Sangita Lal Chand

International Conference on Information and Communication Technologies

Emerging trends of mobile communication and ever growing demand of mobile users with high speed data requirements and migrating towards 4G, Co-Channel interference and multipath in urban/dense urban environment will limit the capacity of the network. Smart antenna is now recognized by its higher user capacity in 4G wireless networks by efficiently reducing multipath and co-channel interference. Smart Antenna use adaptive beam forming algorithms in a dynamic environment continuously adjusting the weight of antenna arrays for creating a beam to track desired users automatically, and minimize interference from other users by placing nulls in their directions. This research work provides …