Engineering Commons^™

Least Sensitive (Most Robust) Fuzzy "Exclusive Or" Operations, Jesus E. Hernandez, Jaime Nava

Departmental Technical Reports (CS)

In natural language, "or" sometimes means "inclusive or" and sometimes means "exclusive or". To adequately describe commonsense and expert knowledge, it is therefore important to have not only t-conorms describing fuzzy "inclusive or" operations, but also fuzzy "exclusive or" operations f(a,b). Since the degrees of certainty are only approximately defined, it is reasonable to require that the corresponding operation be the least sensitive to small changes in the inputs. In this paper, we show that the least sensitive fuzzy "exclusive or" operation has the form f(a,b)=min(max(a,b),max(1-a,1-b)).

Adding Constraints -- A (Seemingly Counterintuitive But) Useful Heuristic In Solving Difficult Problems, Olga Kosheleva, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

Intuitively, the more constraints we impose on a problem, the more difficult it is to solve it. However, in practice, difficult-to-solve problems sometimes get solved when we impose additional constraints and thus, make the problems seemingly more complex. In this methodological paper, we explain this seemingly counter-intuitive phenomenon, and we show that, dues to this explanation, additional constraints can serve as a useful heuristic in solving difficult problems.

Mamdani Approach To Fuzzy Control, Logical Approach, What Else?, Samuel Bravo, Jaime Nava

Departmental Technical Reports (CS)

In fuzzy control, two approaches are mainly used: Mamdani's approach, in which we represent the knowledge base as a disjunction of statements Ai(x) & Bi(u) corresponding to individual rules, and logical approach, in which the knowledge base is represented as a conjunction of the rules themselves Ai(x) --> Bi(u). Both approaches are known not to be perfect, so a natural question arises: what other approaches are possible? In this paper, we describe all possible approaches; alternative approaches use an "exclusive or" operation and correspond, e.g., to the fuzzy transform idea.

From Program Synthesis To Optimal Program Synthesis, Joaquin Reyna

Departmental Technical Reports (CS)

Fusing Continuous And Discrete Data, On The Example Of Merging Seismic And Gravity Models In Geophysics, Omar Ochoa, Aaron Velasco, Vladik Kreinovich

Departmental Technical Reports (CS)

Towards Optimal Placement Of Bio-Weapon Detectors, Chris Kiekintveld, Octavio Lerma

Departmental Technical Reports (CS)

Biological weapons are difficult and expensive to detect. Within a limited budget, we can afford a limited number of bio-weapon detector stations. It is therefore important to find the optimal locations for such stations. A natural idea is to place more detectors in the areas with more population -- and fewer in desert areas, with fewer people. However, such a commonsense analysis does not tell us how many detectors to place where. To decide on the exact placement of bio-weapon detectors, we formulate the placement problem in precise terms, and come up with an (almost) explicit solution to the resulting …

How To Tell When A Product Of Two Partially Ordered Spaces Has A Certain Property: General Results With Application To Fuzzy Logic, Francisco Zapata, Olga Kosheleva, Karen Villaverde

Departmental Technical Reports (CS)

Towards Optimal Sensor Placement In Multi-Zone Measurements, Octavio Lerma, Craig Tweedie, Vladik Kreinovich

Departmental Technical Reports (CS)

In multi-zone areas, where the boundaries change with time, it is desirable to place sensors in such a way that the boundary is covered at all times. In this paper, we describe the optimal sensor placement with this property. In this optimal placement, sensors are placed along a see-saw trajectory going between the current location of the boundary and its farthest future location.

Computing The Range Of Variance-To-Mean Ratio Under Interval And Fuzzy Uncertainty, Sio-Long Lo, Gang Xiang

Departmental Technical Reports (CS)

In many practical problems such as radar imaging, it is useful to compute the variance-to-mean ratio. The need is important because for the sum of k identical independent signal components, both the variance and the mean are multiplied by k, so this ratio is independent on k and thus, provides useful information about the components. In practice, we only know the samples values with uncertainty. It is therefore necessary to compute the variance-to-mean ratio under this uncertainty. In this paper, we present efficient algorithms for computing this ratio under interval and fuzzy uncertainty.

Towards Chemical Applications Of Dempster-Shafer-Type Approach: Case Of Variant Ligands, Jaime Nava

Departmental Technical Reports (CS)

Why Curvature In L-Curve: Combining Soft Constraints, Uram Anibal Sosa Aguirre, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In solving inverse problems, one of the successful methods of determining the appropriate value of the regularization parameter is the L-curve method of combining the corresponding soft constraints, when we plot the curve describing the dependence of the logarithm $x$ of the mean square difference on the logarithm $y$ of the mean square non-smoothness, and select a point on this curve at which the curvature is the largest. This method is empirically successful, but from the theoretical viewpoint, it is not clear why we should use curvature and not some other criterion. In this paper, we show that reasonable scale-invariance …

