On the Use of a Mixed Integer Non-linear Programming Model for Refrigerant Design

In this paper, a novel mixed integer non-linear programming model for single component refrigerant design is presented. At the heart of the approach is a new formulation for structural feasibility that allows multiple bonds, connectivity and isomers. The strategy defines a set of structural groups (consisting of atoms), subsets of which are combined to form refrigerant molecules. Molecules formed this way must obey structural and stability constraints. The design objective is to build a refrigerant molecule that has desired physical properties and performance characteristics. These attributes are formulated as mathematical programming constraints and performance objectives which involve both continuous and integer variables. With the current renewed interest in the environment, the suggested approach is applied to refrigerant design with an environmental constraint. The results indicate the viability and the flexibility of the approach.     

Approximation Algorithms for a Capacitated Network Design Problem

We study a capacitated network design problem with applications in local access network design. Given a network, the problem is to route flow from several sources to a sink and to install capacity on the edges to support the flow at minimum cost. Capacity can be purchased only in multiples of a fixed quantity. All the flow from a source must be routed in a single path to the sink. This NP-hard problem generalizes the Steiner tree problem and also more effectively models the applications traditionally formulated as capacitated tree problems. We present an approximation algorithm with performance ratio (_ST + 2) where _ST is the performance ratio of any approximation algorithm for the minimum Steiner tree problem. When all sources have unit demand, the ratio improves to _ST + 1) and, in particular, to 2 when all nodes in the graph are sources.     

Large‐Scale Integer Linear Programming for Orientation Preserving 3D Shape Matching

We study an algorithmic framework for computing an elastic orientation‐preserving matching of non‐rigid 3D shapes. We outline an Integer Linear Programming formulation whose relaxed version can be minimized globally in polynomial time. Because of the high number of optimization variables, the key algorithmic challenge lies in efficiently solving the linear program. We present a performance analysis of several Linear Programming algorithms on our problem. Furthermore, we introduce a multiresolution strategy which allows the matching of higher resolution models.     

Approximation Algorithms for a Capacitated Network Design Problem

We study a capacitated network design problem with applications in local access network design. Given a network, the problem is to route flow from several sources to a sink and to install capacity on the edges to support the flow at minimum cost. Capacity can be purchased only in multiples of a fixed quantity. All the flow from a source must be routed in a single path to the sink. This NP-hard problem generalizes the Steiner tree problem and also more effectively models the applications traditionally formulated as capacitated tree problems. We present an approximation algorithm with performance ratio (ρ_ST + 2) where ρ_ST is the performance ratio of any approximation algorithm for the minimum Steiner tree problem. When all sources have unit demand, the ratio improves to ρ_ST + 1) and, in particular, to 2 when all nodes in the graph are sources.     

通用网络编程接口包的设计和实现

网络计算环境中,网络编程接口的多样性给开发网络应用程序带来了很大的不便.本文给出了一个通用的、可扩充的网络编程接口包UniChannels的设计与实现.UniChannels提供了通用的网络编程接口,并且通过使用一种新的设计模式即“地址绑定“模式,将协议相关操作和一般性的通信过程分离,从而使UniChannels具有良好的协议透明性.目前,UniChannels已应用到包括消息队列中间件在内的多个网络应用程序中.     

Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models

In this paper, we design and implement a variety of parallel algorithms for both sweep spin selection and random spin selection. We analyze our parallel algorithms on LogP, a portable and general parallel machine model. We then obtain rigorous theoretical runtime results on LogP for all the parallel algorithms. Moreover, a guiding equation is derived for choosing data layouts (blocked vs. stripped) for sweep spin selection. In regard to random spin selection, we are able to develop parallel algorithms with efficient communication schemes. We introduce two novel schemes, namely the FML scheme and the α-scheme. We analyze randomness of our schemes using statistical methods and provide comparisons between the different schemes.     

计算机网络课程原始套接字编程实验的实践探索

