Embedded dots inside glass for optical film using UV laser of ultrafast laser pulse

Microstructures are usually fabricated on the surface of optical sheets to improve the optical characteristics. In this study, a new fabrication process with UV (ultraviolet) laser direct writing method is developed to embed microstructures inside the glass. Then the optical properties of glass such as reflection and refraction indexes can be modified. Single- and multi-layer microstructures are designed and embedded inside glass substrate to modify the optical characteristics. Both luminance and uniformity can be controlled with the embedded microstructures. Thus, the glass with inside pattern can be used as a light guide plate to increase optical performance. First, an optical commercial software, FRED, is applied to design the microstructure configuration. Then, UV laser direct writing with output power 2.5-2.6 W, repetition rate 30 kHz, wave length: 355 nm, and pulse duration 15 ns is used to fabricate the microstructures inside the glass. The effect of dot pattern in the glass such as the dot pitch, the layer gap, and the number of layer on the optical performance is discussed. Machining capacity of UV laser ranges from micron to submicrometer; hence with this ultrafast laser pulse, objectives of various dimensions such as dot, line width, and layers can be easily embedded in the glass by one simple process. In addition, the embedded microstructures can be made with less contamination. Finally, the optical performance of the glasses with various configurations is measured using a Spectra Colorometer (Photo Research PR650) and compared with the simulated results.     

Simulated annealing and tabu search approaches for the Corridor Allocation Problem

In the Corridor Allocation Problem, we are given n facilities to be arranged along a corridor. The arrangements on either side of the corridor should start from a common point on the left end of the corridor. In addition, no space is allowed between two adjacent facilities. The problem is motivated by applications such as the arrangement of rooms in office buildings, hospitals, shopping centers or schools. Tabu search and simulated annealing algorithms are presented to minimize the sum of weighted distances between every pair of facilities. The algorithms are evaluated on several instances of different sizes either randomly generated or available in the literature. Both algorithms reached the optimal (when available) or best-known solutions of the instances with n ? 30. For larger instances with size 42 ? n ? 70, the simulated annealing implementation obtained smaller objective values, while requiring a smaller number of function evaluations.     

非对称需求扰动信息下的供应链显示机制设计

研究由一个供应商和一个零售商组成的供应链在非对称的需求扰动信息下的显示机制设计问题。假定市场需求为指数函数形式和常数柔性需求函数形式,给出了非对称的需求扰动信息下的供应链最优契约,并且分析了非对称扰动信息对于供应链性能的影响。研究表明,当市场需求为指数函数形式和常数柔性函数形式时,仍然可以设计有效的契约菜单来改善供应链的运作性能;当需求扰动满足一定条件时,初始的生产计划仍然是最优的;非对称需求扰动信息并不必然会给供应链带来利润损失,并且显式地给出了非对称的需求扰动信息不会给供应链带来利润损失的条件。     

嫦娥三号软着陆轨道设计与控制策略的优化模型

针对嫦娥三号软着陆轨道设计与控制策略问题,在合理假设的前提下,建立动力学模型,求解得到了嫦娥三号着陆准备轨道近月点和远月点的速度。针对软着陆过程的6个阶段,通过受力分析,建立了嫦娥三号运动的微分方程模型,以燃料消耗最小为优化目标,以每个阶段的起止状态为约束条件,将软着陆轨道的优化设计问题转化为主发动机推力的泛函极值问题,并将其控制函数转化为近似的多项式函数优化问题。运用四阶Runge-Kutta差分迭代方法进行求解计算,从而得到各个阶段的最优控制函数和控制策略。结果表明,嫦娥三号软着陆过程耗时695s,消耗燃料1 269.1kg。     

Optimizing cost flows by edge cost and capacity upgrade

We examine a network upgrade problem for cost flows. A budget can be distributed among the arcs of the network. An investment on each single arc can be used either to decrease the arc flow cost, or to increase the arc capacity, or both. The goal is to maximize the flow through the network while not exceeding bounds on the budget and on the total flow cost.

The problems are NP-hard even on series-parallel graphs. We provide an approximation algorithm on series-parallel graphs which, for arbitrary δ,>0, produces a solution which exceeds the bounds on the budget and the flow cost by factors of at most 1+δ and 1+, respectively, while the amount of flow is at least that of an optimum solution. The running time of the algorithm is polynomial in the input size and 1/(δ). In addition we give an approximation algorithm on general graphs applicable to problem instances with small arc capacities.     

The non-approximability of bicriteria network design problems

Let G be an undirected graph with two edge costs (c-cost and d-cost). We want to minimize the diameter of a spanning subgraph S (under d-cost) subject to the constraint that the total cost of the edges in S (with respect to c) does not exceed a given budget. We prove that this problem is non-approximable, even in some special cases. Similar results are proved if the stretch factor or the root stretch factor is considered instead of the diameter.     

A bound for Wilson''''s general theorem

Given any set K of positive integers and positive integer λ, let c(K,λ) denote the smallest integer such that v∈B(K,λ) for every integer v≥c(K,λ) that satisfies the congruences λv(v-1)≡0 (mod β(K) and λ(v-1)≡0 (mod α(K)). Let K0 be an equivalent set of K, k and k* be the smallest and the largest integers in K0. We prove that c(K,λ)≤exp exp{Q0}Qo=max{2(2p(ko)2-k2kk)p(ko)4,(Kk242y-k-2)(y2)}, whereand y=k*+k(k-1)+1.     

A semidefinite programming approach to the hypergraph minimum bisection problem

The hypergraph minimum bisection (HMB) problem is the problem of partitioning the vertices of a hypergraph into two sets of equal size so that the total weight of hyperedges crossing the sets is minimized. HMB is an NP-hard problem that arises in numerous applications – for example, in digital circuit design. Although many heuristics have been proposed for HMB, there has been no known mathematical program that is equivalent to HMB. As a means of shedding light on HMB, we study the equivalent, complement problem of HMB (called CHMB), which attempts to maximize the total weight of non-crossing hyperedges. We formulate CHMB as a quadratically constrained quadratic program, considering its semidefinite programming relaxation and providing computational results on digital circuit partitioning benchmark problems. We also provide results towards an approximation guarantee for CHMB.     

An Ant Colony Optimisation algorithm for solving the asymmetric traffic assignment problem

In this paper we propose an Ant Colony Optimisation (ACO) algorithm for defining the signal settings on urban networks following a local approach. This consists in optimising the signal settings of each intersection of an urban network as a function only of traffic flows at the accesses to the same intersection, taking account of the effects of signal settings on costs and on user route choices. This problem, also known as Local Optimisation of Signal Settings (LOSS), has been widely studied in the literature and can be formulated as an asymmetric assignment problem. The proposed ACO algorithm is based on two kinds of behaviour of artificial ants which allow the LOSS problem to be solved: traditional behaviour based on the response to pheromones for simulating user route choice, and innovative behaviour based on the pressure of an ant stream for solving the signal setting definition problem. Our results on real-scale networks show that the proposed approach allows the solution to be obtained in less time but with the same accuracy as in traditional MSA (Method of Successive Averages) approaches.     

Necessary and sufficient conditions in the problem of D-optimal weighing designs with autocorrelated errors

Necessary and sufficient conditions determining D-optimality of chemical balance weighing design with three objects are proved under first-order autoregressive errors with negative autocorrelation. D-optimality of the design constructed by Li and Yang (2005) is also shown.