Lifting Property of Direct Sums of Hollow Modules

We give necessary and sufficient conditions for a module M with a decomposition that complements maximal direct summands to be a lifting module. We apply our results to get a necessary and sufficient condition for a direct sum of modules to be a quasi-discrete (discrete) module. We also give some sufficient conditions for a lifting module to be a direct sum of indecomposables.     

Reduction and construction of exact solutions for a nonlinear system of the parabolic type

We study a system of two equations of the parabolic type with two nonlinearities depending on the sum of squares of two unknown functions. We derive conditions under which the system can be reduced to a single equation. We indicate conditions under which this equation can be reduced to a linear heat equation or to semilinear equations. We construct parametric families of exact solutions defined by elementary functions. We derive a control law providing the existence of a wide class of functions that can be realized as exact solutions.     

An Interactive Algorithm for Multi-objective Route Planning

We address the route selection problem for Unmanned Air Vehicles (UAV) under multiple objectives. We consider a general case for this problem, where the UAV has to visit several targets and return to the base. We model this problem as a combination of two combinatorial problems. First, the path to be followed between each pair of targets should be determined. We model this as a multi-objective shortest path problem. Additionally, we need to determine the order of the targets to be visited. We model this as a multi-objective traveling salesperson problem (MOTSP). The overall problem is a combination of these two problems, which we define as a generalized MOTSP. We develop an exact interactive approach to identify the best paths and the best tour of a decision maker under a linear utility function.     

Characteristics of semi-convex frontier optimization

We study semi-convex frontier (SCF) optimization problems where objective functions can be semi-convex and constraint sets can be non-polyhedron, which stem from a growing range of optimization applications such as frontier analysis, multi-objective programming in economics. The new findings of this paper can be summarized as follows: (1) We characterize non-dominated points of a non-polyhedron optimal solution set of a semi-convex frontier program. (2) We obtain optimality conditions of a constant modulus SCF program, of which the objective function is semi-convex with a constant semiconvexity modulus. (3) We obtain a non-smooth Hölder stability of the optimal solutions of a semiconvex frontier program. (4) We use generalized differentiability to establish sensitivity analysis of the optimal value function of a semi-convex frontier program.     

INITIAL VALUE TECHNIQUES FOR THE HELMHOLTZ AND MAXWELL EQUATIONS

We study the initial value problem of the Helmholtz equation with spatially variable wave number. We show that it can be stabilized by suppressing the evanescent waves. The stabilized Helmholtz equation can be solved numerically by a marching scheme combined with FFT. The resulting algorithm has complexity n^2 log n on a n x n grid. We demonstrate the efficacy of the method by numerical examples with caustics. For the Maxwell equation the same treatment is possible after reducing it to a second order system. We show how the method can be used for inverse problems arising in acoustic tomography and microwave imaging.     

On permutation graphs

We give an upper bound of the number of edges of a permutation graph. We introduce some necessary conditions for a graph to be a permutation graph, and we discuss the independence of these necessary conditions. We show that they are altogether not sufficient for a graph to be a permutation graph.     

Solving survivable two-layer network design problems by metric inequalities

We address the problem of designing a multi-layer network with survivability requirements. We are given a two-layer network: the lower layer represents the potential physical connections that can be activated, the upper layer is made of logical connections that can be set up using physical links. We are given origin-destination demands (commodities) to be routed at the upper layer. We are also given a set of failure scenarios and, for every scenario, an associated subset of commodities. The goal is to install minimum cost integer capacities on the links of both layers in order to ensure that the commodities can be routed simultaneously on the network. In addition, in every failure scenario the routing of the associated commodities must be guaranteed. We consider two variants of the problem and develop a branch-and-cut scheme based on the capacity formulation. Computational results on instances derived from the SNDLib for single node failure scenarios are discussed.     

Chaotic convection in a ferrofluid

We report theoretical and numerical results on thermally driven convection of a magnetic suspension. The magnetic properties can be modeled as those of electrically non-conducting superparamagnets. We perform a truncated Galerkin expansion finding that the system can be described by a generalized Lorenz model. We characterize the dynamical system using different criteria such as Fourier power spectrum, bifurcation diagrams, and Lyapunov exponents. We find that the system exhibits multiple transitions between regular and chaotic behaviors in the parameter space. Transient chaotic behavior in time can be found slightly below their linear instability threshold of the stationary state.     

Acoustic scattering in a rarefied gas: Solving the R13 equations in spherical polar coordinates

