Element number of the Platonic solids

Let Σ be a set of polyhedra. A set Ω of polyhedra is said to be an element set for Σ if each polyhedron in Σ is the union of a finite number of polyhedra in Ω. We call each polyhedron of the element set Ω an element for Σ. In this paper, we determine one element set for the set Π of the Platonic solids, and prove that this element set is, in fact, best possible; it achieves the minimum in terms of cardinality among all the element sets for Π. We also introduce the notion of indecomposability of a polyhedron and present a conjecture in Sect. 3.     

Classification of critical sets and their images for quadratic maps of the plane

We provide a complete classification of the critical sets and their images for quadratic maps of the real plane. Critical sets are always conic sections, which provides a starting point for the classification. The generic cases, maps whose critical sets are either ellipses or hyperbolas, was published by Delgado et al. in 2013. This work completes the classification by including all the nongeneric cases: the empty set, a single point, a single line, a parabola, two parallel lines, two intersecting lines, or the whole plane. We describe all possible images for each critical set case and illustrate the geometry of representative maps for each case.     

Game problems on a fixed interval in controlled first-order evolution equations

This paper is devoted to the study of pursuit and evasion problems on a fixed finite closed interval in controlled equations of parabolic type. The control parameters appeal-on the right-hand side of the equations in additive form. We study all possible cases of control constraints. For certain cases, we single out pairs of sets of initial positions for which the completion of the pursuit from points of the first set is guaranteed and an evasion of the terminal set is ensured in the case of initial points from the second set.     

Expected utility for nonstochastic risk

Stochastic random phenomena considered in von Neumann–Morgenstern utility theory constitute only a part of all possible random phenomena (Kolmogorov, 1986). We show that any sequence of observed consequences generates a corresponding sequence of frequency distributions, which in general does not have a single limit point but a non-empty closed limit set in the space of finitely additive probabilities. This approach to randomness allows to generalize the expected utility theory in order to cover decision problems under nonstochastic random events. We derive the maxmin expected utility representation for preferences over closed sets of probability measures. The derivation is based on the axiom of preference for stochastic risk, i.e. the decision maker wishes to reduce a set of probability distributions to a single one. This complements Gilboa and Schmeidler’s (1989) consideration of the maxmin expected utility rule with objective treatment of multiple priors.     

Bound constrained interval global optimization in the COCONUT Environment

We introduce a new interval global optimization method for solving bound constrained problems. The method originates from a small standalone software and is implemented in the COCONUT Environment, a framework designed for the development of complex algorithms, containing numerous state-of-the-art methods in a common software platform. The original algorithm is enhanced by various new methods implemented in COCONUT, regarding both interval function evaluations (such as first and second order derivatives with backward automatic differentiation, slopes, slopes of derivatives, bicentered forms, evaluations on the Karush–John conditions, etc.) and algorithmic elements (inclusion/exclusion boxes, local search, constraint propagation). This resulted in a substantial performance increase as compared to the original code. During the selection of the best combination of options, we performed comparison tests that gave empirical answers to long-lasting algorithmic questions (such as whether to use interval gradients or use slopes instead), that have never been studied numerically in such detail before. The new algorithm, called coco_gop_ex, was tested against the prestigious BARON software on an extensive set of bound constrained problems. We found that in addition to accepting a wider class of bound constrained problems and providing more output information (by locating all global minimizers), coco_gop_ex is competitive with BARON in terms of the solution success rates (with the exception of a set of nonlinear least squares problems), and it often outperforms BARON in running time. In particular, coco_gop_ex was around 21 % faster on average over the set of problems solved by both software systems.     

Boundary slopes and the logarithmic limit set

The A-polynomial of a manifold whose boundary consists of a single torus is generalised to an eigenvalue variety of a manifold whose boundary consists of a finite number of tori, and the set of strongly detected boundary curves is determined by Bergman's logarithmic limit set, which describes the exponential behaviour of the eigenvalue variety at infinity. This enables one to read off the detected boundary curves of a multi-cusped manifold in a similar way to the 1-cusped case, where the slopes are encoded in the Newton polygon of the A-polynomial.     

On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields

New multivariable asymmetric public-key encryption schemes based on the NP-complete problem of simultaneous algebraic Riccati equations over finite fields are suggested. We also provide a systematic way to describe any set of quadratic equations over any field, as a set of algebraic Riccati equations. This has the benefit of systematic algebraic crypt-analyzing any encryption scheme based on quadratic equations, to any possible vulnerable hidden structure, in view of the fact that the set of all solutions to any given single algebraic Riccati equation is fully described in terms of all the T-invariant subspaces of some restricted dimension, where T is the matrix of coefficients of the related algebraic Riccati equation.     

Propagación de ondas de Rayleigh en medios con grietas

