Spherical Particles of Zirconia-Titania of Hexagonal Structure from a Neutral Amine Route

Through the sol–gel process, using the so-called neutral amine route, spherical particles of 1:1 zirconia–titania were synthesized from zirconium(IV) and titanium(IV) butoxides as well as 1,12-diaminododecane as precursor species. The obtained product exhibited a hexagonal structure, as determinated by X-ray diffraction data. The obtained material was also characterized by thermogravimetry, differential scanning calorimetry, infrared spectroscopy, scanning electron microscopy, and surface area measurements. Despite the release of template molecules on heating, the spherical morphology was retained up to about 1200°C, at which the disruption of the spheres took place.     

基于剪枝策略的改进TDCALT算法

针对大规模路网中求解最短路问题的低效性与非实时性,通过时间依赖性路网来刻画路网和交通状况信息,构造时间依赖性路网下的高效最短路算法.以目前效率较高的TDCALT(time dependent core-based A*landmarks triangleinequality)算法为基础,提出动态优化上限值的改进措施,并首次引入和改进静态路网下最短路算法中的剪枝策略,形成ITDCALT(improved TDCALT)算法.在广州市路网上的试验表明:ITDCALT算法在算法运行时间和搜索空间上均优于TDCALT算法和TDIJKSTRA(time-dependent DIJKSTRA)算法;ITDCALT算法具有计算效率高、搜索空间小、性能稳定的优点.     

溶剂热还原法制备蛋壳状碳材料

Eggshell-like carbon materials with high yields have been synthesized by a solvothermal route in a stainless steel autoclave using metallic zinc and absolute ethanol as starting materials. The products were characterized by X-ray powder diffractometry (XRD)， energy-dispersive X-ray spectroscopy (EDX)， Raman spectroscopy and scanning electron microscopy (SEM). The eggshell-like carbon spheres had diameters ranging from 500 nm to 1 μm. The optimal reaction conditions to obtain eggshell-like carbon materials were 600 ℃ and 12 h.     

An improved and practical route for the synthesis of enzalutamide and potential impurities study

An improved and practical synthesis of enzalutamide was accomplished in five steps. Starting from 4-bromo-2-fluoro-benzonic acid, a methyl esterification, Ullmann ligation, methyl esterification, ring closing reaction and final methyl amidation provided the target in 35% total yield with 99.8% purity. Five identified impurities were also synthesized. This efficient and economical procedure avoids the use of highly toxic reagents and multiple recrystallization operations, which is suitable for further industrialization.     

Kinetics and mechanism of reaction of cis-α,β-dinitrostilbene with morpholine

Reaction of cis-,-dinitrostilbene (substrate) with morpholine (reagent) in n-hexane leads to cis--nitro--morpholinostilbene (end product). The process is of first order with respect to the substrate and second order with respect to the reagent. Possible reaction mechanisms are analyzed, and it is established that the following are most probable on the basis of kinetic patterns and stereochemistry: development of a charge transfer complex having a hydrogen bond between the substrate nitro group and reagent amino group; reaction of the complex with a second reagent molecule and formation of a carbanion (this stage determines the overall reaction rate); and detachment of a nitrite ion from the nitrocarbanion and its protonation to form the end product.N. N. Semenov Institute of Chemical Physics, Russian Academy of Sciences, 117977 Moscow. A. N. Nesmeyanov Institute of Heteroorganic Compound, Russian Academy of Sciences, 117813 Moscow. Translated from Izvestiya Akademii Nauk, Seriya Khimicheskaya, No. 1, pp. 78–83, January, 1992.     

An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles

The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the workday due to strict time limits on route duration (e.g., when perishable goods are transported). The routes are defined over customers with a revenue, a demand and a time window. Given a fixed-size fleet of vehicles, it might not be possible to serve all customers. Thus, the customers must be chosen based on their associated revenue minus the traveling cost to reach them. We introduce a branch-and-price approach to address this problem where lower bounds are computed by solving the linear programming relaxation of a set packing formulation, using column generation. The pricing subproblems are elementary shortest path problems with resource constraints. Computational results are reported on euclidean problems derived from well-known benchmark instances for the vehicle routing problem with time windows.     

基于模拟扩散的最短路径新算法

基于模拟水流扩散的自然现象,提出了一种寻求最优路径的新算法,介绍了该算法原理和具体计算过程,验证了该算法的正确性和合理性.     

Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding

We present an efficient algorithm for finding the shortest path joining two points in a sequence of triangles in three-dimensional space using the concept of funnels associated with common edges along the sequence of triangles and the planar unfolding for each funnel. We show that the unfolded image of a funnel is a simple polygon, it thus is non-overlapping. Therefore, such funnels are determined iteratively to their associated common edges by the planar unfolding and the shortest path joining two points is determined by cusps of these funnels.     

Dynamic routing in open queueing networks: Brownian models,cut constraints and resource pooling

We present an introductory review of recent work on the control of open queueing networks. We assume that customers of different types arrive at a network and pass through the system via one of several possible routes; the set of routes available to a customer depends on its type. A route through the network is an ordered set of service stations: a customer queues for service at each station on its route and then leaves the system. The two methods of control we consider are the routing of customers through the network, and the sequencing of service at the stations, and our aim is to minimize the number of customers in the system. We concentrate especially on the insights which can be obtained from heavy traffic analysis, and in particular from Harrison's Brownian network models. Our main conclusion is that in many respects dynamic routingsimplifies the behaviour of networks, and that under good control policies it may well be possible to model the aggregate behaviour of a network quite straightforwardly.Supported by SERC grant GR/F 94194.     

Soft Constraint Logic Programming and Generalized Shortest Path Problems

In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this large class of SP problems with a high-level and declarative linguistic support whose semantics takes care of both finding the cost of the shortest path(s) and also of actually finding the path(s). On the other hand, some efficient algorithms for certain classes of SP problems can be exploited to provide some classes of SCLP programs with an efficient way to compute their semantics.