Canonical Integral Equations of Stokes Problem

The canonical boundary reduction, suggested by Feng Kang, also can be applied to the bidimensional steady Stokes problem. In this paper we first give the representation formula for the solution of the Stokes problem via two complex variable functions. Then by means of complex analysis and the Fourier analysis, we find the expressions of the Poisson integral formulas and the canonical integral equations in three typical domains. From these results the canonical boundary element method for solving the Stokes problem can be developed.     

A Canonical Diffraction Problem With Two Media

A Wiener–Hopf equation in L² being equivalent [5] to a boundary value problem (of the first kind) for a wave-scattering Sommerfeld half-plane Σ=ℝ₊×{0} which faces two different media Ω_-: x₂<0, Ω₊: x₂>0, as a special configuration in [3], is solved by canonical Weiner–Hopf factorization of its L²-regular scalar symbol γ_o=γ_o- γ_o+. The factors are calculated by solving a Riemann–Hilbert boundary value problem on the semi-infinite branch cuts of t_j(ξ):=(ξ²−k²_j)^1/2, k_j∈ℂ⁺⁺ for j=1,2: taken parallel to the imaginary axis. The procedure following this idea is known as the Wiener–Hopf–Hilbert(–Hurd) method [2] and requires the evaluation of elliptic-type integrals. Formula (3.7) seems not to be contained in tables of integrals.     

The Bitangential Inverse Input Impedance Problem for Canonical Systems, II: Formulas and Examples

This paper continues the study of the bitangential inverse input impedance problem for canonical integral systems that was initiated in [ArD6]. The problem is to recover the system, given an input impedance matrix valued function c() (that belongs to the Carathéodory class of p × p matrix valued functions that are holomorphic and have positive real part in the open upper half plane) and a chain of pairs of entire inner p × p matrix valued functions (that are identified with the associated pairs of the second kind of the matrizant of the system). Formulas for recovering the underlying canonical integral systems are derived by reproducing kernel Hilbert space methods. A number of examples are presented. Special attention is paid to the case when c() is of Wiener class and also when it is both of Wiener class and rational.     

线性系统标准分解的解耦问题

本文解决了线性系统标准分解在其分解的四个子空间上解耦为四个独立子系统的问题。     

Computation of the Reverse Shortest-Path Problem

The shortest-path problem in a network is to find shortest paths between some specified sources and terminals when the lengths of edges are given. This paper studies a reverse problem: how to shorten the lengths of edges with as less cost as possible such that the distances between specified sources and terminals are reduced to the required bounds. This can be regarded as a routing speed-up model in transportation networks. In this paper, for the general problem, the NP-completeness is shown, and for the case of trees and the case of single source-terminal, polynomial-time algorithms are presented.     

不定积分中的“积不出”问题

利用刘维尔(J.Liouville)定理讨论了几类不定积分是否初等函数的问题,并给出了相应的判定法则.     

关于单电子电脑断层摄影图像重建的反问题

关于单电子电脑断层摄影图像的重建过程是一个完全不适定的反问题.由于其在医学诊断上的实际重要性,这个问题近来已被提出了很多次.这篇文章展现了对SPECT问题的理论分析并且着重讨论了应用正则化技术的数值解决方法.同时针对大型问题设计了多层连续应用算法以提高效率.最后作者为进一步的数值分析提供了直接的实验依据并给予结论.     

NOTE New Upper Bounds for a Canonical Ramsey Problem

f (l,k) be the minimum n with the property that every coloring yields either with , or with all distinct. We prove that if , then as . This supports the conjecture of Lefmann, R?dl, and Thomas that . Received July 2, 1998     

The Single Source Weber Problem — Survey and Extensions

Alfred Weber reduced the problem of locating a firm under the conditions that all cost elements other than those which vary regularly with space are held constant, to that of determining the point(s) of minimum transportation costs. This paper presents a survey of the techniques used to solve this problem and gives an efficient Quadratic Approximation Search Technique which was coded in FORTRAN IV and tested on a number of problems for it.     

单时期证券市场的最优投资组合

考虑了单时期金融市场模型的最优投资组合问题,并对一般的效用函数,给出了最优投资组合问题有解的一个充分条件.     

The Bitangential Inverse Input Impedance Problem for Canonical Systems,I: Weyl-Titchmarsh Classification,Existence and Uniqueness