This work is focused on the finding of numerical results for detection and characterization of sub-surface cracks in solids under the incidence of Rayleigh's elastic waves. The results are obtained from boundary integral equations, which belong to the field of dynamics of elasticity. Once applied the boundary conditions, a system of Fredholm's integral equations of second kind and zero order is obtained, which is solved using Gaussian elimination. The method that is used for the solution of such integral equations is known as the Indirect Boundary Element Method, which can be seen as a derivation of the Somigliana's classic theorem. On the basis of the analysis made in the frequency domain, resonance peaks emerge and allow us to infer the presence of cracks through the spectral ratios. Several models of cracked media were analyzed, where analyses reveal the great utility that displays the use of spectral ratios to identify cracks. We studied the effects of orientation and location of cracks. The results show good agreement with the previously published.     

Building a set of additive value functions representing a reference preorder and intensities of preference: GRIP method

We present a method called Generalized Regression with Intensities of Preference (GRIP) for ranking a finite set of actions evaluated on multiple criteria. GRIP builds a set of additive value functions compatible with preference information composed of a partial preorder and required intensities of preference on a subset of actions, called reference actions. It constructs not only the preference relation in the considered set of actions, but it also gives information about intensities of preference for pairs of actions from this set for a given decision maker (DM). Distinguishing necessary and possible consequences of preference information on the considered set of actions, GRIP answers questions of robustness analysis. The proposed methodology can be seen as an extension of the UTA method based on ordinal regression. GRIP can also be compared to the AHP method, which requires pairwise comparison of all actions and criteria, and yields a priority ranking of actions. As for the preference information being used, GRIP can be compared, moreover, to the MACBETH method which also takes into account a preference order of actions and intensity of preference for pairs of actions. The preference information used in GRIP does not need, however, to be complete: the DM is asked to provide comparisons of only those pairs of reference actions on particular criteria for which his/her judgment is sufficiently certain. This is an important advantage comparing to methods which, instead, require comparison of all possible pairs of actions on all the considered criteria. Moreover, GRIP works with a set of general additive value functions compatible with the preference information, while other methods use a single and less general value function, such as the weighted-sum.     

Using multiple sources of information to recognize and classify objects

In this paper we consider the problem of selecting an object or a course of action from a set of possible alternatives. To give the paper focus, we concentrate initially on an object recognition problem in which the characteristic features of the object are reported by remote sensors. We then extend the method to a more general class of selection problems and consider several different scenarios.

Information is provided by a set of knowledge system reports on a single feature, and the output from these systems is not totally explicit but provides posible values for the observed feature along with a degree of certitude.We use fuzzy sets to represent this vague information. Information from independent sources is combined using the Dempster-Shafer approach adapted to the situation in which the focal elements are fuzzy as in the recent paper by J. Yen [7]. We base our selection rule on the belief and plausibility functions generated by this approach to accessing evidence.

For situations in which the information is too sparse and/or too vague to make a single selection, we construct a preference relationship based on the concept of averaged subsethood for fuzzy sets as discussed by B. Koskoin [4]. We also define an explicit metric upon which to base our selection mechanism for situations in which the Dempster-Shafer rule of combination is inappropriate     

Bayesian Variable and Transformation Selection in Linear Regression

This article suggests a method for variable and transformation selection based on posterior probabilities. Our approach allows for consideration of all possible combinations of untransformed and transformed predictors along with transformed and untransformed versions of the response. To transform the predictors in the model, we use a change-point model, or “change-point transformation,” which can yield more interpretable models and transformations than the standard Box–Tidwell approach. We also address the problem of model uncertainty in the selection of models. By averaging over models, we account for the uncertainty inherent in inference based on a single model chosen from the set of models under consideration. We use a Markov chain Monte Carlo model composition (MC³) method which allows us to average over linear regression models when the space of models under consideration is very large. This considers the selection of variables and transformations at the same time. In an example, we show that model averaging improves predictive performance as compared with any single model that might reasonably be selected, both in terms of overall predictive score and of the coverage of prediction intervals. Software to apply the proposed methodology is available via StatLib.     

Lot-sizing two-echelon assembly systems with random yields and rigid demand

We consider a two-echelon assembly system producing a single final product for which the demand is known. The first echelon consists of several parallel stages, whereas the second echelon consists of a single assembly stage. We assume that the yield at each stage is random and that demand needs to be satisfied in its entirety; thus, several production runs may be required. A production policy should specify, for each possible configuration of intermediate inventories, on which stage to produce next and the lot size to be processed. The objective is to minimize the expected total of setup and variable production costs.We prove that the expected cost of any production policy can be calculated by solving a finite set of linear equations whose solution is unique. The result is general in that it applies to any yield distribution. We also develop efficient algorithms leading to heuristic solutions with high precision and, as an example, provide numerical results for binomial yields.     

An Interactive Approach for Project Selection

This paper describes an interactive method for presenting a sequence of feasible sets of indivisible projects to a decision-maker. For each set as a whole, the decision-maker evaluates its utilities with respect to each of several attributes; the utilities are then combined to give a single utility for the set.A sequence of zero-one programmes is used to ensure that the only sets presented are those which are feasible and which are not contained in larger feasible sets. The sets are presented in descending order of size, and the presentation can be terminated by the decision-maker or by supplementary rules.The method for presenting sets can be used in other contexts in which complete enumeration of possible sets would otherwise be required.     

