Frequency–energy plots of steady-state solutions for forced and damped systems,and vibration isolation by nonlinear mode localization

We study the structure of the periodic steady-state solutions of forced and damped strongly nonlinear coupled oscillators in the frequency–energy domain by constructing forced and damped frequency – energy plots (FEPs). Specifically, we analyze the steady periodic responses of a two degree-of-freedom system consisting of a grounded forced linear damped oscillator weakly coupled to a strongly nonlinear attachment under condition of 1:1 resonance. By performing complexification/averaging analysis we develop analytical approximations for strongly nonlinear steady-state responses. As an application, we examine vibration isolation of a harmonically forced linear oscillator by transferring and confining the steady-state vibration energy to the weakly coupled strongly nonlinear attachment, thereby drastically reducing its steady-state response. By comparing the nonlinear steady-state response of the linear oscillator to its corresponding frequency response function in the absence of a nonlinear attachment we demonstrate the efficacy of drastic vibration reduction through steady-state nonlinear targeted energy transfer. Hence, our study has practical implications for the effective passive vibration isolation of forced oscillators.     

Numerical proof of stability of roll waves in the small-amplitude limit for inclined thin film flow

We present a rigorous numerical proof based on interval arithmetic computations categorizing the linearized and nonlinear stability of periodic viscous roll waves of the KdV–KS equation modeling weakly unstable flow of a thin fluid film on an incline in the small-amplitude KdV limit. The argument proceeds by verification of a stability condition derived by Bar–Nepomnyashchy and Johnson–Noble–Rodrigues–Zumbrun involving inner products of various elliptic functions arising through the KdV equation. One key point in the analysis is a bootstrap argument balancing the extremely poor sup norm bounds for these functions against the extremely good convergence properties for analytic interpolation in order to obtain a feasible computation time. Another is the way of handling analytic interpolation in several variables by a two-step process carving up the parameter space into manageable pieces for rigorous evaluation. These and other general aspects of the analysis should serve as blueprints for more general analyses of spectral stability.     

Lagrangian distributions and connections in multisymplectic and polysymplectic geometry

We discuss the interplay between lagrangian distributions and connections in (generalized) symplectic geometry, beginning with the traditional case of symplectic manifolds and then passing to the more general context of poly- and multisymplectic structures on fiber bundles, which is relevant for the covariant hamiltonian formulation of classical field theory. In particular, we generalize Weinstein?s tubular neighborhood theorem for symplectic manifolds carrying a (simple) lagrangian foliation to this situation. In all cases, the Bott connection, or an appropriately extended version thereof, plays a central role.     

A distance on curves modulo rigid transformations

We propose a geometric method for quantifying the difference between parametrized curves in Euclidean space by introducing a distance function on the space of parametrized curves up to rigid transformations (rotations and translations). Given two curves, the distance between them is defined as the infimum of an energy functional which, roughly speaking, measures the extent to which the jet field of the first curve needs to be rotated to match up with the jet field of the second curve. We show that this energy functional attains a global minimum on the appropriate function space, and we derive a set of first-order ODEs for the minimizer.     

Dynamical analysis and control strategies on malware propagation model

A variable infection rate is more realistic to forecast dynamical behaviors of malware (malicious software) propagation. In this paper, we propose a time-delayed SIRS model by introducing temporal immunity and the variable infection rate. The basic reproductive number R₀ which determines whether malware dies out is obtained. Furthermore, using time delay as a bifurcation parameter, some necessary and sufficient conditions ensuring Hopf bifurcation to occur for this model are derived. Finally, numerical simulations verify the correctness of theoretical results. Most important of all, we investigate the effect of the variable infection rate on the scale of malware prevalence and compare our model with stationary analytical model by simulation. According to simulating results, some strategies that control malware rampant are given, which may be incorporated into cost-effective antivirus policies for organizations to work quite well in practice.     

Prospective elementary teachers’ claiming in responses to false generalizations

When faced with a false generalization and a counterexample, what types of claims do prospective K-8 teachers make, and what factors influence the type and prudence of their claims relative to the data, observations, and arguments reported? This article addresses that question. Responses to refutation tasks and cognitive interviews were used to explore claiming. It was found that prospective K-8 teachers’ claiming can be influenced by knowledge of argumentation; knowledge and use of the mathematical practice of exception barring; perceptions of the task; use of natural language; knowledge of, use of, and skill with the mathematics register; and abilities to technically handle data or conceptual insights. A distinction between technical handlings for developing claims and technical handlings for supporting claims was made. It was found that prudent claims can arise from arguer-developed representations that afford conceptual insights, even when searching for support for a different claim.     

Integral geometry of translation invariant functionals,II: The case of general convex bodies

In continuation of Part I, we study translative integral formulas for certain translation invariant functionals, which are defined on general convex bodies. Again, we consider local extensions and use these to show that the translative formulas extend to arbitrary continuous and translation invariant valuations. Then, we discuss applications to Poisson particle processes and Boolean models which contain, as a special case, some new results for flag measures.     

Projective embeddings of dual polar spaces arising from a class of alternative division rings

We discuss some recent results of us regarding a class of polar spaces which includes the nonembeddable polar spaces introduced by Tits [Tits, J., “Buildings of spherical type and finite BN-pairs,” Lecture Notes in Mathematics 386, Springer-Verlag, Berlin-New York, 1974]. These results include an elementary construction of the polar space, a construction of a polarized embedding of the corresponding dual polar space and the determination whether this projective embedding is universal and unique (as a polarized embedding).     

Software rejuvenation and resource reservation policies for optimizing server resource availability using cyclic nonhomogeneous Markov chains

