求解单阶段随机规划的一种光滑逼近法

本文借助某种离散方式把单阶段随机规划问题转化为具有多个约束的确定性非线性规划，然后利用极大熵函数方法，把此确定性规划转化为只带简单约束的非线性规划，由此提出了求解这种随机规划的光滑逼近法，同时给出了该法的收敛性分析，较好地克服了因提高离散精度导致约束函数个数迅速增大所带来的求解困难．     

Inverse Coefficient Problems for Elliptic Hemivariational Inequalities

This paper is devoted to a class of inverse coefficient problems for nonlinear elliptic hemivariational inequalities. The unknown coefficient of elliptic hemivariational inequalities depends on the gradient of the solution and belongs to a set of admissible coefficients. It is shown that the nonlinear elliptic hemivariational inequalities are uniquely solvable for the given class of coefficients. The result of existence of quasisolutions of the inverse problems is obtained.     

Optical Properties of a New Two-photon Absorption Dye DEASPI

The two-photon absorption (TPA), TPA-induced frequency up-conversion emission, and two-photon pumped (TPP) frequency up-conversion lasing properties of a new synthesized dye Trans-4-［p-(N,N-diethylamino)styryl］-N-methylpyridinium iodide (DEASPI) were experimentally studied. This new dye has a moderate TPA cross-section of σ2=6.9×10-48 cm4*s/photon at 1064 nm, but exhibits a high lasing efficiency. The overall superradiant lasing conversion efficiency is as high as 10.7% at the pump energy of 2.14 mJ.     

Timetabling for Greek high schools

The timetabling process and the resulting weekly schedules are important components for the daily operation of any school. This paper presents an efficient solution to the timetabling problem for the secondary educational system in Greece. Such a problem involves scheduling a large number of classes, teachers, courses, and classrooms to a number of time-periods. The development of the basic structure and the modelling of the problem as an integer mathematical program allows for the generation of constraints necessary for the satisfaction of all the school system rules and regulations. The integer programming approach and the commercial tools available for this class of problems facilitated the process of locating the optimal solution for the problem. The model is flexible and modular allowing for adaptations to satisfy the local characteristics of each school by changing the parameters of the model and adding or replacing constraints. A fully defined timetabling problem for a typical Greek high school is presented and optimally solved in order to demonstrate the effectiveness of the model in satisfying both the hard and the soft operational rules of the problem. Implementation of the new methodology for regular use for high schools is currently being attempted.     

A Cutting Planes Algorithm for the <Emphasis Type="Italic">m</Emphasis>-Salesmen Problem

The existence of reliable and flexible FORTRAN programs for integer linear programming has recently enabled the development of very efficient algorithms for the travelling salesman problem. The main characteristic of these algorithms is the relaxation of most of the constraints of the problem during its solution. The same approach can be used for the solution of the m-salesmen problem in which m salesmen starting from the same city must visit only once n cities at minimum cost. The number of salesmen can be fixed in advance or allowed to vary, upper and lower bounds set on the number of salesmen and even fixed costs associated with the salesmen. The results obtained so far are very encouraging. Problems of up to 100 cities have been solved optimally for the m-travelling salesmen case and other more complex problems are currently under study.     

Parametric Integer Programming Analysis: A Contraction Approach

An algorithm is presented for solving families of integer linear programming problems in which the problems are "related" by having identical objective coefficients and constraint matrix coefficients. The righthand-side constants have the form b + θd where b and d are conformable vectors and θ varies from zero to one.The approach consists primarily of solving the most relaxed problem (θ = 1) using cutting planes and then contracting the region of feasible integer solutions in such a manner that the current optimal integer solution is eliminated.The algorithm was applied to 1800 integer linear programming problems with reasonable success. Integer programming problems which have proved to be unsolvable using cutting planes have been solved by expanding the region of feasible integer solutions (θ = 1) and then contracting to the original region.     

KT-5C托卡马克上不同限制器偏压下等离子体p约束改善的实验研究

在KT-5C托卡马克上,采用多块组合的可偏压限制器控制等离子体边缘电场.进行了改善等离子体的边缘参数及其机制的研究.实验显示,限制器的正、负偏压都能改变等离子体电位,但正偏压更有效,能有效地建立边缘电场,进而抑制边缘扰动改善等离子体约束.利用可移动静电探针,测得正偏压期间边缘电子温度T_e(r)、电子密度n_e(r)、空间电位V_p(r)分布变陡,与计算得到的边缘粒子通量Г(a_(?))减少,整体粒子约束时间τ_p增加结果是一致的.     

Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points

The problem of scheduling delivery vehicles from a number of depots to customers, subject to constraints on load and distance or time, is considered. A new algorithm is presented; this allows routes from several depots to be constructed simultaneously, subject to restrictions on numbers of vehicles at individual depots. Where too many customers require service, a flexible priority rule will select those to be served. Results for the single depot case are compared with other known algorithms; further results are given and discussed for cases of several depots.     

Synthesizing 0.9PZN–0.1BT by mechanically activating mixed oxides

0.9Pb(Zn_1/3Nb_2/3)–0.1BaTiO₃ (0.9PZN–0.1BT) of perovskite structure has been successfully prepared by mechanically activating mixed oxides of PbO, ZnO, Nb₂O₅, BaO and TiO₂. The novel mechanochemical technique skips the phase-forming calcination step at an intermediate temperature that is always required in both the conventional solid state reaction and chemistry-based precursor routes. Ultrafine 0.9PZN–0.1BT particles of perovskite structure were formed when the constituent oxides were mechanically activated for more than 10 h. The powder was sintered to a density of 96% theoretical density at 1100°C for 1 h. The sintered 0.9PZN–0.1BT exhibits perovskite structure and a peak dielectric constant of 8800 at the Curie temperature of 60°C when measured at a frequency of 100 Hz.     

Sui fasci di cubiche a modulo costante

An improvement of the uniqueness theorem of Wintner for the differential equationx ⁽ⁿ⁾(t)=f(t, x) is given.