On the physically motivated choice of internal variables describing martensitic phase transformations

Phenomenological models which describe phase transformation in solids often employ a single scalar variable, the mass (or volume) fraction of one of the phases involved. However, the orientation of the applied stress has a major influence on the microstructure developing during the phase transition and thus the overall mechanical behavior. Therefore, additional internal variables of higher order have to be introduced in order to capture this aspect. The choice of these internal variables is often based on purely phenomenological considerations. In contrast to this, based on local observations at the phase boundary, a thermodynamically dual pair of second order tensors is introduced here. Constitutive relations for shape menory alloys in the pseudoelastic and pseudoplastic range are proposed. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Estimating contact forces and pressure in a dense crowd: Microscopic and macroscopic models

This paper deals with the estimation of pressure at collisions times during the movement of a dense crowd. Through the non-smooth contact dynamics approach for rigid and deformable solids, proposed by Frémond and his collaborators, the value of pressure and contact forces at collisions points, generated through congestion or panic situation are estimated. Firstly, we propose a second-order microscopic model, in which the crowd is treated as a system of rigid solids. Contact forces are rigorously defined by taking into account multiple simultaneous contacts and the non-overlapping condition between pedestrians. We show that for a dense crowd, percussions can be seen as contact forces. Secondly, in order to overcome the restrictive hypothesis related to the geometric form adapted to model the pedestrian, a continuous equivalent approach is proposed where the crowd is modeled as a deformable solid, the pressure is then defined by the divergence of the stress tensor and calculated according to volume and surface constraints. This approach makes it possible to retain an admissible right-velocity, including both the non-local interactions between non-neighbor pedestrians and the choice of displacement strategy of each pedestrian. Finally, the comparison between the two proposed approaches and some other existing approaches are presented on several illustrative examples to estimate the contact forces between pedestrians.     

Pure shear axes and elastic strain energy

It is well known that a state of pure shear has distinct setsof basis vectors or coordinate systems: the principal axes,in which the stress is diagonal, and pure shear bases, in whichdiag = 0. The latter is commonly taken as the definition ofpure shear, although a state of pure shear is more generallydefined by tr = 0. New results are presented that characterizeall possible pure shear bases. A pair of vector functions arederived which generate a set of pure shear basis vectors fromany one member of the triad. The vector functions follow froma compatibility condition for the pure shear basis vectors,and are independent of the principal stress values. The complementarytypes of vector basis have implications for the strain energyof linearly elastic solids with cubic material symmetry: fora given state of stress or strain, the strain energy achievesits extreme values when the material cube axes are aligned withprincipal axes of stress or with a pure shear basis. This impliesthat the optimal orientation for a given state of stress iswith one or the other vector basis, depending as the stressis to be minimized or maximized, which involves the sign ofone material parameter.     

Topological Symmetry Groups of Complete Graphs in the 3-Sphere

The orientation preserving topological symmetry group of a graphembedded in the 3-sphere is the subgroup of the automorphismgroup of the graph consisting of those automorphisms which canbe induced by an orientation preserving homeomorphism of theambient space. We characterize all possible orientation preservingtopological symmetry groups of embeddings of complete graphsin the 3-sphere.     

A multivariate evolutionary generalised linear model framework with adaptive estimation for claims reserving

In this paper, we develop a multivariate evolutionary generalised linear model (GLM) framework for claims reserving, which allows for dynamic features of claims activity in conjunction with dependency across business lines to accurately assess claims reserves. We extend the traditional GLM reserving framework on two fronts: GLM fixed factors are allowed to evolve in a recursive manner, and dependence is incorporated in the specification of these factors using a common shock approach.We consider factors that evolve across accident years in conjunction with factors that evolve across calendar years. This two-dimensional evolution of factors is unconventional as a traditional evolutionary model typically considers the evolution in one single time dimension. This creates challenges for the estimation process, which we tackle in this paper. We develop the formulation of a particle filtering algorithm with parameter learning procedure. This is an adaptive estimation approach which updates evolving factors of the framework recursively over time.We implement and illustrate our model with a simulated data set, as well as a set of real data from a Canadian insurer.     

Minimum Degree Conditions for Cycles Including Specified Sets of Vertices

This paper generalises the concept of vertex pancyclic graphs. We define a graph as set-pancyclic if for every set S of vertices there is a cycle of every possible length containing S. We show that if the minimum degree of a graph exceeds half its order then the graph is set-pancyclic. We define a graph as k-ordered-pancyclic if, for every set S of cardinality k and every cyclic ordering of S, there is for every possible length a cycle of that length containing S and encountering S in the specified order. We determine the best possible minimum-degree condition which guarantees that a graph is k-ordered-pancyclic.