The inverse input impedance problem is investigated in the class of canonical integral systems with matrizants that are strongly regular J-inner matrix valued functions in the sense introduced in [ArD1]. The set of solutions for a problem with a given input impedance matrix (i.e., Weyl- Titchmarsh function) is parameterized by chains of associated pairs of entire inner p × p matrix valued functions. In our considerations the given data for the inverse bitangential input impedance problem is such a chain and an input impedance matrix, i.e., a p × p matrix valued function in the Carathéodory class. Existence and uniqueness theorems for the solution of this problem are obtained by consideration of a corresponding family of generalized bitangential Carathéodory interpolation problems. The connection between the inverse bitangential input scattering problem that was studied in [ArD4] and the bitangential input impedance problem is also exploited. The successive sections deal with: 1. The introduction, 2. Domains of linear fractional transformations, 3. Associated pairs of the first and second kind, 4. Matrix balls, 5. The classification of canonical systems via the limit ball, 6. The Weyl-Titchmarsh characterization of the input impedance, 7. Applications of interpolation to the bitangential inverse input impedance problem. Formulas for recovering the underlying canonical integral systems, examples and related results on the inverse bitangential spectral problem will be presented in subsequent publications.D. Z. Arov thanks the Weizmann Institute of Science for hospitality and support, partially as a Varon Visiting Professor and partially through the Minerva Foundation. H. Dym thanks Renee and Jay Weiss for endowing the chair which supports his research and the Minerva Foundation.     

A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem

In the Single Source Capacitated Facility Location Problem (SSCFLP) each customer has to be assigned to one facility that supplies its whole demand. The total demand of customers assigned to each facility cannot exceed its capacity. An opening cost is associated with each facility, and is paid if at least one customer is assigned to it. The objective is to minimize the total cost of opening the facilities and supply all the customers. In this paper we extend the Kernel Search heuristic framework to general Binary Integer Linear Programming (BILP) problems, and apply it to the SSCFLP. The heuristic is based on the solution to optimality of a sequence of subproblems, where each subproblem is restricted to a subset of the decision variables. The subsets of decision variables are constructed starting from the optimal values of the linear relaxation. Variants based on variable fixing are proposed to improve the efficiency of the Kernel Search framework. The algorithms are tested on benchmark instances and new very large-scale test problems. Computational results demonstrate the effectiveness of the approach. The Kernel Search algorithm outperforms the best heuristics for the SSCFLP available in the literature. It found the optimal solution for 165 out of the 170 instances with a proven optimum. The error achieved in the remaining instances is negligible. Moreover, it achieved, on 100 new very large-scale instances, an average gap equal to 0.64% computed with respect to a lower bound or the optimum, when available. The variants based on variable fixing improved the efficiency of the algorithm with minor deteriorations of the solution quality.     

关于单边检验教学中一个问题的讨论

本文对《概率统计》课程中关于单边检验的一个例题所反映的问题进行了讨论,并且建议,统一现行教材中关于单边假设的各种提法。     

The Single Period Coverage Facility Location Problem: Lagrangean heuristic and column generation approaches

In this paper we introduce the Single Period Coverage Facility Location Problem. It is a multi-period discrete location problem in which each customer is serviced in exactly one period of the planning horizon. The locational decisions are made independently for each period, so that the facilities that are open need not be the same in different time periods. It is also assumed that at each period there is a minimum number of customers that can be assigned to the facilities that are open. The decisions to be made include not only the facilities to open at each time period and the time period in which each customer will be served, but also the allocation of customers to open facilities in their service period.     

带工件相容约束的单机分批排序问题

The single machine parallel batch problem with job compatibility is considered to minimize makespan,where the job compatibility constraints are represented by a graph G.This problem is proved to be NP-hard.And when the graph G is limited to be a general bipartite,a complete bipartite and a complete m-partite graph,these problems are solved in polynomial time respectively.     

Inner Approximation Method for a Reverse Convex Programming Problem

In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set, which is defined by the complement of the interior of a compact convex set X. We propose an inner approximation method to solve the problem in the case where X is not necessarily a polytope. The algorithm utilizes an inner approximation of X by a sequence of polytopes to generate relaxed problems. It is shown that every accumulation point of the sequence of optimal solutions of the relaxed problems is an optimal solution of the original problem.     

The Word Problem for Polynilpotent Groups with a Single Primitive Defining Relation

It is shown that polynilpotent groups with a single primitive defining relation have a decidable word problem. Supported by RFBR grant No. 05-01-00292. __________ Translated from Algebra i Logika, Vol. 45, No. 1, pp. 28–43, January–February, 2006.     

The Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of n-Cycles

A 2-factor in a graph G is a 2-regular spanning subgraph of G, and a 2-factorization of G is a decomposition of all the edges of G into edge-disjoint 2-factors. A ${\{C_{m}^{r}, C_{n}^{s}\}}$ -factorization of K _υ asks for a 2-factorization of K _υ , where r of the 2-factors consists of m-cycles, and s of the 2-factors consists of n-cycles. This is a case of the Hamilton-Waterloo problem with uniform cycle sizes m and n. If υ is even, then it is a decomposition of K _υ ? F where a 1-factor F is removed from K _υ . We present necessary and sufficient conditions for the existence of a ${\{C_{4}^{r}, C_{n}^{1}\}}$ -factorization of K _υ ? F.