In some circumstances, sound waves in a rarefied gas can be studied using a linearised form of the regularised 13-moment equations of Struchtrup and Torrilhon. We build solutions of those equations in spherical polar coordinates using vector spherical harmonics. We first solve a reduced system of equations (with 11 unknowns) after introduction of a force vector (divergence of the stress). We then show that the stresses themselves can be recovered by solving five additional equations. The results obtained are expected to be useful for problems such as acoustic scattering of a plane wave by a sphere in a rarefied gas.     

A polynomial feasibility test for preemptive periodic scheduling of unrelated processors

We consider the problem of preemptive scheduling a set of periodically occurring jobs on a set of unrelated processors, that is, processors having different speeds for different jobs. We assume that each occurrence of a job has to be completely processed before the next occurrence of the same job. We provide a system of linear inequalities for testing the existence of a feasible schedule which can be solved in polynomial time. We then use the solution to this linear system, if any, for constructing a feasible schedule in a straightforward way.     

Triangularizing semigroups of matrices over a skew field

We define a closure operation on semigroups of matrices over a skew field, and show that a semigroup of matrices can be (upper) triangularized if and only if its closure can be. We then give necessary and sufficient conditions for a closed semigroup to be triangularizable.     

Families of exact solutions for linear and nonlinear wave equations with a variable speed of sound and their use in solving initial boundary value problems

We propose a procedure for multiplying solutions of linear and nonlinear one-dimensional wave equations, where the speed of sound can be an arbitrary function of one variable. We obtain exact solutions. We show that the functional series comprising these solutions can be used to solve initial boundary value problems. For this, we introduce a special scalar product.     

Isoperimetric Inequalities for Soluble Groups

We approach the question of which soluble groups are automatic. We describe a class of nilpotent-by-Abelian groups which need to be studied in order to answer this question. We show that the nilpotent-by-cyclic groups in this class have exponential isoperimetric inequality and so cannot be automatic.     

Lie Group Spectral Variational Integrators

We present a new class of high-order variational integrators on Lie groups. We show that these integrators are symplectic and momentum-preserving, can be constructed to be of arbitrarily high order, or can be made to converge geometrically. Furthermore, these methods are capable of taking very large time-steps. We demonstrate the construction of one such variational integrator for the rigid body and discuss how this construction could be generalized to other related Lie group problems. We close with several numerical examples which demonstrate our claims and discuss further extensions of our work.     

Quasivarieties of orthomodular lattices determined by conditions on states

In this paper we carry on the research initiated in [13] and [14]. We consider classes of orthomodular lattices which satisfy certain state and polynomial conditions. We show that these classes form quasivarieties. We then exhibit basic examples of these quasivarieties (some of these examples originated in the quantum logic theory). We finally show how the quasivarieties in question can be described in terms of implicative equations. (It should be noted that in some cases we have not been able to clarify whether or not a class shown to be a quasivariety is a variety, see Section 2.) Received May 26, 1998; accepted in final form May 19, 1999.     

Richman extensions of an integral domain

We introduce the notion of a Richman extension of an integral domain, and show its basic properties. We further show that a flat extension need not be a Richman extension, and a Richman extension need not be an LCM-stable extension.     

人数与任务数不相等的指派问题

本提出人数与任务数不相等的指派问题应当视为一个多目标决策问题，首先要求指派给各人的任务数目两两之间相差不能超过1，其次要求所需总时间最少；并且给出了该问题的求解方法。     

Transboundary extraction of groundwater in the presence of hydraulic fracturing

We studied transboundary groundwater management problems in the presence of hydraulic fracturing. We found that the presence of risk suggests there should be caution when considering hydraulic fracturing. Our results from the cooperative solution show a decrease in hydraulic fracturing and increase in the steady state survival rate of groundwater. We also provide a Pigouvian type tax that could be imposed on natural gas developers.     

最小化加权误工工件数的多代理平行分批排序

考虑多代理的平行分批排序,不同代理的工件不能放在同一批中加工,目标函数是最小化加权误工工件数.本文考虑两种模型,证明了甚至当所有工件具有单位权时,这两个模型都是强NP困难的.但当代理数给定时,这两个问题都可在拟多项式时间解决,并且当工件具有单位权时,可在多项式时间解决.进一步证明当代理数固定时,两个问题都有FPTAS算法.     

Two queues with alternating service and server breakdown

We consider a queueing system with two stations served by a single server in a cyclic manner. We assume that at most one customer can be served at a station when the server arrives at the station. The system is subject to service interuption that arises from server breakdown. When a server breakdown occurs, the server must be repaired before service can resume. We obtain the approximate mean delay of customers in the system.