<?xml version="1.0" encoding="utf-8" ?>
<rss version="2.0">
<channel>
<title>DigitalCommons@UTEP</title>
<copyright>Copyright (c) 2013 University of Texas at El Paso All rights reserved.</copyright>
<link>http://digitalcommons.utep.edu</link>
<description>Recent documents in DigitalCommons@UTEP</description>
<language>en-us</language>
<lastBuildDate>Wed, 22 May 2013 01:33:50 PDT</lastBuildDate>
<ttl>3600</ttl>








<item>
<title>The Prospector, May 7, 2013</title>
<link>http://digitalcommons.utep.edu/prospector/138</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/prospector/138</guid>
<pubDate>Wed, 08 May 2013 13:59:51 PDT</pubDate>
<description>
	<![CDATA[
	<p>Headline:  An Investment in Knowledge Always Pays the Best Interest</p>

	]]>
</description>

<author>UTEP Student Publications</author>


</item>






<item>
<title>Centennial Newsletter</title>
<link>http://digitalcommons.utep.edu/cent_news/7</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cent_news/7</guid>
<pubDate>Mon, 06 May 2013 08:40:21 PDT</pubDate>
<description>
	<![CDATA[
	<p>E-newsletter of the UTEP 2014 Commission.</p>

	]]>
</description>

<author>UTEP 2014 Commission</author>


</item>






<item>
<title>UTEP Newsletter</title>
<link>http://digitalcommons.utep.edu/utep_news/93</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/utep_news/93</guid>
<pubDate>Mon, 06 May 2013 08:35:02 PDT</pubDate>
<description>
	<![CDATA[
	<p>Weekly e-newsletter of the University of Texas at El Paso.</p>

	]]>
</description>

<author>University Communications</author>


</item>






<item>
<title>utepnews.com</title>
<link>http://digitalcommons.utep.edu/utep_news/92</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/utep_news/92</guid>
<pubDate>Mon, 06 May 2013 08:30:25 PDT</pubDate>
<description>
	<![CDATA[
	<p>Weekly e-newsletter of the University of Texas at El Paso.</p>

	]]>
</description>

<author>University Communications</author>


</item>






<item>
<title>utepnews.com</title>
<link>http://digitalcommons.utep.edu/utep_news/91</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/utep_news/91</guid>
<pubDate>Mon, 06 May 2013 08:27:18 PDT</pubDate>
<description>
	<![CDATA[
	<p>Weekly e-newsletter of the University of Texas at El Paso.</p>

	]]>
</description>

<author>University Communications</author>


</item>






<item>
<title>The Prospector, April 16, 2013</title>
<link>http://digitalcommons.utep.edu/prospector/137</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/prospector/137</guid>
<pubDate>Thu, 02 May 2013 14:52:28 PDT</pubDate>
<description>
	<![CDATA[
	<p>Headline: Earth Issue: Out of the Smoke</p>

	]]>
</description>

<author>UTEP Student Publications</author>


</item>






<item>
<title>The Prospector, April 23, 2013</title>
<link>http://digitalcommons.utep.edu/prospector/136</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/prospector/136</guid>
<pubDate>Thu, 02 May 2013 14:52:27 PDT</pubDate>
<description>
	<![CDATA[
	<p>Headline: Art Issue</p>

	]]>
</description>

<author>UTEP Student Publications</author>


</item>






<item>
<title>The Prospector, April 30, 2013</title>
<link>http://digitalcommons.utep.edu/prospector/135</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/prospector/135</guid>
<pubDate>Thu, 02 May 2013 14:52:25 PDT</pubDate>
<description>
	<![CDATA[
	<p>Headline: Prostate Cancer Research Provided Funding</p>

	]]>
</description>

<author>UTEP Student Publications</author>


</item>






<item>
<title>The Prospector, May 2, 2013</title>
<link>http://digitalcommons.utep.edu/prospector/134</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/prospector/134</guid>
<pubDate>Thu, 02 May 2013 14:52:24 PDT</pubDate>
<description>
	<![CDATA[
	<p>Headline: Gate Accessibility</p>

	]]>
</description>

<author>UTEP Student Publications</author>


</item>






