Simplest optimal cutting patterns for equal rectangles

This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found.     

日本青少年心理问题初探

青少年心理问题是社会高度现代化后带来的副产品。日本是亚洲第一个高度现代化的国家,青少年心理问题尤为突出。该文从日本青少年心理问题引发的社会现象入手,剖析其原因,找出解决途径。当前,我国正处于现代化的初级阶段,青少年心理问题层出不穷,有必要学习日本的经验,采取一些防治措施,以达到未雨绸缪之功效。     

Axisymmetric Collision Problem for Two Identical Elastic Solids of Revolution

A direct central collision of two identical bodies of revolution is studied. A nonstationary mixed boundary-value problem with an unknown moving boundary is formulated. Its solution is represented by a series in term of Bessel functions. An infinite system of Volterra equations of the second kind for the unknown expansion coefficients is derived by satisfying the boundary conditions. The basic characteristics of the collision process are determined depending on the curvature of the frontal surface of the bodies     

A Stability Estimate for a Solution of the Problem of Determining the Dielectric Permittivity

We consider the problem of determining the dielectric permittivity for a nonconducting and nonmagnetic medium. As information we take the traces of the tangential components of the electromagnetic field on the lateral surface of a cylindrical domain. These traces correspond to a solution to some direct problem for the Maxwell system. The impulse source of the current flux lies outside the domain in which the coefficient is sought. The main result of the article is a stability estimate for a solution to the inverse problem in question.     

Banach空间二阶周期边值问题解的存在性

利用一些比较结果，讨论了Banach空间中二阶周期边值问题解的存在性，获得了若干解的存在性与唯一性结果。     

Multiplicity results for positive solutions of some semi-positone three-point boundary value problems

In this paper, some multiplicity results for positive solutions of some singular semi-positone three-point boundary value problem be obtained by using the fixed point index method.     

Existence of two solutions of m-point boundary value problem for second order dynamic equations on time scales

In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered.     

Improved bounds for some nonstandard problems in generalized heat conduction

We consider the Maxwell-Cattaneo system of equations for generalized heat conduction where the temperature and heat flux satisfy a nonstandard auxiliary condition which prescribes a combination of their values initially and at a later time. We obtain L₂ bounds for the temperature and heat flux by means of Lagrange identities. These bounds extend the range of validity for the parameter in the nonstandard condition under a constraint on the coefficients in the differential equations.     

Convergence estimates of Galerkin-wavelet solutions to a Cauchy problem for a class of periodic pseudodifferential equations

A class of Cauchy problems for interesting complicated periodic pseudodifferential equations is considered. By the Galerkin-wavelet method and with weak solutions one can find sufficient conditions to establish convergence estimates of weak Galerkin-wavelet solutions to a Cauchy problem for this class of equations.

     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.