贷款分配方法的数学模型及其解法

为了解决三角债问题，银行给出一笔贷款，应该如何分配这笔贷款，使清理的债务达到最大。本文建立这个问题的数学模型，并且给出一个解法。     

Kinematic Analysis of Robotic Bevel-Gear Trains: An Application of Network Model Approach

The network model approach for rigid and multi-rigid body systems developed recently [1,2] can also be used conveniently in formulating system equations or equations of motion of three-dimensional mechanical systems of interconnected rigid bodies. In this article, this method is further elaborated for establishing only the kinematics of spatial robotic bevel-gear trains. However the dynamic analysis of such systems using the same method is also possible and will be taken up in a future publication.     

Scheduling in network flow shops

We consider the general problem of static scheduling of a set of jobs in a network flow shop. In network flow shops, the scheduler not only has to sequence and schedule but also must concurrently determine the process routing of the jobs through the shop. In this paper, we establish the computational complexity of this new class of scheduling problem and propose a general purpose heuristic procedure. The performance of the heuristic is analyzed when makespan, cycle time and average flow time are the desired objectives.This research has been supported by the UCLA Academic Senate Grant #95.     

The network approach to calculation of characteristic time constants of the flat two-layer superconducting cable

The matrix method was used to investigate the process of current decay in the samples of flat two-layer superconducting cables. The discrete spectrum of eigen-frequencies has been obtained. Each of these frequencies determines the rate of decay of the correspondent eigen-current. Despite of the increasing of the number of eigen-frequencies with the enlargement of the sample dimensions the spectrum remains finite, as the maximum and minimum frequencies tend to finite limits. An analysis made for the lowest eigen-frequencies showed the corresponding eigen-currents to be slowly decaying long current loops. Within the range of high frequencies the sinusoidal distribution of eigen-currents in the rows of the cable was observed.     

Detecting embedded pure network structures in LP problems

Recently, linear programming problems with special structures have assumed growing importance in mathematical programming. It is well known that exploiting network structures within linear programs can lead to considerable improvement of the computational solution of large-scale linear programming problems. A linear program is said to contain an embedded network structure provided that some subset of its constraints can be interpreted as specifying conservation of flow. If a column of the constraint matrix has at most two non-zeros, then it leads to embedded generalized network structure and if these non-zeros are unit elements and of opposite signs, then it leads to embedded pure network structure. In this paper, we are concerned with algorithms for detecting embedded pure network structures within linear programs. The network extraction methods are presented in two groups. The first group covers deletion and addition based algorithms and the second group covers GUB based algorithms. We have extended the GUB based algorithm appearing in the second group by introducing Markowitz merit count approach for exploiting matrix non zeros. A set of well known test problems has been used to carry out computational experiments which show that our extensions to the GUB based algorithms give better results than the algorithms reported earlier.     

Computational aspects of two-segment separable programming

Recursive separable programming algorithms based on local, two-segment approximations are described for the solution of separable convex programs. Details are also given for the computation of lower bounds on the optimal value by both a primal and a dual approach, and these approaches are compared. Computational comparisons of the methods are provided for a variety of test problems, including a water supply application (with more than 600 constraints and more than 900 variables) and an econometric modelling problem (with more than 200 variables). Research supported by National Science Foundation Grants MCS74-20584 A02 and MCS-7901066.     

Integral decomposition in polyhedra

We say that a polyhedronP satisfies weak integral decomposition if whenever an integral vector is the sum ofk vectors inP it is also the sum ofk integral vectors inP. This property is related to rounding results for packing and covering problems. We study the property and two related properties, and give results concerning integral polymatroids, totally unimodular matrices and network flows, pairs of strongly-base-orderable matroids, and branchings in directed graphs.     

Enhanced Optical Image Verification Based on Joint Transform Correlator Adopting Fourier Hologram

In this paper two new architectures for optical image verification are proposed. Both architectures are based on conventional joint transform correlators (JTCs) adopting a Fourier hologram and can significantly improve the recovered image quality. First, an input phase-only function is Fourier transformed and then interferes with a reference wave that is diffracted from a plane wave incident on another random phase mask. Second, two phase-only functions are placed at the two input sides of a beamsplitter such that the interference pattern of their Fourier transforms can be detected. To obtain a predefined target image in the output plane, one of the input phase functions is iteratively retrieved by the use of the projection onto constraint sets algorithm. Simulation results show that the less mean squared error and better image quality are obtained for both the binary and grayscale images.     

劳动和社会保障办公系统的开发与应用

采用Lotus Domino/Notes文档数据库 Oracle关系数据库的独特结构模式,集成了Microsoft Office Outlook系统软件,主要功能通过浏览器/服务器(B/S)方式实现,系统设计采用了组件化、模块化的思想,为工作流程的定制和公文流转过程的控制提供了强大功能.     

Shift-tolerance Property of Optical Security System using Phase-based Virtual Image

The shift-tolerance property of the encrypted image or the Fourier decrypting key in the Fourier space is proposed based on a phase-encoded virtual image. The encrypted data is obtained by the Fourier transform of the product of a phase-encoded virtual image to camouflage the original one and a random phase image. Therefore, even if unauthorized users analyze the encrypted image, they cannot reconstruct the required image. This virtual image protects the original one from being counterfeited and from unauthorized access. We demonstrate the robustness to data loss and shift of the encrypted data or the Fourier decrypting key in the proposed decryption technique using an interferometer.