<item>
<title>Towards Model Fusion in Geophysics: How to Estimate Accuracy of Different Models</title>
<link>http://digitalcommons.utep.edu/cs_techrep/759</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/759</guid>
<pubDate>Mon, 22 Apr 2013 12:50:09 PDT</pubDate>
<description>
	<![CDATA[
	<p>In geophysics, we usually have several Earth models based on different types of data: seismic, gravity, etc. Each of these models captures some aspects of the Earth structure. To get the more description of the Earth, it is desirable to "fuse" these models into a single one. To appropriately fuse the models, we need to know the accuracy of different models. In this paper, we show that the traditional methods cannot be directly used to estimate these accuracies, and we propose a new method for such estimation.</p>

	]]>
</description>

<author>Omar Ochoa et al.</author>


</item>






<item>
<title>Why ℓ1 Is a Good Approximation to ℓ0: A Geometric Explanation</title>
<link>http://digitalcommons.utep.edu/cs_techrep/758</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/758</guid>
<pubDate>Mon, 22 Apr 2013 12:50:05 PDT</pubDate>
<description>
	<![CDATA[
	<p>In practice, we usually have partial information; as a result, we have several different possibilities consistent with the given measurements and the given knowledge. For example, in geosciences, several possible density distributions are consistent with the measurement results. It is reasonable to select the simplest among such distributions. A general solution can be described, e.g., as a linear combination of basic functions. A natural way to define the simplest solution is to select a one for which the number of the non-zero coefficients c<sub>i</sub> is the smallest. The corresponding "l<sub>0</sub>-optimization" problem is non-convex and therefore, difficult to solve. As a good approximation to this problem, Candes and Tao proposed to use a solution to the convex l<sub>1</sub> optimization problem |c<sub>1</sub>| + ... + |c<sub>n</sub>| --> min. In this paper, we provide a geometric explanation of why l<sub>1</sub> is indeed the best convex approximation to l<sub>0</sub>.</p>

	]]>
</description>

<author>Carlos Ramirez et al.</author>


</item>






<item>
<title>A New Analog Optical Processing Scheme for Solving NP-Hard Problems</title>
<link>http://digitalcommons.utep.edu/cs_techrep/757</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/757</guid>
<pubDate>Mon, 22 Apr 2013 12:50:02 PDT</pubDate>
<description>
	<![CDATA[
	<p>Many real-life problems are, in general, NP-hard, i.e., informally speaking, are difficult to solve. To be more precise, a problem p is NP-hard means that every problem from the class NP can be reduced to this problem p. Thus, if we have an efficient algorithm for solving one NP-hard problem, we can use this reduction to get a more efficient way of solving all the problems from the class NP. To speed up computations, it is reasonable to base them on the fastest possible physical process -- i.e., on light. It is known that analog optical processing indeed speeds up computation of several NP-hard problems. Each of the corresponding speed-up schemes has its success cases and limitations. The more schemes we know, the higher the possibility that for a given problem, one of these schemes will prove to be effective. Motivated by this argument, we propose a new analog optical processing scheme for solving NP-hard problems.</p>

	]]>
</description>

<author>Michael Zakharevich et al.</author>


</item>






<item>
<title>For Describing Uncertainty, Ellipsoids Are Better than Generic Polyhedra and Probably Better than Boxes: A Remark</title>
<link>http://digitalcommons.utep.edu/cs_techrep/756</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/756</guid>
<pubDate>Mon, 22 Apr 2013 12:49:58 PDT</pubDate>
<description>
	<![CDATA[
	<p>For a single quantity, the set of all possible values is usually an interval. An interval is easy to represent in a computer: e.g., we can store its two endpoints. For several quantities, the set of possible values may have an arbitrary shape. An exact description of this shape requires infinitely many parameters, so in a computer, we have to use a finite-parametric approximation family of sets. One of the widely used methods for selecting such a family is to pick a symmetric convex set and to use its images under all linear transformations. If we pick a unit ball, we end up with ellipsoids; if we pick a unit cube, we end up with boxes and parallelepipeds; we can also pick a polyhedron. In this paper, we show that ellipsoids lead to better approximations of actual sets than generic polyhedra; we also show that, under a reasonable conjecture, ellipsoids are better approximators than boxes.</p>

	]]>
</description>