How To Bargain: An Interval Approach, Vladik Kreinovich, Hung T. Nguyen, Songsak Sriboonchitta

Departmental Technical Reports (CS)

Sports-Tool, Bryant Ung

Computer Science and Software Engineering

Creating events and finding people to play sports is a hard thing to do. The solution to this problem is to provide a web based interactive site that allows people to create and join different type of events and interact with each other by creating teams.

The Gel Documentation System: A Cornerstone To The Implementation Of The Introduction To Biotechnology And Introduction To Bioinformatics Cross-Disciplinary Course Series (Final Report), Marcy Kelly, Gregory Lampard, Constance Knapp

Cornerstone 3 Reports : Interdisciplinary Informatics

Our original goal was to offer Pace undergraduate students opportunities to be introduced to both Biotechnology and Computer Science as it relates to Bioinformatics. We proposed a two course series, offered to both computer science and biology students that will increase both biological and computer science literacy of our students. The two courses are Introduction to Biotechnology (BIO 372) and Introduction to Bioinformatics.

Increasing High School Stem Participation Through Robotics Training And Tournaments (Final Report), Richard Kline

Cornerstone 2 Reports : Community Outreach and Empowerment Through Service Learning and Volunteerism

The overall goal of this project was to engage high school students in an exciting way to increase their interest in science and technology. We planned to accomplish this by making Pace University an official Affiliate Partner of the FIRST Tech Challenge (FTC) robotics competition, a fast-growing program with more than 1,100 participating teams in 2009-2010. In FTC, high-school age participants design, build, and program their own robots to enter into regional and national competitions. Building on the Seidenberg School’s past success as a partner to FIRST with its FIRST LEGO League program, we intended to organize, host, and run …

Use Of Mobile Phone Computing For Development Of Student 21st Century Skills, Susan M. Merritt, R. Lara Lee

Cornerstone 2 Reports : Community Outreach and Empowerment Through Service Learning and Volunteerism

Mobile phone computing enables immediate capture and transfer of data, images, notes and experiences from the field to a repository where retrieval, analysis, edits, aggregation, and further development are possible. Immediate findings and later results can be shared on the Web with local and global communities, and development of integrated service learning projects in concert with underserved communities is possible using this mode of information gathering and sharing.

Mobile phone computing incorporates moments when participants build tomorrow's skills while addressing today's learning goals. Use of digital tools and supporting resources bring real world problems into focus. Mobile phone computing enables …

Security@Web: Teaching Security With Alignment In Trust On The Web (Final Report), Li-Chiou Chen, Mary Long

Cornerstone 3 Reports : Interdisciplinary Informatics

No abstract provided.

Development Of A Cubesat Payload To Model Particle Dampening In Space: Design And Implementation Of Software For Cp7, Daniel Walker

Computer Engineering

The California Polytechnic State University CubeSat student research & development group, PolySat, is currently in a mature development stage of a single unit CubeSat designated CP7. The CP7 mission implements a scientific payload designed to characterize particle dampers in microgravity conditions. When subjected to vibration, the momentum exchanges and frictional forces of the particles create a damping effect that can be optimized to suit a number of applications over a broad frequency and amplitude range. In space based applications, particle dampers would serve as a robust and simple device to eliminate jitter in optical assemblies and other sensitive instrumentation. This …

Utilization Of Automated Gcc Optimization For Dual-Width Instruction Sets On The Arm Architecture, Shane Watson

Computer Engineering

One of the most important considerations in embedded systems is code size. This consideration is obviously imposed by external factors such as cost and physical space, but what it boils down to is that we want our devices to be as powerful as they can within a (typically limited) specific form factor. This limits the amount of space we have for memory and as such we should always be considering the code size of our application and making sure it’s as efficient as possible. We also then need to consider other factors such as performance and power consumption. This is …

The Changing Patterns Of Internet Usage, Christopher S. Yoo

Federal Communications Law Journal

Symposium: Essays from Time Warner Cable's Research Program on Digital Communications.

The Challenge Of Increasing Broadband Capacity, Dale N. Hatfield

Federal Communications Law Journal

Symposium: Essays from Time Warner Cable's Research Program on Digital Communications.

Data Routing In Multicore Processors Using Dimension Increment Method, Arpita H. Kadakia

UNLV Theses, Dissertations, Professional Papers, and Capstones

A Deadlock-free routing algorithm can be generated for arbitrary interconnection network using the concept of virtual channels but the virtual channels will lead to more complex algorithms and more demands of NOC resource.

