The robust knapsack problem with queries

We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse.     

A model for semiconductor quantum dot molecule based on the current spin density functional theory

Based on the current spin density functional theory, a theoretical model of three vertically aligned semiconductor quantum dots is proposed and numerically studied. This quantum dot molecule (QDM) model is treated with realistic hard-wall confinement potential and external magnetic field in three-dimensional setting. Using the effective-mass approximation with band nonparabolicity, the many-body Hamiltonian results in a cubic eigenvalue problem from a finite difference discretization. A self-consistent algorithm for solving the Schrödinger-Poisson system by using the Jacobi-Davidson method and GMRES is given to illustrate the Kohn-Sham orbitals and energies of six electrons in the molecule with some magnetic fields. It is shown that the six electrons residing in the central dot at zero magnetic field can be changed to such that each dot contains two electrons with some feasible magnetic field. The Förster-Dexter resonant energy transfer may therefore be generated by two individual QDMs. This may motivate a new paradigm of Fermionic qubits for quantum computing in solid-state systems.     

空气钻井技术在普光气田的应用

普光气田是四川盆地已发现的最大天然气田。普光气田已钻井实践表明,常规钻井液钻井技术机械钻速低,钻井周期长,钻井复杂及事故多,无法满足普光气田开发要求。为了提高钻井速度,缩短钻井周期,加快普光气田的开发进程,在PD-1井、P2-2井、PA-2井、P4-2井、P6-3井等5口井进行了空气钻井试验。文中分析了普光气田进行空气钻井的可行性,介绍了空气钻井技术在普光气田的实践情况,并对空气钻井的效果进行了评价,分析了空气钻井技术在普光气田进一步应用需要重视和解决的问题,并提出了今后的研究方向。     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

STATIONARY TANGENT: THE DISCRETE AND NON-SMOOTH CASE

Abstract. In Keich (2000 ),we define a stationary tangent process, or a locally optimal stationary approximation, to a real non-stationary smooth Gaussian process. This paper extends the idea by constructing a discrete tangent – a `locally' optimal stationary approximation – for a discrete time, real Gaussian process. Analogously to the smooth case, our construction relies on a generalization of the recursion formula for the orthogonal polynomials of the spectral distribution function. More precisely, we use a generalization of the Schur parameters to identify the stationary tangent. By way of discretizing, we later demonstrate how this tangent can be used to obtain `good' local stationary approximations to non-smooth continuous time, real Gaussian processes. Further, we demonstrate how, analogously to the curvatures in the smooth case, the Schur parameters can be used to determine the order of stationarity of a non-smooth process.     

交通平衡分配下的公路桥收费策略

假定一个城市被一条河流分为两部分（如我国的武汉，重庆等市），河上至少架设了两座公路桥梁，本文研究在交通平衡状态下，怎样制定车辆过桥梁的收费水平，使获得的总收入最大，乘客的总行驶时间最少，对多车种问题，研究了等价的数学模型和算法。还对一个含两座桥梁与三种车型的简单算例，进行了计算与分析。     

Optimal H∞ general distance problem with degree constraint

In this paper the optimal H_∞, general distance problem, for continuous-time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one-block and the four-block problems. A special case is given for illustration.     

二维多孔数控钻床加工路径的生成及优化

印刷电路板 PCB的加工是二维多孔数控钻的典型。实践表明加工同一零件不同的走刀路径其长度相差极大。为提高生产率 ,应使刀具的走刀路径尽量短 ,这其实是大型的 TSP问题。本文提出了几种路径的生成方法 ,分析了各自的适用场合。并用实例验证所提出的路径生成方法可极大地提高实际钻孔的加工效率。     

一种新的加权最小二乘测距定位方法

三站二维定位问题是最小定位问题，一般只利用几何关系就能获得定位估计，但由于未利用距离测量的统计信息，定位精度较差。该文先将点到点的距离测量转化为点到线的距离估计，再在此基础上推导出一种新的加权几休定位方法，其中加权的确定利用了距离测量的统计信息。仿真实验表明，在测距误差较小时新方法具有更高的定位精度。     

Modeling of Energy Density Distribution in Rock Mass on the Basis of Seismotectonic and Geodetic Data

Using the focal mechanisms of earthquakes taken place from 1950 to 1996, the type and direction of principal strains were established, which made it possible to determine the volume stress-strain state of the south-east flank of the Baikal rift zone on the basis of the inverse problem solution. The variations in the stress-strain fields and spatial distribution of the stored potential energy density were found by the displacements of the daylight surface points in Tunkinsk geodetic proving ground in 1975 - 1986.