<author>Olga Kosheleva et al.</author>


</item>






<item>
<title>How to Explain (and Overcome) 2% Barrier in Teaching Computer Science: Fuzzy Ideas Can Help</title>
<link>http://digitalcommons.utep.edu/cs_techrep/755</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/755</guid>
<pubDate>Mon, 22 Apr 2013 12:49:55 PDT</pubDate>
<description>
	<![CDATA[
	<p>Computer science educators observed that in the present way of teaching computing, only 2% of students can easily handle computational concepts -- and, as a result, only 2% of the students specialize in computer science. With the increasing role of computers in the modern world, and the increasing need for computer-related jobs, this 2% barrier creates a shortage of computer scientists. We notice that the current way of teaching computer science is based on easiness of using two-valued logic, on easiness of dividing all situations, with respect to each property, into three classes: yes, no, and unknown. The fact that the number of people for whom such a division is natural is approximately 2%, provides a natural explanation of the 2% barrier -- and a natural idea of how to overcome this barrier: to tailor our teaching to students for whom division into more than three classes is much more natural. This means, in particular, emphasizing fuzzy logic, in which for each property, we divide the objects into several classes corresponding to different degrees with which the given property is satisfied.</p>

	]]>
</description>

<author>Olga Kosheleva et al.</author>


</item>






<item>
<title>Towards Fuzzy Method for Estimating Prediction Accuracy for Discrete Inputs, with Application to Predicting At-Risk Students</title>
<link>http://digitalcommons.utep.edu/cs_techrep/754</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/754</guid>
<pubDate>Mon, 22 Apr 2013 12:49:51 PDT</pubDate>
<description>
	<![CDATA[
	<p>In many practical situations, we need, given the values of the observed quantities x1, ..., xn, to predict the value of a desired quantity y. To estimate the accuracy of a prediction algorithm f(x1, ..., xn), we need to compare the results of this algorithm's prediction with the actually observed values.</p>
<p>The value y usually depends not only on the values x1, ..., xn, but also on values of other quantities which we do not measure. As a result, even when we have the exact same values of the quantities x1, ..., xn, we may get somewhat different values of y. It is often reasonable to assume that for each combinations of xi values, possible values of y are normally distributed, with some mean E and standard deviation s. Ideally, we should predict both E and s, but in many practical situations, we only predict a single value Y. How can we gauge the accuracy of this prediction based on the observations?</p>
<p>A seemingly reasonable idea is to use crisp evaluation of prediction accuracy: a method is accurate if Y belongs to a k-sigma interval [E - k * s, E + k * s], for some pre-selected value k (e.g., 2, 3, or 6). However, in this method, the value Y = E + k * s is considered accurate, but a value E + (k + d) * s (which, for small d > 0, is practically indistinguishable from Y) is not accurate. To achieve a more adequate description of accuracy, we propose to define a degree to which the given estimate is accurate.</p>
<p>As a case study, we consider predicting at-risk students.</p>

	]]>
</description>

<author>Xiaojing Wang et al.</author>


</item>






<item>
<title>Towards Discrete Interval, Set, and Fuzzy Computations</title>
<link>http://digitalcommons.utep.edu/cs_techrep/753</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/753</guid>
<pubDate>Mon, 22 Apr 2013 12:49:48 PDT</pubDate>
<description>
	<![CDATA[
	<p>In many applications, we know the function f(x1,...,xn), we know the intervals [xi] of possible values of each quantity xi, and we are interested in the range of possible values of y=f(x1,...,xn); this problem is known as the problem of interval computations. In other applications, we know the function f(x1,...,xn), we know the fuzzy sets Xi that describe what we know about each quantity xi, and we are interested in finding the fuzzy set Y corresponding to the quantity y=f(x1,...,xn); this problem is known as the problem of fuzzy computations. There are many efficient algorithms for solving these problems; however, most of these algorithms implicitly assume that each quantity xi can take any real value within its range. In practice, some quantities are discrete: e.g., xi can describe the number of people. In this paper, we provide feasible algorithms for interval, set, and fuzzy computations for such discrete inputs.</p>

	]]>
</description>

<author>Enrique Portillo et al.</author>


</item>