简述计算机网络课程及实验体系的发展状况,指出原有实验模式的不足,改革实验体系并新增了部分原始套接字实验模块,以网络嗅探程序设计为例给出原始套接字程序设计实验的目的、要求和实现方法,分析总结了原始套接字实验的特色和优势。     

Programming models and systems for Big Data analysis

ABSTRACT

Big Data analysis refers to advanced and efficient data mining and machine learning techniques applied to large amount of data. Research work and results in the area of Big Data analysis are continuously rising, and more and more new and efficient architectures, programming models, systems, and data mining algorithms are proposed. Taking into account the most popular programming models for Big Data analysis (MapReduce, Directed Acyclic Graph, Message Passing, Bulk Synchronous Parallel, Workflow and SQL-like), we analysed the features of the main systems implementing them. Such systems are compared using four classification criteria (i.e. level of abstraction, type of parallelism, infrastructure scale and classes of applications) for helping developers and users to identify and select the best solution according to their skills, hardware availability, productivity and application needs.     

关于计算机网络综合布线系统设计分析

结合实际工作经验,从计算机网络综合布线系统发展的历程和优势出发,并就其相关的设计标准、设计方案等实际应用进行了分析与探讨.     

广播电台企业信息化的规划与设计

企业信息化思想引入广播电台给企业带来了新的机遇,本文分析了企业信息化的基本内容,对广播电台的主要业务进行了分析,在此基础上设计了广播电台企业信息化的系统层次结构和软件结构,对于广播电台的信息化建设具有较强的指导意义.     

Using discrete models with continuous design packages

An algorithm is derived for converting a discrete state-space model to an equivalent continuous form. Both approximate and exact solutions are presented. A new discrete model is also derived, for which the continuous design will be valid. The principles are illustrated using an example of optimal control, and the discrete and continuous designs are compared. These techniques have particular relevance for computer aided design of feedback control systems.     

广播电台企业信息化的规划与设计

企业信息化思想引入广播电台给企业带来了新的机遇,本文分析了企业信息化的基本内容,对广播电台的主要业务进行了分析,在此基础上设计了广播电台企业信息化的系统层次结构和软件结构,对于广播电台的信息化建设具有较强的指导意义。     

Information structuring for use and reuse of mechanical analysis models in engineering design

Nowadays, in an industrial context, cost and delay reduction, as well as quality improvement are of major interest in engineering design. Therefore, in order to make a decision as early as possible and according to the product specifications, mechanical analysis is used more and more, and earlier and earlier in the engineering process. Then, a multitude of mechanical models are elaborated during engineering design, and management difficulties appear with engineering changes or evolution of specifications. Moreover, when the designer is faced with design or modelling options, previous analysis could answer the choice of options for decision making. Then, the reuse of a previous analysis must be envisaged. The paper presented deals with the aim and the different use of mechanical analysis in embodiment design. Afterwards, different levels of models handled by the designer during the engineering process are proposed. A particular type of analysis, namely instructional' is identif ied in a further step and its interest in a reuse context is emphasized. Finally, information structuring is proposed in order to allow mechanical analysis reuse during engineering design.     

Planning Models for Wide-Area Communication Network Design with Response-Time-Dependent Offered Traffic

We address an important planning problem occurring in the design of wide-area networks. Specifically, given a proposed or existing network topology and capacities, we determine how much potential traffic can be accommodated. We present models which recognize that some but not all users will tolerate delays. To do this, we develop routing models for different situations with response-time-dependent offered traffic. Since different user applications have different delay tolerances, the proposed link capacities may be insufficient for some users. This problem is especially important in internetworking, because the LANs modeled as nodes often contain many different types of users. In these problems, it may be too expensive to design capacity sufficient to ensure the instantaneous transmissions that only a few users need. Computational results show that the proposed models can be solved efficiently.     

水泥企业控制和管理系统的网络化设计

论述在某一水泥企业的控制和管理系统的网络化工程设计中,立足长远规划,充分考虑到控制系统和管理系统结合问题,分期将该企业的控制和管理系统改造为集菜式控制与网络管理相结合的综合系统。     

