虚拟系统使用经验中的创新发明

根据多年使用各类虚拟系统的经验,通过对不同品牌摄像机、云台、传感跟踪装置等虚拟系统配套设备的研究,自主研发了通过摄像机光缆传输虚拟系统传感跟踪数据的设备,创新集成化虚拟系统的数据传输,简化了虚拟系统搭建流程,提高了系统稳定性.     

基于UCL的互补结构实验网络设计

根据互联网的无尺度现象和语义互联网的困惑,提出了互补结构网络的设计方案,定义了次结构网络的传输协议分层模型,描述了次结构网络发送端和接收端软件的设计与实现,并对实验网络性能进行了测试和结果分析.     

Channel-Supermodular Entropies: Order Theory and an Application to Query Anonymization

This work introduces channel-supermodular entropies, a subset of quasi-concave entropies. Channel-supermodularity is a property shared by some of the most commonly used entropies in the literature, including Arimoto–Rényi conditional entropies (which include Shannon and min-entropy as special cases), k-tries entropies, and guessing entropy. Based on channel-supermodularity, new preorders for channels that strictly include degradedness and inclusion (or Shannon ordering) are defined, and these preorders are shown to provide a sufficient condition for the more-capable and capacity ordering, not only for Shannon entropy but also regarding analogous concepts for other entropy measures. The theory developed is then applied in the context of query anonymization. We introduce a greedy algorithm based on channel-supermodularity for query anonymization and prove its optimality, in terms of information leakage, for all symmetric channel-supermodular entropies.     

Set to set broadcasting in communication networks

Suppose G = (V,E) is a graph whose vertices represent people and edges represent telephone lines between pairs of people. Each person knows a unique message and is ignorant of the messages of other people at the beginning. These messages are then spread by telephone calls. In each call, two people exchange all information they have so far in exactly one unit of time. Suppose A and B are two nonempty subsets of V. The main purpose of this paper is to study the minimum number b(A,B,G) of telephone calls by which A broadcasts to B; and the minimum time t(A,B,G) such that A broadcasts to B. In particular, we give an exact formula for b(A,B,K_n) and linear-time algorithms for computing b(A,B,T) and t(A,B,T) of a tree T.     

A photonic wire-based directional coupler based on SOI

A photonic wire-based directional coupler based on SOI was fabricated by e-beam lithography (EBL) and the inductively coupled plasma (ICP) etching method. The size of the sub-micron waveguide is 0.34 μm × 0.34 μm, and the length in the coupling region and the separation between the two parallel waveguides are 410 and 0.8 μm, respectively. The measurement results are in good agreement with the results simulated by 3D finite-difference time-domain method. The transmission power from two output ports changed reciprocally with about 23 nm wavelength spacing between the coupled and direct ports. The extinction ratio of the device was between 5 and 10 dB, and the insertion loss of the device in the wavelength range 1520-1610 nm was between 22 and 24 dB, which included an about 18.4 ± 0.4 dB coupling loss between the taper fibers and the polished sides of the device.     

Heuristics for the multi-depot petrol station replenishment problem with time windows

In the multi-depot petrol station replenishment problem with time windows (MPSRPTW), the delivery of petroleum products stored in a number of different petroleum depots to a set of petrol distribution stations has to be optimized. Each depot has its own fleet of heterogeneous and compartmented tank trucks. Stations specify their demand by indicating the minimum and maximum quantities to be delivered for each ordered product and require the delivery within a predetermined time window. Several inter-related decisions must be made simultaneously in order to solve the problem. For this problem, the set of feasible routes to deliver all the demands, the departure depot for each route, the quantities of each product to be delivered, the assignment of these routes to trucks, the time schedule for each trip, and the loading of the ordered products to different tanks of the trucks used need to be determined. In this paper, we propose a mathematical model that selects, among a set of feasible trips, the subset that allows the delivery of all the demands while maximizing the overall daily net revenue. If this model is provided with all possible feasible trips, it determines the optimal solution for the corresponding MPSRPTW. However, since the number of such trips is often huge, we developed a procedure to generate a restricted set of promising feasible trips. Using this restricted set, the model produces a good but not necessarily optimal solution. Thus the proposed solution process can be seen as a heuristic. We report the results of the extensive numerical tests carried out to assess the performance of the proposed heuristic. In addition, we show that, for the special case of only one depot, the proposed heuristic outperforms a previously published solution method.     

Network DEA approach to airports performance assessment considering undesirable outputs

In this paper, a directional distance approach is proposed to deal with network DEA problems in which the processes may generate not only desirable final outputs but also undesirable outputs. The proposed approach is applied to the problem of modelling and benchmarking airport operations. The corresponding network DEA model considers two process (Aircraft Movement and Aircraft Loading) with two final outputs (Annual Passenger Movement and Annual Cargo handled), one intermediate product (Aircraft Traffic Movements) and two undesirable outputs (Number of Delayed Flights and Accumulated Flight Delays). The proposed approach has been applied to Spanish airports data for year 2008 comparing the computed directional distance efficiency scores with those obtained using a conventional, single-process directional distance function approach. From this comparison, it can be concluded that the proposed network DEA approach has more discriminatory power than its single-process counterpart, uncovering more inefficiencies and providing more valid results.     

Lifetime maximization in wireless directional sensor network

This paper addresses two versions of a lifetime maximization problem for target coverage with wireless directional sensor networks. The sensors used in these networks have a maximum sensing range and a limited sensing angle. In the first problem version, predefined sensing directions are assumed to be given, whereas sensing directions can be freely devised in the second problem version. In that case, a polynomial-time algorithm is provided for building sensing directions that allow to maximize the network lifetime. A column generation algorithm is proposed for both problem versions, the subproblem being addressed with a hybrid approach based on a genetic algorithm, and an integer linear programming formulation. Numerical results show that addressing the second problem version allows for significant improvements in terms of network lifetime while the computational effort is comparable for both problem versions.     

Analysis,modeling and solution of the concrete delivery problem

This paper describes a specific local search approach to solve a problem arising in logistics which we prove to be NP-hard. The problem is a complex scheduling or vehicle routing problem where we have to schedule the tours of concrete mixer vehicles over a working day from concrete-producing depots to concrete-demanding customers and vice versa. We give a general mixed integer programming model which is too hard to solve for state of the art mixed integer programming optimizers in the case of the usually huge problem instances coming from practice. Therefore we present a certain local search approach to be able to handle huge practical problem instances.