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).     

Area orthogonality in normed linear spaces

A new concept of orthogonality in real normed linear spaces is introduced. Typical properties of orthogonality (homogeneity, symmetry, additivity, ...) and relations between this orthogonality and other known orthogonalities (Birkhoff, Boussouis, Unitary-Boussouis and Diminnie) are studied. In particular, some characterizations of inner product spaces are obtained.     

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.     

Exact and approximate solutions to the Schrödinger equation for the harmonic oscillator with a singular perturbation

I obtain exact solutions for the quantum-mechanical harmonic oscillator with a perturbation potential which belongs to a class of polynomial functions of 1/r. I show that some of the eigenfunctions enable the calculation of expectation values in closed form and are therefore suitable trial functions for the application of the variational method to related nonsolvable problems.