% Last edited on 2022-11-03 18:19:29 by stolfi % Supplementary references (neither by Jorge Stolfi nor by his students) %%% ???? %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%% 2022 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @article{xuf-yan-wan-liz-wan-22-aa-elbuff, author = {Fengjie Xu and Guolai Yang and Liqun Wang and Zixuan Li and Xiuye Wang}, title = {A Robust Game Optimization for Electromagnetic Buffer under Parameters Uncertainty}, journal = {Engineering with Computers}, volume = {??}, pages = {??-??}, doi = {10.1007/s00366-021-01561-x}, year = 2022, month = jan, comment = {Uses AA. Game theory for optimization??}, abstract = {The resistance force variation of the electromagnetic buffer is its core performance. To reduce its peak values, this paper designs a segmented electromagnetic buffer scheme, and further proposes a novel optimization framework based on robust game theory considering the parameter uncertainty. The most challenging step of the robust Nash problem is to identify the worst-case scenario of the cost function under uncertainty. To attack this, an interval model is applied to describe the necessary uncertainty. Using the affine arithmetic, the uncertainty quantity is re-written into affine form; thus, the worst-case scenario of the cost function can be directly obtained. However, affine arithmetic can only deal with functions with explicit expressions. To address such deficiency, the Chebyshev polynomial expansion is formulated to convert the cost functions of the original electromagnetic buffer model into explicit expressions. The detailed assessment results demonstrate the effectiveness of the proposed approach for better resultant force performance; besides, it significantly improves the computational efficiency without compromising accuracy when solving the robust Nash equilibrium.}, } @misc{rev-22-aa-iterate, title = {Affine Iterations and Wrapping Effect: Various Approaches}, author = {Nathalie Revol}, howpublished = {ArXiv article, number 2201.00513}, doi = {10.48550/arXiv.2201.00513}, year = 2022, month = jan, comment = {Spurious google hit. But may be a possible application of AA}, abstract = {Affine iterations of the form $x(n+1) = Ax(n) + b$ converge, using real arithmetic, if the spectral radius of the matrix $A$ is less than 1. However, substituting interval arithmetic to real arithmetic may lead to divergence of these iterations, in particular if the spectral radius of the absolute value of $A$ is greater than 1. We will review different approaches to limit the overestimation of the iterates, when the components of the initial vector $x(0)$ and $b$ are intervals. We will compare, both theoretically and experimentally, the widths of the iterates computed by these different methods: the naive iteration, methods based on the QR-and SVD-factorization of $A$, and Lohner's QR-factorization method. The method based on the SVD-factorization is computationally less demanding and gives good results when the matrix is poorly scaled, it is superseded either by the naive iteration or by Lohner's method otherwise.} } @techreport{ceb-kos-kre-22-aa-optim, title = {Towards Optimal Techniques Intermediate Between Interval and Affine, Affine and Taylor}, author = {Martine Ceberio and Olga Kosheleva and Vladik Kreinovich}, institution = {The University of Texas at El Paso}, year = 2022, month = jan, number = {UTEP-CS-22-12}, comment = {The problem of best accuracy-time tradeoff formulated as optimization problem}, abstract = {In data processing, it is important to gauge how input uncertainty affects the results of data processing. Several techniques have been proposed for this gauging, from interval to affine to Taylor techniques. Some of these techniques result in more accurate estimates but require longer computation time, others' results are less accurate but can be obtained faster. Sometimes, we do not have enough time to use more accurate (but more time-consuming) techniques, but we have more time than needed for less accurate ones. In such cases, it is desirable to come up with intermediate techniques that would utilize the available additional time to get somewhat more accurate estimates. In this paper, we formulate the problem of selecting the best intermediate techniques, and provide a solution to this optimization problem.} } @article{lia-zha-lej-zha-liz-22-aa-sensit, author = {Xiaobing Liao and Min Zhang and Jian Le and Lina Zhang and Zicheng Li}, title = {Global Sensitivity Analysis of Static Voltage Stability Based on Extended Affine Model}, journal = {Electric Power Systems Research}, volume = {208}, pages = {Article 107872}, year = 2022, month = jun, issn = {0378-7796}, doi = {10.1016/j.epsr.2022.107872}, comment = {Says that extended AA is better than AA}, abstract = {Large scale centralized grid-connection of renewable energy significantly increases the uncertainty of a power system, and accurate analysis and quantitative evaluation of the impact of this uncertainty on the static voltage stability of a power system is the important premise and basis for improving the power system operation security. This paper studies a global sensitivity analysis method of the static voltage stability based on extended affine model. A static voltage stability interval evaluation model based on L index is constructed according to the extended affine arithmetic, and the global sensitivity analysis method based on variance decomposition is introduced to evaluate the importance of the input interval variables on the static voltage stability. The analysis of the simulation results on the IEEE systems shows that the proposed method can suppress the effect of interval expansion more effectively than the traditional affine algorithm, and the global sensitivity analysis method based on analytic variance decomposition can identify the importance of input interval variables more effectively.} } @inproceedings{riv-fra-pus-22-aa-compile, author = {Joao Rivera and Franz Franchetti and Markus P{\"u}schel}, title = {A Compiler for Sound Floating-Point Computations using Affine Arithmetic}, booktitle = {Poc. International Symposium on Code Generation and Optimization (CGO 2022)}, volume = {}, number = {}, pages = {66-78}, year = 2022, month = apr, doi = {}, url = {https://acl.inf.ethz.ch/publications/cgo22-p57-preprint.pdf}, comment = {Compilation of formulas into AA operations, with static analysis to optimize}, abstract = {Floating-point arithmetic is extensively used in scientific and engineering applications to approximate real arithmetic. Unfortunately, floating-point arithmetic is not a sound implementation of real arithmetic, i.e., it may produce different results, does not provide error guarantees, and the errors can become arbitrarily large. In this paper, we introduce SafeGen, a source-to-source compiler that rewrites a given C program using floating-point arithmetic to an efficient C program performing the same computation soundly, i.e., it returns an error bound that is guaranteed to contain the correct result of the program if it had been executed in real arithmetic. Equivalently, it gives a precision certificate on the number of correct bits in the result. SafeGen uses affine arithmetic (AA) that keeps accuracy high compared to interval arithmetic by preserving linear correlations between variables. To mitigate its high cost, SafeGen combines a novel form of static analysis to identify these correlations with a flexible policy-based approach for their selection. SafeGen supports SIMD intrinsics in the input and can output SIMDoptimized code. Our results show that SafeGen-generated code is 30--70 times faster than manually rewritten code using AA libraries. Equivalently, SafeGen can offer many more bits of certified accuracy within a reduced time budget.} } @article{zhe-wan-sha-zha-liy-22-aa-powflow, author = {Zheng, Wendi and Wang, Xiangjie and Shao, Zhenguo and Zhang, Min and Li, Yixin}, title = {A Modified Affine Arithmetic-Based Interval Optimization for Integrated Energy System with Multiple Uncertainties}, journal = {Journal of Renewable and Sustainable Energy}, volume = {14}, number = {1}, pages = {016302}, year = 2022, doi = {10.1063/5.0079306}, comment = {Modified AA?}, abstract = {In integrated energy systems, uncertainties cause day-ahead scheduling plans to be uncertain rather than an exact solution. However, traditional interval optimization models ignore the correlation between variables, resulting in an over-conservative range of solutions. To overcome this limitation, the present paper proposes a modified affine arithmetic to establish an interval optimal scheduling model based on deterministic optimization. The correlation between different variables is tracked by sharing noise terms, and the solution in affine form is transformed into a more intuitive interval solution by a modified affine approximation method and linear relaxation method. Finally, with the minimum midpoint and radii of daily operating cost interval as the objective function, the multi-objective function is converted into a single-objective function through Lagrange multiplication to solve the model. In a case study, the proposed method is compared with the Monte Carlo simulation method and the traditional interval optimization method without affine arithmetic. The simulation results show that the radii of the interval solutions obtained by the proposed method is 9.39{\%} less than the traditional interval arithmetic at the 15{\%} level of uncertainty.} } @article{pep-car-vac-djo-22-aa-markov, author = {Antonio Pepiciello and Fabrizio {De Caro} and Alfredo Vaccaro and Sasa Djokic}, title = {Affine Arithmetic-Based Reliable Estimation of Transition State Boundaries for Uncertain Markov Chains}, journal = {Electric Power Systems Research}, volume = {204}, pages = {107711}, year = 2022, issn = {0378-7796}, doi = {10.1016/j.epsr.2021.107711}, abstract = {Markov Chain-based models have been extensively used in numerous power system applications, ranging from decision support systems, to reliability and resilience analysis. The state transition probabilities, which determine the overall model dynamics, have been traditionally described by deterministic values. This common assumption might not be suitable for analyzing modern power systems, where large number of complex and correlated uncertainties could significantly affect the correct evaluation and estimation of both model parameters and model outputs. In addressing that problem, this paper advocates the role of affine arithmetic, by proposing a reliable framework for Markov Chain transient analysis in the presence of data uncertainties. The main idea is to represent the uncertainties in state transition probabilities through affine forms, which then allow to apply affine arithmetic-based operators and to identify the corresponding transient state probabilities. Two case studies are presented and discussed, in order to demonstrate the effectiveness of the proposed methodology in practical power system problems and applications.} } @article{zha-son-che-cho-22-aa-battery, author = {Xuehan Zhang and Yongju Son and Taesu Cheong and Sungyun Choi}, title = {Affine-Arithmetic-Based Microgrid Interval Optimization Considering Uncertainty and Battery Energy Storage System Degradation}, journal = {Energy}, volume = {242}, pages = {123015}, year = 2022, doi = {0.1016/j.energy.2021.123015}, abstract = {Microgrids can effectively integrate renewable energy sources (RESs) and provide power for local customers. However, uncertainties of RESs and loads pose challenges to microgrid operation. The traditional point optimization method is unrealistic, and the widely used stochastic optimization (SO) method is time-consuming. Besides, battery energy storage systems (BESSs) are critical dispatchable devices to alleviate adverse effects of uncertainty, so an accurate nonlinear degradation cost model of BESSs should also be proposed. To handle such problems, the paper proposes an affine--arithmetic (AA)-based microgrid interval optimization (IO) method considering uncertainty and BESS degradation. First, the AA theory is introduced to model the RES and load variation ranges as intervals and calculate the interval uncertainty. Then, a nonlinear BESS degradation cost model is proposed, which can assess battery degradation costs considering different charging and discharging behaviors. The nondominated sorting genetic algorithm-II (NSGA-II) is employed to solve the proposed microgrid IO framework. For validation, the proposed IO method was compared with the point optimization method and SO method under various uncertainty realizations in a modified IEEE 33 bus system. The simulation results indicated the effectiveness of the proposed IO method in terms of an equilibrium between the simulation time and optimization performance.} } %%% 2021 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @article{zha-zha-21-aa-multopt, author = {Hongfen Zhang and Youchao Zhang}, title = {Research on Interval Multi-Objective Optimal Power Flow in {AC-DC} Systems Considering Wind Power Fluctuation}, month = feb, year = 2021, doi = {10.1177/0309524X21992772}, comment = {Uses AA to model power flow, combined with particle swarm}, abstract = {Aiming at the influence of the uncertainty of power system operating parameters such as wind power fluctuation on AC-DC hybrid system, an interval optimal power flow calculation method based on interval and affine arithmetic is proposed in this paper. First, AC and DC interval power flow model is constructed based on the relationship between interval and affine arithmetic, and the uncertainties such as the new energy generation output of the system are expressed as interval variables; static security performance index (PI) is introduced in AC-DC multi-objective optimal power flow objective functions, which take the system’s power generation cost and network loss into account; the Pareto optimal solution set is distributed uniformly in space by using the particle swarm algorithm to solve the interval optimal power flow model. Finally, MATLAB simulation examples are used to verify that the method can optimize the system’s power generation cost, network loss and static safety index while considering wind power fluctuation.} } @article{tot-cas-hen-mes-21-aa-globop, author = {B. G.-Tóth and L. G. Casado and E. M. T. Hendrix and F. Messine}, title = {On New Methods to Construct Lower Bounds in Simplicial Branch and Bound Based on Interval Arithmetic.}, journal = {Journal of Global Optimization}, volume = {80}, number = {779–804}, pages ={}, year = 2021, doi = {10.1007/s10898-021-01053-8}, comment = {Branch and bound using simplicial (rather than box) domains and AA}, abstract = {Branch and Bound (B{\&}B) algorithms in Global Optimization are used to perform an exhaustive search over the feasible area. One choice is to use simplicial partition sets. Obtaining sharp and cheap bounds of the objective function over a simplex is very important in the construction of efficient Global Optimization B{\&}B algorithms. Although enclosing a simplex in a box implies an overestimation, boxes are more natural when dealing with individual coordinate bounds, and bounding ranges with Interval Arithmetic (IA) is computationally cheap. This paper introduces several linear relaxations using gradient information and Affine Arithmetic and experimentally studies their efficiency compared to traditional lower bounds obtained by natural and centered IA forms and their adaption to simplices. A Global Optimization B{\&}B algorithm with monotonicity test over a simplex is used to compare their efficiency over a set of low dimensional test problems with instances that either have a box constrained search region or where the feasible set is a simplex. Numerical results show that it is possible to obtain tight lower bounds over simplicial subsets.} } @incollection{cha-21-aa-struct, title = {Affine approach in solving linear structural dynamic problems with uncertain parameters}, editor = {Snehashish Chakraverty}, booktitle = {New Paradigms in Computational Modeling and Its Applications}, chapter = {8}, publisher = {Academic Press}, pages = {97-121}, year = 2021, isbn = {978-0-12-822133-4}, doi = {10.1016/B978-0-12-822133-4.00003-7}, author = {S. Rout and Snehashish Chakraverty}, comment = {Uses AA to compute eigenvalues}, abstract = {The present chapter proposes an affine approach for computing the linear structural dynamic problems having uncertain and nonprobabilistic model parameters with the help of affine arithmetic operations. The solutions of linear dynamic problems of structures lead to eigenvalue problems, viz., generalized and standard eigenvalue problems. When there is a deficiency of large data, the material and geometric properties of the said problems may be considered as intervals due to uncertainty. The error explosion problem occurs in interval arithmetic, which leads to wide-ranging results. In this case, affine arithmetic may be developed to handle the uncertainty with ease. Using this affine arithmetic, we have included a new procedure for solving standard as well as generalized interval eigenvalue problems having uncertainty in the form of closed intervals. Several numerical examples related to various applications of structural dynamic problems have been worked out to illustrate the reliability and efficiency of the present approach.} } @article{ngo-wuw-21-aa-reldist, author = {Ngo, Vietcuong and Wu, Wenchuan}, journal = {IEEE Transactions on Smart Grid}, title = {Interval Distribution Power Flow With Relative-Distance-Measure Arithmetic}, year = 2021, volume = {12}, number = {5}, pages = {3858-3867}, doi = {10.1109/TSG.2021.3074018}, issn = {1949-3061}, month = sep, comment = {Proposes RDM as better than AA. What is it?}, abstract = {Interval distribution power flow can analyze the uncertainties incurred by the random fluctuations of distributed renewable generation and load demand in distribution networks. The conventional interval arithmetic (IA) and affine arithmetic (AA) cannot fully apply the characteristics of general algebra: associativity, inverse elements, distributive law, so the IA or AA based interval power flows (IPFs) are either very conservative or unreliable. Relative-Distance-Measure (RDM) arithmetic can overcome these defects in the conventional arithmetic for interval analysis and therefore a RDM based IPF is proposed in this paper. Furthermore, a linear programming contractor (LPC) is developed to solve this RDM based IPF, which can iteratively transform the IPF problem into serial linear optimization models and its results are reliable. Simulation results of IEEE 123-bus test systems show that the proposed IPF can obtain much better results than those of baseline methods in terms of accuracy and reliability.} } @article{wan-don-zha-zha-21-aa-bilevel, author = {Wang, Shouxiang and Dong, Yichao and Zhao, Qianyu and Zhang, Xu}, title = {Bi-Level Multi-Objective Joint Planning of Distribution Networks Considering Uncertainties}, journal = {Journal of Modern Power Systems and Clean Energy}, year = 2021, volume = {}, number = {}, pages = {1-13}, doi = {10.35833/MPCE.2020.000930}, issn = {2196-5420}, comment = {Application to power grids}, abstract = {With the increasing penetration of photovoltaics in distribution networks, the adaptability of distribution network under uncertainties needs to be considered in the planning of distribution systems. In this paper, the interval arithmetic and affine arithmetic are applied to deal with uncertainties, and an affine arithmetic based bi-level multi-objective joint planning model is built, which can obtain the planning schemes with low constraint violation risk, high reliability and strong adaptability. On this basis, a bi-level multi-objective solution methodology using affine arithmetic based non-dominated sorting genetic algorithm II is proposed, and the planning schemes that simultaneously meet economy and adaptability goals under uncertainties can be obtained. To further eliminate bad solutions and improve the solution qualities, an affine arithmetic based dominance relation weakening criteria and a deviation distance based modification method are proposed. A 24-bus test system and a Chinese 10kV distribution system are used for case studies. Different uncertainty levels are compared, and a sensitivity analysis of key parameters is conducted to explore their impacts on final planning schemes. The simulation results verify the advantages of proposed affine arithmetic based planning method.} } @article{liu-wan-zha-wan-21-aa-powflow, author = {Liu, Qi and Wang, Shouxiang and Zhao, Qianyu and Wang, Kai}, title = {Interval Power Flow Calculation Algorithm for Multi-Terminal {DC} Distribution Networks Considering Distributed Generation Output Uncertainties}, journal = {IET Generation, Transmission {\&} Distribution}, year = 2021, volume = {15}, number = {5}, pages = {986-996}, doi = {10.1049/gtd2.12074}, abstract = {Abstract An interval power flow calculation (PFC) algorithm for multi-terminal DC distribution networks is proposed to handle the uncertainties of distributed generation output powers and loads. Firstly, an equivalent resistance is introduced to represent the effect of droop control in DC distribution networks. The power losses of the equivalent resistance are offset by adding the injection powers to droop nodes, which guarantees the precision of the equivalent resistance model. The Newton--Raphson method is used for deterministic PFC based on the equivalent resistance, and it is applicable to DC distribution networks with different kinds of network topologies and voltage source converter control modes. Secondly, based on the deterministic PFC algorithm and affine arithmetic, an interval PFC algorithm is presented to handle the uncertainties of distributed generation output powers and loads. The affine arithmetic based interval PFC algorithm not only can determine power flow intervals quickly and accurately, but also can analyse the influences of distributed generation outputs to nodal voltages. Finally, a series of test systems are used to validate the proposed algorithms. Simulation results illustrate the accuracy and efficiency of the deterministic PFC algorithm and the interval PFC algorithm for multi-terminal DC distribution networks.} } @article{dor-20-aa-routhdelgam, author = {H. Mallesam Dora}, title = {Model Order Reduction of Discrete Uncertain System Using Modified $\delta$-$\gamma$ {Routh} Approximation and Affine Arithmetic Method}, journal = {Journal of Advanced Research in Electrical Engineering and Technology}, volume = {3}, number = {1}, year = 2020, pages = {22--25}, note = {Published in 2021-10-03}, url = {http://www.thejournalshouse.com/index.php/electrical-engg-technology/article/view/464}, comment = {What is Routh approximation?}, abstract = {This paper deals with a new technique for order reduction of higher order discrete uncertain system into lower order discrete time interval system. Using modified Routh Approximation and Affine Arithmetic developed to obtained numerator and denominator of reduced order model. The numerator and denominator of reduced order model is evaluated using modified $\delta$- and $gamma$-table respectively. Which is calculated based on Dolgin {\&} Zehab's concepts [3]. For understanding the effectiveness of the proposed method, it has been applied on two standard numerical examples, it is also found that the proposed method gives less integral square error and better approximation to the original higher order system.}, altkeys = {dor-21-aa-routhdelgam} } @article{dor-20-aa-routh, author = {H. Mallesam Dora}, title = {New Aspect in Order Reduction of Large-scale Uncertain {MIMO} System Using Modified Routh Approximation and Affine Arithmetic}, journal = {Journal of Advanced Research in Electrical Engineering and Technology}, volume = {2}, number = {1}, year = 2020, pages = {1--5}, note = {Published in 2021-10-03}, url = {http://www.thejournalshouse.com/index.php/SignalProcessing-Applications/issue/view/108}, comment = {What is Routh approximation? What is MIMO?}, abstract = {This paper presents the Modified Routh Approximation (MRA) and Affine Arithmetic (AA) methods for obtaining the reduced order model (ROM) of higher order model (HOM).The reduced order model of a large-scale Uncertain MIMO System is required to simplify analysis of any system. The proposed method is compared with different MIMO uncertain systems in the literature. It is analyze that the proposed method is nearly identical in behavior to that of with original higher order systems. Observed numerical examples are considered to illustrate the effectiveness of the proposed method.}, altkeys = {dor-21-aa-routh} } @inproceedings{wan-zhe-21-aa-mumicro, author = {Wang, Xiangjie and Zheng, Wendi}, title = {Optimal Dispatch of Multi-Microgrids System Based On Affine Arithmetic}, booktitle = {Proc. 2nd IEEE China International Youth Conference on Electrical Engineering (CIYCEE 2021)}, year = 2021, volume = {}, number = {}, pages = {1-6}, doi = {10.1109/CIYCEE53554.2021.9676774}, month = dec, abstract = {With the development of the integrated energy system, a distribution area is usually composed of multiple microgrid systems, forming the multi-microgrid system of electricity, gas and heat combined supply. In order to maximize the interests of energy service companies, this paper establishes an interval optimization scheduling model of multi-microgrid integrated energy systems considering multi-energy complementarity and energy interaction between multi-micro grid. In addition, in order to solve the disadvantages of traditional interval optimization methods that are too conservative, affine arithmetic is used to represent the uncertainty of prediction variables, and the correlation between prediction variables of different microgrids is traced by the noise terms in affine arithmetic. Moreover, the effectiveness and applicability of this method are analyzed by comparing with monte Carlo simulation method and interval optimization method. Simulation results show that when the uncertainty is 15{\%}, the width of the interval solution obtained by this method is 16.25{\%} smaller than that of the interval arithmetic.} } @inproceedings{ras-sch-21-aa-powflex, author = {Rasti, Sasan J. and Schegner, Peter}, title = {A Novel Approach to Describe and Aggregate Multi-Energy Flexibility in Cellular Energy Systems Using Affine Arithmetic}, booktitle = {Proc. Power Engineering Society (ETG) Congress 2021}, year = 2021, volume = {}, number = {}, pages = {1-6}, month = mar, abstract = {Flexibilities in Energy Systems are required to integrate renewable energy sources such as Photovoltaic and Wind Power. Cellular Energy Systems are discussed as a method to integrate and manage flexibilities such as Electrical Vehicles, Batteries and Controllable Loads on different levels of the Energy System. However, it is lacking a holistic flexibility model when extending the approach to Multi-Energy Systems (Electrical and Thermal Storages, Heat Pumps, CHPs, Fuel Cells, Electrolyzers etc.). This paper presents a flexibility model based on Affine Arithmetic which specifies allowed power and energy ranges while considering relations between time steps and energy forms.} } @inproceedings{mor-pen-lop-fel-21-aa-3phase, author = {Mor{\'a}n, John Pe{\~n}aloza and L{\'o}pez, Julio C. and Feltrin, Antonio Padilha}, booktitle = {IEEE PES Innovative Smart Grid Technologies Conference - Latin America (ISGT-LA 2021)}, title = {Three-Phase Optimal Power Flow based on Affine Arithmetic}, year = 2021, volume = {}, number = {}, pages = {1-5}, doi = {10.1109/ISGTLatinAmerica52371.2021.9543033}, issn = {2643-8798}, month = sep, comment = {Reduced AA}, abstract = {This paper presents a non-linear stochastic mathematical formulation for the three-phase optimal power flow problem, which addresses the uncertainties of both the load and the renewable generation using the self-validation method called Affine Arithmetic. The affine shapes for tree-phase variables was performed using the theoretical approach of Reduced Affine Arithmetic together with the Chebyshev approximation method for non-affine operations. The stochastic mathematical model is formulated into as an equivalent optimization problem through a set of affine operators to later be solved by a two-stage stochastic optimization problem. Two three-phase distribution systems 19-bus and 25-bus are used to show the effectiveness of the proposed methodology.} } @misc{imm-21-aa-descr, title = {Affine Arithmetic}, author = {Fabian Immler}, year = 2021, month = dec, url = {https://www.isa-afp.org/browser_info/current/AFP/Affine_Arithmetic/document.pdf}, howpublished = {Online dicument}, comment = {Detailed description of AA with extra ops and algorithms. Intersection with a hyperplane.}, abstract = {We give a formalization of affine forms [1, 2] as abstract representations of zonotopes. We provide affine operations as well as overapproximations of some non-affine operations like multiplication and division. Expressions involving those operations can automatically be turned into (executable) functions approximating the original expression in affine arithmetic. Moreover we give a verified implementation of a functional algorithm to compute the intersection of a zonotope with a hyperplane, as described in the paper [3].} } @article{adu-raj-adu-21-aa-capac, author = {Bala Surendra Adusumilli and Vinod Raj and Vijaya Bhaskar Adusumilli}, title = {Capacitor Placement and Sizing to Minimize Losses in a Radial Distribution Network Considering Uncertainty Using Modified Affine Arithmetic Division}, journal = {Sustainable Energy, Grids and Networks}, volume = {27}, pages = {100492}, year = 2021, issn = {2352-4677}, doi = {10.1016/j.segan.2021.100492}, comment = {Optimizing capacitor placement in a power grid}, abstract = {In a distribution system, load and distributed generation connected to a feeder are subject to uncertainty. Conventional capacitor placement and sizing methods do not consider uncertainty in power injections, due to which the results may be erroneous. In literature, affine arithmetic (AA) is one of the tools used for incorporating uncertainty in power system analysis. However, conventional division operation in AA gives rise to extra noise terms in the resulting affine form, which are not due to the actual uncertainty sources but are due to the nonaffine operations. The present work incorporates modified AA division which does not generate any additional noises, thereby improving the accuracy. Buses in the distribution network are ranked in decreasing order of rate of change of active power loss in line with respect to the change in the effective reactive power flow in that line. The top three ranked buses are chosen as candidate buses for capacitor connection. The required affine reactive current injection at the candidate buses is calculated, and the corresponding affine capacitive kVAR required is obtained through modified AA-based backward/forward sweep (BFS) power flow analysis. The intervals for the cost incurred in losses, voltage profiles with and without capacitor are calculated, and savings for capacitor connected system is calculated. Switchable capacitors are used for reactive power injection. The proposed method is tested on 15, 33 and 118 bus radial distribution systems. The results show that the proposed modified AA method is accurate than existing interval arithmetic-based method.} } @article{zho-zho-hao-zha-21-aa-bridge, author = {Yun Zhou and Sai Zhou and Guanwang Hao and Jian Zhang}, title = {Bridge influence line identification based on big data and interval analysis with affine arithmetic}, journal = {Measurement}, volume = {183}, pages = {109807}, year = 2021, issn = {0263-2241}, doi = {10.1016/j.measurement.2021.109807}, comment = {Bridge health monitoring. "AA highly efficient"}, abstract = {On-site bridge influence line (IL) calibration traditionally relies upon attached sensors and the pre-weighing of trucks, which limits its popularity for engineering applications. This paper proposes a novel technology for bridge IL identification based on big data of pre-defined statistical vehicle information and interval analysis using the affine arithmetic (AA) method. By employing computer vision techniques, the individual axle-weight intervals were determined. The AA algorithm was used to obtain the interval solutions due to its high computation efficiency (only consumes 1 s). The binary classification algorithm for the support vector machine was adopted to extract the certain IL from the massive amount of IL interval data. The proposed method was verified by employing vehicle-bridge coupled numerical simulation and laboratory tests. Calculations results indicated that the errors of the distinguished IL obtained by the proposed method ranged from 7.43{\%} to 15.16{\%}. The ILs were successfully identified in multiple cases.} } @article{xuf-yan-wan-sun-21-aa-ballist, author = {Fengjie Xu and Guolai Yang and Liqun Wang and Quanzhao Sun}, title = {Interval Uncertain Optimization for Interior Ballistics Based on {Chebyshev} Surrogate Model and Affine Arithmetic}, journal = {Engineering Optimization}, volume = {53}, number = {8}, pages = {1331-1348}, year = 2021, publisher = {Taylor {\&} Francis}, doi = {10.1080/0305215X.2020.1790551}, comment = {Bullet chamber optimization?}, abstract = {This article proposes an interior ballistic interval optimization method with the consideration of parameter uncertainty. Interior ballistic parameters such as charge mass, web thickness, powder aperture and chamber volume are considered as design variables and described by interval number. A one-dimensional two-phase interior ballistic model is constructed, and the MacCormack scheme is used to calculate the interior ballistic parameters. A Chebyshev surrogate model is constructed to replace the one-dimensional two-phase interior ballistic model and applied to the optimization process. For each set of design variables, affine arithmetic is introduced to calculate the interval bounds of the performance index of the interior ballistic, avoiding nested double-loop optimization and improving computational efficiency. The Pareto-optimal solution is searched for by an improved non-dominant sorting genetic algorithm. An example is given to demonstrate the effectiveness of the proposed method.} } %%% 2020 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @misc{wan-stu-20-aa-pdebound, author = {Chenyu Wang and Matthew D. Stuber}, title = {Recent Advances in Bounding Transient {PDE} Models with Parametric Uncertainty}, year = 2020, howpublished = {Slides of a presentation at the 2020 AIChE Annual Meeting}, url = {https://psor.uconn.edu/wp-content/uploads/sites/1972/2021/01/AICHE_bounding_PDE_v3.pdf}, comment = {Uses AA to bound the solution of PDEs} } @phdthesis{fan-20-aa-powsec, title = {Improved Methodologies for Security of Electricity Supply of Future Power System}, author = {Fang, Duo}, school = {University of Edinburgh}, year = 2020, doi = {10.7488/era/929}, note = {Supervisors Djokic, Sasa and Harrison, Gareth}, comment = {Combines AA with probabilistic info}, abstract = {The security of electricity supply has always been important, but it has recently become one of the critical issues for the planning and operation of modern electricity networks. There are several reasons for that, including increased demands and deregulation of electricity markets, resulting in much lower infrastructural investments, which both pushed existing networks to operate closer to their security limits. The increasing penetration levels of variable and inherently non-dispatchable renewable energy resource, as well as the implementation of demand-responsive controls and technologies on the demand side, together with the application of real-time thermal ratings for system components, have introduced an unprecedented level of uncertainties into the system operation. These uncertainties present genuinely new challenges for the maintenance of high system security levels. The first contribution of this thesis is the development of advanced computational tools to strengthen the decision-making capabilities of system operators and ensure secure and economic operation under high uncertainty levels. It initially evaluates the hosting capacities for wind-based generation in a distribution network subject to operational security limits. In order to analyse the impacts of variations and uncertainties in the wind-based generation, loads and dynamic thermal ratings of network components, both deterministic and probabilistic approaches are applied for hosting capacity assessment at each bus, denoted as "locational hosting capacity", which is of interest to distributed generation (DG) developers. Afterwards, the locational hosting capacities are used to determine the hosting capacity of the whole network, denoted as "network hosting capacity", which is of primary interest to system operators. As the available hosting capacities change after the connection of any DG units, a sensitivity analysis is implemented to calculate the variations of the remaining hosting capacity for any number of DG units connected at arbitrary network buses. The second contribution of this thesis is a novel optimisation model for the active management of networks with a high amount of wind-based generation and utilisation of dynamic thermal ratings, which employs both probabilistic analysis and interval/affine arithmetic for a comprehensive evaluation of related uncertainties. Affine arithmetic is applied to deal with interval information, where the obtained interval solutions cover the full range of possible optimal solutions, with all realisations of uncertain variables. However, the interval solutions overlook the probabilistic characteristics of uncertainties, e.g. a likely very low probabilities around the edges of intervals. In order to consider realistic probability distribution information and to reduce overestimation errors, the affine arithmetic approach is combined with probabilistic (Monte Carlo) based analysis, to identify the suitable ranges of uncertainties for optimal balancing of risks and costs. Finally, this thesis proposes a general multi-stage framework for efficient management of post-contingency congestions and constraint violations. This part of the work uses developed thermal models of overhead lines and transformers to calculate the maximum lead time for system operators to resolve constraint violations caused by post-fault contingency events. The maximum lead time is integrated into the framework as the additional constraint, to support the selection of the most effective corrective actions. The framework has three stages, in which the optimal settings for volt-var controls, generation re-dispatch and load shedding are determined sequentially, considering their response times. The proposed framework is capable of mitigating severe constraint violations while preventing overheating and overloading conditions during the congestion management process. In addition, the proposed framework also considers the costs of congestion management actions so that the effective corrective actions can be selected and evaluated both technically and economically.} } @article{dor-nar-pas-20-aa-contrdes, author = {H Mallesam Dora and T. Narasimhulu and M. Pasumarthi}, title = {Design of Controller for Large-Scale Uncertain Systems Adopting Affine Arithmetic}, journal = {Journal of Advanced Research in Instrumentation and Control Engineering}, volume = {7}, number = {3--4}, year = 2020, keywords = {}, pages = {1-4}, doi = {10.24321/2456.1398.202002}, issn = {2456-1398}, comment = {Systems control design}, abstract = {In this article presents a new controller design technique for large scale uncertain systems. The new controller is designed through a reduced order system from certain high order system. In the projected reduction method, the numerator coefficients are obtained with $\gamma$-table while the denominator polynomial is achieved with $\delta$-table. An optimised reduced order model is derived with minimum value of ISE. In this proposed method gives better stability of the reduced order model, if consider the original stable high order system. A PID controller is designed for the high order original systems through its proposed reducer order model. Consider several numerical examples are available in the literature to illustrate the usefulness of the proposed method and it gives sufficient outcome.} } @inproceedings{rec-kor-gun-olb-20-aa-reach, author = {Rechmal-Lesse, Malgorzata and Koroa, Gerald Alexander and Gunawan Adhisantoso, Yeremia and Olbrich, Markus}, title = {Automatically Generated Nonlinear Analog Circuit Models Enclosing Variations with Intervals and Affine Forms for Reachability Analysis}, booktitle = {2020 23rd International Symposium on Design and Diagnostics of Electronic Circuits Systems (DDECS)}, year = 2020, volume = {}, number = {}, pages = {1-4}, keywords = {}, doi = {10.1109/DDECS50862.2020.9095655}, ISSN = {2473-2117}, month = apr, comment = {Static analysis of analog circuits and reachability analysis}, abstract = {In contrast to the formal verification of digital circuits, analog formal verification requires appropriate tolerances of the device parameters. Enclosing these tolerances in set-valued models leads to unwanted overapproximation. In this paper, we present an automated modeling approach, which is applicable to nonlinear analog and mixed-signal circuits. We describe the behavioral circuit models as well as the device parameter variations and modeling errors by symbolic equations. We substitute these symbols with intervals and affine forms, respectively. In each case we provide semi-symbolic hybrid automata models. Then, we insert numerical values in these models for reachability analysis. The results of both reachability analyses are used to reduce the overapproximation.} } @inbook{mah-rou-cha-20-aa-contr, author = {Mahato, Nisha Rani and Rout, Saudamini and Chakraverty, Snehashish}, title = {Affine-Contractor Approach to Handle Nonlinear Dynamical Problems in Uncertain Environment}, booktitle = {Mathematical Methods in Interdisciplinary Sciences}, publisher = {Wiley}, isbn = {9781119585640}, chapter = {11}, pages = {215-237}, doi = {10.1002/9781119585640.ch11}, year = 2020, comment = {Affine-contractor HPM -- what is that? Nonlinear ODEs}, abstract = {Nonlinear dynamical problems form backbone in several fields of science and engineering, viz., structural mechanics, fluid dynamics, control theory, robotics, seismology, circuit analysis, etc. This chapter examines nonlinear ordinary differential equations (NODEs). There exist very few literature studies regarding the solution of nonlinear dynamical problems in uncertain environment. The chapter proposes a semianalytic method, the homotopy perturbation method (HPM), based on affine-contractor for evaluating the solution bounds of nonlinear dynamical problems in uncertain environment and discusses classical interval arithmetic and its properties. It mentions the dependency problem in the case of standard interval arithmetic, and incorporates affine arithmetic, contractor, SIVIA, etc. The chapter introduces the proposed method, affine HPM and affine-contractor HPM, for calculating the enclosures of INODE. Some illustrative application problems, viz., Rayleigh equation (for unforced NODE), Van der Pol-Duffing equation (for forced NODE), and nonhomogeneous Lane-Emden equation, are discussed.} } @article{son-mij-che-bai-che-20-aa-reliab, author = {Yufei Song and Jinhua Mi and Yuhua Cheng and Libing Bai and Kai Chen}, title = {A Dependency Bounds Analysis Method for Reliability Assessment of Complex System with Hybrid Uncertainty}, journal = {Reliability Engineering {\&} System Safety}, volume = {204}, pages = {article 107119}, year = 2020, issn = {0951-8320}, doi = {10.1016/j.ress.2020.107119}, abstract = {In reliability assessment, a difficulty is to handle a complex system with hybrid uncertainty (aleatory and epistemic uncertainty) and dependency problem. Probability-box is a general model to represent hybrid uncertainty. Arithmetic rules on the structure are mostly used between independent random variables. However, in practice, dependency problems are also common in reliability assessment. In addition, in most real applications, there is some prior information on the dependency of components, but the available information may be not enough to determine dependent parameters. The issue is named non-deterministic dependency problem in the paper. Affine arithmetic is hence used to produce dependent interval estimates. The arithmetic sometimes has a better effect than probability-box arithmetic (interval arithmetic) in dealing with dependency problem. Bayesian network is a commonly used model in reliability assessment. Under Bayesian network framework, this paper proposes a dependency bounds analysis method that combines affine arithmetic and probability-box method to handle hybrid uncertainty and non-deterministic dependency. For the sake of illustration, this method is applied to two real systems. To show the advantages of the proposed method, the proposed method is compared with the Frechet inequalities and 2-stage Monte Carlo method in the second case study.} } @article{xie-lin-lia-yan-tan-son-liu-20-aa-powflow, author = {Xie, Yuquan and Lin, Shunjiang and Liang, Weikun and Yang, Yuerong and Tang, Zhiqiang and Song, Yunong and Liu, Mingbo}, title = {Interval Probabilistic Energy Flow Calculation of {CCHP} Campus Microgrid Considering Interval Uncertainties of Distribution Parameters}, journal = {IEEE Access}, year = 2020, volume = {8}, number = {}, pages = {141358-141372}, doi = {10.1109/ACCESS.2020.3013151}, issn = {2169-3536}, abstract = {Due to the absence of historical data and the errors of measurement instruments, there may be uncertainties in the distribution parameters of the random variables describing the uncertain fluctuations of node power including renewable energy station output and load power in the combined cooling heating and power (CCHP) campus microgrid. In this paper, intervals are used to describe the uncertainties of distribution parameters of the random variables, and an interval probabilistic energy flow (IPEF) calculation model of the CCHP campus microgrid is established. Introducing the interval arithmetic (IA) into the cumulant method, an IA-based IPEF algorithm is proposed to obtain the analytical expressions of probability density function or cumulative distribution function intervals of the state variables. Moreover, affine arithmetic (AA) is introduced to address the interval extension problem in the calculation, and an AA{\&}IA-based IPEF algorithm is proposed. By constructing the correlation transformation matrixes, the correlation among different node power is considered in the IPEF calculation. A case study on a CCHP campus microgrid demonstrates that the results of the AA{\&}IA-based IPEF algorithm are more accurate than those of the IA-based IPEF algorithm by using the results of the double-layer Monte Carlo method as a reference. Moreover, the proposed algorithms are more efficient than the double-layer Monte Carlo method.} } @inbook{vac-20-aa-powflowsurv, author = {Vaccaro, Alfredo}, title = {The Role of Affine Arithmetic in Robust Optimal Power Flow Analysis}, bookTitle = {Decision Making under Constraints}, year = 2020, publisher = {Springer}, pages = {189--196}, isbn = {978-3-030-40814-5}, doi = {10.1007/978-3-030-40814-5_24}, url = {https://doi.org/10.1007/978-3-030-40814-5_24}, comment = {Survey of applications to power flow?}, abstract = {Optimal Power Flow (OPF) analysis represents the mathematical foundation of many power engineering applications. For the most common formalization of the OPF problem, all input data are specified using deterministic variables, and the corresponding solutions are deemed representative of the limited set of system conditions. Hence, reliable algorithms aimed at representing the effect of data uncertainties in OPF analyses are required in order to allow analysts to estimate both the data and solution tolerance, providing, therefore, insight into the level of confidence of OPF solutions. To address this issue, this Chapter outline the role of novel solution methodologies based on the use of Affine Arithmetic.} } @inproceedings{est-lop-reg-20-aa-fixpt, author = {Esteban, Luis and Antonio López Martín, Juan and Regadío, Alberto}, booktitle = {Proc. XXXV Conference on Design of Circuits and Integrated Systems (DCIS 2020)}, title = {Round-off noise estimation of fixed-point algorithms using Modified Affine Arithmetic and Legendre Polynomials}, year = 2020, volume = {}, number = {}, pages = {1-6}, doi = {10.1109/DCIS51330.2020.9268668}, issn = {2640-5563}, month = nov, comment = {Modified AA with Legendre polynomials}, abstract = {The implementation of algorithms in fixed-point format causes the apparition of Round-Off Noise which propagates through the different functional units of the system. This issue causes the Signal-to-Noise Ratio of the outputs is degraded. Given an algorithm, it is essential to estimate the integer and fractional bit-widths of all the variables and operations to comply with the Signal-to-Noise Ratio requirements. In this context, Affine Arithmetic can obtain fast and accurate estimations of the bit-widths for linear systems. However, for non-linear systems, Affine Arithmetic loses the temporal correlation of the variables. Other existing frameworks are either time consuming or lead to inaccurate bound estimations. In this paper, a Modified Affine Arithmetic framework with Legendre polynomials is used to obtain fast and accurate bound estimations also for non-linear systems. Moreover, the approach proposed in this paper obtains speedups in the range of 7 to 100 compared to Monte-Carlo simulations.} } @mastersthesis{jaa-20-aa-hask-thesis, author = {Joosep J{\"{a}}{\"{a}}ger}, title = {Implementation of affine arithmetic in {Haskell}}, note = {Bachelors Thesis; supervisors A. pankova, D. Unruh}, school = {University of Tartu}, year = 2020, month = mar, abstract = {Interval arithmetic and affine arithmetic are methods in numerical analysis that deal with ranges of numerical values. Affine arithmetic is often used instead of interval arithmetic since it can result in smaller errors. The result of this thesis is an affine arithmetic library written in Haskell. This library is written in a way that makes it more difficult to make errors when using it. The library was tested using certain mathematical properties of affine arithmetic.} } @inproceedings{atc-rah-cec-20-aa-tpowtr, author = {Atchison, Forest and Rahman, Mahbubur and Cecchi, Valentina}, booktitle = {IEEE/PES Transmission and Distribution Conference and Exposition (T{\&}D 2020)}, title = {Temperature-Dependent Power Transfer Capability of Transmission Systems Under Uncertainty: {An} Affine-Arithmetic Approach}, year = 2020, volume = {}, number = {}, pages = {1-5}, doi = {10.1109/TD39804.2020.9299664}, issn = {2160-8563}, month = oct, abstract = {Traditionally used continuation power flow methods do not consider the variation in line conductor temperature with increase in line loading. In this paper, a temperature-dependent continuation power flow (TD-CPF) approach is used and considers both thermal and voltage stability limits to determine the maximum transfer capacity of a transmission system. Moreover, the TD-CPF method is enhanced via use of affine arithmetic to account for the presence of uncertainties in weather parameters, overhead line conductor properties, and regional pollution levels. Considering these uncertainties, the voltage stability is assessed and compared to the line thermal limits in order to obtain a non-deterministic solution of the maximum power transfer capability of the system. The methodology is tested on a 4-bus and a 30-bus test cases to demonstrate the contribution of the proposed method.} } @article{len-liu-ran-che-zha-20-aa-powflow, author = {Leng, Shipeng and Liu, Kaipei and Ran, Xiaohong and Chen, Shuyao and Zhang, Xunyue}, title = {An Affine Arithmetic-Based Model of Interval Power Flow With the Correlated Uncertainties in Distribution System}, journal = {IEEE Access}, year = 2020, volume = {8}, number = {}, pages = {60293-60304}, doi = {10.1109/ACCESS.2020.2982928}, issn = {2169-3536}, abstract = {An interval power flow (IPF) method that considers the interval correlations of input random variables is proposed to improve the calculation accuracy of IPF, i.e., as correlated distributed generations (DGs) and some correlated DGs-loads are integrated into distribution system. The interval correlation for input variables is described by parallelogram model (PM), whose shape and size are determined by the interval correlated level. Based on affine arithmetic (AA) method, the IPF is solved through nonlinear optimization instead of traditional interval iterative computations. The optimization model of IPF is established, and the interval correlations of input variables (DGs-DGs and DGs-loads) are added into the IPF optimization problem in the form of additional constraint, to make the power flow solutions, i.e., bus voltage magnitude, voltage angle, active and reactive power of branches, more accurate. Finally, several cases, i.e., numerical case, IEEE33-bus, PG{\&}E69-bus and IEEE118-bus distribution system, not only demonstrate the effectiveness of the proposed method, but also indicate that the IPF results are affected by uncertainty level, and the widths of IPF increase with the increasing of uncertainty level.} } @inproceedings{raj-kum-20-aa-ptswarm, author = {Raj, Vinod and Kumar, Boddeti Kalyan}, booktitle = {21st National Power Systems Conference (NPSC 2020)}, title = {An Improved Affine Arithmetic-Based Optimal {DG} Sizing and Placement Algorithm Using {PSO} for Radial Distribution Networks with Uncertainty}, year = 2020, volume = {}, number = {}, pages = {1-6}, keywords = {}, doi = {10.1109/NPSC49263.2020.9331886}, issn = {}, month = dec, comment = {Power distribution optimization. Combines AA with Particle Swarm Optimization.=}, abstract = {In the present work, Particle Swarm optimization (PSO) based optimal Distributed Generation (DG) placement and sizing for radial distribution systems using Affine Arithmetic (AA), considering uncertainty in load and generation, is presented to reduce real power losses and improve voltage profile with minimum investment cost. The PSO algorithm incorporates both affine as well as crisp discrete variables for uncertain DG generation and bus locations respectively to arrive at the optimal solution. An affine expression for real power loss is used which has sensitivity coefficients of real power losses in distribution lines corresponding to power injections at different buses. The resulting affine loss intervals are further tightened using an optimization procedure. The proposed method is implemented on IEEE 33 and 119 bus radial distribution systems. The optimal loss intervals obtained by the proposed method are compared with existing AA based optimal DG allocation method. The simulation results show that the proposed AA-PSO method gives more optimal DG size and location, for IEEE 33 and 119 bus radial distribution systems with uncertainty when compared to existing method which uses AA.} } @article{rui-her-jur-20-aa-harmonic, author = {F.J. Ruiz-Rodriguez and J.C. Hernandez and F. Jurado}, title = {Iterative Harmonic Load Flow by using the Point-Estimate Method and Complex Affine Arithmetic for Radial Distribution Systems with Photovoltaic Uncertainties}, journal = {International Journal of Electrical Power {\&} Energy Systems}, volume = {118}, pages = {105765}, year = 2020, issn = {0142-0615}, doi = {10.1016/j.ijepes.2019.105765}, comment = {Complex arithmetic AA. What is a photovoltaic uncertainty?}, abstract = {Load and generation variations and the random nature of harmonics in non-linear devices (NLDs) are the source of multiple uncertainties that can be handled in harmonic load flows (HLFs) by probabilistic or interval formulations. The paper presents a new combined analytical technique (CAT) for iterative HLFs in the presence of correlated input uncertainties from photovoltaic (PV) systems in radial distribution systems (RDSs). This technique merges the point-estimate method (PEM), a probabilistic formulation, and complex affine arithmetic (AA), an interval formulation. It then uses the information derived in Legendre series approximation (LGSA) to approximate harmonic voltage distributions. Unlike other methods, this CAT includes iterative harmonic penetration (IHP), which provides a way to deal with the interaction of background harmonic voltage on PV harmonic current. The CAT was examined in a real ENDE 100 RDS system. Thanks to PEM and AA, the CAT significantly reduced the computational burden, an evident improvement over the Monte-Carlo simulation (MCS). Furthermore, the simulation results showed that it accurately reconstructed the harmonic voltage distributions (magnitude and phase angle). The iterative approach also underlines the relevance of background harmonic interaction. The CAT outperformed the incomplete CAT (ICAT), which was based solely on a probabilistic HLF formulation.} } @inproceedings{adu-kum-20-aa-bachforw, author = {Adusumilii, Bala Surendra and Kumar, Boddeti Kalyan}, title = {Backward/Forward Sweep based Power Flow Analysis of Distribution Systems under Uncertainty using New Affine Arithmetic Division}, year = 2020, booktitle = {Proc. 2020 IEEE Power Energy Society Innovative Smart Grid Technologies Conference (ISGT)}, volume = {}, number = {}, pages = {1-5}, doi = {10.1109/ISGT45199.2020.9087718}, comment = {Better AA division algorithm}, abstract = {Power flow analysis is a very important study for planning and operation of power systems. Conventional power flow analysis techniques will fail when uncertainty is present in power injections. Adequate analytical techniques are required for power flow analysis under uncertainty. Affine Arithmetic (AA) is one of the effective tools to handle uncertainty. However, existing AA method lead to generation of extra noise terms in each division operation. The error in solution bounds increases because of these extra noise terms. In this work, backward/forward sweep (BFS) based power flow analysis, which do not generate any extra noise terms, is proposed. The proposed method is tested on 33 and 118 bus radial distribution systems. Simulation results are compared with Monte Carlo simulations based as well as existing AA-BFS based power flow analysis. Simulation results show that the proposed method is more accurate than existing AA-BFS based power flow analysis.}, } @article{lia-liu-lej-zhu-hua-lib-zha-20-aa-powflow, author = {Xiaobing Liao and Kaipei Liu and Jian Le and Shu Zhu and Qing Huai and Ben Li and Yantian Zhang}, title = {Extended Affine Arithmetic-Based Global Sensitivity Analysis for Power Flow with Uncertainties}, journal = {International Journal of Electrical Power {\&} Energy Systems}, volume = {115}, pages = {105440}, year = 2020, doi = {10.1016/j.ijepes.2019.105440}, abstract = {In order to quantitatively assess the impacts of input uncertainties on power flow solutions, a novel analytical variance-based global sensitivity analysis method using extended affine arithmetic was proposed in this paper. With input uncertain variables described as intervals, the power flow output models based on extended affine arithmetic were originally derived. These models are normally expressed by second-order interval response surface model, and thus the total variance of the models can be calculated analytically. Finally, we proposed a novel framework of variance decomposition based global sensitivity analysis method to clarify the components of total variance contributions. The tests on the IEEE14-bus, IEEE300--bus, 2383wp system demonstrate that extended affine arithmetic-based global sensitivity analysis method can acquire maximum relative error of total sensitivity indices is less than 4.55{\%} and max relative error of main sensitivity indices is less than 9.1{\%} when comparing to Monte Carlo simulation method, which is able to greatly improve the evaluation efficiency relative to Monte Carlo simulation method.} } @article{sch-sch-20-aa-lovolt, author = {Maximilian Schmidt and Peter Schegner}, title = {Deriving power uncertainty intervals for low voltage grid state estimation using affine arithmetic}, journal = {Electric Power Systems Research}, volume = {189}, pages = {article 106703}, year = 2020, doi = {10.1016/j.epsr.2020.106703}, abstract = {Pseudo-measurements are usually applied as substitutes for measurement data to obtain observability even in case of sparse measurement configurations. The quality of pseudo-measurements strongly affects the accuracy of state estimation results. Generating pseudo-measurements is not a straightforward task in particular for customers with highly stochastic behavior. This paper proposes a novel approach to obtain verified boundaries of pseudo-measurements, which are consistent to currently available measurement information. These boundaries allow to verify generated pseudo-measurements, whether they are compliant to current system conditions. Additionally, tight boundaries are suitable to generate pseudo-measurements on-line regardless of the customer's structure. The proposed algorithm applies Affine Arithmetic - a self-validated numerical model - to the state estimation problem and treats pseudo-measurements as main source of uncertainty. The key properties of the algorithm are rigorous, iterative, linearizing and large-scale. These properties are demonstrated by numerical simulation of two benchmark grid models of different complexity. Computational and implementation issues are addressed in detail.} } @book{cha-rou-20-aa-book, author = {Snehashish Chakraverty and Saudamini Rout}, title = {Affine Arithmetic Based Solution of Uncertain Static and Dynamic Problems}, series = {Synthesis Lectures on Mathematics and Statistics}, publisher = {Morgan {\&} Claypool}, year = 2020, month = mar, pages = {170}, doi = {10.2200/S00983ED1V01Y202001MAS032}, comment = {General description of AA. Fuzzy AA?}, abstract = {Uncertainty is an inseparable component of almost every measurement and occurrence when dealing with real-world problems. Finding solutions to real-life problems in an uncertain environment is a difficult and challenging task. As such, this book addresses the solution of uncertain static and dynamic problems based on affine arithmetic approaches. Affine arithmetic is one of the recent developments designed to handle such uncertainties in a different manner which may be useful for overcoming the dependency problem and may compute better enclosures of the solutions. Further, uncertain static and dynamic problems turn into interval and/or fuzzy linear/nonlinear systems of equations and eigenvalue problems, respectively. Accordingly, this book includes newly developed efficient methods to handle the said problems based on the affine and interval/fuzzy approach. Various illustrative examples concerning static and dynamic problems of structures have been investigated in order to show the reliability and efficacy of the developed approaches.} } @article{tan-don-zhu-son-20-aa-powflow, author = {Tang, Kunjie and Dong, Shufeng and Zhu, Chengzhi and Song, Yonghua}, title = {Affine Arithmetic-Based Coordinated Interval Power Flow of Integrated Transmission and Distribution Networks}, journal = {IEEE Transactions on Smart Grid}, year = 2020, volume = {11}, number = {5}, pages = {4116-4132}, doi = {10.1109/TSG.2020.2991210}, abstract = {Considering the increasing coupling between transmission and distribution networks, an affine arithmetic-based interval power flow algorithm of integrated transmission and distribution (I-T{\&}D) networks is proposed. First, a novel two-step approximation method for sine and cosine functions is proposed to reduce the number of noise variables in the affine form of the injected power, as the basis of the proposed algorithm. Then, this algorithm is divided into four stages, which are implemented alternatively between a transmission system operator (TSO) and multiple distribution system operators (DSOs) by exchanging parameters at TSO-DSO boundaries. Three-phase unbalanced I-T{\&}D networks and boundary tap changer action are also discussed. In addition, an asynchronous power flow method is proposed to mitigate the influences of communication networks on the proposed interval power flow algorithm. Numerical experiments demonstrate the effectiveness of the proposed two-step approximation method, as well as the conservative property, fairly good approximation effect, high efficiency, and low data exchange amount of the proposed algorithm in various circumstances, including single-phase and three-phase networks, varying degrees of unbalance, various smart inverter controls, etc.} } @article{ran-len-liu-20-aa-triang, author = {Ran, Xiaohong and Leng, Shipeng and Liu, Kaipei}, title = {A Novel Affine Arithmetic Method With Missed the Triangular Domain With Uncertainties}, journal = {IEEE Transactions on Smart Grid}, year = 2020, volume = {11}, number = {2}, pages = {1430-1439}, doi = {10.1109/TSG.2019.2938080}, comment = {AA on triangles?}, abstract = {A novel affine arithmetic (AA) method with missed triangular domain (remaining area is convex polygons) is proposed in this paper for solving interval power flow (IPF) problem with uncertainties. An interval correlation model of random variables is established, and the original correlated interval variables are transformed into the standard space using interval arithmetic (IA) to reduce overestimation problem because of interval operation. To alleviate the errors caused by inaccurate enveloping of different intervals, an interval model with missed triangular domain is proposed and integrated into optimization model of IPF in form of additional constraints, which is developed in this paper through AA. IPF results, i.e., voltage magnitude, voltage angles and line flows are much narrower because it enhances restriction of correlated variables. Case studies on various test systems, i.e., IEEE 33-bus, 69-bus, and 118-bus system, indicate effectiveness of proposed technique compared with the other methods.} } %%% 2019 %%%%%%%%%%%%%%%%%%%% @inproceedings{yua-wan-wan-19-aa-powgas, author = {Shuangchen Yuan and Shouxiang Wang and Kai Wang}, title = {Affine Analysis for Uncertainty of Gas Load in Integrated Electrical and Natural-Gas System}, booktitle = {Proc. 2019 International Conference on Applied Energy}, publisher = {}, pages = {Paper 195}, year = 2019, month = aug, location = {V{\"a}ster{\o{a}}s, Sweden}, comment = {Electric and gas flow in an Integrated energy grid}, abstract = {This paper is aimed at analyzing the influence of fluctuation by gas load in the integrated electrical and natural-gas system (IENGS). To address this issue, an affine method is proposed to calculate energy flow in IENGS considering uncertainties. In the distribution network, the power flow is solved by affine arithmetic based on forward-backward sweep method after obtaining the solutions of coupling units in the gas system. A numerical test, in which an IENGS is made up by a 13-bus distribution network and a 7-node gas system, shows the correctness and effectiveness of the proposed method. The results draw the conclusion that the fluctuation of gas load leads to the fluctuation of the whole IENGS.} } @inproceedings{gie-xam-gan-mit-19-aa-missign, author = {Gielen, Georges and Xama, Nektar and Ganesan, Karthik and Mitra, Subhasish}, booktitle = {Proc. Design, Automation {\&} Test in Europe Conference Exhibition (DATE 2019)}, title = {Review of Methodologies for Pre- and Post-Silicon Analog Verification in Mixed-Signal {SOCs}}, year = 2019, volume = {}, number = {}, pages = {1006-1009}, doi = {10.23919/DATE.2019.8714828}, issn = {1558-1101}, month = mar, abstract = {The integration of increasingly more complex and heterogeneous SOCs results in ever more complicated demands for the verification of the system and its underlying subsystems. Pre-silicon design validation as well as post-silicon test generation of the analog and mixed-signal (AMS) subsystems within SOCs proves extremely challenging as these subsystems do not share the formal description potential of their digital counterparts. Several methods have been developed to cope with this lack of formalization during AMS pre-silicon validation, including model checkers, affine arithmetic formalisms and equivalence checkers. However, contrary to the industrial practice for digital circuits of using formal verification and ATPG tools, common industry practice for analog circuits still largely defaults to simulation-based validation and test generation. A new formal digital-inspired technique, called AMS-QED, can potentially solve these issues in analog and mixed-signal verification.} } @inproceedings{yul-kon-che-19-aa-intsta, author = {Yu, Li and Kong, Xiangyu and Chen, Ying}, title = {Internal State Estimation for Distribution Network with {PMU} Measurement Information}, booktitle = {Proc. IEEE Innovative Smart Grid Technologies - Asia (ISGT Asia 2019)}, year = 2019, volume = {}, number = {}, pages = {1149-1153}, doi = {10.1109/ISGT-Asia.2019.8881090}, issn = {2378-8542}, month = may, comment = {Combines IA and AA}, abstract = {Due to more and more intelligent devices such as phasor measurement unit (PMU) access to the distribution network, state estimation for distribution network need to consider more and more uncertainty and the great difference in accuracy of different measurement information may lead to non-convergence of weighted least square (WLS) methods. Aiming at the situation of only knowing the upper and lower limits of uncertainties, an interval state estimation for distribution system is proposed, which describes these uncertainties of system measurements are quantitatively d by the interval numbers and affine arithmetic. In order to accurately obtain the results of DSSE, an algorithm based on the combination of interval arithmetic and affine arithmetic is proposed. In this method, the interval numbers and affine arithmetic are transformed into each other in the iterative process to reducing the conservatism of interval state estimation. The estimation results in interval form are used to provide upper and lower bound information of DSSE results for dispatchers more intuitively.} } @inproceedings{rou-cha-19-aa-eigen, author = {Rout, S. and Chakraverty, S.}, title = {Affine Approach to Solve Nonlinear Eigenvalue Problems of Structures with Uncertain Parameters}, booktitle = {Recent Trends in Wave Mechanics and Vibrations - Select Proc. of 8th National Conference on Wave Mechanics and Vibrations (WMVC 2018)}, year = 2019, publisher = {Springer}, pages = {407--425}, isbn = {978-981-15-0286-6}, doi = {10.1007/978-981-15-0287-3_29}, comment = {Application to structural mechanics. Finding eigenvalues with AA}, abstract = {Various science and engineering problems involve uncertainty with respect to parameters due to different causes. The uncertain parameters may be contemplated as closed intervals. Uncertain material parameters of structural vibration problems may produce interval mass matrices and interval stiffness matrices. In general, dynamic problems with interval uncertainty lead to generalized interval eigenvalue problems. Further, the inclusion of damping factor may transform the problem to a nonlinear interval eigenvalue problems, viz., quadratic and/or cubic eigenvalue problems. In this respect, affine arithmetic may be used to handle the uncertainties due to the overestimation problem occurred in some of the cases of interval arithmetic. Accordingly, this manuscript aims to deal with solving the nonlinear eigenvalue problems with interval parameters using affine arithmetic. Numerical examples have been worked out to illustrate the reliability and efficiency of the present approach.} } @inproceedings{jac-ved-19-aa-divmet, author = {Maxime Jacquemin and Franck V{\'e}drine}, title = {A Dividing Method Minimizing the Linearization Term in Affine Arithmetic}, booktitle = {Proc. 8th International Workshop on Numerical and Symbolic Abstract Domains (NSAD 2019)}, location = {Porto, Portugal}, year = 2019, pages = {article 5 (3 pages)}, comment = {Improved division algorithm}, abstract = {Affine arithmetic is a well known tool to derive first order guaranteed approximations of general formulas over real numbers. It is also a useful tool in static analysis to keep track of linear correlations between program variables. However non-linear operations, like multiplications or divisions, introduce compensation terms to over-approximate the residue of the linearization process. Tight estimations of those terms are of utmost importance to obtain precise abstractions and thus a useful analysis. In this paper, we propose a new and simple technique to compute precise compensation terms for divisions.} } @inproceedings{mah-zha-zha-wan-zha-19-aa-powramp, author = {Huan Ma and Kang Zhao and Bing Zhang and Liang Wang and Pengfei Zhang}, title = {An Early Warning Method Based on Improved Affine Arithmetic for Wind Power Ramp Events in Power System}, booktitle = {Proc 2019 International Conference on Oil {\&} Gas Engineering and Geological Sciences}, location = {Dalian, China}, doi = {10.1088/1755-1315/384/1/012199}, year = 2019, month = sep, publisher = {{IOP}}, series = {Earth and Environmental Science Conferences}, volume = {384}, pages = {article 012199}, comment = {Detecting ramp events in power grids}, abstract = {With more and more wind power integrated into power system, increasing attention is paid to wind power ramp events (WPREs) due to the significant impact on the power balance of power system. Considering the impact of large volatility of WPREs on power control, the permissible intervals of ramping amplitude are analysed to determine the boundaries between different warning stages, which are corresponding to different power control measures to keep the power balance with Area Control Error (ACE) deviation maintained within the allowable range. Moreover, interval analysis is introduced to deal with the strong uncertainty, and an improved affine arithmetic is proposed to deal with the conservation brought by interval analysis by considering the temporal correlation of WPREs prediction error. A multi-stage early warning method for WPREs is established in further, by which the warning information, including boundaries and probability distributions, can be provided reflecting the degree of potential harm inflicted by WPREs. Simulation results demonstrate that, the provided waring information have clear physical meanings to provide guidance for the operators, and the proposed warning method has simple and rapid characteristics, which reflects the verify the effectiveness of the proposed method.} } @inproceedings{adu-kum-19-aa-contin, author = {Adusumilii, Bala Surendra and Kumar, Boddeti Kalyan}, booktitle = {Proc. IEEE Milan PowerTech 2019}, title = {Continuation Power Flow Analysis of Distribution Systems under Uncertainty using Modified Affine Arithmetic}, year = 2019, volume = {}, number = {}, pages = {1-6}, doi = {10.1109/PTC.2019.8810841}, month = jun, abstract = {Conventional continuation power flow analysis (CPF) gives the maximum loadability from voltage versus power curves (V-P curves) for a deterministic set of loads and generations. But, in presence of uncertainties in power generations and loads conventional analysis may give wrong results. In this work, a range arithmetic analysis known as Affine Arithmetic (AA) with modifications is used to incorporate the uncertainties associated with loads {\&} generations in CPF analysis of distribution systems. Newton-Raphson method based CPF with modified AA is used to determine the bounds of maximum loadability from V-P curves. The proposed modified AA based CPF analysis under uncertainty can be applied to radial as well as mesh connected distribution systems and is tested on 69 bus radial and 119 bus radial {\&} mesh distribution systems. Simulation results with the proposed method are compared with existing AA based CPF and Monte Carlo simulations based CPF analyses.} } @phdthesis{kra-19-aa-svm-thesis, author = {Krause, Anna}, title = {Variation-Aware Behavioural Modelling Using Support Vector Machines and Affine Arithmetic}, school = {Gottfried Wilhelm Leibniz University, Hanover}, year = 2019, doi = {10.15488/9165}, abstract = {Generalised Interval Arithmetic Simulator (AGIAS) is a specialised simulator which uses affine arithmetic to model parameter variations. It uses a specialised root-finding algorithm to simulate analogue circuits with parameter variations in one single simulation run. This is a significant speed-up compared to the multiple runs needed by industrialised solutions such as Monte-Carlo (MC) or Worst-Case Analysis (WCA). Currently, AGIAS can simulate analogue circuits only under very specific conditions. In many cases, circuits can only be simulated for certain operating points. If the circuits is to be evaluated in other operating points, the solver becomes numerically unstable and simulation fails. In these cases, interval widths approach infinity. Behavioural modelling of analogue circuits was introduced by researchers working around limitations of simulators. Most early approaches require expert knowledge and insight into the circuit which is modelled. In recent years, Machine Learning techniques for automatic generation of behavioural models have made their way into the field. This thesis combines Machine Learning techniques with affine arithmetic to include the effects of parameter variations into models. Support Vector Machines (SVMs) train two sets of parameters: one slope parameter and one offset parameter. These parameters are replaced by affine forms. Using these two parameters allows affine SVMs to model effects of parameter variations with varying widths. Training requires additional information about maximum and minimum values in addition to the nominal values in the data set. Based on these changes, affine $\varepsilon$ Support Vector Machine ($\varepsilon$-SVR) and $\nu$ Support Vector Machine ($\nu$-SVR) algorithms for regression are presented. To train the affine parameters directly and profit from the Sequential Minimal Optimisation algorithm (SMO)'s selectivity, the SMO is extended to handle the new, larger optimisation problems. The new affine SVMs are tested on analogue circuits that have been chosen based on whether they could be simulated with AGIAS and how strongly non-linear their characteristic function is.} } @inproceedings{che-qin-guo-liu-wei-19-aa-powdistr, author = {Cheng, Lin and Qi, Ning and Guo, Yanfei and Liu, Nan and Wei, Wei}, title = {Potential Evaluation of Distributed Energy Resources with Affine Arithmetic}, booktitle = {IEEE Innovative Smart Grid Technologies - Asia (ISGT Asia 2019)}, year = 2019, volume = {}, number = {}, pages = {4334-4339}, doi = {10.1109/ISGT-Asia.2019.8881198}, issn = {2378-8542}, month = may, abstract = {With the rapid development of Energy Internet, the penetration of distributed energy resources is gradually increasing. New methods for potential evaluation of DERs is becoming more and more important for planning, operation, and control. In this paper, the traditional affine arithmetic-based forward-backward power flow calculation method is introduced. Then, modified method is proposed mainly considers arithmetic correction, weekly looped structure, and different types of DG. Moreover, comprehensive potential evaluation structure for DERs is proposed based on affine arithmetic which involves three parts. Finally, through numerical analysis, the applicability and error of the affine arithmetic method are analyzed.} } @inproceedings{raj-kum-20-aa-weakpow, author = {Raj, Vinod and Kumar, Boddeti Kalyan}, booktitle = {Proc. IEEE International Conference on Environment and Electrical Engineering and IEEE Industrial and Commercial Power Systems Europe (EEEIC/I{\&}CPS Europe 2020)}, title = {A New Affine Arithmetic-Based Power Flow Analysis for Weakly Meshed Distribution Systems under Uncertainty}, year = 2020, volume = {}, number = {}, pages = {1-6}, doi = {10.1109/EEEIC/ICPSEurope49358.2020.9160489}, month = jun, abstract = {An affine arithmetic based load flow for weakly meshed distribution systems with uncertainty using optimized solution intervals is proposed in the present work. Uncertainty is considered in loads and Distributed Generation (DG) connected at buses. Affine Arithmetic (AA) is used to represent uncertainty in distribution load flow. Bus Injection to Branch Current (BIBC) and Branch Current to Bus Voltage (BCBV) matrices are used in the load flow. Noise intervals for the initial affine solution are optimised with respect to the specified uncertainty in power injections. The proposed method, existing AA and Monte Carlo simulations based power flow analyses are tested on weakly meshed 33 and 118 bus distribution systems.} } @article{raj-kum-20-aa-binswarm, author = {Vinod Raj and Boddeti Kalyan Kumar}, title = {A New Affine Arithmetic-Based Optimal Network Reconfiguration to Minimize Losses in a Distribution System Considering Uncertainty Using Binary Particle Swarm Optimization}, journal = {Electric Power Components and Systems}, volume = {48}, number = {6-7}, pages = {628-639}, year = 2020, publisher = {Taylor {\&} Francis}, doi = {10.1080/15325008.2020.1797940}, altkeys = {raj-kum-19-aa-binswarm}, comment = {Combines AA with binary particl swarm optimization (BPSO). See also~\cite{raj-kum-20-aa-ptswarm}}, abstract = {In the present work, Binary Particle Swarm Optimization (BPSO) based optimal re-configuration for balanced and unbalanced radial distribution networks using Affine Arithmetic (AA), with uncertainty in generation and load, is proposed to minimize the system losses. An expression for three phase real affine power loss is derived with partial deviations of real power loss in lines with respect to power injections in other buses and also with respect to power injections in other phases in case of unbalanced distribution systems. The major contribution of the present work is the application of AA based optimal network reconfiguration, to both balanced and unbalanced radial distribution networks with uncertainty. The proposed method is tested on IEEE 16, 33, 85 and 119 bus balanced distribution systems and an unbalanced 123 bus system with Distributed Generation (DG) connected at some buses. The optimal loss intervals obtained by the proposed method are compared with that obtained by Interval Arithmetic (IA) and Monte Carlo (MC) simulations based methods. The simulation results show that proposed AA based analysis gives an optimal reconfiguration, for both balanced and unbalanced radial distribution systems with uncertainty as compared to existing IA based method.} } @article{luf-dup-liu-liu-19-aa-hybrid, author = {Lu, Fang and Du, Pingjing and Liu, Hongda and Liu, Fanming}, title = {Affine Arithmetic-Based Power Flow Algorithm Considering Uncertainty for Hybrid {AC/DC} Grids Incorporating {VSCs}}, journal = {IET Generation, Transmission {\&} Distribution}, volume = {13}, number = {10}, pages = {1856-1864}, year = 2019, doi = {10.1049/iet-gtd.2018.6095}, abstract = {The randomness of new energy generation and variation in load demands bring uncertainty to large AC/DC grids. Traditional deterministic power flow equations have difficulty coping with the uncertainties of new energy generation and load. Here, an affine arithmetic (AA)-based uncertainty power flow algorithm for hybrid AC/DC grids incorporating voltage source converters (VSCs) is presented. VSC station and DC grid models are established using AA. Diverse VSC control modes are considered in the power flow iterations. A comparison using the Monte--Carlo method shows that the proposed algorithm is able to obtain a feasible solution. The proposed method can be used by power system operators and planners to monitor and control AC/DC grids under various uncertainties.} } @article{col-vac-vil-19-aa-powflow, author = {Guido Coletta and Alfredo Vaccaro and Domenico Villacci}, title = {Fast and Reliable Uncertain Power Flow Analysis by Affine Arithmetic}, journal = {Electric Power Systems Research}, volume = {175}, pages = {105860}, year = 2019, issn = {0378-7796}, doi = {10.1016/j.epsr.2019.04.038}, abstract = {The massive penetration of renewable power generators in modern power systems is pushing the research in developing reliable computing techniques aimed at addressing the issues caused by the increasing uncertainty sources induced by their intermittent power profiles and the corresponding power transactions. In this domain affine arithmetic-based power flow analysis has been recognized as one of the most promising research directions, since it allows to address many important power systems operation functions by directly keeping track of uncertainties propagation as part of the computation process. Anyway, AA-based computing requires the deployment of specific software modules implementing the main AA-based mathematical operators, which could increase the overall complexity of the solution algorithms. To reduce the complexity of AA-based power flow analysis, this paper proposes a new formulation of the uncertain power flow equations, which allows to explicitly compute the Jacobian matrix and apply a traditional Newton--Raphson based algorithm to solve the overall problem. Detailed results obtained on realistic power systems will be presented and discussed in order to evaluate the performances of the proposed method compared to other traditional AA-based methodologies.} } @article{wan-wan-wul-wan-19-aa-polar, author = {Wang, Shouxiang and Wang, Kai and Wu, Lei and Wang, Chengshan}, title = {Polar Affine Arithmetic: Optimal Affine Approximation and Operation Development for Computation in Polar Form Under Uncertainty}, journal = {ACM Transanctions on Mathematical Software}, year = 2019, month = feb, articleno = {6}, numpages = {29}, volume = {45}, number = {1}, issn = {0098-3500}, url = {https://doi.org/10.1145/3274659}, doi = {10.1145/3274659}, comment = {AA for polar coordinate computation}, abstract = {Uncertainties practically arise from numerous factors, such as ambiguous information, inaccurate model, and environment disturbance. Interval arithmetic has emerged to solve problems with uncertain parameters, especially in the computational process where only the upper and lower bounds of parameters can be ascertained. In rectangular coordinate systems, the basic interval operations and improved interval algorithms have been developed in the numerical analysis. However, in polar coordinate systems, interval arithmetic still suffers from issues of complex computation and overestimation. This article defines a polar affine variable and develops a polar affine arithmetic (PAA) that extends affine arithmetic to the polar coordinate systems, which performs better in many aspects than the corresponding polar interval arithmetic (PIA). Basic arithmetic operations are developed based on the complex affine arithmetic. The Chebyshev approximation theory and the min-range approximation theory are used to identify the best affine approximation. PAA can accurately keep track of the interdependency among multiple variables throughout the calculation procedure, which prominently reduces the solution conservativeness. Numerical examples implemented in MATLAB programs show that, compared with benchmark results from the Monte Carlo method, the proposed PAA ensures completeness of the exact solution and presents a more compact solution region than PIA when dependency exists in the calculation process. Meanwhile, a comparison of affine arithmetic in polar and rectangular coordinates is presented. An application of PAA in circuit analysis is quantitatively presented and potential applications in other research fields involving complex variables in polar form will be gradually developed.} } @article{bel-lam-bel-tag-bel-19-aa-polyev, author = {Bellal, Rima and Lamini, El-sedik and Belbachir, Hacène and Tagzout, Samir and Belouchrani, Adel}, journal = {IEEE Transactions on Computers}, title = {Improved Affine Arithmetic-Based Precision Analysis for Polynomial Function Evaluation}, year = 2019, volume = {68}, number = {5}, pages = {702-712}, doi = {10.1109/TC.2018.2882537}, comment = {Optimizing bit width for polynomial evaluation. Up to 70{\%} reduction in circuit area}, abstract = {Word-length allocation is the most important design phase to optimize hardware resources while guaranteeing a determined accuracy for circuits with fixed-point numbers. This paper presents an enhanced precision analysis for degree-n polynomial Horner's rule. It is based on affine arithmetic and introduces an error propagating formula for a degree-n polynomial Horner's rule. It takes into account quantization error of all the circuit's connections including the inputs. Furthermore, a tighter upper bound error is defined, exploiting the dependencies between intermediate connections. Hardware implementations show that the proposed upper bound results in an area reduction that reaches 70 percent.} } @inproceedings{vac-pet-ber-19-aa-sched, author = {Vaccaro, Alfredo and Petrelli, Marina and Berizzi, Alberto}, title = {Robust Optimization and Affine Arithmetic for Microgrid Scheduling under Uncertainty}, booktitle = {Proc. 2019 IEEE International Conference on Environment and Electrical Engineering (EEEIC/I{\&}CPS Europe)}, year = 2019, volume = {}, number = {}, pages = {1-6}, doi = {10.1109/EEEIC.2019.8783572}, abstract = {Optimization analyses are commonly used in microgrids to identify the most efficient and reliable operation of the available energy resources. Unfortunately, most of the times these programming problems rely on input parameters which are not accurately known. In this context, advanced computing paradigms for solving uncertainty optimization problems represent the most promising enabling methodology. These techniques may show their effectiveness during both the dispatch and the pre-dispatch phase, when operators need to solve the unit-commitment and the economic dispatch problems. To this aim, this paper discusses and compares experimentally some promising existing alternatives to deterministic methods to deal with the solution of optimization problems in the presence of data uncertainty.} } @article{pep-vac-man-19-aa-enerhub, author = {Pepiciello, Antonio and Vaccaro, Alfredo and Ma{\~n}ana, Mario}, title = {Robust Optimization of Energy Hubs Operation Based on Extended Affine Arithmetic}, journal = {Energies}, volume = {12}, year = 2019, number = {12}, pages = {article 2420}, doi = {10.3390/en12122420}, issn = {1996-1073}, comment = {Extended AA?}, abstract = {Traditional energy systems were planned and operated independently, but the diffusion of distributed and renewable energy systems led to the development of new modeling concepts, such as the energy hub. The energy hub is an integrated paradigm, based on the challenging idea of multi-carrier energy systems, in which multiple inputs are conditioned, converted and stored in order to satisfy different types of energy demand. To solve the energy hub optimal scheduling problem, uncertainty sources, such as renewable energy production, price volatility and load demand, must be properly considered. This paper proposes a novel methodology, based on extended Affine Arithmetic, which enables the solving of the optimal scheduling problem in the presence of multiple and heterogeneous uncertainty sources. Realistic case studies are presented and discussed in order to show the effectiveness of the proposed methodology.} } @article{fan-zou-col-vac-djo-19-aa-probopf, author = {Duo Fang and Mingzhe Zou and Guido Coletta and Alfredo Vaccaro and Sasa Z. Djokic}, title = {Handling Uncertainties with Affine Arithmetic and Probabilistic {OPF} for Increased Utilisation of Overhead Transmission Lines}, journal = {Electric Power Systems Research}, volume = {170}, pages = {364-377}, year = 2019, doi = {10.1016/j.epsr.2019.01.027}, comment = {Combines probability analysis with AA}, abstract = {Large-scale integration of variable and unpredictable renewable-based generation systems poses significant challenges to the secure and reliable operation of transmission networks. Application of dynamic thermal rating (DTR) allows for a higher utilisation of transmission lines and effectively avoids high-cost upgrading and/or reinforcing of transmission system infrastructure. In order to efficiently handle ranges of uncertainties introduced by the variations of both wind energy sources and system loads, this paper introduces a novel optimization model, which combines affine arithmetic (AA) and probabilistic optimal power flow (P-OPF) for DTR-based analysis of transmission networks. The proposed method allows for the improved analysis of underlying uncertainties on the supply, transmission and demand sides, which are expressed in the form of probability distributions (e.g. for wind speeds, wind directions, wind power generation and demand variations) and related interval values. The paper presents a combined AA-P-OPF method, which can provide important information to transmission system operators for evaluating the trade-off between security and costs at a planning stage, as well as for selecting optimal controls at operational stage. The AA-P-OPF methodology is illustrated for a day-ahead planning, using a case study of a real transmission network and a medium size test distribution network.} } @article{ziv-gri-olb-sch-bar-19-aa-analog, author = {Zivkovic, Carna and Grimm, Christoph and Olbrich, Markus and Scharf, Oliver and Barke, Erich}, title = {Hierarchical Verification of {AMS} Systems With Affine Arithmetic Decision Diagrams}, journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}, year = 2019, volume = {38}, number = {10}, pages = {1785-1798}, doi = {10.1109/TCAD.2018.2864238}, comment = {AMS is analog or mixed digital-analog signal processing system. What is an "AA decision diagram"?}, abstract = {Formal methods are a promising alternative to simulation-based verification of mixed-signal systems. However, in practice, such methods fail to scale with heterogeneity and complexity of today's analog/mixed-signal systems. Furthermore, it is unclear how they can be integrated into existing verification flows. This paper shows a path to overcome these obstacles. The idea is to use a hierarchical verification flow, in which components can be verified by formal methods or by multirun simulation. To transport verification results across hierarchies, we represent parameters and properties by affine arithmetic decision diagrams. We study to which extent this approach fulfills the needs of practical application by the verification of a phase-locked loop of an IEEE 802.15.4 transceiver system.}, } @article{rom-gar-19-aa-heatpow, author = {David Romero-Quete and Javier Rosero Garcia}, title = {An Affine Arithmetic-Model Predictive Control Approach for Optimal Economic Dispatch of Combined Heat and Power Microgrids}, journal = {Applied Energy}, volume = {242}, pages = {1436-1447}, year = 2019, issn = {0306-2619}, doi = {10.1016/j.apenergy.2019.03.159}, abstract = {This paper presents a novel approach for the optimal economic dispatch of Combined Heat and Power (CHP) Microgrids (MGs), which incorporates an Affine Arithmetic-based Economic Dispatch (AAED) problem into a Model Predictive Control (MPC) framework. The proposed algorithm solves an AAED problem each $\Delta t$ minutes (e.g. 15 min) with time steps of $\Delta t$ minutes over a time horizon $T$ (e.g. 24 h). It uses the available forecast and the current state of the system to provide the schedule and the affine forms that represent the operation intervals of the generators and Energy Storage Systems (ESS) for the next time interval $[t,t+\Delta t]$. Online set points for generators and ESS are then obtained by computing the noise symbols values of the affine forms, based on the most updated information of electricity and heat demands and available renewable energy power. A theoretical CHP-based MG, comprising PVs, a gas boiler, a CHP unit, a battery, and a thermal tank, is used to assess the performance of the AA-MPC approach in both connected and isolated operation modes. The method is also compared with a deterministic MPC approach. Results show the ability of the method to better address forecasting errors, resulting in more cost-effective solutions without considerably affecting the computation performance.} } @article{col-vac-vil-fan-djo-19-aa-weathpow, author = {Guido Coletta and Alfredo Vaccaro and Domenico Villacci and Duo Fang and Sasa Z. Djokic}, title = {Affine Arithmetic for Efficient and Reliable Resolution of Weather-Based Uncertainties in Optimal Power Flow Problems}, journal = {International Journal of Electrical Power {\&} Energy Systems}, volume = {110}, pages = {713-724}, year = 2019, doi = {10.1016/j.ijepes.2019.03.022}, abstract = {The massive diffusion of renewable power generators in existing power grids introduces large uncertainties in power system operation, hindering their hosting capacity, and introducing several critical issues in network management. To address these challenging issues, weather-based optimal power flow has been recognized as one of the most promising enabling methodology for increasing the system flexibility by exploiting the real power components loadability. Anyway, the deployment of this technique in a real operation scenario could be seriously compromised due to the effects of data uncertainty, which could sensibly affect both the generated/demanded power profiles, and the components thermal modeling. In this context, the research for reliable techniques aimed at representing and managing these uncertainties represents one of the most relevant problem to solve. Armed with such a vision, this paper advocates the role of Affine Arithmetic in reliable solving weather-based OPF problems in the presence of multiple and correlated uncertainties. Experimental results obtained on a real case study, which is based on a congested portion of a transmission system characterized by a massive pervasion of wind generators, will be presented and discussed in order to assess the benefits deriving by the application of the proposed method.} } @article{raj-kum-19-aa-powflow, author = {Vinod Raj and Boddeti Kalyan Kumar}, title = {A Modified Affine Arithmetic-Based Power Flow Analysis for Radial Distribution System with Uncertainty}, journal = {International Journal of Electrical Power {\&} Energy Systems}, volume = {107}, pages = {395-402}, year = 2019, doi = {10.1016/j.ijepes.2018.12.006}, comment = {AA for complex numbers with better multiplication. See also \cite{guw-luo-din-men-she-14-aa-powflow}}, abstract = {In a distribution system, the loads and distributed generators connected at a bus have lot of uncertainty due to which the power injections at that bus become uncertain. These uncertainties need to be incorporated in distribution system power flow analysis to get an idea of the uncertainty in the power flow solution. One of the methods used for finding solution intervals for power flow is Monte Carlo simulations. However, Monte Carlo simulations approach suffers from the drawback of large time consumption due to repeated power flows. To overcome this limitation, affine arithmetic based power flow analysis is introduced in literature which is capable of generating solution intervals to the interval power flow problem without the need of repeated power flow analysis. Multiplication operation between two affine terms in conventional affine arithmetic generates an extra noise term in the affine product. In affine based power flow analysis for distribution system, multiplication operation is used repeatedly since backward/forward sweep algorithm is iterative in nature. This generates a large number of noise terms in certain affine parameters which ultimately leads to larger solution intervals for the problem. In the present work, a new formulation of complex affine multiplication is introduced for the affine arithmetic based distribution power flow analysis which does not generate any extra noise term for the resulting complex affine product. The proposed modified affine arithmetic based distribution power flow analysis is tested on IEEE 33, 69, 202 and 874 bus radial distribution systems. All the four test systems are assumed to have distributed generation. The solution intervals obtained are compared with the solution intervals of conventional affine arithmetic based distribution power flow analysis. Results show that the solution intervals of the proposed method are closer to Monte Carlo solution intervals as compared to conventional affine arithmetic based distribution power flow analysis.} } @article{vol-zan-19-coolpath, author = {Neri Volpato and Thiago Tavares Zanotto}, title = {Analysis of Deposition Sequence in Tool-Path Optimization for Low-Cost Material Extrusion Additive Manufacturing}, joirnal = {International Journal of Advanced Manufacturing Technology}, volume = {101}, pages = {1855--1863}, year = 2019, doi = {10.1007/s00170-018-3108-1} } @book{cas-bue-19-var, author = {Antonio {Castelo Filho}, Lucas Moutinho {Bueno}}, title = {Aproximações de Variedades Definidas Implicitamente Utilizando Técnicas de Contagem e Enumeração}, publisher = {Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC)}, year = 2019, pages = {94} } @article{rom-can-19-aa-enerman, author = {Romero-Quete, David and Ca{\~n}izares, Claudio A.}, title = {An Affine Arithmetic-Based Energy Management System for Isolated Microgrids}, journal = {IEEE Transactions on Smart Grid}, year = 2019, volume = {10}, number = {3}, pages = {2989-2998}, doi = {10.1109/TSG.2018.2816403}, abstract = {This paper presents a mathematical formulation of an energy management system (EMS) for isolated microgrids, which addresses uncertainty using the affine arithmetic (AA) method. The proposed EMS algorithm is based on an AA unit commitment (AAUC) problem for day-ahead dispatch, using uncertainty intervals of both load and renewable energy (RE) to provide robust commitment and dispatch solutions in AA form, which are feasible for all the possible realizations within the predetermined uncertainty bounds. A real-time dispatch solution is then found by the proposed algorithm, which computes the noise symbols values of the affine forms obtained by the AAUC, based on the current and actual load and RE power levels and available reserves. If the actual forecast error is outside the uncertainly bounds considered in the AAUC solution process, leading to possible load and/or RE curtailment, the AAUC is recalculated with updated forecast information. The proposed AA-based EMS is tested on a modified CIGRE microgrid benchmark and is compared against day-ahead deterministic, model predictive control (MPC), stochastic optimization, and stochastic-MPC approaches. The simulation results show that the proposed EMS provides robust and adequate cost-effective solutions, without the need of frequent re-calculations as with MPC-based approaches, or assumptions regarding statistical characteristics of the uncertainties as in the case of stochastic optimization.} } @article{zha-wan-wan-hua-19-aa-multobj, author = {Qianyu Zhao and Shouxiang Wang and Kai Wang and Bibin Huang}, title = {Multi-Objective Optimal Allocation of Distributed Generations under Uncertainty Based on {D-S} Evidence Theory and Affine Arithmetic}, journal = {International Journal of Electrical Power {\&} Energy Systems}, volume = {112}, pages = {70-82}, year = 2019, doi = {10.1016/j.ijepes.2019.04.044}, comment = {application}, abstract = {Many efforts on distributed generation (DG) allocation are based on deterministic methods in previous studies. However, the influence of stochastic fluctuation characteristics of DGs and loads is enormous. Therefore, affine arithmetic (AA) is used to represent the uncertainty, and a multi-objective uncertainty optimization model for DG allocation with minimum investment cost, highest income, lowest environmental cost, and minimal network loss is built in this paper. Then multi-objective interval decision-making and bi-layer optimization method based on D-S evidence theory (ET) and genetic algorithm (GA) is proposed to achieve the optimal allocation of DGs. In the proposed method, GA is used as an outer layer optimization for multi-point searches to generate different allocation schemes. Moreover, the ET method is employed as the inner layer to evaluate the candidate allocation schemes which from the outer layer optimization. Also, the ET method guides the evolution direction of GA in the outer layer. For validating the effectiveness and performance, the proposed method is applied to a typical 33-bus distribution system. The comparison with the existing TOPSIS method demonstrates the advantages when handling the uncertainty of the proposed method and achieves a more robust optimal solution.} } %%% 2018 %%%%%%%%%%%%%%%%%%% @article{wan-liu-wan-wul-zha-18-aa-harmon, author = {Shouxiang Wang and Xiang Liu and Kai Wang and Lei Wu and Ying Zhang}, title = {Tracing Harmonic Contributions of Multiple Distributed Generations in Distribution Systems with Uncertainty}, journal = {International Journal of Electrical Power {\&} Energy Systems}, volume = {95}, pages = {585-591}, year = 2018, issn = {0142-0615}, doi = {10.1016/j.ijepes.2017.09.014}, comment = {Complex affine arithmetic, Harmonic analysis of non-linear systems}, abstract = {With an increasing number of inverter-interfaced distributed generations (DG) being integrated into distribution systems, significant harmonics could be injected to bring an adverse impact on distribution system operation. These harmonics usually fluctuate due to the variability and intermittency of DG outputs. However, different DGs, depending on their locations and sizes, may present different harmonic contributions in distribution systems, and it is important to identify which DG has the largest influence on a specific bus. In this paper, a Complex Affine arithmetic based Three-phase Harmonic Power Flow method (CATHPF) is proposed to trace the harmonic contributions of individual DGs to distribution systems. The contribution of each DG to harmonic voltage (CDGHV) is calculated based on CATHPF. The CATHPF method is tested on an IEEE 33-bus distribution system. The proposed CATHPF method can quantitatively evaluate harmonic contributions of individual DGs in distribution systems, and in turn guide the effective allocation of harmonic control equipment.} } @inproceedings{wan-wan-18-aa-multopt, author = {Wang, Shouxiang and Wang, Han}, title = {Affine Method for Multi-objective Optimizing Configuration of Battery Energy Storage System}, booktitle = {Proc. IEEE Power Energy Society General Meeting (PESGM 2018)}, year = 2018, volume = {}, number = {}, pages = {1-5}, doi = {10.1109/PESGM.2018.8586575}, ISSN = {1944-9933}, month = aug, comment = {AA for multi-objective optimization}, abstract = {In this paper, an affine method considering both randomness of the wind power and the load for multi-objective optimizing configuration of battery energy storage system (BESS) is proposed. According to the method, affine arithmetic is used to solve the uncertain power flow and the network loss, the voltage improvement rate (VIR) and the BESS cost are chosen as the objective functions. New metrics are provided to distinguish the dominance relation between two affine numbers and an improved particle swarm optimizing algorithm is also proposed to get the final Pareto optimal solution set. The IEEE 14-bus transmission system is studied to demonstrate the effectiveness and the efficiency of the method. Case results suggest that the Pareto optimal solution set achieved by the method can effectively solve the problem of the results, which lack diversity and comprehensiveness, in the existing methods.} } @article{luo-shi-niy-18-aa-windpow, author = {Luo, Jinqing and Shi, Libao and Ni, Yixin}, journal = {IEEE Access}, title = {A Solution of Optimal Power Flow Incorporating Wind Generation and Power Grid Uncertainties}, year = 2018, volume = {6}, pages = {19681-19690}, doi = {10.1109/ACCESS.2018.2823982}, issn = {2169-3536}, comment = {Uses AA and copula theory. What is it?}, abstract = {This paper proposes a novel approach for the solution of optimal power flow with consideration of uncertainties caused by wind generation and various factors in the power grid. Regarding the uncertainties studied here, multiple types of uncertainty modeling techniques are applied during research. Evidence theory and extended affine arithmetic are employed and mixed as the framework of uncertainty propagation to fuse probability distributions, possibility distributions, and intervals so as to obtain the best possible probability bounds, and the dependence among variables is handled by copula theory and affine arithmetic. Moreover, the uncertainty of wind farm active power and the characteristic of wind farm reactive power are modeled and integrated into the power flow calculation. An enhanced particle swarm optimization algorithm with introduction of fitness comparison and constraint handling techniques under the evidence theory framework is applied to the solution of this problem. The proposed model and method are tested on the IEEE 30-bus standard test system and a real-sized 183-bus power system to demonstrate the validity and effectiveness.} } @book{ska-18-aa-survbook, author = {Iwona Skalna}, title = {Parametric Interval Algebraic Systems}, series = {Studies in Computational Intelligence book series (SCI)}, year = 2018, volume= 766, publisher = {Springer}, isbn = {978-3-319-75186-3}, pages = {191}, doi = {10.1007/978-3-319-75187-0}, comment = {Importante}, abstract = {This self-contained book presents a framework for solving a general class of linear systems with coefficients being continuous functions of parameters varying within prescribed intervals. It also provides a comprehensive overview of the theory related to solving parametric interval linear systems and the basic properties of parametric interval matrices. In particular, it develops several new algorithms delivering sharp rigorous bounds for the solutions of such systems with full mathematical rigor. The framework employs the arithmetic of revised affine forms that enables the readers to handle dependent data. The book is intended not only for researchers interested in developing rigorous methods of numerical linear algebra, but also for engineers dealing with problems involving uncertain data. The theory discussed is also useful in various other fields of numerical analysis, in computer graphics, economics, computational geometry, computer-aided design, computer-assisted proofs, computer graphics, control theory, solving constraint satisfaction problems, and global optimization.} } @inbook{ska-18-aa-altern, author = {Iwona Skalna}, title = {Alternative Arithmetic}, bookTitle = {Parametric Interval Algebraic Systems}, year = 2018, publisher = {Springer}, pages = {25--50}, chapter = {2}, isbn = {978-3-319-75187-0}, doi = {10.1007/978-3-319-75187-0_2}, comment = {Surveys various alternative models such as ellipsoid calculus and various types of AA}, abstract = {Over the years, a lot of effort has been put into the development of self-validated computational (SVC) models that will be able to overcome the ``memoryless nature'' of interval arithmetic, i.e., to take into account the dependencies between variables involved in a computation and/or reduce the so-called wrapping effect. This effort has resulted in several such models worth mentioning: ellipsoid calculus (Chernousko, Izv Akad Nauk SSSR, Tekh Kibern 3:3--11; 4:3--11; 5:5--11, 1980, [27]), V{\'a}lyi, Ellipsoidal calculus for estimation and control, Birkh{\"a}user, Boston, 1997, [269]), constrained interval arithmetic (Lodwick, Constrained interval arithmetic, 1999, [131]), Hansen's generalized interval arithmetic (Hansen, A generalized interval arithmetic, Springer, Berlin, 1975, [72]), affine arithmetic (de Figueiredo, Stolfi, Self-validated numerical methods and applications, 1997, [33]), reduced affine arithmetic (Messine, New affine forms in interval branch and bound algorithms, 1999, [139]), and revised affine arithmetic (Vu, Sam-Haroud, Faltings, A generic scheme for combining multiple inclusion representations in numerical constraint propagation, 2004, [271]).} } @inbook{ska-18-aa-matrices, author = {Skalna, Iwona}, title = {Interval and Parametric Interval Matrices}, bookTitle = {Parametric Interval Algebraic Systems}, chapter = {3}, year = 2018, publisher = {Springer}, pages = {51--83}, isbn = {978-3-319-75187-0}, doi = {10.1007/978-3-319-75187-0_3}, comment = {Parametric matrices}, abstract = {We start this chapter from an overview of the preliminary theory on interval matrices (cf. Neumaier, Interval methods for systems of equations. Cambridge University Press, Cambridge (1990) [160]), since it lays a basis for our main theoretical considerations. The remaining part of the chapter is devoted to parametric interval vectors and matrices.} } @inbook{ska-18-aa-linsys, author = {Skalna, Iwona}, title = {Linear Systems}, bookTitle = {Parametric Interval Algebraic Systems}, chapter = {4}, year = 2018, publisher = {Springer}, pages = {85--98}, isbn = {978-3-319-75187-0}, doi = {10.1007/978-3-319-75187-0_4}, comment = {Parametric linear systems}, abstract = {In this chapter we define parametric interval linear systems and characterize various types of parametric solution sets. We provided as well several visualizations of the most general (united) solution set (in 2D and 3D) that aim to facilitate the exploration of the properties of this solution set. We start with a brief introduction to interval linear systems (Neumaier, Interval methods for systems of equations. Cambridge University Press, Cambridge, 1990) [160], (Rohn, Interval linear systems. Freiburger Intervall-Ber. 84/7. Universit{\"a}t Freiburg, Freiburg, 1984) [206] from which parametric interval linear systems originate.} } @inbook{ska-18-aa-linsolv, author = {Skalna, Iwona}, title = {Methods for Solving Parametric Interval Linear Systems}, bookTitle = {Parametric Interval Algebraic Systems}, chapter = {5}, year = 2018, publisher = {Springer}, pages = {99--163}, isbn = {978-3-319-75187-0}, doi = {10.1007/978-3-319-75187-0_5}, comment = {Solving parametric linear systems}, abstract = {In this chapter we present various methods for solving parametric interval linear systems with general dependencies. Furthermore, we propose several modifications and improvements of selected methods that aim at extending their applicability and accuracy.} } @inbook{ska-18-aa-linprog, author = {Skalna, Iwona}, title = {Parametric Interval Linear Programming Problem}, bookTitle = {Parametric Interval Algebraic Systems}, chapter = {6}, year = 2018, publisher = {Springer}, pages = {165--172}, isbn = {978-3-319-75187-0}, doi = {10.1007/978-3-319-75187-0_6}, comment = {Parametric (AA?) Linear programming}, abstract = {We shall now switch to the following parametric interval linear programming (PILP) problem (Kolev, L. (2014). Applied Mathematics and Computation, 229--246.) (cf. [113]): given parametric objective function.} } @article{eve-18-aa-mtcarlo, author = {Richard G. Everitt}, title = {Efficient Importance Sampling in Low Dimensions Using Affine Arithmetic}, journal = {Computational Statistics}, volume ={33}, pages = {1--29}, year = 2018, abstract = {Despite the development of sophisticated techniques such as sequential Monte Carlo (Del Moral et al. in J R Stat Soc Ser B 68(3):411--436, 2006), importance sampling (IS) remains an important Monte Carlo method for low dimensional target distributions (Chopin and Ridgway in Leave Pima Indians alone: binary regression as a benchmark for Bayesian computation, 32:64--87, 2017). This paper describes a new technique for constructing proposal distributions for IS, using affine arithmetic (de Figueiredo and Stolfi in Numer Algorithms 37(1--4):147--158, 2004). This work builds on the Moore rejection sampler (Sainudiin in Machine interval experiments, Cornell University, Ithaca, 2005; Sainudiin and York in Algorithms Mol Biol 4(1):1, 2009) to which we provide a comparison.} } @article{luf-yan-liu-liu-18-aa-cpowflow, author = {Lu, Fang and Yan, Liang and Liu, Hongda and Liu, Fanming}, title = {Complex Affine Arithmetic-Based Power Flow Analysis for Zonal Medium Voltage Direct Current Shipboard Power Systems in the Presence of Power Variation}, journal = {Energies}, volume = {11}, number = {7}, pages = {article 1697}, year = 2018, issn = {1996-1073}, doi = {10.3390/en11071697}, abstract = {The medium-voltage direct-current (MVDC) ship power system has been extensively investigated and discussed in recent years. This paper presents an alternating current/direct-current (AC/DC) power flow algorithm based on complex affine arithmetic for the zonal MVDC shipboard power system in the presence of power variation. The power converter effect is considered, and an affine power converter model is proposed in the power flow model. An affine-analysis-based sequential method is adopted to solve AC/DC power flows. With the proposed algorithm, the bounds of bus voltages can be effectively obtained. A relative influence factor is defined to quantitatively assess the effect of power variation on voltage profile. Four cases are studied in detail to demonstrate the applicability of the proposed algorithm. The proposed algorithm is useful in network architecture design, planning, and online operations of MVDC power systems when such decisions are subject to power variation.} } @inproceedings{col-vac-vil-zol-18-aa-powflow, author = {Coletta, Guido and Vaccaro, Alfredo and Villacci, Domenico and Zollo, Andrea}, title = {Solving Uncertain Power Flow Problem by Affine Arithmetic}, booktitle = {2018 AEIT International Annual Conference}, year = 2018, volume = {}, number = {}, pages = {1-6}, keywords = {}, doi = {10.23919/AEIT.2018.8577403}, month = oct, abstract = {Uncertainty management is becoming a very challenging tool in operation scheduling of networks interested by massive distributed generators' penetration. From this point of view, self-validated computing techniques are very useful tools, allowing to intrinsically track data uncertainty effects into power system operation procedures. In this field, the use of Affine Arithmetic has been demonstrated to be one of the most promising research direction, since it prevents the typical error explosion phenomena affecting the standard range arithmetic-based computing frameworks. Starting from these considerations, the aim of this paper is to investigate the Affine Arithmetic-based Power Flow problem, which, by mean of the uncertainty bounds characterization, can provide additional information to the system operators in their decision making processes. The methodology will be tested on the 30-bus IEEE test network and the results will be validated by application of traditional sampling-based techniques.} } @article{shi-nin-18-aa-safpow, author = {Rashmi Shivarudraswamy and Shankaraiah Ningaiah}, title = {An Affine Arithmetic Approach to Model and Estimate the Safety Parameters of {AC} Transmission Lines}, journal = {International Journal of Image, Graphics and Signal Processing}, year = 2018, volume = {1}, pages = {11-22}, doi = {10.5815/ijigsp.2018.01.02}, month = jan, abstract = {With an increase in population of the country day by day and with high growing speed of geographical residential plots, the demand by the public for new set up of electrical power transmission system has become a common mandate. Therefore it is the responsibility of the concerned authority to protect the interests of common man in a smart manner and develop solutions for the growth of country in an intelligent way keeping safety of public as prime importance. This paper proposes an Affine Arithmetic approach of mathematical modelling to estimate the safety parameters of AC transmission line leading to sag, like, temperature, wind loading, ice loading, weight of the conductor, stress, tension, pressure etc., taking into account the uncertainty conditions so that the solutions developed address in real time. The proposed model is executed in MATLAB integrated development environment and gives the complete behavior of sag in transmission lines with respect to each of the safety parameters individually and closely ascertains the safety threshold limits considering 50{\%} factor of safety and 5m ground clearance. The critical safety threshold limit for wind loading is found to be about 3.02 kg/m and the typical value is about 1.51 kg/m. Similarly, the critical safety threshold limit for weight of ice is found to be about 1.45 kg/m, whereas its typical value is about 0.7 kg/m. Extending further, the critical safety threshold limit for conductor weight is found to be about 3.07 kg/m, whereas its typical value is about 1.6 kg/m, which is a close approximation to the typical weight per unit length of industry-grade conductors like Aluminum Conductor Steel Reinforced (ACSR). The critical safety threshold limit for tension in the conductor and the span lengths are found to be 1850 kg and 230m respectively} } @article{che-che-shi-zha-sun-hua-18-aa-windpow, author = {Cheng, Weijie and Cheng, Renli and Shi, Jun and Zhang, Cong and Sun, Gaoxing and Hua, Dong}, title = {Interval Power Flow Analysis Considering Interval Output of Wind Farms through Affine Arithmetic and Optimizing-Scenarios Method}, journal = {Energies}, volume = {11}, year = 2018, number = {11}, pages = {article 3176}, issn = {1996-1073}, doi = {10.3390/en11113176}, abstract = {Wind power belongs to sustainable and clean energy sources which play a vital role of reducing environment pollution and addressing energy crisis. However, wind power outputs are quite difficult to predict because they are derived from wind speeds, which vary irregularly and greatly all the time. The uncertainty of wind power causes variation of the variables of power grids, which threatens the power grids' operating security. Therefore, it is significant to provide the accurate ranges of power grids' variables, which can be used by the operators to guarantee the power grid's operating security. To achieve this goal, the present paper puts forward the interval power flow with wind farms model, where the generation power outputs of wind farms are expressed by intervals and three types of control modes are considered for imitating the operation features of wind farms. To solve the proposed model, the affine arithmetic-based method and optimizing-scenarios method are modified and employed, where three types of constraints of wind control modes are considered in their solution process. The former expresses the interval variables as affine arithmetic forms, and constructs optimization models to contract the affine arithmetic forms to obtain the accurate intervals of power flow variables. The latter regards active power outputs of the wind farms as variables, which vary in their corresponding intervals, and accordingly builds the minimum and maximum programming models for estimating the intervals of the power flow variables. The proposed methods are applied to two case studies, where the acquired results are compared with those acquired by the Monte Carlo simulation, which is a traditional method for handling interval uncertainty. The simulation results validate the advantages, effectiveness and the applicability of the two methods.} } @article{liu-cai-jia-han-zha-18-aa-intinv, author = {Jie Liu and Heng Cai and Chao Jiang and Xu Han and Zheng Zhang}, title = {An Interval Inverse Method Based on High Dimensional Model Representation and Affine Arithmetic}, journal = {Applied Mathematical Modelling}, volume = {63}, pages = {732-743}, year = 2018, doi = {10.1016/j.apm.2018.07.009}, comment = {AA for interval inverse problems}, abstract = {This paper proposes an interval inverse method through a high dimensional model representation and affine arithmetic, which can effectively solve inverse problems with interval uncertainty. Firstly, when only the bounds of responses can be obtained from a limited number of experimental measurements, an interval model can be employed to describe the uncertainty of the measured responses and identified parameters. Secondly, in order to reasonably estimate the degree of the closeness between the measured and calculated responses, an error interval and corresponding optimization model are constructed for the interval inverse problem. Thirdly, a high dimensional model representation is utilized to approximate the original system model, and an affine arithmetic is adopted to efficiently calculate the response bounds. Finally, the optimization model for interval inverse problem is solved using genetic algorithm to identify the upper and lower bounds of the system parameters. Three examples are studied to demonstrate the correctness and effectiveness of the proposed method.} } @article{adu-kum-18-aa-voltst, journal = {IET Generation, Transmission {\&} Distribution}, author = {Bala Surendra Adusumilli and Boddeti Kalyan Kumar}, title = {Modified Affine Arithmetic Based Continuation Power Flow Analysis for Voltage Stability Assessment under Uncertainty}, volume = {12}, number = {18}, year = 2018, pages = {4225-4232}, doi = {10.1049/iet-gtd.2018.5479}, altkeys = {ads-kum-18-aa-voltst}, abstract = {Continuation power flow (CPF) analysis has been used in the literature to determine the voltage collapse point from active power versus voltage curves (PV curves) for steady-state voltage stability assessment. Affine arithmetic-based (AA) CPF analysis to determine PV curve bounds under uncertainty in power generation was introduced in the literature to overcome the problem of large computational time with Monte Carlo (MC) simulations, by getting a faster solution with a reasonably good accuracy. However, AA operations lead to more noise terms and hence overestimation of bounds. In the present work, a modified AA (modAA)-based CPF analysis is proposed to determine PV curve bounds by considering uncertainties associated with active and reactive power injections at all buses in the system. The proposed method reduces the overestimation caused by the AA operations and gives more accurate solution bounds. The proposed modAA-based CPF analysis is tested on 5-bus test case, IEEE 57, European 1354 and Polish 2383-bus systems. The simulation results with the proposed method are compared with MC simulations and AA-based CPF analysis to show the efficacy of the proposed method.} } @misc{bue-18-coldel, author = {Lucas Moutinho Bueno}, title = {{3-Colorable} {Delaunay} Triangulations}, url = {http://arxiv.org/abs/1812.09951}, howpublished = {ArXiv Computing Research Repository (CoRR), article 1812.09951}, year = 2018, month = dec, altkeys = {bue-17-coldel} } @article{luo-shi-niy-18-aa-upowflow, author = {Luo, Jinqing and Shi, Libao and Ni, Yixin}, title = {Uncertain Power Flow Analysis Based on Evidence Theory and Affine Arithmetic}, journal = {IEEE Transactions on Power Systems}, year = 2018, volume = {33}, number = {1}, pages = {1113-1115}, doi = {10.1109/TPWRS.2017.2691539}, comment = {Combination of AA with p-boxes?}, abstract = {A novel uncertain power flow analysis method is proposed in this letter. It utilizes evidence theory to fuse probabilistic, possibilistic, and interval uncertainties. Besides, the extended affine arithmetic is applied to handle variable dependencies existed in power flow. The final analysis results are represented as probability boxes (p-boxes). The comparisons with Monte Carlo simulation are given to demonstrate the validity of the proposed method.} } @article{wan-wan-ten-str-wul-18-aa-multobj, author = {Shouxiang Wang and Kai Wang and Fei Teng and Goran Strbac and Lei Wu}, title = {An Affine Arithmetic-Based Multi-Objective Optimization Method for Energy Storage Systems Operating in Active Distribution Networks with Uncertainties}, journal = {Applied Energy}, volume = {223}, pages = {215-228}, year = 2018, doi = {10.1016/j.apenergy.2018.04.037}, comment = {Application energy storage; multiobjective optimization}, abstract = {Considering uncertain power outputs of distributed generations (DGs) and load fluctuations, energy storage system (ESS) represents a valuable asset to provide support for the smooth operation of active distribution networks. This paper proposes an affine arithmetic-based multi-objective optimization method for the optimal operation of ESSs in active distribution networks with uncertainties. Affine arithmetic is applied to the optimization model for handling uncertainties of DGs and loads. Two objectives are formulated with affine parameters including the minimization of total active power losses and the minimization of system voltage deviations. The affine arithmetic-based forward-backward sweep power flow is first improved by the proposed pruning strategy of noisy symbols. Then, the affine arithmetic-based non-dominated sorting genetic algorithm II (AA-NSGAII) is used to solve the multi-objective optimization problem for ESSs operation under uncertain environment. Furthermore, three types of indices with respect to convergence, diversity, and uncertainty are defined for performance analysis. Numerical studies on a modified IEEE 33-bus system with embedded DGs and ESSs show the effectiveness and superiority of the proposed method. The optimization results demonstrate that the obtained Pareto front has better convergence and lower conservativeness in comparison to the interval arithmetic-based NSGA-II. A multi-period case considering seasonality of DGs and loads is further simulated to show the applicability in real applications.} } @article{adu-rak-bod-18-aa-powflow, author = {Bala Surendra Adusumilli and Vinod Raj and Kalyan Kumar Boddeti}, title = {Modified Affine Arithmetic-Based Power Flow Analysis with Uncertainty}, journal = {Electric Power Components and Systems}, volume = {46}, number = {6}, pages = {728-737}, year = 2018, doi = {10.1080/15325008.2018.1465143}, abstract = {Power flow studies are very important and are essential for fault analysis and stability analysis. Conventional Newton--Raphson-based power flow analysis is for fixed loads and generations. However, load and generation powers are uncertain due to factors like forecasting error, sudden outages, etc. Monte Carlo was widely used for power flow analysis with uncertainty. Due to excessive computational time involved in Monte Carlo, affine arithmetic-based power flow analysis was introduced. In the present work, a modified affine arithmetic-based power flow analysis is proposed. The proposed method needs less computational memory and gives tighter bounds on voltage magnitudes and angles of the system buses for a given uncertainty range of load and generation powers as compared to existing affine arithmetic-based power flow analysis. The proposed method is implemented on IEEE 30 and IEEE 118 bus systems and detailed simulation results are presented. The results are compared with Monte Carlo simulations as well as existing affine arithmetic-based power flow analysis. The results show that the proposed modified affine arithmetic-based power flow analysis yields more accurate solution intervals for voltage magnitude, voltage angles, real, and reactive power flows as compared to existing affine arithmetic-based power flow analysis. } } %%% 2017 %%%%%%%%%%%%%%%%%%% @article{moh-sur-sin-ong-mad-17-aa-micro, author = {Mohan, Vivek and Suresh, Reshma and Singh, Jai Govind and Ongsakul, Weerakorn and Madhu, Nimal}, title = {Microgrid Energy Management Combining Sensitivities, Interval and Probabilistic Uncertainties of Renewable Generation and Loads}, journal = {IEEE Journal on Emerging and Selected Topics in Circuits and Systems}, year = 2017, volume = {7}, number = {2}, pages = {262-270}, keywords = {}, doi = {10.1109/JETCAS.2017.2679030}, issn = {2156-3365}, month = jun, comment = {Combines AA and probabilities}, abstract = {This paper proposes an optimal energy management approach combining sensitivities, interval, and probabilistic uncertainties of wind and solar power sources and loads in microgrid. Affine arithmetic (AA) is used to model the interval uncertainties and sensitivities in nodal power injections. However, all the elements in the interval solutions of AA-optimal power flow may not be significant in view of the probabilistic nature of statistical data. So, those elements which are significant with a desired confidence level are boxed using probability boxes obtained by deriving best fitting discrete state probability distribution functions (PDFs) for load and renewable power injections. Thus, the original hard bounded affine intervals are made soft bounded using the derived joint PDFs, forming new less conservative and more feasible intervals of cost and power flow variables. The minimization of the operational cost is taken care of by stochastic weight tradeoff particle swarm optimization. The method is tested in CIGRE LV benchmark microgrid with fuel cell, microturbine, diesel generator, wind, and solar power sources.} } @article{zha-che-nga-yan-hua-17-aa-powflow, author = {Zhang, Cong and Chen, Haoyong and Ngan, Honwing and Yang, Ping and Hua, Dong}, title = {A Mixed Interval Power Flow Analysis Under Rectangular and Polar Coordinate System}, journal = {IEEE Transactions on Power Systems}, year = 2017, volume = {32}, number = {2}, pages = {1422-1429}, doi = {10.1109/TPWRS.2016.2583503}, issn = {1558-0679}, month = mar, abstract = {A Rectangular Interval Power Flow (RIPF) method is proposed to improve solutions for intervals of power flow problems due to nondeterministic characteristics of demand loads and output of generators. It is based on affine arithmetic which is a self-validated numerical analysis and serves to improve the interval results through optimization method. Since no approximation is presumed, the RIPF method acquires narrower intervals of voltage phase and active power of branches than Polar Interval Power Flow (PIPF), it is an excellent method raised before. However, as RIPF is no better than that of PIPF for estimating intervals of voltage magnitude, because it relaxes restriction of the voltage equations. Therefore, a Mixed Interval Power Flow (MIPF) method is envisaged and developed in the paper to incorporate merits of RIPF for computing the intervals of voltage phase and active power of branches but not giving the advantage of PIPF for evaluating intervals of voltage magnitude. As a validation of our suggested approach, two case studies are carried out, and results conclude that the MIPF method acquires more accurate power flow intervals than the conventional method.} } @article{coe-vuy-cha-fri-17-aa-control, author = {Le Co{\"e}nt, Adrien and De Vuyst, Florian and Chamoin, Ludovic and Fribourg, Laurent}, title = {Control Synthesis of Nonlinear Sampled Switched Systems using {Euler's} Method}, journal = {Electronic Proceedings in Theoretical Computer Science}, volume = {247}, issn = {2075-2180}, doi = {10.4204/eptcs.247.2}, publisher = {Open Publishing Association}, year = 2017, month = apr, pages = {18--33}, comment = {Mentions AA but chooses to NOT use it, because can bound directly the global error.}, abstract = {In this paper, we propose a symbolic control synthesis method for nonlinear sampled switched systems whose vector fields are one-sided Lipschitz. The main idea is to use an approximate model obtained from the forward Euler method to build a guaranteed control. The benefit of this method is that the error introduced by symbolic modeling is bounded by choosing suitable time and space discretizations. The method is implemented in the interpreted language Octave. Several examples of the literature are performed and the results are compared with results obtained with a previous method based on the Runge-Kutta integration method.} } @article{abe-rao-nai-17-aa-powflow, title = {Load Flow Analysis of an Uncertain System in the Presence of Renewable Energy Sources Using Complex Affine Arithmetic}, author = {Yoseph Mekonnen Abebe and P Mallikarjuna Rao and M Gopichand Naik}, journal = {Journal on Electrical Engineering}, publisher = {i-Manager}, volume = {10}, number = {4}, pages = {28-40}, issn = {09738835}, year = 2017, month = jun, abstract = {The limitation of fossil fuel resource and its effects on global warming leads to the increased usage of Renewable Energy Sources (RES). Even though the Renewable Energy Sources (RES) notably wind and solar energy are advantageous in many aspects their intermittent nature is a great deal of concern in power system control. The penetration of such renewable energy source makes the generation uncertain and leads to uncertainty based steady state analysis. In this paper, a complex Affine Arithmetic (AA) based load flow analysis in the presence of generation and load uncertainty is proposed. Vectorial representation is applied to denote the partial deviation values of the variables. The proposed approach is tested on a conventional IEEE test bus systems and the result is compared with the Monte Carlo Approach. In terms of fast convergence, less memory usage, and conservatism, the proposed approach is superior than the traditional random number based Monte Carlo approach.} } @inproceedings{hua-zha-sha-17-aa-newton, author = {Weida Huang and Yan Zhang and Zhenguo Shao}, booktitle = {Proc. 43rd Annual Conference of the IEEE Industrial Electronics Society (IECON 2017)}, title = {{Newton}-{Raphson} Interval Harmonic Power Flow Based on Affine Arithmetic}, year = 2017, volume = {}, number = {}, pages = {6093-6098}, doi = {10.1109/IECON.2017.8217058}, month = oct, comment = {Use in Newton-Raphson?}, abstract = {Interval harmonic power flow can take into account the uncertainty of distributed generation, and obtain the interval results including all possible harmonic current solutions. In this paper, affine arithmetic is used to reduce the conservatism, which is a shortcoming of interval arithmetic, and a Newton-Raphson harmonic current iterative equation is established in affine form. By the equal value at both ends of the equation, the coefficients of noise element in affine correction quantities are solved one by one, and in this case, the complex performance of Interval affine matrix inversion can be avoided. The interval arithmetic method proposed in this paper is proved to be complete enough and less conservative compared to the Monte Carlo method with IEEE-30 node example.} } @inproceedings{liu-han-gua-wug-sha-17-aa-windpow, author = {Yixuan Liu and Zhongkuan Han and Mingfeng Guan and Guochang Wu and Zhenguo Shao}, title = {Optimizing the SVG Capacity for Wind Farm Based on Affine Arithmetic}, booktitle = {Proc. International Conference on Smart Grid and Electrical Automation (ICSGEA 2017)}, year = 2017, volume = {}, number = {}, pages = {509-513}, doi = {10.1109/ICSGEA.2017.20}, month = may, abstract = {With the ever-increasing penetration level of wind power, its impacts on power system reliability and power quality are becoming more and more significant mainly due to the randomness and uncertainty of wind resource. For accurate express of the model about input wind speed of wind turbines, some influence factors of wind speed will be considered as noise variables, and then a model about the uncertainty of input wind speed in wind farms will be set up by affine arithmetic method. So the output power affine model of wind turbines can be calculated from the model above, attaching the requirements of power factor by the state grid, its easy to gain the reactive power affine model. Thereupon, with the relative parts of voltage fluctuation, SVG capacity in wind farms can be reasonably optimizing and analyzing after knowing the reactive power compensation.} } @inproceedings{abe-mal-gop-18-aa-initvar, author = {Abebe, Yoseph Mekonnen and Mallikarjuna Rao, P. and Gopichand Naik, M.}, title = {Finding the Initial Variables for Affine Arithmetic-Based Power Flow Analysis}, bookTitle = {Advances in Power Systems and Energy Management: Proc. ETAEERE-2016}, year = 2018, publisher = {Springer}, pages = {147--156}, isbn = {978-981-10-4394-9}, doi = {10.1007/978-981-10-4394-9_15}, comment = {Determining the input affine forms for polar / rectangular input variables}, abstract = {Power flow analysis has been playing a major role in providing information about the power system network. Due to the advancement of variable generation (VG) sources and weather variation, the punctual power flow analysis cannot give any information about the worst case scenario. The introduction of affine arithmetic (AA) is gaining high recognition due to its ability to consider all forms of uncertainty than interval arithmetic (IA). The first work in applying AA for power flow analysis is finding the initial affine forms in order to start the analysis. This paper focuses on finding the initial voltage and angle affine forms for polar coordinates and the initial real and reactive voltage forms for rectangular coordinate system.} } @article{ska-hlad-17-aa-optmul, author = {Iwona Skalna and Milan Hladík}, title = {A New Algorithm for {Chebyshev} Minimum-Error Multiplication of Reduced Affine Forms}, journal = {Numerical Algorithms}, volume = {76}, pages = {1131--1152}, year = 2017, comment = {AA with term reduction; linear-time optimal bound for multiplication}, abstract = {Reduced affine arithmetic (RAA) eliminates the main deficiency of the standard affine arithmetic (AA), i.e. a gradual increase of the number of noise symbols, which makes AA inefficient in a long computation chain. To further reduce overestimation in RAA computation, a new algorithm for the Chebyshev minimum-error multiplication of reduced affine forms is proposed. The algorithm yields the minimum Chebyshev-type bounds and works in linear time, which is asymptotically optimal. We also propose a simplified O(nlogn) version of the algorithm, which performs better for low dimensional problems. Illustrative examples show that the presented approach significantly improves solutions of many numerical problems, such as the problem of solving parametric interval linear systems or parametric linear programming, and also improves the efficiency of interval global optimisation.} } @inproceedings{rom-can-17-aa-unitcom, author = {David Fernando {Romero-Quete} and Claudio A. Canizares}, title = {Affine Arithmetic Formulation of the Unit Commitment Problem Under Uncertainty}, booktitle = {Proc. Bulk Power Systems Dynamics and Control Symposium (IREP 2017)}, location = {Espinho, Portugal}, year = 2017, month = aug, comment = {Application to power allocation and generator on/off schedule}, abstract = {This paper proposes a method based on affine arithmetic (AA) to solve the unit commitment (UC) problem, considering load and renewable energy (RE) uncertainties. The main idea is to formulate an AA-based constrained multi-objective problem that not only provides a robust commitment solution, but also provides confidence intervals for active powers and operating costs, as well as dispatch solutions for all possible load and RE generation realizations for the predetermined uncertainty bounds. Moreover, the AA-based UC (AAUC) approach allows to explore solutions where the impact of the re-dispatch cost in the total operation cost can be reduced by adjusting the objective function weight values. The proposed approach can be used to better estimate day-ahead energy prices and explore more costefficient solutions under uncertainty, as well as for real-time dispatching. The AAUC approach is tested and compared against stochastic optimization UC (SOUC), interval optimization UC (IOUC), and Monte Carlo simulation (MCS) approaches, on a sixbus system and a modified IEEE 118-bus system. The simulations results show that the proposed approach provides more accurate confidence intervals for active power and operating costs than IOUC, using MCS results as the benchmark, and has a better computational performance than SOUC} } @inproceedings{din-zha-tri-sti-can-17-aa-wceletr, author = {Ding, Tongyu and Zhang, Liang and Trinchero, Riccardo and Stievano, Igor S. and Canavero, Flavio G.}, title = {Worst-Case Analysis of Electrical and Electronic Equipment via Affine Arithmetic}, booktitle = {Proc. International Conference on Electromagnetics in Advanced Applications (ICEAA 2017)}, year = 2017, volume = {}, number = {}, pages = {991-993}, doi = {10.1109/ICEAA.2017.8065425}, month = sep, comment = {Worst-case electronic circuit analysis}, abstract = {This paper proposes to generate a smart tool that can inherently and effectively capture the results of parameter variations on the system responses of lumped and distributed electrical circuits. This methodology leverages the so-called affine arithmetic and represents parameter-dependent responses in terms of a multivariate polynomial. The affine representation is propagated from input parameters to circuit responses through a suitable redefinition of the basic operations, such as addition, multiplication or matrix inversion, that are involved in the circuit solution. The proposed framework is applied to the frequency-domain analysis of switching converters, and it turns out to be accurate and more efficient than traditional solutions based on Monte Carlo analysis.} } @article{abe-rao-nak-17-aa-powflow, author = {Yoseph Mekonnen Abebe and P. Mallikarjuna Rao and M. Gopichand Nak}, title = {Load Flow Analysis of a Power System Network in the Presence of Uncertainty using Complex Affine Arithmetic}, journal = {International Journal of Engineering and Manufacturing}, volume = {5}, number = {}, pages = {48-64}, year = 2017, month = sep, doi = {10.5815/ijem.2017.05.05}, abstract = {The depletion of fossil fuel is driving the world towards the application of renewable energy sources. However, their intermittent nature, in addition to load variation and transmission line sag-tension change due to temperature, is a great deal of problems for reliable power delivery. Without a reliable power delivery, power generation is just a waste of resources. A reliable power delivery can be achieved when the best and the worst case steady state information of a power system network is known to plan and control accordingly. If a system is affected by the presence of uncertainty, a deterministic load flow analysis fails to provide the worst-case load flow result in a single analysis. As a result, a load flow analysis considering the presence of uncertainty is mandatory. On this paper, a novel complex affine arithmetic (AA) based load flow analysis in the presence of generation and load uncertainties is proposed. The proposed approach is tested on an IEEE bus systems and compared with Monte Carlo approach. The proposed approach convergence faster than the Monte Carlo based method and it is slightly conservative.} } @article{bos-pel-sol-17-aa-projsche, author = {Bosurgi, Gaetano and Pellegrino, Orazio and Sollazzo, Giuseppe}, title = {Project Duration Evaluated Using Affine Arithmetic}, volume = {61}, number = {3}, journal = {Periodica Polytechnica Civil Engineering}, year = 2017, pages = {412-420}, doi = {10.3311/PPci.8972}, comment = {Appplication to civil engineering project scheduling}, abstract = {A civil engineering work can be performed by organizing the available resources (manpower, equipment and materials) in many different ways. Each different configuration results in a realization time and a cost that a building company has to bear. To produce reliable duration forecasts and money savings, it is essential to take into account all the uncertainties involved in the project operations. Generally, since it is impractical to process numerous uncertain variables - also undefined from a statistical point of view -, traditional probabilistic methods involve application difficulties for complex environments such as construction sites. To properly handle this issue, the authors propose in this paper the application of the Affine Arithmetic technique. This method treats the variables as intervals and returns reliable results, even when the variables are mutually dependent. The numerical example presented in the paper proves the efficiency of the procedure, even if some analytical complications are included in the analysis (dependency between variables, non-linear functions, etc.). Comparisons with Interval Analysis and traditional procedures are also provided. Adopting Affine Arithmetic, the results are reported in terms of intervals, avoiding the definition of unrealistic deterministic values that can strongly affect the operation organization. Furthermore, without increasing the problem complexity, the model admits continuous modifications (interval amplitudes, new variable dependencies, etc.) to correct and optimize the durations.} } @article{luo-guw-wan-che-17-aa-unsch, author = {Luo, Lizi and Gu, Wei and Wang, Yonghui and Chen, Chunxi}, title = {An Affine Arithmetic-Based Power Flow Algorithm Considering the Regional Control of Unscheduled Power Fluctuation}, journal = {Energies}, volume = {10}, year = 2017, number = {11}, pages = {article 1794}, doi = {10.3390/en10111794}, issn = {1996-1073}, abstract = {With consideration of the intermittency of renewable generation and uncertain load, a regional control strategy is presented to smooth the unscheduled power fluctuation in this letter. Then, an affine arithmetic-based modeling method is proposed to describe the unscheduled power tracking characteristic of dispatchable generation resources (DGRs), based on which interval power flow solutions with narrower ranges can be obtained. Finally, the proposed algorithm is applied to a modified IEEE 33-bus distribution system to demonstrate its effectiveness.} } @inproceedings{rah-kie-cec-wat-17-aa-weathpow, author = {Rahman, Mahbubur and Kiesau, Mareike and Cecchi, Valentina and Watkins, Bobby}, title = {Investigating effects of weather parameter uncertainty on transmission line power handling capabilities using affine arithmetic}, booktitle = {Proc. 2017 IEEE Power {\&} Energy Society General Meeting}, location = {Chicago}, year = 2017, volume = {}, number = {}, pages = {1-5}, doi = {10.1109/PESGM.2017.8274733}, abstract = {This paper presents an approach to deal with uncertainty in weather parameters when determining transmission line power handling capabilities, in terms of both line thermal rating and voltage stability limits. Weather parameters affect conductor temperature, which in return affects line electrical parameters. Wind speed and direction, for example, have a significant cooling effect, which can result in higher allowable currents through the line before reaching the maximum conductor temperature. At the same time, the line electrical parameters, particularly resistance, are a function of temperature and would therefore affect the line electrical model and its maximum power transfer point before voltage collapse. Weather conditions are variable and uncertain; in order to account for the uncertainty in weather parameters, this paper presents an approach based on the affine form of interval arithmetic. The results of the affine arithmetic-based approach are then compared with static line ratings. The approach is tested on a single-line 2-bus system and on a 14-bus transmission network.} } @article{wan-wuz-dou-hum-xuy-17-aa-powflow, author = {Yang Wang and Zaijun Wu and Xiaobo Dou and Minqiang Hu and Yiyue Xu}, title = {Interval power flow analysis via multi-stage affine arithmetic for unbalanced distribution network}, journal = {Electric Power Systems Research}, volume = {142}, pages = {1-8}, year = 2017, doi = {10.1016/j.epsr.2016.08.024}, abstract = {Integrating large numbers of intermittent energy resources, such as photovoltaic generations and wind turbines, brings huge uncertainty to the operation of distribution network. In this paper, an interval power flow method via multi-stage affine arithmetic is proposed to address the impact of distributed generation output power and load uncertainty on the power flow solution for the unbalanced distribution network, which acquires affine expression of bus voltage by solving the fixed component, first-order perturbation and non-linear perturbation of the bus complex voltage respectively. Multi-numerical results based on modified IEEE 123 nodes test feeder are presented and discussed, demonstrating that the proposed method achieves much better performance than existing ones in both precision and computation aspects.} } @article{miy-mat-kou-17-semps, author = {Atsushi Miyamoto and Hiroki Matsuse and Gou Koutaki}, title = {Robust Surface Reconstruction by Design-Guided {SEM} Photometric Stereo}, journal = {Measurement Science and Technology}, volume = {28}, number = {4}, month = feb, year = 2017, } @article{vac-can-17-aa-uncpow, author = {Vaccaro, Alfredo and Ca{\~n}izares, Claudio A.}, title = {An Affine Arithmetic-Based Framework for Uncertain Power Flow and Optimal Power Flow Studies}, journal = {IEEE Transactions on Power Systems}, year = 2017, volume = {32}, number = {1}, pages = {274-288}, doi = {10.1109/TPWRS.2016.2565563}, comment = {Application to power systems with uncertainties}, abstract = {This paper proposes a unified framework based on affine arithmetic for computing reliable enclosures of uncertain power flow (PF) and optimal power flow (OPF) solutions. The main idea is to formulate a generic mathematical programming problem under uncertainty by means of equivalent deterministic problems, and to identify the affine forms describing the data uncertainty by means of a signal processing technique based on principal components analysis. Compared to existing solution algorithms, this formulation presents greater flexibility, as it allows to find feasible solutions and inclusion of multiple equality and inequality constraints, and reduce the approximation errors to obtain better PF and OPF solution enclosures. Detailed numerical results are presented and discussed using a variety of realistic test systems, demonstrating the effectiveness of the proposed methodologies and comparing it to existing techniques for uncertain PF and OPF analysis.} } %%% 2016 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @inproceedings{nin-16-aa-ibex, author = {Ninin, Jordan}, title = {Global Optimization Based on Contractor Programming: {An} Overview of the {IBEX} Library}, booktitle = {Proc. International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2015)}, series = {LNCS}, volume = {9582}, publisher = {Springer}, doi = {10.1007/978-3-319-32859-1_47}, year = 2016, isbn = {978-3-319-32858-4}, comment = {Uses AA}, abstract = {IBEX is an open-source C++ library for constraint processing over real numbers. It provides reliable algorithms for handling non-linear constraints. In particular, roundoff errors are also taken into account. It is based on interval arithmetic and affine arithmetic. The main feature of IBEX is its ability to build strategies declaratively through the contractor programming paradigm. It can also be used as a black-box solver or with an AMPL interface. Two emblematic problems that can be addressed are: (i) System solving: A guaranteed enclosure for each solution of a system of (nonlinear) equations is calculated; (ii) Global optimization: A global minimizer of some function under non-linear constraints is calculated with guaranteed and reliable bounds on the objective minimum.} } @article{sun-luo-tan-huy-zho-16-aa-reliab, author = {Jianping Sun and Yiping Luo and Zhaoping Tang and Yutao Hu and Xinjian Zhou}, title = {An Improved Affine Algorithm for the Non-Probabilistic Reliability Index of Interval Model}, journal = {International Journal of Control and Automation}, issn = {2005-4297}, volume = {9}, number = {4}, pages = {333-346}, year = 2016, url = {https://www.earticle.net/Article/A272700}, abstract = {Aimed at that standard interval arithmetic is easy to cause error explosion, as well as traditional affine arithmetic is easy to cause calculation error due to not considering the correlation among the first degree item, quadratic term, even the multiple-item and the nonlinear term expressed by the same noise, this paper proposed an improved algorithm which took affine algorithm operation as the main body. When there are those correlation items, the algorithm calculates the upper and lower bound of their total value by interval arithmetic, then uses the bound information and introduces the new noise affine form to instead of those terms. The method improved the conventional affine operation by combining interval arithmetic. When it applied to calculate the nonprobabilistic reliability index, the calculation results has higher accuracy than the interval arithmetic and the conventional affine algorithm, and it has strong practical significance.} } @inproceedings{wan-wan-cai-16-aa-storage, author = {Kai Wang and Wang, Shouxiang and Shengxia Cai}, title = {Quantitative Evaluation of Uncertainty Mitigation by {ESS} via Complex Affine Distribution Power Flow}, booktitle = {Proc. IEEE Power and Energy Society General Meeting (PESGM 2016)}, year = 2016, volume = {}, number = {}, pages = {1-5}, doi = {10.1109/PESGM.2016.7741556}, issn = {1944-9933}, month = jul, comment = {Complex AA, applic to power source}, abstract = {This paper quantitatively evaluates the uncertainty mitigation by energy storage system (ESS) via complex affine arithmetic-based distribution power flow. First, the affine models of distributed generations (DGs) and ESS under uncertain situations are explicitly established. Then, a forward-backward sweep power flow based on complex affine arithmetic is proposed in distribution systems with DGs and ESS. Third, an index of uncertainty mitigation by ESS to quantify the impacts on the power flow results is defined. Finally, the IEEE 13-bus system case is used to test the proposed evaluation method. The uncertainty mitigation index of ESS is calculated. Test results demonstrate that the presented index can quantitatively reflect the uncertainty mitigation impacts of ESS on separate bus voltage of distribution systems.}, } @phdthesis{rad-16-aa-thesis, author = {Radoji{\v{c}}i{\'c}, {\v{C}}arna}, title = {Symbolic Simulation of Mixed-Signal Systems with Extended Ane Arithmetic}, school = {University of Kaiserslautern}, year = 2016, month = sep, note = {Advisor: Christoph Grimm}, comment = {Extends AA to deal with discontinuous functions}, abstract = {Mixed-signal systems combine analog circuits with digital hardware and software systems. A particular challenge is the sensitivity of analog parts to even small deviations in parameters, or inputs. Parameters of circuits and systems such as process, voltage, and temperature are never accurate; we hence model them as uncertain values (`uncertainties'). Uncertain parameters and inputs can modify the dynamic behavior and lead to properties of the system that are not in specified ranges. For verification of mixed signal systems, the analysis of the impact of uncertainties on the dynamical behavior plays a central role. Verification of mixed-signal systems is usually done by numerical simulation. A single numerical simulation run allows designers to verify single parameter values out of often ranges of uncertain values. Multi-run simulation techniques such as Monte Carlo Simulation, Corner Case simulation, and enhanced techniques such as Importance Sampling or Design-of-Experiments allow to verify ranges -- at the cost of a high number of simulation runs, and with the risk of not finding potential errors. Formal and symbolic approaches are an interesting alternative. Such methods allow a comprehensive verification. However, formal methods do not scale well with heterogeneity and complexity. Also, formal methods do not support existing and established modeling languages. This fact complicates its integration in industrial design flows. In previous work on verification of Mixed-Signal systems, Affine Arithmetic is used for symbolic simulation. This allows combining the high coverage of formal methods with the ease-of use and applicability of simulation. Ane Arithmetic computes the propagation of uncertainties through mostly linear analog circuits and DSP methods in an accurate way. However, Affine Arithmetic is currently only able to compute with contiguous regions, but does not permit the representation of and computation with discrete behavior, e.g. introduced by software. This is a serious limitation: in mixed-signal systems, uncertainties in the analog part are often compensated by embedded software; hence, verification of system properties must consider both analog circuits and embedded software. The objective of this work is to provide an extension to Affine Arithmetic that allows symbolic computation also for digital hardware and software systems, and to demonstrate its applicability and scalability. Compared with related work and state of the art, this thesis provides the following achievements: 1. The thesis introduces extended Affine Arithmetic Forms (XAAF) for the representation of branch and merge operations. 2. The thesis describes arithmetic and relational operations on XAAF, and reduces over-approximation by using an LP solver. 3. The thesis shows and discusses ways to integrate this XAAF into existing modeling languages, in particular SystemC. This way, breaks in the design flow can be avoided. The applicability and scalability of the approach is demonstrated by symbolic simulation of a $\Sigma$-$\Delta$ Modulator and a PLL circuit of an IEEE 802.15.4 transceiver system} } @inproceedings{hei-ahm-ali-ahm-16-aa-comperr, author = {Azar Heidari and Arash Ahmadi and Shahpour Alirezaee and Majid Ahmadi}, title = {A Modified Affine Arithmetic Method for Computational Error Analysis }, booktitle = {Proc. International Conference on Informatics, Management Engineering and Industrial Application (IMEIA 2016)}, location = {}, year = 2016, isbn = {978-1-60595-345-8}, comment = {Modified AA - what mod?}, abstract = {Computational precision always has been a concern in digital systems design and optimization. This study presents a modified Affine Arithmetic method to calculate uncertainty range in the output of arithmetic units. We have considered five case studies, namely: quadratic equation, RGB to CrYCb system, fourth-order equation, multivariate polynomial functions and low pass filter, by which the proposed method is evaluated. Presented results indicate the modified affine arithmetic can outperform the traditional methods.} } @misc{kas-16-aa-nitsui, author = {Masahide Kashiwagi}, title = {About Affine Arithmetic}, year = 2016, note = {In Japanese.}, url = {http://verifiedby.me/kv/affine/affine.pdf}, howpublished = {Online document}, pages = {15}, comment = {To check. Considers the H{\'e}non map.} } @inproceedings{mat-ued-16-aa-simul, author = {Matsumoto, Shota and Ueda, Kazunori}, title = {Symbolic Simulation of Parametrized Hybrid Systems with Affine Arithmetic}, booktitle = {23rd International Symposium on Temporal Representation and Reasoning (TIME 2016)}, year = 2016, volume = {}, number = {}, pages = {4-11}, keywords = {}, doi = {10.1109/TIME.2016.8}, issn = {2332-6468}, month = oct, comment = {Symbolic simulation of systems with continuous and discrete changes}, abstract = {The purpose of this research is to develop a highly reliable simulator of hybrid systems, i.e., systems involving both discrete change and continuous evolution. In particular, we aim at rigorous simulation of parametrized hybrid systems, which enables not only the analysis of model's possible behavior but also the design of parameters that realize desired properties. Simulators with interval arithmetic can reliably compute a reachable set of states, but preserving the dependency of uncertain quantities in models is still challenging. In this paper, we discuss a simulation method that is based on symbolic computation and cooperates with the interval Newton method and affine arithmetic, which is able to preserve first-order dependency of uncertain quantities. We implemented the algorithm on the symbolic simulator we have been developing and evaluated the performance of the method with example models.} } @inproceedings{zha-che-guo-lei-leh-wan-16-aa-mixpol, author = {Cong Zhang and Haoyong Chen and Manlan Guo and Jia Lei and Hailin Ge and Chulin Wan}, title = {A Mixed Interval Power Flow Analysis Based on Affine Arithmetic}, booktitle = {Proc. IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC 2016)}, year = 2016, volume = {}, number = {}, pages = {758-762}, doi = {10.1109/APPEEC.2016.7779597}, month = oct, comment = {Mixed cartesian-polar method for power flow estimation}, abstract = {A rectangular interval power flow (RIPF) method is proposed to evaluate solutions' intervals of power flow including uncertain loads and output of generators. It is based on affine arithmetic which is a more accurate method to compute intervals, and it obtains intervals through optimization methods to enhance efficiency of interval calculation. Because no approximation is used, RIPF can acquire narrower intervals of voltage phase results than polar interval power flow (PIPF), which is an excellent method raised before. However, RIPF is no better than PIPF in estimating intervals of voltage amplitude, since it could not satisfy the voltage equations of interval power flow. Therefore, a mixed interval power flow (MIPF) is established to incorporate merits of RIPF in computing intervals of voltage phase and PIPF's advantages in evaluating intervals of voltage magnitude. The IEEE118 system is analyzed to conclude that MIPF can acquire more accurate power flow intervals than PIPF.} } @article{zou-pen-cai-wuh-hul-16-aa-forens, author = {Tiefang Zou and Haitao Peng and Ming Cai and Hequan Wu and Lin Hu}, title = {A {Taylor}-Affine Arithmetic for Analyzing the Calculation Result Uncertainty in Accident Reconstruction}, journal = {Forensic Science International}, volume = {266}, pages = {502-510}, year = 2016, issn = {0379-0738}, doi = {10.1016/j.forsciint.2016.07.011}, comment = {Application of AA to forensics, eg car accident reconstruction}, abstract = {In order to analyze the uncertainty of a reconstructed result, the Interval Algorithm (IA), the Affine Arithmetic (AA) and the Modified Affine Arithmetic (MAA) were introduced firstly, and then a Taylor-Affine Arithmetic (TAA) was proposed based on the MAA and Taylor series. Steps of the TAA, especially in analyzing uncertainty of a simulation result were given. Through the preceding five numerical cases, its application was demonstrated and its feasibility was validated. Results showed that no matter other methods (The IA, AA, the Upper and Lower bound Method, the Finite Difference Method) work well or bad, the TAA work well, even under the condition that the MAA cannot work in some cases because of the division/root operation in these models. Furthermore, in order to make sure that the result obtained from the TAA can be very close to the accurate interval, a simple algorithm was proposed based on the sub-interval technique, its feasibility was validated by two other numerical cases. Finally, a vehicle--pedestrian test was given to demonstrate the application of the TAA in practice. In the vehicle--pedestrian test, the interval [35.5, 39.1]km/h of the impact velocity can be calculated according to steps of the TAA, such interval information will be more useful in accident responsibility identification than a single number. This study will provide a new alternative method for uncertainty analysis in accident reconstruction.} } @phdthesis{rad-16-aa-simul, author = {Carna Radojicic}, title = {Symbolic Simulation of Mixed-Signal Systems with Extended Affine Arithmetic}, type = {doctoralthesis}, pages = {115}, school = {Technische Universit{\"a}t Kaiserslautern}, year = 2016, note = {Advisor: Christoph Grimm}, url = {http://nbn-resolving.de/urn:nbn:de:hbz:386-kluedo-44837}, abstract = {Mixed-signal systems combine analog circuits with digital hardware and software systems. A particular challenge is the sensitivity of analog parts to even small deviations in parameters, or inputs. Parameters of circuits and systems such as process, voltage, and temperature are never accurate; we hence model them as uncertain values (`ncertainties'). Uncertain parameters and inputs can modify the dynamic behavior and lead to properties of the system that are not in specified ranges. For verification of mixed- signal systems, the analysis of the impact of uncertainties on the dynamical behavior plays a central role. Verification of mixed-signal systems is usually done by numerical simulation. A single numerical simulation run allows designers to verify single parameter values out of often ranges of uncertain values. Multi-run simulation techniques such as Monte Carlo Simulation, Corner Case simulation, and enhanced techniques such as Importance Sampling or Design-of-Experiments allow to verify ranges -- at the cost of a high number of simulation runs, and with the risk of not finding potential errors. Formal and symbolic approaches are an interesting alternative. Such methods allow a comprehensive verification. However, formal methods do not scale well with heterogeneity and complexity. Also, formal methods do not support existing and established modeling languages. This fact complicates its integration in industrial design flows. In previous work on verification of Mixed-Signal systems, Affine Arithmetic is used for symbolic simulation. This allows combining the high coverage of formal methods with the ease-of use and applicability of simulation. Affine Arithmetic computes the propagation of uncertainties through mostly linear analog circuits and DSP methods in an accurate way. However, Affine Arithmetic is currently only able to compute with contiguous regions, but does not permit the representation of and computation with discrete behavior, e.g. introduced by software. This is a serious limitation: in mixed-signal systems, uncertainties in the analog part are often compensated by embedded software; hence, verification of system properties must consider both analog circuits and embedded software. The objective of this work is to provide an extension to Affine Arithmetic that allows symbolic computation also for digital hardware and software systems, and to demonstrate its applicability and scalability. Compared with related work and state of the art, this thesis provides the following achievements: 1. The thesis introduces extended Affine Arithmetic Forms (XAAF) for the representation of branch and merge operations. 2. The thesis describes arithmetic and relational operations on XAAF, and reduces over-approximation by using an LP solver. 3. The thesis shows and discusses ways to integrate this XAAF into existing modeling languages, in particular SystemC. This way, breaks in the design flow can be avoided. The applicability and scalability of the approach is demonstrated by symbolic simulation of a Delta-Sigma Modulator and a PLL circuit of an IEEE 802.15.4 transceiver system.} } @inproceedings{rad-gri-16-aa-formal, author = {Radojicic, Carna and Grimm, Christoph}, title = {Formal Verification of Mixed-Signal Designs Using Extended Affine Arithmetic}, booktitle = {2016 12th Conference on Ph.D. Research in Microelectronics and Electronics (PRIME)}, year = 2016, volume = {}, number = {}, pages = {1-4}, doi = {10.1109/PRIME.2016.7519482}, month = jun, comment = {Formal verification of signal processing hardware. Extended AA.}, abstract = {The complexity and heterogeneity of today's mixed-signal systems makes verification a challenge. A particular challenge is the sensitivity of analog parts to variations in parameters, inputs, or initial conditions. We present a methodology for formal verification of mixed-signal systems that verifies the impact of variations of parameters, inputs, or initial conditions on specified properties. Compared with state of the art, the proposed methodology can be integrated easily in existing design flows, handles analog and digital parts, and offers improved scalability. The method is applied on a third order $\Sigma \Delta$ Modulator for verifying the stability property. The results show that our approach is using one simulation run able to find the input sequence that could lead to the undesired system behavior. These values are often not trivial and most likely would never be detected by traditional simulation-based techniques.} } @article{wan-qin-16-aa-mechopt, author = {Wang, Shaobo and Qing, Xiangyun}, title = {A Mixed Interval Arithmetic/Affine Arithmetic Approach for Robust Design Optimization With Interval Uncertainty}, journal = {Journal of Mechanical Design}, pages = {article 041403}, volume = {138}, number = {4}, year = 2016, month = {02}, doi = {10.1115/1.4032630}, comment = {Optimization of mechanical designs}, abstract = {Uncertainty is ubiquitous throughout engineering design processes. Robust optimization (RO) aims to find optimal solutions that are relatively insensitive to input uncertainty. In this paper, a new approach is presented for single-objective RO problems with an objective function and constraints that are continuous and differentiable. Both the design variables and parameters with interval uncertainties are represented as affine forms. A mixed interval arithmetic (IA)/affine arithmetic (AA) model is subsequently utilized in order to obtain affine approximations for the objective and feasibility robustness constraint functions. Consequently, the RO problem is converted to a deterministic problem, by bounding all constraints. Finally, nonlinear optimization solvers are applied to obtain a robust optimal solution for the deterministic optimization problem. Some numerical and engineering examples are presented in order to demonstrate the advantages and disadvantages of the proposed approach. The main advantage of the proposed approach lies in the simplicity of the conversion from a nonlinear RO problem with interval uncertainty to a deterministic single-looped optimization problem. Although this approach cannot be applied to problems with black-box models, it requires a minimal use of IA/AA computation and applies some widely used advanced solvers to single-looped optimization problems, making it more suitable for applications in engineering fields.} } @article{xuc-guw-gao-son-men-fan-16-aa-improv, author = {Xu, Chao and Gu, Wei and Gao, Fei and Song, Xiaohui and Meng, Xiaoli and Fan, Miao}, title = {Improved Affine Arithmetic Based Optimisation Model for Interval Power Flow Analysis}, journal = {IET Generation, Transmission {\&} Distribution}, year = 2016, volume = {10}, number = {15}, pages = {3910-3918}, doi = {10.1049/iet-gtd.2016.0601}, abstract = {Power flow (PF) problem need to be further studied when confronted with uncertainties brought in by the increasing use of renewable energy. This study proposes a new solution method based on linear approximation of the affine arithmetic (AA) based PF model and optimal solution technique incorporated with boundary load flow framework under generation and load data uncertainties. In each iteration solution step, non-linear interval PF problem is modelled by the approximation technique with AA. Boundaries of state variables are explored by solving linear programming models with constraints reformed at given operating points. After optimisation process, new operating point is obtained and updated for further iteration solution step. Application of the proposed methodology is implemented in several IEEE benchmark test systems and results are demonstrated in details. Comparisons between the previous interval method and Monte Carlo simulations verify the effectiveness and better performance of the proposed method.} } %%% 2015 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @inproceedings{imm-15-aa-reach, author = {Fabian Immler}, title = {Verified Reachability Analysis of Continuous Systems}, booktitle = {Proc 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2015)}, series = {LNCS}, volume = {9035}, pages = {37–51}, doi = {10.1007/978-3-662-46681-0_3}, publisher = {Springer}, year = 2015, month = apr, comment = {Solution of ODEs}, abstract = {Ordinary differential equations (ODEs) are often used to model the dynamics of (often safety-critical) continuous systems. This work presents the formal verification of an algorithm for reachability analysis in continuous systems. The algorithm features adaptive Runge-Kutta methods and rigorous numerics based on affine arithmetic. It is proved to be sound with respect to the existing formalization of ODEs in Isabelle/HOL. Optimizations like splitting, intersecting and collecting reachable sets are necessary to analyze chaotic systems. Experiments demonstrate the practical usability of our developments.} } @misc{bou-nin-car-mon-15-aa-inverse, author = {Bourguignon, S{\'e}bastien and Ninin, Jordan and Carfantan, Herv{\é} and Mongeau, Marcel}, title = {Exact Minimization of $L_0$-Norm-Based Criteria for Moderate-Size Inverse Problems Through Mixed-Integer Programming}, howpublished = {Online document}, year = 2015, month = feb, url = {https://www.researchgate.net/publication/282865015_Exact_minimization_of_L0-norm-based_criteria_for_moderate-size_inverse_problems_through_mixed-integer_programming}, comment = {Abstract and text not available.} } @article{bou-nin-car-mon-16-aa-sparse, author = {Bourguignon, S{\'e}bastien and Ninin, Jordan and Carfantan, Herv{\é} and Mongeau, Marcel}, title = {Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance}, journal = {IEEE Transactions on Signal Processing}, year = 2016, volume = 64, number = 6, pages = {1405-1419}, doi = {10.1109/TSP.2015.2496367}, issn = {1941-0476}, month = mar, Comment = {Does it use AA? Not clear. But linear programming approximation may be related.}, altkeys = {bou-nin-car-mon-15-aa-sparse}, abstract = {Sparse approximation addresses the problem of approximately fitting a linear model with a solution having as few non-zero components as possible. While most sparse estimation algorithms rely on suboptimal formulations, this work studies the performance of exact optimization of $l_0$-norm-based problems through Mixed-Integer Programs (MIPs). Nine different sparse optimization problems are formulated based on $l_1$, %$_2$ or $l_{\infinity}$ data misfit measures, and involving whether constrained or penalized formulations. For each problem, MIP reformulations allow exact optimization, with optimality proof, for moderate-size yet difficult sparse estimation problems. Algorithmic efficiency of all formulations is evaluated on sparse deconvolution problems. This study promotes error-constrained minimization of the $l_0$ norm as the most efficient choice when associated with $l_1$ and $l_{\infinity}$ misfits, while the $l_2$ misfit is more efficiently optimized with sparsity-constrained and sparsity-penalized problems. Exact $l_0$-norm optimization is shown to outperform classical methods in terms of solution quality, both for over- and underdetermined problems. Numerical simulations emphasize the relevance of the different lp fitting possibilities as a function of the noise statistical distribution. Such exact approaches are shown to be an efficient alternative, in moderate dimension, to classical (suboptimal) sparse approximation algorithms with $l_2$ data misfit. They also provide an algorithmic solution to less common sparse optimization problems based on $l_1$ and $l_{\infinity}$ misfits. For each formulation, simulated test problems are proposed where optima have been successfully computed. Data and optimal solutions are made available as potential benchmarks for evaluating other sparse approximation methods.} } @article{nin-mes-han-15-aa-relax, author = {Ninin, J. and Messine, F. and Hansen, P.}, title = {A Reliable Affine Relaxation Method for Global Optimization}, journal = {Quarterly Journal of Operationa Research}, volume = {13}, pages = {247–277}, year = 2015, doi = {10.1007/s10288-014-0269-0}, comment = {Uses a modified AA for global optimization. Benchmark tests}, abstract = {An automatic method for constructing linear relaxations of constrained global optimization problems is proposed. Such a construction is based on affine and interval arithmetics and uses operator overloading. These linear programs have exactly the same numbers of variables and inequality constraints as the given problems. Each equality constraint is replaced by two inequalities. This new procedure for computing reliable bounds and certificates of infeasibility is inserted into a classical branch and bound algorithm based on interval analysis. Extensive computation experiments were made on 74 problems from the COCONUT database with up to 24 variables or 17 constraints; 61 of these were solved, and 30 of them for the first time, with a guaranteed upper bound on the relative error equal to $10^{−8}$. Moreover, this sample comprises 39 examples to which the GlobSol algorithm was recently applied finding reliable solutions in 32 cases. The proposed method allows solving 31 of these, and 5 more with a CPU-time not exceeding 2 min.} } @inproceedings{avi-can-sae-fel-15-aa-powdem, author = {{\'A}vila, Fernanda and Ca{\~n}izares, Claudio and S{\'a}ez, Doris and Valencia, Felipe}, title = {Load Modelling Using Affine Arithmetic for Demand Side Management}, booktitle = {Proc. IEEE PES Innovative Smart Grid Technologies Latin America (ISGT LATAM 2015)}, year = 2015, volume = {}, number = {}, pages = {456--460}, doi = {10.1109/ISGT-LA.2015.7381198}, month = oct, abstract = {Demand side management (DSM) programs aim at reducing energy consumption on the demand side, which benefits both consumers and utilities. These programs could also help maintain the critical balance between generation and demand in isolated microgrids. In this case, demand is a treated as a significant uncertainty in the context of dispatching the power resources of a microgrid. Thus, in this paper the uncertainty of consumer response to DSM signals are treated as intervals to represent the corresponding range of variation based on affine arithmetic. The total range of total grid consumption is taken as the sum of intervals in each house, using data obtained through surveys regarding usage of appliances to obtain the individual consumer intervals. The proposed affine arithmetic model is then applied to the prediction of possible range variation in a one-day ahead load forecast. Finally, the presented technique is demonstrated using data obtained in an actual microgrid deployed in Huatacondo, Chile.} } @inbook{bos-pel-sol-15-aa-road, author = {Bosurgi, Gaetano and Pellegrino, Orazio and Sollazzo, Giuseppe}, title = {Road Design Problems Solved by Affine Arithmetic}, book = {Advances in Civil Engineering and Building Materials IV}, year = 2015, pages = {431-434}, publisher = {CRC}, isbn = {9781315690490}, comment = {Application to road design}, abstract = {In this paper we propose the use of techniques based on range numbers for solving problems of road designing. We applied the Affine Arithmetic to verify the driver's visibility in a horizontal curve, providing very interesting results and confirming its usefulness even in the most complex analytical expressions. The preparation of charts such as those proposed in this paper also makes this method directly accessible to those not so familiar with this technique.} } @article{sch-olb-bar-15-aa-simutools, author = {Scharf, Oliver and Olbrich, Markus and Barke, Erich}, title = {Split and Merge Strategies for Solving Uncertain Equations Using Affine Arithmetic}, journal = {EAI Endorsed Transactions on Industrial Networks and Intelligent Systems (INIS)}, volume = {3}, number = {9}, year = 2015, month = aug, doi = {10.4108/eai.24-8-2015.2260594}, comment = {Compares AA (with range splitting), monte carlo, and corner sampling to find wort cases}, abstract = {The behaviour of systems is determined by various parameters. Due to several reasons like e. g. manufacturing tolerances these parameters can have some uncertainties. Corner Case and Monte Carlo simulations are well known approaches to handle uncertain systems. They sample the corners and random points of the parameter space, respectively. Both require many runs and do not guarantee the inclusion of the worst case. As alternatives, range based approaches can be used. They model parameter uncertainties as ranges. The simulation outputs are ranges which include all possible results created by the parameter uncertainties. One type of range arithmetic is the affine arithmetic, which allows to maintain linear correlations to avoid over-approximation. An equation solver based on affine arithmetic has been proposed earlier. Unlike many other range based approaches it can solve implicit non-linear equations. This is necessary for analog circuit simulation. For large uncertainties the solver suffers from convergence problems. To overcome these problems it is possible to split the parameter ranges, calculate the solutions separately and merge them again. For higher dimensional systems this leads to excessive runtimes as each parameter is split. To minimize the additional runtime several split and merge strategies are proposed and compared using two analog circuit examples.} } @inproceedings{gat-pas-per-hen-15-aa-voc, author = {La Gatta, Paula O. and Passos Filho, Jo{\~a}o A. and Pereira, Jos{\'e} L. R. and Henriques, Ricardo M.}, title = {An Affine Arithmetic Method to Identify Voltage Control Areas for Secondary Voltage Control}, booktitle = {Proc. 2015 IEEE Eindhoven PowerTech}, year = 2015, volume = {}, number = {}, pages = {1-6}, doi = {10.1109/PTC.2015.7232612}, month = jun, abstract = {This paper aims to present a methodology to identify Voltage Control Areas (VCA) for Secondary Voltage Control (SVC). The proposed methodology consists in the representation of data uncertainty using Affine Arithmetic (AA) applied to the Power Flow Analysis. The uncertainty used in this paper is associated only with reactive power demand, mainly due to forecast errors. The IEEE 14 bus test system and the IEEE 118 bus system are used to evaluate the proposed methodology and the results presented validate and indicate the effectiveness of using an AA-based method to identify VCA.} } @inproceedings{abe-pas-mud-16-aa-powflow, author = {Abebe, Yoseph Mekonnen and Pasumarthi, Mallikarjuna Rao and Mudavath, Gopichand Naik}, title = {Load Flow Analysis of Uncertain Power System Through Affine Arithmetic}, booktitle = {Microelectronics, Electromagnetics and Telecommunications - Proceedings of ICMEET 2015}, series = {LNEE}, number = {372}, year = 2016, publisher = {Springer}, address = {New Delhi}, pages = {217--231}, isbn = {978-81-322-2728-1}, abstract = {On this paper a novel load flow analysis using complex affine arithmetic (AA) based on Gauss-Seidel method for uncertain system is proposed. The Gauss-Seidel algorithm is used to find the uncertainty in each bus, which is the partial deviation value of the buses. The proposed algorithm is applied on an IEEE-14, 30 and 57 bus test systems. For comparison purpose a probabilistic load flow analysis based on Monte Carlo method is used. The proposed method is tested for different uncertainty level and in all the test cases AA based method is faster in convergence and gives slightly conservative bound than the probabilistic Monte Carlo approach.} } @phdthesis{vac-15-aa-thesis, author = {Alfredo Vaccaro}, title = {Affine Arithmetic for Power and Optimal Power Flow Analyses in the Presence of Uncertainties}, year = 2015, school = {University of Waterloo}, url = {http://hdl.handle.net/10012/9307}, abstract = {Optimal power system operation requires intensive numerical analyses to study and improve system security and reliability. To address this issue, Power Flow (PF) and Optimal Power Flow (OPF) analyses are important tools, since they are the foundation of many power engineering applications. For the most common formalization of these problems, the input data are specified using deterministic variables resulting either from a snapshot of the system or defined by the analyst based on several assumptions about the system under study. This approach provides problem solutions for a single system state, which is deemed representative of the limited set of system conditions corresponding to the data assumptions. Thus, when the input conditions are uncertain, numerous scenarios need to be evaluated.} } @inproceedings{xue-xie-xie-pan-ren-nie-wan-che-15-aa-3phflow, author = {Xue, Feng and Xie, Weilun and Xie, Peicheng and Pan, Zhengning and Ren, Jiayi and Nie, Yinghui and Wang, Xuchong and Chen, Ming}, title = {Unbalanced Three-Phase Distribution System Power Flow with Distributed Generation using Affine Arithmetic}, booktitle = {5th International Conference on Electric Utility Deregulation and Restructuring and Power Technologies (DRPT 2015)}, year = 2015, volume = {}, number = {}, pages = {822-829}, doi = {10.1109/DRPT.2015.7432341}, month = nov, abstract = {Due to the high penetration of the uncertain distributed generations (DGs), including wind power generators (WTG), photovoltaic (PV) power generation and plug-in hybrid electric vehicle (PHEV), the power flow of the distribution system has become asymmetry and uncertain. Based on the combination of interval and affine arithmetic, this paper establishes the model of three-phase load with uncertain DGs, and proposes a three-phase forward-backward sweep power flow algorithm for the distribution system. Compared with the deterministic power flow, the proposed algorithm can not only analyze the impact of the uncertain load and DGs on the power flow, but also reduce the overestimation of bounds yielded by correlation of variables in interval arithmetic (IA). IEEE 33-bus test systems are used to analyze the influence of the penetration of distributed generations on the distribution system.} } @inproceedings{abe-rao-15-aa-powline, author = {Abebe, Yoseph Mekonnen and Rao, P. Mallikarjuna}, title = {Overhead Transmission Line Sag, Tension and Length Calculation using Affine Arithmetic}, booktitle = {2015 IEEE Power, Communication and Information Technology Conference (PCITC)}, year = 2015, volume = {}, number = {}, pages = {211-216}, doi = {10.1109/PCITC.2015.7438162}, month = oct, abstract = {Transmission line sag, tension and conductor length varies with the variation of temperature due to thermal expansion and elastic elongation. Beside thermal effect, wind pressure and ice accumulation creates a horizontal and vertical loading on the conductor respectively. Such changes make the calculated data uncertain and require an uncertainty model. A novel affine arithmetic (AA) based transmission line sag, tension and conductor length calculation for parabolic curve is proposed and the proposed method is tested for different test cases. The results are compared with Monte Carlo (MC) and interval arithmetic (IA) methods. The AA based result gives a more conservative bound than MC and IA method in all the cases.} } @article{son-yuk-lix-han-15-aa-trosc, author = {Haiyang Song and Kaiping Yu and Xiangyang Li and Jingyong Han}, title = {Affine Arithmetic Applied to Transient Statistical Energy Analysis of a Two-Oscillator System}, journal = {Mechanics Research Communications}, volume = {70}, pages = {12-16}, year = 2015, issn = {0093-6413}, doi = {10.1016/j.mechrescom.2015.08.009}, comment = {Application to dynamic analysis of metal structures}, abstract = {This paper applies affine arithmetic to transient statistical energy analysis (SEA) of a two-oscillator system, and the influence of the measurement errors of parameters on predicted transient energy is revealed. By considering the damping loss factors and coupling loss factors with measurement errors as interval variables, the mathematical expressions of the total energy interval and the peak energy interval can finally be derived. Then two flat plates which are perpendicular to each other and joined together through bolts are exploited as numerical example to demonstrate the feasibility and effectiveness of the presented approach. Meanwhile, the structural transient energy calculated from the presented approach is compared with that obtained from the traditional method which did not consider the measurement errors of damping loss factors and coupling loss factors.} } @inproceedings{mos-mun-smi-15-aa-proving, author = {Moscato, Mariano M. and Mu{\~{n}}oz, C{\'e}sar A. and Smith, Andrew P.}, title = {Affine Arithmetic and Applications to Real-Number Proving}, booktitle = {Interactive Theorem Proving}, series = {LNCS}, volume = {9236}, year = 2015, publisher = {Springer}, pages = {294--309}, doi = {10.1007/978-3-319-22102-1_20}, comment = {General uses}, abstract = {Accuracy and correctness are central issues in numerical analysis. To address these issues, several self-validated computation methods have been proposed in the last fifty years. Their common goal is to provide rigorously correct enclosures for calculated values, sacrificing a measure of precision for correctness. Perhaps the most widely adopted enclosure method is interval arithmetic. Interval arithmetic performs well in a wide range of cases, but often produces excessively large overestimations, unless the domain is reduced in size, e.g., by subdivision. Many extensions of interval arithmetic have been developed in order to cope with this problem. Among them, affine arithmetic provides tighter estimations by taking into account linear correlations between operands. This paper presents a formalization of affine arithmetic, written in the Prototype Verification System (PVS), along with a formally verified branch-and-bound procedure implementing that model. This procedure and its correctness property enables the implementation of a PVS strategy for automatically computing upper and lower bounds of real-valued expressions that are provably correct up to a user-specified precision.} } @article{vac-pis-zob-15-aa-enerhub, author = {Vaccaro, Alfredo and Pisani, Cosimo and Zobaa, Ahmed Faheem}, title = {Affine Arithmetic-Based Methodology for Energy Hub Operation-Scheduling in the Presence of Data Uncertainty}, journal = {IET Generation, Transmission {\&} Distribution}, volume = {9}, number = {13}, pages = {1544-1552}, year = 2015, doi = {10.1049/iet-gtd.2015.0197}, abstract = {In this study, the role of self-validated computing for solving the energy hub-scheduling problem in the presence of multiple and heterogeneous sources of data uncertainties is explored and a new solution paradigm based on affine arithmetic is conceptualised. The benefits deriving from the application of this methodology are analysed in details, and several numerical results are presented and discussed.} } @article{loi-ter-vac-wal-15-aa-smartgr, author = {Loia, Vincenzo and Terzija, Vladimir and Vaccaro, Alfredo and Wall, Peter}, title = {An Affine-Arithmetic-Based Consensus Protocol for Smart-Grid Computing in the Presence of Data Uncertainties}, journal = {IEEE Transactions on Industrial Electronics}, year = 2015, volume = {62}, number = {5}, pages = {2973-2982}, doi = {10.1109/TIE.2014.2363046}, abstract = {The recent advances in cooperative and bio-inspired computing based on self-organizing sensor networks have been recognized as a very promising enabling technology for future smart grids (SGs). Although many papers outline the important role of these paradigms in decentralized SG monitoring and control, they do not explicitly consider the effect of the uncertainties that characterize the actual power system environment. The effects of these uncertainties could compromise the convergence of consensus-based algorithms in the form of unwanted changes in the convergence time, increasing the convergence errors and compromising the repeatability of the convergence. To address this problem, this paper proposes a new consensus protocol based on the use of affine arithmetic. The application of this reliable consensus protocol to decentralized SG computing is explained in detail. Furthermore, several numerical results are presented and discussed to demonstrate the effectiveness of the proposed methodology.} } @article{din-tri-man-sti-can-15-aa-unceletr, author = {Ding, Tongyu and Trinchero, Riccardo and Manfredi, Paolo and Stievano, Igor S. and Canavero, Flavio G.}, title = {How Affine Arithmetic Helps Beat Uncertainties in Electrical Systems}, journal = {IEEE Circuits and Systems Magazine}, year = 2015, volume = {15}, number = {4}, pages = {70-79}, doi = {10.1109/MCAS.2015.2484198}, comment = {AA for complex numbers, matrices}, abstract = {The ever-increasing impact of uncertainties in electronic circuits and systems is requiring the development of robust design tools capable of taking this inherent variability into account. Due to the computational inefficiency of repeated design trials, there has been a growing demand for smart simulation tools that can inherently and effectively capture the results of parameter variations on the system responses. To improve product performance, improve yield and reduce design cost, it is particularly relevant for the designer to be able to estimate worst-case responses. Within this framework, the article addresses the worst-case simulation of lumped and distributed electrical circuits. The application of interval-based methods, like interval analysis, Taylor models and affine arithmetic, is discussed and compared. The article reviews in particular the application of the affine arithmetic to complex algebra and fundamental matrix operations for the numerical frequency-domain simulation. A comprehensive and unambiguous discussion appears in fact to be missing in the available literature. The affine arithmetic turns out to be accurate and more efficient than traditional solutions based on Monte Carlo analysis. A selection of relevant examples, ranging from linear lumped circuits to distributed transmission-line structures, is used to illustrate this technique.} } @article{rum-kas-15-aa-impl, author = {Siegfried M. Rump and Masahide Kashiwagi}, title = {Implementation and Improvements of Affine Arithmetic}, journal = {Nonlinear Theory and Its Applications, IEICE}, volume = {6}, number = {3}, pages = {341-359}, year = 2015, doi = {10.1587/nolta.6.341}, abstract = {Affine arithmetic is a well-known tool to reduce the wrapping effect of ordinary interval arithmetic. We discuss several improvements both in theory and in terms of practical implementation. In particular details of INTLAB's affine arithmetic toolbox are presented. Computational examples demonstrate advantages and weaknesses of the approach.} } @article{wan-han-wul-15-aa-uncert, author = {Wang, Shouxiang and Han, Liang and Wu, Lei}, title = {Uncertainty Tracing of Distributed Generations via Complex Affine Arithmetic Based Unbalanced Three-Phase Power Flow}, journal = {IEEE Transactions on Power Systems}, year = 2015, volume = {30}, number = {6}, pages = {3053-3062}, doi = {10.1109/TPWRS.2014.2377042}, comment = {Complex number AA; application}, abstract = {Variations of load demands and generations bring multiple uncertainties to power system operation. Under this situation, power flows become increasingly uncertain, especially when significant distributed generations (DGs), such as wind and solar, are integrated into power systems. In this paper, a Complex Affine arithmetic based unbalanced Three-phase Forward-Backward Sweep power flow model (CATFBS) is proposed to study the impacts of uncertainties in unbalanced three-phase distribution systems. An index of Relative Influence of Uncertain Variables on Outcomes (RIUVO) is proposed for quantifying the impacts of individual uncertain factors on power flows and bus voltages. The CATFBS method is tested on the modified IEEE 13-bus system and a modified 292-bus system. Numerical results show that the proposed method outperforms the Monte Carlo method for exploring the impacts of uncertainties on the operation of distribution systems. The proposed CATFBS method can be used by power system operators and planners to effectively monitor and control unbalanced distribution systems under various uncertainties.} } %%% 2014 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @inproceedings{sar-rad-zil-14-aa-hybrid, author = {Sarbishei, O. and Radecka, K. and Zilic, Z.}, title = {A hybrid arithmetic transform for precision analysis of floating-point polynomial specifications}, booktitle = {Proc. 12th IEEE International New Circuits and Systems Conference (NEWCAS 2014)}, year = 2014, volume = {}, number = {}, pages = {37-40}, doi = {10.1109/NEWCAS.2014.6933979}, month = jun, commebt = {Proposed new mode Arithmetic Transform, compares to AA}, abstract = {Precision analysis of floating-point polynomial data-flow-graphs in terms of the error measure Maximum Mismatch (MM) is a challenging verification problem in computer arithmetic and embedded systems. In this paper by pairing the spectral technique Arithmetic Transform (AT) with Interval Arithmetic (IA), we introduce a static analysis to compute an overestimation of MM for floating-point polynomial specifications. The proposed analysis is applicable to fixed-point designs as well. We compare our solution with Affine Arithmetic (AA), the Gappa tool, which uses IA, as well as simulation-based methods, on a set of polynomial benchmarks. Experiments show that our analysis results in much lower overestimations of MM compared to previous work.} } @article{kan-14-aa-cluster, author = {Yuchi Kanzawa}, title = {On Applying Affine Arithmetic to Possibilistic Clustering}, journal = {IEICE Technical Report}, volume = {113}, number = {463}, pages = {87-90}, year = 2014, month = mar, location = {Osaka}, issn = {0913-5685}, comment = {AA for probabilistic $c$-means clustering. ``Possibilistic''?}, abstract = {In this report, applying affine arithmetic to possibilistic $c$-means clustering is proposed. Setting cluster number with one and initial cluster center with a datum, cluster centers for possibilistic $c$-means clustering converge to points less than data. The affine form with center of the first cluster center and a radius is checked with affine arithmetic for convergence. Clustering procedure is not needed for other data if such the data are in the previously obtained affine forms, and they are classified into the corresponding cluster.} } @inproceedings{rad-gri-mor-pan-14-aa-symdisc, author = {Radojicic, Carna and Grimm, Christoph and Moreno, Javier and Pan, Xiao}, booktitle = {Proc. Design, Automation {\&} Test in Europe Conference Exhibition (DATE 2014)}, title = {Semi-symbolic analysis of mixed-signal systems including discontinuities}, year = 2014, volume = {}, number = {}, pages = {1-4}, keywords = {}, doi = {10.7873/DATE.2014.029}, ISSN = {1558-1101}, month = mar, abstract = {The paper describes an approach for semi-symbolic analysis of mixed-signal systems that contain discontinuous functions, e.g. due to modeling comparators. For modeling and semi-symbolic simulation, we use extended Affine Arithmetic. Affine Arithmetic is currently limited to accurate analysis of linear functions and mild non-linear functions, but not yet discontinuities. In this paper we extend the approach to also handle discontinuities. For demonstration, we symbolically analyze a $\Sigma\Delta$-modulator.} } @misc{rev-the-14-aa-slides, author = {Nathalie Revol and Philippe Th{\'e}veny}, year = 2014, title = {Numerical Reproducibility of High-Performance Computations Using Floating-Point or Interval Arithmetic}, howpublished = {Slides of a presentation at the ICERM workshop \emph{Challenges in 21st Century Experimental Mathematical Computation}, 21-25 July 2014}, url = {https://icerm.brown.edu/materials/Slides/tw-14-5/Numerical_reproducibility_of_high-performance_computations_using_floating-point_or_interval_arithmetic_]_Nathalie_Revol,_INRIA.pdf}, comment = {Uses MFPI library for IA}, abstract = {My current effort: promote the use of interval arithmetic or some variants: Taylor models, affine arithmetic, through the development and implementation of methods that are not too slow compared to floating-point ones. Goal: slowdown factor less than 10. Interval matrix multiplication: slowdown factor less than 3. Interval linear system solving: slowdown factor around 15. Idea to gain performance (execution time): use optimized floating-point routines, such as BLAS. Disappointment due to the lack of numerical reproducibility.} } @inproceedings{nin-rev-14-aa-fastnodir, author = {Jordan Ninin and Nathalie Revol}, title = {Accurate and Effcient Implementation of Affine Arithmetic Using Floating-Point Arithmetic}, booktitle = {Abstracts of 16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2014)}, location = {W{\"u}rzburg, Germany}, pages = {125-126}, year = 2014, month = sep, publisher = {University of W{\"u}rzburg}, abstract = {Affine arithmetic is one of the extensions of interval arithmetic that aim at counteracting the variable dependency problem. With affine arithmetic, defined in [5] by Stolfi and Figueiredo, variables are represented as ane combination of symbolic noises. It differs from the generalized interval arithmetic, defined by Hansen in [1], where variables are represented as affine combination of intervals. Non-affne operations are realized through the introduction of a new noise, that accounts for nonlinear terms. Variants of ane arithmetic have been proposed, they aim at limiting the number of noise symbols. Let us mention [4] by Messine and [6] by Vu, Sam-Haroud and Faltings to quote only a few. The focus here is on the implementation of affine arithmetic using floating-point arithmetic, specified in [2]. With floating-point arithmetic, an issue is to handle roundoff errors and to incorporate them in the final result, so as to satisfy the inclusion property, which is the fundamental property of interval arithmetic. In [4], [5] and [6], roundoff errors are accounted for in a manner that implies frequent switches of the rounding mode; this incurs a severe time penalty. Implementations of these variants are available in YalAA, developed by Kiel [2]. We propose an implementation that uses one dedicated noise symbol for accumulated roundoff errors. For accuracy purposes, the roundoff error $\epsilon$ of each arithmetic operation is computed exactly via EFT (Error Free Transforms). For efficiency purposes, the rounding mode is never switched. Instead, a brute-force bound on the roundoff error $\varepsilon$ incurred by the accumulation of the $\epsilon$s mentioned above is used. Experimental results are presented. The proposed implementation is one of the most accurate and its execution time is significantly reduced; it can be up to 50{\%} faster than other implementations. Furthermore, the use of a FMA (Fused Multiply-and-Add) reduces the cost of the EFT and the overall performance is even better} } @mastersthesis{gba-14-aa-fatig-thesis, author = {Audrey J-M Gbaguidi}, title = {Fatigue Damage Prognosis of Internal Delamination in Composite Plates Under Cyclic Compression Loadings Using Affine Arithmetic as Uncertainty Propagation Tool}, year = 2014, month = dec, school = {Embry-Riddle Aeronautical University}, url = {https://commons.erau.edu/edt/267}, abstract = {Structural health monitoring (SHM) has become indispensable for reducing maintenance costs and increasing the in-service capacity of a structure. The increased use of lightweight composite materials in aircraft structures drastically increased the effects of fatigue induced damage on their critical structural components and thus the necessity to predict the remaining life of those components. Damage prognosis, one of the least investigated fields in SHM, uses the current damage state of the system to forecast its future performance by estimating the expected loading environments. A successful damage prediction model requires the integration of technologies in areas like measurements, materials science, mechanics of materials, and probability theories, but most importantly the quantification of uncertainty in all these areas. In this study, Affine Arithmetic is used as a method for incorporating the uncertainties due to the material properties into the fatigue life prognosis of composite plants subjected to cyclic compressive loadings. When loadings are compressive in nature, the composite plates undergo repeated buckling-unloading of the delaminated layer which induces mixed modes I and II states of stress at the tip of the delamination in the plates. The Kardomateas model-based prediction law is used to predict the growth of the delamination, while the integration of the effects of the uncertainties for modes I and II coefficients in the fatigue life prediction model is handled using Affine Arithmetic. The Mode I and Mode II interlaminar fracture toughness and fatigue characterization of the composite plates are first experimentally studied to obtain the material coefficients and fracture toughness, respectively. Next, these obtained coefficients are used in the Kardomateas law to predict the delamination lengths in the composite plates while using Affine Arithmetic to handle their uncertainties. At last, the fatigue characterization of the composite plates during compressive-buckling loadings in experimentally studied, and the delamination lengths are compared with the predicted values to check the performance of Affine Arithmetic as an uncertainty propagation tool.} } @article{gba-kim-14-aa-fatig, author = {Gbaguidi, Audrey and Kim, Daewon}, title = {Fatigue Damage Prognosis Using Affine Arithmetic}, journal = {AIP Conference Proceedings}, volume = {1581}, number = {1}, pages = {719-726}, year = 2014, doi = {10.1063/1.4864891}, comment = {Application to modeling propagation of cracks/delamination in stressed mechanical parts}, abstract = {Among the essential steps to be taken in structural health monitoring systems, damage prognosis would be the field that is least investigated due to the complexity of the uncertainties. This paper presents the possibility of using Affine Arithmetic for uncertainty propagation of crack damage in damage prognosis. The structures examined are thin rectangular plates made of titanium alloys with central mode I cracks and a composite plate with an internal delamination caused by mixed mode I and II fracture modes, under a harmonic uniaxial loading condition. The model-based method for crack growth rates are considered using the Paris Erdogan law model for the isotropic plates and the delamination growth law model proposed by Kardomateas for the composite plate. The parameters for both models are randomly taken and their uncertainties are considered as defined by an interval instead of a probability distribution. A Monte Carlo method is also applied to check whether Affine Arithmetic (AA) leads to tight bounds on the lifetime of the structure.} } @inproceedings{pir-can-bha-vac-14-aa-microgr, author = {Pirnia, Mehrdad and Ca{\~n}izares, Claudio and Bhattacharya, Kankar and Vaccaro, Alfredo}, booktitle = {Proc. 2014 Power Systems Computation Conference}, title = {An Affine Arithmetic Approach for Microgrid Dispatch with Variable Generation and Load}, year = 2014, volume = {}, number = {}, pages = {1-8}, doi = {10.1109/PSCC.2014.7038382}, month = aug, abstract = {A self-validated computing (SVC) method, based on affine arithmetic (AA) is proposed in this paper to solve the optimal power flow (OPF) problem for microgrids with renewable sources of variable generation. In the AA-based OPF formulation, all the state and control variables are presented in affine form, to represent the variable load, and wind and solar generation. Hence, the OPF model becomes an interval-based model with upper and lower bounds to represent the uncertain variables. To check the accuracy of the AA-based method, the resulted intervals are compared against those obtained from Monte-Carlo Simulation (MCS), in a 13-bus microgrid test system. The obtained real power generation intervals for thermal generators are used to determine the reserves required in dispatchable generators in the short-term to properly supply for the variability of load and intermittent renewable generation sources.} } @phdthesis{mun-14-aa-thesis, author = {Munoz Guerrero, Juan Carlos}, title = {Affine Arithmetic Based Methods for Power Systems Analysis Considering Intermittent Sources of Power}, url = {http://hdl.handle.net/10012/8161}, school = {University of Waterloo}, year = 2014, month = jan, abstract = {Intermittent power sources such as wind and solar are increasingly penetrating electrical grids, mainly motivated by global warming concerns and government policies. These intermittent and non-dispatchable sources of power affect the operation and control of the power system because of the uncertainties associated with their output power. Depending on the penetration level of intermittent sources of power, the electric grid may experience considerable changes in power flows and synchronizing torques associated with system stability, because of the variability of the power injections, among several other factors. Thus, adequate and efficient techniques are required to properly analyze the system stability under such uncertainties. A variety of methods are available in the literature to perform power flow, transient, and voltage stability analyses considering uncertainties associated with electrical parameters.} } @article{lin-qin-lia-xio-14-aa-surfint, author = {Lin, Hongwei and Qin, Yang and Liao, Hongwei and Xiong, Yunyang}, journal = {IEEE Transactions on Visualization and Computer Graphics}, title = {Affine Arithmetic-Based {B}-Spline Surface Intersection with {GPU} Acceleration}, year = 2014, volume = {20}, number = {2}, pages = {172-181}, doi = {10.1109/TVCG.2013.237}, issn = {1941-0506}, month = feb, comment = {Intersection of parametric surfaces. GPU acceleration.}, abstract = {Because the B-spline surface intersection is a fundamental operation in geometric design software, it is important to make the surface intersection operation robust and efficient. As is well known, affine arithmetic is robust for calculating the surface intersection because it is able to not only find every branch of the intersection, but also deal with some singular cases, such as surface tangency. However, the classical affine arithmetic is defined only for the globally supported polynomials, and its computation is very time consuming, thus hampering its usefulness in practical applications, especially in geometric design. In this paper, we extend affine arithmetic to calculate the range of recursively and locally defined B-spline basis functions, and we accelerate the affine arithmetic-based surface intersection algorithm by using a GPU. Moreover, we develop efficient methods to thin the strip-shaped intersection regions produced by the affine arithmetic-based intersection algorithm, calculate the intersection points, and further improve their accuracy. The many examples presented in this paper demonstrate the robustness and efficiency of this method.} } @article{guw-luo-din-men-she-14-aa-powflow, author = {Wei Gu and Lizi Luo and Tao Ding and Xiaoli Meng and Wanxing Sheng}, title = {An Affine Arithmetic-Based Algorithm for Radial Distribution System Power Flow with Uncertainties}, journal = {International Journal of Electrical Power {\&} Energy Systems}, volume = {58}, pages = {242-245}, year = 2014, doi = {10.1016/j.ijepes.2014.01.025}, abstract = {This letter presents an algorithm for radial distribution system power flow in the presence of uncertainties. To reduce the overestimation of bounds yielded by correlation of variables in interval arithmetic (IA), affine arithmetic (AA) is applied in this study to carry out tests of distribution system power flow. Compared with the algorithm based on IA, the proposed algorithm narrows the gap between the upper and lower bounds of the power flow solution. IEEE 33-bus and 69-bus test systems are used to demonstrate the effectiveness of the proposed algorithm.} } @inproceedings{sar-ort-14-pico, author = {Rafael Felipe V. Saracchini and Carlos C. Ortega}, title = {An Easy to Use Mobile Augmented Reality Platform for Assisted Living Using Pico-projectors}, booktitle = {Proc.~International Conference on Computer Vision and Graphics (ICCVG)}, series = {Lecture Notes in Computer Science}, number = {8671}, month = sep, year = 2014, isbn = {978-3-319-11330-2}, pages = {552--561} } @article{pir-can-bha-vac-14-aa-powflow, author = {Pirnia, Mehrdad and Ca{\~n}izares, Claudio A. and Bhattacharya, Kankar and Vaccaro, Alfredo}, title = {A Novel Affine Arithmetic Method to Solve Optimal Power Flow Problems With Uncertainties}, journal = {IEEE Transactions on Power Systems}, year = 2014, volume = {29}, number = {6}, pages = {2775-2783}, doi = {10.1109/TPWRS.2014.2316114}, abstract = {An affine arithmetic (AA) method is proposed in this paper to solve the optimal power flow (OPF) problem with uncertain generation sources. In the AA-based OPF problem, all the state and control variables are treated in affine form, comprising a center value and the corresponding noise magnitudes, to represent forecast, model error, and other sources of uncertainty without the need to assume a probability density function (pdf). The proposed AA-based OPF problem is used to determine the operating margins of the thermal generators in systems with uncertain wind and solar generation dispatch. The AA-based approach is benchmarked against Monte Carlo simulation (MCS) intervals in order to determine its effectiveness. The proposed technique is tested and demonstrated on the IEEE 30-bus system and also a real 1211-bus European system.} } %%% 2013 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @phdthesis{kas-13-aa-thesis, title = {Studies on Numerical Verification of Ordinary Differential Equations Using Affine Arithmetic and Mean Value Form}, author = {Kashiwagi, Keiichiro}, school = {Waseda University}, year = 2013, month = mar, note = {Conferred on 2013-03-15. In Japanese. WU numbers A3778, 6338.}, url = {https://ci.nii.ac.jp/naid/50000057447}, comment = {Uses AA to verify ODEs}, abstract = {} } @inproceedings{gou-13-aa-fluctuat, author = {Goubault, Eric}, title = {Static Analysis by Abstract Interpretation of Numerical Programs and Systems, and {FLUCTUAT}}, booktitle = {Proc. International Static Analysis Symposium (SAS 2013)}, year = 2013, publisher = {Springer}, pages = {1--3}, isbn = {978-3-642-38856-9}, doi = {10.1007/978-3-642-38856-9_1}, comment = {Invited lecture, survey of Goubault's work. Calls affine forms `zonotopes'. The {FLUCTUAT} tool.}, abstract = {This invited lecture is a survey of our work over the last 12 years or so, dealing with the precise analysis of numerical programs, essentially control programs such as the ones found in the aerospace, nuclear and automotive industry. Our approach is now based on a rather generic abstract domain, based on “zonotopes” or “affine forms” [7], but with some specificities. For instance, our zonotopic domain provides a functional abstraction [16,13], i.e. an abstraction of the input-output relationships between values of variables, allowing for test generation and modular verification [21]. Also, our domain deals with the real number and the finite precision (for instance, floating-point or fixed-point) semantics [14,17]. It is used in practice in FLUCTUAT [20,9,4] to prove some functional properties of programs, generate (counter-) examples, identify the discrepancy between the real number and the finite precision semantics and its origin etc.} } @inproceedings{uew-sur-13-aa-theorems, author = {Uewichitrapochana, Prapeepat and Surarerks, Athasit}, booktitle = {10th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology}, title = {Signed-symmetric function approximation in affine arithmetic}, year = 2013, volume = {}, number = {}, pages = {1-6}, doi = {10.1109/ECTICon.2013.6559630}, month = may, comment = {Seems important for the definition section}, abstract = {One major cause of the error explosion is the overestimation of a non-affine function introducing a new noise symbol term with non-minimum coefficient. This paper proposes theorems and its proofs to construct the best univariate affine approximation to a non-affine function in the exception case, Signed-symmetric function, that the existing theorem is not sufficient to determine the optimum one. And, as the result, it shows the use by evaluating the power function and approximating sine function.} } @article{vac-can-bha-13-aa-optpowflow, author = {Vaccaro, Alfredo and Cañizares, Claudio A. and Bhattacharya, Kankar}, journal = {IEEE Transactions on Power Systems}, title = {A Range Arithmetic-Based Optimization Model for Power Flow Analysis Under Interval Uncertainty}, year = 2013, volume = {28}, number = {2}, pages = {1179-1186}, doi = {10.1109/TPWRS.2012.2214405}, issn = {1558-0679}, month = may, abstract = {This paper presents a novel framework based on range arithmetic for solving power flow problems whose input data are specified within real compact intervals. Reliable interval bounds are computed for the power flow problem, which is represented as an optimization model with complementary constraints to properly represent generator bus voltage controls, including reactive power limits and voltage recovery processes. It is demonstrated that the lower and upper bounds of the power flow solutions can be obtained by solving two determinate optimization problems. Several numerical results are presented and discussed, demonstrating the effectiveness of the proposed methodology and comparing it to a previously proposed affine arithmetic based solution approach.} } @article{elo-ela-13-aa-complex, author = {Hassan B. M. El-Owny and A. E. A. Elaraby}, title = {New Extension of Affine Arithmetic: Complex Form}, journal = {Journal of Communications and Computer Engineering}, volume = {3}, number = {1}, pages = {11-14}, year = 2013, issn = {2090-6234}, doi = {10.20454/jcce.2013.457}, note = {The DOI seems to be fake}, comment = {Complex number version of AA. Higher-order extension?}, abstract = {In this paper we present the new complex form for affine arithmetic (AA) which is a self-verifying computational approach that keeps track of first-order correlation between uncertainties in the data and intermediate and final results. In this paper we propose a higher-order extension satisfying the requirements of genericity, arbitrary-order and self-verification, comparing the resulting method with other well-known high-order extensions of AA.} } @article{roc-13-aa-markov, author = {Claudio M Rocco S}, title ={Affine Arithmetic for Assessing the Uncertainty Propagation on Steady-State Probabilities of {Markov} Models Owing to Uncertainties in Transition Rates}, journal = {Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability}, volume = {227}, number = {5}, pages = {523-533}, year = 2013, doi = {10.1177/1748006X13485189}, comment = {Solving steady-state probabilities in Markov models with uncertain trans probs}, abstract = {This article proposes the use of affine arithmetic as an alternative approach for assessing the effects of uncertainties of transition rates on the steady-state probabilities for each possible state of a system represented by a Markov model. Affine arithmetic is an extension of interval arithmetic, able to track ``the dependency between variables throughout calculations'' and to provide strict bounds. Several examples illustrate the proposed approach. Results are compared with other approaches, such as interval arithmetic, Monte Carlo simulation or solving linear systems of simultaneous equations.} } @article{din-bor-guo-sun-wuw-zha-13-aa-powflow, author = {Tao Ding and Rui Bo and Qinglai Guo and Hongbin Sun and Wenchuan Wu and Boming Zhang}, title = {A Non-Iterative Affine Arithmetic Methodology for Interval Power Flow Analysis of Transmission Network}, journal = {Zhongguo Dianji Gongcheng Xuebao / Proceedings of the Chinese Society of Electrical Engineering}, volume = {33}, number = {19}, pages = {76-83}, year = 2013, month = jul, note = {In Chinese}, abstract = {Power flow exhibits uncertainty when power injections randomly fluctuate. The variables of power flow problem are correlated through the constraints set forth by power flow equations. Affine arithmetic can effectively overcome the correlation and therefore is adopted in this paper. In order to improve the computational efficiency, non-iterative method was proposed, which can transform the interval power flow problem into optimization problems. Linear programming, nonlinear programming and quadratic programming optimization models were established to obtain intervals of nodal voltage magnitude, phase angle, branch active power and reactive power, respectively. Simulation results of 9-bus and 57-bus test system show that the power flow interval obtained by the proposed algorithm is nearly the same as that by iterative algorithms, whereas the branch power flow results are better. The interval power flow problem can be solved quickly and efficiently with time complexity approximately $O(m^3)$. As well, parallel computing can be implemented to achieve promising improvement in computation time.} } @article{wan-han-zha-14-aa-powflow, author = {Shouxiang Wang and Liang Han and Peng Zhang}, title = {Affine Arithmetic-based DC Power Flow for Automatic Contingency Selection with Consideration of Load and Generation Uncertainties}, journal = {Electric Power Components and Systems}, volume = {42}, number = {8}, pages = {852-860}, year = 2014, publisher = {Taylor {\&} Francis}, doi = {10.1080/15325008.2014.896433}, altkeys = {wan-han-zha-13-aa-powflow}, abstract = {Power systems operate under uncertainties from variations of loads and generation with time. Power flow in a power system becomes increasingly uncertain, especially when renewable energy, such as wind and photovoltaic generation, is integrated. In this article, a DC power flow approach based on affine arithmetic is proposed to quantify risks due to uncertainties. The proposed method has been applied to the automatic contingency selection under uncertainties. Numerical studies on IEEE test systems (30, 57, and 118 buses) have proved that the DC power flow approach based on affine arithmetic is a fast and reliable method for power system planning and operation when considering uncertainty. Test cases have shown that the proposed method is as fast as the conventional DC power flow while it is much more efficient than the Monte Carlo method. Thus, the DC power flow approach based on affine arithmetic serves as a new and effective decision support tool for planners and operators to cope with high levels of renewable energy penetration, electric vehicle load integration, and other uncertain scenarios.} } @article{rad-gri-sch-rat-13-aa-mixsig, author = {Carna Radojicic and Christoph Grimm and Florian Schupfer and Michael Rathmair}, title = {Verification of Mixed-Signal Systems with Affine Arithmetic Assertions}, journal = {VLSI Design}, volume = {2013}, number = {3}, pages = {article 239064}, doi = {10.1155/2013/239064}, year = 2013, abstract = {Embedded systems include an increasing share of analog/mixed-signal components that are tightly interwoven with functionality of digital HW/SW systems. A challenge for verification is that even small deviations in analog components can lead to significant changes in system properties. In this paper we propose the combination of range-based, semisymbolic simulation with assertion checking. We show that this approach combines advantages, but as well some limitations, of multirun simulations with formal techniques. The efficiency of the proposed method is demonstrated by several examples.} } @article{soa-13-aa-allsols, author = {R. de P. Soares}, title = {Finding all real solutions of nonlinear systems of equations with discontinuities by a modified affine arithmetic}, journal = {Computers {\&} Chemical Engineering}, volume = {48}, pages = {48-57}, year = 2013, issn = {0098-1354}, doi = {h10.1016/j.compchemeng.2012.08.002}, abstract = {Chemical engineering is a rich area when comes to nonlinear systems of equations, possibly with multiple solutions, (unbounded) discontinuities, or functions which become undefined in terms of real values. In this work, a new approach is proposed for finding all real solutions of such systems within prescribed bounds. A modified affine arithmetic is used in an interval Newton method plus generalized bisection. A special constraint propagation is used to automatically remove regions where the functions are undefined for real numbers. Results for test problems have shown that the proposed implementation requires less computation effort than similar methods available in the literature for small continuous systems. Further, the method is able to find all real solutions of nonlinear systems of equations even when there are unbounded discontinuities or when functions become undefined within the given variable bounds.} } @article{sta-car-soa-13-aa-phaseq, author = {P.B. Staudt and N.S.M. Cardozo and R. de P. Soares}, title = {Phase Stability Analysis using a Modified Affine Arithmetic}, journal = {Computers {\&} Chemical Engineering}, volume = {53}, pages = {190-200}, year = 2013, issn = {0098-1354}, doi = {10.1016/j.compchemeng.2013.03.011}, comment = {Computing equilibrium points, stability analysis. Modified AA?}, abstract = {Phase stability analysis is a crucial step in the determination of multiphase equilibrium. This analysis by the tangent plane distance (TPD) minimization is a well-known technique, as well as the difficulties in providing guarantees that the global minimum has been found. On this regard, interval methods are powerful tools since they provide such guarantees. In this work, an interval Newton method plus generalized bisection, based on a modified affine arithmetic, is used to reliably find all possible stationary points of the TPD function. Additionally, an improved convergence test is suggested as well as a special treatment for mole fraction weighted averages. Several mixtures with up to 5 components, including LLE island type ternary systems, were studied. Both activity coefficient models and cubic equations of state were considered. For all the cases tested, the proposed modified affine arithmetic method was superior to other interval-based methods.} } @inproceedings{vak-lan-boi-13-aa-finerr, author = {Vakili, Shervin and Langlois, J. M. Pierre and Bois, Guy}, title = {Finite-Precision Error Modeling using Affine Arithmetic}, booktitle = {2013 IEEE International Conference on Acoustics, Speech and Signal Processing}, year = 2013, volume = {}, number = {}, pages = {2591-2595}, doi = {10.1109/ICASSP.2013.6638124}, issn = {2379-190X}, month = may, comment = {Analysis of errors in finite bit width computations. See also~\cite{vak-lan-boi-13-aa-bitwd}}, abstract = {This paper introduces a new approach for finite-precision error modeling based on affine arithmetic. The paper demonstrates that there is a common hazard in affine arithmetic-based error modeling methods described in the literature. The hazard is linked to early substitution of the signal terms that emerge in operations such as multiplication and division. The paper proposes postponed substitution combined with function maximization to address this problem. The paper also proposes a modification in the error propagation process to enhance the error modeling accuracy. An existing word length optimization method is reproduced to evaluate the efficiency of this modification. The results demonstrate that the proposed modification can improve the hardware area results by up to 7.0{\%} at the expense of negligible complexity overhead.} } @article{vak-lan-boi-13-aa-bitwd, author = {Vakili, Shervin and Langlois, J. M. Pierre and Bois, Guy}, title = {Enhanced Precision Analysis for Accuracy-Aware Bit-Width Optimization Using Affine Arithmetic}, journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}, year = 2013, volume = {32}, number = {12}, pages = {1853-1865}, doi = {10.1109/TCAD.2013.2277978}, comment = {Use AA for bit width allocation in digital signal processing}, abstract = {Bit-width allocation has a crucial impact on hardware efficiency and accuracy of fixed-point arithmetic circuits. This paper introduces a new accuracy-guaranteed word-length optimization approach for feed-forward fixed-point designs. This method uses affine arithmetic, which is a well-known analytical technique, for both range and precision analyses. This paper introduces an acceleration technique and two new semianalytical algorithms for precision analysis. While the first algorithm follows a progressive search strategy, the second one uses a tree-shaped search method for fractional width optimization. The algorithms offer two different time-complexity/cost efficiency tradeoffs. The first algorithm has polynomial complexity and achieves comparable results with existing heuristic approaches. The second algorithm has exponential complexity, but it achieves near-optimal results compared to the exhaustive search method. A commonly used set of case studies is used to evaluate the efficiency of the proposed techniques and algorithms in terms of optimization time and hardware cost. The first and second algorithms achieve 10.9{\%} and 13.1{\%} improvements in area, respectively, over uniform fractional width allocation. The proposed acceleration technique reduces the complexity of the fractional width selection problem by an average of 20.3{\%}.} } @inproceedings{mun-can-bja-vac-13-aa-transtab, author = {Mu{\~n}oz, Juan and Ca{\~n}izares, Claudio and Bhattacharya, Kankar and Vaccaro, Alfredo}, title = {Affine Arithmetic Based Methods for Voltage and Transient Stability Assessment of Power Systems with Intermittent Generation Sources}, booktitle = {2013 IREP Symposium Bulk Power System Dynamics and Control - IX Optimization, Security and Control of the Emerging Power Grid}, year = 2013, volume = {}, number = {}, pages = {1-12}, doi = {10.1109/IREP.2013.6629363}, month = aug, comment = {See journal version (minus transients?) at~\cite{min-can-bha-vac-13-aa-voltstab}.}, abstract = {This paper presents novel methods based on Affine Arithmetic (AA) for voltage and transient stability assessment of power systems, considering uncertainties of power injections from intermittent generation sources such as wind and solar. These methods, which are an alternative to the well-known sampling and probabilistic based approaches, are able to improve the computational efficiency as compared to simple Monte Carlo (MC) simulations, with reasonably accuracy. The presented AA-based voltage stability method computes the hull of PV curves associated with the assumed uncertainties, and results are discussed in detail for a 5-bus test system. On the other hand, the proposed AA-based transient stability method solves the set of differential-algebraic equations in affine form, based on a trapezoidal integration approach, that yields the hull of the dynamic response of the system, for a set of assumed contingencies and uncertainties; this approach is demonstrated on a generator-infinite bus test system. In both presented stability studies, MC simulations are used for comparison and validation purposes.} } @article{mun-can-bha-vac-13-aa-voltstab, author = {Mu{\~n}oz, Juan and Ca{\~n}izares, Claudio and Bhattacharya, Kankar and Vaccaro, Alfredo}, title = {An Affine Arithmetic-Based Method for Voltage Stability Assessment of Power Systems With Intermittent Generation Sources}, journal = {IEEE Transactions on Power Systems}, year = 2013, volume = {28}, number = {4}, pages = {4475-4487}, doi = {10.1109/TPWRS.2013.2276424}, comment = {Application}, abstract = {This paper presents a novel method based on affine arithmetic (AA) for voltage stability assessment of power systems considering uncertainties associated with operating conditions, which may be attributed to intermittent generation sources, such as wind and solar. The proposed AA-based method reduces the computational burden as compared to Monte Carlo (MC) simulations, and also improves the accuracy as compared to some analytical approaches. The proposed method is tested using two study cases: first, a 5-bus test system is used to illustrate the proposed technique in detail, and thereafter a 2383-bus test system to demonstrate its practical application. The results are compared with those obtained using MC simulations to verify the accuracy and computational burden of the proposed AA-based method, and also with respect to a previously proposed technique to estimate parameter sensitivities in voltage stability assessment.}, altkeys = {min-can-bha-vac-13-aa-voltstab} } %%% 2012 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @article{mol-12-aa-notaa, author = {Florian M{\"o}ller}, title = {Exceptional Polynomials with 2-Transitive Affine Monodromy Groups}, journal = {Finite Fields and Their Applications}, volume = {18}, number = {2}, pages = {445-457}, year = 2012, issn = {1071-5797}, doi = {10.1016/j.ffa.2011.10.003}, comment = {Uses the term "affine arithmetic" with a completely unrelated sense to ou AA}, abstract = {In this paper all exceptional polynomials having a doubly transitive affine arithmetic monodromy group are classified. We show that these polynomials belong to well-known families of exceptional polynomials. We construct such polynomials explicitly.} } @inproceedings{hen-hai-gar-12-aa-globopt, author = {Eligius M. T. Hendrix and Rene Haijema and Inmaculada Garc{\'\i}a}, title = {On Obtaining Global Solutions of Practical Problems via Stochastic Dynamic Programming}, booktitle = {Proc. 11th Global Optimization Workshop (GOW 2012)}, pages = {77-80}, year = 2012, month = jun, url = {http://www.hpca.ual.es/~leo/gow/2012-XI-GOW.pdf%23page=85}, location = {Natal, Brazil}, Comment = {Global optimization}, abstract = {Dynamic programming (DP) is a conceptual way to look at optimization problems that can be written in a step-wise separable form. Several textbooks exist that introduce us to theory and show it can solve nonlinear programming problems obtaining global optimal solutions. On the application side, no standard way nor software exists to convert optimization problems to DP problems. This makes application for practical engineering and economic problems a challenge. We use several cases to illustrate the process of modelling, implementing and solving practical problems.} } @article{rak-uat-pre-12-aa-state, author = {Rakpenthai, Chawasak and Uatrongjit, Sermsak and Premrudeepreechacharn, Suttichai}, title = {State Estimation of Power System Considering Network Parameter Uncertainty Based on Parametric Interval Linear Systems}, journal = {IEEE Transactions on Power Systems}, year = 2012, volume = {27}, number = {1}, pages = {305-313}, doi = {10.1109/TPWRS.2011.2162859}, ISSN = {1558-0679}, month = feb, comment = {Power grid analysis}, abstract = {This paper addresses the state estimation of a power system whose network parameters are known to be within certain tolerance bounds. The power system is assumed to be fully observable by having enough phasor measurement units installed. Using synchronized phasor measurement data and state variables expressed in rectangular forms, the state estimation under the transmission line parameter uncertainties is formulated based on the weight least square criterion as a parametric interval linear system of equations. The solutions are obtained as interval numbers representing the outer bound of state variables. The proposed method is also extended to a power system with mixed phasor and conventional power measurements. A technique based on affine arithmetic for converting state variable into polar form is also presented. The proposed method has been implemented using MATLAB and INTLAB toolbox and applied to some IEEE test systems. The numerical experiment results indicate that, in shorter computation time, the proposed algorithm can find the outer bounds that are close to those computed by performing Monte Carlo simulations or by solving constrained nonlinear optimization problems.} } @article{ska-13-aa-bestmul, title = {Algorithm for min-range multiplication of affine forms}, author = {Iwona Skalna}, journal = {Numerical Algorithms}, volume = {63}, pages = {601--614}, year = 2013, doi = {10.1007/s11075-012-9644-0}, comment = {Uses min-range instead of Chebyshev?}, altkeys = {ska-12-aa-bestmul}, abstract = {Affine arithmetic produces guaranteed enclosures for computed quantities, taking into account any uncertainties in the input data as well as round-off errors. Elementary operations on affine forms are redefined so they result in affine forms. Affine-linear operations result straightforwardly in affine forms. Non-linear operators, such as multiplication, must be approximated by affine forms. Choosing the appropriate approximation is a big challenge. The reason is that different approximations may be more accurate for specific purposes. This paper presents an efficient method for computing the minimum range (min-range) affine approximation of the product of arbitrary affine forms that do not contain zero properly. Numerical experiments are carried out to demonstrate the essential features of the proposed approach, especially its usefulness for bounding ranges of functions for global optimisation and for finding roots of functions.} } @inproceedings{ska-12-aa-linsys, author = {Skalna, Iwona}, title = {Enclosure for the Solution Set of Parametric Linear Systems with Non-affine Dependencies}, booktitle = {Proc. International Conference on Parallel Processing and Applied Mathematics (PPAM 2011)}, year = 2012, publisher = {Springer}, pages = {513--522}, isbn = {978-3-642-31500-8}, commnt = {Solving linear systems with revised AA}, abstract = {The problem of solving linear systems whose coefficients are nonlinear functions of parameters varying within prescribed intervals is investigated. A new method for outer interval solution of such system is proposed. In order to reduce memory usage, nonlinear dependencies between parameters are handled using revised affine arithmetic. Some numerical experiments which aim to show the properties of the proposed method are reported.} } @article{gou-gal-put-12-aa-zonjoin, author = {Eric Goubault and Tristan {Le Gall} and Sylvie Putot}, title = {An Accurate Join for Zonotopes, Preserving Affine Input/Output Relations}, journal = {Electronic Notes in Theoretical Computer Science}, note = {Proceedings of the Fourth International Workshop on Numerical and Symbolic Abstract Domains, NSAD 2012}, volume = {287}, pages = {65-76}, year = 2012, issn = {1571-0661}, doi = {10.1016/j.entcs.2012.09.007}, url = {https://www.sciencedirect.com/science/article/pii/S157106611200059X}, comment = {Important - join of affine domains}, abstract = {Zonotopes are a convenient abstract domain for the precise analysis of programs with numerical variables. Compared to the domain of convex polyhedra, it is less expensive and may easily handle non-linear assignments. However, the classical join operator of this abstract domain does not always preserve linear invariants, unlike the convex hull. We present a global join operator that preserves some affine relations. We end up by showing some experiments conducted on the constrained Taylor1+ domain of Apron.} } @inproceedings{iha-kan-12-aa-allsol, author = {Kosuke Ihara and Yuchi Kanzawa}, title = {All Solution Algorithm for Parameter-Dependent Nonlinear Equations Using Affine Arithmetic}, booktitle = {Proceedings of the 2012 International Symposium on Nonlinear Theory and its Applications}, year = 2012, pages = {419-422}, issn = {2188-5079}, doi = {10.15248/proc.1.419}, url = {https://www.ieice.org/publications/proceedings/bin/pdf_link.php?fname=419.pdf&iconf=NOLTA&year=2012&vol=1&number=419&lang=E}, abstract = {A new all solution algorithm is proposed for parameter-dependent nonlinear equations. In this algorithm, affine arithmetic[1], which is more accurate than interval arithmetic[2], is used for an existence test and two non-existence tests of a solution. The efficiency of the proposed algorithm is verified by some numerical examples.} } @inproceedings{mia-12-aa-varilog, author = {Mial{\k{t}}u, R{\v{a}}zvan-C{\v{a}}t{\v{a}}lin}, title = {A {SystemVerilog} Approach in System Validation with Affine Arithmetic}, booktitle = {International Semiconductor Conference (CAS 2012)}, year = 2012, volume = {2}, number = {}, pages = {407-410}, doi = {10.1109/SMICND.2012.6400746}, issn = {2377-0678}, month = oct, comment = {Combines AA with the SystemVarilog language}, abstract = {This paper introduces an original approach to system modeling for performance analysis and optimization. The method presented herein theoretical background is the mathematical field of affine arithmetic chosen for its intrinsic data representation optimal to analysis of the mitigation of variations and refinement of deviations and error analysis. The chosen language of SystemVerilog is beneficial for it is allowing the integration of the validation process and of the verification process for the specific class of mixed signal electrical circuits and systems.} } @inproceedings{kra-olb-bar-12-aa-neural, author = {Krause, Anna and Olbrich, Markus and Barke, Erich}, booktitle = {2012 International Conference on Synthesis, Modeling, Analysis and Simulation Methods and Applications to Circuit Design (SMACD)}, title = {Enclosing the Modeling Error in Analog Behavioral Models Using Neural Networks and Affine Arithmetic}, year = 2012, volume = {}, number = {}, pages = {5-8}, keywords = {}, doi = {10.1109/SMACD.2012.6339403}, month = sep, comment = {Combining AA and neural networks (!)}, abstract = {One all-time challenge in behavioral modeling is to minimize the modeling error while still profiting from a simplified representation of an analog circuit. In many cases the modeling error is known, but up to now it was only an indicator for the quality of the model. Its influence on errors during simulation could not be evaluated. We present a flow for the generation of behavioral models based on neural networks which uses affine arithmetic to guarantee enclosing the modeling error. We also demonstrate that the approach can also be applied to modeling the effects of parameter deviations.} } @inproceedings{rad-sch-rat-gri-12-aa-assert, author = {Radojicic, Carna and Schupfer, Florian and Rathmair, Michael and Grimm, Christoph}, title = {Assertion-Based Verification of Signal Processing Systems with Affine Arithmetic}, booktitle = {Proceeding of the 2012 Forum on Specification and Design Languages}, year = 2012, volume = {}, number = {}, location = {Vienna, Austria}, pages = {20-26}, keywords = {}, issn = {1636-9874}, month = sep, comment = {Validating signal processing circuits with AA assertions}, abstract = {This paper describes a novel method to verify typical properties of systems with parameter deviations. These parameter deviations have an impact on a system behavior causing it to deviate from its ideal behavior. The concept of Affine Arithmetic is used to model typical errors and uncertainties in today's analog-mixed signal systems. The method which is proposed is a combination of assertions and Affine Arithmetic where Affine Arithmetic is also used to model typical properties of signal processing specifications. The target of the proposed method is to speed up the detection of errors in system behavior, which cause the violation of system properties. The applicability of the proposed method is demonstrated through two small examples.} } @inproceedings{rat-sch-rad-gri-12-aa-simul, author = {Rathmair, Michael and Schupfer, Florian and Radojicic, Carna and Grimm, Christoph}, title = {Extended Framework for System Simulation with Affine Arithmetic}, booktitle = {Proceeding of the 2012 Forum on Specification and Design Languages}, year = 2012, volume = {}, number = {}, pages = {168-175}, issn = {1636-9874}, month = sep, comment = {System simulation. Term reduction?}, abstract = {This paper describes a calculation framework for the simulation of systems being affected by parameter deviations. These unpredictable factors are described with the help of affine arithmetic noise symbols in the modeling domain. Methods for a semi-symbolic output signal calculation containing linear and nonlinear operators must be provided. For a nonlinear composition of two affine arithmetic forms an appropriate approximation algorithm is required. This can be implemented and selected dependent on the objective of the simulation. Additional functionalities for debugging and tracing of noise symbols can improve analysis properties of simulation results. In the following work an extended framework structure for affine arithmetic system simulations containing an application specific selection of necessary approximated forms and advanced noise symbol management methods is introduced.} } @misc{kas-12-aa-reduce, title = {An Algorithm to Reduce the Number of Dummy Variables in Affine Arithmetic}, author = {Masahide Kashiwagi}, url = {http://conf.nsc.ru/files/conferences/scan2012/139995/Kashiwagi-scan2012.pdf}, howpublished = {Slides presented on 2012-09-28 at SCAN'2012, Nobosibirsk, Russia. Available online}, year = 2012, month = sep, comment = {No abstract but seems to describe the algorithm.} } @inproceedings{pir-can-bha-vac-12-aa-powflow, author = {Pirnia, Mehrdad and Ca{\~n}izares, Claudio A. and Bhattacharya, Kankar and Vaccaro, Alfredo}, title = {An Affine Arithmetic Method to Solve the Stochastic Power Flow Problem Based on a Mixed Complementarity Formulation}, booktitle = {2012 IEEE Power and Energy Society General Meeting}, year = 2012, volume = {}, number = {}, pages = {1-7}, doi = {10.1109/PESGM.2012.6345100}, abstract = {An affine-based stochastic power flow problem is proposed in this paper. First, a novel optimization-based model of the power flow problem using complementarity conditions to properly represent generator bus voltage controls, including reactive power limits and voltage recovery is presented. This model is then used to solve the stochastic power flow problem to obtain operational intervals for power flow variables based on an Affine Arithmetic (AA) method to consider active and reactive power demand uncertainties. The proposed AA algorithm is tested on a 14-bus test system and the results are then compared with the Monte-Carlo Simulation (MCS) results. The AA method shows slightly more conservative bounds; however, it is faster and does not need any information regarding statistical distributions of random variables.} } @article{kie-12-aa-yalaa, author = {Stefan Kiel}, title = {YalAA: Yet Another Library for Affine Arithmetic}, journal = {Reliable Computing}, volume = {16}, pages = {114--129}, year = 2012, url = {http://interval.louisiana.edu/reliable-computing-journal/volume-16/reliable-computing-16-pp-114-129.pdf}, biburl = {https://dblp.org/rec/journals/rc/Kiel12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org}, abstract = {In this paper, we present YalAA, a new library for affine arithmetic. Recently, affine arithmetic has been given increased attention even from outside the traditional verified computing community, for example, in the areas of circuit design, GPU based rendering of implicit objects and global optimization. Furthermore, several improvements to the original affine model were proposed. However, a fully verified, object-oriented implementation supporting at least some of the extensions is currently not available. The goal of YalAA is to provide a wide range of elementary functions and to allow the user to incorporate improvements for the original affine model easily. In contrast to other available libraries, YalAA also provides verified implementations of non-convex or non-concave elementary functions. Our library has a policy based design. That is, the user can alter different aspects in the library's behavior to reflect variations of the original model while relying on the same code base. Because affine arithmetic is often used in combination with interval arithmetic, we followed the principles of the upcoming P1788 interval standard during the design process. Therefore, YalAA can be integrated seamlessly into an existing interval arithmetic environment.} } @article{bou-gou-gou-put-12-aa-pboxes, author = {Bouissou, O. and Goubault, E. and Goubault-Larrecq, J. and Putot, Sylvie}, title = {A Generalization of {p-Boxes} to Affine Arithmetic}, journal = {Computing}, volume = {94}, pages = {189--201}, year = 2012, doi = {10.1007/s00607-011-0182-8}, comment = {Combining AA with p-boxes}, abstract = {We often need to deal with information that contains both interval and probabilistic uncertainties. P-boxes and Dempster--Shafer structures are models that unify both kind of information, but they suffer from the main defect of intervals, the wrapping effect. We present here a new arithmetic that mixes, in a guaranteed manner, interval uncertainty with probabilities, while using some information about variable dependencies, hence limiting the loss from not accounting for correlations. This increases the precision of the result and decreases the computation time compared to standard p-box arithmetic.} } @misc{fig-12-oktobermat, author = {Luiz Henrique de Figueiredo}, title = {Images of {Julia} Sets that You Can Trust}, year = 2012, month = oct, url = {http://www.tecgraf.puc-rio.br/~lhf/ftp/doc/oral/balzan.pdf}, howpublished = {Slides of presentation at Oktobermat, IMPA.} } @misc{fig-12-palis, author = {Luiz Henrique de Figueiredo}, title = {Images of Julia sets that you can trust}, year = 2012, month = jun, url = {http://www.tecgraf.puc-rio.br/~lhf/ftp/doc/oral/balzan.pdf}, note = {Slides of presentation at the 1st Palis-Balzan Symposium on Dynamical Systems, IMPA.} } %%% 2011 %%%%%%%%%%%%%%%%%%% @inproceedings{pan-rad-11-aa-satrang, author = {Pang, Yu and Radecka, Katarzyna}, title = {An Efficient Algorithm of Performing Range Analysis for Fixed-Point Arithmetic Circuits Based on {SAT} Checking}, booktitle = {Proc. IEEE International Symposium of Circuits and Systems (ISCAS 2011)}, year = 2011, volume = {}, number = {}, pages = {1736-1739}, doi = {10.1109/ISCAS.2011.5937918}, issn = {2158-1525}, month = may, abstract = {Allocating bit-widths is a necessary step in high-level synthesis. The main disadvantages of past methods, such as dynamic analysis or affine arithmetic, lie in low efficiency and coarse results which may lead to huge execution time and unnecessary additional bits for representation. In this paper, an algorithm is based on static analysis is proposed to perform range analysis and allocate integer bit-widths for an arithmetic datapath. The efficient algorithm can calculate the error bound between the exact range and the obtained range.} } @inproceedings{gan-fig-11-aa-beamtrac, author = {Ganacim, Francisco and Figueiredo, Luiz Henrique and Nehab, Diego}, title = {Beam Casting Implicit Surfaces on the {GPU} with Interval Arithmetic}, booktitle = {Proc. 24th Conference on Graphics, Patterns and Images (SIBGRAPI 2011)}, year = 2011, volume = {}, number = {}, pages = {72-77}, doi = {10.1109/SIBGRAPI.2011.5}, ISSN = {2377-5416}, month = aug, comment = {Uses IA only. Should try it with AA.}, abstract = {We present a GPU-based beam-casting method for rendering implicit surfaces in real time with antialiasing. We use interval arithmetic to model the beams and to detect their intersections with the surface. We show how beams can be used to quickly discard large empty regions in the image, thus leading to a fast adaptive subdivision method.} } @misc{nin-10-aa-relax-fr, author = {Ninin, Jordan}, title = {Optimisation Globale Bas{\'e}e sur l'Analyse d'Intervalles: {Relaxation} Affine et Limitation de la M{\'e}moire}, year = 2010, month = {12}, url = {https://www.researchgate.net/publication/50876701_Optimisation_Globale_basee_sur_l'Analyse_d'Intervalles_Relaxation_Affine_et_Limitation_de_la_Memoire}, howpublished = {Online document}, altkeys = {nin-11-aa-relax-fr}, comment = {Global optimization based on AA. Maybe just translation of ~\cite{nin-10-aa-relax}}, abstract = {Depuis une vingtaine d'années, la résolution de problèmes d'optimisation globale non convexes avec contraintes a connu un formidable essor. Les algorithmes de branch and bound basée sur l'analyse d'intervalles ont su trouver leur place, car ils ont l'avantage de prouver l'optimalité de la solution de façon déterministe, avec un niveau de certitude pouvant aller jusqu'à la précision machine. Cependant, la complexité exponentielle en temps et en mémoire de ces algorithmes induit une limite intrinsèque, c'est pourquoi il est toujours nécessaire d'améliorer les techniques actuelles. - Dans cette thèse, nous avons développé de nouvelles arithmétiques basées sur l'arithmétique d'intervalles et l'arithmétique affine, afin de calculer des minorants et des majorants de meilleure qualité de fonctions explicites sur un intervalle. - Nous avons ensuite développé une nouvelle méthode automatique de construction de relaxations linéaires. Cette construction est basée sur l'arithmétique affine et procède par surcharge des opérateurs. Les programmes linéaires ainsi générés ont exactement le même nombre de variables et de contraintes d'inégalité que les problèmes originaux, les contraintes d'égalité étant remplacées par deux inégalités. Cette nouvelle procédure permet de calculer des minorants fiables et des certificats d'infaisabilité pour chaque sous-domaine à chaque itération de notre algorithme de branch and bound par intervalles. De nombreux tests numériques issus du site COCONUT viennent confirmer l'efficacité de cette approche. - Un autre aspect de cette thèse a été l'étude d'une extension de ce type d'algorithmes en introduisant une limite sur mémoire disponible. L'idée principale de cette approche est de proposer un processus inverse de l'optimisation par le biais d'un principe métaheuristique: plutôt que d'améliorer des solutions locales à l'aide de métaheuristiques telles que les algorithmes Taboo ou VNS, nous partons d'une méthode exacte et nous la modifions en une heuristique. De cette façon, la qualité de la solution trouvée peut être évaluée. Une étude de la complexité de ce principe métaheuristique a également été effectuée. - Enfin, pour finir l'étude, nous avons appliqué notre algorithme à la résolution de problème en géométrie plane, ainsi qu'à la résolution d'un problème de dimensionnement de moteur électrique. Les résultats obtenus ont permis de confirmer l'intérêt de ce type d'algorithme, en résolvant des problèmes ouverts sur les polygones convexes et proposant des structures innovantes en génie électrique.} } @misc{nin-mes-11-aa-mixglob, author = {Jordan Ninin and Fr{\'e}d{\'e}ric Messine}, title = {A Mixed Integer Affine Reformulation Technique for Deterministic Global Optimization}, url = {https://www.researchgate.net/publication/228573281_A_Mixed_Integer_Affine_Reformulation_Technique_for_Deterministic_Global_Optimization}, howpublished = {Online document}, year = 2011, month = mar, altkeys = {nin-mes-12-aa-mixglob}, comment = {See also~\cite{nin-mes-10-aa-globopt}. Date inferred from PDF metadata.}, abstract = {Since few years, the methods to solve mixed integer non-linear programming (MINLP) problems has made some breakthroughs. It is now possible to consider very difficult and large problems. One of these improvements is the growing use of relaxation techniques. The most famous one is the convex relaxation based on the symbolic reformulation introduced by Smith and Pantelides [5]. This reformulation is performed by introducing a new variable for every non-convex operators. Our approach is different. The method is based on a relaxation technique using the affine arithme-tic, which does not introduce new variable [4]. We will present an extension of this new technique to consider integer variables to reformulate a MINLP problem into a mixed integer linear program (MILP) which keeps the same size as the original one. This relaxation is used in Branch and Bound algorithm based on interval analysis to compute lower bound and eliminate sub-domains which do not contain the global minimum.} } @article{lic-che-yix-tao-11-aa-reliab, author = {Li, Chun-yang and Chen, Xun and Yi, Xiao-shan and Tao, Jun-yong}, title = {Interval-Valued Reliability Analysis of Multi-State Systems}, journal = {IEEE Transactions on Reliability}, year = 2011, volume = {60}, number = {1}, pages = {323-330}, keywords = {}, doi = {10.1109/TR.2010.2103670}, issn = {1558-1721}, month = mar, abstract = {In previous studies that analyzed the reliability of multi-state systems, the precise values of the state performance levels and state probabilities of multi-state components were required. In many cases, however, there are insufficient data to obtain the state probabilities of components precisely. A method is proposed in this paper to analyze the reliability of multi-state systems when the available data of components are insufficient. Based on the Bayesian approach and the imprecise Dirichlet model, the interval-valued state probabilities of components are obtained instead of precise values. The interval universal generating function is developed, and the corresponding operators are defined to estimate the interval-valued reliability of multi-state systems. Affine arithmetic is used to improve the interval-valued reliability. A numerical example illustrates the proposed method. The results show that the proposed method is efficient when state performance levels and/or state probabilities of components are uncertain and/or imprecise.} } @inproceedings{hua-lac-rob-11-aa-imprec, author = {Jiawei Huang and John Lach and Gabriel Robins}, title = {Analytic Error Modeling for Imprecise Arithmetic Circuits}, booktitle = {Proc. 7th IEEE Workshop on Silicon Errors in Logic - System Effects (SELSE 2011)}, year = 2011, month = mar, location = {Urbana-Champaigh, IL, USA}, note = {Proceedings not available.}, url = {https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.298.381&rep=rep1&type=pdf}, abstract = {Imprecise hardware challenges the traditional notion that correctness is an immutable priority, by systematically trading off efficacy (precision) against efficiency (power, area, performance, and cost). Evaluating the impact of such tradeoffs on output quality using, e.g., Monte Carlo simulations is a time-consuming and non-deterministic process. This paper presents two analytic modeling techniques for evaluating error properties and output quality in imprecise arithmetic circuits, based on Interval Arithmetic and Affine Arithmetic. Experiments show that these techniques offer significant speedups over previous methods, as well as promising estimation accuracy} } @inproceedings{huy-muc-11-aa-dotpr, author = {Huynh, Thang Viet and Mücke, Manfred}, booktitle = {The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)}, title = {Error Analysis and Precision Estimation for Floating-Point Dot-Products Using Affine Arithmetic}, year = 2011, volume = {}, number = {}, pages = {319-322}, keywords = {}, doi = {10.1109/ATC.2011.6027495}, issn = {2162-1039}, month = aug, comment = {Precision of hardware dot product implementations using AA}, abstract = {One challenging task for VLSI and reconfigurable system design is the identification of the smallest number format possible to implement a given numerical algorithm guaranteeing some final accuracy while minimising area used, execution time and power. We apply affine arithmetic, an extension to interval arithmetic, to estimate the rounding error of different floating-point dot-product variants. The validity of the estimated error bounds is demonstrated using extensive simulations. We derive the analytical models for rounding errors over a wide range of parameters and show that affine arithmetic with a probabilistic bounding operator is able to provide a tighter bound compared to conventional forward error analysis. Due to the tight bounds, minimum mantissa bit width for hardware implementation can be determined and comparison of different dot-product variants is possible. Our presented models allow for an efficient design space exploration and are key to specialised code generators.}, } @inbook{pen-loo-vas-11-aa-symbreg, author = {Pennachin, Cassio and Looks, Moshe and de Vasconcelos, J. A.}, title = {Improved Time Series Prediction and Symbolic Regression with Affine Arithmetic}, bookTitle = {Genetic Programming Theory and Practice IX}, year = 2011, publisher = {Springer}, pages = {97--112}, isbn = {978-1-4614-1770-5}, doi = {10.1007/978-1-4614-1770-5_6}, comment = {Symbolic regression? Time series prediction}, abstract = {We show how affine arithmetic can be used to improve both the performance and the robustness of genetic programming for problems such as symbolic regression and time series prediction. Affine arithmetic is used to estimate conservative bounds on the output range of expressions during evolution, which allows us to discard trees with potentially infinite bounds, as well as those whose output range lies outside the desired range implied by the training dataset. Benchmark experiments are performed on 15 symbolic regression problems as well as 2 wellknown time series problems. Comparison with a baseline genetic programming system shows a reduced number of fitness evaluations during training and improved generalization on test data, completely eliminating extreme errors. We also apply this technique to the problem of forecasting wind speed on a real world dataset, and the use of affine arithmetic compares favorably with baseline genetic programming, feedforward neural networks and support vector machines.} } @article{goe-gol-des-vel-11-curv-net, author = {Fernando de Goes and Siome Goldenstein and Mathieu Desbrun and Luiz Velho}, title = {Curve Network Abstraction for {3D} Shapes}, journal = {Computers {\&} Graphics - UK}, year = 2011, volume = {35}, number = {1}, pages = {112-121} } %%% 2010 %%%%%%%%%%%%%%%%%%% @misc{nin-10-aa-relax, author = {Ninin, Jordan}, title = {Global Optimization based on Interval Analysis: Affine Relaxation and Limited Memory}, howpublished = {Aonline document}, url = {https://www.researchgate.net/publication/281183572_Global_Optimization_based_on_Interval_Analysis_Affine_Relaxation_and_Limited_Memory}, year = 2010, month = dec, abstract = {Since about thirty years, interval Branch and Bound algorithms are increasingly used to solve constrained global optimization problems in a deterministic way. Such algorithms are reliable, i.e., they provide an optimal solution and its value with guaranteed bounds on the error, or a proof that the problem under study is infeasible. Other approaches to global optimization, while useful and often less time-consuming than interval methods, do not provide such a guarantee. However, the exponential complexity in time and memory of interval Branch and Bound algorithms implies a limitation, so it is always necessary to improve these methods. - In this thesis, we have developed new arithmetics based on interval arithmetic and affine arithmetic, to compute better lower and upper bounds of a factorable function over an interval. - An automatic method for constructing linear relaxations of constrained global optimization problems is proposed. Such a construction is based on affine and interval arithmetics and uses operator overloading. These linear programs have exactly the same numbers of variables and of inequality constraints as the given problems. Each equality constraint is replaced by two inequalities. This new procedure for computing reliable bounds and certificates of infeasibility is inserted into a classical interval Branch and Bound algorithm. Extensive computation experiments, made on a sample of test problems from the COCONUT database, prove its effectiveness. - Another aspect is the study of an extension of such a global optimization code by limiting the available memory. The main idea of this new kind of metaheuristique is to propose a reverse process of optimization via heuristics: rather than improving local solutions by using metaheuristics such as Taboo or VNS, we begin with an exact method and we modify it into a heuristic one. In such a way, the quality of the solution could be evaluated. Moreover, a study of the complexity of this metaheurisque has been done. - Finally, we applied our algorithm to solve open problem in geometry, and to solve a design problem of an electric motor. The results have confirmed the usefulness of this kind of algorithms, solving open problems on convex polygons and offering innovative structures in electrical engineering.} } @inproceedings{nin-mes-10-aa-globopt, author = {Jordan Ninin and Frédéric Messine}, title = {A Mixed Affine Reformulation Method for Global Optimization}, booktitle = {Proc. Tolouse Global Optimzation Workshop (TOGO 2010)}, year = 2010, pages = {101 -- 104}, url = {http://www.lix.polytechnique.fr/togo10/TOGO10-proceedings.pdf}, comment = {Extension of AA to global optimization of mixed integer problems}, abstract = {An automatic method for constructing mixed integer linear relaxations of mixed integer non-convex optimization problems is proposed. This method is an extension of the affine reformulation technique [4] in order to consider mixed integer problems. The so-generated mixed integer linear program has exactly the same number of variables and of inequality constraints as the given problems. Thus, the resolution wastes less time. This technique is including in an interval branch and bound algorithm to improve the computation of lower bounds.} } @inproceedings{ska-10-aa-paramint, author = {Skalna, Iwona}, title = {Direct Method for Solving Parametric Interval Linear Systems with Non-affine Dependencies}, booktitle = {Parallel Processing and Applied Mathematics}, year = 2010, publisher = {Springer}, pages = {485--494}, isbn = {978-3-642-14403-5}, comment = {Solving linear systems with interval coefficients}, abstract = {Many real-life problems can be modelled by systems of linear equations or safely transformed to the linear case. When uncertain model parameters are introduced by intervals, then a parametric interval linear system must properly be solved to meet all possible scenarios and yield useful results. In general case, system coefficients are nonlinear functions of parameters. The Direct Method for solving such systems is proposed. Affine arithmetic is used to handle nonlinear dependencies. Some illustrative examples are solved and the results are compared to the literature data produced by other methods.} } @inproceedings{gor-gou-put-10-aa-zonint, author = {Ghorbal, Khalil and Goubault, Eric and Putot, Sylvie}, title = {A Logical Product Approach to Zonotope Intersection}, booktitle = {Proceedings of the 22nd International Conference on Computer Aided Verification (CAV 2010)}, year = 2010, isbn = {364214294X}, url = {https://doi.org/10.1007/978-3-642-14295-6_22}, doi = {10.1007/978-3-642-14295-6_22}, pages = {212--226}, numpages = {15}, location = {Edinburgh, UK}, comment = {Important: affine domain intersection}, abstract = {We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, octagon, linear template or polyhedron domains While abstract transfer functions are still rather inexpensive and accurate even for interpreting non-linear computations, we are able to also interpret tests (i.e intersections) efficiently This fixes a known drawback of zonotopic methods, as used for reachability analysis for hybrid systems as well as for invariant generation in abstract interpretation: intersection of zonotopes are not always zonotopes, and there is not even a best zonotopic over-approximation of the intersection We describe some examples and an implementation of our method in the APRON library, and discuss some further interesting combinations of zonotopes with non-linear or non-convex domains such as quadratic templates and maxplus polyhedra.} } @inproceedings{tha-pos-ham-10-aa-symdemo, author = {Thanigaivelan, Balavelan and Postula, Adam and Hamilton, Tara Julia}, title = {Live Demo: {Affine} Arithmetic Concept Based Symbolic Circuit Analyser}, booktitle = {Proceedings of 2010 IEEE International Symposium on Circuits and Systems}, year = 2010, volume = {}, number = {}, pages = {2776-2776}, doi = {10.1109/ISCAS.2010.5537017}, issn = {2158-1525}, month = may, comment = {Live demo}, abstract = {We implemented a Symbolic Circuit Analysis Software toolbox based on Affine Arithmetic. The toolbox is defined with small signal Affine MOSFET models along with conventional MOSFET models. As a case study the demonstration compares the use of affine models with conventional models in various circuit architectures. The symbolic analysis results are also compared with SPICE analysis results. This demonstration is associated with CAD and other tools for Analog Design track (Track 1.12).} } @article{zhu-che-son-lin-10-aa-truss, author = {Zhu, Zeng-qing and Chen, Jian-jun and Song, Zong-feng and Lin, Li-guang}, title = {Non-Probabilistic Reliability Index of Bar Structures with Interval Parameters Based on Modified Affine Arithmetic}, journal = {Engineering Mechanics}, volume = {27}, number = {2}, pages = {49-53}, year = 2010, issn = {1000-4750}, url = {http://engineeringmechanics.cn/en/article/id/909}, comment = {Application to reliability of mechanical truss structures. See also~\cite{liu-che-zhu-10-aa-truss}}, abstract = {Uncertain parameters are described as interval numbers, then, the reliability index equations of bar structures are obtained. A modified matrix affine arithmetic polynomial evaluation method, together with recursive derivative information, is proposed in this paper. Recognizing that affine forms and intervals variables can transform each other, affine forms of bounded uncertain variables and modified affine arithmetic including derivative information for univariate interval polynomial evaluation are introduced into the modeling and calculating of non-probabilistic reliability index. A hanger beam and a ten-bar truss structure are analyzed to illustrate the validity and feasibility of the presented procedures.} } @inproceedings{liu-che-zhu-10-aa-truss, author = {Liu, G.L. and Chen, J.J. and Zhu, Zeng Qing}, title = {Reliability Analysis of Interval Parameters Bar Structures with Affine Arithmetic}, booktitle = {Proc. Materials and Product Technologies II}, year = 2010, month = {6}, volume = {118}, pages = {201--205}, series = {Advanced Materials Research}, publisher = {Trans Tech}, doi = {10.4028/www.scientific.net/AMR.118-120.201}, comment = {Application to reliability of mechanical truss structures}, abstract = {By representing the uncertain parameters as interval numbers, the reliability index equations of bars structures were obtained. A modified matrix affine arithmetic polynomial evaluation method plus recursive derivative information was proposed in this paper, which keeps all powers of noise symbols without approximation. Based on the nature that affine forms and intervals variables could transform each other, affine forms of bounded uncertain variables and modified affine arithmetic including derivative information for interval univariate polynomial evaluation were introduced into modeling and calculating non-probabilistic reliability index. An extended beam example and a ten-bar truss structure example were provided to illustrate the validity and feasibility of the presented procedures.} } @inproceedings{fry-pas-com-10-aa-raytr, author = {Oleg Fryazinov and Alexander Pasko and Peter Comninos}, title = {Extending Revised Affine Arithmetic for Fast Reliable Ray-Tracing of Procedurally Defined Implicit Surfaces}, booktitle = {Proc. International Conference on Computer Graphics Theory and Applications}, pages = {199-207}, year = 2010, doi = {10.5220/0002847501990207}, comment = {Extended revised AA? Simplifications for GPU}, abstract = {Fast and reliable rendering of implicit surfaces is an important research area in the field of implicit modelling. Direct rendering, namely ray-tracing, is shown to be a suitable technique for obtaining good-quality visualisations of implicit surfaces. We present a technique for reliable ray-tracing of arbitrary procedurally defined implicit surfaces by using a modification of Affine Arithmetic called Revised Affine Arithmetic. A wide range of procedurally defined implicit objects can be rendered using this technique including polynomial surfaces, constructive solids, pseudo-random objects, procedurally defined microstructures, and others. We compare our technique with other reliable techniques based on Interval and Affine Arithmetic to show that our technique provides the fastest, while still reliable, ray-surface intersections and ray-tracing. We also suggest possible modifications for the GPU implementation of this technique for real-time rendering of relatively simple implicit models and for near real-time rendering of complex implicit models.} } @misc{bou-gou-gou-put-10-aa-pbox-slid, author = {O. Bouissou and E. Goubault and J. Goubault-Larrecq and S. Putot}, title = {A Generalization of {P}-boxes to Affine Arithmetic, and Applications to Static Analysis of Programs}, url = {http://scan2010.ens-lyon.fr/SCAN2010_Bouissou_Goubault_Goubault-Larrecq_Putot.pdf}, howpublished = {Slides of presentation at SCAN 2010, Lyon.}, year = 2010 } @article{fry-pas-com-10-aa-procsurf, author = {Oleg Fryazinov and Alexander Pasko and Peter Comninos}, title = {Fast Reliable Interrogation of Procedurally Defined Implicit Surfaces using Extended Revised Affine Arithmetic}, journal = {Computers {\&} Graphics}, volume = {34}, number = {6}, pages = {708-718}, year = 2010, note = {Graphics for Serious Games Computer Graphics in Spain: a Selection of Papers from CEIG 2009 Selected Papers from the SIGGRAPH Asia Education Program}, issn = {0097-8493}, doi = {10.1016/j.cag.2010.07.003}, comment = {Implicit surface plotting. Extended Revised AA?}, abstract = {Techniques based on interval and affine arithmetic and their modifications are shown to provide reliable function range evaluation for the purposes of surface interrogation. In this paper we present a technique for the reliable interrogation of implicit surfaces using a modification of affine arithmetic called revised affine arithmetic. We extend the range of functions presented in revised affine arithmetic by introducing affine operations for arbitrary functions such as set-theoretic operations with R-functions, blending and conditional operators. The obtained affine forms of arbitrary functions provide faster and tighter function range evaluation. Several case studies for operations using affine forms are presented. The proposed techniques for surface interrogation are tested using ray-surface intersection for ray-tracing and spatial cell enumeration for polygonisation. These applications with our extensions provide fast and reliable rendering of a wide range of arbitrary procedurally defined implicit surfaces (including polynomial surfaces, constructive solids, pseudo-random objects, procedurally defined microstructures, and others). We compare the function range evaluation technique based on extended revised affine arithmetic with other reliable techniques based on interval and affine arithmetic to show that our technique provides the fastest and tightest function range evaluation for fast and reliable interrogation of procedurally defined implicit surfaces.} } @article{zha-zha-zho-10-aa-accur, author = {Zhang, L. and Zhang, Y. and Zhou, W.}, title = {Tradeoff between Approximation Accuracy and Complexity for Range Analysis using Affine Arithmetic}, journal = {Journal of Signal Processing Systems}, volume = {61}, pages = {279--291}, year = 2010, doi = {10.1007/s11265-010-0452-2}, comment = {Faster AA with more relaxed approximation than Chebyshev}, abstract = {Digital signal processing algorithms are usually developed in floating-point arithmetic. After that floating-point to fixed-point transformation is performed to implement them on fixed-point devices, for higher speed, smaller area and lower power. During this transformation, range analysis is to find the minimum integer bit-widths for signals to prevent overflow. Existing state-of-the-art analytical methods for range analysis are generally based on Affine Arithmetic, which presents two approximation methods for non-affine operations. The Chebyshev approximation provides the best approximation with prohibitive computation expense. The trivial range estimation, which is very efficient for computation, over-estimates the range four times at the worst case. This paper presents a novel approach to let user decide tradeoff between approximation accuracy and complexity of Affine Arithmetic. Case studies and experiments are carried out to demonstrate its efficiency.} } @inproceedings{pen-loo-vas-10-aa-symbreg, author = {Pennachin, Cassio L. and Looks, Moshe and de Vasconcelos, Jo{\~a}o A.}, title = {Robust Symbolic Regression with Affine Arithmetic}, booktitle = {Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO '10)}, location = {Portland, Oregon, USA}, year = 2010, pages = {917--924}, numpages = {8}, isbn = {9781450300728}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, doi = {10.1145/1830483.1830648}, abstract = {We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze expressions generated by the genetic operators, estimating their output range given the ranges of their inputs over the training data. These estimated output ranges allow us to discard trees that contain asymptotes as well as those whose output is too far from the desired output range determined by the training instances. We also perform linear scaling of outputs before fitness evaluation. Experiments are performed on 15 problems, comparing the proposed system with a baseline genetic programming system with protected operators, and with a similar system based on interval arithmetic. Results show that integrating affine arithmetic with an implementation of standard genetic programming reduces the number of fitness evaluations during training and improves generalization performance, minimizes overfitting, and completely avoids extreme errors of unseen test data.} } @article{vac-can-vil-10-aa-power, author = {Vaccaro, Alfredo and Canizares, Claudio A. and Villacci, Domenico}, title = {An Affine Arithmetic-Based Methodology for Reliable Power Flow Analysis in the Presence of Data Uncertainty}, journal = {IEEE Transactions on Power Systems}, year = 2010, volume = {25}, number = {2}, pages= {624-632}, doi = {10.1109/TPWRS.2009.2032774}, abstract = {Power flow studies are typically used to determine the steady state or operating conditions of power systems for specified sets of load and generation values, and is one of the most intensely used tools in power engineering. When the input conditions are uncertain, numerous scenarios need to be analyzed to cover the required range of uncertainty. Under such conditions, reliable solution algorithms that incorporate the effect of data uncertainty into the power flow analysis are required. To address this problem, this paper proposes a new solution methodology based on the use of affine arithmetic, which is an enhanced model for self-validated numerical analysis in which the quantities of interest are represented as affine combinations of certain primitive variables representing the sources of uncertainty in the data or approximations made during the computation. The application of this technique to the power flow problem is explained in detail, and several numerical results are presented and discussed, demonstrating the effectiveness of the proposed methodology, especially in comparison to previously proposed interval arithmetic's techniques.} } @article{deg-lom-roe-10-aa-finelm, author = {D. Degrauwe and G. Lombaert and G. {De Roeck}}, title = {Improving interval analysis in finite element calculations by means of affine arithmetic}, journal = {Computers {\&} Structures}, volume = {88}, number = {3}, pages = {247-254}, year = 2010, issn = {0045-7949}, doi = {10.1016/j.compstruc.2009.11.003}, abstract = {Interval-based uncertainty models have proven to be well-suited for structural safety engineering with few data at hand. The practical use of interval analysis is hindered by the dependency problem, which leads to an overestimation of the uncertainty on the results. Affine arithmetic is a generalization of interval arithmetic that accounts for the relation between variables. By circumventing the dependency problem, it yields more accurate results. This paper presents a novel method to solve affine systems of linear equations, which allows for the application of affine arithmetic in finite element analysis. The proposed procedure is illustrated with three applications.} } @inproceedings{min-tom-cor-fab-mar-10-icip, author = {Rodrigo Minetto and Nicolas Thome and Matthieu Cord and Jonathan Fabrizio and Beatriz Marcotegui}, title = {{SnooperText}: {A} Multiresolution System for Text Detection in Complex Visual Scenes}, booktitle = {Proc.~17th IEEE International Conference on Image Processing (ICIP)}, pages = {3861-3864}, year = 2010 } @misc{google-10-citgad, author = {Google Inc.}, title = {Citations gadget}, url = {http://code.google.com/p/citations-gadget/}, howpublished = {WWW site.}, year = 2010 } @inproceedings{oli-fer-gom-gom-oli-per-pin-10-maxwell, class = {P-CNA}, author = {M. D. Oliveira and P. J. S. G. Ferreira and S. M. Gomes and A. Gomide and A. S. Oliveira and J. R. Pereira and {P. Pinho}}, title = {{Runge}-{Kutta} Methods with Time Step Control and Adaptive Grid Refinement for {Maxwell}'s Equations}, booktitle = {Abstracts of the 3rd Chilean Workshop on Numerical Analysis of Partial Differential Equations (WONAPDE)}, location = { Concepci{\'o}n, Chile}, month = jan, pages = {}, year = 2010 } @article{han-atk-smi-smi-10-facrepsir, author = {Mark F. Hansen and Gary A. Atkinson and Lyndon N. Smith and Melvyn L. Smith}, title = {3D face reconstructions from photometric stereo using near infrared and visible light}, journal = {Computer Vision and Image Understanding}, volume = {In Press, Accepted Manuscript}, year = 2010, issn = {1077-3142}, doi = {10.1016/j.cviu.2010.03.001}, url = {http://www.sciencedirect.com/science/article/B6WCX-4YT05D0-1/2/ebeb09590a69913cbe1f45fce953ba14}, } @misc{mdf-10-scanner, title = {3dMDface System}, url = {http://www.3dmd.com/3dmdface.html}, howpublished = {Company page, accessed on 2010-04-22}, year = 2010 } %%% 2009 %%%%%%%%%%%%%%%%%%% @inproceedings{ska-10-aa-linsys, author = {Skalna, Iwona}, title = {A Global Optimization Method for Solving Parametric Linear Systems Whose Input Data Are Rational Functions of Interval Parameters}, booktitle = {Proc. International Conference on Parallel Processing and Applied Mathematics (PPAM 2009)}, year = 2010, publisher = {Springer}, pages = {475--484}, isbn = {978-3-642-14403-5}, series = {Lecture Notes in Computer Science}, volume = {6068}, doi = {10.1007/978-3-642-14403-5_50}, altkeys = {ska-09-aa-linsys}, comment = {Revised AA, linear system solving}, abstract = {An interval global optimization method combined with the Direct Method for solving parametric linear systems is used for computing a tight enclosure for the solution set of parametric linear system whose input data are non-linear functions of interval parameters. Revised affine arithmetic is used to handle the nonlinear dependencies. The Direct Method performs the monotonicity test to speed up the convergence of the global optimization. It is shown that the monotonicity test significantly increases the convergence of the global optimization method. Some illustrative examples are solved by the discussed method, and the results are compared to literature data produces by other methods.} } @inproceedings{con-gur-liu-liu-zha-zho-zou-09-aa-static, author = {Cong, Jason and Gururaj, Karthik and Liu, Bin and Liu, Chunyue and Zhang, Zhiru and Zhou, Sheng and Zou, Yi}, title = {Evaluation of Static Analysis Techniques for Fixed-Point Precision Optimization}, booktitle = {Proc. 17th IEEE Symposium on Field Programmable Custom Computing Machines}, year = 2009, volume = {}, number = {}, pages = {231-234}, doi = {10.1109/FCCM.2009.35}, month = apr, comment = {Compares AA with GIA and Symbolic Arithmetic. Finds that GIA is marginally better}, abstract = {Precision analysis and optimization is very important when transforming a floating-point algorithm into fixed-point hardware implementations. The core analysis techniques are either based on dynamic analysis or static analysis. We believe in static error analysis, as it is the only technique that can guarantee the desired worst-case accuracy. In this paper we study various underlying arithmetic candidates that can be used in static error analysis and compare their computed sensitivities. The approaches studied include Affine Arithmetic(AA), General Interval Arithmetic (GIA) and Automatic Differentiation (Symbolic Arithmetic). Our study shows that symbolic method is preferred for expressions with higher order cancellation. For programs without strong cancellation, any method works fairly well and GIA slightly outperforms others. We also study the impact of program transformations on these arithmetics.} } @techreport{fry-pas-com-09-aa-procsurf-tr, author = {Fryazinov, O. and Pasko, A. and Comninos, P.}, title = {Fast Reliable Ray-tracing of Procedurally Defined Implicit Surfaces Using Revised Affine Arithmetic}, institution = {Bournemouth University}, number = {TR-NCCA-2009-04}, year = 2009, month = oct, url = {http://eprints.bournemouth.ac.uk/11708/}, comment = {See also~\cite{fry-pas-com-10-aa-procsurf}}, abstract = {Fast and reliable rendering of implicit surfaces is an important area in the field of implicit modelling. Direct rendering, namely ray-tracing, is shown to be a suitable technique for obtaining good-quality visualisations of implicit surfaces. We present a technique for reliable ray-tracing of arbitrary procedurally defined implicit surfaces by using a modification of Affine Arithmetic called Revised Affine Arithmetic. A wide range of procedurally defined implicit objects can be rendered using this technique including polynomial surfaces, constructive solids, pseudo-random objects, procedurally defined microstructures, and others. We compare our technique with other reliable techniques based on Interval and Affine Arithmetic to show that our technique provides the fastest, while still reliable, ray-surface intersections and ray-tracing. We also suggest possible modifications for the GPU implementation of this technique for real-time rendering of relatively simple implicit models and for near real-time for complex implicit models.} } @article{zhu-che-09-aa-eigen, author = {Zhu, Zeng-Qing and Chen, Jian-Jun}, title = {Dynamic Eigenvalue Analysis of Structures with Interval Parameters Based on Affine Arithmetic}, journal = {tructural Engineering and Mechanics}, volume = {33}, number = {4}, year = 2009, comment = {Eigenvalues of mechanical structures with uncertainties}, pages = {539--542} } @inproceedings{min-zhe-qin-09-aa-fuzzmark, author = {Min, Yu and Zhengyou, He and Qingquan, Qian}, title = {Fuzzy Availability Based on Affine Arithmetic and {Markov} Process}, booktitle = {Proc. Second International Conference on Intelligent Computation Technology and Automation}, year = 2009, volume = {2}, number = {}, pages = {704-707}, doi = {10.1109/ICICTA.2009.405}, month = oct, comment = {Combines AA with probabilities and Markov processes?}, abstract = {This paper proposes a novel approach of fuzzy availability modeling based on probabilistic approach, employs affine arithmetic together with Markov process. Availability models based on Markov process allow failure, maintenance to be specified in a concise manner. Under a Markov model from which transient availability and steady-state availability can be easily obtained. In practice, sometimes we can't have the exact values of failure rate, repairing rate or other system parameters but with some uncertainty about these values. This is quite common for systems in modern large-scale monitor system and the control system, where many system parameters are not normalized. For the deviation explosion of fuzzy dependability analysis based on fuzzy set or interval arithmetic, affine forms of bounded uncertain quantities and affine arithmetic are introduced into modeling and calculating the dependability index. Using Markov process and affine arithmetic, the probability of each state at moment t can be calculated and then the fuzzy dependability curve of system will be built.} } @inproceedings{bah-rev-09-aa-solver, author = {Ali Baharev and Endre R{\'e}v}, title = {A Complete Nonlinear System Solver Using Affine Arithmetic}, booktitle = {Proc. Interval Analysis and Constraint Propagation for Applications (IntCP 2009)}, pages = {17-33}, location = {Lisbon, Portugal}, year = 2009, month = sep, url = {https://www.researchgate.net/profile/Ali-Baharev/publication/237677929_A_complete_nonlinear_system_solver_using_affine/links/0a85e5382708b1dfab000000/A-complete-nonlinear-system-solver-using-affine.pdf#page=24}, comment = {General purpose nonlinear solver}, abstract = {A general framework is presented for finding all solutions to systems of nonlinear equations, or proving that there is no solution to the problem. Components of this framework are interval arithmetic, affine arithmetic, constraint propagation based on directed acyclic graph (DAG) representation of the problem, a pruning technique based on linear programming and a local approximate optimizer. The proposed method is implemented in C++ and will be released as an open source standalone solver. An important feature of the solver is that it is interfaced with the AMPL°R modeling system. Numerical results on difficult benchmarks and comparisons to other solvers are given. The favorable effect of exploiting common subexpressions is also discussed. Real-world problems from chemical engineering, having multiple solutions, are successfully solved.} } @inproceedings{tha-pos-ham-09-aa-mosfet, author = {Thanigaivelan, Balavelan and Postula, Adam and Hamilton, Tara Julia}, title = {A Modified {MOSFET} Small-Signal Model Based on Affine Arithmetic Concepts}, booktitle = {2009 Asia Pacific Conference on Postgraduate Research in Microelectronics Electronics (PrimeAsia)}, year = 2009, volume = {}, number = {}, pages = {73-76}, keywords = {}, doi = {10.1109/PRIMEASIA.2009.5397443}, issn = {2159-2160}, month = jan, comment = {AA leads to simpler and more understandable models of transitor behavior}, abstract = {We modified small-signal MOSFET models with affine arithmetic concepts. The model elements were redistributed so they are meaningfully grouped and better correlated. The modified models are more compact, easier to handle (even at the highest accuracy level the model leads to simpler circuit expressions) and provide better insight into the analysis of large analog circuits. The results presented in this paper show that the modified models generate compact circuit expressions with a significant reduction in the number of terms. This leads to reduced computational complexity and simulation time when compared with analysis using conventional models.} } @article{bah-ach-rev-09-aa-distill, author = {Baharev, Ali and Achterberg, Tobias and R{\'e}v, Endre}, title = {Computation of an extractive distillation column with affine arithmetic}, journal = {Journal of the American Institute of Chemical Engineers}, volume = {55}, number = {7}, pages = {1695-1704}, year = 2009, doi = {10.1002/aic.11777}, abstract = {The need of reliably solving systems of nonlinear equations often arises in the everyday practice of chemical engineering. In general, standard methods cannot provide theoretical guarantee for convergence to a solution, cannot reliably find multiple solutions, and cannot prove nonexistence of solutions. Interval methods provide tools to overcome these problems, thus achieving reliability. To the authors' best knowledge, computation of distillation columns with interval methods have not yet been considered in the literature. This article presents significant enhancements compared with a previously published interval method of the authors. The proposed branch-and-prune algorithm is guaranteed to converge, and is fairly general at the same time. If no solution exists then this information is provided by the method as a result. Power of the suggested method is demonstrated by solving, with guaranteed convergence, even the MESH equations of a 22 stage extractive distillation column with a ternary mixture.} } @article{kno-hij-ken-sch-han-hag-09-aa-raytr, author = {Knoll, A. and Hijazi, Y. and Kensler, A. and Schott, M. and Hansen, C. and Hagen, H.}, title = {Fast Ray Tracing of Arbitrary Implicit Surfaces with Interval and Affine Arithmetic}, journal = {Computer Graphics Forum}, volume = {28}, number = {1}, pages = {26-40}, doi = {10.1111/j.1467-8659.2008.01189.x}, comment = {Inclusion-preserving AA; SIMD and GPU parallelization; symbolic processing}, abstract = {Abstract Existing techniques for rendering arbitrary-form implicit surfaces are limited, either in performance, correctness or flexibility. Ray tracing algorithms employing interval arithmetic (IA) or affine arithmetic (AA) for root-funding are robust and general in the class of surfaces they support, but traditionally slow. Nonetheless, implemented efficiently using a stack-driven iterative algorithm and SIMD vector instructions, these methods can achieve interactive performance for common algebraic surfaces on the CPU. A similar algorithm can also be implemented stacklessly, allowing for efficient ray tracing on the GPU. This paper presents these algorithms, as well as an inclusion-preserving reduced affine arithmetic (RAA) for faster ray-surface intersection. Shader metaprogramming allows for immediate and automatic generation of symbolic expressions and their interval or affine extensions. Moreover, we are able to render even complex forms robustly, in real-time at high resolution.}, year = 2009 } @inproceedings{sun-smi-far-smi-09-conrepss, author = {Jiuai Sun and Melvyn L. Smith and Abdul R. Farooq and Lyndon N. Smith}, title = {Concealed Object Perception and Recognition Using a Photometric Stereo Strategy}, booktitle = {Proc.~11th International Conference on Advanced Concepts for Intelligent Vision Systems (ACIVS)}, series = {Lecture Notes in Computer Science}, volume = 5807, pages = {445--455}, doi = {10.1007/978-3-642-04697-1}, year = 2009, month = oct, location = {Bordeaux, France}, altkeys = {sun-smi-far-smi-08-conc} } @misc{atk-smi-09-photoface, author = {Gary Atkinson and Melvyn Smith}, title = {Face Recognition using Photometric Stereo}, url = {http://www.uwe.ac.uk/cems/research/groups/mvl/projects/photoface.shtml}, howpublished = {Project page, acessed on 2010-04-22}, year = 2009 } @article{mon-lei-tor-09-wavfing, author = {J. A. Montoya-Zegarra and Neucimar J. Leite and Ricardo S. Torres}, title = {Wavelet-Based Fingerprint Image Retrieval}, journal = {Journal of Computational and Applied Mathematics}, volume = {227}, pages = {294--307}, year = 2009 } @mastersthesis{fav-09-thesis, author = {Fernanda Oliveira Favretto}, title = {Registro de imagens {3D} do C{\'e}rebro Humano}, degree = {Mestrado em Ci{\^e}ncia da Computa{\c{c}}{\~a}o}, school = {Institute of Computing, University of Campinas}, note = {Advisor: A. X. Falc{\~a}o}, year = 2009, month = mar, language = {Portuguese}, altkeys = {MTH-X:afalcao:adv.msc:1} } @inproceedings{zeg-pap-lei-tor-fal-09-fing, author = {J. A. Montoya-Zegarra and J. P. Papa and Neucimar J. Leite and Ricardo S. Torres and Alexandre X. Falc{\~a}o}, title = {Novel Approaches for Exclusive and Continuous Fingerprint Classification}, booktitle = {Proc.~3rd Pacific Rim Symposium on on Image and Video Technology (PSIVT): Advances in Image and Video Technology}, series = {Lecture Notes In Computer Science}, volume = {5414}, pages = {386--397}, publisher = {Springer}, year = 2009, location = {Tokyo}, month = jan, isbn = {978-3-540-92956-7}, altkeys = {CIN-X:neucimar:pub.con:3} } @misc{wik-09-sizewiki, author = {{Wikipedia editors}}, title = {Wikipedia:{Size} of {Wikipedia}}, url = {http://en.wikipedia.org/wiki/Wikipedia:Size_of_Wikipedia}, howpublished = {English Wikipedia internal article. Acessed on 2009-11-29.}, year = 2009 } @misc{hen-09-wikigrow, author = {User:HenkvD}, title = {Wikipedia:{Modelling} {Wikipedia's} growth}, url = {http://en.wikipedia.org/wiki/Wikipedia:Modelling_Wikipedia's_growth}, howpublished = {English Wikipedia internal article. Acessed on 2009-11-29. See also the user's personal page on Wikipedia.}, year = 2009 } @misc{wik-09-wikixgrow, author = {User:Wikid77}, title = {Wikipedia:Modelling Wikipedia extended growth}, url = {http://en.wikipedia.org/wiki/Wikipedia:Modelling_Wikipedia_extended_growth}, howpublished = {English Wikipedia internal article. Acessed on 2009-11-29. See also the users's personal page on Wikipedia.}, year = 2009 } @inproceedings{dor-neu-09-mubin, author = {L. B. Dorini and N. J. Leite}, title = {A Multiscale Operator for Document Image Binarization}, booktitle = {Proc.~2009 Intl Joint Conference on Computer Vision and Computer Graphics Theory and Applications (VISIGRAPP)}, pages = {34--39}, year = 2009, location = {Lisbon} } @article{tor-fal-gon-pap-zha-fan-fox-09-gencbir, author = {R. S. Torres and A. X. Falc{\~a}o and M. A. Gon{\c{c}}alves and J. P. Papa and B. Zhang and W. Fan and E. A. Fox}, title = {A Genetic Programming Framework for Content-Based Image Retrieval}, journal = {Pattern Recognition}, volume = {42}, number = {2}, pages = {217--312}, year = 2009, issn = {0031-3203}, doi = {10.1016/j.patcog.2008.04.010}, url = {http://www.sciencedirect.com/science/article/B6V14-4SD29JV-1/2/e923d1aa7f24919e6066b9b28215c356}, month = feb } @article{tri-met-zef-and-09-hpvmark, author = {R. M. Triglia and K. Metze and L. Zeferino and L. L. A. Andrade}, title = {{HPV} In Situ Hybridization Signal Patterns as a Marker for Cervical Intraepithelial Neoplasia Progression}, journal = {Gynecologic Oncology}, volume = {112}, number = {1}, pages = {114--118}, year = 2009, month = jan, pmid = {19007972} } @article{els-sue-cav-met-09-mitoix, author = {L. Elston and F. A. Sueiro and J. M. B. Cavalcanti and K. Metze}, title = {The Importance of the Mitotic Index as a Prognostic Factor for Canine Cutaneous Mast Cell Tumors - {A} Validation Study}, journal = {Veterinary Pathology}, volume = {46}, number = {2}, pages = {362--364}, year = 2009, month = mar, pmid = {19261652}, altkeys = {JIN-X:metze:pub.jrn:5} } @inproceedings{zho-smi-smi-war-09-difcanc, author = {Y. Zhou and M. L. Smith and L. N. Smith and R. Warr}, title = {Using Differential Forms to Characterize {3D} Surface of Skin Cancer in Vivo}, booktitle = {12th World Congress on Cancers of the Skin}, location = {Tel Aviv}, year = 2009 } @inproceedings{atk-far-smi-smi-09-facrec, author = {G. A. Atkinson and A. R. Farooq and M. L. Smith and L. N. Smith}, title = {Facial Reconstruction and Alignment using Photometric Stereo and Surface Fitting}, booktitle = {Proc.~2009 Iberian Conference on Pattern Recognition and Image Analysis}, location = {P{\'o}voa de Varzim, Portugal}, year = 2009 } @inproceedings{atk-smi-smi-09-facprof, author = {G. A. Atkinson and M. L. Smith and L. N. Smith}, title = {Facial Geometry Estimation using Photometric Stereo and Profile Views}, booktitle = {Proc.~International Conference on Biometrics}, year = 2009, note = {To appear} } @article{din-smi-smi-war-sun-09-melan, author = {Ding Y. and L. Smith and M. Smith and R. Warr and J. Sun}, title = {Obtaining {3D} Malignant Melanoma Indicators through Statistical Analysis of {3D} Skin Surface Disruptions}, journal = {Skin Research and Technology}, year = 2009, volume = {15}, number = {3}, pages = {262--270} } @inproceedings{red-agr-che-09-errcor, title = {Enforcing Integrability by Error Correction using {$\ell_1$}-Minimization}, author = {Dikpal Reddy and Amit Agrawal and Rama Chellappa}, booktitle = {Proc.~2009 IEEE Conference on Computer Vision and Pattern Recognition}, year = 2009, pages = {2350--2357}, comment = {Overviews previous methods. Discusses outliers in photometric stereo. Discusses curl removal using $\ell_1$ instead of $\ell_2$ as a way of handling outliers. Says the mesh is an expander graph but that is incorrect. Compares various algorithms with noise and/or outliers. Includes shapelets.} } %%% 2008 %%%%%%%%%%%%%%%%%%% @inproceedings{olb-bar-08-aa-distr, author = {Olbrich, Markus and Barke, Erich}, title = {Distribution Arithmetic for Stochastical Analysis}, booktitle = {2008 Asia and South Pacific Design Automation Conference}, year = 2008, volume = {}, number = {}, pages = {537-542}, keywords = {}, doi = {10.1109/ASPDAC.2008.4484009}, ISSN = {2153-697X}, month = mar, comment = {Competitor to AA: uses variances and covariances, possibly higher order}, abstract = {This paper presents a novel arithmetic which allows calculations with fluctuating values. The arithmetic consists of a special representation of random variables and procedures for performing numerical operations between them. Given the distributions of initial random variables, the moments (such as expected value, variance and higher moments) of any calculated variable can be determined. Our approach is not limited to normal distributions and works with linear and nonlinear functions. Correlations between variables are taken into account automatically by the arithmetic. Examples show the accuracy and runtimes compared to Monte Carlo simulation.} } @inproceedings{hij-hag-han-joy-08-aa-iauseful, author = {Hijazi, Y. and Hagen, H. and Hansen, C. D. and Joy, K. I.}, title = {Why Interval Arithmetic is So Useful}, booktitle = {Visualization of Large and Unstructured Data Sets}, isbn = {978-3-88579-441-7}, year = 2008, pages = {148-163}, publisher = {Gesellschaft für Informatik}, url = {https://dl.gi.de/handle/20.500.12116/4619}, comment = {Presumably mentions AA}, abstract = {Interval arithmetic was introduced by Ramon Moore [Moo66] in the 1960s as an approach to bound rounding errors in mathematical computation. The theory of interval analysis emerged considering the computation of both the exact solution and the error term as a single entity, i.e. the interval. Though a simple idea, it is a very powerful technique with numerous applications in mathematics, computer science, and engineering. In this survey we discuss the basic concepts of interval arithmetic and some of its extensions, and review successful applications of this theory in particular in computer science.} } @inproceedings{zhu-che-08-aa-dynstruc, author = {Zhu, Zeng Qing and Chen, J.J.}, title = {Dynamic Response Analysis for Structures with Interval Parameters Based on Affine Arithmetic}, booktitle = {Advanced Materials Research}, year = 2008, month = jun, volume = {44-46}, pages = {157--164}, publisher = {Trans Tech Publications Ltd}, doi = {10.4028/www.scientific.net/AMR.44-46.157}, comment = {Structural engineering}, abstract = {This paper aims to study the uncertainty of the MDOF structural dynamic response, taking not only the interval characteristics of structural physical parameters and geometric dimension, but also the interval characteristics of applied load simultaneously . By means of the description of the interval parameters of uncertain structure with affine forms, the interval structural dynamic equation is studied, and an improved affine arithmetic based on interval division is presented, where correlations between the interval elements in eigenvalue and responses equations are considered, independent uncertain parameters are transformed to affine forms, and the solution of eigenvalue and response equations are transformed into the corresponding certain ones. With general affine arithmetic, the eigenvalue of each order and response bounds are determined by searching for the maximum and minimum in the solutions. Finally, some mathematical examples and a further engineering application confirm the feasibility and validity of this approach.} } @mastersthesis{cha-08-aa-stan-thesis, author = {Bryan Chan}, title = {Static Analysis for Efficient Affine Arithmetic on {GPUs}}, school = {University of Waterloo}, year = 2008, month = jan, url = {http://hdl.handle.net/10012/3571}, comment = {Static analysis for efficient computation}, abstract = {Range arithmetic is a way of calculating with variables that hold ranges of real values. This ability to manage uncertainty during computation has many applications. Examples in graphics include rendering and surface modeling, and there are more general applications like global optimization and solving systems of nonlinear equations. This thesis focuses on affine arithmetic, one kind of range arithmetic. The main drawbacks of affine arithmetic are that it taxes processors with heavy use of floating point arithmetic and uses expensive sparse vectors to represent noise symbols. Stream processors like graphics processing units (GPUs) excel at intense computation, since they were originally designed for high throughput media applications. Heavy control flow and irregular data structures pose problems though, so the conventional implementation of affine arithmetic with dynamically managed sparse vectors runs slowly at best. The goal of this thesis is to map affine arithmetic efficiently onto GPUs by turning sparse vectors into shorter dense vectors at compile time using static analysis. In addition, we look at how to improve efficiency further during the static analysis using unique symbol condensation. We demonstrate our implementation and performance of the condensation on several graphics applications.} } @misc{bil-08-aa-hiorder-errata, author = {Giuseppe Bilotta}, title = {Errata for ``Self-Verified Extension of Affine Arithmetic to Arbitrary Order''}, howpublished = {In the journal \emph{Le Matematiche}}, note = {Errata (missing references) for~\cite{}.}, url = {https://lematematiche.dmi.unict.it/index.php/lematematiche/article/download/67/64} } @article{bil-08-aa-hiorder, author = {Giuseppe Bilotta}, title = {Self-Verified Extension of Affine Arithmetic to Arbitrary Order}, journal = {Le Matematiche}, volume = {LXIII}, year = 2008, number = {I}, pages = {15--30}, url = {https://lematematiche.dmi.unict.it/index.php/lematematiche/article/download/47/46}, note = {See errata (missing references)~\cite{bil-08-aa-hiorder-errata}}, comment = {Multilinear AA to approximate multivariate polynomials}, abstract = {Affine Arithmetic (AA) is a self-verifying computational approach that keeps track of first-order correlation between uncertainties in the data and intermediate and final results. In this paper we propose a higher-order extension satisfying the requirements of genericity, arbitrary-order and self-verification, comparing the resulting method with other well-known high-order extensions of AA.} } @inproceedings{fre-olb-bar-08-aa-circ, author = {Freisfeld, M. and Olbrich, M. and Barke, E.}, booktitle = {9th International Conference on Solid-State and Integrated-Circuit Technology (2008)}, title = {Circuit Simulations with Uncertainties Using Affine Arithmetic and Piecewise Affine Statemodels}, year = 2008, volume = {}, number = {}, pages = {496-499}, doi = {10.1109/ICSICT.2008.4734572}, month = oct, comment = {ODE with AA? Piecewise-linear functions}, abstract = {Especially in the field of safety critical applications the impact of process variations on the behavior of integrated circuits can not be neglected. Usually, simulation is costly due to the need for multiple simulation runs with different technology parameter settings. In the past, semi-symbolic-simulation applying affine arithmetic (AA), as a suitable range arithmetic, has produced very motivating results on netlistlevel. Using AA reduces the complexity without loosing generality of the simulation results. This paper covers the formulation of effective highlevel circuit models. We use piecewise affine functions to model the circuit and to provide fast simulations while simultaneously achieving good convergence. The equations are separated into matrices for linear mapping and matrices for the representation of the system's state. We formulate the uncertainties within the system with affine terms entered in the system matrices. Furthermore, we present the relevant solution algorithms for the semi symbolic simulation and their implementation.} } @article{sun-lij-mad-wan-08-aa-chyield, author = {Sun, Jin and Li, Jun and Ma, Dongsheng and Wang, Janet M.}, title = {{Chebyshev} Affine-Arithmetic-Based Parametric Yield Prediction Under Limited Descriptions of Uncertainty}, journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}, year = 2008, volume = {27}, number = {10}, pages = {1852-1865}, keywords = {}, doi = {10.1109/TCAD.2008.2003300}, issn = {1937-4151}, month = oct, comment = {Prediction of silicon chip yield. What is ``Chebyshev'' AA?}, abstract = {Due to the hard-to-measure distributions of real process data, it is difficult to provide accurate parametric yield prediction for modern circuit design. Most existing approaches are not able to handle the uncertain distribution properties coming from the process data. Other approaches are inadequate in considering correlations among the distributions of variations. This paper suggests a new approach that not only takes care of correlations among distributions but also provides a low-cost and efficient computation scheme. The proposed method approximates the parameter variations with Chebyshev affine arithmetic (CAA) to capture both the uncertainty and nonlinearity in a cumulative distribution function. The CAA-based probabilistic range presentation describes, both fully and partially, specified process and environmental parameters. Thus, we are able to predict the probability bounds for leakage consumption with unknown dependences among variations. The end result is the chip-level parametric yield estimation based on leakage prediction. Experimental results demonstrate that the new approach provides a reliable bound estimation, which leads to a 20{\%} yield improvement compared with only using the intervals of partially specified uncertainties.} } @article{bah-rev-08-aa-equilib, author = {Baharev, Ali and R{\'e}v, Endre}, title = {Reliable Computation of Equilibrium Cascades with Affine Arithmetic}, journal = {Journal of the American Institute of Chemical Engineers}, volume = {54}, number = {7}, pages = {1782-1797}, doi = {10.1002/aic.11490}, year = 2008, comment = {Chemical equilibrium equations. Combining AA with other methods}, abstract = {Computing the steady state of multistage counter-current processes like distillation, extraction, or absorption is the equivalent to finding solutions for large-scale nonlinear equation systems. The conventional solution techniques are fast and efficient if a good estimation is available, but are prone to fail, and do not provide information about the reason for the failure. This is the main motive to apply reliable methods in solving them. Reliable computations are usually realized with interval methods. A reliable root finding method is presented, based on affine arithmetic (AA), a recently developed linearization technique and interval method. AA is compared here to another linearization technique, the widely known Interval Newton method. The studied examples seem to indicate superiority of the novel method over the traditional one. The comparison is made with a pruning technique not state-of-the-art, but analogous in the two compared methods. AA can be combined with constraint propagation (CP), or linear programming (LP) aided CP, as pruning techniques. The combined techniques, AA/CP and AA/LP are studied and compared. AA/LP proves to be preferable because of its robustness. Short distillation columns are successfully computed with the proposed AA/LP method.} } @misc{gou-put-08-aa-perturb, title = {Perturbed Affine Arithmetic for Invariant Computation in Numerical Program Analysis}, author = {Eric Goubault and Sylvie Putot}, year = 2008, howpublished = {Preprint online at the arXiv repository, article 0807.2961}, url = {https://arxiv.org/abs/0807.2961}, comment = {Finding invariants of numerical algorithms}, abstract = {We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any order. Good evidence shows it behaves well also for some non-linear schemes. The result, and the structure of the domain, rely on an interesting interplay between order and topology.} } @article{sun-smi-smi-cou-dab-har-bam-08-refskin, author = {J. Sun and M. L. Smith and L. N. Smith and L. Coutts and R. Dabis and C. Harland and J. Bamber}, title = {Reflectance of Human Skin using Colour Photometric Stereo - with Particular Application to Pigmented Lesion Analysis}, journal = {Skin Research and Technology}, volume = {14}, pages = {173--179}, year = 2008 } @article{pit-sch-ras-spe-smi-sta-smi-08-simpol, author = {E. Pitschke and M. Schinhaerl and R. Rascher and P. Sperber and L. N. Smith and R. Stamp and M. L. Smith}, title = {Simulation of a Complex Optical Polishing Process using Neural Networks}, journal = {Computer-integrated Manufacturing}, volume = {24}, pages = {32--37}, year = 2008 } @inproceedings{arg-pet-08-recsha, title = {Recursive photometric stereo when multiple shadows and highlights are present}, author = {Vasileios Argyriou and Maria Petrou}, booktitle = {Proc.~2008 IEEE Conference on Computer Vision and Pattern Recognition}, year = 2008, pages = {1--6}, doi = {10.1109/CVPR.2008.4587762} } @misc{cas-08-povray, author = {Chris Cason and POV-Team}, title = {{Persistence} of {Vision} {Raytracer}}, url = {http://www.povray.org/}, howpublished = {Electronic document, edit date 2008/07/30, last acessed on 2008/10/25}, year = 2008, month = jul, altkeys = {cason-08-povray} } @misc{cri-08-imagemagick, author = {John Cristy}, title = {{ImageMagick}: {Convert}, Edit and Compose Images}, url = {http://www.imagemagick.org}, howpublished = {Electronic document, edit date 2008/10/20, last acessed on 2008/10/25}, year = 2008, month = oct, altkeys = {cristy-08-imagemagick} } @misc{roe-08-png, author = {Greg Roelofs}, title = {{Portable} {Network} {Graphics}: {An} Open, Extensible Image Format with Lossless Compression}, url = {http://libpng.org/pub/png/}, howpublished = {Electronic document, edit date 2008/09/19, last acessed on 2008/10/22}, year = 2008, month = sep } @misc{hen-08-netpbm, author = {Bryan Henderson}, title = {{Netpbm} home page}, url = {http://netpbm.sourceforge.net/}, howpublished = {Electronic document, edit date 2008/08/01, last accessed on 2008/10/22}, year = 2008, month = aug, altkeys = {site-pnm,xxx-NN-pnmfmt} } %%% 2007 %%%%%%%%%%%%%%%%%%% @techreport{kno-hij-ken-sch-han-hag-07-aa-gpuray, title = {Fast and Robust Ray Tracing of General Implicits on the {GPU}}, author = {Aaron Knoll and Younis Hijazi and Andrew Kensler and Mathias Schott and Charles Hansen and Hans Hagen}, year = 2007, institution = {University of Utah}, number = {UUSCI-2007-014}, comment = {Reduced AA}, abstract = {Existing methods for rendering arbitrary implicit functions are limited, either in performance, correctness or flexibility. Ray tracing methods in conjunction with an inclusion algebra such as interval arithmetic (IA) or affine arithmetic (AA) have historically proven robust and flexible, but slow. In this paper, we present a new stackless ray traversal algorithm optimized for modern graphics hardware, and a correct inclusion-preserving reduced affine arithmetic (RAA) suitable for fragment shader languages. Shader metaprogramming allows for immediate and automatic generation of functions and their interval or affine extensions, enhancing user interaction. Ray tracing lends itself to multi-bounce effects, such as shadows and depth peeling, which are useful modalities for visualizing complicated implicit functions. With this system, we are able to render even complex implicits correctly, in real-time at high resolution.} } @inproceedings{osb-che-cou-luk-men-07-aa-minbit, author = {Osborne, W.G. and Cheung, R.C.C. and Coutinho, J.G.F. and Luk, W. and Mencer, O.}, title = {Automatic Accuracy-Guaranteed Bit-Width Optimization for Fixed and Floating-Point Systems}, booktitle = {2007 International Conference on Field Programmable Logic and Applications}, year = 2007, volume = {}, number = {}, pages = {617-620}, doi = {10.1109/FPL.2007.4380730}, ISSN = {1946-1488}, month = aug, comment = {MinBit+ is static analysis unsing IA/AA to optimize bit widths in signal processors}, abstract = {In this paper we present Minibit+, an approach that optimizes the bit-widths of fixed-point and floating-point designs, while guaranteeing accuracy. Our approach adopts different levels of analysis giving the designer the opportunity to terminate it at any stage to obtain a result. Range analysis is achieved using a combined affine and interval arithmetic approach to reduce the number of bits. Precision analysis involves a coarse-grain and fine-grain analysis. The best representation, in fixed-point or floating-point, for the numbers is then chosen based on the range, precision and latency. Three case studies are used: discrete cosine transform, B-Splines and RGB to YCbCr color conversion. Our analysis can run over 200 times faster than current approaches to this problem while producing more accurate results, on average within 2-3% of an exhaustive search.} } @misc{gou-put-07-aa-imprec, author = {E. Goubault and S. Putot}, title = {Automatic Analysis of Imprecision Errors in Software}, url = {http://www.lix.polytechnique.fr/~goubault/papers/abstract.pdf}, howpublished = {Online document}, year = 2007, comment = {Three-page abstract. Claims to use AA to do static FP range analysis of variables in a C or Fortram program} } @inproceedings{zho-bia-07-aa-wdlen, author = {S. Zhou and J. Bian}, title = {{OWL}: {Word}-Length Optimization via Extreme Value Theory and Affine Arithmetic/Interval Arithmetic Model}, booktitle = {Proc. of Circuits, Signals, and Systems 2007}, publisher = {Acta}, year = 2007, pages = {article 573-046}, abstract = {In the high level synthesis from languages such as C, word-length of variables is one of the key issues on VLSI design optimization. This paper proposes a new automated approach -- OWL, for optimizing word-lengths of fixed-point designs. OWL is based on static analysis via extreme value theory and affine/interval arithmetic. It describes methods to minimize both the integer and fraction parts of fixed-point signals. For range analysis, it employs a semi-analytical approach with extreme value distribution model to identify the number of integer bits, while for precision analysis, it uses AAIA error model to find the optimum number of fraction bits. The reduction percentage of word-length is over 60{\%} in integer part and over 45{\%} in fraction part.} } @inproceedings{liu-luk-son-tan-zen-07-aa-ellips, author = {Liu, Xuexin and Luk, Wai-Shing and Song, Yu and Tang, Pushan and Zeng, Xuan}, title = {Robust Analog Circuit Sizing Using Ellipsoid Method and Affine Arithmetic}, booktitle = {2007 Asia and South Pacific Design Automation Conference}, year = 2007, volume = {}, number = {}, pages = {203-208}, doi = {10.1109/ASPDAC.2007.357986}, issn = {2153-697X}, month = jan, comment = {Uses AA to improve the ellipsoid method of linear programming!}, abstract = {Analog circuit sizing under process/parameter variations is formulated as a mini-max geometric programming problem. To tackle such problem, we present a new method that combines the ellipsoid method and affine arithmetic. Affine arithmetic is not only used for keeping tracks of variations and correlations, but also helps to determine the sub-gradient at each iteration of the ellipsoid method. An example of designing a CMOS operational amplifier is given to demonstrate the effectiveness of the proposed method. Finally numerical results are verified by SPICE simulation.} } @article{ceb-kre-cho-lon-ngu-lud-bar-07-aa-expert, author = {Martine Ceberio and Vladik Kreinovich and Sanjeev Chopra and Luc Longpré and Hung T. Nguyen and Bertram Ludäscher and Chitta Baral}, title = {Interval-Type and Affine Arithmetic-Type Techniques for Handling Uncertainty in Expert Systems}, journal = {Journal of Computational and Applied Mathematics}, volume = {199}, number = {2}, pages = {403-410}, year = 2007, note = {Special Issue on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN 2004)}, issn = {0377-0427}, doi = {10.1016/j.cam.2005.08.030}, comment = {Uses "AA-like" techniques to obtain tight probability estimates. See also~\cite{cho-05-aa-expert}.}, abstract = {Expert knowledge consists of statements $S_j$ (facts and rules). The facts and rules are often only true with some probability. For example, if we are interested in oil, we should look at seismic data. If in 90{\%} of the cases, the seismic data were indeed helpful in locating oil, then we can say that if we are interested in oil, then with probability 90{\%} it is helpful to look at the seismic data. In more formal terms, we can say that the implication ``if oil then seismic'' holds with probability 90{\%}. Another example: a bank $A$ trusts a client $B$, so if we trust the bank $A$, we should trust $B$ too; if statistically this trust was justified in 99{\%} of the cases, we can conclude that the corresponding implication holds with probability 99{\%}. If a query $Q$ is deducible from facts and rules, what is the resulting probability $p(Q)$ in $Q$? We can describe the truth of $Q$ as a propositional formula $F$ in terms of $S_j$, i.e., as a combination of statements $S_j$ linked by operators like $\wedge$, $\vee$, and $\neg$; computing $p(Q)$ exactly is NP-hard, so heuristics are needed. Traditionally, expert systems use technique similar to straightforward interval computations: we parse $F$ and replace each computation step with corresponding probability operation. Problem: at each step, we ignore the dependence between the intermediate results $F_j$; hence intervals are too wide. Example: the estimate for $P(A\vee \neg A)$ is not 1. Solution: similar to affine arithmetic, besides $P(F_j)$, we also compute $P(F_j\wedge F_i)$ (or $P(F_{j1}\wedge \cdots \wedge F_{jd})$), and on each step, use all combinations of $\ell$ such probabilities to get new estimates. Results: e.g., $P(A\vee\neg A)$ is estimated as 1.} } @article{miy-kas-07-aa-exist, author = {Shinya Miyajima and Masahide Kashiwagi}, title = {Existence Test for Solution of Nonlinear Systems Applying Affine Arithmetic}, journal = {Journal of Computational and Applied Mathematics}, volume = {199}, number = {2}, pages = {304-309}, year = 2007, note = {Special Issue on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN 2004)}, issn = {0377-0427}, doi = {10.1016/j.cam.2005.08.051}, comment = {Existence test using Newton criterion?}, abstract = {A computational test is proposed for existence of solution in nonlinear systems. In this test, an interval inclusion of Newton mapping is estimated applying affine arithmetic. Numerical examples are presented to show the efficiency of this test.} } @article{gam-mad-07-aa-raytr, author = {Gamito, M. and Maddock, S.}, title = {Ray Casting Implicit Fractal Surfaces with Reduced Affine Arithmetic}, journal = {Visual Computer}, volume = 23, pages = {155--165}, year = 2007, doi = {10.1007/s00371-006-0090-7}, comment = {Reduced AA}, abstract = {A method is presented for ray casting implicit surfaces defined by fractal combinations of procedural noise functions. The method is robust and uses affine arithmetic to bound the variation of the implicit function along a ray. The method is also efficient due to a modification in the affine arithmetic representation that introduces a condensation step at the end of every non-affine operation. We show that our method is able to retain the tight estimation capabilities of affine arithmetic for ray casting implicit surfaces made from procedural noise functions while being faster to compute and more efficient to store.} } @inproceedings{gou-put-07-aa-under, author = {Goubault, Eric and Putot, Sylvie}, title = {Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic}, booktitle = {Static Analysis - Proc. International Static Analysis Symposium SAS 2007}, series = {LNCS}, volume = {4634}, year = 2007, pages = {137--152}, abstract = {We build a new, implicitly relational abstract domain which gives accurate under-approximations of the set of real values that program variables can take. This statement is demonstrated both on a theoretical basis and on non-trivial numerical examples. It is, we believe, the first non-trivial under-approximating numerical domain in the static analysis literature.}, isbn = {978-3-540-74061-2}, doi = {10.1007/978-3-540-74061-2_9} } @inproceedings{atk-han-07-polarps, author = {Gary A. Atkinson and Edwin R. Hancock}, title = {Surface Reconstruction Using Polarization and Photometric Stereo}, booktitle = {Proc.~12th International Conference on Computer Analysis of Images and Patterns (CAIP)}, location = {Vienna, Austria}, series = {Lecture Notes in Computer Science}, volume = {4673}, pages = {466--473}, year = 2007, month = aug } @inproceedings{hai-wil-07-stshape, author = {Tom S. F. Haines and Richard C. Wilson}, title = {Integrating Stereo with Shape-from-Shading Derived Orientation Information}, booktitle = {British Machine Vision Conference 2007}, year = 2007, altkeys = {haines-wilson-2007-stereoshape} } @article{lee-smi-smi-07-aggreg, author = {J. R. J. Lee and M. L. Smith and L. N. Smith}, title = {A New Approach to the Three-Dimensional Quantification of Angularity using Image Analysis of the Size and Form of Coarse Aggregates}, journal = {Engineering Geology}, volume = {91}, pages = {254--264}, year = 2007 } @article{sun-smi-smi-far-07-threelit, author = {J. Sun and M. L. Smith and L. N. Smith and A Farooq}, title = {Examining the Uncertainty of the Recovered Surface Normal in Three Light Photometric Stereo}, journal = {Image and Vision Computing Special Issue on Computer Vision Applications}, volume = {25}, pages = {1073--1079}, year = 2007 } @article{sun-smi-smi-mid-ban-07-osrm, author = {Jiuai Sun and Melvyn L. Smith and Lyndon N. Smith and Sagar Midha and Jeff Bamber}, title = {Object Surface Recovery using a Multi-Light Photometric Stereo Technique for Non-{Lambertian} Surfaces Subject to Shadows and Specularities}, journal = {Image and Vision Computing}, volume = {25}, number = {7}, pages = {1050--1057}, year = 2007, issn = {0262-8856}, doi = {10.1016/j.imavis.2006.04.025} } @article{kel-han-07-heateq-tip, author = {Antonio Robles-Kelly and Edwin R. Hancock}, title = {Shape-From-Shading Using the Heat Equation}, journal = {IEEE Transactions on Image Processing}, volume = {16}, number = {1}, pages = {7--21}, year = 2007 } @inproceedings{cha-lee-lee-07-multips, title = {Multiview normal field integration using level set methods}, author = {Ju Yong Chang and Kyoung Mu Lee and Sang Uk Lee}, booktitle = {Proc. 2007 IEEE Conference on Computer Vision and Pattern Recognition}, doi = {10.1109/CVPR.2007.383357}, pages = {1--8}, year = 2007, location = {Minneapolis, MN}, month = jun } @article{smi-smi-07-speced, author = {Melvyn L. Smith, Lyndon N. Smith (eds.)}, title = {Computer Vision Applications - Special issue}, journal = {Image and Vision Computing}, volume = {25}, number = {7}, year = 2007, pages = {1035--1036} } @inproceedings{cha-aga-kri-07-sha, author = {Manmohan Chandraker and Sameer Agarwal and David Kriegman}, title = {{ShadowCuts}: {Photometric} Stereo with Shadows}, booktitle = {CVPR07}, year = 2007, pages = {1--8}, bibsource = {http://www.visionbib.com/bibliography/shapefrom386.html#TT28413} } @article{bas-jac-kem-07-phg, author = {Ronen Basri and David Jacobs and Ira Kemelmacher}, title = {Photometric Stereo with General Unknown Lighting}, journal = {International Journal of Computer Vision}, volume = {72}, number = {3}, pages = {239--257}, year = 2007, altkeys = {bjh-2007} } @article{bez-lei-07-vtran, author = {Francisco N. Bezerra and Neucimar J. Leite}, title = {Using String Matching to Detect Video Transitions}, journal = {Pattern Analysis and Applications}, volume = {10}, number = {1}, pages = {45--54}, year = 2007, month = feb } @article{oli-lei-07-fing, author = {Marcelo de A. Oliveira and Neucimar J. Leite}, title = {Multiscale Directional Operator and Morphological Tools for Reconnecting Broken Ridges in Fingerprint Images}, journal = {Pattern Recognition}, pages = {(to appear)}, year = 2007 } %%% 2006 %%%%%%%%%%%%%%%%%%% @inproceedings{zou-cai-zho-hon-tan-06-aa-hipol, author = {Zou, Yi and Cai, Yici and Zhou, Qiang and Hong, Xianlong and X.D-Tan, Sheldon}, title = {Interval Valued Variational Analysis Using the Arithmetic of Higher Order Polynomial}, booktitle = {Proc 2006 International Conference on Communications, Circuits and Systems}, year = 2006, volume = {4}, number = {}, pages = {2444-2448}, doi = {10.1109/ICCCAS.2006.285170}, month = jun, comment = {Higer-order extension of AA, plus interval partition}, abstract = {In this paper, we discuss the two extensions of Affine Arithmetic, one through using higher order polynomial approximations, and the other is through partitioning the tolerance intervals. The two techniques greatly decrease the excessive width of calculated interval so that we could use these techniques to check the bounds in various kinds of circumstances such as variational timing analysis or circuit simulation. The accuracy of the simulation using this model is enhanced comparing with those using purely affine model.} } @misc{tha-pos-yon-06-aa-symcirc, author = {Thanigaivelan, B. and Postula, Adam and Yong, D}, title = {A Self-Validated Computation Approach to Symbolic Analysis of Analog Integrated Circuits}, year = 2006, month = jan, howpublished = {Online document}, url = {https://www.researchgate.net/publication/43461554_A_self-validated_computation_approach_to_symbolic_analysis_of_analog_integrated_circuits}, comment = {MATLAB toolbox for circuit analysis based on AA?}, abstract = {In this paper we present a new approach to symbolic analysis of analog integrated circuits that is based on the affine arithmetic models used in Self- Validated Computation (SVC). This approach preserves the interpretability of symbolic expressions, when MOS transistors are substituted with device models at different modeling levels (example simple model and high frequency model). The expressions, obtained using our approach, are compact and workable. The methodology suggested in this paper is illustrated with example and substantiated with results obtained from our symbolic analysis tool developed using MATLAB symbolic math toolbox.} } @inproceedings{gou-put-06-aa-static, author = {Goubault, Eric and Putot, Sylvie}, title = {Static Analysis of Numerical Algorithms}, booktitle = {Proc. International Static Analysis Symposium (SAS 2006)}, year = 2006, publisher = {Springer}, pages = {18--34}, isbn = {978-3-540-37758-0}, comment = {New method based on AA}, abstract = {We present a new numerical abstract domain for static analysis of the errors introduced by the approximation by floating-point arithmetic of real numbers computation, by abstract interpretation [3]. This work extends a former domain [4,8], with an implicitly relational domain for the approximation of the floating-point values of variables, based on affine arithmetic [2]. It allows us to analyze non trivial numerical computations, that no other abstract domain we know of can analyze with such precise results, such as linear recursive filters of different orders, Newton methods for solving non-linear equations, polynomial iterations, conjugate gradient algorithms.} } @inproceedings{sho-son-she-mar-wan-06-aa-raytr, title = {A Recursive {Taylor} Method for Ray Casting Algebraic Surfaces}, author = {Huahao Shou and Wenhao Song and Jie Shen and Ralph Robert Martin and Guo-jin Wang}, booktitle = {Proc. International Conference on Computer Graphics {\&} Virtual Reality (CGVR 2006)}, location = {Las Vegas}, year = 2006, month = jun, pages = {196-202}, url = {https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.65.2267&rep=rep1&type=pdf}, Comment = {Claims that Taylor arith is better than AA}, abstract = {In this paper, we propose a recursive Taylor method for ray-casting algebraic surfaces. The performance of this approach is compared with four other candidate approaches to raycasting: using interval arithmetic on the power form, using interval arithmetic on centered forms, using affine arithmetic, and using modified affine arithmetic. Test results show that the recursive Taylor method compares favorably to the other methods. } } @inproceedings{gra-gri-bar-06-aa-semisym, author = {Grabowski, D. and Grimm, C. and Barke, E.}, title = {Semi-Symbolic Modeling and Simulation of Circuits and Systems}, booktitle = {2006 IEEE International Symposium on Circuits and Systems}, year = 2006, volume = {}, number = {}, pages = {986-989}, doi = {10.1109/ISCAS.2006.1692752}, issn = {2158-1525}, month = may, abstract = {Shrinking microelectronic circuits leads to increasing parameter variations. Verification by Monte Carlo and worst case analysis has a limited reliability or requires a very high number of simulation runs. In this paper we give an overview of the semi-symbolic simulation approach. Compared to Monte Carlo and worst case analysis, the semi-symbolic simulation needs only a single simulation run to compute all possible results for given stimuli and parameter variations. For semi-symbolic simulation we model parameter variations and tolerances by symbols. Then, we compute the transient analysis using affine arithmetic. As results of transient analysis we get the system quantities as affine expressions. The affine expressions describe the impact of the parameter variations to the quantities} } @misc{gay-coe-hur-06-aa-lib-cpp, author = {Olivier Gay and David Coeurjolly and Nathan J. Hurst}, title = {{Libaffa} - {C}$++$ Affine Arithmetic Library for {GNU}/{Linux}}, institution = {{\'E}cole Polithecnique F{\'e}d{\'e}rale de Lausanne}, url = {https://www.nongnu.org/libaffa/}, howpublished = {Project website}, year = 2006, month = jun, comment = {First released in 2003 as \texttt{libaa}, renamed \texttt{libaffa} in 2005-05.}, altkeys = {gay-03-libaa-cpp,gay-03-aa-lib-cpp} } @inbook{heu-gri-wal-06-aa-analog, author = {Heupke, Wilhelm and Grimm, Christoph and Waldschmidt, Klaus}, title = {Modeling Uncertainty in Nonlinear Analog Systems with Affine Arithmetic}, bookTitle = {Applications of Specification and Design Languages for SoCs: Selected papers from Forum on Specification {\&} Design Languages (FDL 2005)}, chapter = {9}, year = 2006, publisher = {Springer Netherlands}, address = {Dordrecht}, pages = {155--169}, isbn = {978-1-4020-4998-9}, doi = {10.1007/978-1-4020-4998-9_9}, comment = {Includes term reduction}, abstract = {This chapter describes a semisymbolic method for the analysis of mixed signal systems. Aimed at control and signal-processing applications, it delivers a superset of all reachable values. The method that relies on affine arithmetic is precise for linear systems, but in the case of nonlinear systems approximations are needed. As a new term is added for each approximation, the number of approximation terms increases during simulation and therefore slows down the simulation. This leads to a quadratic time complexity in the number of time steps. A method to avoid this and an example implementation based on SystemC analog and mixed signal (AMS) are presented. Efficiency and time complexity of the improved semisymbolic simulation are analyzed and discussed.} } @article{sho-lin-mar-wan-06-aa-implsurf, author = {Huahao Shou and Hongwei Lin and Ralph R. Martin and Guojin Wang}, title = {Modified Affine Arithmetic in Tensor Form for Trivariate Polynomial Evaluation and Algebraic Surface Plotting}, journal = {Journal of Computational and Applied Mathematics}, volume = {195}, number = {1}, pages = {155-171}, year = 2006, note = {Special Issue: The International Symposium on Computing and Information (ISCI2004)}, issn = {0377-0427}, doi = {10.1016/j.cam.2005.08.003}, keywords = {Interval arithmetic, Affine arithmetic, Algebraic surfaces}, comment = {Modified AA. Implicit surface plotting}, abstract = {This paper extends the modified affine arithmetic in matrix form method for bivariate polynomial evaluation and algebraic curve plotting in 2D to modified affine arithmetic in tensor form for trivariate polynomial evaluation and algebraic surface plotting in 3D. Experimental comparison shows that modified affine arithmetic in tensor form is not only more accurate but also much faster than standard affine arithmetic when evaluating trivariate polynomials.} } @misc{sho-lin-mar-wan-06-aa-impldraft, author = {Huahao Shou and Hongwei Lin and Ralph Martin and Guojin Wang}, title = {Modified Affine Arithmetic in Tensor Form}, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.353.4398&rep=rep1&type=pdf}, howpublished = {Preprint available.}, yar = {2006?}, comment = {Apparently draft of~\cite{sho-lin-mar-wan-06-aa-implsurf}}, abstract = {This paper extends the modified affine arithmetic in matrix form method for bivariate polynomial evaluation and algebraic curve plotting in 2D to modified affine arithmetic in tensor form for trivariate polynomial evaluation and algebraic surface plotting in 3D. Experimental comparison shows that modified affine arithmetic in tensor form is not only more accurate but also much faster than affine arithmetic when evaluating trivariate polynomials.}, } @article{mes-tou-06-aa-quadr, author = {Messine, F. and Touhami, A.}, title = {A General Reliable Quadratic Form: {An} Extension of Affine Arithmetic}, journal = {Reliable Computing}, volum = {12}, pages = {171--192}, year = 2006, doi = {10.1007/s11155-006-7217-4}, comment = {Degree 2 extension of AA. Use in optimization.}, abstract = {In this article, a new extension of affine arithmetic is introduced. This technique is based on a quadratic form named general quadratic form. We focus here on the computation of reliable bounds of a function over a hypercube by using this new tool. Some properties of first quadratic functions and then polynomial ones are reported. In order to show the efficiency of such a method, ten polynomial global optimization problems are presented and solved by using an interval branch-and-bound based algorithm.} } @misc{agr-06-integr-m, author = {Amit Agrawal}, title = {{Matlab}/{Octave} code for Robust Surface Reconstruction from 2D Gradient Fields}, url = {http://www.umiacs.umd.edu/~aagrawal/software.html}, howpublished = {ONline document. Accessed on 2010-05-01}, note = {See~\cite{agr-ras-che-06-whrange}}, year = 2006 } @inproceedings{agr-ras-che-06-whrange, author = {Amit Agrawal and Ramesh Raskar and Rama Chellappa}, title = {What is the Range of Surface Reconstructions from a gradient field }, booktitle = {Proc. 9th European Conference on Computer Vision (ECCV)}, location = {Graz, Austria}, month = may, year = 2006, series = {Lecture Notes in Computer Science}, volume = {3951}, doi = {10.1007/11744023}, pages = {578--591}, publisher = {Springer}, comment = {Describes the generic Poisson-based integration with weights, and several special cases, some old and some new. Claims that Frankot-Chellappa and shapelets are special cases too (I disagree). The truly Poisson methods are unit-weight Poisson, $\alpha$-surface, M-estimators, Regularization (which seems mathematically incorrect), and Diffusion. In M-estimators and Regularization, the goal is to minimize a non-quadratic functions; uses iterative weight adjustment to reduce the nonquadratic problem to a quadratic one. The Diffusion method uses non-isotropic Laplacian and divergent estimators.} } @inproceedings{fra-han-06-combint, title = {Combinatorial Surface Integration}, author = {Roberto Fraile and Edwin R. Hancock}, booktitle = {Proc. 18th International Conference on Pattern Recognition (ICPR'06) Volume 1}, doi = {10.1109/ICPR.2006.379}, year = 2006, pages = {59--62} } @book{smi-01-surinsp-bk, author = {Melvyn L. Smith}, title = {Surface Inspection Techniques - Using the Integration of Innovative Machine Vision and Graphical Modelling Techniques}, publisher = {Wiley}, isbn = {978-1860582929}, pages = {198}, year = 2001, comment = {Also listed as 2010, 256 pages, but same ISBN. Second edition?}, altkeys = {smi-09-surinsp-bk} } @inproceedings{mal-wil-gel-amb-06-enhanrt, title = {Surface Enhancement Using Real-time Photometric Stereo and Reflectance Transformation}, author = {Tom Malzbender and Bennett Wilburn and Dan Gelb and Bill Ambrisco}, booktitle = {Proc. 2006 European Symposium on Rendering}, year = 2006, pages = {245--250}, location = {Nicosia, Cyprus}, month = jun } @inproceedings{and-ind-06-lshnn, author = {Alexandr Andoni and Piotr Indyk}, title = {Near-Optimal Hashing Algorithms for Near Neighbor Problem in High Dimensions}, booktitle = {Proc.~47th IEEE Annual Symposium on Foundations of Computer Science (FOCS)}, pages = {459--468}, year = 2006 } @inproceedings{kon-xu-teo-06-uncal, author = {Hui Kong and Pengfei Xu and Eam Khwang Teoh}, title = {Binocular Uncalibrated Photometric Stereo}, booktitle = {Proceedings of the 3rd International Symposium on Visual Computing (ISVC06)}, series = {Lecture Notes in Computer Science}, number = {4291}, pages = {283--292}, year = 2006 } @article{hap-06-holcnst, author = {Robert Happelberg}, title = {85: {The} Hollywood Constant}, journal = {Bob's Poetry Magazine}, url = {http://www.bobspoetry.com/}, note = {Electronic magazine, last acessed on 2007/05/25}, volume = {III}, number = {6}, pages = {15--20}, year = 2006, month = jun, comment = {Makes his own movie list for 1--84. He chooses maximally boring titles like \emph{Two} instead of maximally funny like {Dona Flor e Seus Dois Maridos}. However he does mention my web article [sto-04-holcnst]. He observes that there is a Bulgarian movie called \emph{85} which came out in 2005. (But it's actually only a short!)} } @techreport{cho-li-ron-wan-cam-06-mindirconvpol, author = {Y.-K. Choi and X. Li and F. Rong and W. Wang and S. Cameron}, title = {Computing the Minimum Directional Distance Between Two Convex Polyhedra}, institution = {Department of Computer Science, University of Hong Kong}, number = {2006-01}, year = 2006, url = {http://www.csis.hku.hk/research/techreps/document/TR-2006-01.pdf}, comment = {Also available on citeseer, file 746416.html} } @inproceedings{zhu-zho-zha-hu-06-frag, author = {Liang-Jia Zhu and Zong-Tan Zhou and, Jing-Wei Zhang and De-Wen Hu}, title = {A Partial Curve Matching Method for Automatic Reassembly of {2D} Fragments}, booktitle = {Intelligent Computing in Signal Processing and Pattern Recognition}, series = {Lecture Notes in Control and Information Sciences}, number = {345}, pages = {645--650}, year = 2006, issn = {0170-8643}, abstract = {An important step in automatic reassembly of 2D fragments is to find candidate matching pairs for adjacent fragments. In this paper, we propose a new partial curve matching method to find the candidate matches. In this method, the fragment contours are represented by their turning functions. The matching segments between two fragment contours are found by analyzing the difference curve between two turning functions directly. The performance of our method is illustrated with randomly shredded document fragments.} } @article{hua-flo-gel-hof-pot-06-regema, author = {Qi-Xing Huan and Simon Florey and Natash Gelfand and Michael Hofer and Helmut Pottmann}, title = {Reassembling Fractured Objects by Geometric Matching}, journal = {{ACM} Transactions on Graphics}, volume = {25}, number = {3}, pages = {569--578}, year = 2006, month = jul, issn = {0730-0301}, abstract = {We present a system for automatic reassembly of broken 3D solids. Given as input 3D digital models of the broken fragments, we analyze the geometry of the fracture surfaces to find a globally consistent reconstruction of the original object. Our reconstruction pipeline consists of a graph-cuts based segmentation algorithm for identifying potential fracture surfaces, feature-based robust global registration for pairwise matching of fragments, and simultaneous constrained local registration of multiple fragments. We develop several new techniques in the area of geometry processing, including the novel integral invariants for computing multi-scale surface characteristics, registration based on forward search techniques and surface consistency, and a non-penetrating iterated closest point algorithm. We illustrate the performance of our algorithms on a number of real-world examples.} } @inproceedings{yup-hay-06-aa-bitwd, author = {Pu, Yu and Ha, Yajun}, title = {An Automated, Efficient and Static Bit-Width Optimization Methodology towards Maximum Bit-Width-to-Error Tradeoff with Affine Arithmetic Model}, booktitle = {Proc. of the 2006 Asia and South Pacific Design Automation Conference (ASP-DAC '06)}, year = 2006, publisher = {IEEE Press}, pages = {886--891}, numpages = {6}, location = {Yokohama, Japan}, doi = {10.1145/1118299.1118500}, abstract = {Ideally, bit-width analysis methods should be able to find the most appropriate bit-widths to achieve the optimum bit-width-to-error tradeoff for variables and constants in high level DSP algorithms when they are implemented into hardware. The tradeoff enables the fixed-point hardware implementation to be area efficient but still within the allowed error tolerance. Unfortunately, almost all the existing static bit-width analysis methods are Interval Arithmetic (IA) based that may overestimate bit-widths and enable fairly pessimistic bit-width-to-error tradeoff. We have developed an automated and efficient bit-width optimization methodology that is Affine Arithmetic (AA) based. Experiments have proven that, compared to the previous static analysis methods, our methodology not only dramatically reduces the fractional bit-width by more than 35{\%} but also slightly reduces the integer bit-width. In addition, our probabilistic error analysis method further enlarges the bit-width-to-error tradeoff.} } %%% 2005 %%%%%%%%%%%%%%%%%%% @misc{mic-fou-lam-men-05-aa-berns, author = {Dominique Michelucci and Sebti Foufou and Lo{\"\i}c Lamarque and David M{\'e}negaux}, title = {{Bernstein} Based Arithmetic Featuring {de} {Casteljau}}, year = 2005, url = {https://www.researchgate.net/publication/220991064_Bernstein_based_arithmetic_featuring_de_Casteljau}, howpublished = {Online document.}, comment = {Compares AA with Bernstein basis for drawing implicit polynomial curves}, abstract = {Bernstein based interval analysis permits to trace algebraic curves and surfaces. In this paper, we propose touse the classical de Casteljau algorithm to improve the efficiency of the Bernstein based method. The proposed tracing method gives significant results with functions of high degree. These results are illustrated and compared with other interval analysis approaches.} } @article{akh-05-aa-gauss, author = {Ramil R. Akhmerov}, title = {Interval-Affine {Gaussian} Algorithm for Constrained Systems}, journal = {Reliable Computing}, volume = {11}, pages = {323--341}, year = 2005, doi = {10.1007/s11155-005-0040-5}, comment = {Solving linear systems with AA}, abstract = {The paper presents interval-affine Gaussian algorithm for the interval linear systems $Ax = b$ subject to some constraints on real matrices $A$ from the interval matrix $A$. The interval-affine method is based on the so-called interval-affine arithmetic that allows to take the constraints into account during the computation of interval enclosures of the united solution set of the system $Ax = b$, and to make the estimates more accurate.} } @inproceedings{kan-ois-05-aa-exodesol, booktitle = {Proc. International Symposium on Nonlinear Theory and its Applications}, author = {Yuchi Kanzawa and {Shin'ichi} Oishi}, title = {Numerical Method of Proving Existence of Periodic Solution for Nonlinear {ODE} using Affine Arithmetic and Green's Function Expression}, year = 2005, pages = {753-756}, month = oct, issn = {2188-5079}, doi = {10.34385/proc.40.2-1-4-6}, comment = {Using AA to prove existence of solution?}, abstract = {In this paper, a method is proposed to prove the existence of solutions for nonlinear ordinary equations on an essentially bounded functional space. For that, Affine Arithmetic extended to the functional space. Green's Function Expression is also used to prevent from overestimating integral arithmetic with Affine Arithmetic.} } @inproceedings{zou-zha-cai-zho-hon-05-aa-timing, author = {Yi Zou and Mengsheng Zhang and Yici Cai and Qiang Zhou and Xianlong Hong}, title = {Minimum Error Based Affine Arithmetic for Variational Timing Analysis}, booktitle = {6th International Conference on ASIC}, year = 2005, volume = {2}, number = {}, pages = {978-981}, doi = {10.1109/ICASIC.2005.1611491}, issn = {2162-755X}, month = oct, comment = {Aplication to timing analysis of electronic circuits. Improved AA, improved mul}, abstract = {In this paper, we describes a novel improvement for affine arithmetic which is widely used in statistical timing analysis and circuit simulation. The representation and calculation method for affine arithmetic is both simple and accurate comparing with previous works. The rule for calculating interval multiplication is simple and effective. It can both give a conservative bound and a minimum error affine approximation at the same time. An application for variational timing analysis demonstrated the usefulness of affine arithmetic} } @inproceedings{miy-kas-05-aa-maxmin, author = {Miyajima, Shinya and Kashiwagi, Masahide}, title = {A Method Which Finds the Maxima and Minima of a Multivariable Function Applying Affine Arithmetic}, booktitle = {Proc. International Conference on Numerical Analysis and Its Applications (NAA 2004)}, year = 2005, publisher = {Springer}, pages = {424--431}, isbn = {978-3-540-31852-1}, comment = {Branch and bound, but with some improvements}, abstract = {A new method is proposed for finding all maxima and minima of a multivariable function $f$ in a box $X^0$. In this method, the maxima and the minima are calculated by dividing $X^0$ into subregions recursively and bounding the ranges of $f$ in the each subregion applying affine arithmetic and discarding the subregions which don't possess the possibility of including the point that the maximum (minimum) value occurs. Moreover, to discard more subregions in initial stage, i.e. to speed the new method, two algorithms are introduced. And to show the efficiency of the new method, some numerical examples are implemented.} } @techreport{gam-mad-05-aa-rayproc, author = {Manuel N. Gamito and Steve C. Maddock}, title = {Ray Casting Implicit Procedural Noises with Reduced Affine Arithmetic}, institution = {University of Sheffield}, number = {CS--05--04}, year = 2005, month = apr, comment = {Reduced AA. Application to ray tracing}, abstract = {A method for ray casting implicit surfaces, defined with procedural noise models, is presented. The method is robust in that it is able to guarantee correct intersections at all image pixels and for all types of implicit surfaces. This robustness comes from the use of an affine arithmetic representation for the quantity that expresses the variation of the implicit function along a ray. Affine arithmetic provides a bounding interval estimate which is tighter than the interval estimates returned by conventional interval arithmetic. Our ray casting method is also efficient due to a proposed modification in the data structure used to hold affine arithmetic quantities. This modified data structure ultimately leads to a reduced affine arithmetic model. We show that such a reduced affine arithmetic model is able to retain all the tight estimation capabilities of standard affine arithmetic, in the context of ray casting implicit procedural noises, while being faster to compute and more efficient to store. We also show that, without this reduced model, affine arithmetic would not have any advantage over the more conventional interval arithmetic for ray casting the class of implicit procedural surfaces that we are interested in visualizing.} } @inproceedings{jam-acu-05-aa-neural, author = {Marcela Jamett and Gonzalo Acu{\~n}a}, title = {Comparative Assessment of Interval and Affine Arithmetic in Neural Network State Prediction}, booktitle = {Advances in Neural Networks: Proc. International Symposium on Neural Networks}, pages = {448-453}, year = 2005, series = {Lecture Notes in Computer Science}, volume = {3497}, doi = {10.1007/11427445_73}, comment = {Compares IA and AA in predicting output of neural networks}, abstract = {Two set theory methods, Interval and Affine Arithmetic, are used together with feedforward neural networks (FNN) in order to study their ability to perform state prediction in non-linear systems. Some fundamental theory showing the basic interval and affine arithmetic operations necessary to forward propagate through a FNN is presented and an application to a generic biotechnological process is performed confirming that due to the way the perturbations of the input data are considered, affine FNN perform better than interval ones.} } @mastersthesis{cho-05-aa-thesis, title = {Affine Arithmetic-Type Techniques for Handling Uncertainty in Expert Systems}, author = {Chopra, Sanjeev}, school = {University of Texas at El Paso}, year = 2005, month = dec, comment = {See~\cite{ceb-kre-cho-lon-ngu-lud-bar-07-aa-expert}}, abstract = {Expert knowledge consists of statements $S_j$: facts and rules. The expert's degree of confidence in each statement $S_j$ can be described as a (subjective) probability. For example, if we are interested in oil; we should look at seismic data (confidence 90{\%}); a bank $A$ trusts a client $B$, so if we trust $A$, we should trust $B$ too (confidence 99{\%}). If a query $Q$ is deducible from facts and rules, what is our confidence $P(Q)$ in $Q$? We can describe $Q$ as a propositional formula $F$ in terms of $S_j$; computing $P(Q)$ exactly is NP-hard, so heuristics are needed. Traditionally, expert systems use technique similar to straightforward interval computations: we parse $F$ and replace each computation step with corresponding probability operation. The problem with this approach is that at each step, we ignore the dependence between the intermediate results $F_j$; hence intervals are too wide. For example, the estimate for $P(A\vee \neg A)$ is not 1. In this thesis, we propose a new solution to this problem; similarly to affine arithmetic, besides $P(F_j)$, we also compute $P(F_j \wedge F_i)$ (or $P(F_{j1} \wedge\cdots\wedge F_{jk})$), and on each step, use all combinations of $\ell$ such probabilities to get new estimates. As a result, for the above stated e.g., $P(A\vee \neg A)$ is estimated as 1.} } @article{gri-heu-wal-05-aa-control, author = {Grimm, C. and Heupke, W. and Waldschmidt, K.}, title = {Analysis of Mixed-Signal Systems with Affine Arithmetic}, journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}, year = 2005, volume = {24}, number = {1}, pages = {118-123}, doi = {10.1109/TCAD.2004.839469}, comment = {Application to general signal processing and systems control}, abstract = {This paper describes methods and a framework for the refinement and analysis of control and signal processing systems. The design starts with an executable specification and its allowed deviations. Refinement steps introduce models of analog or digital implementations, and augment the "ideal" behavior with different sources of uncertainty, such as noise or production tolerances. The framework verifies and analyzes the influence of these uncertainties on system properties using affine arithmetic.} } @inproceedings{lee-gaf-men-luk-05-aa-bitwidth, author = {Lee, Dong-U and Gaffar, Altaf Abdul and Mencer, Oskar and Luk, Wayne}, title = {{MiniBit}: {Bit}-Width Optimization via Affine Arithmetic}, pages = {837--840}, year = 2005, doi = {10.1145/1065579.1065799}, abstract = {MiniBit, our automated approach for optimizing bit-widths of fixed-point designs is based on static analysis via affine arithmetic. We describe methods to minimize both the integer and fraction parts of fixed-point signals with the aim of minimizing circuit area. Our range analysis technique identifies the number of integer bits required. For precision analysis, we employ a semi-analytical approach with analytical error models in conjunction with adaptive simulated annealing to find the optimum number of fraction bits. Improvements for a given design reduce area and latency by up to 20{\%} and 12{\%} respectively, over optimum uniform fraction bit-widths on a Xilinx Virtex-4 FPGA.}, booktitle = {Proceedings of the 42nd Annual Design Automation Conference (DAC'05)}, publisher = {Association for Computing Machinery}, isbn = {1595930582}, keywords = {FPGA, simulated, bit-width, annealing, affine arithmetic, fixed-point}, location = {Anaheim, California, USA} } @article{smi-smi-05-dynps, author = {M. L. Smith and L. N. Smith}, title = {Dynamic Photometric Stereo - A New Technique for Moving Surface Analysis}, journal = {Image and Vision Computing}, volume = {23}, pages = {841--852}, year = 2005 } @article{smi-smi-05-calib, author = {L. N. Smith and M. L. Smith}, title = {Automatic Machine Vision Calibration using Statistical and Neural Network Methods}, journal = {Image and Vision Computing}, volume = {23}, pages = {887--899}, year = 2005 } @article{lee-smi-smi-mid-05-polston, author = {J. R. J. Lee and M. L. Smith and L. N. Smith and P. S. Midha}, title = {Robust and Efficient Automated Detection of Tooling Defects in Polished Stone}, journal = {Computers in Industry}, volume = {56}, pages = {787--801}, year = 2005 } @article{far-smi-smi-mid-05-tiles, author = {A. R. Farooq and M. L. Smith and L. N. Smith and P. S. Midha}, title = {Dynamic Photometric Stereo for On Line Quality Control of Ceramic Tiles}, journal = {Computers in Industry - Special Edition on Machine Vision}, volume = {56}, pages = {918--934}, year = 2005 } @inproceedings{agr-che-ras-05-algrec, title = {An Algebraic Approach to Surface Reconstruction from Gradient Fields}, author = {Amit Agrawal and Rama Chellappa and Ramesh Raskar}, booktitle = {Proc. 2005 International Conference on Computer Vision (ICCV)}, year = 2005, pages = {174--181}, doi = {10.1109/CVPRW.2009.5206603}, comment = {Discusses the reconstructibility, curl, projection on curl-free space. Defines the alpha-surface method (although not with that name). Poor results.} } @article{kel-han-05-graphsp, author = {Antonio Robles-Kelly and Edwin R. Hancock}, title = {A Graph-Spectral Method for Surface Height Recovery}, journal = {Pattern Recognition}, volume = {38}, number = {8}, pages = {1167--1186}, year = 2005 } @article{smi-smi-05-autocal, author = {Lyndon N. Smith and Melvyn L. Smith}, title = {Automatic Machine Vision Calibration using Statistical and Neural Network Methods}, journal = {Image and Vision Computing}, volume = {23}, number = {10}, year = 2005, pages = {887--899} } @article{smi-smi-05-dynphs-j, author = {Melvyn L. Smith and Lyndon N. Smith}, title = {Dynamic Photometric Stereo - {A} New Technique for Moving Surface Analysis}, journal = {Image and Vision Computing}, volume = {23}, number = {9}, year = 2005, pages = {841--852} } @inproceedings{smi-smi-05-dynphs-cf, author = {Melvyn L. Smith and Lyndon N. Smith}, title = {Dynamic Photometric Stereo}, booktitle = {Proc.~ICIAP 2005 - 13th~International Conference on Image Analysis and Processing}, year = 2005, pages = {826--833} } @inproceedings{smi-smi-05-vplsm, author = {Lyndon N. Smith and Melvyn L. Smith}, title = {The Virtual Point Light Source Model the Practical Realisation of Photometric Stereo for Dynamic Surface Inspection}, booktitle = {Proc.~ICIAP 2005 - 13th~International Conference on Image Analysis and Processing}, year = 2005, pages = {495--502} } @inproceedings{she-mac-tak-05-effp, author = {Li Shen and Takashi Machida and Haruo Takemura}, title = {Efficient Photometric Stereo for Three-Dimensional Surfaces with Unknown {BRDF}}, booktitle = {Proceedings of the 5th International Conference on 3-D Digital Imaging and Modeling (3DIM'05)}, pages = {326--333}, year = 2005 } @misc{ima-05-stpch, author = {Imatest Corporation}, title = {Imatest Documentation: {Using} Stepchart}, url = {http://www.imatest.com/docs/q13.html}, howpublished = {Electronic document, last accessed on 2006/05/14}, year = 2005 } @inproceedings{drb-cha-05-optlt, author = {O. Drbohlav and M. J. Chantler}, title = {On Optimal Light Configurations in Photometric Stereo}, booktitle = {Proceedings International Conference on Computer Vision (ICCV 2005)}, pages = {1707--1712}, year = 2005, month = oct, altkeys = {drb-chan-05-optlt} } @article{her-sei-05-exbas, author = {Aaron Hertzmann and Steven M. Seitz}, title = {Example-Based Photometric Stereo: {Shape} Reconstruction with General, Varying {BRDFs}}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {27}, number = {8}, pages = {1254--1264}, year = 2005, month = aug, altkeys = {Hertz-2005,hertzmann-05} } @inproceedings{zho-lit-05-ndhash, author = {Lin Zhong and James J. Little}, title = {Photometric Stereo via Locality Sensitive High-Dimension Hashing}, booktitle = {Proceedings of the Second Canadian Conference on Computer and Robot Vision (CRV'05)}, pages = {104--111}, year = 2005, altkeys = {crv-05} } @article{alm-mel-gom-05-grpi, author = {Sheila M. Almeida and C{\'e}lia P. Mello and Anamaria Gomide}, title = {A Classe de Grafos {PI}.}, journal = {TEMA - Tend{\^e}ncias em Matem{\'a}tica Aplicada e Computacional}, volume = {6}, pages = {33--42}, year = 2005, publisher = {SBMAC}, issn = {1677966} } @techreport{sim-dam-lie-05-ndmap, author = {Simon, C. and Damiand, G. and Lienhardt, P.}, title = {{nD} Generalized Map Pyramids: {Three} Equivalent Representations}, institution = {SIC, Universit\'e de Poitiers}, number = {2005-03}, year = 2005, month = sep, altkeys = {SDL2005-818} } @techreport{ceb-kre-cho-lon-ngu-lud-bar-05-compsec-tr, title = {Interval-Type and Affine Arithmetic-Type Techniques for Handling Uncertainty in Expert Systems, with Applications to Geoinformatics and Computer Security}, author = {Martine C. Ceberio and Vladik Kreinovich and Sanjeev Chopra and Luc {Longpr{\'e}} and Hung T. Nguyen and Bertram Ludaescher and Chitta Baral}, year = 2005, month = aug, institution = {University of Texas at El Paso}, number = {UTEP-CS-04-37b}, note = {Short version published in the Proceedings of the 17th World Congress of the International Association for Mathematics and Computers in Simulation IMACS'2005, Paris, France, July 11-15, 2005; full paper~\cite{ceb-kre-cho-lon-ngu-lud-bar-07-aa-expert}. Updated version: UTEP-CS-04-37a, Original file: UTEP-CS-04-37.}, abstract = {Expert knowledge consists of statements $S_j$ (facts and rules). The expert's degree of confidence in each statement $S_j$ can be described as a (subjective) probability (some probabilities are known to be independent). Examples: if we are interested in oil, we should look at seismic data (confidence 90{\%}); a bank $A$ trusts a client $B$, so if we trust $A$, we should trust $B$ too (confidence 99{\%}). If a query Q is deducible from facts and rules, what is our confidence p(Q) in Q? We can describe Q as a propositional formula $F$ in terms of $S_j$; computing $P(Q)$ exactly is NP-hard, so heuristics are needed. Traditionally, expert systems use technique similar to straightforward interval computations: we parse $F$ and replace each computation step with corresponding probability operation. Problem: at each step, we ignore the dependence between the intermediate results $F_j$; hence intervals are too wide. Example: the estimate for $P(A\vee \neg A)$ is not 1. Solution: similarly to affine arithmetic, besides $P(F_j)$, we also compute $P(F_j \wedge F_i)$ (or $P(F_j \wedge ... \wedge F_k)$), and on each step, use all combinations of $l$ such probabilities to get new estimates. Results: e.g., $P(A\vee \neg A)$ is estimated as 1.} } %%% 2004 %%%%%%%%%%%%%%%%%%% @inproceedings{str-04-aa-dynam, author = {Str{\k{e}}k, T.}, title = {Influence of Uncertainties and Wrapping Effect Reduction in Linear Dynamical Systems by Affine Arithmetic}, booktitle = {Proc. XXI Symposium on Vibrations in Physical Systems}, year = 2004, volume = {21}, pages = {361--364}, location = {Pozna{\'n}-Kierz, Poland}, abstract = {} } @inproceedings{kol-pet-04-aa-raus, author = {Kolev, L. and Petrakieva, S.}, title = {Interval {Raus} Criterion for Stability Analysis of Linear Systems with Dependent Coefficients in the Characteristic Polynomial}, booktitle = {Proc 27th International Spring Seminar on Electronics Technology (ISSE 2004).}, year = 2004, volume = {1}, number = {}, pages = {130-135}, doi = {10.1109/ISSE.2004.1490392}, month = may, comment = {Modified AA for stability analysis}, abstract = {This paper addresses the stability analysis of linear continuous systems under interval uncertainties. An interval generalization of the known Raus criterion is suggested to estimate the stability of the system considered. It is based on obtaining the interval extensions of the elements of the Raus matrix which are nonlinear functions of independent system parameters. The case when these elements are independent intervals is considered. The interval extensions are also determined by using modified affine arithmetic. Two sufficient conditions on stability and instability of the linear system considered are obtained. A numerical example illustrating the applicability of the method suggested is solved at the end of the paper.} } @techreport{vux-sam-fal-04-aa-combine, author = {Vu, Xuan-Ha and Sam-Haroud, Djamila and Faltings, Boi V.}, title = {A Generic Scheme for Combining Multiple Inclusion Representations in Numerical Constraint Propagation}, institution = {Swiss Federal Intitute of Technology in Lausanne (EPFL)}, number = {IC/2004/39}, year = 2004, month = apr, comment = {Combines IA, AA, and linear programming}, abstract = {This paper proposes a novel generic scheme enabling the combination of multiple inclusion representations to propagate numerical constraints. The scheme allows bringing into the constraint propagation framework the strength of inclusion techniques coming from different areas such as interval arithmetic, affine arithmetic or mathematical programming. The scheme is based on the DAG representation of the constraint system. This enables devising fine-grained combination strategies involving any factorable constraint system. The paper presents several possible combination strategies for creating practical instances of the generic scheme. The experiments reported on a particular instance using interval propagation, interval arithmetic, affine arithmetic and linear programming illustrate the flexibility and efficiency of the approach.} } @inproceedings{gri-heu-wal-04-aa-semisym, author = {Ch. Grimm and W. Heupke and K. Waldschmidt}, title = {Semi-Symbolic Modeling and Analysis of Noise in Heterogeneous Systems}, booktitle = {Proc. Forum on Specification and Design Languages (FDL 2004)}, pages = {56-68}, location = {Lille, France}, publisher = {ECSI}, year = 2004, month = sep, abstract = {The article describes semi-symbolic methods for the analysis of control and signal processing systems, including static and dynamic uncertainties. This above mentioned semi-symbolic description of uncertainties is based upon affine arithmetic. A short introduction to affine arithmetic is given. As affine arithmetic is only able to describe static uncertainties, an extension for effects of dynamic uncertainties is described and its feasibility is demonstrated by an example that delivers the frequency dependent noise of an output stage of a delta-sigma converter.} } @phdthesis{miz-04-aa-nonex-thesis, author = {Mizuguchi, Yoshio}, title = {Evaluation of Removal Performance of Non-existence Region of Solution using Affine Arithmetic}, school = {Waseda University}, year = 2004, note = {In Japanese}, abstract = {[Google transtalion:] One of the methods for finding the solution of an equation such as a curve or a curved surface is to determine a region where a solution does not exist and remove the region. At this time, the interval arithmetic is used, but the interval arithmetic has a drawback that the obtained interval width is often extremely wide, so that the determination performance is not always good. Affine Arithmetic proposed by Stolfi is a method of interval arithmetic, and by converting a given interval into a format called Affine format, it is possible to perform calculations considering the correlation between variables. Therefore, it is possible to suppress an increase in the section width as in the conventional case. This time, in order to evaluate the removal performance of the non-existent region of the solution, we decided to verify it by using a concrete example.} } @techreport{cha-vor-pue-hon-04-aa-fixpt, author = {Chang, Lawrence J. and Voronenko, Yevgen and Pueschel, Markus and Hong, Inpyo}, title = {Adaptive Mapping of Linear {DSP} Algorithms to Fixed-Point Arithmetic}, Institution = {Carnegie-Mellon UNiversity}, year = 2004, month = sep, pages = {25}, comment = {Uses AA to determine number of bits needed}, abstract = {Embedded DSP digital signal processing applications are typically implemented using fixed point arithmetic -- in hardware to reduce area requirements and increase throughput, but also in software since most embedded processors do not provide floating point arithmetic. Consequently, the developer is confronted with the difficult task of deciding on the fixed point format, i.e., the number of integer and fractional bits to avoid overflow and ensure sufficient accuracy. For software implementations, the entire bitwidth is fixed, typically at 32, which means that increasing the representable range number of integer bits reduces the available accuracy number of fractional bits and vice-versa. In this paper we present a compiler that translates a floating point C implementation of a linear DSP kernel, such as a discrete Fourier or wavelet transform, into a high accuracy fixed point C implementation. The inputs to the compiler are a floating point arithmetic C program and the range of the input vector elements. First, the compiler statically analyzes the program in a single pass using a recently developed tool that uses affine arithmetic modeling. Then, in the global mode, the compiler determines the global fixed point format with the least number of integer bits and thus the highest accuracy that guarantees to avoid overflow and outputs the corresponding code. More interesting is the local mode, in which the compiler determines the best format independently for each variable, thus further pushing the possible accuracy. The compiler is currently limited to straightline code an extension to loop code is in development.} } @techreport{ceb-krei-lon-saa-lud-bar-ngu-04-aa-compsec, title = {Affine Arithmetic-Type Techniques for Handling Uncertainty in Expert Systems, with Applications to Geoinformatics and Computer Security}, author = {Martine C. Ceberio and V. Kreinovich and L. Longpr{\'e} and E. Saad and B. Ludaescher and C. Baral and H. T. Nguyen}, institution = {University of Texas at El Paso}, year = 2004, note = {Withdrawn}, comment = {Apparently superseded by~\cite{ceb-kre-cho-lon-ngu-lud-bar-07-aa-expert}}, abstract = {Accepted to SCAN'2004.} } @article{ipp-vac-vil-04-aa-transf, author = {Lucio Ippolito and Alfredo Vaccaro and Domenico Villacci}, title = {The Use of Affine Arithmetic for Thermal State Estimation of Substation Distribution Transformers}, journal = {COMPEL - The International Journal for Computation and Mathematics in Electrical and Electronic Engineering}, publisher = {Emerald}, volume = {23}, number = {1}, issn = {0332-1649}, year = 2004, doi = {10.1108/03321640410507671}, altkeys = {ipp-vac-vil-20-aa-transf}, abstract = {Thermal protection of mineral-oil-filled substation distribution transformers is of critical importance in power systems. The failure of such a transformer is a matter of significant concern for electrical utilities, not only for the consequent severe economic losses, but also because the utility response to a customer during outage condition is one of the major factors in determining the overall customer attitude towards the utility. Therefore, it is essential to estimate the thermal state of transformers during load cycling and, in presence of overload conditions, to evaluate the need to reduce the load current or to install another transformer bay. A method of solving the transformer's thermal model, considering explicitly the source of uncertainty affecting its parameters, is required. In this paper, such an activity is developed by an interval-based approach, which provides the calculation of the inner and outer solution in the hot-spot temperature or top-oil temperature estimation process, keeping track of correlation between uncertain quantities.} } @inproceedings{lop-caf-car-nie-04-aa-cycles, author = {L{\'o}pez, J. A. and Caffarena, G. and Carreras, C. and Nieto-Taladriz, O.}, title = {Analysis of limit cycles by means of affine arithmetic computer-aided tests}, booktitle = {2004 12th European Signal Processing Conference}, location = {Vienna, Austria}, year = 2004, volume = {}, number = {}, pages = {991-994}, doi = {}, abstract = {Modern analysis of the finite word-length properties of DSP algorithms is typically carried out using CAD tools. The objectives of this paper are threefold: (i) to show that affine arithmetic is specially well-suited for quantization analysis of digital filters; (ii) to present a new tool based on multiple-precision affine arithmetic elements that allows fast characterization of the signal ranges in linear systems; and (iii) to develop an exhaustive-search algorithm that detects limit cycles and requires less computation time than existing approaches. Final comparative results confirm the validity of the limit cycles detection algorithm on second-order shift and delta-operator realizations.} } @article{miy-kas-04-aa-impdiv, title = {A Dividing Method Utilizing the Best Multiplication in Affine Arithmetic}, author = {Shinya Miyajima and Masahide Kashiwagi}, journal = {IEICE Electronics Express}, volume = {1}, number = {7}, pages = {176-181}, year = 2004, doi = {10.1587/elex.1.176}, comment = {Improves division by using an improved multiplication.}, abstract = {Affine arithmetic (AA) is a variant of interval arithmetic. In AA, it is difficult to realize the efficient nonlinear binomial operations. The purpose of this paper is to propose a new dividing method which consists of a reciprocal and the best multiplication. And the performances of the new method and the conventional method are compared through some numerical examples.} } @inproceedings{gri-heu-wal-04-aa-refsig, author = {Grimm, Ch. and Heupke, W. and Waldschmidt, K.}, booktitle = {Proceedings Design, Automation and Test in Europe Conference and Exhibition}, title = {Refinement of mixed-signals systems with affine arithmetic}, year = 2004, volume = {1}, number = {}, pages = {372-377 Vol.1}, doi = {10.1109/DATE.2004.1268875}, comment = {AA for general signal processing and systems control}, abstract = {This paper describes a framework for the refinement of control and signal processing functions. The design starts with an executable specification, and allowed deviations thereof. Refinement steps introduce models of analog or digital implementations, and augment the 'ideal' behavior with different sources of uncertainty. The framework verifies and analyzes the influence of these uncertainties on system properties using affine arithmetic.} } @article{pic-vac-vil-04-aa-thermpow, author = {Antonio Piccolo and Alfredo Vaccaro and Domenico Villacci}, title = {Thermal Rating Assessment of Overhead Lines by Affine Arithmetic}, journal = {Electric Power Systems Research}, volume = {71}, number = {3}, pages = {275-283}, year = 2004, doi = {10.1016/j.epsr.2004.01.018}, abstract = {The increasing complexity of transmission networks can raise significantly the load flows during and following serious system disturbances. In this context accurate thermal rating assessment of overhead lines represents an essential requirement in order to obtain a sensible increase of the infrastructure exploitation assuring at the same time a reliable functioning of the power networks. This necessitates reliable calculation models which should be able to predict the thermal behaviour on short and long time horizons and in the presence of data uncertainties deriving from several sources such as non stationary load and fluctuating operating conditions. To address this problem, in the paper the use of Affine Arithmetic, an enhanced model for numerical computation, is proposed. Using AA, the thermal rating solution is computed taking into account the model parameter uncertainty interdependencies as well as the diversity of uncertainty sources. Simulation studies are presented and discussed in order to prove the effectiveness of the proposed methodology in addressing the problem of uncertainty analysis in both static and dynamic thermal rating assessment.} } @inproceedings{che-wan-wan-04-pyrint, author = {Yufeng Chen and Haitao Wang and Yangsheng Wang}, title = {Pyramid Surface Reconstruction from Normal}, booktitle = {Proc.~3rd IEEE International Conference on Image and Graphics (ICIG)}, location = {Hong Kong}, year = 2004, doi = {10.1109/ICIG.2004.115}, pages = {464--467}, altkeys = {che-wan-wan-06-pyrint}, comment = {Uses recursive image reduction and iteration to integrate a slope field. Very close to our multiscale integrator except that uses subsampling and does not admit weights, so results are poor.} } @incollection{smi-smi-04-pstone, author = {M. L. Smith and L. N. Smith}, title = {Polished Stone Surface Inspection using Machine Vision}, booktitle = {Complementary Technologies for Stone Processing}, publisher = {OSNET}, pages = {33}, editor = {P.S. Midha}, year = 2004 } @inproceedings{kel-han-04-manemb, author = {Antonio {Robles-Kelly} and Edwin R. Hancock}, title = {Surface Height Recovery from Surface Normals using Manifold Embedding}, booktitle = {Proc. 2004 International Conference on Image Processing (ICIP 2004)}, year = 2004, month = oct, location = {Singapore} } @inproceedings{kel-han-04-heatman, author = {Antonio Robles-Kelly and Edwin R. Hancock}, title = {Surface Height Recovery Using Heat Flow and Manifold Embedding}, booktitle = {Proc. 2nd International Symposium on 3D Data Processing, Visualization and Transmission (3DPVT)}, location = {Thessaloniki, Greece}, month = sep, doi = {10.1109/TDPVT.2004.1335405}, year = 2004, month = sep, pages = {860--867} } @article{kel-han-04-graph, author = {Antonio {Robles-Kelly} and Edwin R. Hancock}, title = {A Graph-Spectral Approach to Shape-From-Shading}, journal = {IEEE Trans. on Image Processing}, month = jul, volume = {13}, number = {7}, year = 2004, pages = {912--926} } @inproceedings{rob-han-04-htnorm, author = {Antonio {Robles-Kelly} and Edwin R. Hancock}, title = {Surface Height Recovery from Surface Normals Using Manifold Embedding}, booktitle = {Proceedings of the 2004 International Conference on Image Processing (ICIP)}, publisher = {IEEE}, location = {Singapore}, year = 2004 } @article{cho-che-04-recunc, author = {Amit K. Roy Chowdhury and Rama Chellappa}, title = {Face Reconstruction from Monocular Video using Uncertainty Analysis and a Generic Model}, journal = {Computer Vision and Image Understanding}, volume = {93}, number = {3}, pages = {221--244}, year = 2004, month = mar, altkeys = {kcc-2004} } @article{che-peh-04-dpdis, author = {Loong-Fah Cheong and Chin-Hwee Peh}, title = {Depth Distortion under Calibration Uncertainty}, journal = {Computer Vision and Image Understanding}, volume = {93}, number = {3}, pages = {221--244}, year = 2004, month = mar, altkeys = {fpe-2004} } @article{nea-sch-04-appor, author = {Marian Neamtu and Larry L. Schumaker}, title = {On the Approximation Order of Splines on Spherical Triangulations}, journal = {Advances in Computational Mathematics}, volume = {21}, pages = {3--20}, year = 2004, publisher = {Kluwer}, altkeys = {NS-aporder} } @inproceedings{men-fer-and-04-spbsp, author = {J. B. Mendes and C. D. Ferreira and M. V. A. Andrade}, title = {Localiza{\c{c}}{\~a}o Exata de Pontos em Mapas Esf{\'e}ricos Usando uma Adapta{\c{c}}{\~a}o da {\'A}rvore de Parti{\c{c}}{\~a}o Bin{\'a}ria do Espa{\c{c}}o}, booktitle = {Anais do VI Simp{\'o}sio Brasileiro de Geoinform{\'a}tica}, year = 2004 } @inproceedings{oli-lei-04-fing, author = {Marcelo de A. Oliveira and Neucimar J. Leite}, title = {Reconnection of Fingerprint Ridges Based on Morphological Operators and Multiscale Directional Information}, booktitle = {Proc.XVII Brazilian Symposium on Computer Graphics and Image Processing - SIBGRAPI 2004}, pages = {122--129}, year = 2004 } @inproceedings{ike-04-segrec, author = {Osamu Ikeda}, title = {Shape Reconstruction for Color Objects using Segmentation and Photometric Stereo}, booktitle = {Proceedings of ICIP 2004}, pages = {1365--1368}, year = 2004, altkeys = {icip-2004} } @book{ziv-04-pjal, author = {Nivio Ziviani}, title = {Projeto de Algoritmos}, pages = {552}, year = 2004, publisher = {Pioneira Thomson Learning}, address = {S{\~a}o Paulo}, isbn = {85-221-0390-9}, edition = {2nd} } @inproceedings{kam-sab-04-fragpz, author = {Martin {Kampel} and Robert {Sablatnig}}, title = {{3D} Puzzling of Archeological Fragments}, booktitle = {Proc. of 9th Computer Vision Winter Workshop}, location = {Piran, Slovenia}, editor = {Danijel Skocaj}, pages = {31--40}, year = 2004, publisher = {Slovenian Pattern Recognition Society}, comment = {Does what we should have done already...} } @misc{isi-04-hicit, author = {Institute for Scientific Information}, title = {Highly Cited Researchers}, url = {http://www.isihighlycited.com/}, howpublished = {Online database.}, year = 2004 } @article{ben-04-frg, author = {Carolina Benjamim}, title = {Em Dia: {Elos} do Passado}, journal = {Ci{\^e}ncia Hoje}, volume = {}, number = {203}, pages = {56--57}, year = 2004, month = apr, note = {Brazilian Popular Science magazine.}, comment = {About Stolfi and Helena's fragment reconstruction.}, altkeys = {ben-03-frg} } @article{rug-04-voyn-sciam, author = {Gordon Rugg}, title = {The Mystery of the {Voynich Manuscript}}, journal = {Scientific American}, volume = {291}, number = {1}, pages = {104--109}, year = 2004, month = jul, comment = {About the Voynich manuscript. Argues that it is gibberish, and mentions Jorge Stolfi as the discoverer of the three-way split (which is not correct).} } @article{rug-04-voyn-cryp, author = {Gordon Rugg}, title = {An Elegant Hoax? {A} Possible Solution to the Voynich Manuscript}, journal = {Cryptologia}, volume = {28}, number = {1}, year = 2004, month = jan, comment = {About the Voynich manuscript. Argues that it is gibberish, and mentions Jorge Stolfi as the discoverer of the three-way split.} } @article{cza-04-chaos, author = {J. Czajko}, title = {{Elie} {Cartan} and Pan-Geometry of Multispatial Hyperspace}, journal = {Chaos Solitons {\&} Fractals}, volume = {19}, number = {3}, pages = {479--502}, year = 2004, month = feb, note = {Cites~\cite{sto-91-opg}}, issn = {0960-0779} } @article{ned-kre-sta-04-aa-others, title = {Interval Arithmetic, Affine Arithmetic, {Taylor} Series Methods: {Why}, What Next?}, author = {Nedialko S. Nedialkov and Vladik Kreinovich and Scott A. Starks}, journal = {Numerical Algorithms}, volume = {37}, pages = {325--336}, year = 2004, abstract = {In interval computations, the range of each intermediate result $r$ is described by an interval $\mathbf{r}$. To decrease excess interval width, we can keep some information on how $r$ depends on the input $x=(x_1,...,x_n)$. 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.}, doi = {10.1023/B:NUMA.0000049478.42605.cf} } %%% 2003 %%%%%%%%%%%%%%%%%%% @article{miy-03-aa-about, author = {Takatomi Miyata}, title = {On Affine Arithmetic}, journal = {Journal of Japan Society for Fuzzy Theory and Intelligent Informatics}, volume = {15}, number = {2}, pages = {155-160}, year = 2003, doi = {10.3156/jsoft.15.155}, url = {https://www.jstage.jst.go.jp/article/jsoft/15/2/15_KJ00000798204/_article/-char/ja/}, note = {In Japanese}, comment = {No abstract?} } @inproceedings{fan-rut-che-03-aa-bitwd, author = {Fang, C.F. and Rutenbar, R.A. and Tsuhan Chen}, title = {Fast, Accurate Static Analysis for Fixed-Point Finite-Precision Effects in {DSP} Designs}, booktitle = {Proc. International Conference on Computer Aided Design (ICCAD-2003)}, year = 2003, volume = {}, number = {}, pages = {275-282}, doi = {10.1109/ICCAD.2003.159701}, month = nov, comment = {Accuracy of DSP systems with fixpoint math}, abstract = {Translating digital signal processing (DSP) software into its finite-precision hardware implementation is often a time-consuming task. We describe a new static analysis technique that can accurately analyze finite-precision effects arising from fixed-point implementations of DSP algorithms. The technique is based on recent interval representation methods from affine arithmetic, and the use of new probabilistic bounds. The resulting numerical error estimates are comparable to detailed statistical simulation, but achieve speedups of four to five orders of magnitude by avoiding actual bit-true simulation. We show error analysis results on both feed forward and feedback DSP kernels.} } @article{miy-03-aa-muldiv, author = {Miyajima, S.}, title = {On the Multiplicaton and the Division of the Affine Arithmetic}, journal = {IEICE Transactions on Fundamentals}, ISSN = {}, publisher = {}, year = 2003, volume = {J86-A}, number = {3}, pages = {232-240}, url = {https://ci.nii.ac.jp/naid/10011629913/en/}, abstract = {} } @inproceedings{heu-gri-wal-03-aa-mixsig, author = {Wilhelm Heupke and Christoph Grimm and Klaus Waldschmidt}, title = {A New Method for Modeling and Analysis of Accuracy and Tolerances in Mixed-Signal Systems}, booktitle = {Proc. Forum on specification and Design Languages (FDL 2003)}, location = {Frankfurt, Germany}, year = 2003, month = sep, pages = {82--90}, publisher = {ECSI}, url = {http://www.systemc-ams.org/documents/fdl2003_heupke.pdf}, abstract = {Tolerances are a very important property of a design. This paper presents a method for simulating tolerances in signal processing and control systems on the system level using affine arithmetic. The method is compard to simulation based on interval arithmetic or Monte-Carlo method and goes into details of the shortcomings of interval arithmetic. An introduction to affine arithmetic is given and the corresponding model of tolerances is described. The concept of the implementation is given and a case study of a control loop modeled on the system level is presented. This small system is simulated using affine arithmetic and is based on an early prototype of SystemC-AMS.} } @inproceedings{pic-vac-vil-03-aa-thermpow-conf, author = {Piccolo, A. and Vaccaro, A. and Villacci, D.}, title = {An Affine Arithmetic Based Methodology for the Thermal Rating Assessment of Overhead Lines in the Presence of Data Uncertainty}, booktitle = {2003 IEEE Bologna Power Tech Conference Proceedings}, year = 2003, volume = {4}, number = {}, pages = {7}, keywords = {}, doi = {10.1109/PTC.2003.1304743}, month = jun, comment = {See journal version~\cite{pic-vac-vil-04-aa-thermpow}}, abstract = {The increasing complexity of transmission networks can raise significantly the load flows during and following serious system disturbances. In this context accurate thermal rating assessment of overhead lines represents an essential requirement in order to obtain a sensible increase of the infrastructure exploitation assuring at the same time a reliable functioning of the power networks. This necessitates reliable calculation models which should be able to predict the thermal behaviour on short and long time horizons and in the presence of data uncertainties deriving from several sources such as nonstationary load and fluctuating operating conditions. To address this problem, in the paper the use of Affine Arithmetic, an enhanced model for numerical computation, is proposed. Using AA, the thermal rating solution is computed taking into account the model parameter uncertainty interdependencies as well as the diversity of uncertainty sources. Simulation studies are presented and discussed in order to prove the effectiveness of the proposed methodology in addressing the problem of uncertainty analysis in both static and dynamic thermal rating assessment.} } @article{miy-miy-kas-03-aa-newdiv, author = {Shinya Miyajima and Takatomi Miyata and Masahide Kashiwagi}, title = {A New Dividing Method in Affine Arithmetic}, journal = {IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences}, volume = {E86-A}, number = {9}, pages = {2192-2196}, year = 2003, month = sep, issn = {0916-8508}, comment = {Improved division algorithm}, abstract = {Affine arithmetic is a kind of interval arithmetic defined by Stolfi et al. In affine arithmetic, it is difficult to realize the efficient nonlinear binomial operations. The purpose of this letter is to propose a new dividing method which is able to supply more suitable evaluation than the old dividing method. And this letter also shows the efficiency of the new dividing method by numerical examples.} } @inproceedings{sho-lin-mar-wan-03-aa-modif, author = {Huaohao Shou and Hongwei Lin and Ralph Martin and Guojin Wang}, title = {Modified Affine Arithmetic Is More Accurate than Centered Interval Arithmetic or Affine Arithmetic}, booktitle = {Mathematics of Surfaces: Proc. 10th IMA International Conference}, location = {Leeds, UK}, publisher = {Springer}, series = {LNCS}, volume = {2768}, year = 2003, pages = {355-365}, doi = {10.1007/978-3-540-39422-8_23}, comment = {MAA is AA with an improved multiplication method}, abstract = {In this paper we give mathematical proofs of two new results relevant to evaluating algebraic functions over a box-shaped region: (i) using interval arithmetic in centered form is always more accurate than standard affine arithmetic, and (ii) modified affine arithmetic is always more accurate than interval arithmetic in centered form. Test results show that modified affine arithmetic is not only more accurate but also much faster than standard affine arithmetic. We thus suggest that modified affine arithmetic is the method of choice for evaluating algebraic functions, such as implicit surfaces, over a box.} } @article{far-smi-smi-mid-03-distr, author = {A. R. Farooq and M. L. Smith and L. N. Smith and P. S. Midha}, title = {An Analysis of the Effects of Distributed Light Sources for Surface Gradient Recovery using Reflectance Maps and Computer Simulation}, journal = {Journal for Manufacturing Science and Production}, volume = {5}, pages = {33--36}, year = 2003, altkeys = {far-smi-smi-mid-09-distr}, doi = {10.1515/IJMSP.2003.5.1-2.33} } @misc{smi-smi-03-infra-pat, author = {M. L. Smith and L. N. Smith}, title = {Infra-Red Photometric Stereo}, howpublished = {UK Patent WO03/012412A2. Filed July 2001, published on 13/02/2003}, year = 2003, altkeys = {smi-smi-09-infra-pat} } @misc{smi-smi-03-dimen-pat, author = {M. L. Smith and L. N. Smith}, title = {An Overhead Dimensioning System and Method}, howpublished = {UK Patent WO03/002935A1. Filed June 2001, published on 09/01/2003. Assigned to Square D Company}, year = 2003, altkeys = {smi-smi-09-dimen-pat} } @article{smi-smi-03-mnstone, author = {M. L. Smith and L. N. Smith}, title = {Machine Vision Inspection for Polished Stone Manufacture}, journal = {Key Engineering Materials}, volume = {250}, publisher = {Trans. Tech. Publishing}, pages = {131-137}, year = 2003, month = sep, doi = {10.4028/www.scientific.net/KEM.250.131}, altkeys = {smi-smi-09-mnstone} } @misc{lei-03-raabimg, author = {Helena Cristina da Gama Leit{\~a}o}, title = {Test images for the {RAAB} Project}, url = {http://www.ic.uff.br/~raab/figuras.html}, howpublished = {Electronic document, last accessed on ??/??/????}, year = 2003, altkeys = {lei-NN-raabimg,site-imagem} } @incollection{lin-man-03-colprox, author = {M. Lin and D. Manocha}, title = {Collision and Proximity Queries}, booktitle = {Handbook of Discrete and Computational Geometry}, publisher = {CRC Press}, year = 2003, url = {citeseer.ist.psu.edu/lin03collision.html} } @article{dom-gom-dia-03-wavqt, author = {M. O. Domingues and S. M. Gomes and L. M. A. Diaz}, title = {Adaptive Wavelet Representation and Differenciation on Block-Structured Grids}, journal = {Applied Numerical Mathematics}, volume = {47}, number = {3--4}, pages = {421--437}, year = 2003, publisher = {Elsevier} } @article{bar-pet-03-4src, author = {Svetlana Barsky and Maria Petrou}, title = {The 4-Source Photometric Stereo Technique for Three-Dimensional Surfaces in Presence of Highlights and Shadows}, journal = {IEEE Trans. on Pattern Analysis and Machine Intelligence}, volume = {25}, number = {10}, pages = {1239--1252}, year = 2003, month = oct, altkeys = {ieee-2003} } @inproceedings{her-sei-03-exbas, author = {Aaron Hertzmann and Steven M. Seitz}, title = {Shape and Materials by Example: {A} Photometric Stereo Approach}, booktitle = {Proceedings IEEE CVPR 2003}, volume = {1}, pages = {533--540}, year = 2003, month = jun, url = {citeseer.ist.psu.edu/article/hertzmann03shape.html}, abstract = {This paper presents a technique for computing the geometry of objects with general reflectance properties from images. For surfaces with varying material properties, a full segmentation into different material types is also computed. It is assumed that the camera viewpoint is fixed, but the illumination varies over the input sequence. It is also assumed that one or more example objects with similar materials and known geometry are imaged under the same illumination conditions. Unlike most previous work in shape reconstruction, this technique can handle objects with arbitrary and spatially-varying BRDFs. Furthermore, the approach works for arbitrary distant and unknown lighting environments. Finally, almost no calibration is needed, making the approach exceptionally simple to apply.}, altkeys = {hertzmann-03} } @article{gui-cou-ara-lei-03-segm, author = {Silvio J. F. Guimaraes and Michel Couprie and Arnaldo de A. Araujo and Neucimar J. Leite}, title = {Video Segmentation Based on {2D} Image Analysis}, journal = {Pattern Recognition Letters}, volume = {24}, number = {7}, pages = {947--2003}, year = 2003, month = apr } @inproceedings{kam-sab-03-prorec, author = {Martin Kampel and Robert Sablatnig}, title = {Profile-Based Pottery Reconstruction}, booktitle = {Proceedings of the IEEE/CVPR Workshop on Applications of Computer Vision in Archaeology (ACVA'03)}, pages = {}, year = 2003 } @inproceedings{mcb-kim-03-frag, author = {Jonah C. McBride and Benjamin B. Kimia}, title = {Archaeological Fragment Re-Assembly Using Curve-Matching}, booktitle = {Proceedings of the IEEE/CVPR Workshop on Applications of Computer Vision in Archaeology (ACVA'03)}, pages = {}, year = 2003 } @article{pap-kar-03-onfrag, author = {G. Papaioannou, E. A. Karabassi}, title = {On the Automatic Assemblage of Arbitrary Broken Solid Artefacts}, journal = {Image and Vision Computing}, volume = {21}, number = {5}, pages = {401--412}, year = 2003, comment = {Cites [lei-sto-00-bits] but not our matching papers.} } @inproceedings{pap-the-03-fafrag, author = {Georgios Papaioannou and Theoharis Theoharis}, title = {Fast Fragment Assemblage Using Boundary Line and Surface Matching}, booktitle = {Proceedings of the IEEE/CVPR Workshop on Applications of Computer Vision in Archaeology (ACVA'03)}, pages = {}, year = 2003, comment = {Cites [lei-sto-02-frag-j] but dismisses it. ``Fast'' in terms (example uses only a few fragments).} } @article{lop-03-frg, author = {Reinaldo J. Lopes}, title = {Software Remonta Cer{\^a}mica Arqueol{\'o}gica}, journal = {Folha de S{\~a}o Paulo}, volume = {}, number = {22/nov}, pages = {Folha Ci{\^e}ncia, A-14}, year = 2003, month = nov, note = {A major Brazilian daily newspaper.}, comment = {About Stolfi and Helena's fragment reconstruction.} } @inproceedings{wat-tan-abe-tak-kin-he-03-frg, author = {Yasuhiro Watanabe and Kazuaki Tanaka and Norihiro Abe and Hirokazu Taki and Yoshimasa Kinoshita and Shoujie He}, title = {Towards Automatic Restoration of Relics from Slice Image}, booktitle = {Proceedings of the 7th International Cultural Heritage Informatics Meeting (ICHIM'03)}, volume = {CD-ROM}, number = {Paper 071C}, pages = {1--17}, year = 2003, month = sep, url = {http://www.archimuse.com/publishing/ichim03/071C.pdf} } @article{kem-sab-03-asys, author = {M. Kempel and R. Sablatnig}, title = {An Automated Pottery Archival and Reconstruction System}, journal = {Journal of Visualization and Computer Animation}, volume = {14}, number = {3}, pages = {111--120}, year = 2003, month = jul, note = {Cites~\cite{lei-sto-02-frag-j}}, issn = {1049-8907} } @misc{gay-03-aa-lib-cpp-fr, author = {Olivier Gay}, title = {{Libaa} - Une Librairie {C}$++$ d' {\guillemotleft} Affine Arithmetic {\guillemotright}}, institution = {{\'E}cole Polithecnique F{\'e}d{\'e}rale de Lausanne}, url = {https://www.nongnu.org/libaffa/libaffa.pdf}, howpublished = {Online document}, year = 2003, month = feb, comment = {See project webpage~\cite{gay-coe-hur-06-aa-lib-cpp}} } @article{gol-vog-met-03-intg, author = {Siome Goldenstein and Christian Vogler and Dimitris Metaxas}, title = {Statistical Cue Integration in {DAG} Deformable Models}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, pages = {801--813}, year = 2003, month = jul } @misc{pre-03-xfarbe, author = {A. Preusser}, title = {{XFARBE} - {Fill} Area with Bicubics}, url = {http://www.fhi-berlin.mpg.de/grz/pub/xfarbe_doc.html}, howpublished = {Online document}, year = 2003, comment = {We used this software to generate a figure for the Affine Arithmetic monograph, illustrating level sets of a bivariate function.}, altkeys = {xfarbe} } @inproceedings{fan-che-rut-03-aa-fperr, author = {C. F. Fang and T. Chen and R. Rutenbar}, title = {Floating-point Error Analysis Based on Affine Arithmetic}, booktitle = {Proc. 2003 International Conf. on Acoustic, Speech and Signal Processing}, year = 2003, comment = {An application of Affine Arithmetic.}, doi = {10.1109/ICASSP.2003.1202428}, abstract = {During the development of floating-point signal processing systems, an efficient error analysis method is needed to guarantee the output quality. We present a novel approach to floating-point error bound analysis based on affine arithmetic. The proposed method not only provides a tighter bound than the conventional approach, but also is applicable to any arithmetic operation. The error estimation accuracy is evaluated across several different applications which cover linear operations, nonlinear operations, and feedback systems. The accuracy decreases with the depth of computation path and also is affected by the linearity of the floating-point operations.}, altkeys = {fan-che-rut-03-fperr} } @misc{fan-rut-che-03-aa-dspround-draft, title = {Efficient Static Analysis of Fixed-Point Error in {DSP}: {Applications} via Affine Arithmetic Modeling}, author = {Claire Fang Fang and Rob A. Rutenbar and Tsuhan Chen}, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.6.4363&rep=rep1&type=pdf}, howpublished = {Draft of article, online}, comment = {See also proceedings papers~\cite{fan-rut-pus-che-03-aa-dspround} and~\cite{fan-che-rut-03-aa-fperr}}, abstract = {Translating digital signal processing (DSP) software into its finite-precision hardware implementation is often a timeconsuming task. We describe a new static analysis technique that can accurately analyze finite-precision effects arising from fixed-point implementations of DSP algorithms. The technique is based on recent interval representation methods from affine arithmetic, and the use of new probabilistic bounds. The resulting numerical error estimates are comparable to detailed statistical simulation, but achieve speedups of four to five orders of magnitude by avoiding actual bittrue simulation. We show error analysis results on several common DSP kernels.} } @inproceedings{fan-rut-pus-che-03-aa-dspround, author = {Claire Fang Fang and Rrob A. Rutenbar and Markus Püschel and Tsuhan Chen}, title = {Toward efficient static analysis of finite-precision effects in DSP applications via affine arithmetic modeling}, booktitle = {Proc. 40th annual Design Automation Conference (DAC'03)}, year = 2003, comment = {An application of Affine Arithmetic.}, abstract = {We introduce a static error analysis technique, based on smart interval methods from affine arithmetic, to help designers translate DSP codes from full-precision floating-point to smaller finite-precision formats. The technique gives results for numerical error estimation comparable to detailed simulation, but achieves speedups of three orders of magnitude by avoiding actual bit-level simulation. We show results for experiments mapping common DSP transform algorithms to implementations using small custom floating point formats.}, doi = {10.1145/775832.775960} } @article{neu-03-tayuse, author = {Arnold Neumaier}, title = {{Taylor} Forms: {Use} and Limits}, journal = {Reliable Computing}, volume = {9}, number = {1}, pages = {43--79}, year = 2003, month = feb } %%% 2002 %%%%%%%%%%%%%%%%%%% @inproceedings{kan-ois-02-aa-ode, author = {Yuchi Kanazawa and {Shin'ichi} Oishi}, title = {A Numerical Method of Proving the Existence of Solutions for Nonlinear {ODEs} Using Affine Arithmetic}, booktitle = {Proc. 10th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN'02)}, year = 2002, month = sep, pages = {49--49}, } @article{mar-sho-voi-bow-wan-02-aa-compar, author = {Ralph Martin and Huahao Shou and Irina Voiculescu and Adrian Bowyer and Guojin Wang}, title = {Comparison of Interval Methods for Plotting Algebraic Curves}, journal = {Computer Aided Geometric Design}, volume = {19}, number = {7}, pages = {553-587}, year = 2002, issn = {0167-8396}, doi = {10.1016/S0167-8396(02)00146-2}, comment = {Concludes that AA and similar are more accurate than IA with Bernstein. But later reverses?}, abstract = {This paper compares the performance and efficiency of different function range interval methods for plotting f(x,y)=0 on a rectangular region based on a subdivision scheme, where f(x,y) is a polynomial. The solution of this problem has many applications in CAGD. The methods considered are interval arithmetic methods (using the power basis, Bernstein basis, Horner form and centred form), an affine arithmetic method, a Bernstein coefficient method, Taubin's method, Rivlin's method, Gopalsamy's method, and related methods which also take into account derivative information. Our experimental results show that the affine arithmetic method, interval arithmetic using the centred form, the Bernstein coefficient method, Taubin's method, Rivlin's method, and their related derivative methods have similar performance, and generally they are more accurate and efficient than Gopalsamy's method and interval arithmetic using the power basis, the Bernstein basis, and Horner form methods.} } @inbook{bow-mar-sho-voi-02-aa-csg, author = {Bowyer, Adrian and Martin, Ralph and Shou, Huahao and Voiculescu, Irina}, title = {Affine Intervals in a CSG Geometric Modeller}, bookTitle = {Uncertainty in Geometric Computations}, year = 2002, publisher = {Springer}, pages = {1--14}, chapter = {1}, isbn = {978-1-4615-0813-7}, doi = {10.1007/978-1-4615-0813-7_1}, url = {https://doi.org/10.1007/978-1-4615-0813-7_1}, comment = {Using AA in a CSG modeler}, abstract = {Our CSG modeller, svLis, uses interval arithmetic to categorize implicit functions representing primitive shapes against boxes; this allows an efficient implementation of recursive spatial division to localize the primitives for a variety of purposes, such as rendering or the computation of integral properties.} } @inbook{sho-mar-wan-voi-bow-02-aa-curve, author = {Shou, Huahao and Martin, Ralph and Wang, Guojin and Voiculescu, Irina and Bowyer, Adrian}, title = {Affine Arithmetic and {Bernstein} Hull Methods for Algebraic Curve Drawing}, bookTitle = {Uncertainty in Geometric Computations}, year = 2002, publisher = {Springer}, chapter = {12}, pages = {143--154}, isbn = {978-1-4615-0813-7}, doi = {10.1007/978-1-4615-0813-7_12}, comment = {Implicit \textbf{polynomial} curve drawing on the plane using AA; compares AA and Bernstein enclosure, finds that it is the same}, abstract = {We compare approaches to the location of the algebraic curve $f(x,y) = 0$ in a rectangular region of the plane, based on recursive use of conservative estimates of the range of the function over a rectangle. Previous work showed that performing interval arithmetic in the Bernstein basis is more accurate than using the power basis, and that affine arithmetic in the power basis is better than using interval arithmetic in the Bernstein basis. This paper shows that using affine arithmetic with the Bernstein basis gives no advantage over affine arithmetic with the power basis. It also considers the Bernstein coefficient method based on the convex hull property, which has similar performance to affine arithmetic.} } @inproceedings{smi-bor-02-htnorm, author = {Gavin D.J. Smith and Adrian G. Bors}, title = {Height Estimation from Vector Fields of Surface Normals}, booktitle = {Proc. 2002 IEEE International Conference on Digital Signal Processing (DSP'02)}, location = {Santorini, Greece}, year = 2002, pages = {1031--1034}, comment = {Uses an iterative local method, similar to Poisson but perhaps nonlinear. They are not aware that it takes forever to converge. Plots residual of normals and uses it as a convergence criterion, but fails to realize that it does not tell anything about the height residual. Moreover uses a cosine metric to show convergence but fails to notice that cosine 0.92 --- after 20.000 iterations --- means an error of 20 degrees. Probably the height map is miles (literally) avaw from convergence but they did not notice it because they did not compare with ground truth.} } @inproceedings{wei-kle-02-htgra, author = {Tiangong Wei and Reinhard Klette}, title = {Height from Gradient Using Surface Curvature and Area Constraints}, booktitle = {Proc.~3rd Indian Conference on Computer Vision, Graphics and Image Processing}, year = 2002, location = {Ahmedabad}, pages = {}, altkeys = {wei-02-htfrom,wei-02-heightfrom} } @article{ede-sti-02-hqsort, author = {Stefan Edelkamp and Patrick Stiegeler}, title = {Implementing {HEAPSORT} with $n \log n - 0.9n$ and {QUICKSORT} with $n \log n + 0.2n$ Comparisons}, journal = {The ACM Journal of Experimental Algorithmics}, volume = {7}, pages = {article 5}, year = 2002, url = {http://www.jea.acm.org/2002/EdelkampHeapsort/}, abstract = {With refinements to the weak-heap-sort algorithm we establish the general and practically relevant sequential sorting algorithm index-weak-heap-sort with exactly $n \lceil\log n\rceil - 2^{\lceil \log n\rceil} +1 \leq n \log n - 0.9 n$ comparisons and at most $n \log n + 0.1 n$ transpositions on any given input. It comprises an integer array of size $n$ and is best used to generate an index for the data set. With relaxed-weak-heap-sort and greedy-weak-heap-sort we discuss modifications for a smaller set of pending element transpositions. \par If extra space to create an index is not available, with quick-weak-heap-sort we propose an efficient quicksort variant with $n \log n + 0.2 n + o(n)$ comparisons on the average. Furthermore, we present data showing that weak-heap-sort, index-weak-heap-sort, and quick-weak-heap-sort compete with other performant quicksort and heapsort variants.} } @article{pap-kar-the-02-rfrag, author = {G. Papaioannou and E. A. Karabassi and T. Theoharis}, title = {Reconstruction of Three-dimensional Objects through Matching of their Parts}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {24}, number = {1}, pages = {114--124}, year = 2002, comment = {Does not cite any of our papers}, altkeys = {pap-kar-the-03-rfrag} } @article{boi-dev-pio-tei-yvn-02-trcgal, author = {J.-D. Boisonnat and O. Devillers and S. Pion and M. Teillaud and M. Yvinec}, title = {Triangulations in {CGAL}}, journal = {Computational Geometry}, volume = {22}, number = {1--3}, pages = {5--19}, year = 2002, altkeys = {boi-02-tricgal} } @article{kir-02-opg, author = {Kevin G. Kirby}, title = {Beyond the Celestial Sphere: {Oriented} Projective Geometry and Computer Graphics}, journal = {Mathematics Magazine}, volume = {75}, number = {5}, pages = {351--366}, year = 2002, month = dec, url = {http://links.jstor.org/sici?sici = 0025-570X\%28200212\%2975\%3A5\%3C351\%3ABTCSOP\%3E2.0.CO\%3B2-6}, abstract = {Software for computer graphics represents three-dimensional space a little differently than one might expect. Euclidean geometry is not quite right. The usual approach uses what is called \emph{projective geometry}, certainly one of the most beautiful systems in mathematics. Yet even with this approach, when the mathematics actually meets computer code there are some awkward inconveniences. Perhaps the best solution may be what is called \emph{oriented projective geometry}. This geometry was worked out in detail by Jorge Stolfi~[sto-87-opg,sto-91-opg] in 1987; it has also found more recent application in computer vision~[lav-fau-96-orivis]. [\dots]} } @article{lin-shi-hun-tan-02-phrec, author = {Chung-Yi Lin, Sheng-Wen Shih, Yi-Ping Hung and Gregory Y. Tang}, title = {A New Approach to Automatic Reconstruction of a {3-D} World Using Active Stereo Vision}, journal = {Computer Vision and Image Understanding}, volume = {85}, number = {2}, pages = {117--143}, year = 2002, month = feb, altkeys = {lin-shi-hun-yyy-02-phrec,lsy-2002} } @article{nei-02-voyn-ww, author = {Christoph Neidhart}, title = {Das Grosse {R{\"a}tselbuch}}, journal = {Die Weltwoche}, volume = {70}, number = {46}, year = 2002, month = nov, note = {(Swiss weekly magazine, in German)}, comment = {"The great puzzle book" About the Voynich manuscript, mentions Jorge Stolfi in connection with the Chinese Theory.} } @inproceedings{kur-var-02-elliptech-pr, author = {A. B. Kurzhanski and P. Varaiya}, title = {Reachability under Uncertainty}, booktitle = {Proc 2002 IEEE Conference on Decision and Control}, pages = {???--???}, year = 2002, month = aug, note = {To appear}, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/CDC02FIN.pdf}, altkeys = {kur-var-elliptech-pr} } @article{kur-var-02-elliptech, author = {A. B. Kurzhanski and P. Varaiya}, title = {Reachability Analysis for Uncertain Systems - {The} Ellipsoidal Technique}, journal = {Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms}, volume = {9}, pages = {347--367}, year = 2002, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/LANGELPF.pdf}, altkeys = {kur-var-elliptech} } @misc{kre-ber-02-aa-selfval, author = {V. Kreinovich and D. J. Berleant}, title = {Interval Computations}, url = {http://www.cs.utep.edu/interval-comp/main.html}, howpublished = {WWW document}, year = 2002, comment = {WWW document on self-validated computation, including Affine Arithmetic.}, altkeys = {ia-site,kre-ber-02-iapage} } @article{dur-fre-pue-02-visc, author = {Fr{\'e}do Durand and George Drettakis and Claude Puech}, title = {The {3D} Visibility Complex}, volume = {21}, number = {2}, pages = {176--206}, year = 2002, journal = {ACM Transactions on Graphics} } @techreport{gol-vog-met-02-aa-cue-tr, author = {Siome Goldenstein and Christian Vogler and Dimitris Metaxas}, title = {Cue Integration using Affine Arithmetic and Gaussians}, institution = {University of Pennsylvania}, number = {MS-CIS-02-06}, year = 2002, abstract = {In this paper we describe how the connections between affine forms, zonotopes, and Gaussian distributions help us devise an automated cue integration technique for tracking deformable models. This integration technique is based on the confidence estimates of each cue. We use affine forms to bound these confidences. Affine forms represent bounded intervals, with a well-defined set of arithmetic operations. They are constructed from the sum of several independent components. An n-dimensional affine form describes a complex convex polytope, called a zonotope. Because these components lie in bounded intervals, Lindeberg's theorem, a modified version of the central limit theorem,can be used to justify a Gaussian approximation of the affine form. We present a new expectation-based algorithm to find the best Gaussian approximation of an affine form. Both the new and the previous algorithm run in $O(n 2m)$ time, where $n$ is the dimension of the affine form, and $m$ is the number of independent components. The constants in the running time of new algorithm, however, are much smaller, and as a result it runs 40 times faster than the previous one for equal inputs. We show that using the Berry-Esseen theorem it is possible to calculate an upper bound for the error in the Gaussian approximation. Using affine forms and the conversion algorithm, we create a method for automatically integrating cues in the tracking process of a deformable model. The tracking process is described as a dynamical system, in which we model the force contribution of each cue as an affine form. We integrate their Gaussian approximations using a Kalman filter as a maximum likelihood estimator. This method not only provides an integrated result that is dependent on the quality of each on of the cues, but also provides a measure of confidence in the final result. We evaluate our new estimation algorithm in experiments, and we demonstrate our deformable model-based face tracking system as an application of this algorithm. } } @inproceedings{lem-hed-bar-02-aa-circ, author = {Andreas Lemke and Lars Hedrich and Erich Barke}, title = {Analog Circuit Sizing Based on Formal Methods using Affine Arithmetic}, booktitle = {Proc. ICCAD-2002 - International Conference on Computer Aided Design}, pages = {486--489}, year = 2002, month = nov, doi = {10.1145/774572.774643}, location = {San Jose, California}, abstract = {We present a novel approach to optimization-based variation-tolerant analog circuit sizing. Using formal methods based on affine arithmetic, we calculate guaranteed bounds on the worst-case behavior and deterministically find the global optimum of the sizing problem by means of branch-and-bound optimization. To solve the nonlinear circuit equations with parameter variations, we define a novel affine-arithmetic Newton operator that gives a significant improvement in computational efficiency over an implementation using interval arithmetic. The calculation of guaranteed worst-case bounds and the global optimization are demonstrated by a prototype implementation.} } @article{sho-mar-voi-02-aa-matr, author = {Huahao Shou and Ralph Martin and Irina Voiculescu and Adrian Bowyer and Guojin Wang}, title = {Affine Arithmetic in Matrix Form for Polynomial Evaluation and Algebraic Curve Drawing}, journal = {Progress in Natural Science}, volume = {12}, number = {1}, pages = {77--81}, year = 2002, month = jan, note = {Some sources give only I. V. as author, others omit H. S. and G.W.}, abstract = {This paper shows how tight bounds for the range of a bivariate polynomial can be found using a matrix method based on affine arithmetic. Then, this method is applied to drawing an algebraic curve with a hierarchical algorithm, which demonstrates that more accurate answers can be obtained more rapidly than using conventional interval arithmetic.} } @article{mes-02-aa-jucs, author = {F. Messine}, title = {Extentions of Affine Arithmetic: {Application} to Unconstrained Global Optimization}, journal = {Journal of Universal Computer Science}, volume = {8}, number = {11}, pages = {992--1015}, year = 2002, month = nov, url = {http://www.jucs.org/jucs_8_11/extentions_of_affine_arithmetic}, altkeys = {Messine:jucs_8_11:extentions_of_affine_arithmetic} } @mastersthesis{laz-02-opg-hulls, author = {Svetlana Lazebnik}, title = {Projective Visual Hulls}, school = {Beckman Institute, University of Illinois}, year = 2002, month = dec, url = {http://citeseer.nj.nec.com/550658.html}, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:lazebnik-projective} } @inproceedings{rob-02-robwill, author = {James A. D. W. Anderson}, title = {Robot Free Will}, booktitle = {Proc. 15th European Conference on Artificial Intelligence}, pages = {559--563}, year = 2002, url = {http://www.bookofparagon.btinternet.co.uk/Robots/ECAI.2002.pdf}, comment = {Uses oriented projective geometry.} } @inproceedings{gol-mal-ber-02-puzz, author = {David Goldberg and Christopher Malon and Marshall Bern}, title = {A Global Approach to Automatic Solution of Jigsaw Puzzles}, booktitle = {Proc. 18th Annual ACM Symp.~on Computational Geometry}, pages = {74--81}, year = 2002, month = jun, comment = {Focus on the combinatorial part of the assembly. The pair-finding step assumes that pieces have smooth boundaries and sharp corners.} } @inproceedings{bue-02-aa-estim, author = {Katja B{\"u}hler}, title = {Implicit Linear Interval Estimations}, booktitle = {Proc. 18th Spring Conference on Computer Graphics}, location = {Budmerice, Slovakia}, pages = {123--132}, year = 2002, publisher = {ACM Press}, doi = {http://doi.acm.org/10.1145/584458.584479}, isbn = {1-58113-608-0}, comment = {Related to Affine Arithmetic.}, altkeys = {584479} } @article{sch-sze-02-survey, author = {D. Scharstein and R. Szeliski}, title = {A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms}, journal = {International Journal on Computer Vision}, volume = {47}, number = {1}, pages = {7--42}, year = 2002, month = may } %%% 2001 %%%%%%%%%%%%%%%%%%% @article{kan-ois-01-aa-exode, author = {Yuchi Kanzawa and Shin'ichi Oishi}, title = {Numerical Method Proving Nonlinear {ODE's} Solution Existence Using Affine Arithmetic}, journal = {Shibaura Institute of Technology Research Report - Science and Engineering}, issn = {03863115}, volume = {45}, number = {1}, pages = {29-33}, year = 2001, comment = {}, abstract = {} } @inproceedings{buh-01-aa-tayxaa, author = {Buhler, K.}, title = {{Taylor} Models and Affine Arithmetics - {Towards} a More Sophisticated Use of Reliable Methods in Computer Graphics}, booktitle = {Proc. Spring Conference on Computer Graphics}, year = 2001, pages = {40-47}, doi = {10.1109/SCCG.2001.945335}, month = apr, comment = {Compares Taylor and AA. Intersection of parametric surfaces}, abstract = {A critical discussion of existing applications of reliable methods in computer graphics and the fact that one of the key applications of reliable arithmetics in computer graphics is its use for range analysis provokes a reconsideration of existing ideas of bounding volumes. A novel kind of parametrized bounding volume for parametric surfaces is proposed that informs about the location of each surface point and the corresponding parameters, as well as the location of the surface . Taylor models and the intrinsic structure of affine arithmetic are used to realize the discussed concepts in the form of linear interval estimations (LIEs). The sophisticated use of reliable methods and the characteristics of LIEs allow an effective intersection test for LIEs that also gives information about those parts of the parameter domains possibly affected by an intersection of the enclosed surface patches. A novel subdivision algorithm for the intersection of two parametric surfaces with remarkable experimental results is presented as a possible application for LIEs.} } @article{geo-beh-kri-01-fewmacolp, author = {Athinodoros S. Georghiades and Peter N. Belhumeur and David J. Kriegman}, title = {From Few to Many: {Illumination} Cone Models for Face Recognition under Variable Lighting and Pose}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {23}, issn = {0162-8828}, year = 2001, pages = {643--660}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.927464} } @misc{wal-01-enwiki, author = {James Donal ``Jimbo'' Wales}, title = {Wikipedia, The Free Encyclopedia}, url = {http://en.wikipedia.org/wiki/}, howpublished = {Online document, accessed on 2009-11-29}, year = 2001 } @article{ste-01-evmet, author = {Mark R. Stevens}, title = {Evaluating {2D} Image Comparison Metrics for {3D} Scene Interpretation}, journal = {Computer Vision and Image Understanding}, volume = {84}, number = {1}, pages = {179--197}, year = 2001, month = oct, altkeys = {mst-2001} } @article{zan-01-voyn-ns, author = {Catherine Zandonella}, title = {Book of Riddles: {Are} We on the Brink of Decoding the Most Mysterious Document in the World}, journal = {New Scientist}, volume = {172}, number = {2317}, pages = {36--39}, year = 2001, month = nov, comment = {About the Voynich manuscript, mentions Jorge Stolfi in connection with the Chinese Theory.} } @techreport{mes-01-aa-incl-tr, author = {F. Messine}, title = {Theorem on Affine or Quadratic Inclusion Functions}, institution = {Universit{\'e} de Pau, D{\'e}partement d'Informatique}, number = {R2I 01-03}, pages = {2}, year = 2001, month = oct, altkeys = {mes-01-aaincl-tr} } @article{kur-var-01-dynop, author = {A. B. Kurzhanski and P. Varaiya}, title = {Dynamic Optimization for Reachability Problems}, journal = {IOTA}, volume = {108}, number = {2}, pages = {227--251}, year = 2001, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/kurvar11.pdf} } @inproceedings{gol-vog-met-01-aa-cue-cv, author = {Siome Goldenstein and Christian Vogler and Dimitris Metaxas}, title = {Affine Arithmetic Based Estimation of Cue Distributions in Deformable Model Tracking}, booktitle = {Proc. 2001 Conference on Computer Vision and Pattern Recognition (CVPR 2001)}, pages = {1-1}, year = 2001, month = dec, isbn = {0-7695-1272-0}, doi = {10.1109/CVPR.2001.990653}, altkeys = {gol-vog-met-02-aa-cue-cv}, note = {Not in the Proceedings' table of contents?}, abstract = {In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each of which is the sum of a large number of local contributions with unknown probability distribution functions. Under the assumption that these distributions are independent, the overall distributions of the generalized cue forces can be approximated with multidimensional Gaussians, as per the central limit theorem. Estimating the covariance matrix of these Gaussian distributions, however, is difficult, because the probability distributions of the local contributions are unknown. We use affine arithmetic as a novel approach toward overcoming these difficulties. It lets us track and integrate the support of bounded distributions without having to know their actual probability distributions, and without having to make assumptions about their properties. We present a method for converting the resulting affine forms into the estimated Gaussian distributions of the generalized cue forces. This method scales well with the number of cues. We apply a Kalman filter as a maximum likelihood estimator to merge all Gaussian estimates of the cues into a single best fit Gaussian. Its mean is the deterministic result of the algorithm, and its covariance matrix provides a measure of the confidence in the result. We demonstrate in experiments how to apply this framework to improve the results of a face tracking system.} } @inproceedings{wer-paj-01-omatch, author = {T. Werner. and T. Pajdla}, title = {Oriented Matching Constraints}, booktitle = {Proc. BMVC'01 - British Machine Vision Conference}, pages = {???--???}, year = 2001, note = {Poster session and demonstrations}, url = {http://citeseer.nj.nec.com/werner01oriented.html}, comment = {Uses oriented projective geometry.}, altkeys = {bb2939} } @inproceedings{wer-paj-01-epipo, author = {Tomas Werner and Tomas Pajdla}, title = {Cheirality in Epipolar Geometry}, booktitle = {Proc. Eighth International Conference On Computer Vision (ICCV-01)}, pages = {548--553}, year = 2001, month = jul, url = {http://citeseer.nj.nec.com/werner00cheirality.html}, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:wernercheirality} } @techreport{ram-01-mult, author = {Lyle Ramshaw}, title = {On Multiplying Points: {The} Paired Algebras of Forms and Sites}, institution = {Hewlett-Packard Research Labs}, number = {SRC-RR-169}, year = 2001, month = may, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:may-multiplying} } @inproceedings{sno-01-raypol, author = {Jack Snoeyink}, title = {The Arithmetic Precision of Ray-Polygon Intersection Testing}, booktitle = {Proc. 13th Canadian Conference on Computational Geometry (CCCG'01)}, pages = {161--164}, year = 2001, url = {http://citeseer.nj.nec.com/452204.html}, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:snoeyink-arithmetic} } @misc{leu-01-assisi-www, author = {Kristin Leutwyler}, title = {Solving a Digital Jigsaw Puzzle}, url = {http://www.sciam.com/explorations/2001/062501fresco/}, howpublished = {WWW document}, year = 2001, comment = {About the computer-assisted reconstruction of the Assisi Cathedral frescoes, especially the automatic texture-based indexing program of Mitra, Neri, and Carli at UC Santa Barbara.} } @article{pap-kar-the-01-varch, author = {Georgios Papaioannou and Evaggelia-Aggeliki Karabassi and Theoharis Theoharis}, title = {Virtual Archaeologist: {Assembling} the Past}, journal = {IEEE Computer Graphics {\&} Applications}, volume = {21}, number = {2}, pages = {53--59}, year = 2001, month = mar, comment = {Describes a system for user-assisted surface matching of marble and stone fragments. Pays more attention to the user interface than to algorithms. Apprently he user must select the fragments to be compared and delimit the surfaces to be matched; the optimal relative placement is found by simple search in attitude space.} } @inproceedings{kik-kas-01-aa-ode, author = {Tomoyuki Kikuchi and Masahide Kashiwagi}, title = {Elimination of Non-existence Regions of the Solution of Nonlinear Equations using Affine Arithmetic}, booktitle = {Proc. International Symposium on Nonlinear Theory and its Applications (NOLTA 2001)}, year = 2001, month = oct, pages = {223-226} } @inproceedings{miy-kas-01-aa-poly, author = {Takatomi Miyata and Masahide Kashiwagi}, title = {On Range Evaluation of Polynomials of Affine Arithmetic}, booktitle = {Proc. NOLTA'01 - 2001 International Symposium on Nonlinear Theory and its Applications}, year = 2001, month = oct } @inproceedings{bow-mar-sho-voi-01-aamodel, author = {Adrian Bowyer and Ralph Martin and Huahao Shou and Irina Voiculescu}, title = {Affine Intervals in a {CSG} Geometric Modeller}, booktitle = {Proc. Uncertainty in Geometric Computations}, pages = {1--14}, year = 2001, month = jul, publisher = {Kluwer Academic Publishers}, isbn = {0−7923−7309-X}, altkeys = {bow-mar-sho-voi-01-aa-model} } @inproceedings{laz-boy-pon-01-vhull, author = {S. Lazebnik and Edmond Boyer and Jean Ponce}, title = {On How to Compute Exact Visual Hulls of Object Bounded by Smooth Surfaces}, booktitle = {Proc. CVPR'01 - IEEE International Conference on Computer Vision and Pattern Recognition}, year = 2001, month = dec, publisher = {IEEE Computer Society Press}, url = {http://www.inrialpes.fr/movi/publi/Publications/2001/LBP01}, altkeys = {LBP01} } @inproceedings{mar-sho-voi-wan-01-aa-comp, author = {Ralph Martin and Huahao Shou and Irina Voiculescu and Guojin Wang}, title = {A Comparison of {Bernstein} Hull and Affine Arithmetic Methods for Algebraic Curve Drawing}, booktitle = {Proc. Uncertainty in Geometric Computations}, pages = {143-154}, year = 2001, month = jul, publisher = {Kluwer Academic Publishers}, isbn = {0-7923-7309-X}, altkeys = {mar-sho-voi-wan-01-aacomp} } %%% 2000 %%%%%%%%%%%%%%%%%%% @misc{kov-00-frache-m, author = {Peter D. Kovesi}, title = {{\texttt{frankotchellappa.m}} - {MATLAB}/{Octave} implementation of the Frankot-Chellappa gradient integrator}, url = {http://www.csse.uwa.edu.au/~pk/Research/MatlabFns/Shapelet/}, howpublished = {Site at the School of Computer Science and Software Engineering, The University of Western Australia. Accessed on 2010-05-01.}, year = 2000 } @inproceedings{can-cin-00-qhsort, author = {Domenico Cantone and Gianluca Cincotti}, title = {{QuickHeapsort}, an Efficient Mix of Classical Sorting Algorithms}, booktitle = {Proceedings of the 4th Italian Conference on Algorithms and Complexity (CIAC 2000)}, series = {Lecture Notes in Computer Science}, number = {1767}, publisher = {Springer}, issn = {0302-9743 (Print) 1611-3349 (Online)}, doi = {10.1007/3-540-46521-9_13}, year = 2000, isbn = {978-3-540-67159-6}, pages = {150--162} } @article{cos-sha-00-relix, author = {Mauro S. Costa and Linda G. Shapiro}, title = {{3D} Object Recognition and Pose with Relational Indexing}, journal = {Computer Vision and Image Understanding}, volume = {79}, number = {3}, pages = {364--407}, year = 2000, month = sep, altkeys = {csh-2000} } @inproceedings{pap-kar-the-00-arec, author = {G. Papaioannou and E. A. Karabassi and T. Theoharis}, title = {Automatic Reconstruction of Archaeological Finds - {A} Graphics Approach}, booktitle = {Proceedings of the 4th International Conference on Computer Graphics and Artificial Intelligence (3IA' 2000)}, pages = {117--125}, year = 2000, comment = {Matches a few pieces only; surface matching.} } @phdthesis{han-00-gcol-thesis, author = {Lars Thomas Hansen}, title = {Older-First Garbage Collection in Practice}, year = 2000, school = {North-Eastern University}, url = {http://citeseer.nj.nec.com/hansen00olderfirst.html}, comment = {Cites [bro-sto-84-pes].} } @inproceedings{asa-bour-dan-mal-00-reachdyn, author = {Eugene Asarin and Olivier Bournez and Thao Dang and Oded Maler}, title = {Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems}, booktitle = {Proc. Hybrid Systems: Computation and Control (HSCC'00)}, series = {Lecture Notes in Computer Science}, volume = {1790}, pages = {20--31}, year = 2000, month = mar, publisher = {Springer}, altkeys = {ABDM00} } @article{kur-var-02-relunc, author = {A. B. Kurzhanski and P. Varaiya}, title = {On Reachability under Uncertainty}, journal = {SIAM J. Control}, volume = {41}, number = {1}, pages = {181--216}, year = 2002, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/reach8.pdf} } @article{kur-var-00-distur, author = {A. B. Kurzhanski and P. Varaiya}, title = {On the Reachability Problem under Persistent Disturbances}, journal = {Doklady Mathematics}, volume = {61}, number = {3}, pages = {3809--3814}, year = 2000 } @inproceedings{kur-var-00-elltechr, author = {A. B. Kurzhanski and P. Varaiya}, title = {Ellipsoidal Techniques for Reachability Analysis}, booktitle = {Proceedings of Third International Workshop on Hybrid Systems: Computation and Control (HSCC 2000)}, series = {Lecture Notes in Computer Science}, volume = {1790}, pages = {202--214}, year = 2000, publisher = {Springer}, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/hs.pdf}, isbn = {3-540-67259-1} } @article{kur-var-00-elltechint, author = {A. B. Kurzhanski and P. Varaiya}, title = {Ellipsoidal Techniques for Reachability Analysis. {Internal} Approximation}, journal = {Systems and Control Letters}, volume = {41}, pages = {201--211}, year = 2000, month = sep, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/ellint6.pdf} } @misc{kur-var-00-eltec-m, author = {A. B. Kurzhanski and P. Varaiya}, title = {On Ellipsoidal Techniques for Reachability Analysis. {Part} {I}. {External} Approximations. {Part} {II}. {Internal} Approximations, Box-Valued Constraints}, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/REACHEX.pdf}, howpublished = {Online document}, year = 2000, month = sep, note = {To appear in {\it Optimization: Methods and Software}} } @article{coe-fig-gat-00-intt, author = {Luiz C. G. Coelho and Luiz H. Figueiredo and Marcelo Gattass}, title = {Intersection and Trimming of Parametric Meshes on Finite-Element Shells}, journal = {International J. for Numerical Methods in Engineering}, volume = {47}, number = {4}, pages = {777--800}, year = 2000 } @article{xyl-00-xyl, author = {A. J. G. Simpson and F. C. Reinach and P. Arruda and J. C. Setubal and J. Meidanis and others}, title = {The Genome Sequence of the Plant Pathogen {Xylella} {fastidiosa}}, journal = {Nature}, volume = {406}, pages = {151--157}, year = 2000 } @inproceedings{bue-bar-00-aa-inter, author = {Katja {B{\"u}hler} and Wilhelm Barth}, title = {A New Intersection Algorithm for Parametric Surfaces Based on Linear Interval Estimations}, booktitle = {Proc. SCAN 2000 / Interval 2000 - 9th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics}, pages = {???--???}, year = 2000, comment = {Linear intervals are very similar to affine forms.}, altkeys = {bue-bar-00-inter} } @inproceedings{mic-00-aa-dyna, author = {Dominique Michelucci}, title = {Reliable Computations for Dynamic Systems}, booktitle = {Proc. SCAN 2000 / Interval 2000 - 9th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics}, pages = {???--???}, year = 2000, comment = {Uses Affine Arithmetic?}, altkeys = {mic-00-dyna} } @inproceedings{kam-sab-00-color, author = {M. Kampel and R. Sablatnig}, title = {Color Calibration for Pre-Classification of Pottery}, booktitle = {Proc. Czech Pattern Recognition Workshop 2000}, pages = {185--189}, year = 2000 } @inproceedings{sab-dan-sta-00-segm, author = {R. Sablatnig and M. Dangl and P. Stadler}, title = {Adaptive Image Segmentation for Managing Inventories of Museums}, booktitle = {Proc. 5th Joint Conf. on Information Sciences, Conf. on Computer Vision, Pattern Recognition and Image Processing}, pages = {342--345}, year = 2000 } @inproceedings{kam-sab-00-spect, author = {M. Kampel and R. Sablatnig}, title = {Color Classification of Ceramics using Spectral Reflectance}, booktitle = {Proc. 1st Intl. Conference on Color in Graphics and Image Processing}, year = 2000 } @article{hor-ima-oga-00-hbrk, author = {Kenta Hori and Masakazu Imai and Tsukasa Ogasawara}, title = {Hierarchical Description of a Contour for Reconstruction of Broken Earthenware}, journal = {The Transactions of Electronics, Information and Communication Engineers D-II}, volume = {J83-D-II}, number = {5}, pages = {1392--1394}, year = 2000, month = may, note = {(in Japanese)}, comment = {Ceramic fragment matching using a hirarchical description of the fracture lines. Uses hierarchy to speed up the match. Uses Fourier descriptors as metric.} } @article{hor-ima-oga-00-damod, author = {Kenta Hori and Masakazu Imai and Tsukasa Ogasawara}, title = {Data Model for Computer Reconstruction of Potsherds}, journal = {Journal of Computer Archaeology}, volume = {5}, number = {2}, pages = {1--10}, year = 2000, month = mar, note = {(in Japanese)}, comment = {Ceramic fragment matching using a hirarchical description of the fracture lines. Uses hierarchy to speed up the match. Uses Fourier descriptors as metric.} } @misc{kur-00-aa-range, author = {Toshiyuki Kurosaki}, title = {Range Evaluation of the Polynomial using Interval Arithmetic}, url = {http://www.kashi.info.waseda.ac.jp/Non-linear/thesis-e.html}, howpublished = {WWW document}, year = 2000, comment = {Bachelor's thesis} } @misc{kik-00-aa-ode, author = {Tomoyuki Kikuchi}, title = {Elimination of Non-existence Region of the Solution of Nonlinear Equations using Affine Arithmetic}, url = {http://www.kashi.info.waseda.ac.jp/Non-linear/thesis-e.html}, howpublished = {WWW document}, year = 2000, comment = {Bachelor's thesis} } @misc{shi-00-aa-round, author = {Kouichi Shiota}, title = {On the Rounding Error of the Affine Arithmetic}, url = {http://www.kashi.info.waseda.ac.jp/Non-linear/thesis-e.html}, howpublished = {WWW document}, year = 2000, comment = {Bachelor's thesis} } @misc{miy-00-aa-div, author = {Shinya Miyajima}, title = {On the Improvement of the Division of the Affine Arithmetic}, url = {http://www.kashi.info.waseda.ac.jp/Non-linear/thesis-e.html}, howpublished = {WWW document}, year = 2000, comment = {Bachelor's thesis} } @article{fem-spa-00-aa-eletr, author = {N. Femia and G. Spagnuolo}, title = {True Worst-Case Circuit Tolerance Analysis using Genetic Algorithm and Affine Arithmetic - {Part} {I}}, journal = {IEEE Transactions on Circuits and Systems}, volume = {47}, number = {9}, pages = {1285--1296}, year = 2000, month = sep, doi = {10.1109/81.883323}, abstract = {In this paper, a new approach to the calculation of the true worst case in circuit tolerance analysis (TWC-CTA) with parameters characterized by large uncertainties is presented. It is based on the joint use of genetic algorithms (GAs) and affine arithmetic (AA). The GAs are used to minimize the underestimation error which affects stochastic methods while the AA is applied to minimize the overestimation error which affects interval arithmetic methods in TWC-CTA problems. The joint GA-AA approach presented in this paper ensures a reliable TWC evaluation.} } @inproceedings{zha-mar-00-aa-polycurv, author = {Q. Zhang and R. R. Martin}, title = {Polynomial Evaluation using Affine Arithmetic for Curve Drawing}, booktitle = {Proc. of Eurographics UK 2000 Conference}, pages = {49--56}, year = 2000, isbn = {0-9521097-9-4} } @inproceedings{voi-ber-bow-mar-zha-00-aa-surf, author = {Irina Voiculescu and Jakob Berchtold and Adrian Bowyer and Ralph R. Martin and Qijiang Zhang}, title = {Interval and Affine Arithmetic for Surface Location of Power- and {Bernstein}-form Polynomials}, booktitle = {Proc. Mathematics of Surfaces IX}, pages = {410--423}, year = 2000, month = sep, publisher = {Springer}, isbn = {1-85233-358-8}, altkeys = {voi-ber-bow-mar-zha-00-aaloc}, comment = {Compares interval Berstein form with AA evaluation for implict polynomial surfaces. Speculates on synergy.}, abstract = {This paper describes a problem of interest in CSG modelling, namely the location of implicit polynomial surfaces in space. It is common for surfaces defined by implicits to be located using interval arithmetic. However, the method only gives conservative bounds for the values of the function inside a region of interest. This paper gives two possible ways of producing tighter bounds. One involves using a Bernstein--form representation of the implicit polynomials used as input to the method. The other fine--tunes the method itself by employing careful use of affine arithmetic --- a more sophisticated version of interval arithmetic. As both methods contribute significant improvements, we speculate about combining the two into a fast and accurate method for surface location.} } @inproceedings{pin-rez-00-cccc, author = {G. Pinto and P. de Rezende}, title = {Additively Weighted {Voronoi} Diagram in the Oriented Projective Plane}, booktitle = {Proc. 12th Canadian Conference on Computational Geometry}, year = 2000, url = {http://www.cs.unb.ca/conf/cccg/eProceedings/18.ps.gz}, comment = {Uses oriented projective geometry.} } %%% 1999 %%%%%%%%%%%%%%%%%%% @article{kan-ois-99-aa-ode-tr, author = {Yuchi Kanazawa and {Shin'ichi} Oishi}, title = {A Numerical Method to Prove the Existence of Solutions for Nonlinear {ODEs} Using Affine Arithmetic}, journal = {IEICE Technical Report}, publisher = {Institute of Electronics, Information and Communication Engineers}, volume = {99}, number = {42}, pages = {39-44}, year = 1999, month = may, note = {See also~\cite{kan-ois-02-aa-ode}}, abstract = {In this paper, we shall propose a method to prove the existence of the solutions for nonlinear ordinary differential equa tions using affine arithmetic instead of using interval arithmetic. In the case using interval arithmetic, we must use Krawczyk-like operator, which is the mean value form for Newton operator,because of the disadvantage of interval arithmetic. Otherwise, we use affine arithmetic to Newton operator directly since affine arithmetic is effective to variables-dependent calculations. In other words, we need not Mean value theorem any more.} } @article{smi-smi-hil-99-grbump, author = {Melvyn L. Smith, G. Smith, T. Hill}, title = {Gradient Space Analysis of Surface Defects using a Photometric Stereo Derived Bump Map}, journal = {Image and Vision Computing}, volume = {17}, number = {3--4}, year = 1999, pages = {321--332} } @article{smi-99-phsgrad, author = {Melvyn L. Smith}, title = {The Analysis of Surface Texture using Photometric Stereo Acquisition and Gradient Space Domain Mapping}, journal = {Image and Vision Computing}, volume = {17}, number = {14}, year = 1999, pages = {1009--1019} } @inproceedings{yui-sno-97-shalb, author = {Alan Yuille and Daniel Snow}, title = {Shape and Albedo from Multiple Images using Integrability}, booktitle = {Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR 97)}, pages = {158--164}, year = 1997, doi = {10.1109/CVPR.1997.609314} } @article{bel-kri-yui-99-bramb, author = {Peter N. Belhumeur and David J. Kriegman and Alan L. Yuille}, title = {The Bas-Relief Ambiguity}, journal = {International Journal of Computer Vision}, volume = {35}, number = {1}, pages = {33–44}, year = 1999, doi = {10.1023/A:1008154927611}, altkeys = {yui-99-bramb,bel-99-bramb} } @article{gio-ind-mot-99-hdhash, author = {Aristides Gionis and Piotr Indyk and Rajeev Motwani}, title = {Similarity Search in High Dimensions via Hashing}, journal = {The {VLDB} Journal}, pages = {518--529}, year = 1999, url = {citeseer.ist.psu.edu/article/gionis97similarity.html}, altkeys = {gionis-99} } @article{bar-sha-99-foot-j, author = {G. Barequet and M. Sharir}, title = {Partial Surface Matching by Using Directed Footprints}, journal = {Computational Geometry: Theory and Applications}, volume = {12}, pages = {45--62}, year = 1999, comment = {Supersedes [ber-sha-96-foot].}, altkeys = {ber-sha-99-foot-j} } @techreport{mes-99-aa-new-tr, author = {F. Messine}, title = {New Affine Forms in Interval Branch and Bound Algorithms}, institution = {Universit{\'e} de Pau, D{\'e}partement d'Informatique}, number = {R2I-99-02}, year = 1999, month = oct, note = {Submitted in Journal of Universal Computer Science}, altkeys = {mes-99-newaa-tr} } @misc{kur-var-99-elcint, author = {A. B. Kurzhanski and P. Varaiya}, title = {Ellipsoidal Techniques for Reachability Analysis: {Internal} Approximation}, url = {http://citeseer.nj.nec.com/ps/290581}, howpublished = {Online document}, year = 1999, month = dec, comment = {Computes an elipsoid guaranteed to be inside the reachable set of a differential equation. Apparently assumes ellipsoidal calculus but gives no details on the same.}, altkeys = {Citeseer:state-ellipsoidal} } @inproceedings{kas-99-aa-div, author = {Masahide Kashiwagi}, title = {On Division of the Affine Arithmetic}, booktitle = {Proc. NOLTA'99 - 1999 International Symposium on Nonlinear Theory and its Applications}, year = 1999, month = nov, altkeys = {Mislabeled:kas-01-aa-div} } @article{kas-99-aa-div-tr, author = {Masahide Kashiwagi}, title = {On the Division of the Affine Arithmetic}, journal = {IEICE Technical Report}, publisher = {The Institute of Electronics, Information and Communication Engineers}, volume = {98}, number = {662}, pages = {23-29}, year = 1999, month = mar, url = {https://ci.nii.ac.jp/naid/110003292159/en/}, note = {In Japanese. See also~\cite{kas-99-aa-div}}, comment = {Better algorithm for division}, abstract = {In this report we propose a new method for the division of the affine arithmetic. Affine arithmetic is an extension of the interval arithmetic and it can give narrower result than conventional interval arithmetic. In the affine arithmetic, operations for addition, subtraction, multiplication and 1-variable functions are known, but, operation for division is not known and so division is generally done by decomposing $x/y$ into $x\times (1/y)$. In this report we propose a direct operation for division of affine arithmetic. We also show that our method gives better result than the decomposition method.} } @inproceedings{hor-ima-oga-99-pots, author = {Kenta Hori and Masakazu Imai and Tsukasa Ogasawara}, title = {Joint Detection for Potsherds of Broken Earthenware}, booktitle = {Proc. 1999 IEEE Conference on Computer Vision {\&} Pattern Recognition (CVPR'99)}, volume = {2}, pages = {440--445}, year = 1999, month = jun, abstract = {In this paper, we propose a new strategy for detecting the joint among two potsherds. Joint detection problems were studied in jigsaw puzzle assembling. However, the shape assumptions of a piece used in the past researches cannot be applied to joint detection to reconstruct broken earthenware. To detect the joint, the most similar section among two contours must be detected by partial verification. In our strategy, each contour is segmented for partial verification without making any assumption about the shape of a potsherd, unlike previous jigsaw puzzle assembling methods. \par Our strategy consists of five processes: the contour segmentation process, the segment description process, the segment verification process, the candidate extraction process, and the candidate verification process. We also present experimental results of our strategy with two-dimensional images of potsherds.}, keywords = {joint detection, partical verification of contours, reconstruction of broken earthenware} } @mastersthesis{cus-99-aa-thesis, author = {Affonso de {Cusatis Jr.}}, title = {Tra{\c{c}}ado de Raios de Superf{\'\i}cies Impl{\'\i}citas com Aritm{\'e}tica Afim}, school = {Departamento de Inform{\'a}tica, Pontif{\'\i}cia Universidade Cat{\'o}lica do Rio de Janeiro}, year = 1999, month = apr, note = {(in Portuguese)}, altkeys = {cus-99-thesis} } @inproceedings{jut-99-pytc-ab, author = {B. J{\"u}ttler}, title = {Curvature Continuous {Pythagorean} Hodograph Spline Curves}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {37}, year = 1999, month = jun } @article{uco-tor-99-recon, author = {G{\"o}kt{\"u}rk {\"U}{\c{c}}oluk and I. Hakki Toroslu}, title = {Automatic Reconstruction of Broken {3-D} Surface Objects}, journal = {Computers {\&} Graphics}, volume = {23}, number = {4}, pages = {573--582}, year = 1999, month = aug, comment = {Supersedes [uco-tor-97-recon].} } @inproceedings{hal-99-frags, author = {Radim Hal{\'\i}{\v{r}}}, title = {An Automatic Estimation of the Axis of Rotation of Fragments of Archaeological Pottery: {A} Multistep Model-Based Approach}, booktitle = {Proc. 7th International Conference in Central Europe on Computer Graphics, Visualization and Interactive Digital Media (WSCG'99)}, pages = {???--???}, year = 1999 } @incollection{sab-kam-zol-99-brush, author = {R. Sablatnig and P. Kammerer and E. Zolda}, title = {Analysis of Brush Strokes}, booktitle = {Fakebusters - Scientific Detection of Fakery in Art}, editor = {W. McCrone and R. J. Weiss}, pages = {221--245}, year = 1999, publisher = {Hansen, Stoughton (Mass.)} } @inproceedings{kam-sab-99-msherd, author = {M. Kampel and R. Sablatnig}, title = {On 3d Modelling of Archaeological Sherds}, booktitle = {Proc. of Intl. Workshop on Synthetic-Natural Hybrid Coding and Three Dimensional Imaging}, pages = {95--98}, year = 1999 } @inproceedings{sab-men-99-epos, author = {R. Sablatnig and C. Menard}, title = {On Estimating the Position of Fragments on Rotational Symmetric Pottery}, booktitle = {Proc. 2nd International Conference on {3-D} Digital Imaging and Modeling}, pages = {455--462}, year = 1999 } @inproceedings{jut-sam-99-pyts-ab, author = {B. J{\"u}ttler and M. L. Sampoli}, title = {{Hermite} Interpolation by Spline Surfaces with Rational Offsets}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {37--38}, year = 1999, month = jun } @inproceedings{sch-99-pyts-ab, author = {R. Schickentanz}, title = {Interpolation and Approximation using Surfaces with Rational Offsets}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {70--71}, year = 1999, month = jun } @inproceedings{can-don-99-clet-ab, author = {Emmanuel J. Cand{\`e}s and David L. Donoho}, title = {Curvelets}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {11--12}, year = 1999, month = jun } @inproceedings{chi-zha-gol-99-resu-ab, author = {Eng-Wee Chionh and Ming Zhang and Ronald Goldman}, title = {Implicitization Matrices in the Style of Sylvester with the Order of Bezout}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {13--14}, year = 1999, month = jun } @inproceedings{lop-non-pes-tav-99-sing-ab, author = {H. Lopes and L. G. Nonato and S. Pesco and G. Tavares}, title = {Dealing with Topogical Singularities on Volumetric Reconstruction}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {49--50}, year = 1999, month = jun } @inproceedings{cra-sil-fon-99-vapp-ab, author = {M. Craizer and E. A. B. Silva and D. A. Fonini}, title = {Sucessive Approximation Vector Quantization}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {16}, year = 1999, month = jun } @inproceedings{nea-sch-99-sapp-ab, author = {Mike Neamtu and Larry L. Schumaker}, title = {Approximation Properties of Splines on Spherical Triangulations}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {59}, year = 1999, month = jun } @inproceedings{pot-99-scul-ab, author = {Helmut Pottmann}, title = {Geometry of Sculptured Surface Machining}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {63--64}, year = 1999, month = jun } @inproceedings{luc-99-orat-ab, author = {Andrzej {\L}ukaszewski}, title = {Offsets of Rational Surfaces and Ray Tracing}, booktitle = {Abstracts of the 4th International AFA Conference on Curves and Surfaces}, location = {Saint-Malo, France}, pages = {50--51}, year = 1999, month = jun } @misc{lev-99-urbis-wwwr, author = {Marc Levoy}, title = {Scanning the Fragments of the {Forma} {Urbis} {Romae}}, url = {http://www.graphics.stanford.edu/projects/mich/forma-urbis/forma-urbis.html}, howpublished = {WWW document}, year = 1999, month = may, altkeys = {lev-99-urbis-www} } @misc{cle-99-palr, author = {Alfonso Morales Cleveland}, title = {Palenque Project Report - 1999 Season}, url = {http://www.mesoweb.com/palenque/dig/report/report_99_04.html}, howpublished = {WWW document}, year = 1999 } @book{car-fig-gom-vel-99-optg, author = {Paulo C. P. Carvalho and Luiz H. Figueiredo and Jonas Gomes and Luiz Velho}, title = {M{\'e}todos de Otimiza{\c{c}}{\~a}o em Computa{\c{c}}{\~a}o Gr{\'a}fica}, series = {22nd Col{\'o}quio Brasileiro de Matem{\'a}tica}, year = 1999, month = jul, publisher = {IMPA}, address = {Rio de Janeiro} } @article{fig-gom-vel-99-adap, author = {Luiz H. Figueiredo and Jonas Gomes and Luiz Velho}, title = {A Unified Approach for Hierarchical Adaptive Tesselation of Surfaces}, journal = {ACM Transactions on Graphics}, volume = {18}, number = {4}, pages = {329--s360}, year = 1999 } @article{fig-vel-gom-99-tris, author = {Luiz H. Figueiredo and Luiz Velho and Jonas Gomes}, title = {Hierarchical Generalized Triangle Strips}, journal = {The Visual Computer}, volume = {15}, number = {1}, pages = {21--35}, year = 1999 } @inproceedings{cus-fig-gat-99-aa-rt, author = {Affonso de {Cusatis Jr.} and Luiz H. Figueiredo and Marcelo Gattass}, title = {Interval Methods for Ray Casting Surfaces with Affine Arithmetic}, booktitle = {Proceedings of SIBGRAPI'99 - the 12th Brazilian Symposium on Computer Graphics and Image Processing}, pages = {65--71}, year = 1999, doi = {10.1109/SIBGRA.1999.805711}, abstract = {We study the performance of affine arithmetic as a replacement for interval arithmetic in interval methods for ray casting implicit surfaces. Affine arithmetic is a variant of interval arithmetic designed to handle the dependency problem, and which has improved several interval algorithms in computer graphics.}, altkeys = {cus-fig-gat-99-rtaa} } @misc{the-99-tmp5, author = {Theban Mapping Project}, title = {Theban Mapping Project - Tomb KV5}, url = {http://www.kv5.com/intro.html}, howpublished = {WWW document}, year = 1999 } @misc{kaw-99-aa-sol, author = {Osamu Kawakami}, title = {On All Solution Algorithms using Affine Arithmetic}, url = {http://www.kashi.info.waseda.ac.jp/Non-linear/thesis-e.html}, howpublished = {WWW document}, year = 1999, comment = {Bachelor's thesis} } @inproceedings{mou-fpu-99-plueck, author = {D. M. Mount and F. T. Pu}, title = {Binary Space Parititions in Pluecker Space}, booktitle = {Proc. Algorithm Engineering and Experimentation (ALENEX'99)}, volume = {1619}, pages = {94--113}, year = 1999, publisher = {Springer}, comment = {Uses oriented projective geometry (but does not cite Stolfi)}, series = {Lecture Notes in Computer Science} } @inproceedings{tol-dor-mcm-99-sketch, author = {Osama Tolba and Julie Dorsey and Leonard McMillan}, title = {Sketching with Projective {2D} Strokes}, booktitle = {Proc. 12th annual ACM Symposium on User Interface Software and Technology}, pages = {149--157}, year = 1999, url = {http://graphics.lcs.mit.edu/~tolba/sketch/paper/paper.html}, isbn = {1-58113-075-9}, comment = {Uses oriented projective geometry.} } @techreport{wal-sno-99-csg, author = {Robert J. Walker and Jack Snoeyink}, title = {Practical Point-in-Polygon Tests using {CSG} Representations of Polygons}, number = {TR-99-12}, year = 1999, institution = {Department of Computer Science, University of British Columbia}, month = dec, url = {http://citeseer.nj.nec.com/article/walker99practical.html}, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:walker99practical} } @techreport{mul-hin-99-mesh, author = {H. Muller and A. Hinkenjann}, title = {Linear Line-Space Meshing for Light Fields}, institution = {Fachbereich Informatik, Universitat Dortmund}, number = {716}, year = 1999, url = {http://citeseer.nj.nec.com/muller99linear.html}, comment = {Uses oriented projective geometry.} } %%% 1998 %%%%%%%%%%%%%%%%%%% @book{oro-98-cgec, author = {Joseph O'Rourke}, title = {Computational Geometry in {C}}, year = 1998, publisher = {Cambridge University Press}, isbn = {9780521649766}, comment = {Textbook. Revised edition of [oro-93-cgec]} } @inproceedings{egi-fem-spa-voc-98-aa-truworst, author = {Egiziano, L. and Femia, N. and Spagnuolo, G. and Vocca, G.}, title = {True-Worst-Case Evaluation in Circuit Tolerance and Sensitivity Analysis Using Genetic Algorithms and Affine Mathematics}, booktitle = {1998 IEEE International Symposium on Circuits and Systems (ISCAS)}, year = 1998, volume = {6}, number = {}, pages = {458-461}, doi = {10.1109/ISCAS.1998.705310}, month = {May}, comment = {Calls it `Affine Mathematics'.}, abstract = {New methods for circuit tolerance and sensitivity analysis (TSA) are presented in this paper. Genetic algorithms (GA) and affine arithmetic (AA) techniques have been adopted to find respectively the inner and the outer solution in true worst-case (TWC) problems for circuits where the strong uncertainty of parameters yields large changes of performances. It is shown that GA and AA allow a sharp determination of the TWC in TSA problems, even of great complexity. Some circuit examples are presented to highlight the accuracy and the efficiency of the new methods, whose application is best suited for the CAD of electronic circuits submitted to performances and regulations constraints to be fulfilled in presence of large parameter uncertainties.} } @article{sak-kas-98-aa-allsol-tr, author = {Takayu Sakiyama and Masahide Kashiwagi}, title = {An Algorithm for Finding All Solutions Using Affine Arithmetic}, journal = {IEICE Technical Report}, volume = {97}, number = {532}, pages = {49-55}, year = 1998, month = feb, note = {In Japanese.}, abstract = {This paper proposes a method for finding all solutions of nonlinear equations with guaranteed accuracy, which is improved by using affine arithmetic. The feature of affine arithmetic is that it keeps the correlation between variables(input and intermediate variables), unlike interval arithmetic. Affine arithmetic is superior to interval arithmetic in point of providing tighter intervals. Therefore the algorithm using affine arithmetic can remove the nonexistent regions of the solution more efficiently than using interval arithmetic. Some numerical examples show the efficiency of the proposed algorithm.} } @article{jac-98-water, author = {Paul T. Jackway}, title = {Gradient Watersheds in Morphological Scale-Space}, journal = {IEEE Trans. on Image Processing}, volume = {5}, number = {6}, year = 1998, month = jun, altkeys = {b.neu-Jack} } @article{ary-mou-net-sil-wu-98-ndim, author = {S. Arya and D. M. Mount and N. S. Netanyahu and R. Silverman and A. Y. Wu}, title = {An Optimal Algorithm for Approximate Neareast Neighbor Searching in Fixed Dimensions}, journal = {Journal of the Association of Computing Machinery}, volume = {45}, number = {6}, pages = {891--923}, year = 1998 } @inproceedings{ind-mot-98-apnnbr, author = {Piotr Indyk and Rajeev Motwani}, title = {Approximate Nearest Neighbour: {Towards} Removing the Curse of Dimensinality}, booktitle = {Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC'98)}, pages = {604--613}, year = 1998, url = {citeseer.ist.psu.edu/article/gionis97similarity.html}, altkeys = {indyk-98} } @book{lat-98-mcomm, author = {B. P. Lathi}, title = {Modern Digital and Analog Communications Systems}, year = 1998, publisher = {Oxford Univ.~Press}, altkeys = {Lathi-98} } @inproceedings{rea-peg-sto-sic-pai-fer-98-gua, author = {A. H. {Reali Costa} and R. Pegoraro and G. Stolfi and J. S. Sichman and F. M. Pait and H. {Ferasoli Filho}}, title = {Guarana Robot-Soccer Team: {Some} Architectural Issues}, booktitle = {Proc. of the FIRA 98 Workshop}, year = 1998 } @misc{var-98-reachop, author = {P. Varaiya}, title = {Reach Set Computation using Optimal Control}, year = 1998, month = dec, howpublished = {Online document}, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/reachset.ps} } @misc{kur-var-98-elcre, author = {A. B. Kurzhanski and P. Varaiya}, title = {Ellipsoidal Techniques for Reachability Analysis}, url = {http://www.path.berkeley.edu/~varaiya/papers_ps.dir/kurvarel5.pdf}, howpublished = {Online document}, year = 1998, month = dec, comment = {May be an earlier version of~[kur-var-99-elcint].} } @article{fal-udu-sam-sha-hir-lot-98-lw, author = {A. X. Falc{\~a}o and J. K. Udupa and S. Samarasekera and S. Sharma and B. E. Hirsch and R. A. Lotufo}, title = {User-Steered Image Segmentation Paradigms: {Live}-Wire and Live-Lane}, journal = {Graphical Models and Image Processing}, volume = {60}, number = {4}, pages = {233--260}, year = 1998, month = jul } @article{pei-98-indio, author = {J. L. S. Peixoto}, title = {Popula{\c{c}}{\~o}es Ind{\'\i}genas de Tradi{\c{c}}{\~a}o {Tupiguarani} no {Pantanal} {Sul}-{Mato}-{Grossense}}, journal = {Revista do Museu de Arqueologia e Etnologia da Universidade de S{\~a}o Paulo}, volume = {8}, pages = {71--86}, year = 1998, altkeys = {ref:peix98} } @inproceedings{kas-98-aa-allsol, author = {M. Kashiwagi}, title = {An All Solution Algorithm using Affine Arithmetic}, booktitle = {NOLTA'98 - 1998 International Symposium on Nonlinear Theory and its Applications}, location = {Crans-Montana, Switzerland}, pages = {14--17}, year = 1998, month = sep, note = {(withdrawn?)}, altkeys = {kas-98-affa} } @inproceedings{egi-fem-spa-98-aa-cir, author = {L. Egiziano and N. Femia and G. Spagnuolo}, title = {New Approaches to the True Worst-Case Evaluation in Circuit Tolerance and Sensitivity Analysis -- {Part} {II}: {Calculation} of the Outer Solution using Affine Arithmetic}, booktitle = {Proc. COMPEL'98 - 6th Workshop on Computer in Power Electronics}, location = {Villa Erba, Italy}, pages = {19--22}, year = 1998, month = jul, altkeys = {egi-fem-spa-98-aacir}, abstract = {For pt. I see ibid., p.133-9 (1998). In this paper a new approach to the calculation of the true worst-case in circuit tolerance analysis (TWC-CTA) based on affine arithmetic is presented. The method proposed solves the problem of maximizing the intrinsic overestimation error which affects interval arithmetic methods in the calculation of the TWC in CTA problems with parameters characterized by large tolerances. The joint application of the technique presented in this paper with that one presented in part I for the calculation of an underestimated solution ensures a reliable and efficient TWC evaluation.} } @inproceedings{mes-mah-98-aa-mopt, author = {F. Messine and A. Mahfoudi}, title = {Use of Affine Arithmetic in Interval Optimization Algorithms to Solve Multidimensional Scaling Problems}, booktitle = {Proc. SCAN'98 - IMACS/GAMM International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics}, location = {Budapest, Hungary}, pages = {22--25}, year = 1998, month = sep, note = {To appear in {\em Reliable Computing}.}, altkeys = {mes-mah-98-mopt} } @inproceedings{hei-sei-98-samp, author = {W. Heidrich and Hans-Peter Seidel}, title = {Ray-Tracing Procedural Displacement Shaders}, booktitle = {Proc. Graphics Interface'98}, pages = {8--16}, year = 1998 } @article{hei-slu-sei-98-aa-shader, author = {W. Heidrich and Ph. Slusallek and Hans-Peter Seidel}, title = {Sampling Procedural Shaders using Affine Arithmetic}, journal = {ACM Transactions on Graphics (TOG)}, volume = {17}, number = {3}, pages = {158--176}, year = 1998, month = jul, issn = {0730-0301}, altkeys = {hei-slu-sei-98-aash} } @incollection{fau-sch-98-fitt, author = {G. E. Fausshauer and L. L. Schumaker}, title = {Scattered Data Fitting on the Sphere}, booktitle = {Mathematical Methods for Curves and Sufaces}, pages = {117--166}, year = 1998, publisher = {Vanderbilt University Press, Nashville, TN} } @inproceedings{sab-men-98-rsym, author = {R. Sablatnig and C. Menard}, title = {Classification and {3d}-Reconstruction of Rotational Symmetric Pottery}, booktitle = {Computer Vision - Proc. ??th Computer Vision Winter Workshop (CVWW'98)}, pages = {186--194}, year = 1998 } @inproceedings{sab-men-kro-98-cdes, author = {R. Sablatnig and C. Menard and W. Kropatsch}, title = {Classification of Archaeological Fragments using a Description Language}, booktitle = {Signal Processing {IX}, Theories and Applications}, volume = {II}, pages = {1097--1100}, year = 1998, publisher = {EURASIP} } @mastersthesis{ram-98-thesis, author = {Paulo Fernando S. C. {Ramos Jr.}}, title = {Um Modelo de Deforma{\c{c}{\~o}es para Superf{\'\i}cies: {An{\'a}lise} e Simula{\c[c}}{\~o}es}, school = {Electric and Computer Engineering School, University of Campinas}, pages = {68}, year = 1998 } @techreport{loz-men-98-cell-tr, author = {L. A. P. Lozada and C. F. X. de Mendon{\c{c}}a}, title = {Modelagem Geom{\'e}trica de 3-Complexos Celulares}, institution = {Institute of Computing, University of Campinas}, number = {IC-98-21}, year = 1998, month = may } @misc{ree-98-bibl, title = {{Voynich} {Manuscript} Bibliography}, url = {http://www.research.att.com/~reeds/voynich/bib.html}, howpublished = {WWW document}, year = 1998, month = nov } @techreport{nic-wee-rop-98-prim, author = {H. B. Nicholas Jr. and D. W. Deerfield II and A. J. Ropelewski}, title = {A Tutorial on Searching Sequence Databases and Sequence Scoring Methods}, institution = {Pittsburgh Supercomputing Center, National Institutes of Health}, year = 1998, altkeys = {ref:primer} } @misc{mcc-98-course, author = {Michael McCool}, title = {Course Schedule for {S 788 F} - Topics in Computer Graphics - Spring 1999}, institution = {Computer Science Dept, University of Waterloo}, url = {http://www.cgl.uwaterloo.ca/~mmccool/cs788/lectures.html}, howpublished = {WWW document}, year = 1998 } @article{gom-bra-98-cura, author = {D. M. C. Gomes e G. B. Braga}, title = {A Curadoria da Cole{\c{c}}{\~a}o Tapaj{\^o}nica do {MAE}-{USP}}, journal = {Revista do Museu de Arqueologia e Etnologia da Universidade de S{\~a}o Paulo}, pages = {325--328}, year = 1998, vol = {8}, altkeys = {ref:maeusp-2} } @misc{nag-98-aa-sol, author = {Yuuichirou Nagashima}, title = {An Effective Method of Division of Affine Arithmetic}, url = {http://www.kashi.info.waseda.ac.jp/Non-linear/thesis-e.html}, howpublished = {WWW document}, year = 1998, comment = {Bachelor's thesis} } @article{oku-yas-tok-98-aa-segint-tr, author = {Hisanobu Okuda and Seigo Yasutome and Nobuki Tokura}, title = {Decision of Segments Intersection under Input Data Expressed in Affine Arithmetic}, journal = {IEICE Technical Report}, publisher = {IEICE - Institute of Electronics, Information and Communication Engineers}, year = 1998, month = jun, volume = {98}, number = {137}, pages = {23-30}, issn = {0913-5685}, url = {https://ci.nii.ac.jp/naid/110003191662/en/}, note = {See also~\cite{oku-yas-tok-98-aa-segint}}, comment = {Applicaton of AA to basic computational geometry}, abstract = {The computational geometry algorithms which give consideration to imprecise input don't assume a correlations between the input errors. If a predicate which decide a geometrical property keep track of the errors, it can give more precise information. In this paper, we propose a method which gives consideration of a correlation of input errors in 1st degree, using Affine Arithmetic and show how a result of a decision of segments intersection is affected by the consideration of correlation of input errors and the range's overestimation caused by Affine Arithmetic, comparing with a current method.} } @inproceedings{oku-yas-tok-98-aa-segint, author = {Hisanobu Okuda and Seigo Yasutome and Nobuki Tokura}, title = {Decision of Segments Intersection under Input Data Expressed in Affine Arithmetic}, booktitle = {Proc. of TGCOMP Meeting - Technical Group on foundation of COMPuting}, publisher = {IEICE - Institute for Electronics, Information and Communication Engineers of Japan}, note = {See also~\cite{oku-yas-tok-98-aa-segint-tr}}, year = 1998 } @misc{pin-rez-98-cite, author = {G. Pinto and P. de Rezende}, title = {Additively Weighted {Voronoi} Diagram in the Oriented Projective Plane}, url = {http://citeseer.nj.nec.com/article/pinto98additively.html}, howpublished = {WWW document}, year = 1998, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:pinto98additively} } %%% 1997 %%%%%%%%%%%%%%%%%%% @inproceedings{she-zha-bia-97-geoimg, author = {G. Sheikholeslami and A. Zhang and L. Bian}, title = {Geographical Image Classification and Retrieval}, booktitle = {Proc. of the 5th ACM Workshop on Geographical Information Systems}, year = 1997, month = nov, altkeys = {b.neu-SZB97} } @article{fan-97-bramb, author = {??? Fan}, title = {??? (Something to do with bas-relief ambiguity and integrability}, journal = {???}, volume = {???}, number = {???}, pages = {???--???}, year = 1997 } @inproceedings{kal-rem-cas-etc-97-peru, author = {Alan D. Kalvin and Alfredo Remy and Luis Jaime Castillo and Kim Morla and Eduardo Nolasco and Jorge Prado and Victor Fernandez and Regulo Franco and Guillermo Wiese}, title = {Computer-Aided Reconstruction of a pre-{Inca} Temple Ceiling in {Peru}}, booktitle = {Proc. Computer Applications in Archaeology Conference (CAA 97)}, year = 1997, month = apr, comment = {See also [kal-rem-ard-etc-96-peru-tr].} } @article{wol-rig-97-ghash, author = {Haim J. Wolfson and Isidore Rigoutsos}, title = {Geometric Hashing: {An} Overview}, journal = {IEEE Computational Science and Engineering}, volume = {4}, number = {4}, pages = {10--21}, year = 1997 } @book{kur-val-97-elcbook, author = {A. Kurzhanski and I. Valyi}, title = {Ellipsoidal Calculus for Estimation and Control}, year = 1997, publisher = {Birkhauser}, comment = {Seems to be the standard reference for the Ellipsoidal Calculus.} } @misc{klu-97-relcomp, title = {Reliable Computing}, howpublished = {Kluwer Academic Publishers}, year = 1997, note = {Formerly {\it Interval Computations}}, keywords = {reliable computing} } @techreport{hei-97-aa-libs-tr, author = {W. Heidrich}, title = {A Compilation of Affine Arithmetic Versions of Common Math Library Functions}, institution = {Universit{\"a}t Erlangen-N{\"u}rnberg}, number = {3}, year = 1997, altkeys = {IMMD:5:1997} } @article{mic-mor-97-lazr, author = {Dominique Michelucci and Jean-Michel Moreau}, title = {Lazy Arithmetic}, journal = {IEEE Transactions on Computers}, volume = {46}, number = {9}, pages = {961--975}, year = 1997, month = sep, url = {http://ftp://ftp.emse.fr/pub/papers/LAZY/lazy.ps.gz}, altkeys = {Michelucci-Moreau-95} } @misc{ale-sch-97-nosta, author = {P. Alfeld and L. L. Schumaker}, title = {Non-Existence of Star-Supported Spline Bases}, institution = {University of Tennessee}, howpublished = {WWW manuscript}, year = 1997 } @article{leg-sue-97-smoo, author = {Raymond Legault and Ching Y. Suen}, title = {Optimal Local Weighted Averaging Methods in Contour Smoothing}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {19}, number = {8}, pages = {801--817}, year = 1997, comment = {[HCGL-92] Discute a optimalidade do filtro Gaussiano aplicado a dados aproximados e com ru{\'\i}do. Faz referencia a v{\'a}rios artigos que tratam do tema. Apresenta tamb{\'e}m coment{\'a}rios sobre outros filtros. Apresenta 3 crit{\'e}rios para achar os pesos que otimizam o processo de filtragem (1) minimiza a dist{\^a}ncia m{\'e}dia quadr{\'a}tica, o (2) minimiza a inclina{\c{c}}{\~a}o quadr{\'a}tica m{\'e}dia e o (3) minimiza a {\^a}ngulo de desvio quadr{\'a}tico m{\'e}dio. Para fins de demostra\,c~ao {\'e} usado modelo de ru{\'\i}do gausiano aplicado em bordo reto e depois no c{\'\i}rculo. Entretanto o m{\'e}todo serve para curvas quaisquer -- interesse dos autores reconhecimento de letras manuscritas.}, altkeys = {rlcs-97} } @inproceedings{sch-97-aagis, author = {S. Schirra}, title = {Precision and Robustness in Geometric Computations}, booktitle = {Algorithmic Foundations of Geographic Information Systems}, volume = {1340}, pages = {255--287}, year = 1997, publisher = {Springer}, note = {(to be incorporated into the Handbook on Computational Geometry)}, series = {Lecture Notes in Computer Science} } @inproceedings{sab-men-97-btup, author = {C. Menard and R. Sablatnig}, title = {On Finding Archaeological Fragment Assemblies using a Bottom-Up Design}, booktitle = {Proc. 21st Workshop of the Austrian Association for Pattern Recognition}, pages = {203--207}, year = 1997 } @inproceedings{sab-men-97-prof, author = {R. Sablatnig and C. Menard}, title = {{3D} Reconstruction of Archaeological Pottery using Profile Primitives}, booktitle = {Proc. International Workshop on Synthetic-Natural Hybrid Coding and Three-Dimensional Imaging}, pages = {93--96}, year = 1997, url = {http://www.prip.tuwien.ac.at/~sab/papers/iws3di97.pdf} } @article{bra-via-97-alias, author = {Jean-Pierre Braquelaire and Anne Vialard}, title = {A New Antialiasing Approach for Image Compositing}, journal = {The Visual Computer}, volume = {??}, number = {13}, pages = {218--227}, year = 1997, comment = {Nova t{\'e}cnica de suaviz{\c{c}}{\~a} par regi{\~o}es discretas usando caminhos eulidianos}, altkeys = {ref:BV-97} } @article{hei-bha-97-mtch, author = {Douglas R. Heisterkamp and Prabir Bhattacharya}, title = {Matching of {3D} Polygonal Arcs}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {19}, number = {1}, pages = {68--73}, year = 1997, comment = {[HCGL-95] O problema de achar casamentos aproximados entre arcos curtos e peda{\c{c}}os de um arco longo {\'e} conhecido como o problema do casamento de segmentos ( segment matching problem). Para resolve-lo, os autores prop{\~o}e uma medida de dist{\^a}ncia entre arcos polinomiais 3D de tamanhos iguais, e mostram que o valor m{\'\i}nimo desta medida de dist{\^a}ncia o menor autovalor de uma certa matriz. Usando isto, s{\~a}o determinados uma medida de discrep{\^a}ncia e um algoritmo para fazer o casamento de arcos polinomiais de diferentes comprimentos, Foram feitos testes com imagens sint{\'e}ticas.}, altkeys = {dhpb97} } @inproceedings{via-97-geox, author = {Anne Vialard}, title = {Geometrical Parameters Extration from Discrete Paths}, booktitle = {Proc. 6th International Workshop on Discrete Geometry for Computer Imagery}, volume = {1176}, pages = {24--35}, year = 1997, comment = {Apresenta um m{\'e}todo (caminhos euclidianos) para obter uma aproxima{\c{c}}{\~a}o semi-cont{\'\i}inua de um contorno discreto. Al{\'e}m disso apresenta algoritmos para estimar o comprimento, tangente e a curvatura da curva suavizada.}, series = {Lecture Notes in Computer Science}, altkeys = {AV-90} } @inproceedings{hal-97-frags, author = {Radim Hal{\'\i}{\v{r}}}, title = {Estimation of the Axis of Rotation of Fragments of Archaeological Pottery}, booktitle = {Proc. 21st Workshop of the Austrian Asoociation for Pattern Recognition (OEAGM'97)}, pages = {175--184}, year = 1997 } @misc{lan-97-zipf, author = {Gabriel Landini}, title = {{Zipf}'s Laws in the {Voynich} {Manuscript}}, url = {http://web.bham.ac.uk/G.Landini/evmt/zipf.htm}, howpublished = {WWW document}, year = 1997, month = nov } @inproceedings{bro-97-infomet, author = {Cristopher A. Brown and P. Hoch}, title = {Information Content in Surface Metrology for Functional Correlations}, booktitle = {Proceedings of the Twelfth Annual Meeting of the American Society for Precision Engineering}, pages = {118--121}, year = 1997, publisher = {American Society for Precision Engineering} } @article{bar-sha-97-match, author = {Gill Barequet and Micha Sharir}, title = {Partial Surface and Volume Matching in Three Dimensions}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {PAMI-19}, number = {9}, pages = {929--948}, year = 1997, month = sep, url = {http://www.cs.jhu.edu/~barequet/papers.html}, comment = {[HCGL-98] Neste trabalho o objetivo {\'e} achar o movimento que leva uma imagem que {\'e} a c{\'o}pia de uma parte de um objeto para o modelo correspondente. {\'E} contru{\'\i}da uma tabela de vota{\c{c}}{\~a}o que avalia a melhor rota{\c{c}}{\~a}o de um conjunto de pontos. Para isso s{\~a}o computados os footprints de cada ponto. Para fazer a indexa{\c{c}}{\~a}o s{\~a}o usadas as t{\'e}cnicas de hashing geom{\'e}trico definidas por Wolfson et al.}, altkeys = {ber-sha-97-match} } @article{guy-97-covoy, author = {Jacques B. M. Guy}, title = {The Distribution of Letters `c' and `o' in the {Voynich} {Manuscript}: {Evidence} for a Real Language?}, journal = {Cryptologia}, volume = {XXI}, number = {1}, pages = {51--54}, year = 1997, month = jan } @inproceedings{uco-tor-97-recon, author = {G{\"o}kt{\"u}rk {\"U}{\c{c}}oluk and I. Hakki Toroslu}, title = {Reconstruction of {3-D} Surface Object from its Pieces}, booktitle = {Proc. 9th Canadian Conference on Computational Geometry}, location = {Kingston, Ontario, Canada}, year = 1997, month = aug, comment = {Superseded by [uco-tor-99-recon]. [HCGL-100] Descrevem teoricamente um algoritmo para reconstru{\c{c}}{\~a}o de objetos fragmentados, onde pode existir perda de migalhas. Na abordagem utilizada os as fronteiras dos fragmentos s{\~a}o curvas no espa{\c{c}}o $3d$. Apresentam uma s{\'e}rie de propriedades das curvas no espa{\c{c}}o e prop{\~o}e um algoritmo que faz a correspond{\^e}ncia das por{\c{c}}{\~o}es que casam e das por{\c{c}}{\~o}es que n{\~a}o casam (onde houve perda de material. Para isso {\'e} constru{\'\i}da uma matriz onde s{\~a}o feitas as correspond{\^e}ncias das amostras e ent{\~a}o escolhida a maior diagonal, tomando o cuidado de considerar o fato de que as cadeias s{\~a}o circulares.}, altkeys = {cccg97} } @inproceedings{hal-flu-97-prof, author = {R. Hal{\'\i}{\v{r}} and J. Flusser}, title = {Estimation of Profiles of Sherds of Archaeological Pottery}, booktitle = {Proc. 1997 Czech Pattern Recognition Workshop (CPRW'97)}, pages = {126--130}, year = 1997, month = feb } @book{set-mei-97-bico, author = {Jo{\~a}o Setubal and Jo{\~a}o Meidanis}, title = {Introduction to Computational Molecular Biology}, pages = {296}, year = 1997, publisher = {PWS Publishing}, isbn = {0-534-95262-3}, altkeys = {ref:meidanis} } @inproceedings{goo-gui-her-tan-97-snap, author = {M. T. Goodrich and L. J. Guibas and J Hershberger and P. J. Tannenbaum}, title = {Snap Rounding Line Segments Efficiently in Two and Three Dimensions}, booktitle = {Proc. 13th Annual ACM Symp.~on Computational Geometry}, pages = {284-293}, year = 1997 } @incollection{aga-97-gsrch, author = {Pankaj K. Agarwal}, title = {Geometric Range searching}, booktitle = {{CRC} Handbook of Computational Geometry}, year = 1997, publisher = {CRC}, url = {http://citeseer.nj.nec.com/agarwal97geometric.html}, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:agarwal97geometric} } @inproceedings{dur-dre-pue-97-vicom, author = {Fr{\'e}do Durand, George Drettakis and Claude Puech}, title = {The {3-D} Visibility Complex: {A} Unified Data Structure for Global Visibility of Scenes of Polygons and Smooth Objects}, booktitle = {Proc. CCCG'97 - 9th Canadian Conference on Computational Geometry}, pages = {???--???}, year = 1997, url = {http://w3imagis.imag.fr/Publications/1997/DDP97/cccg97.ps.gz}, comment = {Uses oriented projective geometry.} } %%% 1996 %%%%%%%%%%%%%%%%%%% @inproceedings{kle-sch-96-htgrad, title = {Height Data from Gradient Fields}, author = {Reinhard Klette and Karsten Schl{\"u}ns}, booktitle = {Proc. 1996 SPIE Conference on Machine Vision Applications, Architectures, and Systems Integration}, year = 1996, pages = {204--215} } @misc{kle-sch-96-htgrf-ms, title = {Height Data from Gradient Fields}, author = {Reinhard Klette and Karsten {Schl{\"{u}}ns}}, institution = {Computer Science Department, Auckland University at Tamaki; Computer Science Department, Berlin Technical University}, year = 1996 } @inproceedings{fer-lei-96-segmchart, author = {C. R. C. Fernandes and N. J. Leite}, title = {Segmentation of Nautical Chart Components Using Mathematical Morphology}, booktitle = {Proceedings IEEE International Conference on Image Processing}, address = {Lausanne, Switzerland}, month = sep, year = 1996, altkeys = {b.neu-7,fer-lei-segmchart} } @book{jon-lin-96-gcol-bk, author = {Richard E. Jones and Rafael Dueire Lins}, title = {Garbage Collection: Algorithms for Automatic Dynamic Memory Management}, publisher = {Wiley}, year = 1996, isbn = {0-471-94148-4}, altkeys = {DBLP:books/wi/JonesL96} } @inproceedings{she-96-tri, author = {Jonathan R. Shewchuck}, title = {Triangle: {Engineering} a {2D} Quality Mesh Generator and {Delaunay} Triangulator}, booktitle = {Proceedings of the 1st Workshop on Applied Computational Geometry}, location = {Philadelphia, PA}, pages = {124-133}, year = 1996, month = may, altkeys = {she-96-triangle} } @techreport{tor-96-opflow, author = {Jos{\'e} R. A. Torre{\~a}o}, title = {Estimating {3D} Shape from the Optical Flow of Photometric Stereo Images}, institution = {Instituto de Computa{\c{c}}{\~a}o, Universidade Federal Fluminense}, number = {PEC 02/96}, year = 1996, month = apr, altkeys = {t-uff} } @book{sto-der-sal-96-wavcg, author = {Eric J. Stollnitz and Tony D. DeRose and David H. Salesin}, title = {Wavelets for Computer Graphics: {Theory} and Applications}, pages = {245}, year = 1996, publisher = {Morgan Kaufmann}, address = {San Francisco, CA}, isbn = {1-55860-375-1} } @phdthesis{duc-96-dysp, author = {M. A. Duchaineau}, title = {Dyadic Splines}, school = {Department of Computer Science, University of California at Davis}, year = 1996, url = {http://graphics.cs.ucdavis.edu/~duchaine/dyadic.html} } @inproceedings{pur-var-bor-96-epsinc, author = {A. Puri and P. Varaiya and V. Borkar}, title = {Epsilon Approximations of Differential Inclusions}, booktitle = {Proc. Hybrid Systems III}, series = {Lecture Notes in Computer Science}, volume = {1066}, pages = {362--376}, year = 1996, publisher = {Springer}, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/eapprox.ps} } @article{woo-zha-96-lipcon, author = {G. R. Wood and B. P. Zhang}, title = {Estimation of the {Lipschitz} Constant of a Function}, journal = {Journal of Global Optimization}, volume = {8}, pages = {91--103}, year = 1996, altkeys = {Wood-Zhang-96} } @phdthesis{iwa-96-thesis, author = {R. van Iwaarden}, title = {An Improved Unconstrained Global Optimization Algorithm}, school = {Department of Mathematics, University of Colorado at Denver}, year = 1996, url = {http://www.cs.hope.edu/~rvaniwaa/phd.ps.gz}, altkeys = {VanIwaarden-96} } @inproceedings{kal-rem-ard-etc-96-peru, author = {Alan D. Kalvin and Alfredo Remy and Orlando Ardito and Kim Morla and Eduardo Nolasco and Jorge Prado and Regulo Franco and Antonio Murga and Guillermo Wiese}, title = {Using Visualization in the Archaeological Excavations of a Pre-{Inca} Temple in {Peru}}, booktitle = {Proc. of Visualization '96 Conference}, pages = {359--362}, year = 1996, month = oct, comment = {See also [kal-rem-ard-etc-96-peru-tr]. Describes a database system for storing images of fragments from a mural painting, with human-specified attributes such as colors and orientation clues. A graphical interface allows fragment images to be rotated and aligned with the mouse, for virtual (but non-automated) reconstruction.} } @techreport{kal-rem-ard-etc-96-peru-tr, author = {Alan D. Kalvin and Alfredo Remy and Orlando Ardito and Kim Morla and Eduardo Nolasco and Jorge Prado and Regulo Franco and Antonio Murga and Guillermo Wiese}, title = {Using Visualization in the Archaeological Excavations of a Pre-{Inca} Temple in {Peru}}, institution = {IBM T.~J.~Watson Research Center}, number = {RC 20518}, year = 1996, type = {Research Report}, altkeys = {kal-xxx-96-peru-tr,ref:peru} } @inproceedings{sab-men-96-clas, author = {R. Sablatnig and C. Menard}, title = {Computer based Acquisition of Archaeological Finds: {The} First Step towards Automatic Classification}, booktitle = {Proc. 3rd International Symposium on Computing and Archaeology}, volume = {1}, pages = {429--446}, year = 1996 } @inproceedings{sab-men-96-clas2, author = {C. Menard and R. Sablatnig}, title = {Pictorial and 3d Data Acquisition of Archaeological Finds: {The} Basis for Automatic Classification}, booktitle = {Interfacing the Past - Computer Applications and Quantitative Methods in Archaeology - CAA95}, series = {Analecta Praehistorica Leidensia}, number = {28}, pages = {413--424}, year = 1996 } @inproceedings{mir-pal-kit-dab-96-feed, author = {M. Mirmehdi and P. L. Palmer and J. Kittler and H. Dabis}, title = {Multi-Pass Feedback Control for Object Recognition}, booktitle = {Proc. Vision Interface '96}, pages = {49--56}, year = 1996, month = may, altkeys = {mpkd-96} } @article{rot-sus-vos-96-inva, author = {Irene Rothe and Herbert Susse and Klaus Voss}, title = {The Method of Normalization to Determine Invariants}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {18}, number = {4}, pages = {366--375}, year = 1996, altkeys = {rsv-96} } @techreport{hei-slu-sei-96-aa-shtr, author = {W. Heidrich and Ph. Slusallek and Hans-Peter Seidel}, title = {Sampling Procedural Shaders using Affine Arithmetic}, institution = {Lehrstuhl f{\"u}r Informatik IX, Friedrich-Alexander-Universit{\"a}t, Erlangen-N{\"u}rnberg}, number = {11/1996}, year = 1996, month = dec, altkeys = {IMMD9:TR9:1996,hei-slu-sei-96-aashtr} } @inproceedings{bar-sha-96-foot, author = {Gill Barequet and Micha Sharir}, title = {Partial Surface Matching by using Directed Footprints}, booktitle = {Proc. 12th Annual ACM Symp.~on Computational Geometry}, pages = {409--}, year = 1996, url = {http://www.cs.jhu.edu/~barequet/papers.html}, comment = {Journal version is [ber-sha-99-foot-j]. [HCGL-99] {\'e} uma melhoria do trabalho anterior dos mesmos autores. Neste algoritmo n~ao existe qualquer depend{\^e}ncia entre os dois conjuntos de pontos.}, altkeys = {B-96,ber-sha-96-foot} } @article{ale-nea-sch-96-bbsp, author = {Peter Alfeld and Marian Neamtu and Larry L. Schumaker}, title = {{Bernstein}-{B{\'e}zier} Polynomials on Circle, Spheres, and Sphere-Like Surfaces}, journal = {Computer Aided Geometric Design}, volume = {13}, pages = {333--349}, year = 1996 } @article{ale-nea-sch-96-fisp, author = {Peter Alfeld and Marian Neamtu and Larry L. Schumaker}, title = {Fitting Scattered Data On Sphere-Like Surfaces using Spherical Splines}, journal = {Journal of Computational and Applied Mathematics}, volume = {73}, pages = {5--43}, year = 1996 } @mastersthesis{tup-96-ggia, author = {Jeffrey Allen Tupper}, title = {Graphing Equations with Generalized Interval Arithmetic}, school = {Graduate Department of Computer Science, University of Toronto}, year = 1996, url = {http://www.dgp.utoronto.ca/people/mooncake/msc.html}, altkeys = {Tupper-96} } @book{kea-96-gsea, author = {R. {Baker Kearfott}}, title = {Rigorous Global Search: {Continuous} Problems}, pages = {280}, year = 1996, month = oct, publisher = {Kluwer}, isbn = {0-7923-4238-0} } @book{kea-96-iapp, author = {R. {Baker Kearfott} and Vladik Kreinovich}, title = {Applications of Interval Computations}, series = {Applied Optimization}, volume = {3}, year = 1996, publisher = {Kluwer}, isbn = {0-7923-3847-2} } @article{kea-96-iapk, author = {R. {Baker Kearfott}}, title = {Algorithm 763: {INTERVAL\_ARITHMETIC} --- {A} {Fortran} 90 Module for an Interval Data Type}, journal = {{ACM} Transactions on Mathematical Software}, volume = {22}, number = {4}, pages = {385--392}, year = 1996, month = dec } @techreport{nun-has-kaw-oli-96-chck, author = {M. G. V. Nunes and R. Hasegawa and S. Kawamoto and M. C. F. de Oliveira and M. A. S. Turine and C. M. Ghiraldelo and O. N. Oliveira Jr. and C. R. Riolfi and N. S. Sikanski and T. B. Martins}, title = {Style and Grammar Checkers for {Brazilian} {Portuguese}}, institution = {Institute of Mathematical Sciences of S{\~a}o Carlos (ICMSC), University of S{\~a}o Paulo}, series = {Notas to ICMSC -- S{\'e}rie Computa{\c{c}}{\~a}o}, number = {25}, year = 1996, month = may } @inproceedings{fig-96-aa-surfint, author = {L. H. {de Figueiredo}}, title = {Surface Intersection using Affine Arithmetic}, booktitle = {Proc. Graphics Interface '96}, pages = {168--175}, year = 1996, month = may, altkeys = {Figueiredo-96,fig-96-siaa} } @book{ale-fro-lang-96-scic, author = {G{\"o}tz Alefeld and Andreas Frommer and Bruno Lang (eds.)}, title = {Scientific Computing and Validated Numerics}, series = {Mathematical Research}, volume = {90}, pages = {340}, year = 1996, publisher = {Akademie-Verlag}, note = {Proc. International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN-95), Wuppertal, DE}, isbn = {3-05-501737-4} } @article{ale-nea-sch-96-diba, author = {Peter Alfeld and Marian Neamtu and Larry L. Schumaker}, title = {Dimension and Local Bases of Homogeneous Spline Spaces}, journal = {SIAM Journal of Mathematical Analysis}, volume = {27}, number = {5}, pages = {1482--1501}, year = 1996, month = sep } @inproceedings{mou-fpu-96-omatch, author = {David M. Mount and Fan-Tao Pu}, title = {Stabbing Orthogonal Objects in 3-Space}, booktitle = {Proc. First CGC Workshop on Computational Geometry}, pages = {???--???}, year = 1996, publisher = {Center for Geometric Computing, Johns Hopkins University}, url = {http://www.cs.jhu.edu/labs/cgc/workshop/S1120.ps}, comment = {Uses oriented projective geometry.} } @inproceedings{eri-96-lowb-socg, author = {Jeff Erickson}, title = {New Lower Bounds for Convex Hull Problems in Odd Dimensions}, booktitle = {Symposium on Computational Geometry}, pages = {1--9}, year = 1996, url = {http://citeseer.nj.nec.com/article/erickson96new.html}, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:erickson96new,eri-96-lowb} } @article{eri-96-lowb-j, author = {Jeff Erickson}, title = {New Lower Bounds for Hopcroft's Problem (Extended Abstract)}, journal = {Discrete {\&} Computational Geometry}, volume = {16}, number = {4}, pages = {389--418}, year = 1996, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:erickson-new,eri-96-lowb} } @inproceedings{lav-fau-96-orivis, author = {Stephane Laveau and Olivier D. Faugeras}, title = {Oriented Projective Geometry for Computer Vision}, booktitle = {{ECCV} (1)}, pages = {147--156}, year = 1996, url = {http://citeseer.nj.nec.com/laveau96oriented.html}, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:laveau96oriented} } %%% 1995 %%%%%%%%%%%%%%%%%%% @article{kay-cae-95-parst, author = {G. Kay and T. Caelli}, title = {Estimating the Parameters of an Illumination Model using Photometric Stereo}, journal = {Graphical Models and Image Processing}, volume = {56}, number = {5}, pages = {365--388}, month = sep, year = 1995, comment = { Determines normals and albedos. Assumes a linear combination of Lambertian and specular (including glossy) components. Uses nonlinear regression. For real objects succeeds only in {30\%} of the pixels.} } @article{gud-rag-95-cbir, author = {V. N. Gudivada and V. V. Raghavan}, title = {Content-Based Image Retrieval Systems}, journal = {IEEE Computer}, volume = {}, number = {}, month = sep, year = 1995, altkeys = {b.neu-VEK95} } @article{vel-kuo-95-cbir-muhist, author = {A. Vellaikal and C.-C. Jay Kuo}, title = {Content-Based Retrieval using Multiresolution Histogram}, journal = {SPIE Digital Image Storage and Archiving Systems}, year = 1995, month = oct, altkeys = {b.neu-VDK95} } @mastersthesis{gue-95-nmaps, author = {Andr{\'e} Luiz Pires Guedes}, title = {Representa{\c{c}}{\~a}o de Variedades Combinat{\'o}rias de Dimens{\~a}o $n$}, school = {COPPE/Engenharia de Sistemas e Computa{\c{c}}{\~a}o, Universidade Federal do Rio de Janeiro}, pages = {71}, year = 1995, month = jan, note = {In portuguese.} } @inproceedings{mou-sto-95-clif, author = {B. Mourrain and N. Stolfi}, title = {Applications of {Clifford} Algebra in Robotics}, booktitle = {Computational Kinematics'95, Solid Mechanics and its Aplications}, pages = {141--150}, year = 1995, publisher = {Kluwer} } @inproceedings{des-var-95-infhyb, author = {A. Deshpande and P. Varaiya}, title = {Information Structures for Control and Verification of Hybrid Systems}, booktitle = {Proc. American Control Conference}, pages = {???--???}, year = 1995, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/acc95.ps} } @article{cla-rum-95-incl, author = {D. M. Cl{\'a}udio and S. M. Rump}, title = {Inclusion Methods for Real and Complex Functions in One Variable}, journal = {Revista de Inform{\'a}tica Te{\'o}rica e Aplicada}, volume = {2}, number = {1}, pages = {125--136}, year = 1995, month = jan } @inproceedings{coo-dur-gat-95-bagia, author = {D. E. Cooke and R. Duran and A. Gates}, title = {Bag Language Speeds Up Interval Computations}, booktitle = {Proc. International Workshop on Applications of Interval Computations}, pages = {64--66}, year = 1995, month = feb, altkeys = {Cooke-Duran-Gates-95} } @incollection{han-jau-95-lipop, author = {Pierre Hansen and Brigitte Jaumard}, title = {{Lipschitz} Optimization}, booktitle = {Handbook of Global Optimization}, editor = {R. Horst and P. M. Pardalos}, pages = {321--342}, year = 1995, publisher = {Kluwer}, address = {Boston}, altkeys = {Hansen-Jaumard-95} } @incollection{ale-nea-sch-95-cibb, author = {Peter Alfeld and Marian Neamtu and Larry L. Schumaker}, title = {Circular {Bernstein}-{B{\'e}zier} Polynomials}, booktitle = {Mathematical Methods in {CAGD}}, editor = {M. Daehlen and T. Lyche and L. L. Schumaker}, pages = {1--10}, year = 1995, publisher = {Vanderbilt University Press}, altkeys = {ale-nea-sch-96-cibb} } @inproceedings{gui-mar-95-rdyn, author = {L. Guibas and D. Marimont}, title = {Rounding Arrangements Dynamically}, booktitle = {Proc. 11th Ann. ACM Sympos. Comput. Geom.}, pages = {190--199}, year = 1995 } @article{par-95-opgrev, author = {Bodo Pareigis}, title = {Besprechung des Buches ``Oriented projective geometry'' von J. Stolfi}, journal = {Jahresbericht der Deutschen Mathematikervereinigung}, volume = {97}, pages = {34-36}, year = 1995 } @article{gei-gup-cos-vlo-95-deform, author = {Davi Geiger and Alok Gupta and Luiz A. Costa and John Vlontzos}, title = {Dynamic Programming for Detecting Tracking and Matching Deformable Contours}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {17}, number = {3}, pages = {294--302}, year = 1995, month = mar, altkeys = {ggcv-95} } @inproceedings{fin-hin-95-ovly, author = {Ulrich Finke and Klaus Hinrichs}, title = {Overlaying Simply Connected Planar Subdivisions in Linear Time}, booktitle = {Proc. 11th Annual ACM Symp.~on Computational Geometry}, pages = {119--126}, year = 1995 } @inproceedings{coe-cos-95-bfrac, author = {Regina C. Coelho and Luciano F. Costa}, title = {The Box-Counting Fractal Dimension: {Does} it Provide an Accurate Subsidy for Experimental Shape}, booktitle = {Proc. VIII SIBGRAPI - Simp{\'o}sio Brasileiro de Computa{\c c}{\~a}o Gr{\'a}fica e Processamento de Imagens}, pages = {183--191}, year = 1995, altkeys = {cc-95} } @article{san-nus-wol-95-molec, author = {B. Sandak and R. Nussinov and Haim J. Wolfson}, title = {An Automated Computer Vision and Robotics Based Technique for {3-D} Flexible Biomolecular Docking and Matching}, journal = {Computer Applications in the Biosciences}, volume = {11}, number = {1}, pages = {87--99}, year = 1995, comment = {[HCGL-??] Not seen.}, altkeys = {snw-95} } @article{sag-via-pot-sol-95-molec, author = {M. F. Sagot and A. Viari and J. Pothier and H. Soldano}, title = {Finding Flexible Patterns in a Text: {An} Application to Three-Dimensional Molecular Matching}, journal = {Computer Applications in the Biosciences}, volume = {11}, number = {1}, pages = {39--70}, year = 1995, month = feb, comment = {[HCGL-??] Not seen.}, altkeys = {svps-95} } @misc{kel-95-sepp, author = {Joan Keller}, title = {The Glass From {Sepphoris}: {A} Preliminary Report}, institution = {Colby College}, url = {http://www.colby.edu/rel/Glass.html}, howpublished = {WWW document}, year = 1995, altkeys = {ref:glass} } @phdthesis{chr-95-struc, author = {W. J. Christmas}, title = {Structural Matching in Computer Vision using Probabilistic Reasoning}, school = {Dept.~of Eletronic and Eletrical Engineering - University of Surrey}, year = 1995, month = sep, altkeys = {t-c-95} } @inproceedings{pin-pra-gan-95-aa-symb, author = {Axel Pinz and Manfred Prantl and Harald Ganster}, title = {Affine Matching of Intermediate Symbolic Representation}, booktitle = {Proc. CAIP'95 - 6th International Conference on Computer Analysis of Images and Patterns}, series = {Lecture Notes in Computer Science}, volume = {870}, pages = {359--367}, year = 1995, altkeys = {apg-95,pin-pra-gan-95-symb} } @article{kau-sep-pie-95-four, author = {Hannu Kauppinen and Tapio Seppanen and Matti Pietikainen}, title = {An Experimental Comparison of Autoregressive and {Fourier}-Based Descriptors in {2D} Shape Classification}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {17}, number = {2}, pages = {201--207}, year = 1995, altkeys = {ksp-95} } @article{scl-pen-95-moda, author = {Stan Sclaroff and Alex P. Pentland}, title = {Modal Matching for Correspondence and Recognition}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {17}, number = {6}, pages = {545--561}, year = 1995, altkeys = {sp-95} } @article{rhe-kim-nak-95-hang, author = {Eun Joo Rhee and Tae Kyun Kim and Masayuki Nakajima}, title = {On-Line Recognition of Cursive {Hangul} by {DP} Matching with Strutural Information}, journal = {IEICE - Transactions on Information and Systems}, volume = {E-78-D}, number = {8}, pages = {1065--1072}, year = 1995, comment = {Descreve um sistema para reconhecimento de caracteres Hangul. Usa programa{\c{c}}{\~a}o din{\^a}mica para calcular o melhor casamento dos caracteres com padr{\~o}es pr{\'e}-definidos.}, altkeys = {rkn-95} } @article{sap-tan-95-inva, author = {Guillermo Sapiro and Allen Tannenbaum}, title = {Area and Length Preserving Geometric Invariant Scale-Spaces}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {17}, number = {1}, pages = {67--72}, year = 1995, comment = {Prop\~{o}e uma representa{\c{c}}{\~a}o de m{\'u}ltiplas escalas em curvas planares sem {\em encolhimento} da curva e preservando todas as propriedades importantes na representa{\c{c}}{\~a}o multi-escala. Usa eq. de fluxo de calor. - Explains how to compute a global scale factor that corrects for the shrinkage of a contour due ...}, altkeys = {ref:sapiro} } @article{mok-95-cscale, author = {Farzin Mokhtarian}, title = {Silhouette-Based Isolated Object Recognition through Curvature Scale Space}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {17}, number = {5}, pages = {539--544}, year = 1995, comment = {Sistema de reconhecimento de objetos isolados, robusto em rela{\c{c}}{\~a}o a escala, transla{\c{c}}{\~a}o e rota{\c{c}}{\~a}o, bem como ru{\'\i}do ou deforma{\c{c}}{\~o}es locais da forma. Uma curva convexa {\'e} reconhecida usando os 4 pontos de curvatura extrema na escala mais grosseira. Uma curva conc{\^a}va, por sua vez, {\'e} reconhecida usando a representa{\c{c}}{\~a}o {\em curvature scale space} (CSS), que {\'e} baseada no conceito de {\em scale space image} introduzido por Witkin em \cite{w-83}.}, altkeys = {mo-95} } @inproceedings{que-bue-95-sym, author = {{Jos{\'e}} Manuel I. Quereda and Mateo {Buend{\'i}a} {G{\'o}mez}}, title = {A Simple Algorithm to Evaluate the Local Symmetry at Each Point of Closed Contour}, booktitle = {Proc. CAIP'95 - 6th International Conference on Computer Analysis of Images and Patterns}, series = {Lecture Notes in Computer Science}, volume = {870}, pages = {480--487}, year = 1995, month = sep, comment = {Dada uma cadeia codificada pelo c{\'o}digo de Freeman e um raio de suporte $k$, {\'e} computado o coeficiente de defici{\^e}ncia de simetria (LSD). Qu{\~a}o mais simetrica for a vizinhan\c{c}a de um ponto $p$ menor seu LSD e vice-versa. Usa uma curvatura para descobrir com {\em fica} a cadeia refletida em rela{\c{c}}{\~a}o ao ponto $p$.}, altkeys = {qg-95} } @article{zhu-chi-95-crit, author = {Pengfei Zhu and Paul M. Chirlian}, title = {On Critical Point Detection of Digital Shapes}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {17}, number = {8}, pages = {737--748}, year = 1995, comment = {Descreve um m\'{e}todo para resolver o problema da detec\c{c}\~{a}o dos pontos de curvatura m{\'a}xima (CPD). No m{\'e}todo apresentado a curvatura n{\~a}o {\'e} calculada diretamente.}, altkeys = {zc-95} } @article{has-hut-sch-95-bubb, author = {J. Hass and M. Hutchings and R. Schlafly}, title = {The Double Bubble Conjecture}, journal = {Electronic Research Announcements of the American Mathematical Society}, volume = {1}, pages = {98--102}, year = 1995, altkeys = {Hass-Hutchings-Schlafly-95} } @book{sos-95-attr, author = {S{\'o}stenes Lins}, title = {Gems, Computers and Attractors for 3-Manifolds}, year = 1995, publisher = {World Scientific} } @article{sid-sos-95-fund, author = {Said Sidki and S{\'o}stenes Lins}, title = {The Fundamental Groups of Orientable 3-Manifolds Admitting Colored Triangulations with Less Than 30 Tetrahedra}, journal = {International Journal of Algebra and Computations}, year = {1995?}, note = {To appear.} } @article{sos-95-string, author = {S{\'o}stenes Lins}, title = {A String Theory for 3-Manifolds with a {Kleinian} Action}, journal = {Journal of Knot Theory and its Ramifications}, year = {1995?}, note = {To appear.} } @article{sos-95-algo, author = {S{\'o}stenes Lins}, title = {An Effective Algorithm to Get Linking Numbers of 3-Manifolds}, journal = {Aequationes Mathematicae}, year = 1995 } @article{sil-sos-95-link, author = {Vinicius Silva and S{\'o}stenes Lins}, title = {From 3-Gems to Linking Numbers of 3-Manifolds}, journal = {Annali dell'Universit{\`a} di Ferrara}, year = {1995?}, note = {To appear.} } @inproceedings{pon-man-lin-95-cdet, author = {Madhav K. Ponamgi and Dinesh Manocha and Ming C. Lin}, title = {Incremental Algorithms for Collision Detection Between Solid Models}, booktitle = {Proc. 1995 ACM/SIGGRAPH Symposium on Solid Modeling}, pages = {293--304}, year = 1995 } @article{tru-fis-95-segm, author = {Emanuele Trucco and Robert B. Fisher}, title = {Experiments in Curvature-Based Segmentation of Range Data}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {17}, number = {2}, pages = {177--182}, year = 1995, comment = {Experimentos para avaliar um sistema de segmenta{\c{c}}{\~a}o que separa os dados em retalhos homog{\^e}neos superfic{\'\i}e, usando como informa{\c{c}}{\~a}o o sinal da curvatura m{\'e}dia e a curvatura gaussiana.}, altkeys = {tf-95} } @article{she-she-95-herm, author = {Jun Shen and Wei Shen}, title = {Image Smoothing and Edge Detection by {Hermite} Integration}, journal = {Pattern Recognition}, volume = {28}, number = {8}, pages = {1159--1166}, year = 1995, comment = {[HCGL-48]}, altkeys = {ss-95} } @article{xin-lim-hon-95-vext, author = {Kai Xin and Kah Bin Lim and Geok Soon Hong}, title = {A Scale-Space Filtering Approach For Visual Feature Extraction}, journal = {Pattern Recognition}, volume = {28}, number = {8}, pages = {1145--1158}, year = 1995, comment = {[HCGL-49]}, altkeys = {xlh-95} } @article{wil-rab-lee-gol-95-spmar, author = {Jay G. Wilpon and Lawrence R. Rabiner and Chin-Hui Lee and E. R. Goldman}, title = {Automatic Recognition of Keywords in Unconstrained Speech using Hidden Markov Models}, journal = {IEEE Transactions on Acoustics, Speech and Signal Processing}, volume = {38}, number = {11}, pages = {1870--1878}, year = 1995, altkeys = {wrlg-90} } @inproceedings{kir-sno-95-ctang, author = {David G. Kirkpatrick and Jack Snoeyink}, title = {Computing Common Tangents Without a Separating Line}, booktitle = {Workshop on Algorithms and Data Structures}, pages = {183--193}, year = 1995, url = {http://citeseer.nj.nec.com/526372.html}, altkeys = {Citeseer:kirkpatrick95computing} } @article{zis-for-mun-rot-liu-pil-95-3drec, author = {Andrew Zisserman and David A. Forsyth and Joseph L. Mundy and Charlie Rothwell and Jane Liu and Nic Pillow}, title = {{3D} Object Recognition using Invariance}, journal = {Artificial Intelligence}, volume = {78}, number = {1--2}, pages = {239--288}, year = 1995, url = {http://citeseer.nj.nec.com/zisserman94object.html}, altkeys = {Citeseer:zisserman95object} } @misc{hol-95-swey, author = {Thomas A. Holland}, title = {The Tell Es-Sweyhat Expedition - 1993--94 Annual Report}, institution = {Oriental Institute, University of Chicago}, url = {http://www-oi.uchicago.edu/OI/AR/93-94/93-94_Sweyhat.html}, howpublished = {WWW document}, year = 1995, altkeys = {ref:sweyhat} } @misc{ram-sax-95-budget, author = {Lyle Ramshaw and James B. Saxe}, title = {From Quadrangular Sets to the Budget Matroids}, year = 1995, url = {http://citeseer.nj.nec.com/article/ramshaw95from.html}, comment = {Uses oriented projective geometry.}, altkeys = {Citeseer:ramshaw-from} } @inproceedings{lew-95-opgview, author = {Robert R. Lewis}, title = {{VideHoc}: {A} Visualizer for Homogeneous Coordinates}, booktitle = {Proc. 11th Annual Symposium on Computational Geometry}, pages = {414--415}, year = 1995, publisher = {ACM Press}, url = {http://doi.acm.org/10.1145/220279.220328}, isbm = {0-89791-724-3} } @inproceedings{gol-95-maint, author = {Michael Goldwasser}, title = {An Implementation for Maintaining an Arrangement of Polygons}, booktitle = {Proc. 11th Annual Symposium on Computational Geometry}, pages = {432--433}, year = 1995, url = {http://www.geom.umn.edu/software/cglist/cglib/arrange.2-page.ps}, isbn = {0-89791-724-3} } %%% 1994 %%%%%%%%%%%%%%%%%%% @article{chr-sha-94-shcol, author = {P. H. Christensen and L. G. Shapiro}, title = {Three-Dimensional Shape from Color Photometric Stereo}, journal = {International Journal of Computer Vision}, volume = {13}, number = {2}, pages = {213--227}, year = 1994, altkeys = {chr-sha-88-shcol} } @article{lei-ber-94-imgproc, author = {N. J. Leite and G. Bertrand}, title = {A Flexible Cellular Processor for Image Processing Applications}, journal = {IFIP Trans. on Parallel and Distributed Computing}, volume = {A-44}, month = apr, year = 1994, altkeys = {b.neu-11} } @techreport{pet-fal-94-imgdb, author = {E. G. M. Petrakis and C. Faloutsos}, title = {Similarity Searching in Large Image Databases}, number = {CS-TR-3388}, institution = {Dept. of Computer Science, Univ. of Maryland}, year = 1994, month = dec, altkeys = {b.neu-PEF94} } @inproceedings{hlu-ooi-tan-94-colorcbir, author = {H. Lu and B. C. Ooi and K-L. Tan}, title = {Efficient Image Retrieval by Color Contents}, booktitle = {Lectures Notes in Computer Science}, volume = {819}, year = 1994, publisher = {Springer}, altkeys = {b.neu-Ooi94} } @misc{bar-sha-94-surfm, author = {Gill Barequet and Micha Sharir}, title = {Partial Surface and Volume Matching Three Dimensional}, url = {//www.cs.jhu.edu/~barequet/papers.html}, howpublished = {WWW document}, year = 1994, altkeys = {B-94} } @article{tel-fow-fun-han-94-parordrad, author = {Seth Teller and Celeste Fowler and Thomas Funkhouser and Pat Hanrahan}, title = {Partitioning and Ordering Large Radiosity Computations}, journal = {Computer Graphics}, volume = {28}, pages = {443--450}, year = 1994, url = {citeseer.ist.psu.edu/article/teller94partitioning.html} } @article{hay-94-psmot, author = {Hideki Hayakawa}, title = {Photometric Stereo Under a Light Source with Arbitrary Motion}, journal = {Journal of the Optical Society of America, Series A (JOSAA)}, volume = {11}, number = {11}, pages = {3079--3089}, year = 1994, month = nov, altkeys = {hay-NN-psmot} } @article{woo-94-grcvph, author = {Robert J. Woodham}, title = {Gradient and Curvature from the Photometric Stereo Method, Including Local Confidence Estimation}, journal = {Journal of the Optical Society of America, Series A}, volume = {11}, number = {11}, pages = {3050--3068}, year = 1994, altkeys = {wood-1994} } @inproceedings{mou-sto-94-invpp, author = {B. Mourrain and N. Stolfi}, title = {Invariant Theory and the Projective Plane}, booktitle = {Invariant Methods in Discrete and Computational Geometry}, pages = {???-???}, year = 1994 } @article{knu-94-prof-j, author = {O. Kn{\"u}ppel}, title = {{PROFIL}/{BIAS} - {A} Fast Interval Library}, journal = {Computing}, volume = {53}, number = {3--4}, pages = {277--287}, year = 1994 } @inproceedings{pur-var-94-dechyb, author = {A. Puri and P. Varaiya}, title = {Decidability of Hybrid Systems with Rectangular Differential Inclusion}, booktitle = {Proc. CAV 94}, pages = {???--???}, year = 1994, month = jul, url = {http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/rectan_cav94.ps} } @misc{lev-mun-phi-94-geovw, author = {Stuart Levy and Tamara Munzner and Mark Phillips}, title = {{Geomview}: {3D} Visualization Software}, institution = {Geometry Center, University of Minnesota}, url = {http://www.geom.umn.edu/software/geomview/}, howpublished = {Available}, year = 1994, altkeys = {Geomview} } @article{ben-mic-per-94-bdev, author = {M. O. Benouamer and D. Michelucci and B. P{\'e}roche}, title = {Error-Free Boundary Evaluation Based on a Lazy Rational Arithmetic: {A} Detailed Implementation}, journal = {Computer-Aided Design}, volume = {26}, number = {6}, pages = {403--416}, year = 1994, altkeys = {Benouamer-Michelucci-Peroche-94} } @article{tau-94-algrast, author = {G. Taubin}, title = {Rasterizing Algebraic Curves and Surfaces}, journal = {IEEE Computer Graphics {\&} Applications}, volume = {14}, pages = {14--23}, year = 1994, altkeys = {Taubin-94} } @article{bar-lie-sch-94-iart, author = {W. Barth and R. Lieger and M. Schindler}, title = {Ray Tracing General Parametric Surfaces using Interval Arithmetic}, journal = {The Visual Computer}, volume = {10}, number = {7}, pages = {363--371}, year = 1994, altkeys = {Barth-Lieger-Schindler-94} } @article{rat-94-bsplit, author = {D. Ratz}, title = {Box-Splitting Strategies for the Interval {Gauss}-{Seidel} Step in a Global Optimization Method}, journal = {Computing}, volume = {53}, pages = {1-16}, year = 1994, altkeys = {Ratz-94} } @article{ste-94-robu, author = {A. James Stewart}, title = {Local Robustness and its Application to Polyhedral Intersection}, journal = {International Journal of Computational Geometry and Applications}, volume = {4}, number = {1}, pages = {87--118}, year = 1994, altkeys = {Stewart-94,Stewart-ijcga94} } @inproceedings{tur-lev-94-mzip, author = {Greg Turk and Marc Levoy}, title = {Zippered Polygon Meshes from Range Images}, booktitle = {Proc. SIGGRAPH '94}, pages = {311--318}, year = 1994, month = jul } @book{gra-ryz-94-tbint, author = {I. S. Gradshtein and I. M. Ryzhik}, title = {Table of Integrals, Series, and Products}, year = 1994, publisher = {Academic Press}, edition = {fifth} } @misc{bag-94-papy, author = {Roger Bagnall}, title = {Advanced Papyrological Information System}, institution = {Duke University}, url = {http://scriptorium.lib.duke.edu/papyrus/texts/APISgrant.html}, howpublished = {WWW document}, year = 1994, altkeys = {ref:Yale} } @techreport{pop-94-sur, author = {Arthur R. Pope}, title = {Model Based Object Recognition: {A} Survey of Recent Research.}, institution = {Berkeley University}, number = {TR-94-04}, year = 1994, type = {Technical Report}, altkeys = {p-tr-94} } @article{zhu-che-tit-94-fract, author = {X. Zhu and B. Cheng and A. M. Titterington}, title = {Fractal Model of a One-Dimensional Discrete Signal and Its Implementation}, journal = {IEE Proceedings - Vision, Image {\&} Signal Processing}, volume = {141}, number = {5}, pages = {318--324}, year = 1994, month = oct, altkeys = {zct-94} } @article{far-94-vlms, author = {B. Farhang-Boroujeny}, title = {Variable-Step-Size {LMS} Algorithm: {New} Developments and Experiments}, journal = {IEE Proceedings - Vision, Image {\&} Signal Processing}, volume = {141}, number = {5}, pages = {311--317}, year = 1994, month = oct, altkeys = {fb-94} } @book{mei-set-94-ibio, author = {{Jo{\~a}o} Meidanis and {Jo{\~a}o} Carlos Setubal}, title = {Uma Introdu{\c{c}}{\~a}o {\`a} Biologia Computacional}, year = 1994, publisher = {IX Escola de Computa{\c{c}}{\~a}o - Recife, PE, Brazil}, altkeys = {ms-94} } @techreport{mir-can-94-ulse, author = {Brian Mirtich and John Canny}, title = {Impulse-Based Dynamic Simulation}, institution = {Department of Computer Science, University of California at Berkeley}, year = 1994, month = jun, altkeys = {Canny94} } @inproceedings{bar-94-npen, author = {David Baraff}, title = {Fast Contact Force Computation for Non-Penetrating Rigid Bodies}, booktitle = {Proc. SIGGRAPH'94}, pages = {23--34}, year = 1994, month = jul } @article{she-kuk-94-obja, author = {Vladimir I. Shelekhov and Sergey V. Kuksenko}, title = {Object Analysis of Program}, journal = {SIGPLAN News}, volume = {29}, number = {9}, pages = {125--134}, year = 1994, month = sep } @incollection{lis-94-dela, author = {D. Lischinski}, title = {Incremental {Delaunay} Triangulation}, booktitle = {Graphics Gems IV}, editor = {P. S. Heckbert}, pages = {47--59}, year = 1994, publisher = {Academic Press} } @article{gas-gas-94-anim, author = {Jean-Dominique Gascuel and Marie-Paule Gascuel}, title = {Displacement Constraints for Interactive Modeling and Animation of Articulated Structures}, journal = {The Visual Computer}, volume = {10}, pages = {191--204}, year = 1994, altkeys = {Gascuel94} } @book{kau-sos-94-temp, author = {Louis H. Kauffman and S{\'o}stenes Lins}, title = {{Temperley}-{Lieb} Recoupling Theory and Invariants of 3-Manifolds}, series = {Annals of Mathematical Studies}, number = {134}, year = 1994, month = sep, publisher = {Princeton University} } @article{mcl-ald-94-cube, author = {Robert A. McLaughlin and Michael D. Alder}, title = {Recognising Cubes in Images}, journal = {Pattern Recognition in Practice IV}, editor = {Vlieland}, year = 1994 } @inproceedings{ben-old-vel-94-cnst, author = {F. Benhamou and W. J. Older and A. Vellino}, title = {Constraint Logic Programming on Boolean, Integer, and Real Intervals}, booktitle = {Abstracts of the International Conference on Interval and Computer-Algebraic Methods in Science and Engineering (INTERVAL/94)}, location = {St. Petersburg, Russia}, pages = {48--50}, year = 1994, month = apr } @inproceedings{che-ovs-94-ellp, author = {F. L. Chernousko and A. I. Ovseevich}, title = {Method of Ellipsoids: {Guaranteed} Estimation in Dynamical Systems Under Uncertainties and Control}, booktitle = {Abstracts of the International Conference on Interval and Computer-Algebraic Methods in Science and Engineering (INTERVAL/94)}, location = {St. Petersburg, Russia}, pages = {66}, year = 1994, month = apr } @inproceedings{kur-94-ellp, author = {A. B. Kurzhanski}, title = {Ellipsoidal Calculus for Uncertain Dynamics}, booktitle = {Abstracts of the International Conference on Interval and Computer-Algebraic Methods in Science and Engineering (INTERVAL/94)}, location = {St. Petersburg, Russia}, pages = {162}, year = 1994, month = apr, altkeys = {kur-94-ellp} } @inproceedings{col-94-prlg, author = {Alan Colmerauer}, title = {A Legal Framework for Discussing Approximate Solving of Constraints}, booktitle = {Abstracts of the International Conference on Interval and Computer-Algebraic Methods in Science and Engineering (INTERVAL/94)}, location = {St. Petersburg, Russia}, pages = {68--70}, year = 1994, month = apr } @techreport{jan-kna-94-nres, author = {C. Jansson and O. Kn{\"u}ppel}, title = {Numerical results for a Self-Validating Global Optimization Method}, institution = {Department of Computer Science III, Technical University Hamburg-Harburg}, number = {FIK 94.1}, year = 1994 } @article{tay-lew-94-frac, author = {R. I. Taylor and P. H. Lewis}, title = {{2D} Shape Signature Based on Fractal Measurements}, journal = {IEE Proceedings - Vision, Image {\&} Signal Processing}, volume = {141}, number = {6}, pages = {422--430}, year = 1994, month = dec, altkeys = {tl-94} } @techreport{lin-man-94-ctac, author = {M. C. Lin and D. Manocha}, title = {Efficient Contact Determination Between Geometric Models}, institution = {University of North Carolina at Chapel Hill}, year = 1994 } @inproceedings{kos-bal-gan-dev-kas-94-puzz, author = {D. A. Kosiba and P. M. Devaux and S. Balasubramanian and T. L. Gandhi and R. Kasturi}, title = {An Automatic Jigsaw Puzzle Solver}, booktitle = {Proc. 12th International Conference on Pattern Recognition (ICPR'94)}, volume = {A}, pages = {616--618}, year = 1994, altkeys = {Vision-Notes:bb21020,k-94} } @article{ven-ram-nan-94-her, author = {Y. V. Venkatesh and K. Ramani and R. Nandini}, title = {{Hermite} Sieve as a Wavelet-Like Array for {1D} and {2D} Signal Decomposition}, journal = {IEE Proceedings - Vision, Image {\&} Signal Processing}, volume = {141}, number = {5}, pages = {348--356}, year = 1994, month = oct, comment = {Prop{\~o}e um novo m{\'e}todo para representa{\c{c}}{\~a}o do sinal baseado em um vetor wavelet-like que usa como base uma generaliza\c{c}ao dos polin{\^o}mios de Hermite ortonormais. (a transformada de wavelet {\'e} uma decomposi{\c{c}}{\~a}o do sinal em um conjunto de freq{\"u}encias que tem a mesma largura de banda na escala logar{\'\i}tmica).}, altkeys = {vrn-94} } @book{oro-94-cgec, author = {Joseph O'Rourke}, title = {Computational Geometry in {C}}, year = 1994, publisher = {Cambridge University Press}, isbn = {0521445922}, comment = {Textbook. Second printing with corrections; originally published in 1993. See revised and expanded 1998 edition [oro-98-cgec].} altkeys = {oro-93-cgec} } @book{mul-93-rand, author = {Ketan Mulmuley}, title = {Computational Geometry: {An} Introduction through Randomized Algorithms}, year = 1993, publisher = {Pearson}, isbn = {978-0133363630}, pages = {447}, comment = {Softcover. See also [mul-94-rand]. Same book, new publisher.} } @book{mul-94-rand, author = {Ketan Mulmuley}, title = {Computational Geometry: {An} Introduction through Randomized Algorithms}, year = 1994, publisher = {Prentice Hall}, isbn = {9780133363630}, pages = {447}, comment = {Hardcover. See also [mul-93-rand]. Same book, old publisher.} } @inproceedings{ver-94-fac, author = {R. Vergnieux}, title = {Le Fac-Simil{\'e} {\`E}lectronique ou {Les} Restitutions Virtuelles}, booktitle = {{X$^{e}$} CNRS Table Ronde de Informatique et {\'E}gyptologie}, location = {Bordeaux, France}, pages = {???--???}, year = 1994, url = {http://silicon.Montaigne.u-bordeaux.fr/8001/HTML/ONLINE/IE10/Robert.html}, altkeys = {ver-91-fac,ref:Bordeaux} } @article{cor-mia-vez-zam-94-trade, author = {G. Cortelazzo and G. A. Mian and G. Vezzi and P. Zamperoni}, title = {Trademark Shapes Description By String-Matching Techniques}, journal = {Pattern Recognition}, volume = {27}, number = {8}, pages = {1005--1018}, year = 1994, month = aug, altkeys = {Vision-Notes:bb21304} } %%% 1993 %%%%%%%%%%%%%%%%%%% @article{weg-93-buhsort, author = {Ingo Wegener}, title = {{BOTTOM-UP-HEAPSORT}, a new variant of {HEAPSORT} beating, on an average, {QUICKSORT} (if $n$ is not very small)}, journal = {Theoretical Computer Science}, volume = {118}, number = {1}, year = 1993, issn = {0304-3975}, pages = {81--98}, doi = {http://dx.doi.org/10.1016/0304-3975(93)90364-Y}, publisher = {Elsevier}, altkeys = {ACM~Digital~Library:162643} } @inproceedings{emi-can-93-spares, author = {Ioannis Emiris and John Canny}, title = {A Practical Method for the Sparse Resultant}, booktitle = {Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation (ISSAC '93)}, location = {Kiev, Ukraine}, pages = {183--192}, year = 1993, publisher = {ACM Press}, doi = {10.1145/164081.164122}, isbn = {0-89791-604-2} } @article{mac-fox-93-path, author = {A. A. Maciejewski and J. J. Fox}, title = {Path Planning and the Topology of Configuration Space}, journal = {IEEE Transactions on Robotics and Automation}, volume = {9}, number = {4}, year = 1993, month = aug } @article{bro-cha-joh-che-93-fran, author = {C. A. Brown and P .D. Charles and W. A. Johnsen and S. Chesters}, title = {Fractal Analysis of Topographic Data by the Patchwork Method}, journal = {Wear}, volume = {161}, pages = {61--67}, year = 1993 } @book{sed-93-algm3, author = {Robert Sedgewick}, title = {Algorithms in Modula-3}, pages = {658}, year = 1993, publisher = {Addison-Wesley}, address = {Reading, Mass.}, isbn = {0-201-53351-0} } @article{neu-93-ellip, author = {A. Neumaier}, title = {The Wrapping Effect, Ellipsoid Arithmetic, Stability and Confidence Regions}, journal = {Computing Supplementum}, volume = {9}, pages = {175--190}, year = 1993, comment = {Describes Ellipsoid Arithmetic (Ellipsoidal Calculus).} } @techreport{mas-93-src100, author = {James Mason}, title = {The first 99 reports}, number = {SRC-RR-100}, institution = {Systems Research Center, Digital Equipment Corporation}, pages = {122}, year = 1993, month = jun, note = {The hardcopy version contains many cartoons by Jorge Stolfi, Luca Cardelli, and others.} } @article{jon-per-stu-93-lipop, author = {D. R. Jones and C. D. Perttunen and B. E. Stuckman}, title = {{Lipschitzian} Optimization without the {Lipschitz} Constant}, journal = {Journal of Optimization Theory and Applications}, volume = {79}, number = {1}, pages = {157--18}, year = 1993, altkeys = {Jones-Perttunen-Stuckman-93} } @article{bun-bue-93-strmat, author = {Horst Bunke and U. Buehler}, title = {Applications of Approximate String Matching to {2-D} Shape Recognition}, journal = {Pattern Recogniton}, volume = {26}, number = {12}, pages = {1797--1824}, year = 1993, altkeys = {bb-pr-93} } @book{kun-93-algm, author = {E. Kunz}, title = {Introduction to Commutative Algebra and Algebraic Geometry}, year = 1993, publisher = {Birkhauser} } @article{sap-kim-sha-kim-bru-93-evol, author = {G. Sapiro and R. Kimmel and D. Shaked and B. B. Kimia and A. M. Bruckstein}, title = {Implementing Continuous-Scale Morphology via Curve Evolution}, journal = {Pattern Recognition}, volume = {26}, number = {9}, pages = {1363--1372}, year = 1993, comment = {[HCGL-??]}, altkeys = {sksk-93} } @techreport{ber-del-93-mots, author = {S. Bercu and B. Delyon}, title = {Segmentation et Reconnaissance En-Ligne de Mots Manuscrits}, institution = {Institut National de Recherche en Informatique et en Automatique ({INRIA}) - Unit{\'e} de Recherche de Rennes}, number = {1858}, year = 1993, type = {Report}, altkeys = {bd-tr-93} } @article{wor-sme-93-cvest, author = {Marcel Worring and Arnold W. M. Smeulders}, title = {Digital Curvature Estimation}, journal = {CVGIP - Graphical Models and Image Processing: Image Understanding}, volume = {58}, number = {3}, pages = {266--382}, year = 1993, comment = {Faz um estudo dos efeitos da digitaliza{\c{c}}{\~a}o sobre a curvatura. {\'e} realizada uma an{\'a}lise t{\'e}orica do problema da estima{\c{c}}{\~a}o da curvatura.}, altkeys = {ws-93} } @article{ros-93-mult, author = {Paul L. Rosin}, title = {Multiscale Representation and Matching of Curves using Codons}, journal = {CVGIP - Graphical Models and Image Processing}, volume = {55}, number = {4}, pages = {286--310}, year = 1993, comment = {Prop\~{o}e uma extens{\~a}o do conjunto de codons (definido por Hoffman e Richards em 1982) para curvas abertas e fechadas, inclusive representando linhas retas e c{\'u}spides. Codons em diferentes escalas s~ao ligados formando {\'a}rvore de codons. Para aumentar o poder de casamento dos codons s{\~a}o acrescidos {\`a} sua representa{\c{c}}{\~a}o caracter{\'\i}sticas de forma (?). S{\~a}o tamb{\'e}m discutidas medidas de similaridade de dois codons (custo de levar uma curva a outra).}, altkeys = {ref:Rosin} } @article{nis-93-conv, author = {Hirobumi Nishida}, title = {Curve Description Based On Directional Features and Quasi-Convexity/Concavity}, journal = {Pattern Recognition}, volume = {26}, number = {9}, pages = {1383--1393}, year = 1993, comment = {[HCGL-51] M{\'e}todo para descrever a forma de caracteres manuscritos baseado na dire{\c{c}}{\~a}o e na quase-convexidade/concavidade dos mesmos.}, altkeys = {n-95} } @article{ros-ven-93-four, author = {Paul Rosin and Svetha Venkatesh}, title = {Extracting Natural Scales using The {Fourier} Description}, journal = {Pattern Recognition}, volume = {26}, number = {9}, pages = {1383--1393}, year = 1993, comment = {[HCGL-50] Objetiva, al{\'e}m de descrever o contorno, determinar as escalas mais significantes para representar as estruturas presentes nas curvas. Isto {\'e} feito determinando e examinando os descritores de Fourier. O artigo prop{\~o}e uma representa{\c{c}}{\~a}o multi-escala que elimina a redund{\^a}ncia por identificar as escalas naturais da curva.}, altkeys = {rv-93} } @inproceedings{mcl-ald-93-rsyn, author = {Robert A. McLaughlin and Michael D. Alder}, title = {Syntactic Pattern Recognition of Simple Shapes}, booktitle = {{ANZIIS-93} Conference Proceedings}, location = {Perth, Australia}, pages = {}, year = 1993 } @techreport{knu-93-bias, author = {Olaf Kn{\"u}ppel}, title = {{BIAS} --- {Basic} {Interval} {Arithmetic} {Subroutines}}, institution = {Department of Computer Science III, Technical University of Hamburg-Harburg}, number = {93.3}, year = 1993, month = jul, url = {http://www.ti3.tu-harburg.de/} } @techreport{knu-93-prof, author = {Olaf Kn{\"u}ppel}, title = {{PROFIL} --- {Programmer's} {Runtime} {Optimized} {Fast} {Interval} {Library}}, institution = {Department of Computer Science III, Technical University of Hamburg-Harburg}, number = {93.4}, year = 1993, month = jul, url = {http://www.ti3.tu-harburg.de/} } @techreport{knu-93-pbex, author = {O. Kn{\"u}ppel and T. Simenec}, title = {{PROFIL}/{BIAS} Extensions}, institution = {Department of Computer Science III, Technical University of Hamburg-Harburg}, number = {93.5}, year = 1993, month = nov, url = {http://www.ti3.tu-harburg.de/} } @techreport{ma-tho-93-smtc, author = {Ruihuna Ma and Monique Thonnat}, title = {A Robust and Efficient Stereo Matching Algorithm}, institution = {{INRIA} Institut National de Recherche en Informatique et en Automatique}, number = {1860}, year = 1993 } @article{kam-93-cold, author = {V. V. Kamat}, title = {A Survey of Techniques for Simulation of Dynamic Collision Detection and Response}, journal = {Computers {\&} Graphics}, volume = {17}, number = {4}, pages = {379--385}, year = 1993, altkeys = {Kamat93} } @mastersthesis{rod-93-anim, author = {Andr{\'e}ia Formico Rodrigues}, title = {{ANIMADO}: {Um} Prot{\'o}tipo de um Sistema de Anima{\c{c}}{\~a}o Modelada por Din{\^a}mica}, school = {State University of Campinas}, year = 1993, month = aug, altkeys = {Andreia93} } @misc{you-buc-07-povr, author = {C. Young and D. K. Buck and A. C. Collins}, title = {{POV-Ray} - {Persistence} of {Vision} {Raytracer}, Version 3.6.1}, url = {http://www.povray.org}, howpublished = {Online document, last acessed on 2007/12/08}, year = 2007 } @misc{you-buc-93-povr, author = {C. Young and D. K. Buck and A. C. Collins}, title = {{POV-Ray} - {Persistence} of {Vision} {Raytracer}, Version 2.0}, url = {http://www.povray.org}, howpublished = {Available}, year = 1993 } @inproceedings{men-ead-93-learn, author = {C{\^a}ndido X. F. Mendon{\c{c}}a and Peter Eades}, title = {Learning Aesthetics for Visualization}, booktitle = {Anais do {XX} Semin{\'a}rio Integrado de Software e Hardware}, location = {Florian{\'o}polis, SC, Brazil}, pages = {76--88}, year = 1993 } @techreport{bat-ead-tam-93-drbi, author = {G. {Di Battista} and P. D. Eades and R. Tamassia}, title = {Algorithms for Drawing Graphs: {An} Annotated Bibliography}, institution = {Department of Computer Science}, year = 1993, address = {University of Newcastle} } @article{ung-mou-93-prot, author = {Ron Unger and John Moult}, title = {Finding the Lowest Free Energy Conformation of a Protein is an {NP}-Hard Problem: {Proof} and Implications}, journal = {Bulletin of Mathematical Biology}, volume = {55}, number = {6}, pages = {1183--1198}, year = 1993 } @techreport{mor-93-fair, author = {Henry Packard Moreton}, title = {Minimum Curvature Variation Curves, Networks, and Surfaces for Fair Free-Form Shape Design}, institution = {Computer Science Division, University of California, Berkeley, CA}, year = 1993, month = mar } @inproceedings{kan-93-draw, author = {Goos Kant}, title = {A More Compact Visibility Representation}, booktitle = {Graph Drawing '93 - ALCOM International Workshop on Graph Drawing and Topological Graph Theory}, year = 1993, month = sep } @article{bar-93-cfor, author = {David Baraff}, title = {Issues in Computing Contact Forces for Non-Penetrating Rigid Bodies}, journal = {Algorithmica}, volume = {10}, pages = {292--352}, year = 1993 } @book{akl-lyo-93-pcg, author = {Selim G. Akl and K. A. Lyons}, title = {Parallel Computational Geometry}, year = 1993, publisher = {Prentice-Hall} } @article{luc-kow-93-aut, author = {Cl{\'a}udio L. Lucchesi and Tomasz Kowaltowski}, title = {Applications of Finite Automata Representing Large Vocabularies}, journal = {Software Practice and Experience}, volume = {23}, number = {1}, pages = {15--30}, year = 1993 } @misc{bra-93-manu, author = {Kenneth A. Brakke}, title = {{Surface} {Evolver} Manual}, url = {brakke@geom.umn.edu}, howpublished = {Available}, year = 1993, month = dec, organization = {The Geometry Center, University of Minnesota} } @phdthesis{lin-93-colr, author = {Ming C. Lin}, title = {Efficient Collision Detection for Animation and Robotics}, school = {University of California, Berkeley}, year = 1993, month = dec, altkeys = {Lin93} } @article{gos-gru-93-ster, author = {Ardeshir Goshtasby and William A. Gruver}, title = {Design of a Single-Lens Stereo Camera System}, journal = {Pattern Recognition}, volume = {26}, number = {6}, pages = {923--937}, year = 1993 } @inproceedings{hop-der-duc-mcd-stu-93-mesh, author = {H. Hoppe and T. DeRose and T. Duchamp and J. McDonald and W. Stuetzle}, title = {Mesh Optimization}, booktitle = {Proc. SIGGRAPH'93}, pages = {19--26}, year = 1993, month = aug } @article{bou-ber-93-long, author = {F. Boussofiane and G. Bertrand}, title = {A New Method for Recognizing and Locating Objects by Searching Longest Paths}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {26}, number = {12}, pages = {445--448}, year = 1993, comment = {Objetiva identificar e localizar objetos na cena. Os contornos dos objetos s{\~a}o descritos por linhas e segmentos. Para tal, geram caminhos em uma tabela onde as colunas representam segmentos do modelo e as colunas representam os segmentos da cena. Cada caminho um casamento entre uma parte do contorno do objeto e uma parte do contorno da cena. O maior caminho representa o melor casamento.}, altkeys = {bb-iee-92} } @article{whe-bat-93-packf, author = {Paul F. Whelan and Bruce G. Batchelor}, title = {Flexible Packing of Arbitrary Two-Dimensional ??}, journal = {Optical Engineering}, volume = {32}, number = {12}, pages = {3278--3287}, year = 1993, comment = {Descreve um sistema para {\em empacotar} objetos usando opera{\c{c}}{\~o}es morfol{\'o}gicas de processamento de imagens e heur{\'\i}sticas. que levam em conta fatores como ordena{\c{c}}{\~a}o, orienta{\c{c}}{\~a}o al{\'e}m de restri{\c{c}}{\~o}es da aplica{\c{c}}{\~a}o.}, altkeys = {wb-oe-93} } @inproceedings{whe-bat-93-packr, author = {Paul F. Whelan and Bruce G. Batchelor}, title = {Automated Packing Systems: {Review} of Industrial Implementation}, booktitle = {Proc. 2nd Conference on Machine Vision Applications, Architectures, and Systems Integration}, volume = {SPIE 2064}, pages = {358--369}, year = 1993, altkeys = {wb-mva-93} } @misc{hug-93-opgrev-comm, author = {John F. Hughes}, title = {Comments on his 1993 Review of ``{Oriented} {Projective} {Geometry}: {A} {Framework} for {Geometric} {Computations}'' by {Jorge} {Stolfi}}, howpublished = {Online document, accessed 2007-05-25 and 2022-03-07}, url = {http://cs.brown.edu/people/jhughes/papers/Hughes-OPG-1993/main.htm}, note = {``\emph{I do wish I had been more charitable in my youth. Stolfi's book is basically really good, although it does have some flaws; unfortunately in my review I concentrated on the flaws. Now that I'm older and, if not wiser, at least a little less unkind, I would write about what's good --- the underlying ideas, the beautiful formulations of things, the accessibility of the work, and the important applications --- and be less picky about details, and the fact that oriented projective geometry is really more or less equivalent to "spherical geometry," which was known and developed by Riemann. Riemann, of course, did prove a good deal about the sphere, but Stolfi tells us things that are computationally important and worthwhile, but which weren't really even reasonable questions in Riemann's day. So, far too late, I now recommend this book to those working in graphics.}''} } @article{hug-93-opgrev, author = {John F. Hughes}, title = {Review of ``{Oriented} {Projective} {Geometry}: {A} {Framework} for {Geometric} {Computations}'' by {Jorge} {Stolfi}}, journal = {SIAM Review}, volume = {35}, pages = {321--323}, year = 1993, month = jun, comment = {Negative, but see remarks by the Reviewer's himself on this review~\cite{hug-93-opgrev-comm}.} } @inproceedings{liu-mun-for-zis-rot-93-rotrec, author = {J. Liu and J. L. Mundy and D. A. Forsyth and A. Zisserman and C. A. Rothwell}, title = {Efficient Recognition of Rotationally Symmetric Surface and Straight Homogeneous Generalized Cylinders}, booktitle = {DARPA93}, pages = {755--765}, year = 1993, url = {http://citeseer.nj.nec.com/liu93efficient.html}, altkeys = {Citeseer:liu93efficient} } @inproceedings{bun-kau-93-bfs, author = {Horst Bunke and Guido Kaufmann}, title = {Jigsaw Puzzle Solving using Approximate String Matching and Best-First Search}, booktitle = {Proc. 5th International Conference on Computer Analysis of Images and Patterns (CAIP'93)}, editor = {D. Chetverikov and W. G. Kropatsch}, series = {Lecture Notes in Computer Science}, volume = {719}, pages = {299-308}, year = 1993, month = sep, publisher = {Springer}, isbn = {3-540-57233-3} } %%% 1992 %%%%%%%%%%%%%%%%%%% @article{col-jai-92-shape-bk, author = {E. North Coleman Jr. and Ramesh Jain}, title = {Obtaining 3-Dimensional Shape of Textured and Specular Surfaces using Four-Source Photometry}, book = {Shape recovery}, year = 1992, isbn = {0-86720-452-4}, pages = {180--199}, publisher = {Jones and Bartlett}, altkeys = {coleman-jain-82-shape} } @inproceedings{lei-ber-92-paralang, author = {N. J. Leite and G. Bertrand}, title = {Computational Models for Image Processing: {Towards} a Concise Parallel Language}, booktitle = {Lectures Notes on Computer Science}, volume = {634}, publisher = {Springer}, year = 1992, altkeys = {b.neu-13} } @book{ser-92-morpho, author = {Jean Serra}, title = {Image Analysis and Mathematical Morphology}, year = 1992, publisher = {Academic Press}, altkeys = {b.neu-Serra} } @inproceedings{beu-mey-92-morpho, author = {S. Beucher and F. Meyer}, title = {The Morphological Approach to Segmentation: {The} Watershed Transformation}, booktitle = {Mathematical Morphology in Image Processing}, year = 1992, publisher = {Marcel Decker}, altkeys = {b.neu-Beucher} } @book{gon-woo-92-dimpr, author = {Rafael C. Gonzalez and Richard E. Woods}, title = {Digital Image Processing (1st Edition)}, year = 1992, publisher = {Addison Wesley}, altkeys = {gonzalez} } @inproceedings{emi-can-92-remgeodeg, author = {Ioannis Z. Emiris and John F. Canny}, title = {An Efficient Approach to Removing Geometric Degeneracies}, booktitle = {Proceedings of the 8th ACM Symposium on Computational Geometry}, pages = {74--82}, year = 1992 } @article{dre-fun-92-varint, author = {Drew, M. S. and Funt, B. V.}, title = {Variational Approach to Interreflection in Color Images}, journal = {Journal of the Optical Society of America, Series A (???JOSA-A)}, volume = {9}, number = {8}, pages = {1255--1265}, year = 1992, altkeys = {Drew92} } @book{abr-ste-92-mathf, title = {Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables}, editor = {M. Abramowitz and I. A. Stegun}, pages = {xiv+1046}, year = 1992, publisher = {Dover Publications Inc.}, address = {New York}, note = {Reprint of the 1972 edition}, isbn = {0-486-61272-4}, altkeys = {abstegun} } @incollection{moo-han-lec-92-glop, author = {R. Moore and E. Hansen and A. Leclerc}, title = {Rigorous Methods for Global Optimization}, booktitle = {Recent Advances in Global Optimization}, editor = {C. A. Floudas and P. M. Pardalos}, pages = {321--342}, year = 1992, publisher = {Princeton University Press}, address = {Princeton, NJ}, altkeys = {Moore-Hansen-Leclerc-92} } @article{kea-92-iabbop, author = {R. B. Kearfott}, title = {An Interval Branch and Bound Algorithm for Bound Constrained Optimization Problems}, journal = {Journal of Global Optimization}, volume = {2}, pages = {259--280}, year = 1992, altkeys = {Kearfott-92} } @book{han-92-iaopt, author = {E. Hansen}, title = {Global Optimization using Interval Analysis}, series = {Monographs and Textbooks in Pure and Applied Mathematics}, number = {165}, year = 1992, publisher = {M. Dekker}, address = {New York}, altkeys = {Hansen-92,vtls:218205} } @inproceedings{for-mun-zis-rot-92-recrot, author = {David A. Forsyth and Joseph L. Mundy and Andrew Zisserman and Charlie Rothwell}, title = {Recognising Rotationally Symmetric Surfaces from Their Outlines}, booktitle = {Proc. 2nd European Conference on Computer Vision (ECCV92)}, pages = {639--647}, year = 1992, url = {http://citeseer.nj.nec.com/forsyth92recognising.html}, altkeys = {f-89,Citeseer:forsyth92recognising} } @article{pea-mil-92-bioseq, author = {William R. Pearson and Webb Miller}, title = {Dynamic Programming Algorithms for Biological Sequence Comparison}, journal = {Methods in Enzymology}, volume = {210}, pages = {575--601}, year = 1992, comment = {Credits Needleman and Wunsch~\cite{nee-wun-70-bioseq} as the first to use PD for biosequence comparison. They point out that although the time is $\Theta(N^2)$, the space required is only $\Theta(N)$.} } @book{sto-bul-92-inum, author = {J. Stoer and R. Bulirsch}, title = {Introduction to Numerical Analysis}, publisher = {Springer}, note = {Translated by R. Bartels, W. Gautchi, and C. Witzgall.}, series = {Texts in Applied Mathematics}, number = {12}, year = 1992, altkeys = {ref:CalcNum,ref:bul-bar-gau-92-inum} } @article{sue-fua-han-92-strat, author = {Paul Suetens and Pascal Fua and Andrew J. Hanson}, title = {Computational Strategies for Object Recognition}, journal = {ACM Computing Surveys}, volume = {24}, number = {1}, pages = {5--61}, year = 1992, altkeys = {st-fu-ha-92} } @techreport{tsa-92-aa-line-tr, author = {Frank Chee-Da Tsai}, title = {Statistical Approach to Affine Invariant Matching with Line Features}, institution = {Robotics Research Laboratory - Courant Institute of Mathematical Sciences - New York University}, number = {TR1992-621}, pages = {25}, year = 1992, month = nov, altkeys = {tsai-1,tsa-92-line-tr} } @techreport{tsa-93-line-tr, author = {Frank Chee-Da Tsai}, title = {using Line Invariants for Object Recognition by Invariant Geometric Hashing}, institution = {Robotics Research Laboratory - Courant Institute of Mathematical Sciences - New York University}, number = {TR1992-625}, pages = {18}, year = 1993, month = feb, altkeys = {tsai-tr-93} } @inproceedings{whe-bat-92-pack, author = {Paul F. Whelan and Bruce G. Batchelor}, title = {Development of a Vision System for the Flexible Packing of Random Shapes}, booktitle = {Proc. 2nd Conference on Machine Vision Applications, Architectures, and Systems Integration}, volume = {SPIE 1823}, pages = {223--232}, year = 1992, altkeys = {wb-mva-92} } @techreport{hut-ruc-92-haus-tr, author = {Daniel P. Huttenlocher and William J. Rucklidge}, title = {A Multi-Resolution Technique for Comparing Images using the {Hausdorff} Distance}, institution = {Department of Computer Science - Cornell University}, number = {92-1321}, year = 1992, altkeys = {hr-tr-92} } @article{mok-mac-92-multi, author = {Farzin Mokhtarian and Alan K. Mackworth}, title = {A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {14}, number = {8}, pages = {789--805}, year = 1992, comment = {[HCGL-56] Apresenta a teoria de multi-escala baseada na representa{\c{c}}{\~a}o de curvas planares usando curvatura. O artigo descreve propriedades relevantes da representa{\c{c}}{\~a}o por curvaturas. S{\~a}o apresentados propriedades e teoremas ralativo a propriedades da evolu{\c{c}}{\~a}o e do comprimento de arco nas curvas.}, altkeys = {mm-92} } @book{har-92-mod3, author = {Samuel P. Harbison}, title = {Modula-3}, year = 1992, publisher = {Prentice-Hall}, altkeys = {ref:harbison,ref:Mod1} } @inproceedings{rot-zis-for-mun-92-canf, author = {Charles A. Rothwell and Andrew Zisserman and David A. Forsyth and Joseph L. Mundy}, title = {Canonical Frames for Planar Object Recognition}, booktitle = {Proc. European Conference on Computer Vision (ECCV92)}, pages = {}, year = 1992, comment = {[HCGL-17] Os autores descrevem a constru{\c{c}}{\~a}o de molduras can{\^o}nicas para etermina{\c{c}}{\~a}o de fun{\c{c}}{\~o}es de fun{\c{c}}{\~o}es de indexa{\c{c}}{\~a}o invariantes {\`a} tranforma{\c{c}}{\~o}es projetivas para curvas planares suaves e n{\~a}o alg{\'e}bricas. S{\~a}o apresentadas duas aplica{\c{c}}{\~o}es do m{\'e}todo: (1) o reconhecimento de objetos parcialmente escondidos e (2) {\'e} a montagem de um quebra-cabe{\c{c}}a cl{\'a}ssico. Nas duas aplica{\c{c}}{\~o}es {\'e} destacada a invari{\^a}ncia {\`a} pespectiva. Os modelos s{\~a}o gerados e verificados diretamente das imagens}, altkeys = {r-92} } @article{han-rhe-92-cali, author = {Min-Hong Han and Sangyong Rhee}, title = {Camara Calibration for Three-Dimensional Measurement}, journal = {Pattern Recognition}, volume = {25}, number = {2}, pages = {155--164}, year = 1992 } @techreport{rev-zip-92-text, author = {Dominique Revuz and Marc Zipstein}, title = {A Text Compression Algorithm for Natural Languages}, institution = {Institut Gaspard Monge, Universit{\'e} de Marne la Vall{\'e}e}, howpublished = {Preprint, undated.}, year = 1992, note = {To appear in the {\em Proc. Third Annual Symposium on Combinatorial Pattern Matching}.} } @inproceedings{bar-wit-92-nonp, author = {David Baraff and Andrew Witkin}, title = {Dynamic Simulation of Non-Penetrating Flexible Bodies}, booktitle = {Proc. SIGGRAPH'92}, pages = {303--309}, year = 1992, month = jul } @article{hsu-kus-sul-92-minc, author = {Lucas Hsu and Rob Kusner and John Sullivan}, title = {Minimizing the Squared Mean Curvature Integral for Surfaces in Space Forms}, journal = {Experimental Mathematics}, volume = {1}, number = {3}, pages = {191--207}, year = 1992 } @inproceedings{fer-roc-cox-92-sclp, author = {H. Ferguson and A. Rockwood and J. Cox}, title = {Topological Design of Sculpted Surfaces}, booktitle = {Proc. SIGGRAPH'92}, pages = {149--156}, year = 1992 } @inproceedings{baj-92-smuf, author = {Chandrajit L. Bajaj}, title = {Smoothing Polyhedra using Implicit Algebraic Splines}, booktitle = {Proc. SIGGRAPH'92}, pages = {79--88}, year = 1992 } @article{bra-92-evol, author = {Kenneth A. Brakke}, title = {The {Surface} {Envolver}}, journal = {Experimental Mathematics}, volume = {1}, number = {2}, pages = {141--165}, year = 1992 } @inproceedings{mor-seq-92-fair, author = {Henry P. Moreton and Carlo H. S{\'e}quin}, title = {Functional Optimization for Fair Surface Design}, booktitle = {Proc. SIGGRAPH'92}, pages = {167--176}, year = 1992 } @article{par-92-barc, author = {D. B. Parkinson}, title = {Optimised Biarc Curves with Tension}, journal = {Computer Aided Geometric Design}, pages = {207--218}, year = 1992 } @techreport{bro-her-92-anim, author = {Marc H. Brown and John Hershberger}, title = {Animation of Geometric Algorithms: {A} Video Review}, institution = {DEC Systems Research Center}, number = {87a}, year = 1992 } @techreport{bro-her-92-cols, author = {Marc H. Brown and John Hershberger}, title = {Color and Sound in Algorithm Animation}, institution = {DEC Systems Research Center}, number = {76a}, year = 1992 } @inproceedings{sos-92-tura, author = {S{\'o}stenes Lins}, title = {A Combinatorial Approach to {Turaev}-{Viro} Invariants}, booktitle = {Proc. Workshop on on Differential Geometry and Topology}, editor = {R. Caddeo and F. Tricerri}, year = 1992, month = jun, publisher = {World Scientific}, note = {Alghero (Sardegna), It{\'a}lia} } @article{kau-sos-92-vgroup, author = {Louis Kauffman and S{\'o}stenes Lins}, title = {Decomposition of the Vertex Group for 3-Manifolds}, journal = {Discrete Mathematics}, volume = {103}, pages = {49--55}, year = 1992 } @inproceedings{duf-92-iaim, author = {T. Duff}, title = {Interval Arithmetic and Recursive Subdivision for Implicit Functions and Constructive Solid Geometry}, booktitle = {Proc. SIGGRAPH'92}, pages = {131--138}, year = 1992, month = jul, altkeys = {Duff-92} } @inproceedings{sny-92-iacg, author = {J. M. Snyder}, title = {Interval Analysis for Computer Graphics}, booktitle = {Proc. SIGGRAPH'92}, pages = {121--130}, year = 1992, month = jul, note = {Special Issue of ACM Computer Graphics}, altkeys = {Snyder-92} } @inproceedings{gle-kas-92-ref, author = {M. Gleicher and M. Kass}, title = {An Interval Refinement Technique for Surface Intersection}, booktitle = {Proc. Graphics Interface '92}, pages = {242--249}, year = 1992, month = may, altkeys = {Gleicher-Kass-92} } @article{jor-bov-92-chrd, author = {John R. {Jordan III} and Alan C. Bovik}, title = {Using Chromatic Information in Dense Stereo Correspondence}, journal = {Pattern Recognition}, volume = {25}, number = {4}, pages = {367--383}, year = 1992 } @techreport{jan-knu-92-glun, author = {C. Jansson and O. Kn{\"u}ppel}, title = {A Global Minimization Method: {The} Multi-Dimensional Case}, institution = {Department of Computer Science III, Technical University Hamburg-Harburg}, number = {FIK 92.1}, year = 1992, altkeys = {jan-kna-92-glun,Jansson-92} } @article{wen-coh-her-92-cald, author = {Juyang Weng and Paul Cohen and Marc Herniou}, title = {Camera Calibration with Distortion Models and Accuracy Evaluation}, journal = {{IEEE} Transactions on Pattern Analysis and Machine Intelligence}, volume = {14}, number = {10}, pages = {965--980}, year = 1992, month = oct, doi = {10.1145/122718.122746} } @inproceedings{met-ter-92-defc, author = {Dimitri Metaxas and Demetri Terzopoulos}, title = {Dynamic Deformation of Solid Primitives with Constraints}, booktitle = {Proc. SIGGRAPH'92}, pages = {309--312}, year = 1992, month = jul } @inproceedings{cel-gos-91-defo, author = {George Celniker and Dave Grossard}, title = {Deformable Curve and Surface Finite-Elements for Free-Form Shape Design}, booktitle = {Proc. SIGGRAPH '91}, pages = {257--266}, year = 1991, note = {Special edition of \emph{Computer Graphics}, volume 25, issue 4.} } @article{rat-chi-92-corn, author = {Anothai Rattarangsi and Roland T. Chin}, title = {Scale-Based Detection of Corners of Planar Curves}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {14}, number = {4}, pages = {430--449}, year = 1992, comment = {[HCGL-61] Faz a localiza{\c{c}}{\~a}o dos cantos calculando a curvatura m{\'a}xima Gaussiana para as v{\'a}rias escalas da curva.}, altkeys = {rc-92} } %%% 1991 %%%%%%%%%%%%%%%%%%% @article{tag-fig-91-psdif, author = {H. D. Tagare and R. J. P. {de Figueiredo}}, title = {A Theory of Photometric Stereo for a Class of Diffuse Non-Lambertian Surfaces}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {13}, number = {2}, pages = {133--152}, year = 1991, comment = {Linear combination of Lambertian, forescatter (glossy) and backscatter surfaces. Three point-like sources, known positions. Not gauge-based.} } @article{gol-91-fp, author = {D. Goldberg}, title = {What Every Computer Scientist Should Know about Floating-Point Arithmetic}, journal = {ACM Computing Surveys}, volume = {23}, number = {1}, pages = {5--48}, year = 1991, altkeys = {Goldberg-91} } @article{far-91-polcv, author = {R. Farouki}, title = {On the Stability of Transformations between Power and {Bernstein} Polynomial Forms}, journal = {Computer Aided Geometric Design}, volume = {8}, number = {1}, pages = {29--36}, year = 1991, altkeys = {Farouki-91} } @article{rat-vol-91-iaglop, author = {H. Ratschek and R. L.Voller}, title = {What Can Interval Analysis Do for Global Optimization?}, journal = {Journal of Global Optimization}, volume = {1}, number = {2}, pages = {111-130}, year = 1991, altkeys = {Ratschek-Voller-91} } @book{gri-cor-91-adiff, title = {Automatic Differentiation of Algorithms: {Theory}, Implementation, and Application}, editor = {A. Griewank and G. F. Corliss}, year = 1991, publisher = {SIAM}, address = {Philadelphia, Penn.}, altkeys = {Griewank-Corliss-91} } @article{vas-91-lagr, author = {N. Vasilonikolidakis and G. J. Clapworthy}, title = {Inverse {Lagrangian} Dynamics for Animating Articulated Models}, journal = {Journal of Visualization and Computer Animation}, volume = {2}, number = {3}, pages = {106--113}, year = 1991, month = sep, issn = {1049-8907}, altkeys = {vas-00-lagr,Vasilonikolidakis:1991:ILD} } @article{kar-kie-nac-91-ratvor, author = {Michael Karasick and Deter Kieber and Lee R. Nackman}, title = {Efficient Delaunay Triangulation using Rational Arithmetic}, journal = {ACM Transactions on Graphics}, volume = {10}, number = {1}, pages = {71--91}, year = 1991, month = jan, issn = {0730-0301}, comment = {Many fundamental tests performed by geometric algorithms can be formulated in terms of finding the sign of a determinant. When these tests are implemented using fixed precision arithmetic such as floating point, they can produce incorrect answers; when they are implemented using arbitrary-precision arithmetic, they are expensive to compute. We present adaptive-precision algorithms for finding the signs of determinants of matrices with integer and rational elements. These algorithms were developed and tested by integrating them into the Guibas-Stolfi Delaunay triangulation algorithm. Through a combination of algorithm design and careful engineering of the implementation, the resulting program can triangulate a set of random rational points in the unit circle only four to five times slower than can a floating-point implementation of the algorithm. The algorithms, engineering process, and software tools developed are described.}, altkeys = {Karasick:1991:EDT} } @article{web-laf-sta-91-puzz, author = {Roger W. Webster and Paul S. LaFollette and Robert L. Stafford}, title = {Isthmus Critical Points for Solving Jigsaw Puzzles in Computer Vision}, journal = {IEEE Transactions on Systems, Man and Cybernetics}, volume = {21}, number = {5}, pages = {1271--1278}, year = 1991, altkeys = {wls-tsmc-91} } @article{mos-91-immt, author = {Mehran Moshfeghi}, title = {Elastic Matching of Multimodality Medical Images}, journal = {CVGIP: Graphical Models and Image Processing}, volume = {53}, number = {3}, pages = {271--282}, year = 1991, altkeys = {m-91} } @inproceedings{whe-bat-91-pack, author = {Paul F. Whelan and Bruce G. Batchelor}, title = {Automated Packing of Arbitrary Shapes}, booktitle = {Proc. 2nd Conference on Machine Vision Applications, Architectures, and Systems Integration}, volume = {SPIE 1615}, pages = {77--86}, year = 1991, altkeys = {wb-mva-91} } @phdthesis{sal-91-eps, author = {David Salesin}, title = {{Epsilon} {Geometry}: {Building} Robust Algorithms from Imprecise Computations}, school = {Stanford University}, year = 1991 } @book{nel-91-mod3, author = {Greg Nelson}, title = {Systems Programming with {Modula-3}}, year = 1991, publisher = {Prentice-Hall}, altkeys = {ref:nelson,ref:Mod2} } @article{wue-boy-91-cdec, author = {Daniel M. Wuescher and Kim L. Boyer}, title = {Robust Contour Decomposition using a Constant Curvature Criterion}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {13}, number = {1}, pages = {41--51}, year = 1991, comment = {[HCGL-66] Introduz uma nova t{\'e}cnica para a parti{\c{c}}{\~a}o de contornos usando curvatura constante. Usa uma filtragem n{\~a}o linear para eliminar os pixels mal posicionados da imagem.}, altkeys = {wb-91} } @techreport{sal-91-epstr, author = {David Salesin}, title = {{Epsilon} {Geometry}: {Building} Robust Algorithms from Imprecise Computations}, institution = {Computer Science Department, Stanford University}, number = {STAN-CS-91-1398}, year = 1991 } @techreport{jan-91-glun, author = {C. Jansson}, title = {A Global Minimization Method: {The} One-Dimensional Case}, institution = {Department of Computer Science III, Technical University Hamburg-Harburg}, number = {FIK 91.2}, year = 1991 } @article{par-mor-91-barc, author = {D. B. Parkinson and D. N. Moreton}, title = {Optimal Biarc-Curve Fitting}, journal = {Computer-Aided Design}, volume = {23}, number = {6}, pages = {411--419}, year = 1991 } @book{hel-91-cgpm, author = {M. Held}, title = {On the Computational Geometry of Pocket Machining}, series = {Lecture Notes in Computer Science}, volume = {500}, year = 1991, month = jun, publisher = {Springer}, isbn = {3-540-54103-9} } @book{car-fig-91-igc, author = {Paulo C{\'e}zar Carvalho and Luiz Henrique Figueiredo}, title = {Introdu{\c{c}}{\~a}o {\`a} Geometria Computacional}, series = {18 Col{\'o}quio Brasileiro de Matem{\'a}tica}, year = 1991, publisher = {Instituto de Matem{\'a}tica Pura e Aplicada}, address = {Rio de Janeiro, RJ, Brazil} } @article{bar-91-mulg, author = {Saulo R. M. Barros}, title = {Multigrid Methods for Two- and Three-Dimensional {Poisson}-Type Equations on the Sphere}, journal = {Journal of Computational Physics}, volume = {92}, pages = {313--348}, year = 1991 } @inproceedings{mey-ski-slo-91-surf, author = {David Meyers and Shelly Skinner and Kenneth Sloan}, title = {Surfaces From Contours: {The} Correspondence and Branching Problems}, booktitle = {Proc. Graphics Interface '91}, pages = {246--254}, year = 1991, month = jun, note = {Calgary, Alberta; 3-7 June 1991}, keywords = {surface reconstruction, tiling, meshes, surface fitting} } @techreport{mey-ski-slo-91-surftr, author = {David Meyers and Shelley Skinner and Kenneth Sloan}, title = {Surfaces from Contours}, institution = {University of Washington}, number = {TR 91-09-01}, year = 1991, abstract = {This paper is concerned with the problem of reconstructing the surfaces of three-dimensional objects, given a collection of planar contours representing cross sections through the objects. This problem has important applications in bio-medical research and instruction, solid modeling, and industrial inspection. The problem can be broken into four subproblems, the correspondence problem, the tiling problem, the branching problem, and the surface fitting problem. We describe our system for surface reconstruction from sets of contours with respect to each of these subproblems. Special attention is given to the correspondence and branching problems. We present a method which can handle sets of contours in which adjacent contours share a very contorted boundary.} } @techreport{bro-her-91-form, author = {Marc H. Brown and John Hershberger}, title = {Boolean Formulae for Simple Polygons}, institution = {DEC Systems Research Center}, number = {50a}, year = 1991 } @article{kau-sos-91-tura, author = {Louis Kauffman and S{\'o}stenes Lins}, title = {Computing {Turaev}-{Viro} Invariants for 3-Manifolds}, journal = {Manuscripta Mathematica}, volume = {72}, pages = {81--94}, year = 1991 } @article{fer-sos-91-fusion, author = {M. Ferri and S{\'o}stenes Lins}, title = {Topological Aspects of Edge-Fusion in 4-Graphs}, journal = {Journal of Combinatory Theory (B)}, volume = {51}, pages = {227--243}, year = 1991 } @book{pra-91-impr, author = {William K. Pratt}, title = {Digital Image Processing}, year = 1991, publisher = {Wiley}, edition = {second} } @book{aya-91-artf, author = {Nicholas Ayache}, title = {Artificial Vision for Mobile Robots: {Stereo} Vision and Multisensory Perception}, year = 1991, publisher = {Cambridge University Press} } @article{vay-kak-91-rgsh, author = {A. J. Vayda and A. C. Kak}, title = {A Robot System for Recognition of Generic Shaped Objects}, journal = {CVGIP: Image Understanding}, volume = {54}, number = {1}, pages = {1--46}, year = 1991, month = jul } @article{suf-fac-91-iacg, author = {K. G. Suffern and E. D. Fackerell}, title = {Interval Methods in Computer Graphics}, journal = {Computers {\&} Graphics}, volume = {15}, number = {3}, pages = {331--340}, year = 1991, altkeys = {Suffern-Fackerell-91} } @inproceedings{bar-91-fric, author = {David Baraff}, title = {Coping with Friction for Non-Penetrating Rigid Body Simulation}, booktitle = {Proc. SIGGRAPH'91}, pages = {31--40}, year = 1991, month = jul } @article{din-lan-91-string, author = {I. Dinstein and G. M. Landau}, title = {Parallel Computable Contour Based Feature Strings for {2-D} Shape Recognition}, journal = {Pattern Recognition Letters}, volume = {12}, pages = {299--306}, year = 1991, altkeys = {Vision-Notes:bb21305} } %%% 1990 %%%%%%%%%%%%%%%%%%% @article{hor-90-htgrshad, author = {Berthold K. P. Horn}, title = {Height and Gradient from Shading}, journal = {International Journal of Computer Vision}, volume = {5}, number = {1}, year = 1990, issn = {0920-5691}, pages = {37--75}, doi = {http://dx.doi.org/10.1007/BF00056771}, publisher = {Kluwer}, altkeys = {horn-90-heigradshad} } @article{nay-ike-kan-90-hyb, author = {S. Nayar and K. Ikeuchi and T. Kanade}, title = {Determining Shape and Reflectance of a Hybrid Surface by Photometric Sampling}, journal = {IEEE Transactions on Robotics and Automation}, volume = {6}, number = {4}, pages = {418--431}, year = 1990, comment = {Photometric stereo assuming a linear combination of Lambertian and mirror-like components. Does not handle glossy surfaces, constrained and known illumination. Not gauge-based.} } @article{yap-90-symgeodeg, author = {C.-K. Yap}, title = {Symbolic Treatment of Geometric Degeneracies}, journal = {Journal of Symbolic Computation}, volume = {10}, number = {3--4}, pages = {349--370}, year = 1990, publisher = {Academic Press}, issn = {0747-7171} } @book{cor-lei-riv-90-ialg, author = {Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest}, title = {Introduction to Algorithms}, pages = {1028}, year = 1990, publisher = {McGraw-Hill}, isbn = {0-262-03141-8} } @book{neu-90-iasys, author = {A. Neumaier}, title = {Interval Methods for Systems of Equations}, year = 1990, publisher = {Cambridge University Press}, address = {New York}, altkeys = {Neumaier90} } @article{kea-90-iazer, author = {R. B. Kearfott}, title = {Interval {Newton}/Generalized Bisection when there are Singularities Near Roots}, journal = {Annals of Operations Research}, volume = {25}, pages = {181--196}, year = 1990, altkeys = {Kearfott-90} } @book{hor-tuy-90-glop, author = {R. Horst and H. Tuy}, title = {Global Optimization}, year = 1990, publisher = {Springer}, address = {Berlin}, altkeys = {Horst-Tuy-90} } @book{far-90-surf, author = {Gerald E. Farin}, title = {Curves and Surfaces for Computer-Aided Geometric Design: {A} Practical Guide}, year = 1990, publisher = {Academic Press}, edition = {2nd} } @book{fal-90-fractg, author = {K. Falconer}, title = {Fractal Geometry: {Mathematical} Foundations and Applications}, year = 1990, publisher = {Wiley}, altkeys = {ref:Falconer} } @article{mee-she-roz-90-chain, author = {Peter Meer and C. Allen Sher and Azriel Rosenfeld}, title = {The Chain Pyramid: {Hierarchical} Contour Processing}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {12}, number = {4}, pages = {363--375}, year = 1990, comment = {[HCGL-63]}, altkeys = {msr-90} } @article{liu-sri-90-shap, author = {Hong-Chih Liu and Mandyam D. Srinath}, title = {Partial Shape Classification using Contour Matching in Distance Transformation}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {12}, number = {11}, pages = {1072--1079}, year = 1990, comment = {[HCGL-59]}, altkeys = {ls-90} } @article{ben-ekl-90-multi, author = {Ann Bengtsson and Jan-Olof Eklundh}, title = {Shape Representation by Multiscale Contour Approximation}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {13}, number = {1}, pages = {85--93}, year = 1990, comment = {[HCGL-60]}, altkeys = {be-90} } @article{alt-gis-mye-lip-90-align, author = {F. Altschul and W. Gish and E. W. Myers and David J. Lipman}, title = {A Basic Aligment Search Tool}, journal = {Journal of Molecular Biology}, volume = {215}, pages = {403--410}, year = 1990, altkeys = {agml-90} } @article{ans-del-90-land, author = {Nirwan Ansari and Edward J. Delp}, title = {Partial Shape Recognition: {A} Landmark-Based Approach}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {12}, number = {5}, pages = {470--482}, year = 1990, comment = {[HCGL-62]}, altkeys = {ad-90} } @article{lin-90-scale, author = {Tony Lindeberg}, title = {Scale-Space for Discrete Signals}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {12}, number = {3}, pages = {234--254}, year = 1990, comment = {[HCGL-62]}, altkeys = {l-90} } @inproceedings{wol-90-hash, author = {Haim J. Wolfson}, title = {Model-Based Object Recognition by Geometric Hashing}, booktitle = {Proc. 1st European Conference on Computer Vision}, volume = {427}, pages = {526--536}, year = 1990, publisher = {Springer}, comment = {Discute o paradigma do {\em hashing} geom{\'e}trico para o reconhecimento baseado em modelo (model-based) servindo para modelos 2D e 3D. Compara tamb{\'e}m o hashing geom{\'e}trico com a transformada de Hough e com as t{\'e}cnicas de alinhamento}, series = {Lecture Notes in Computer Science}, altkeys = {w-90} } @misc{glo-90-fran-www, author = {K. T. Glowacki}, title = {{Franchthi} Excavations: 17,000 Years of {Greek} Prehistory}, url = {http://www.indiana.edu/~archaeol/franchthi/franchthi/pot.html}, howpublished = {WWW document}, year = 1990, publisher = {Dept.~of Classical Studies, Indiana University, Bloomington, IN}, comment = {A WWW site documenting an ongoing excavation project. Images of hundreds of pottery fragments awaiting classification.}, altkeys = {ref:glow90} } @article{kam-eas-90-smla, author = {Behrooz Kamgar-Parsi and Roger D. Eastman}, title = {Calibration of a Stereo System with Small Relative Angles}, journal = {Computer Vison, Graphics and Image Processing}, volume = {51}, pages = {1--19}, year = 1990 } @inproceedings{mit-90-rob, author = {D. P. Mitchell}, title = {Robust Ray Intersection with Interval Arithmetic}, booktitle = {Proc. Graphics Interface '90}, pages = {68--74}, year = 1990, month = may, altkeys = {Mitchell-90} } @article{suf-90-quad, author = {K. G. Suffern}, title = {Quadtree Algorithms for Contouring Functions of Two Variables}, journal = {The Computer Journal}, volume = {33}, pages = {402--407}, year = 1990, altkeys = {Suffern-90} } @article{tri-90-sgeo, author = {Harit P. Trivedi}, title = {A Semi-Analytic Method of Determining Stereo Camera Geometry from Matched Points in a Pair of Images: {Coincident} Meridional Planes, Exact or Noisy Data}, journal = {Computer Vison, Graphics and Image Processing}, volume = {51}, pages = {299--312}, year = 1990 } @article{kag-eas-90-cali, author = {Behrooz Kamgar-Parsi and Roger D. Eastman}, title = {Calibration of a Stereo System with Small Relative Angles}, journal = {Computer Vison, Graphics and Image Processing}, volume = {51}, pages = {1--19}, year = 1990 } @article{kal-rav-90-twis, author = {Michael Kallay and Bahram Ravani}, title = {Optimal Twist Vectors as a Tool for Interpolation a Network of Curves with a Minimum Energy Surface}, journal = {Computer Aided Geometric Design}, pages = {465--473}, year = 1990 } @book{arc-pon-90-topo, author = {A. V. Arkhangel'ski\v{\i} and L. S. Pontryagin}, title = {General Topology I}, series = {Encyclopaedia of Mathematical Sciences}, volume = {17}, year = 1990, publisher = {Springer} } @inproceedings{gan-mel-she-90-redu, author = {V. G. Ganzha and S. V. Meleshko and V. P. Shelest}, title = {Application of {REDUCE} System for Analyzing Consistency of Systems of {PDE}s}, booktitle = {Proc. International Symposium on Symbolic and Algebraic Computation}, editor = {S. Watanabe and Morio Nagata}, pages = {301}, year = 1990, publisher = {Addison-Wesley}, organization = {ACM} } @article{sch-zel-90-erec, author = {Peter Schr{\"o}der and David Zeltzer}, title = {The {Virtual} {Erector} {Set}: {Dynamic} Simulation with Linear Recursive Constraint Propagation}, journal = {Computer Graphics}, volume = {24}, number = {2}, pages = {23--31}, year = 1990, month = mar } @book{fol-dam-fei-hug-90-cgra, author = {James D. Foley and Andries van Dam and Steven K. Feiner and John F. Hughes}, title = {Computer Graphics: {Principles} and Practice}, year = 1990, publisher = {Addison-Wesley}, edition = {second} } @inproceedings{her-bar-zat-90-timd, author = {Brian Von Herzen and Alan H. Barr and Harold R. Zatz}, title = {Geometric Collisions for Time-Dependent Parametric Surfaces}, booktitle = {Proc. SIGGRAPH'90}, pages = {39--48}, year = 1990, month = aug } @article{wit-gle-wel-90-dyna, author = {Andrew Witkin and Michael Gleicher and William Welch}, title = {Interactive Dynamics}, journal = {Computer Graphics}, volume = {24}, number = {2}, pages = {11--22}, year = 1990, month = mar } @inproceedings{wit-wel-90-nrig, author = {Andrew Witkin and William Welch}, title = {Fast Animation and Control of Nonrigid Structures}, booktitle = {Proc. SIGGRAPH'90}, pages = {243--250}, year = 1990, month = aug } @book{koe-90-shap, author = {Jan J. Koenderink}, title = {Solid Shape}, year = 1990, publisher = {The {MIT} Press} } @inproceedings{loo-der-90-bspl, author = {Charles Loop and Tony DeRose}, title = {Generalized B-Spline Surface of Arbitrary Topology}, booktitle = {Proc. SIGGRAPH'90}, pages = {347--356}, year = 1990, month = aug } @book{act-90-numm, author = {Forman S. Acton}, title = {Numerical Methods that Work}, year = 1990, publisher = {Harper and Row} } @article{deg-90-cont, author = {Wendelin L. F. Degen}, title = {Explicit Continuity Conditions for Adjacent {B{\'e}zier} Surface Patches}, journal = {Computer Aided Geometric Design}, pages = {181--189}, year = 1990 } @article{der-90-tcon, author = {Tony D. DeRose}, title = {Necessary and Sufficient Conditions for Tangent Plane Continuity of {B{\'e}zier} Surfaces}, journal = {Computer Aided Geometric Design}, pages = {165--179}, year = 1990 } @article{wol-90-cvmt, author = {Haim J. Wolfson}, title = {On Curve Matching}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {12}, number = {5}, pages = {483--489}, year = 1990, comment = {[HCGL-57] Apresenta dois algoritmos para fazer o casamento de duas subcurvas comuns entre duas curvas apresentadas. As curvas s{\~a}o convertidas para strings atrav{\'e}s da assinatura da curva (vide outro artigo de Wolfson). Os algoritmos fazem o melhor casamento (usando PD) das curvas.}, altkeys = {ref:wolfson} } @inproceedings{din-lan-90-string, author = {I. Dinstein and G. M. Landau}, title = {using Parallel String Matching Algorithm for Contour Based {2-D} Shape Recognition}, booktitle = {Proc. 11th International Conference on Pattern Recognition}, volume = {II}, pages = {451--455}, year = 1990, altkeys = {Vision-Notes:bb21306} } @inproceedings{bar-90-curv, author = {David Baraff}, title = {Curved Surfaces and Coherence for Non-Penetrating Rigid Body Simulation}, booktitle = {Proc. SIGGRAPH'90}, pages = {19--28}, year = 1990, month = aug, note = {Published as \emph{Computer Graphics} vol.~24 no.~4}, publisher = {ACM}, altkeys = {Baraff90} } @inproceedings{nag-ish-90-jig, author = {Kazuhiko Nagao and Naohiro Ishii}, title = {Jigsaw Puzzle Matching by Assumption-Based {TMS}}, booktitle = {Proc. 1990 Pacific Rim Conference on Artificial Intelligence}, year = 1990, month = nov } %%% 1989 %%%%%%%%%%%%%%%%%%% @techreport{hor-89-htgr-tr, author = {Bertold K. P.Horn}, title = {Height and Gradient from Shading}, institution = {Massachusetts Institute of Technology}, number = {AI Memo 1105}, year = 1989, comment = {Possibly superseded by~\cite{hor-90-htgrshad}?} } @inproceedings{woo-89-phocurv, author = {Robert J. Woodham}, title = {Determining Surface Curvature with Photometric Stereo}, booktitle = {Proceedings of the 1989 IEEE International Conference on Robotics and Automation}, volume = {1}, pages = {36--42}, year = 1989, month = may, altkeys = {ieee-1989} } @book{hof-89-smol, author = {C. M. Hoffmann}, title = {Geometric and Solid Modeling: {An} Introduction}, year = 1989, publisher = {Morgan Kaufmann}, altkeys = {hoffmann-book} } @article{wyv-wyv-89-fields, author = {B. Wyvill and G. Wyvill}, title = {Field Functions for Implicit Surfaces}, journal = {The Visual Computer}, volume = {5}, number = {1/2}, pages = {75--82}, year = 1989, altkeys = {Wyvill-Wyvill-89} } @article{kal-bar-89-imprt, author = {D. Kalra and A. H. Barr}, title = {Guaranteed Ray Intersections with Implicit Surfaces}, journal = {Computer Graphics (SIGGRAPH '89 Proceedings)}, volume = {23}, number = {3}, pages = {297--306}, year = 1989, month = jul, altkeys = {Kalra-Barr-1989} } @book{lue-89-lnlprog, author = {David G. Luenberger}, title = {Linear and Nonlinear Programming}, year = 1989, publisher = {Addison-Wesley}, address = {Reading, MA}, edition = {second}, altkeys = {Lewe89} } @book{stu-web-89-data, author = {D. F. Stubbs and N. W. Webre}, title = {Data Structures with Abstract Data Types and {Pascal}}, pages = {471}, year = 1989, publisher = {Brooks/Cole}, isbn = {0-534-09264-0}, edition = {2nd}, altkeys = {stu-web-00-data} } @techreport{luc-kow-92-aut, author = {Cl{\'a}udio L. Lucchesi and Tomasz Kowaltowski}, title = {Applications of Finite Automata Representing Large Vocabularies}, institution = {Department of Computer Science (DCC-IMECC), University of Campinas}, number = {92-01}, year = 1992, month = jan, comment = {Number also written 01/92. Incorrect month (Jun) on cover.}, altkeys = {luc-kow-89-aut} } @article{rad-bad-89-lmsurf, author = {Gerald M. Radack and Norman I. Badler}, title = {Local Matching of Surfaces using Boundary-Centered Radial Decomposition}, journal = {Computer Vision, Graphics, and Image Processing}, volume = {45}, number = {3}, pages = {380--396}, year = 1989 } @article{low-89-musm, author = {D. Lowe}, title = {Organization of Smooth Image Curves at Multiple Scales}, journal = {International Journal of Computer Vision}, volume = {3}, number = {2}, pages = {119--130}, year = 1989, comment = {[HCGL-??] Not seen.}, altkeys = {l-89} } @article{dre-lar-pan-sch-sto-89-temp, author = {W. Drews and R. Laroia and J. Pandel and A. Schumacher and A. Stolzle}, title = {{CMOS} Processor for Template-Based Speech-Recognition System}, journal = {IEE Proceedings - Vision, Image {\&} Signal Processing}, volume = {136}, number = {2}, pages = {155--161}, year = 1989, month = apr, altkeys = {dlpss-89} } @article{bur-wol-89-puzz, author = {Grigore C. Burdea and Haim J. Wolfson}, title = {Solving Jigsaw Puzzles by a Robot}, journal = {IEEE Transactions on Robotics and Automation}, volume = {5}, number = {6}, pages = {752--764}, year = 1989, comment = {Os autores resolvem um quebra-cabe{\c{c}}a t{\'\i}pico usando um rob{\^o} para fazer a montagem. Os contornos de cada peda{\c{c}}o do quebra-cabe{\c{c}}a {\'e} dividido em 4 curvas que representam cada um dos lados a serem casados. Estas curvas s{\~a}o achadas usando {\em breakpoints} que levam em conta a convexidade dos fragmentos. As curvas s{\~a}o ent{\~a}o amostradas por pontos de coordenadas (x,y) igualmente espa{\c{c}}ados ({\em arclenght}). Ent{\~a}o {\'e} usado o algoritmo de Schwartz e Sharir para achar a rota{\c{c}}{\~a}o das curvas (m{\'\i}nimos quadrados). Feito isso s{\~a}o aplicadas heur{\'\i}sticas combinat{\'o}rias (usadas por exemplo pra resover o problema do caixeiro viajante) a fim de achar uma solu{\c{c}}~ao global de custo m{\'\i}nimo.}, altkeys = {bw-tra-89} } @article{sha-and-89-estim, author = {Behzad Shahraray and David J. Anderson}, title = {Optimal Estimation of Contour Properties by Cross-Validated Regularization}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {8}, number = {6}, pages = {600--610}, year = 1989, comment = {[HCGL-53]}, altkeys = {sa-89} } @techreport{ron-har-89-draw, author = {Ron Davidson and David Harel}, title = {Drawing Graphs Nicely using Simulated Annealing}, institution = {Department of Applied Mathematics and Computer Science}, year = 1989, address = {The Weizmann Institute of Science} } @article{lie-89-subd, author = {Pascal Lienhardt}, title = {Subdivisions of N-Dimensional Spaces and N-Dimensional Generalized Maps}, journal = {Proc. 5th Annual {ACM} Symp. on Computational Geometry}, pages = {228--236}, year = 1989, month = jun } @article{kam-kaw-89-sprn, author = {Tomihisa Kamada and Satoru Kawai}, title = {An Algorithm for Drawing General Undirected Graphs}, journal = {Information Processing Letters}, pages = {7--15}, year = 1989, month = apr } @article{bri-89-ndim, author = {Erik Brisson}, title = {Representing Geometric Structures in $d$ Dimensions: {Topology} and Order}, journal = {Proc. 5th Annual {ACM} Symp. on Computational Geometry}, pages = {218--227}, year = 1989, month = jun } @article{cre-ste-89-newt, author = {James F. Cremer and A. James Stewart}, title = {The Architecture of {Newton}, a General-Purpose Dynamics Simulator}, journal = {IEEE Computer Graphics {\&} Applications}, pages = {1806--1811}, year = 1989 } @inproceedings{pen-wil-89-vibe, author = {A. Pentland and J. Williams}, title = {Good Vibrations: {Modal} Dynamics for Graphics and Animation}, booktitle = {Proc. SIGGRAPH'89}, pages = {215--222}, year = 1989, month = jul } @inproceedings{bar-89-dyna, author = {David Baraff}, title = {Analytical Methods for Dynamic Simulation of Non-Penetrating Rigid Bodies}, booktitle = {Proc. SIGGRAPH'89}, pages = {223--232}, year = 1989, month = jul, publisher = {ACM}, note = {Published as \emph{Computer Graphics} vol.~23 no.~3}, altkeys = {Baraff89} } @book{bur-fai-89-nalg, author = {R. Burden and J. Faires}, title = {Numerical Analysis}, year = 1989, publisher = {PWS-Kent}, edition = {fourth} } @book{kle-89-cavd, author = {Rolf Klein}, title = {Concrete and Abstract {Voronoi} Diagrams}, series = {Lecture Notes in Computer Science}, volume = {400}, year = 1989, publisher = {Springer}, isbn = {3-540-52055-4} } @article{sos-89-invg, author = {S{\'o}stenes Lins}, title = {Invariant Groups on Equivalent Cristallizations}, journal = {European Journal of Combinatorics}, volume = {10}, pages = {575--584}, year = 1989 } @book{san-89-mach, author = {Jorge L.C. Sanz}, title = {Advances in Machine Vision}, year = 1989, publisher = {Springer} } @book{wat-89-cgra, author = {Alan H. Watt}, title = {Three-Dimensional Computer Graphics}, year = 1989, publisher = {Addison-Wesley} } @book{man-89-algc, author = {Udi Manber}, title = {Algorithms: {A} Creative Approach}, year = 1989, publisher = {Addison-Wesley} } @article{mal-89-wave, author = {Stephane G. Mallat}, title = {A Theory for Multiresolution Signal Decomposition: {The} Wavelet Representation}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {11}, number = {7}, pages = {674--693}, year = 1989, comment = {[HCGL-58]}, altkeys = {m-89} } @incollection{hor-89-obtshpshd, author = {Berthold K. P. Horn}, title = {Obtaining Shape from Shading Information}, booktitle = {Shape from Shading}, editor = {B. K. P. Horn and M. J. Brooks}, pages = {121--171}, year = 1989, publisher = {MIT Press}, address = {Cambridge, Mass.} } @book{hor-bro-89-shpshd, author = {Berthold K. P. Horn and Michael J. Brooks}, title = {Shape from Shading}, year = 1989, publisher = {MIT Press}, address = {Cambridge, Mass.} } @article{dho-agg-89-survey, author = {U. R. Dhond and J. K. Aggarwal}, title = {Structure from Stereo - A Review}, journal = {IEEE Transactions on Systems, Machines and Cybernetics}, volume = {19}, number = {5}, pages = {1489--1510}, year = 1989 } @article{teh-chi-89-domin, author = {Cho-Huak Teh and Roland T. Chin}, title = {On the Detection of Dominant Points on a Digital Curve}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {8}, number = {1}, pages = {859--872}, year = 1989, comment = {[HCGL-54]}, altkeys = {tc-89} } %%% 1988 %%%%%%%%%%%%%%%%%%% @article{fra-che-88-enforfft, author = {Robert T. Frankot and Rama Chellappa}, title = {A Method for Enforcing Integrability in Shape from Shading Algorithms}, journal = {IEEE Trans. Pattern Analysis and Machine Intelligence}, volume = {10}, number = {4}, year = 1988, issn = {0162-8828}, pages = {439--451}, doi = {10.1109/34.3909}, altkeys = {frank-chell-89-enforfft} } @article{wu-li-88-lineint, author = {Zhongquan Wu and Lingxiao Li}, title = {A Line-Integration Based Method for Depth Recovery from Surface Normals}, journal = {Computer Vision, Graphics and Image Processing}, volume = {43}, number = {1}, year = 1988, issn = {0734-189X}, pages = {53--66}, doi = {10.1016/0734-189X(88)90042-4} } @article{ter-88-vis, author = {D. Terzopoulos}, title = {The Computation of Visible-Surface Representations}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {10}, number = {4}, pages = {417--438}, year = 1988, comment = {Considers only the problem of fitting a surface given depth field or normals, possibly with discontinuities.} } @book{hoc-eas-88-simpart, editor = {Roger W. Hockney and James W. Eastwood}, title = {Computer Simulation using Particles}, publisher = {McGraw-Hill}, year = 1988 } @book{pei-sau-88-fractal, editor = {H.-O. Peitgen and D. Saupe}, title = {The Science of Fractal Images}, publisher = {Springer-Verlag}, year = 1988 } @inproceedings{hal-88-anim-rig, author = {James K. Halen}, title = {Realistic Animation of Rigid Bodies}, pages = {299--308}, booktitle = {Proc.~SIGGRAPH '88}, year = 1988, note = {Published as \emph{Computer Graphics} vol.~22 no.~4}, publisher = {ACM}, altkeys = {Halen88} } @inproceedings{ede-muc-88-simsimpl, author = {Herbert Edelsbrunner and Ernst P. Mucke}, title = {Simulation of Simplicity: {A} Technique to Cope with Degenerate Cases in Geometric Algorithms}, booktitle = {Proceedings of the 4th ACM Symposium on Computational Geometry}, pages = {118--133}, year = 1988 } @book{kul-ste-88-scver, title = {Scientific Computation with Automatic Result Verification}, editor = {U. Kulisch and H. J. Stetter}, series = {Computing Supplementum}, volume = {6}, pages = {viii+244}, year = 1988, publisher = {Springer}, address = {Vienna}, note = {Papers from the conference held in Karlsruhe, September 30--October 2, 1987}, isbn = {3-211-82063-9}, altkeys = {Kulisch-Stetter-88} } @incollection{rum-88-verinc, author = {S. M. Rump}, title = {Algorithms for Verified Inclusions: {Theory} and Practice}, booktitle = {Reliability in Computing: {The} Role of Interval Methods in Scientific Computing}, editor = {R. E. Moore}, series = {Perspectives in Computing}, volume = {19}, pages = {109--126}, year = 1988, publisher = {Academic Press}, address = {Boston, MA}, isbn = {0-12-505630-3}, altkeys = {Rump-88} } @book{moo-88-scicomp, title = {Reliability in computing: {The} Role of Interval Methods in Scientific Computing}, editor = {R. E. Moore}, series = {Perspectives in Computing}, volume = {19}, pages = {xvi+428}, year = 1988, publisher = {Academic Press}, address = {Boston, MA}, isbn = {0-12-505630-3}, altkeys = {MR89j:65011} } @article{far-raj-88-polber, author = {R. Farouki and V. Rajan}, title = {Algorithms for Polynomials in {Bernstein} Form}, journal = {Computer Aided Geometric Design}, volume = {5}, number = {1}, pages = {1--26}, year = 1988, altkeys = {Farouki-Rajan-88} } @book{rat-rok-88-newgo, author = {H. Ratschek and J. Rokne}, title = {New Computer Methods for Global Optimization}, pages = {229}, year = 1988, publisher = {Ellis Horwood Ltd.}, altkeys = {Ratschek-Rokne-88} } @phdthesis{kli-88-clun, author = {Gudrun J. Klinker}, title = {A Physical Approach to Color Image Understanding}, school = {Carnegie Mellon University}, year = 1988, month = may } @article{pea-lib-88-bioseq, author = {William R. Pearson and David J. Lipman}, title = {Improved Tools for Biological Sequence Comparison}, journal = {Proc. National Academy of Sciences on Biochemistry}, volume = {85}, pages = {2444--2448}, year = 1988, month = apr, altkeys = {pl-88} } @inproceedings{hou-sko-88-strm, author = {Radu Houraud and Thomas Skordas}, title = {Structural Matching for Stereo Vision}, booktitle = {Proc. 9th International Conference on Pattern Recognition}, location = {Rome, Italy}, volume = {1}, pages = {439--445}, year = 1988, month = nov } @inproceedings{tak-tom-88-plan, author = {Hironobu Takahashi and Fumiaki Tomita}, title = {Planarity Constraint in Stereo Matching}, booktitle = {Proc. 9th International Conference on Pattern Recognition}, location = {Rome, Italy}, volume = {1}, pages = {446--449}, year = 1988, month = nov } @inproceedings{wu-mai-88-dynp, author = {Yifeng Wu and H. Ma{\^\i}tre}, title = {A New Dynamic Programming Method for Stereovision Ignoring Epipolar Geometry}, booktitle = {Proc. 9th International Conference on Pattern Recognition}, location = {Rome, Italy}, volume = {1}, pages = {146--148}, year = 1988, month = nov } @article{app-jac-88-scra, author = {A. Appel and G. Jacobsen}, title = {The World's Fastest {Scrabble} Program}, journal = {Communications of the ACM}, volume = {31}, number = {5}, pages = {572--578, 585}, year = 1988, month = may } @article{zuc-dav-88-dotg, author = {Steven W. Zucker and Sheldon Davis}, title = {Points and Endpoints: {A} Size/Spacing Constraint for Dot Grouping}, journal = {Perception}, volume = {17}, number = {2}, pages = {229--247}, year = 1988, month = mar } @book{man-88-solm, author = {Martti M{\"a}ntyl{\"a}}, title = {An Introduction to Solid Modeling}, year = 1988, publisher = {Computer Science Press}, address = {Rockville, MD} } @inproceedings{wit-kas-88-sptm, author = {Andrew Witkin and Michael Kass}, title = {Spacetime Constraints}, booktitle = {Proc. SIGGRAPH'88}, pages = {159--168}, year = 1988, month = aug } @inproceedings{bar-bar-88-cons, author = {Ronen Barzel and Alan H. Barr}, title = {A Modeling System Based on Dynamic Constraints}, booktitle = {Proc. SIGGRAPH'88}, pages = {179--188}, year = 1988, month = aug, note = {Published as \emph{Computer Graphics} vol.~22 no.~4}, altkeys = {Barzel88} } @inproceedings{pla-bar-88-cons, author = {John Platt and Alan H. Barr}, title = {Constraint Methods for Flexible Bodies}, booktitle = {Proc. SIGGRAPH'88}, pages = {279--288}, year = 1988, month = aug } @inproceedings{ter-wit-88-rdef, author = {Demetri Terzopoulos and Andrew Witkin}, title = {Physically-Based Models with Rigid and Deformable Components}, booktitle = {Proc. Graphics Interface'88}, pages = {146--154}, year = 1988, publisher = {Computer Graphics Society} } @inproceedings{ter-fle-88-inel, author = {Demetri Terzopoulos and Kurt Fleischer}, title = {Modeling Inelastic Deformation: {Viscoelasticity}, Plasticity, Fracture}, booktitle = {Proc. SIGGRAPH'88}, pages = {269--278}, year = 1988, month = aug } @inproceedings{moo-wil-88-cres, author = {Matthew Moore and Jane Wilhelms}, title = {Collision Detection and Response for Computer Animation}, booktitle = {Proc. SIGGRAPH'88}, pages = {289--298}, year = 1988, month = aug, note = {Published as \emph{Computer Graphics} vol.~22 no.~4}, publisher = {ACM}, altkeys = {Wilhelms88} } @inproceedings{kuc-88-rayt, author = {Roman Kuchkuda}, title = {An Introduction to Ray Tracing}, booktitle = {Proc. {NATO} Advanced Science Institute, Series F, vol.~40: Theorical Foundations of Computer Graphics and {CAD}}, location = {Lucca, Italy}, pages = {1039--1060}, year = 1988, month = jul, publisher = {Springer} } @article{sos-88-group, author = {S{\'o}stenes Lins}, title = {On the Fundamental Group of 3-Gems and a Planar Class of 3-Manifolds}, journal = {European Journal of Combinatorics}, volume = {9}, pages = {291--305}, year = 1988 } @inproceedings{hah-88-real, author = {James K. Hahn}, title = {Realistic Animation of Rigid Bodies}, booktitle = {Proc. SIGGRAPH'88}, pages = {299--308}, year = 1988, month = aug } %%% 1987 %%%%%%%%%%%%%%%%%%% @book{rou-87-artgal, author = {Joseph O'Rourke}, title = {Art Gallery Theorems and Algorithms}, publisher = {Oxford University Press}, year = 1987 } @inproceedings{arv-kir-87-rtcl, author = {James Arvo and David Kirk}, title = {Fast Ray Tracing by Ray Classification}, booktitle = {Proc. 14th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '87)}, pages = {55--64}, year = 1987, publisher = {ACM Press}, doi = {10.1145/37401.37409}, isbn = {0-89791-227-6}, altkeys = {arvo} } @article{sch-sha-87-obscu, author = {Jacob T. Schwartz and Micha Sharir}, title = {Identification of Partially Obscured Objects in Two and Three Dimensions by Matching Noisy Characteristic Curves}, journal = {International Journal of Robotics Research}, volume = {6}, number = {2}, pages = {29--44}, year = 1987, comment = {Supersedes [sch-sha-85-obscu-tr].}, altkeys = {sch-sha-87} } @article{ovs-che-87-ellip, author = {A. I. Ovseevich and F. L. Chernousko}, title = {On optimal ellipsoids approximating reachable sets}, journal = {Problems of Control and Information Theory}, volume = {16}, pages = {125--134}, year = 1987, comment = {Cited by Neumaier as a basic reference for Ellipsoid Calculus.} } @article{bar-far-jo-pip-87-ssint, author = {R. E. Barnhill and G. Farin and M. Jordan and B. R. Piper}, title = {Surface/Surface Intersection}, journal = {Computer Aided Geometric Design}, volume = {4}, number = {1-2}, pages = {3--16}, year = 1987, altkeys = {Barnhill--Farin--Jordan--Piper-1987} } @article{mur-kab-87-npquad, author = {K. G. Murty and S. N. Kabadi}, title = {Some {NP}-Complete problems in Quadratic and Nonlinear Programming}, journal = {Mathematical Programming}, volume = {39}, number = {2}, pages = {117--129}, year = 1987, altkeys = {Murty-Kabadi-87} } @book{kad-nor-87-felem, author = {H. Kaderstuncer and D. H. Norrier}, title = {Finite Element Handbook}, year = 1987, publisher = {McGraw-Hill}, altkeys = {anamaria:Fin-Elem-87} } @book{all-87-reco, author = {Peter K. Allen}, title = {Robotic Object Recognition using Vision and Touch}, year = 1987, publisher = {Kluwer} } @book{bri-87-mgrid, author = {W. L. Briggs}, title = {A Multigrid Tutorial}, year = 1987, publisher = {SIAM} } @article{dor-sme-87-cont, author = {L. Dorst and A. M. Smeulders}, title = {Lenght Estimators for Digitalized Contours}, journal = {Computer Vision Graphics Image Processing}, volume = {40}, pages = {311--333}, year = 1987, comment = {[HCGL-??] Not seen.}, altkeys = {ds-87} } @book{bar-bea-bar-87-spli, author = {H. Bartels and J. C. Beatty and B. A. Barsky}, title = {An Introduction to Splines for Use in Computer Graphics and Geometric Modeling}, year = 1987, publisher = {Morgan Kaufmann}, altkeys = {ref:bbb} } @inproceedings{dob-las-87-dim3, author = {David P. Dobkin and Michel J. Laszlo}, title = {Primitives for the Manipulations of Three-Dimensional Subdivisions}, booktitle = {Proc. 3rd {ACM} Symp. on Comp. Geometry}, pages = {86--99}, year = 1987, month = jun, publisher = {ACM Press} } @inproceedings{ter-pla-bar-fle-87-elas, author = {D. Terzopoulos and J. Platt and A. H. Barr and K. Fleischer}, title = {Elastically Deformable Models}, booktitle = {Proc. SIGGRAPH'87}, pages = {205--214}, year = 1987, month = jul } @inproceedings{isa-coh-87-kinc, author = {Paul Isaacs and Michael F. Cohen}, title = {Controlling Dynamic Simulation with Kinematic Constraints, Behavior Functions and Inverse Dynamics}, booktitle = {Proc. SIGGRAPH'87}, pages = {215--224}, year = 1987, month = jul } @book{bur-felm-87, author = {David S. Burnett}, title = {Finite Element Analysis: {From} Concepts to Applications}, year = 1987, publisher = {Addison-Wesley} } @book{ede-87-acmg, author = {Herbert Edelsbrunner}, title = {Algorithms in Combinatorial Geometry}, series = {EATCS Monographs on Theoretical Computer Science}, volume = {10}, year = 1987, publisher = {Springer} } @article{ric-sha-sos-87-gauss, author = {B. Richter and H. Shank and S{\'o}stenes Lins}, title = {The {Gauss} Code off the Plane}, journal = {Aequationes Mathematicae}, volume = {33}, pages = {81--95}, year = 1987 } @article{wil-87-moti, author = {Jane Wilhelms}, title = {Toward Automatic Motion Control}, journal = {IEEE Computer Graphics {\&} Applications}, pages = {11--22}, year = 1987, month = apr, altkeys = {Wilhelms87a} } @article{wil-87-dyn-art, author = {Jane Wilhelms}, title = {Using Dynamic Analysis for Realistic Animation of Articulated Bodies}, journal = {IEEE Computer Graphics {\&} Applications}, year = 1987, pages = {12--27}, month = jun, altkeys = {Wilhelms87b} } @inproceedings{wit-fle-bar-87-ergy, author = {Andrew Witkin and Kurt Fleischer and Alan H. Barr}, title = {Energy Constraints on Parameterized Models}, booktitle = {Proc. SIGGRAPH'87}, pages = {225--232}, year = 1987, month = jul } %%% 1986 %%%%%%%%%%%%%%%%%%% @article{wol-sch-kal-lam-88-puzz, author = {H. Wolfson and E. Schonberg and A. Kalvin and Y. Lamda}, title = {Solving Jigsaw Puzzles by Computer Vision}, journal = {Annals of Operations Research}, volume = {1986}, pages = {51--64}, year = 1988, altkeys = {w-aop-88} } @inproceedings{kaj-86-rendeq, author = {James T. kajiya}, title = {The Rendering Equation}, booktitle = {Proc.~SIGGRAPH 1986}, url = {http://www.cs.princeton.edu/courses/archive/fall02/cs526/papers/kajiya86.pdf}, doi = {10.1145/15922.15902}, year = 1986, pages = {143--150} } @article{fer-gag-gra-86-surv, author = {M. Ferri and C. Gagliardi and L. Grasselli}, title = {A Graph-Theoretical Representtation of {PL}-Manifolds - {A} Survey on Crystallizations}, journal = {Aequationes Mathematicae}, pages = {121--141}, year = 1986, publisher = {University of Waterloo} } @inproceedings{sif-sha-86-rodplan, author = {S Sifrony and M Sharir}, title = {A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space}, booktitle = {Proc. 2nd Annual ACM Symposium on Computational Geometry (SCG '86)}, location = {Yorktown Heights, NY}, pages = {178--186}, year = 1986, publisher = {ACM Press}, doi = {10.1145/10515.10535}, isbn = {0-89791-194-6}, altkeys = {sifrony} } @article{fil-mag-mar-86-surbd, author = {D. Filip and R. Magedson and R. Markot}, title = {Surface Algorithms using Bounds on Derivatives}, journal = {Computer-Aided Geometric Design}, volume = {3}, number = {4}, pages = {295--311}, year = 1986, altkeys = {FMM86,Filip-Magedson-Markot-86} } @article{mye-86-ndedit, author = {Eugene W. Myers}, title = {An $O(ND)$ Difference Algorithm and Its Variations}, journal = {Algorithmica}, volume = {1}, pages = {251--266}, year = 1986, comment = {Observes that if the costs are 1 for insertion or deletion, 0 for match, and $\geq 2$ for mismatch, then the dynamic programming algorithm for string comparison can be speeded up to $O(ND)$, where $D$ is the cost of the optimum pairing (i.e. the minimum number of insert/delete ops). Not clear whether this result can be extended to more general costs.} } @inproceedings{gre-yao-86-fres, author = {D. H. Greene and F. F. Yao}, title = {Finite-Resolution Computational Geometry}, booktitle = {Proc. 27th Annual IEEE Sympos. Found. Comput. Sci.}, pages = {143-152}, year = 1986 } @book{bra-86-fourier, author = {Ronald N. Bracewell}, title = {The {Fourier} Transform and its Applications}, year = 1986, publisher = {McGraw-Hill}, edition = {2nd}, altkeys = {ref:Bracewell} } @article{war-phe-86-patt, author = {Jon Warwick and Bob Phelds}, title = {An Aplication of Dynamic Programming to Pattern Recognition}, journal = {Journal of Operational Research Society}, volume = {37}, number = {1}, pages = {35--40}, year = 1986, altkeys = {wb-86} } @article{kal-sch-sch-sha-86-foot, author = {Alan Kalvin and Edith Schonberg and Jacob T. Schwartz and Micha Sharir}, title = {Two-Dimensional, Model-Based, Boundary Matching using Footprints}, journal = {The International Journal of Robotics Research}, volume = {5}, number = {4}, pages = {38--55}, year = 1986, comment = {Prop{\~o}e uma t{\'e}cnica para constru{\c{c}}{\~a}o de uma tabela de {\em hash} baseada em atributos geom{\'e}tricos. A constru{\c{c}}{\~a}o das chaves de indexa{\c{c}}{\~a}o da tabela de {\em hash} {\'e} feita utilizando-se {\em breakpoints}(para separar diferentes objetos sobrepostos) Footprints s{\~a}o tamb{\'e}m chamadas assinaturas de curvas. S{\~a}o mapeamentos dos pontos do objeto em curvas que s{\~a}o invariantes a rota{\c{c}}{\~o}es e transla{\c{c}}{\~o}es dos objetos. As {\em footprints} devem ser geradas a partir de informa{\c{c}}{\~o}es locais da fronteira (a {\em footprint} de um objeto parcialmente vis{\'\i}vel deve corresponder a uma por{\c{c}}{\~a}o do footprint. A t{\'e}cnica {\'e} aplicada com sucesso quando existe um grande n{\'u}mero de modelos e um pequeno n{\'u}mero de imagens a serem reconhecidas. {\'e} sublinear no n{\'u}mero de modelos.}, altkeys = {ks-jrr-86} } @article{asa-bra-86-sket, author = {Haruo Asada and Michael Brady}, title = {The Curvature Primal Sketch}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {PAMI-8}, number = {1}, pages = {1--14}, year = 1986, comment = {[HCGL-55]}, altkeys = {ab-86} } @article{bab-wit-bau-dud-86-gaus, author = {J. Babaud and A. Witkin and M. Baudin and R. Duda}, title = {Uniquess of the {Gaussian} Kernel for Scale-Space Filtering}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {8}, number = {1}, pages = {26--33}, year = 1986, comment = {Prova que o filtro gaussiano {\'e} o ``unico'' que n{\~a}o {\'e} afetado pelo efeito Gibbs}, altkeys = {bwbd-86} } @article{chi-dye-86-robv, author = {Roland T. Chin and Charles R. Dyer}, title = {Model-Based Recognition in Robot Vision}, journal = {ACM Computing Surveys}, volume = {18}, number = {1}, pages = {67--108}, year = 1986, comment = {Estudo comparativo de m{\'e}todos reconhecimento de objetos baseado em modelos ({\em model-based}). S{\~a}o abordadas representa{\c{c}}{\~a}o $2D,~~2\frac{1}{2}$ e $3D$.}, altkeys = {cd-86} } @article{wyv-kun-shi-86-ray, author = {G. Wyvill and T. .L .Kunii and Y. Shirai}, title = {Space Division for Ray Tracing in {CSG}}, journal = {IEEE Computer Graphics {\&} Applications}, year = 1986, month = apr } @book{hor-86-rvis, author = {B. K. P. Horn}, title = {Robot Vision}, year = 1986, publisher = {The {MIT} Press and McGraw-Hill} } @book{pen-pat-86-proj, author = {A. Penna and R. Patterson}, title = {Projective Geometry and its Applications to Computer Graphics}, year = 1986, publisher = {Prentice-Hall} } @article{sos-86-paint, author = {S{\'o}stenes Lins}, title = {Paintings: {A} Planar Approach to Higher Dimensions}, journal = {Geometriae Dedicata}, volume = {20}, pages = {1--25}, year = 1986 } @book{pre-fla-teu-vet-86-numr, author = {William H. Press and Brian P. Flannery and Saul A. Teukolsky and William T. Vetterling}, title = {Numerical Recipes: {The} Art of Scientific Computing}, year = 1986, publisher = {Cambridge University Press} } @article{aya-fau-86-hyper, author = {Nicholas Ayache and A. D. Faugeras}, title = {{Hyper}: {A} New Approach for the Recognition and Positioning of Two-Dimensional Objects}, journal = {Transactions on Pattern Analysis and Machine Intelligence}, volume = {PAMI-8}, number = {1}, pages = {44--54}, year = 1986, comment = {Prop{\~o}e um m{\'e}todo que visa identificar e localizar modelos em uma cena, por uma t{\'e}cnica chamada {\em HYPER} (Hypoteses Predicated and Evaluate Recursively) de gera{\c{c}}{\~a}o de hip{\'o}teses e verifica{\c{c}}{\~a}o de casamentos estrutura{\c{c}}~ao do modelo com estima{\c{c}}{\~a}o da tranforma{\c{c}}{\~a}o da cena para o modelo feita recursivamente.}, altkeys = {n-tpam-86} } @article{mok-mac-86-desc, author = {Farzin Mokhtarian and Alan Mackworth}, title = {Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {8}, number = {1}, pages = {34--43}, year = 1986, comment = {[HCGL-65] Descrevem t{\'e}cnicas para representa{\c{c}}{\~a}o de curvas planares em m{\'u}ltiplas escalas. Usam basicamente a filtragem Gaussiana e computa{\c{c}}{\~a}o dos pontos de curvatura $0$. A t{\'e}cnica permite {\em casar} partes do contorno.}, altkeys = {mm-86} } %%% 1985 %%%%%%%%%%%%%%%%%%% @book{mag-tha-85-anim, author = {Nadia Magnenat-Thalmann and Daniel Thalmann}, title = {Computer Animation: {Theory} and Practice}, publisher = {Springer-Verlag}, year = 1985 } @book{hac-85-mugrid, author = {W. Hackbuch}, title = {Multi-grid Methods and Applications}, publisher = {Springer-Verlag}, year = 1985 } @techreport{pog-voo-yul-85-edge, author = {T. Poggio and H. Voorhees and A. Yulle}, title = {A Regularized Solution to Edge Detection}, institution = {Massachusetts Institute of Technology - Artificial Intelligence Laboratory}, number = {AI Memo 833}, year = 1985, month = may, altkeys = {pvy-85} } @article{bar-85-surf, author = {R. E. Barnhill}, title = {Surfaces in Computer-Aided Geometric Design: {A} Survey with New Results}, journal = {Computer Aided Geometric Design}, volume = {2}, number = {1--3}, pages = {1--17}, year = 1985, altkeys = {Barnhill-85,bar-95-surf} } @inproceedings{jar-bea-85-wthr, author = {M. Jarraud and A. P. M. Baede}, title = {The Use of Spectral Techniques in Numerical Weather Prediction}, booktitle = {Lectures in Applied Mathematics}, volume = {22}, pages = {1--41}, year = 1985, altkeys = {for-rod-85} } @techreport{sch-sha-85-obscu-tr, author = {Jacob T. Schwartz and Micha Sharir}, title = {Identification of Partially Obscured Objects in Two and Three Dimensions by Matching Characteristic Curves}, institution = {New York University, Robotics Activity}, number = {46}, year = 1985, altkeys = {sch-sha-85} } @techreport{sch-sha-85-obscu2d-tr, author = {Jacob T. Schwartz and Micha Sharir}, title = {Identification of Partially Obscured Objects in Two Dimensions by Matching of Noisy `Characteristic Curves'}, institution = {New York University, Courant Institute of Mathematical Sciences, Department of Computer Science}, number = {165}, year = 1985, month = jun } @book{pre-sha-85-cgeo, author = {Franco P. Preparata and Michael I. Shamos}, title = {Computational Geometry: {An} Introduction}, year = 1985, publisher = {Springer}, altkeys = {preparata-85} } @article{lip-pea-85-prot, author = {David J. Lipman and William R. Pearson}, title = {Rapid and Sensitive Protein Similarity Searches}, journal = {Science}, volume = {227}, pages = {1435--1441}, year = 1985, month = mar, altkeys = {lp-85} } @book{ado-85-post, author = {{Adobe} {Systems} {Inc.}}, title = {{PostScript} Language Reference Manual}, year = 1985, publisher = {Addison-Wesley}, altkeys = {ref:post} } @inproceedings{wil-bar-85-artc, author = {Jane Wilhelms and Brian A. Barsky}, title = {using Dynamic Analysis to Animate Articulated Bodies such as Humans and Robots}, booktitle = {Proc. Graphics Interface'85}, pages = {97--105}, year = 1985, publisher = {Computer Graphics Society} } @inproceedings{arm-gre-85-dyna, author = {William W. Armstrong and Mark W. Green}, title = {The Dynamics of Articulated Rigid Bodies for Purposes of Animation}, booktitle = {Proc. Graphics Interface '85}, pages = {407--415}, year = 1985, publisher = {Computer Graphics Society}, altkeys = {Armstrong85} } @book{tou-85-cgeo, title = {Computational Geometry}, editor = {Geoffrey T. Toussaint}, year = 1985, publisher = {North-Holland} } @article{sos-85-gagl, author = {S{\'o}stenes Lins}, title = {A Simple Proof of {Gagliardi}'s Handle Recognition Theorem}, journal = {Discrete Mathematics}, volume = {57}, pages = {253--260}, year = 1985 } @article{sos-85-poly, author = {S{\'o}stenes Lins}, title = {Combinatorics of Orientation Reversing Polygons}, journal = {Aequationes Mathematicae}, volume = {29}, pages = {123--131}, year = 1985 } @article{man-sos-85-gems, author = {Arnaldo Mandel and S{\'o}stenes Lins}, title = {Graph-Encoded 3-Manifolds}, journal = {Discrete Mathematics}, volume = {57}, pages = {261--284}, year = 1985 } @inproceedings{mat-85-post, author = {Yu. V. Matijasevich}, title = {A Posteriori Interval Analysis}, booktitle = {Lecture Notes in Computer Science}, volume = {204}, pages = {328--324}, year = 1985, publisher = {Springer}, altkeys = {Matijasevich-85} } @misc{ieee-85-flop, title = {{IEEE} Standard for Binary Floating-Point Arithmetic}, howpublished = {ANSI/IEEE Standard 754-1985}, year = 1985, publisher = {IEEE}, address = {New York}, altkeys = {ieee,ie3-85-flop} } @book{gol-loa-85-matr, author = {G. Golub and C. Van Loan}, title = {Matrix Computations}, year = 1985, publisher = {Johns Hopkins University Press} } @article{tsa-yu-85-attr, author = {W. H. Tsai and S. S. Yu}, title = {Attributed String Matching with Merging for Shape Recognition}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {7}, number = {4}, pages = {453--462}, year = 1985, month = jul, altkeys = {Vision-Notes:bb21300} } %%% 1984 %%%%%%%%%%%%%%%%%%% @article{ous-84-stitch, author = {J. Ousterhout}, title = {Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools}, journal = {IEEE Transactions on CAD/ICAS}, year = 1984, month = jan } @book{rat-rok-84-rangefn, author = {H. Ratschek and J. Rokne}, title = {Computer Methods for the Range of Functions}, pages = {168}, year = 1984, publisher = {Ellis Horwood Ltd.}, altkeys = {Ratschek-Rokne-84} } @article{mur-kor-84-iaob, author = {S. P. Mudur and P. A. Koparkar}, title = {Interval Methods for Processing Geometric Objects}, journal = {IEEE Computer Graphics {\&} Applications}, volume = {4}, number = {2}, pages = {7--17}, year = 1984, month = feb, altkeys = {Mudur-Koparkar-94} } @article{gla-84-subd, author = {A. Glassner}, title = {Space Subdivision for Fast Ray Tracing}, journal = {IEEE Computer Graphics {\&} Applications}, year = 1984, month = oct } @book{mel-84-mdim, author = {Kurt Mehlhorn}, title = {Multi-Dimensional Searching and Computational Geometry}, series = {Data Structures and Algorithms}, volume = {3}, year = 1984, publisher = {Springer} } @article{sos-84-cata, author = {S{\'o}stenes Lins}, title = {Towards a Catalog of 3-Manifold Crystallizations}, journal = {Atti di Matematica e Fisica dell' Universit{\`a} di Modena}, volume = {XXXIII}, pages = {369--378}, year = 1984 } @book{pis-84-matr, author = {S{\'e}rgio Pissanetzky}, title = {Sparse Matrix Technology}, year = 1984, publisher = {Academic Press} } %%% 1983 %%%%%%%%%%%%%%%%%%% @book{tuf-83-visdisp, author = {E. R. Tufte}, title = {The Visual Display of Quantitative Information}, publisher = {Graphics Press}, address = {Chesire, Connecticut}, year = 1983 } @incollection{bank-83-refin, author = {R. E. Bank and A. H. Sherman and A. Weiser}, title = {Refinement Algorithms and Data Structures for Regular Local Mesh Refinement}, booktitle = {Scientific Computing}, editor = {R. Stepleman et al.}, pages = {3--17}, year = 1983, publisher = {IMACS/North-Holland} } @book{tay-83-filter, author = {Fred J. Taylor}, title = {Digital Filter Design Handbook}, volume = {18}, year = 1983, publisher = {Marcel Dekker}, series = {Eletrical Engineering and Eletronics}, altkeys = {ref:Taylor} } @article{yam-tok-83-free, author = {Fujio Yamaguchi and Toshiya Tokieda}, title = {A Solid Modelling System: {Freedom-II}}, journal = {Computers {\&} Graphics}, pages = {225--232}, year = 1983 } @inproceedings{wit-83-scale, author = {Andrew P. Witkin}, title = {Scale-Space Filtering}, booktitle = {Proc. IJCAI'83 - 8th International Joint Conference on Artificial Intelligence}, pages = {1019--1021}, year = 1983, comment = {[HCGL-52]}, altkeys = {w-83} } @book{pea-83-aplm, author = {Carl E. Pearson}, title = {Handbook of Applied Mathematics: {Selected} Results and Methods}, pages = {1037}, year = 1983, publisher = {Van Nostrand Reinhold}, isbn = {0-442-23866-5}, edition = {2nd}, altkeys = {ref:Pearson} } @inproceedings{sle-tar-83-sabt, author = {Daniel D. Sleator and Robert Endre Tarjan}, title = {Self-Adjusting Binary Trees}, booktitle = {Proc. 15th ACM Symp. on Theory of Computing}, pages = {235--245}, year = 1983 } @article{bau-str-83-pder, author = {Walter Baur and Volker Strassen}, title = {The Complexity of Partial Derivatives}, journal = {Theoretical Computer Science}, volume = {22}, pages = {317--330}, year = 1983, altkeys = {Baur-Strassen-83} } @inproceedings{cha-gui-lee-83-dua, author = {Bernard Chazelle and Leo J. Guibas and Der-Tsai Lee}, title = {The power of geometric duality}, booktitle = {Proc. 24th IEEE Annual Symposium on Foundations of Computer Science (FOCS)}, location = {Tucson, AZ}, year = 1983, month = nov } @article{kir-83-srch, author = {D. G. Kirkpatrick}, title = {Optimal Search in Planar Subdivisions}, journal = {SIAM J. on Computing}, volume = {12}, pages = {28--35}, year = 1983 } @article{hor-83-lerg, author = {B. K. P. Horn}, title = {The Curve of Least Energy}, journal = {ACM Transactions on Mathematical Software}, volume = {9}, number = {4}, pages = {441--460}, year = 1983, month = dec } @article{kir-gel-vec-83-opts, author = {S. Kirkpatrick and C. D. {Gelatt Jr.} and M. P. Vecchi}, title = {Optimization by Simulated Annealing}, journal = {Science}, volume = {220}, pages = {671--680}, year = 1983 } %%% 1982 %%%%%%%%%%%%%%%%%%% @article{col-jai-82-shtex, author = {E. Coleman and R. Jain}, title = {Obtaining 3-Dimensional Shape of Textured and Specular Surface using Four-Source Photometry}, journal = {Computer Graphics and Image Processing}, volume = {18}, pages = {308--328}, year = 1982 } @book{man-82-fractal, author = {B. Mandelbrot}, title = {The Fractal Geometry of Natrure}, publisher = {W. H. Freeman}, year = 1982 } @article{sos-82-gems, author = {S{\'o}stenes Lins}, title = {Graph-Encoded Maps}, journal = {Journal of Combinatory Theory (B)}, volume = {32}, pages = {171--181}, year = 1982 } @inproceedings{man-82-inv, author = {M. M{\"a}ntyl{\"a}}, title = {An Inversion Algorithm for Geometric Models}, booktitle = {Proc. SIGGRAPH '82}, location = {Boston, MA}, pages = {51--59}, year = 1982, publisher = {ACM Press}, isbn = {0-89791-076-1}, altkeys = {arnaldo:mantyla} } @article{eas-wei-82-ntree, author = {C. M. Eastman and S. F. Weiss}, title = {Tree Structures for High Dimensionality Nearest Neighbor Searching}, journal = {Information Systems}, volume = {7}, number = {2}, year = 1982, altkeys = {arnaldo:eastman} } @book{sym-82-mech, author = {Keith R. Symon}, title = {Mec\^anica}, year = 1982, publisher = {Editora Campus}, address = {Rio de Janeiro, RJ}, edition = {5}, altkeys = {rluis:symon82} } @article{rad-bad-82-puzz, author = {G. M. Radack and N. I. Badler}, title = {Jigsaw Puzzle Matching using a Boundary-Centered Polar Encoding}, journal = {Computer Graphics {\&} Image Processing}, volume = {19}, pages = {1--17}, year = 1982, month = may, altkeys = {Vision-Notes:bb21335,rad-bad-82} } @book{ros-kac-82-dipp, author = {Azriel Rosenfeld and Avinash C. Kac}, title = {Digital Picture Processing}, year = 1982, publisher = {Academic Press}, edition = {2nd}, altkeys = {ref:Rosenfeld} } @article{bar-fis-82-cster, author = {Stephen T. Barnard and Martin A. Fischler}, title = {Computational Stereo}, journal = {{ACM} Computing Surveys}, volume = {14}, number = {4}, pages = {553--572}, year = 1982, month = dec, altkeys = {bar-fis-82-survey} } @book{bal-bro-82-cvis, author = {Dana H. Ballard and Christopher M. Brown}, title = {Computer Vision}, year = 1982, publisher = {Prentice-Hall} } @book{fol-dam-82-cgra, author = {James D. Foley and Andries {Van Dam}}, title = {Fundamentals of Interactive Computer Graphics}, year = 1982, publisher = {Addison Wesley} } %%% 1981 %%%%%%%%%%%%%%%%%%% @book{ral-81-adiff, author = {L. B. Rall}, title = {Automatic Differentiation: {Techniques} and Applications}, series = {Lecture Notes in Computer Science}, volume = {120}, year = 1981, publisher = {Springer Verlag}, address = {Berlin}, altkeys = {Rall-81} } @book{gil-81-opt, author = {Philip E.Gill and Walter Murray and Margaret H. Wright}, title = {Practical Optimization}, year = 1981, publisher = {Academic Press}, address = {San Diego, CA}, altkeys = {Gill81} } @article{sch-ell-81-dyna, author = {Louis L. Scharf and Howard Elliott}, title = {Aspects of Dynamic Programming in Signal and Image Processing}, journal = {IEEE Transactions on Automatic Control}, volume = {AC-26}, number = {5}, pages = {1018--1029}, year = 1981, month = oct, altkeys = {se-81} } @book{vic-81-pde, author = {R. Vichnevetsky}, title = {Computer Methods For Partial Differential Equations}, volume = {I}, year = 1981, publisher = {Prentice-Hall}, altkeys = {anamaria:Met-Com-PDE} } @article{smi-wat-81-bioseq, author = {T. F. Smith and M. S. Waterman}, title = {Identification of Common Molecular Subsequences}, journal = {Journal of Molecular Biology}, volume = {147}, pages = {195--197}, year = 1981, comment = {Gives a more precise formlulation of the algorithm of Needleman and Wunsch~\cite{nee-wun-70-bioseq}, based on the dynamic programming matrix. Generalizes to finding the maximum homology subsequence, with free ends.}, altkeys = {se-81} } @article{sos-81-minmax, author = {S{\'o}stenes Lins}, title = {A Minimax Theorem on Projective Graphs}, journal = {Journal of Combinatory Theory (B)}, volume = {30}, pages = {253--262}, year = 1981 } @article{ries-81-homo, author = {R. F. Riesenfeld}, title = {Homogeneous Coordinates and Projective Planes in Computer Graphics}, journal = {IEEE Computer Graphics {\&} Applications}, pages = {50--55}, year = 1981, month = jan } %%% 1980 %%%%%%%%%%%%%%%%%%% @article{woo-80-phomi, author = {Robert J. Woodham}, title = {Photometric Method for Determining Suface Orientation from Multiple Images}, journal = {Optical Engineering}, volume = {19}, number = {1}, pages = {139--144}, year = 1980, altkeys = {wood-1980} } @mastersthesis{sil-80-thesis, author = {W. M. Silver}, title = {Determining Shape and Reflectance using Multiple Images}, school = {Massachusetts Institute of Technology}, year = 1980 } @article{lee-sch-80-delau, author = {D.-T. Lee and B. J. Schachter}, title = {Two Algorithms for Constructing a Delaunay Triangulation}, journal = {Int. J. Computer Information Science}, volume = {9}, pages = {219--242}, year = 1980 } @article{han-80-gomult, author = {E. Hansen}, title = {Global Optimization using Interval Analysis --- {The} Multi-Dimensional Case}, journal = {Numerische Mathematik}, volume = {34}, number = {3}, pages = {247--270}, year = 1980, altkeys = {Hansen-80} } @article{sos-80-maps, author = {S{\'o}stenes Lins}, title = {A Sequence Representation for Maps}, journal = {Discrete Mathemathics}, volume = {30}, pages = {249--263}, year = 1980 } @book{gol-80-mech, author = {H. Goldstein}, title = {Classical Mechanics}, year = 1980, publisher = {Addison-Wesley}, edition = {second}, altkeys = {Goldstein80} } %%% 1979 %%%%%%%%%%%%%%%%%%% @article{ich-fuj-79-iaopt, author = {K. Ichida and Y. Fujii}, title = {An Interval Arithmetic Method for Global Optimization}, journal = {Computing}, volume = {23}, pages = {85--97}, year = 1979, altkeys = {Ichida-Fujii-79} } @article{han-79-gouni, author = {E. Hansen}, title = {Global Optimization using Interval Analysis --- {The} One-Dimensional Case}, journal = {Journal of Optimization Theory and Applications}, volume = {29}, number = {3}, pages = {331--344}, year = 1979, altkeys = {Hansen-79} } @mastersthesis{rab-79-intv, author = {H. Rabinowitz}, title = {Implementation of a More Complete Interval Arithmetic}, school = {Univ. of California, Berkeley}, year = 1979 } @book{new-spr-79-pcgr, author = {William M. Newman and Robert F. Sproull}, title = {Principles of Interactive Computer Graphics}, year = 1979, publisher = {Mc Graw-Hill}, edition = {second} } @book{moo-79-iaap, author = {R. E. Moore}, title = {Methods and Applications of Interval Analysis}, year = 1979, publisher = {SIAM}, address = {Philadelphia}, altkeys = {Moore-79} } @book{gar-joh-79-intr, author = {M. R. Garey and David S. Johnson}, title = {Computers and Intractability: {A} Guide to the Theory of {NP}-Completeness}, year = 1979, publisher = {W. H. Freeman} } %%% 1978 %%%%%%%%%%%%%%%%%%% @techreport{hor-woo-sil-78-shalb, author = {Berthold K. P. Horn and Richard J. Woodham and William M. Silver}, year = 1978, title = {Determining Shape and Reflectance Using Multiple Images}, institution = {MIT Artificial Intelligence Laboratory}, number = {AI Memo 490}, pages = 9 } @book{ker-rit-78-clang, author = {B. W. Kernighan and D. M. Ritchie}, title = {The {C} Programming Language}, year = 1978, publisher = {Prentice-Hall}, altkeys = {Kernighan-Ritchie-78} } @article{san-sha-78-domin, author = {P. Sankar and C. Sharma}, title = {A Parallel Procedure for the Detection of Dominant Points on Digital Curves}, journal = {CGIP}, volume = {7}, pages = {403--412}, year = 1978, comment = {[HCGL-??] Not seen.}, altkeys = {ss-78} } @article{sak-chi-78-dpsp, author = {Hiroaki Sakoe and Seibi Chiba}, title = {Dynamic Programming Algorithm Optimization for Spoken Word Recognition}, journal = {IEEE Transactions on Acoustics, Speech and Signal Processing}, volume = {ASSP-26}, number = {1}, pages = {43--49}, year = 1978, altkeys = {sc-78} } %%% 1977 %%%%%%%%%%%%%%%%%%% @article{ben-fri-fin-77-kdnn, author = {J. L. Bentley and J. H. Friedman and R. A. Finkel}, title = {An Algorithm for Finding Best Matches in Logarithmic Expected Time}, journal = {ACM Transctions on Mathematical Software}, volume = {3}, number = {3}, pages = {209--226}, year = 1977 } @article{hor-77-undint, author = {B. K. P. Horn}, title = {Understanding Image Intensities}, journal = {Artificial Intelligence}, volume = {8}, number = {2}, pages = {201--231}, year = 1977, altkeys = {hor-NN-undint} } @article{mck-agg-77-curv, author = {James W. McKee and J. K. Aggarwal}, title = {Computer Recognition of Partial Views of Curved Objects}, journal = {IEEE Transactions on Computers}, volume = {C26}, number = {8}, pages = {790--800}, year = 1977, altkeys = {mka-77} } @book{moi-77-topo, author = {Edwin E. Moise}, title = {Geometric Topology in Dimensions 2 and 3}, year = 1977, publisher = {Springer--Verlag}, address = {New York, Heidelberg, Berlin} } @article{bee-neu-hod-77-spee, author = {Bruno Beek and Edward P. Neuberg and David C. Hodge}, title = {An Assessment of the Technology of Automatic Speech Recognition for Military Applications}, journal = {IEEE Transactions on Acoustics, Speech and Signal Processing}, volume = {ASSP-25}, number = {4}, pages = {310--322}, year = 1977, altkeys = {bnh-77} } @book{jac-77-artn, author = {David A. H. Jacobs}, title = {The State of the Art in Numerical Analysis}, year = 1977, publisher = {Academic Press} } @article{cri-rus-77-spee, author = {Richard W. Christiansen and Craig K. Rushforth}, title = {Detecting and Locating Key Words in Continuous Speech using Linear Predictive Coding}, journal = {IEEE Transactions on Acoustics, Speech and Signal Processing}, volume = {ASSP-25}, number = {5}, pages = {361--367}, year = 1977, comment = {Descreve um algoritmo de programa{\c{c}}{\~a}o din{\^a}mica que reconhece palavras gabaritadas. {\'e} baseado no trabalho de Sakoe e Chiba (1977).}, altkeys = {cr-77} } %%% 1976 %%%%%%%%%%%%%%%%%%% @article{fer-76-gems, author = {M. Ferri}, title = {Una Rappresentazione delle Variet{\`a} Topologiche Triangolabili Medianti Grafi $(n+1)$-Colorati.}, journal = {Bolletino dell'Unione Matematica Italiana}, volume = {13-B}, pages = {250--260}, year = 1976 } @article{moo-76-ranfn, author = {R. E. Moore}, title = {On Computing the Range of a Rational Function of $n$ Variables Over a Bounded Region}, journal = {Computing}, volume = {16}, pages = {1--15}, year = 1976, altkeys = {Moore-76} } @book{bon-mur-76-graph, author = {J. A. Bondy and U. S. R. Murty}, title = {Graph Theory with Applications}, year = 1976, publisher = {MacMillan}, address = {London}, altkeys = {Murty} } @book{lag-76-etpg, author = {Elon Lages Lima}, title = {Elementos de topologia geral}, pages = {1--95}, year = 1976, publisher = {Livros T{\'e}cnicos e Cient{\'\i}ficos}, address = {Rio de Janeiro, RJ}, keywords = {book} } %%% 1975 %%%%%%%%%%%%%%%%%%% @book{neu-75-histmath, author = {O. Neugebauer}, title = {A History of Ancient Mathematical Astronomy}, year = 1975, publisher = {Springer}, address = {New York}, series = {Studies in the History of Mathematics and Physical Sciences, No. 1}, altkeys = {Neugebauer-75} } @article{ram-75-edge, author = {U. Ramer}, title = {Extraction of Line Structures from Photographs of Curved Objects}, journal = {Computer Graphics {\&} Image Processing}, volume = {4}, number = {1}, pages = {81--103}, year = 1975, altkeys = {Vision-Notes:bb9556} } @book{nic-80-intv-proc, editor = {Karl Nickel}, title = {Proc. Interval Mathematics 1980}, publisher = {Academic Press}, year = 1980, altkeys = {nic-75-intv-proc} } @inproceedings{han-75-geni, author = {E. R. Hansen}, title = {A Generalized Interval Arithmetic}, booktitle = {Interval Mathematics}, editor = {K. Nickel}, series = {Lecture Notes in Computer Science}, volume = {29}, pages = {7--18}, year = 1975, publisher = {Springer} } @inproceedings{bau-75-poly, author = {Bruce G. Baumgart}, title = {A Polyhedron Representation for Computer Vision}, booktitle = {Proc. 1975 AFIPS National Computer Conference}, volume = {44}, pages = {589--596}, year = 1975 } %%% 1974 %%%%%%%%%%%%%%%%%%% @article{ske-74-ratia, author = {S. Skelboe}, title = {Computation of Rational Interval Functions}, journal = {BIT}, volume = {14}, pages = {87--95}, year = 1974, altkeys = {Skelboe-74} } @article{wag-fis-74-dynpr, author = {Robert A. Wagner and Michael J. Fischer}, title = {The String-to-String Correction Problem}, journal = {Journal of the Association for Computing Machinery}, volume = {21}, number = {1}, pages = {168--173}, year = 1974, month = jan } @phdthesis{ram-74-edge-thesis, author = {E. Urs Ramer}, title = {Computer Edge Extraction from Photographs of Curved Objects}, school = {New York University}, year = 1974, month = jan } @article{pez-74-strtop, author = {M. Pezzana}, title = {Sulla Struttura Topologica delle Variet{\`a} Compatte}, journal = {Atti Sem.~Mat.~Fis.~Univ.~Modena}, volume = {23}, pages = {269--277}, year = 1974, publisher = {Universit{\`a} di Modena, IT}, note = {Cited in~\cite{fer-gag-gra-86-surv}} } @article{pez-74-crist, author = {M. Pezzana}, title = {Compattificazione di {$\RR^n$} e Variet{\`a} Topologiche Compatte Triangolabili}, journal = {Atti Sem.~Mat.~Fis.~Univ.~Modena}, volume = {23}, pages = {278--285}, year = 1974, publisher = {Universit{\`a} di Modena, IT}, note = {Cited in~\cite{fer-gag-gra-86-surv}} } %%% 1973 %%%%%%%%%%%%%%%%%%% @book{bre-73-mini, author = {R. P. Brent}, title = {Algorithms for Minimization without Derivatives}, year = 1973, publisher = {Prentice-Hall} } @book{knu-73-acp3, author = {Donald E. Knuth}, title = {The Art of Computer Programming, Volume III: Sorting and Searching}, pages = {723}, year = 1973, publisher = {Addison-Wesley}, address = {Reading, Mass.}, isbn = {0-201-03803-X} } %%% 1972 %%%%%%%%%%%%%%%%%%% @article{knu-72-babil, author = {D. E. Knuth}, title = {Ancient {Babylonian} Algorithms}, journal = {Communications of the ACM}, volume = {15}, number = {7}, pages = {671--677}, year = 1972, note = {Errata, ibid. 19(2):108, 1976}, altkeys = {Knuth-75,knu-75-babil} } @book{jac-kov-piz-72-nopt, author = {S. L. S. Jacoby and J. S. Kovalic and J. T. Pizzo}, title = {Iterative Methods for Nonlinear Optimization Problems}, year = 1972, publisher = {Prentice-Hall} } @book{har-72-grap, author = {Frank Harary}, title = {Graph Theory}, year = 1972, publisher = {Addison Wesley} } %%% 1970 %%%%%%%%%%%%%%%%%%% @article{cha-kap-70-giftwrap, author = {Donald R. Chand and Sham S. Kapur}, title = {An Algorithm for Convex Polytopes}, journal = {Journal of the ACM}, volume = {17}, number = {1}, pages = {78--86}, year = 1970, publisher = {ACM Press}, doi = {10.1145/321556.321564}, issn = {0004-5411} } @article{nee-wun-70-bioseq, author = {Saul B. Needleman and Christian D. Wunsch}, title = {A General Method Applicable to the Seacrh for Similarities in the Amino Acid sequence of two Proteins}, journal = {Journal of Molecular Biology}, volume = {48}, pages = {443--453}, year = 1970, comment = {First use of dynamic programming for biosequence comparison. Uses $\Theta(N^2)$ and space and at least that much time.} } @article{win-kri-70-akhgeo, author = {Ray Winfield Smith and Emory Kristof}, title = {Computer Helps Scholars Re-Create an {Egyptian} Temple}, journal = {National Geographic Magazine}, volume = {138}, number = {5}, pages = {644--655}, year = 1970, month = nov } @book{kib-70-mec, author = {T. W. Kibble}, title = {Mec{\^a}nica Cl{\'a}ssica}, year = 1970, publisher = {Editora Pol{\'\i}gono}, altkeys = {Kibble70} } %%% 1969 %%%%%%%%%%%%%%%%%%% @book{ful-69-alcv, author = {W. Fulton}, title = {Algebraic Curves: {An} Introduction to Algebraic Geometry}, year = 1969, publisher = {W. A. Benjamin} } %%% 1968 %%%%%%%%%%%%%%%%%%% @book{lat-68-comm, author = {B. P. Lathi}, title = {Communications Systems}, year = 1968, publisher = {Wiley}, altkeys = {Lathi} } %%% 1967 %%%%%%%%%%%%%%%%%%% @book{gru-67-convex, author = {Branko Gr{\"{u}}nbaum}, title = {Convex Polytopes}, publisher = {Wiley}, year = 1967 } @book{kah-67-code, author = {David Kahn}, title = {The Codebreakers}, year = 1967, publisher = {Macmillan} } @book{wel-67-lagr, author = {Dare A. Wells}, title = {Lagrangian Dynamics}, series = {Schaum's Outline Series}, year = 1967, publisher = {McGraw-Hill}, altkeys = {Wells67} } %%% 1966 %%%%%%%%%%%%%%%%%%% @article{rin-66-shapshad, author = {T. Rindfleisch}, title = {Photometric Method for {Lunar} Topography}, journal = {Photometric Engineering}, volume = {32}, number = {3}, pages = {262--276}, year = 1966, month = mar } @book{mue-66-shar, author = {C. M{\"u}ller}, title = {Spherical Harmonics}, series = {Lecture Notes in Mathematics}, volume = {17}, year = 1966, publisher = {Springer} } @book{moo-66-inta, author = {R. E. Moore}, title = {Interval Analysis}, year = 1966, publisher = {Prentice-Hall}, altkeys = {Moore-66} } %%% 1964 %%%%%%%%%%%%%%%%%%% @article{fre-gar-64-puzz, author = {Herbert Freeman and L. Garder}, title = {Apictorial Jigsaw Puzzles: {The} Computer Solution of a Problem in Pattern Recognition}, journal = {IEEE Transactions on Computers}, volume = {13}, pages = {118--127}, year = 1964, month = apr, altkeys = {Vision-Notes:bb20914} } %%% 1963 %%%%%%%%%%%%%%%%%%% @book{wil-63-round, author = {J. H. Wilkinson}, title = {Rounding Errors in Algebraic Processes}, pages = {vi+161}, year = 1963, publisher = {Prentice-Hall Inc.}, address = {Englewood Cliffs, N.J.}, altkeys = {Wilkinson-63} } %%% 1962 %%%%%%%%%%%%%%%%%%% @misc{hou-62-segm, author = {P. V. C. Hough}, title = {Method and Means for Recognizing Complex Patterns}, howpublished = {U. S. Patent 3,069654}, year = 1962, month = dec } %%% 1961 %%%%%%%%%%%%%%%%%%% @book{cox-61-igeo, author = {H. S. M. Coxeter}, title = {Introduction to Geometry}, year = 1961, publisher = {Wiley} } %%% 1959 %%%%%%%%%%%%%%%%%%% @article{she-59-shar, author = {Donald L. Shell}, title = {The {Share 709} System: {A} Cooperative Effort}, journal = {Journal of the ACM}, volume = {6}, number = {2}, pages = {123--127}, year = 1959, month = apr } %%% 1958 %%%%%%%%%%%%%%%%%%% @article{spi-she-58-cheb, author = {A. Spitzbart and D. L. Shell}, title = {A {Chebycheff} Fitting Criterion}, journal = {Journal of the ACM}, volume = {5}, number = {1}, pages = {22--31}, year = 1958, month = jan } %%% 1955 %%%%%%%%%%%%%%%%%%% @article{she-55-elli, author = {J. W. Sheldon}, title = {On the Numerical Solution of Elliptic Difference Equations}, journal = {Mathematical Tables and Other Aids to Computation}, volume = {9}, pages = {101--112}, year = 1955 } %%% 1953 %%%%%%%%%%%%%%%%%%% @book{cou-hil-53-mphy, author = {R. Courant and D. Hilbert}, title = {Methods of Mathematical Physics}, volume = {I}, year = 1953, publisher = {Interscience}, address = {New York}, altkeys = {SphHarA} } %%% 1952 %%%%%%%%%%%%%%%%%%% @book{hil-coh-52-imag, author = {David Hilbert and S. Cohn-Vossen}, title = {Geometry and the Imagination}, year = 1952, publisher = {Chelsea}, address = {New York} } @book{hod-ped-52-ageo, author = {W. V. D. Hodge and D. Pedoe}, title = {Methods of Algebraic Geometry}, year = 1952, publisher = {Cambridge University Press} } %%% 1951 %%%%%%%%%%%%%%%%%%% @article{dig-51-moon, author = {J. van Diggelen}, title = {A Photometric Investigation of the Slopes and Heights of the Ranges of Hills in the {Maria} of the {Moon}}, journal = {Bulletin of the Astronomical Institute of the Netherlands}, volume = {11}, year = 1951, month = jul } %%% 1949 %%%%%%%%%%%%%%%%%%% @book{cox-49-proj, author = {H. S. M. Coxeter}, title = {The Real Projective Plane}, year = 1949, publisher = {McGraw-Hill} } %%% 1941 %%%%%%%%%%%%%%%%%%% @book{ale-41-ia-book, author = {Jurgen G{\"o}tz Alefeld}, note = {Trans.~by Jon Rokne}, title = {Introduction to Interval Computations}, publisher = {}, year = 1941, pages = {}, altkeys = {vtls:110166} } % ================================================== % xxx-xx-opg-review % Bogus reference. It was conjectured to be a review of J. Stolfi's % "Oriented Projective Geometry" % published in the American Mathematics Monthly, year unknown, June issue, % page 479. % That review was thought to have been cited by Toussaint in % and article called \emph{Computational Geometry} % Proc. IEEE 80 (9), 1347--1363; Sep 1992. % However, Toussaint actually cited the "Oriented Projective Geometry" % book directly; the following entry in the bibliography was an % article by M. G. Stone, "A mnemonic for areas of polygons", % AMM june-july 1986, 479--480. The Citeseer crawler apparently % fused the two entries.