Software rejuvenation is modeled in a client–server system, which provides resources to priority classes of users. To assure availability, resource reservation policies are adopted for the higher priority classes. In addition software rejuvenation is proposed to optimize resource availability. The system is modeled by a cyclic nonhomogeneous Markov chain to capture the variation of the arrival and service rates during a day period. An optimization problem is solved based on a similar previous work and given the optimal resource reservation policy obtained by its solution, rejuvenation is performed and the optimal rejuvenation policy is determined. As a measure of resource availability the blocking probability of each priority class is used. Performability indicators expressing the total cost are also derived, with respect to the optimal resource reservation and optimal rejuvenation policies, to examine whether rejuvenation benefits the system in terms of cost. To derive the blocking probabilities, the limiting probability distribution is computed using explicit generalized approximate inverse preconditioning for solving efficiently sparse linear systems of algebraic equations. Copyright © 2012 John Wiley & Sons, Ltd.     

Optimizing project selection: a perspective from resource constraints

In reality, projects usually consume complex resources. Making good use of the various resources is vital for optimal project selection and maximum profit earning. This paper proposes a new project selection model from the perspective of complex resource constraints. In the model, the resources are divided into non-renewable and renewable categories, and some resources of the two categories can both be shared by different projects. In addition, the paper considers the situation where the company has resources in stock and can purchase them in the marketplace if they are out of stock. The paper proves that the proposed model which considers renewable resource and resource sharing produces higher profit than the ones that do not consider renewable resource and resource sharing. To solve the complex model problem, an improved genetic algorithm is presented. For the sake of illustration, a case study is provided.     

带有资源转移时间的RCPSP资源流模型及算法

本文在传统资源受限项目调度问题(resource-constrained project scheduling problem, RCPSP)中引入资源转移时间,为有效获得问题的最优解,采用资源流编码方式表示可行解,建立了带有资源转移时间的RCPSP资源流优化模型,目标为最小化项目工期。根据问题特征设计了改进的资源流重构邻域算子,分别设计了改进的禁忌搜索算法和贪心随机自适应禁忌搜索算法求解模型。数据实验结果表明,相较于现有文献中的方法,所提两种算法均可针对更多的项目实例求得最优解,并且得到最优解的时间更短,求解效率更高。此外,分析了算法在求解具有不同特征的项目实例时的性能,所得结果为项目经理结合项目特征评价算法适用性提供了指导。     

Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous markov modeling

Resource availability optimization is studied on a server–client system where different users are partitioned into priority classes. The aim is to provide higher resource availability according to the priority of each class. For this purpose, resource reservation is modeled by a homogeneous continuous time Markov chain (CTMC), but also by a cyclic non-homogeneous Markov chain (CNHMC) as there is a cyclic behavior of the users’ requests for resources. The contribution of the work presented consists in the formulation of a multiobjective optimization problem for both the above cases that aims to determine the optimal resource reservation policy providing higher levels of resource availability for all classes. The optimization problem is solved either with known methods or with a proposed kind of heuristic algorithm. Finally, explicit generalized approximate inverse preconditioning methods are adopted for solving efficiently sparse linear systems that are derived, in order to compute resource availability.     

A new AATP model with considering supply chain lead-times and resources and scheduling of the orders in flowshop production systems: A graph-theoretic view

The present study attempts to synchronize the scheduling problem with determining the advanced available-to-promise (AATP) in a flowshop system to enhance supplier profitability and service level. In the proposed model the AATP, scheduling and graph theory concept have been combined to find the optimum resource allocation and enable accurate estimations of machines scheduling, production costs and delivery dates. To find the near optimum solutions for the large size problems a genetic algorithm is developed, first the orders are ranked based on their scores which are estimated then the optimum cost is calculated by balancing profitability and constraints such as the availability of the machines or the available material in each workstation. Some computer simulated experiments are provided to evaluate the performance of the proposed algorithm.     

Multi-mode resource constrained multi-project scheduling and resource portfolio problem

This paper introduces a multi-project problem environment which involves multiple projects with assigned due dates; activities that have alternative resource usage modes; a resource dedication policy that does not allow sharing of resources among projects throughout the planning horizon; and a total budget. Three issues arise when investigating this multi-project environment. First, the total budget should be distributed among different resource types to determine the general resource capacities, which correspond to the total amount for each renewable resource to be dedicated to the projects. With the general resource capacities at hand, the next issue is to determine the amounts of resources to be dedicated to the individual projects. The dedication of resources reduces the scheduling of the projects’ activities to a multi-mode resource constrained project scheduling problem (MRCPSP) for each individual project. Finally, the last issue is the efficient solution of the resulting MRCPSPs. In this paper, this multi-project environment is modeled in an integrated fashion and designated as the resource portfolio problem. A two-phase and a monolithic genetic algorithm are proposed as two solution approaches, each of which employs a new improvement move designated as the combinatorial auction for resource portfolio and the combinatorial auction for resource dedication. A computational study using test problems demonstrated the effectiveness of the solution approach proposed.     

Optimal Planning of a Multi-Station System with Sojourn Time Constraints

This paper studies a dynamic production system where multiple products must visit stations where inventories are constrained by maximum and minimum sojourn times with neither negative flow nor backlog being allowed. A resource availability constraint limits the aggregate throughput of the stations. The objective is to minimize the sum of flow and inventory cost. The problem is broken down into several single-product serial systems that serve as subroutines of a Lagrangian relaxation routine. This model is implemented in a spreadsheet so that it can be used by the officials of a Chilean institution for planning the operations and defining the optimal allocation of resources.