A Model for the Flow of Design Information in Product Development

The complexity of modern products and design tools has made the exchange of design information more complex. It is widely recognised that the seamless capture, storage, and retrieval of design information is one of the major challenges for the next generation of computer aided design tools. This paper presents a model for the flow of design information that is sufficiently formal to eventually support a semantics-based approach for developing information exchange standards. The model classifies design information into various types, organises these types into information states and levels of abstraction, and identifies the various transformations that operate within and between the information states. The model’s ability to support a variety of design process models is illustrated by applying it to the Systems Integration of Manufacturing Applications (SIMA) design process model, and the model is then applied to a design example.     

基于SOAD的网络化服务系统建模和设计

分析了面向服务的分析与设计（SOAD）方法，结合SOAD的服务定义层次和混和式建模方法提出了SOAD新的组合模式，采用中间相遇的建模步骤来建立系统模型。并将该方法应用在某企业ASP网络化服务系统的设计和开发过程中，该方法的可行性在典型应用中得到了验证。     

Subdivision models for varying-resolution and generalized perturbations

Subdivision schemes are multi-resolution methods used in computer-aided geometric design to generate smooth curves or surfaces. In this paper, we are interested in both smooth and non-smooth subdivision schemes. We propose two models that generalize the subdivision operation and can yield both smooth and non-smooth schemes in a controllable way:

• (1) The ‘varying-resolution’ model allows a structured access to the various resolutions of the refined data, yielding certain patterns. This model generalizes the standard subdivision iterative operation and has interesting interpretations in the geometrical space and also in creativity-oriented domains, such as music. As an infrastructure for this model, we propose representing a subdivision scheme by two dual rules trees. The dual tree is a permuted rules tree that gives a new operator-oriented view on the subdivision process, from which we derive an ‘adjoint scheme’.

• (2) The ‘generalized perturbed schemes’ model can be viewed as a special multi-resolution representation that allows a more flexible control on adding the details. For this model, we define the terms ‘template mask’ and ‘tension vector parameter’.

The non-smooth schemes are created by the permutations of the ‘varying-resolution’ model or by certain choices of the ‘generalized perturbed schemes’ model. We then present procedures that integrate and demonstrate these models and some enhancements that bear a special meaning in creative contexts, such as music, imaging and texture. We describe two new applications for our models: (a) data and music analysis and synthesis, which also manifests the usefulness of the non-smooth schemes and the approximations proposed, and (b) the acceleration of convergence and smoothness analysis, using the ‘dual rules tree’.     

Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations,Comparisons and Extensions

In this paper we formulate a network design model in which the traffic flows satisfy dynamic user equilibrium conditions for a single destination. The model presented here incorporates the Cell Transmission Model (CTM); a traffic flow model capable of capturing shockwaves and link spillovers. Comparisons are made between the properties of the Dynamic User equilibrium Network Design Problem (DUE NDP) and an existing Dynamic System Optimal (DSO) NDP formulation. Both network design models have different objective functions with similar constraint sets which are linear and convex. Numerical demonstrations are made on multiple networks to demonstrate the efficacy of the model and demonstrate important differences between the DUE and DSO NDP approaches. In addition, the flexibility of the approach is demonstrated by extending the formulation to account for demand uncertainty. This is formulated as a stochastic programming problem and initial test results are demonstrated on test networks. It is observed that not accounting for demand uncertainty explicitly, provides sub-optimal solution to the DUE NDP problem.     

基于距离和密度聚类的RBF网络结构设计

为确定径向基函数RBF(radial basis function)神经网络隐含层结构,并针对基于距离或密度聚类的RBF神经网络的限制,提出一种基于距离和密度聚类(GDD)算法的RBF神经网络.GDD算法通过计算每个样本的密度,各样本间的距离及相似条件(密度标准、距离标准),相似条件是根据样本分布而改变的,进行样本空间...