Partial information systems and the Smyth powerdomain

The dual of the join semilattice of proper compact Scott open subsets of a domain D is called the Smyth powerdomain of D. The Smyth powerdomain is used in programming semantics as a model for demonic nondeterminism. In this paper, we introduce the concept of partial information systems; and, as an application, show that the Smyth powerdomain of any domain can be realized in terms of the sub partial information systems of the domain??s corresponding information system.     

Minimality and other properties of the width- nonadjacent form

Let be an integer and let be the set of integers that includes zero and the odd integers with absolute value less than . Every integer can be represented as a finite sum of the form , with , such that of any consecutive 's at most one is nonzero. Such representations are called width- nonadjacent forms (-NAFs). When these representations use the digits and coincide with the well-known nonadjacent forms. Width- nonadjacent forms are useful in efficiently implementing elliptic curve arithmetic for cryptographic applications. We provide some new results on the -NAF. We show that -NAFs have a minimal number of nonzero digits and we also give a new characterization of the -NAF in terms of a (right-to-left) lexicographical ordering. We also generalize a result on -NAFs and show that any base 2 representation of an integer, with digits in , that has a minimal number of nonzero digits is at most one digit longer than its binary representation.

     

G-Strands

A G-strand is a map g(t,s):?×?→G for a Lie group G that follows from Hamilton’s principle for a certain class of G-invariant Lagrangians. The SO(3)-strand is the G-strand version of the rigid body equation and it may be regarded physically as a continuous spin chain. Here, SO(3) _K -strand dynamics for ellipsoidal rotations is derived as an Euler–Poincaré system for a certain class of variations and recast as a Lie–Poisson system for coadjoint flow with the same Hamiltonian structure as for a perfect complex fluid. For a special Hamiltonian, the SO(3) _K -strand is mapped into a completely integrable generalization of the classical chiral model for the SO(3)-strand. Analogous results are obtained for the Sp(2)-strand. The Sp(2)-strand is the G-strand version of the Sp(2) Bloch–Iserles ordinary differential equation, whose solutions exhibit dynamical sorting. Numerical solutions show nonlinear interactions of coherent wave-like solutions in both cases. Diff(?)-strand equations on the diffeomorphism group G=Diff(?) are also introduced and shown to admit solutions with singular support (e.g., peakons).     

Single phase limit for melting nanoparticles

The melting of a spherical or cylindrical nanoparticle is modelled as a Stefan problem by including the effects of surface tension through the Gibbs–Thomson condition. A one-phase moving boundary problem is derived from the general two-phase formulation in the singular limit of slow conduction in the solid phase, and the resulting equations are studied analytically in the limit of small time and large Stefan number. Further analytical approximations for the temperature distribution and the position of the solid–melt interface are found by applying an integral formulation together with an iterative scheme. All these analytical results are compared with numerical solutions obtained using a front-fixing method, and are shown to provide good approximations in various regimes. The inclusion of surface tension, which acts to decrease the melting temperature as the particle melts, is shown to accelerate the melting process. Unlike the classical one-phase Stefan problem without surface tension, the solid–melt interface exhibits blow-up at some critical radius of the particle (which for metals is of the order of a few nanometres), a phenomenon that has been observed experimentally. An interesting feature of the model is the prediction that surface tension drives superheating in the solid particle before blow-up occurs.     

Mathematics and Science Integration: Models and Characterizations

The squeeze on instructional time and other factors increasingly leads educators to consider mathematics and science integration in an effort to be more efficient and effective. Unfortunately, the need for common understandings for what it means to integrate these disciplines, as well as the need for improving disciplinary knowledge, appears to continue to be significant obstacles to an integrated approach to instruction. In this study we report the results of a survey containing six instructional scenarios administered to thirty-three middle grades science and math teachers. Analysis of teacher responses revealed that while teachers applied similar criteria in their reasoning, they did not possess common characterizations for integration. Furthermore, analysis suggested that content knowledge serves as a barrier to recognizing integrated examples. Implications for professional development planners include the need to develop and provide teachers with constructs and parameters for what constitutes mathematics and science integration. Continued emphasis on improving teacher content knowledge in both mathematics and science is also a prerequisite to enabling teachers to integrate content.     

Multi-objective evacuation routing in transportation networks

In this paper, the optimal design and analysis of evacuation routes in transportation networks is examined. An methodology for optimal egress route assignment is suggested. An integer programming (IP) formulation for optimal route assignment is presented, which utilizes M/G/c/c state dependent queueing models to cope with congestion and time delays on road links. M/G/c/c simulation software is used to evaluate performance measures of the evacuation plan: clearance time, total travelled distance and blocking probabilities. Extensive experimental results are included.     

On the concepts of intertwining operator and tensor product module in vertex operator algebra theory

We produce counterexamples to show that in the definition of the notion of intertwining operator for modules for a vertex operator algebra, the commutator formula cannot in general be used as a replacement axiom for the Jacobi identity. We further give a sufficient condition for the commutator formula to imply the Jacobi identity in this definition. Using these results we illuminate the crucial role of the condition called the “compatibility condition” in the construction of the tensor product module in vertex operator algebra theory, as carried out in work of Huang and Lepowsky. In particular, we prove by means of suitable counterexamples that the compatibility condition was indeed needed in this theory.     

Indecomposable continua and the Julia sets of polynomials, II

We find necessary and sufficient conditions for the connected Julia set of a polynomial of degree d?2 to be an indecomposable continuum. One necessary and sufficient condition is that the impression of some prime end (external ray) of the unbounded complementary domain of the Julia set J has nonempty interior in J. Another is that every prime end has as its impression the entire Julia set. The latter answers a question posed in 1993 by the second two authors.We show by example that, contrary to the case for a polynomial Julia set, the image of an indecomposable subcontinuum of the Julia set of a rational function need not be indecomposable.     

Fast neighborhood search for the single machine total weighted tardiness problem

Most successful heuristics for solving 1||∑w_jT_j are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n³) to O(n²). We show that this result also improves the complexity of the recently developed dynasearch heuristics.     

Volatility estimation for stochastic project value models

One of the key parameters in modeling capital budgeting decisions for investments with embedded options is the project volatility. Most often, however, there is no market or historical data available to provide an accurate estimate for this parameter. A common approach to estimating the project volatility in such instances is to use a Monte Carlo simulation where one or more sources of uncertainty are consolidated into a single stochastic process for the project cash flows, from which the volatility parameter can be determined. Nonetheless, the simulation estimation method originally suggested for this purpose systematically overstates the project volatility, which can result in incorrect option values and non-optimal investment decisions. Examples that illustrate this issue numerically have appeared in several recent papers, along with revised estimation methods that address this problem. In this article, we extend that work by showing analytically the source of the overestimation bias and the adjustment necessary to remove it. We then generalize this development for the cases of levered cash flows and non-constant volatility. In each case, we use an example problem to show how a revised estimation methodology can be applied.