Open Access. Powered by Scholars. Published by Universities.^{®}
 Discipline

 Physical Sciences and Mathematics (49)
 Computer Sciences (42)
 Digital Communications and Networking (15)
 Electrical and Computer Engineering (12)
 Robotics (10)

 Computer and Systems Architecture (9)
 Other Computer Engineering (7)
 Nuclear Engineering (5)
 Oceanography (4)
 Mechanical Engineering (4)
 Social and Behavioral Sciences (4)
 Ocean Engineering (4)
 Data Storage Systems (4)
 Public Affairs, Public Policy and Public Administration (4)
 Software Engineering (4)
 Oceanography and Atmospheric Sciences and Meteorology (4)
 Science and Technology Law (3)
 Other Computer Sciences (3)
 Communications Law (3)
 Science and Technology Policy (3)
 Law (3)
 Economics (3)
 OS and Networks (3)
 Education (3)
 Law and Economics (3)
 Constitutional Law (2)
 Controls and Control Theory (2)
 Antitrust and Trade Regulation (2)
 Institution

 University of Texas at El Paso (39)
 Washington University in St. Louis (23)
 New Jersey Institute of Technology (18)
 University of Nebraska  Lincoln (12)
 Edith Cowan University (8)

 University of South Carolina (8)
 Selected Works (6)
 University of Nevada, Las Vegas (5)
 Technological University Dublin (4)
 San Jose State University (4)
 Florida International University (4)
 California State University, San Bernardino (3)
 University of Pennsylvania Law School (3)
 Portland State University (3)
 Old Dominion University (3)
 University of Dayton (2)
 Syracuse University (2)
 Western University (2)
 University of Pennsylvania (2)
 Cleveland State University (2)
 The University of Maine (1)
 Loyola University Chicago (1)
 Boise State University (1)
 University of Arkansas, Fayetteville (1)
 Bowling Green State University (1)
 Nova Southeastern University (1)
 Iowa State University (1)
 Chapman University (1)
 University of Tennessee, Knoxville (1)
 Cedarville University (1)
 Keyword

 Computer Science and Engineering (8)
 Wireless networks (6)
 Computer networks (5)
 Interval computations (4)
 Internet (3)

 Security measures (3)
 Multiagent systems (3)
 Popular Articles (3)
 Software agents (3)
 Industrial (3)
 Design (3)
 Network traffic (3)
 Statistical methods (2)
 Inference mechanisms (2)
 Multimedia systems (2)
 Beamforming (2)
 Computer science (2)
 Web services (2)
 GRASP (2)
 Artificial intelligence (2)
 Industrial – Control systems (2)
 Interoperability (2)
 RealTime Middleware (2)
 Distributed Embedded Systems (2)
 Documentation (2)
 Industrial; Robots (2)
 Journal Publications (2)
 SpaceTime Block Coding (2)
 Human Factors (2)
 Parallel processing (2)
 Publication

 Departmental Technical Reports (CS) (36)
 All Computer Science and Engineering Research (23)
 Theses (15)
 Faculty Publications (9)
 Faculty Publications in Computer & Electronics Engineering (to 2015) (7)

 Theses: Doctorates and Masters (5)
 Fuels Campaign (TRP) (5)
 FIU Electronic Theses and Dissertations (4)
 Christopher N. Roman (4)
 Computer Science Faculty Publications and Presentations (3)
 Dissertations (3)
 Faculty Scholarship at Penn Law (3)
 Theses Digitization Project (3)
 Computer Science and Engineering: Theses, Dissertations, and Student Research (3)
 Theses : Honours (3)
 Computational Modeling and Simulation Engineering Faculty Publications (2)
 Electrical and Computer Engineering Faculty Publications (2)
 Electrical Engineering & Computer Science Faculty Publications (2)
 Conference Papers (2)
 Electrical and Computer Engineering Publications (2)
 Robert Henry MorelosZaragoza (2)
 Departmental Papers (CS) (2)
 Computer Science & Engineering Syllabi (1)
 College of Engineering and Computing Course Catalogs (1)
 Computer Science Technical Reports (1)
 CSE Conference and Workshop Papers (1)
 Articles (1)
 Computer Science Faculty Publications (1)
 Conference papers (1)
 Computer Science: Faculty Publications and Other Works (1)
 Publication Type
 File Type