<item>
<title>Aggregation Operations from Quantum Computing</title>
<link>http://digitalcommons.utep.edu/cs_techrep/752</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/752</guid>
<pubDate>Mon, 22 Apr 2013 10:36:13 PDT</pubDate>
<description>
	<![CDATA[
	<p>Computer systems based on fuzzy logic should be able to generate an output from the handling of inaccurate data input by applying a rule based system. The main contribution of this paper is to show that quantum computing can be used to extend the class of fuzzy sets. The central idea associates the states of a quantum register to membership functions (mFs) of fuzzy subsets, and the rules for the processes of fuzzyfication are performed by unitary qTs. This paper introduces an interpretation of aggregations obtained by classical fuzzy states, that is, by multi-dimensional quantum register associated to mFs on unitary inter- val U. In particular, t-norms and t-conorms based on quantum gates, allow the modeling and interpretation of union, intersection, difference and implication among fuzzy sets, also including an expression for the class of fuzzy S-implications. Furthermore, an interpretation of the symmetric sum was achieved by considering the sum of related classical fuzzy states. For all cases, the measurement process performed on the corresponding quantum registers yields the correct interpretation for all the logical operators.</p>

	]]>
</description>

<author>Lidiane Visintin et al.</author>


</item>






<item>
<title>Relation Between Polling and Likert-Scale Approaches to Eliciting Membership Degrees Clarified by Quantum Computing</title>
<link>http://digitalcommons.utep.edu/cs_techrep/751</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/751</guid>
<pubDate>Mon, 22 Apr 2013 10:36:10 PDT</pubDate>
<description>
	<![CDATA[
	<p>In fuzzy logic, there are two main approaches to eliciting membership degrees: an approach based on polling experts, and a Likert-scale approach, in which we ask experts to indicate their degree of confidence on a scale -- e.g., on a scale form 0 to 10. Both approaches are reasonable, but they often lead to different membership degrees. In this paper, we analyze the relation between these two approaches, and we show that this relation can be made much clearer if we use models from quantum computing.</p>

	]]>
</description>

<author>Renata Hax Sander Reiser et al.</author>


</item>






<item>
<title>Why Inverse F-transform? A Compression-Based Explanation</title>
<link>http://digitalcommons.utep.edu/cs_techrep/750</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/750</guid>
<pubDate>Mon, 22 Apr 2013 10:36:06 PDT</pubDate>
<description>
	<![CDATA[
	<p>In many practical situations, e.g., in signal processing, image processing, analysis of temporal data, it is very useful to use fuzzy (F-) transforms. In an F-transform, we first replace a function x(t) by a few local averages (this is called <em>forward</em> F-transform), and then reconstruct the original function from these averages (this is called <em>inverse</em> F-transform). While the formula for the forward F-transform makes perfect intuitive sense, the formula for the inverse F-transform seems, at first glance, somewhat counter-intuitive. On the other hand, its empirical success shows that this formula must have a good justification. In this paper, we provide such a justification -- a justification which is based on formulating a reasonable compression-based criterion.</p>

	]]>
</description>

<author>Vladik Kreinovich et al.</author>


</item>






<item>
<title>Brans-Dicke Scalar-Tensor Theory of Gravitation May Explain Time Asymmetry of Physical Processes</title>
<link>http://digitalcommons.utep.edu/cs_techrep/749</link>
<guid isPermaLink="true">http://digitalcommons.utep.edu/cs_techrep/749</guid>
<pubDate>Mon, 22 Apr 2013 10:36:03 PDT</pubDate>
<description>
	<![CDATA[
	<p>Most fundamental physical equations remain valid if we reverse the time order. Thus, if we start with a physical process (which satisfies these equations) and reverse time order, the resulting process also satisfies all the equations and thus, should also be physically reasonable. In practice, however, many physical processes are not reversible: e.g., a cup can break into pieces, but the pieces cannot magically get together and become a whole cup. In this paper, we show that the Brans-Dicke Scalar-Tensor Theory of Gravitation, one of the most widely used generalizations of Einstein's General relativity, is, in effect, time-asymmetric. This time-asymmetry may explain the observed time asymmetry of physical phenomena.</p>

	]]>
</description>

<author>Olga Kosheleva et al.</author>


</item>





</channel>
</rss>