In this thesis, we study a Torus topology for NOC application, design its structure and propose a routing algorithm exploiting the characteristics of NOC. We have chosen a typical 16 (4 by 4) routers Torus and propose the corresponding route algorithm. In our algorithm, all the channels are assigned 4 different dimensions (n0,n1,n2 & n3). By following the dimension increment method, we break the dependent route circles, …

Dynamic Distributed Programming And Applications To Swap Edge Problem, Feven Z. Andemeskel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Link failure is a common reason for disruption in communication networks. If communication between processes of a weighted distributed network is maintained by a spanning tree T, and if one edge e of T fails, communication can be restored by finding a new spanning tree, T’. If the network is 2-edge connected, T’ can always be constructed by replacing e by a single edge, e’, of the network. We refer to e’ as a swap edge of e.

The best swap edge problem is to find the best choice of e’, that is, that e which causes the new spanning …

Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti

UNLV Theses, Dissertations, Professional Papers, and Capstones

The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology is expected to change frequently. An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network will eventually reach a legitimate configuration.

Note that any self-stabilizing algorithm for the leader election problem is also an algorithm for the dynamic leader election problem, since when the topology of the network changes, we can consider that the algorithm is starting over again from an arbitrary state. There are a number of such algorithms in the …

Self-Stabilizing Group Membership Protocol, Mahesh Subedi

UNLV Theses, Dissertations, Professional Papers, and Capstones

In this thesis, we consider the problem of partitioning a network into groups of bounded diameter.

Given a network of processes X and a constant D, the group partition problem is the problem of finding a D-partition of X, that is, a partition of X into disjoint connected subgraphs, which we call groups, each of diameter no greater than D. The minimal group partition problem is to find a D-partition {G1, ... Gm} of X such that no two groups can be combined; that is, for any Gi and Gj, where i ≠ j, either Gi U Gj is disconnected …

Topical Summarization Of Web Videos By Visual-Text Time-Dependent Alignment, Song Tan, Hung-Khoon Tan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Search engines are used to return a long list of hundreds or even thousands of videos in response to a query topic. Efficient navigation of videos becomes difficult and users often need to painstakingly explore the search list for a gist of the search result. This paper addresses the challenge of topical summarization by providing a timeline-based visualization of videos through matching of heterogeneous sources. To overcome the so called sparse-text problem of web videos, auxiliary information from Google context is exploited. Google Trends is used to predict the milestone events of a topic. Meanwhile, the typical scenes of web …

Enhancing Brand Equity Through Flow: Comparison Of 2d Versus 3d Virtual World, Fiona Fui-Hoon Nah, Brenda Eschenbrenner, David Dewester

Research Collection School Of Computing and Information Systems

This research uses the theory of flow to examine the effect of 2D versus 3D virtual world environments on brand equity and use intention. The results suggest that a 3D virtual world environment has both positive (indirect) and negative (direct) effects on brand equity. The positive, indirect effect of the 3D virtual world environment occurs through feelings of telepresence and enjoyment, both of which contribute positively to brand equity and, in turn, induces a higher behavioral intention. The negative, direct effect can be explained using distraction-conflict theory, where attentional conflict is faced by users of a highly interactive and rich …

Design Of An Adaptable Run-Time Reconfigurable Software-Defined Radio Processing Architecture, Joshua R. Templin

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Processing power is a key technical challenge holding back the development of a high-performance software defined radio (SDR). Traditionally, SDR has utilized digital signal processors (DSPs), but increasingly complex algorithms, higher data rates, and multi-tasking needs have exceed the processing capabilities of modern DSPs. Reconfigurable computers, such as field-programmable gate arrays (FPGAs), are popular alternatives because of their performance gains over software for streaming data applications like SDR. However, FPGAs have not yet realized the ideal SDR because architectures have not fully utilized their partial reconfiguration (PR) capabilities to bring needed flexibility. A reconfigurable processor architecture is proposed that utilizes …

Study Of Stemming Algorithms, Savitha Kodimala

UNLV Theses, Dissertations, Professional Papers, and Capstones

Automated stemming is the process of reducing words to their roots. The stemmed words are typically used to overcome the mismatch problems associated with text searching.

In this thesis, we report on the various methods developed for stemming. In particular, we show the effectiveness of n-gram stemming methods on a collection of documents.

A Self Organization-Based Optical Flow Estimator With Gpu Implementation, Manish Shiralkar

All Dissertations

This work describes a parallelizable optical flow estimator that uses a modified batch version of
the Self Organizing Map (SOM). This gradient-based estimator handles the ill-posedness in motion
estimation via a novel combination of regression and a self organization strategy.
The aperture problem is explicitly modeled using an algebraic framework
that partitions motion estimates obtained from regression into two sets, one (set H_c) with estimates
with high confidence and another (set H_p) with low confidence estimates. The self organization step
uses a uniquely designed pair of training set (Q=H_c) and the initial weights set …