Implied Constraints for Automaton Constraints

Automata allow many constraints on sequences of variables to be specified in a high-level way for constraint programming solvers. An automaton with accumulators induces a decomposition of the specified constraint into a conjunction of constraints with existing inference algorithms, called propagators. Towards improving propagation, we design a fully automated tool that selects, in an off-line process, constraints that are implied by such a decomposition. We show that a suitable problem-specific choice among the tool-selected implied constraints can considerably improve solving time and propagation, both on a decomposition in isolation and on entire constraint problems containing the decomposition.

A Generic Architectural Model Approach for Efficient Utilization of Patterns

A software pattern describes the core of the solution to a problem that tends to (re-)occur in a particular environment. Such patterns are commonly used as a means to facilitate the creation of an architectural design satisfying the desired quality goals. In this chapter, the practical challenges of efficient usage of patterns in domain-specific software development are presented. The specific domain considered here is the mobile domain, for which is given a sample collection of potentially useful patterns. After that, a novel generic architectural model approach for organizing patterns is presented. In this approach, the identification of relevant patterns is considered as the process of reducing the set of candidate patterns by domain-implied constraints. These constraints can be incorporated in a domain-specific generic architectural model that reflects the commonalities in the solutions of the particular domain. This approach has been validated with a real company application development case.

A Generic Architectural Model Approach for Efficient Utilization of Patterns

A software pattern describes the core of the solution to a problem that tends to (re-)occur in a particular environment. Such patterns are commonly used as a means to facilitate the creation of an architectural design satisfying the desired quality goals. In this chapter, the practical challenges of efficient usage of patterns in domain-specific software development are presented. The specific domain considered here is the mobile domain, for which is given a sample collection of potentially useful patterns. After that, a novel generic architectural model approach for organizing patterns is presented. In this approach, the identification of relevant patterns is considered as the process of reducing the set of candidate patterns by domain-implied constraints. These constraints can be incorporated in a domain-specific generic architectural model that reflects the commonalities in the solutions of the particular domain. This approach has been validated with a real company application development case.

Absolute Calibration of Radar Reflectivity Using Redundancy of the Polarization Observations and Implied Constraints on Drop Shapes

A major limitation of improved radar-based rainfall estimation is accurate calibration of radar reflectivity. In this paper, the authors fully automate a polarimetric method that uses the consistency between radar reflectivity, differential reflectivity, and the path integral of specific differential phase to calibrate reflectivity. Complete instructions are provided such that this study can serve as a guide for agencies that are upgrading their radars with polarimetric capabilities and require accurate calibration. The method is demonstrated using data from Météo-France’s operational C-band polarimetric radar. Daily averages of the calibration of radar reflectivity are shown to vary by less than 0.2 dB. In addition to achieving successful calibration, a sensitivity test is also conducted to examine the impacts of using different models relating raindrop oblateness to diameter. It turns out that this study highlights the suitability of the raindrop shape models themselves. Evidence is shown supporting the notion that there is a unique model that relates drop oblateness to diameter in midlatitudes.

Some New Equations and Constraints Useful in Analysis of Serial Repayment or Investment

Initial value of the sum of a series of equal payments of R dollars at equal time intervals is V and terminal value is W. It is desired to find total number (N) of such payments and rate of effective periodic compound interest (P) implied by R, V, W under a specified protocol relating start and end of a contract (e.g., a debt repayment, annuity, or lease) to times of first and last payments. Two new equations are derived, completing the set of five needed to solve for any unknown, given any three of the remaining variables and an appropriate protocol. A list of implied constraints has been provided to facilitate early detection of invalid values assigned to trios of "known" variables and to help ensure that required guesses at value of unknowns do not violate implied limits. Erroneous and correct relationships between periodic rate (P) and annual percentage rate (APR) are compared. North. J. Appl. For. 11(2):58-62.