Articles 1  30 of 164
FullText Articles in Computer Engineering
Adaptive TurnProhibition Routing Algorithm For The Networks Of Workstations, Amey Bhaskar Shevtekar
Adaptive TurnProhibition Routing Algorithm For The Networks Of Workstations, Amey Bhaskar Shevtekar
Theses
Deadlock occurrence is a critical problem for any computer network. Various solutions have been proposed over last two decades to solve problem of deadlocks in networks using different routing schemes, like up/down routing algorithm used in Myrinet switches. However, most of existing approaches for deadlockfree routing either try to eliminate any possibility of deadlock occurrence, which can result in putting extra restrictions on the routing in the networks or put no restrictions on routing, which leads to other approach namely deadlock recovery. In this thesis emphasis is on developing hybrid approach for routing in wormhole networks, wherein some prohibition ...
Facilitating Conversations Among Web Services As SpeechAct Based Discourses, Karthikeyan Umapathy, Sandeep Purao, Vijayan Sugumaran
Facilitating Conversations Among Web Services As SpeechAct Based Discourses, Karthikeyan Umapathy, Sandeep Purao, Vijayan Sugumaran
Karthikeyan Umapathy
Web services composition is an emerging paradigm for enabling application deployment and integration within and across organizational boundaries. A landscape of languages and techniques for web services composition has emerged and is continuously being enriched. The ability to support conversations taking place between Web Services is an important area that is not yet fully addressed by the emerging standards. We suggest an approach to derive speechact based message structures for conversation support that can complement existing standards.
Spatiotemporal Databases: Models For Attracting Students To Research, Ágnes Bércesné Novák, Peter Revesz, Zsolt Tuza
Spatiotemporal Databases: Models For Attracting Students To Research, Ágnes Bércesné Novák, Peter Revesz, Zsolt Tuza
CSE Conference and Workshop Papers
In higher education professors often make much effort to introduce their students to research. Unfortunately, the present standard database systems curriculum is composed of wellsettled subjects that do not lead to research. The challenge is to bring the research frontier closer to students at beginner level. In this paper we describe how it can be done in the area of spatiotemporal databases. We propose a new database systems curriculum and illustrate its benefits by mentioning several highly succsesful student projects in some recent experimental introductory database systems courses that followed the new curriculum.
Efficient Customizable Middleware, Ravi Pratap Maddimsetty
Efficient Customizable Middleware, Ravi Pratap Maddimsetty
All Computer Science and Engineering Research
The rather large feature set of current Distributed Object Computing (DOC) middleware can be a liability for certain applications which have a need for only a certain subset of these features but have to suﬀer performance degradation and code bloat due to all the present features. To address this concern, a unique approach to building fully customizable middleware was undertaken in FACET, a CORBA event channel written using AspectJ. FACET consists of a small, essential core that represents the basic structure and functionality of an event channel into which additional features are woven using aspects so that the resulting event ...
Resource Configuration And Network Design In Extensible Networks, Sumi Y. Choi
Resource Configuration And Network Design In Extensible Networks, Sumi Y. Choi
All Computer Science and Engineering Research
The goal of packetswitched networks has conventionally been delivering data to users. This concept is changing rapidly as current technologies make it possible to build network processing engines that apply intermediary services to data traffic. This trend introduces an extensive range of ways to develop and operate applications by allowing processing services customized for applications' needs at intermediate network users, as it can relieve individuals from the need to acquire, install, and maintain software in end systems to perform required functions. As such network services become more widely used, it will become increasingly important for service providers to have effective ...
An Iterative Beam Search Algorithm For Degenerate Primer Selection, Richard Souvenir
An Iterative Beam Search Algorithm For Degenerate Primer Selection, Richard Souvenir
All Computer Science and Engineering Research
Single Nucleotide Polymorphism (SNP) Genotyping is an important molecular genetics process in the early stages of producing results that will be useful in the medical ﬁeld. Due to inherent complexities in DNA manipulation and analysis, many diﬀerent methods have been proposed for a standard assay. One of the proposed techniques for performing SNP Genotyping requires amplifying regions of DNA surrounding a large number of SNP loci. In order to automate a portion of this particular method, it is necessary to select a set of primers for the experiment. Selecting these primers can be formulated as the Multiple Degenerate Primer Design ...
Uml Extensions For RealTime Control Systems, Qimin Gao, Lyndon Brown, Luiz Fernando Capretz
Uml Extensions For RealTime Control Systems, Qimin Gao, Lyndon Brown, Luiz Fernando Capretz
Electrical and Computer Engineering Publications
The use of object oriented techniques and methodologies for the design of realtime control systems appears to be necessary in order to deal with the increasing complexity of such systems. Recently many objectoriented methods have been used for the modeling and design of realtime control systems. We believe that an approach that integrates the advancements in both object modeling and design methods, and realtime scheduling theory is the key to successful use of object oriented technology for realtime software. Surprisingly several past approaches to integrate the two either restrict the object models, or do not allow sophisticated schedulability analysis techniques ...
Experimental Evaluation Of Constraint Automata Solutions To The Genome Map Assembly Problem, Viswanathan Ramanathan
Experimental Evaluation Of Constraint Automata Solutions To The Genome Map Assembly Problem, Viswanathan Ramanathan
Computer Science and Engineering: Theses, Dissertations, and Student Research
DNA sequences are really huge having a length of around 34 million base pairs. Hence, each DNA sequence has to be cut down into small fragments using restriction enzymes. Once analyzed, these fragments have to be arranged or assembled into a single set of sequences called a genome map, to obtain the original DNA sequence. This problem is called the Genome Map Assembly Problem. A ConstraintAutomata Solution was proposed for this purpose [11]. This thesis improves and implements the ConstraintAutomata Solution to find all the possible solutions. The Modified ConstraintAutomata Solution was implemented in Perl and executed on parts of ...
Constraint Datalog In Trust Management, Scot Anderson
Constraint Datalog In Trust Management, Scot Anderson
Computer Science and Engineering: Theses, Dissertations, and Student Research
Constraint Datalog holds an increasing role in Trust Management. We discuss several Trust Management systems and give a description of the environment and requirements for Trust Management. Constraint Datalog using addition constraints and approximation theory provides an expressive semantic with which to describe security policies for credentials, delegations and authorizations. Approximation theory allows halting in Constraint Datalog over addition constraints. We use the decision problem of Diophantine equations to show that Constraint Datalog over addition constraints is complete. Combining these two concepts provides an approximately complete, safe language. The problem of constant additions to closed languages provides reasons for using ...
Using Dynamic Optimization For Control Of Real Rate Cpu Resource Management Applications, Varin Vahia, Ashvin Goel, David Steere, Jonathan Walpole, Molly H. Shor
Using Dynamic Optimization For Control Of Real Rate Cpu Resource Management Applications, Varin Vahia, Ashvin Goel, David Steere, Jonathan Walpole, Molly H. Shor
Computer Science Faculty Publications and Presentations
In this paper we design a proportionalperiod optimal controller for allocating CPU to real rate multimedia applications on a generalpurpose computer system. We model this computer system problem in to state space form. We design a controller based on dynamic optimization LQR tracking techniques to minimize short term and long term time deviation from the current time stamp and also CPU usage. Preliminary results on an experimental set up are encouraging.
Design And Evaluation Of Processes For Fuel Fabrication: Quarterly Progress Report #9, Georg F. Mauer
Design And Evaluation Of Processes For Fuel Fabrication: Quarterly Progress Report #9, Georg F. Mauer
Fuels Campaign (TRP)
The ninth quarter of the project covered the following:
• Mr. Richard Silva continued the development of a simulation model with a Waelischmiller hot cell robot. Rich will continue to develop detailed 3D process simulation models as his M.Sc. thesis project.
• A paper on hot cell robotics was presented at the ANS Winter Annual Meeting and published in the ANS 2003 conference proceedings.
• Further advances on Concepts and Methods for VisionBased Hot Cell Supervision and control, focusing on rulebased object recognition (Ph.D. Student JaeKyu Lee)
• Graduate student Jamil Renno created simulations of more complex fuel manufacturing and fuel pin ...
HardwareBased Dynamic Storage Management For HighPerformance And RealTime Systems, Victor H. Lai
HardwareBased Dynamic Storage Management For HighPerformance And RealTime Systems, Victor H. Lai
All Computer Science and Engineering Research
Most modern application programs depend on dynamic storage management to handle allocation and deallocation of memory. Unfortunately conventional softwarebased storage managers are relatively low performance due to the latency associated with accessing DRAM memory. Consequently, developers of programs with very specialized memory requirements, such a realtime systems, often choose to manage memory manually at the applicationcode level. This practice can greatly increase performance but it can also significantly complicate the development process.
In this thesis we present the design, VHDL implementation and performance evaluation of hardwarebased storage manager called the Optimized Hardware Estranged Buddy System (OHEBS). The OHEBS implements four ...
Minimality Of Solution Update In Conflict Resolution: An Application Of Revision Programming To Von NeumannMorgenstern Approach, Inna Pivkina, Vladik Kreinovich
Minimality Of Solution Update In Conflict Resolution: An Application Of Revision Programming To Von NeumannMorgenstern Approach, Inna Pivkina, Vladik Kreinovich
Departmental Technical Reports (CS)
In a 1944 book that started game theory (and mathematical approach to conflict resolution), von Neumann and Morgenstern proposed the notion of a solution. When the situation changes, the old solution is often no longer a solution, so it needs to be updated. In practical applications, it is usually desirable to keep the solution change "minimal" in some reasonable sense. We show that for a seemingly straightforward formalization of this minimality, checking whether a change is minimal is NPhard. We also show that by representing the notion of a solution as a collection of revision rules, we can produce a ...
Turning An Articulated Truck On A Spreadsheet, Jim Mcgovern
Turning An Articulated Truck On A Spreadsheet, Jim Mcgovern
Articles
This paper describes how a standard office spreadsheet application was used to set up an engineering model for the simulation and analysis of the turning of articulated trucks
Combined Beamforming And SpaceTime Block Coding With A Sparse Array Antenna, Robert H. MorelosZaragoza, Mohammad Ghavami
Combined Beamforming And SpaceTime Block Coding With A Sparse Array Antenna, Robert H. MorelosZaragoza, Mohammad Ghavami
Robert Henry MorelosZaragoza
In this paper, we continue our investigation of joint beamforming and transmit diversity with spacetime block coding. In particular, the performance of a fourelement array antenna is considered, in the context of an indoor wireless communication system. The main contribution is to show that transmit diversity may be practically achieved, even with correlated beams produced by a sparse array antenna.
Design And Optimization Of Long Term Monitoring Systems For Contaminated Environmental Sites, Amit Deshpande
Design And Optimization Of Long Term Monitoring Systems For Contaminated Environmental Sites, Amit Deshpande
FIU Electronic Theses and Dissertations
The purpose of this study was to design and optimize longterm monitoring systems for contaminated environmental sites. This study identified some major issues related to longterm monitoring systems, including those related to sensors, communications, security, and data acceptability. The state of the art among the various components was detailed with benefits and limitations identified for all. It focused on how optimization of performance criteria is achieved in automated longterm monitoring systems. This study particularly focused on a tradeoff analysis for determining the optimal longterm monitoring system design. A set of longterm monitoring scenarios was presented and the optimized longterm monitoring ...
Storage Coalescing, Delvin C. Defoe
Storage Coalescing, Delvin C. Defoe
All Computer Science and Engineering Research
Typically, when a program executes, it creates objects dynamically and requests storage for its objects from the underlying storage allocator. The patterns of such requests can potentially lead to internal fragmentation as well as external fragmentation. Internal fragmentation occurs when the storage allocator allocates a contiguous block of storage to a program, but the program uses only a fraction of that block to satisfy a request. The unused portion of that block is wasted since the allocator cannot use it to satisfy a subsequent allocation request. External fragmentation, on the other hand, concerns chunks of memory that reside between allocated ...
Novel Approaches To Numerical Software With Result Verification, Laurent Granvilliers, Vladik Kreinovich, Norbert Mueller
Novel Approaches To Numerical Software With Result Verification, Laurent Granvilliers, Vladik Kreinovich, Norbert Mueller
Departmental Technical Reports (CS)
Traditional design of numerical software with result verification is based on the assumption that we know the algorithm f(x_1,...,xn) that transforms input x1,...,xn into the output y=f(x1,...,xn), and we know the intervals of possible values of the inputs. Many reallife problems go beyond this paradigm. In some cases, we do not have an algorithm f, we only know some relation (constraints) between xi and y. In other cases, in addition to knowing the intervals [xi], we may know some relations between xi; we may have some information about the probabilities of different values of ...
Separating Components In IntervalValued Images, Marilton Sanchotene De Aguiar, Gracaliz Pereira Dimuro, Antonio Carlos Da Rocha Costa, Andrei Finkelstein, Vladik Kreinovich
Separating Components In IntervalValued Images, Marilton Sanchotene De Aguiar, Gracaliz Pereira Dimuro, Antonio Carlos Da Rocha Costa, Andrei Finkelstein, Vladik Kreinovich
Departmental Technical Reports (CS)
In many applications of imaging, we would like to know whether we have an image of a singlecomponent object or an image of an object that consists of several components. Many algorithms have been designed to solve this problem; however, these algorithms are all heuristic. Often, according to some reasonable methods, we have a single component, while according to some other equally reasonable methods, the same image have multiple components. It is desirable to produce reliable methods, so that if a method claims that there are multiple components, then it should mean that the observed data is incompatible with the ...
A New Differential Formalism For IntervalValued Functions And Its Potential Use In Detecting 1D Landscape Features, Vladik Kreinovich, Hung T. Nguyen, Gracaliz Pereira Dimuro, Antonio Carlos Da Rocha Costa, Benjamin Rene Callejas Bedregal
A New Differential Formalism For IntervalValued Functions And Its Potential Use In Detecting 1D Landscape Features, Vladik Kreinovich, Hung T. Nguyen, Gracaliz Pereira Dimuro, Antonio Carlos Da Rocha Costa, Benjamin Rene Callejas Bedregal
Departmental Technical Reports (CS)
In many practical problems, it is important to know the slope (derivative) dy/dx of one quantity y with respect to some other quantity x. For example, different 1D landscape features can be characterized by different values of the derivative dy/dx, where y is an altitude, and x is a horizontal coordinate. In practice, we often know the values of y(x) for different x with interval uncertainty. How can we then find the set of possible values of the slope? In this paper, we formulate this problem of differentiating intervalvalues functions in precise terms, and we describe an ...
RealTime Algorithms For Statistical Analysis Of Interval Data, Berlin Wu, Hung T. Nguyen, Vladik Kreinovich
RealTime Algorithms For Statistical Analysis Of Interval Data, Berlin Wu, Hung T. Nguyen, Vladik Kreinovich
Departmental Technical Reports (CS)
When we have only interval ranges [xi] of sample values x1,...,xn, what is the interval [V] of possible values for the variance V of these values? There are quadratic time algorithms for computing the exact lower bound V on the variance of interval data, and for computing V+ under reasonable easily verifiable conditions. The problem is that in real life, we often make additional measurements. In traditional statistics, if we have a new measurement result, we can modify the value of variance in constant time. In contrast, previously known algorithms for processing interval data required that, once a new ...
Sensitivity Analysis Of Neural Control, ChinWang Tao, Hung T. Nguyen, J. T. Yao, Vladik Kreinovich
Sensitivity Analysis Of Neural Control, ChinWang Tao, Hung T. Nguyen, J. T. Yao, Vladik Kreinovich
Departmental Technical Reports (CS)
We provide explicit formulas that describe how sensitive the resulting signal of a neural network is to the measurement errors with which we measure the inputs.
Examination Of Focused Beam Propagation Through A Finite NonReciprocal Planar Chiral Slab Using Complex Fresnel Coefficients And Dual Transforms, Monish Ranjan Chatterjee, Sumit Nema, Partha P. Banerjee
Examination Of Focused Beam Propagation Through A Finite NonReciprocal Planar Chiral Slab Using Complex Fresnel Coefficients And Dual Transforms, Monish Ranjan Chatterjee, Sumit Nema, Partha P. Banerjee
Electrical and Computer Engineering Faculty Publications
Recently, uniform plane wave propagation across a nonchiralchiral interface was examined via the development of appropriate Fresnel coefficients. In this extension, propagation of focused uniform and profiled beams through a finite, planar nonreciprocal chiral slab is investigated using complex Fresnel coefficients via angular plane wave decomposition and dual transforms.
Greedy Algorithms For Optimizing Multivariate Horner Schemes, Martine Ceberio, Vladik Kreinovich
Greedy Algorithms For Optimizing Multivariate Horner Schemes, Martine Ceberio, Vladik Kreinovich
Departmental Technical Reports (CS)
For univariate polynomials f(x1), Horner scheme provides the fastest way to compute the value. For multivariate polynomials, several different version of Horner scheme are possible; it is not clear which of them is optimal. In this paper, we propose a greedy algorithm that will hopefully lead to good computation times.
A univariate Horner scheme has another advantage: if the value x1 is known with uncertainty, and we are interested in the resulting uncertainty in f(x1), then Horner scheme leads to a better estimate for this uncertainty than many other ways of computing f(x1). The second greedy algorithm ...
Fast Multiplication Of Interval Matrices (Interval Version Of Strassen's Algorithm), Martine Ceberio, Vladik Kreinovich
Fast Multiplication Of Interval Matrices (Interval Version Of Strassen's Algorithm), Martine Ceberio, Vladik Kreinovich
Departmental Technical Reports (CS)
Strassen's algorithm multiplies two numerical matrices fast, but when applied to interval matrices, leads to excess width. We use Rump's interval arithmetic to propose an interval version of Strassen's algorithm whose only excess width is in second order terms.
Combined Beamforming And SpaceTime Block Coding With Sparse Array Antennas, Robert H. MorelosZaragoza
Combined Beamforming And SpaceTime Block Coding With Sparse Array Antennas, Robert H. MorelosZaragoza
Robert Henry MorelosZaragoza
In this paper, the combination of beamforming and spacetime block coding is investigated. An adaptive scheme for the assignment of transmission beams is proposed. Data for the determination of beams are obtained using a triangular switchbeam array antenna at the transmitter. The number of peak points is determined from the data and a prescribed threshold level. Orthogonal spacetime block coding is then applied to the transmission beams. We examine the distribution of the number of assigned beams as a function of indoor wireless channel parameters. Also, the effects of a small number of array elements and associated correlated beams, and ...
Interval Approach To Phase Measurements Can Lead To Arbitrarily Complex Sets  A Theorem And Ways Around It, Bharat C. Mulupuru, Vladik Kreinovich, Roberto Osegueda
Interval Approach To Phase Measurements Can Lead To Arbitrarily Complex Sets  A Theorem And Ways Around It, Bharat C. Mulupuru, Vladik Kreinovich, Roberto Osegueda
Departmental Technical Reports (CS)
We are often interested in phases of complex quantities; e.g., in nondestructive testing of aerospace structures, important information comes from phases of Eddy current and magnetic resonance.
For each measurement, we have an upper bound D on the measurement error dx=Xx, so when the measurement result is X, we know that the actual value x is in [XD,X+D]. Often, we have no information about probabilities of different values, so this interval is our only information about x. When the accuracy is not sufficient, we perform several repeated measurements, and conclude that x belongs to the intersection ...
Cs 79001: Introduction To Parallel Algorithms, Natsuhiko Futamura
Cs 79001: Introduction To Parallel Algorithms, Natsuhiko Futamura
Computer Science & Engineering Syllabi
Lowcost parallel computers such as PC clusters are becoming available, and many previously unsolvable problems can be solved using such computers. However, designing algorithms that perform well on parallel computers is often challenging. The focus of this course is on learning how to design algorithms for parallel computers and how to evaluate them.
A Full FunctionBased Calculus Of Directed And Undirected Intervals: Markov's Interval Arithmetic Revisited, Juergen Wolff Von Gudenberg, Vladik Kreinovich
A Full FunctionBased Calculus Of Directed And Undirected Intervals: Markov's Interval Arithmetic Revisited, Juergen Wolff Von Gudenberg, Vladik Kreinovich
Departmental Technical Reports (CS)
This paper proposes a new interpretation of intervals as classes of functions having the same domain. Interval operations are seen as operations on these classes. This approach allows to recover Markov's directed interval arithmetic by taking into account the monotonicity of the functions.
Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why, What Next?, Nedialko S. Nedialkov, Vladik Kreinovich, Scott A. Starks
Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why, What Next?, Nedialko S. Nedialkov, Vladik Kreinovich, Scott A. Starks
Departmental Technical Reports (CS)
In interval computations, the range of each intermediate result r is described by an interval [r]. To decrease excess interval width, we can keep some information on how r depends on the input x=(x1,...,xn). There are several successful methods of approximating this dependence; in these methods, the dependence is approximated by linear functions (affine arithmetic) or by general polynomials (Taylor series methods). Why linear functions and polynomials? What other classes can we try? These questions are answered in this paper.