The Ups and Downs of Percent (and Some Interesting Connections)

Percent is a standardized ratio comparison that is often used to describe relative amounts of increase and decrease. In this paper, the nonsymmetric relationship between percent of increase and percent of decrease is explored in several ways. Beginning with a simple graphical representation of the relationship, the functional relationship is developed, with relative decrease expressed as a function of relative increase. Once expressed in the form f(x) = 100x/(100 + x), an immediate connection is made to two other topics commonly found within the study of rates—the work problem and the harmonic mean. Finally, successive percents of increase or decrease are shown to be everyday applications of the geometric mean. This deeper look at a common mathematical concept has uncovered rich structural relationships between topics that are often isolated in the curriculum.     

Category with a natural cone

Generally, in homotopy theory a cylinder object (or, its dual, a path object) is used to define homotopy between morphisms, and a cone object is used to build exact sequences of homotopy groups. Here, an axiomatic theory based on a cone functor is given. Suspension objects are associated to based objects and cofibrations, obtaining homotopy groups referred to an object and relative to a cofibration, respectively. Exact sequences of these groups are built. Algebraic and particular examples are given. We point out that the main results of this paper were already stated in [3], and the purpose of this article is to give full details of the foregoing.     

A nodal coupling of finite and boundary elements

This article presents and analyzes a simple method for the exterior Laplace equation through the coupling of finite and boundary element methods. The main novelty is the use of a smooth parametric artificial boundary where boundary elements fit without effort together with a straight approximate triangulation in the bounded area, with the coupling done only in nodes. A numerically integrated version of the algorithm is also analyzed. Finally, an isoparametric variant with higher order is proposed. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 555–570, 2003     

Microperforated insertion units: An alternative strategy to design microperforated panels

Microperforated panels (MPPs) coupled to a rigid wall have been proposed recently as an alternative to porous absorbers in situations having concerns with bacterial contamination and small particles discharge, like food, pharmaceutical and microelectronic industries. There exists also an increasing interest for MPP absorbers in the transportation industry and civil engineering. In general, an optimally designed MPP with good broadband absorption requires many submillimetric holes distributed over a panel of also submillimetric thickness. Such thin plates or foils become so fragile that they need to be protected from mechanical damage. In this paper, an alternative strategy is investigated which allows the design of MPPs with panels of millimetric thickness while maintaining their acoustic performance. These absorbers, named microperforated insertion units (MIUs), avoid the structural problems of the classical MPPs. An assessment of the sound absorption properties of these structures is presented. Comparisons between calculations and measurements are also made under two experimental conditions: plane waves at normal incidence (impedance tube) and free field (anechoic room).     

Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently

Logic programming languages, such asProlog, allow a declarative specification of Constraint Satisfaction Problems (CSPs), freeing the user from specifying more or less complex control directives. However, the price to pay for such flexibility is a loss of efficiency, which makes Logic Programming inadequate to solve CSPs of even moderate size and complexity. To extend the range of applicability of logic programming, several improvements have been proposed. The use of heuristics is one such improvement. Although this usually forces the user to specify some form of control (thus abandoning the pure declarative nature of a logic program), these specifications can be made declarative by making use of some appropriate meta-predicates. Another extension to logic programming that improves its efficiency, is the active use of constraints, as done in the various formulations of constraint logic programming languages. In particular, the use of finite domains is quite adequate to implement look-ahead schemes to efficiently solve several types of CSPs. In this paper, we discuss the complementary nature of heuristics and look-ahead schemes and present a constraint logic programming framework that integrates both these techniques. Results obtained with a time-tabling problem executed on a prototype that implements such a framework are presented, and show that significant efficiency improvements can be achieved when compared with the separate use of the two techniques.