江苏广电网站IDC双线路网络方案浅析

新落成的江苏广电城将即将投入使用,江苏广电网站搬入大楼全新的IDC机房。与广播、电视并列为江苏广电总台三大宣传阵地的广电网站由于受困于中国南北方网络瓶颈的限制,经常造成网络视音频节目传播不畅,所以同时接入电信和网通成为解决问题的必要手段。此文首先对IDC双线路关键技术进行了概述,然后着重介绍了根据防火墙接口地址制定策略路由、实现双线路的方法。     

Effective on-line algorithms for reliable due date quotation and large-scale scheduling

We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job’s arrival time, a due date must be quoted for the job, and the job must complete processing before its quoted due date. The objective is to minimize the sum (or average) of quoted due dates, or equivalently, the average quoted lead time. In this paper, we propose on-line heuristics for this problem and characterize the conditions under which these heuristics are asymptotically optimal. Computational testing further demonstrates the relative effectiveness of these heuristics under various conditions. Both authors made equal contributions to this paper and are listed in alphabetical order.     

Towards the next generation of artificial neural networks for civil engineering

The purpose of this paper is to stimulate interest within the civil engineering research community for developing the next generation of applied artificial neural networks. In particular, it identifies what the next generation of these devices needs to achieve, and provides direction in terms of how their development may proceed. An analysis of the current situation indicates that progress in the development of artificial neural network applications has largely stagnated. Suggestions are made for advancing the field to the next level of sophistication and application, using genetic algorithms and related techniques. It is shown that this approach will require the design of some very sophisticated genetic coding mechanisms in order to develop the required higher-order network structures, and will utilize development mechanisms observed in nature such as growth, self-organization, and multi-stage objective functions. The capabilities of such an approach and the way in which they can be achieved are explored with reference to the problems of: (a) determining truck attributes from the strain envelopes they induce in structural members when crossing a bridge, and; (b) developing a decision support system for dynamic control of industrialized manufacturing of houses.     

The Other Mathematical Bridge

This paper contextualises, describes and discusses a student project which takes a particular exploratory approach to using mathematical surface definition as a language and vehicle for co-rational design co-authorship for architecture and engineering. The project has two authors, one from an architectural and one from an engineering educational background. It investigates the metaphorical and operational role of mathematics in the design process and outcomes.     

A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems

This paper is a review of the approachesdeveloped to solve 2D packing problems withmeta-heuristic algorithms. As packing tasks arecombinatorial problems with very large searchspaces, the recent literature encourages theuse of meta-heuristic search methods, inparticular genetic algorithms. The objective ofthis paper is to present and categorise thesolution approaches in the literature for 2Dregular and irregular strip packing problems.The focus is hereby on the analysis of themethods involving genetic algorithms. Anoverview of the methods applying othermeta-heuristic algorithms including simulatedannealing, tabu search, and artificial neuralnetworks is also given.     

Exploiting Network Locality for CC-NUMA Multiprocessors

The Journal of Supercomputing - Rapid advances in interconnection networks in multiprocessors are closing the gap between computation and communication. Given this trend, how can we utilize fast...     

QDENSITY—A Mathematica Quantum Computer simulation

This Mathematica 5.2 package¹ is a simulation of a Quantum Computer. The program provides a modular, instructive approach for generating the basic elements that make up a quantum circuit. The main emphasis is on using the density matrix, although an approach using state vectors is also implemented in the package. The package commands are defined in Qdensity.m which contains the tools needed in quantum circuits, e.g., multiqubit kets, projectors, gates, etc. Selected examples of the basic commands are presented here and a tutorial notebook, Tutorial.nb is provided with the package (available on our website) that serves as a full guide to the package. Finally, application is made to a variety of relevant cases, including Teleportation, Quantum Fourier transform, Grover's search and Shor's algorithm, in separate notebooks: QFT.nb, Teleportation.nb, Grover.nb and Shor.nb where each algorithm is explained in detail. Finally, two examples of the construction and manipulation of cluster states, which are part of “one way computing” ideas, are included as an additional tool in the notebook Cluster.nb. A Mathematica palette containing most commands in QDENSITY is also included: QDENSpalette.nb.

Program summary

Title of program: QDENSITYCatalogue identifier: ADXH_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXH_v1_0Program available from: CPC Program Library, Queen's University of Belfast, N. IrelandOperating systems: Any which supports Mathematica; tested under Microsoft Windows XP, Macintosh OS X, and Linux FC4Programming language used: Mathematica 5.2No. of bytes in distributed program, including test data, etc.: 180 581No. of lines in distributed program, including test data, etc.: 19 382Distribution format: tar.gzMethod of solution: A Mathematica package is provided which contains commands to create and analyze quantum circuits. Several Mathematica notebooks containing relevant examples: Teleportation, Shor's Algorithm and Grover's search are explained in detail. A tutorial, Tutorial.nb is also enclosed.     

Competitive exploration of rectilinear polygons

Exploring a polygon with robots when the robots do not have knowledge of the surroundings can be viewed as an online problem. Typical for online problems is that decisions must be made based on past events without complete information about the future. In our case the robots do not have complete information about the environment. Competitive analysis can be used to measure the performance of methods solving online problems. The competitive ratio of such a method is the ratio between the method's performance and the performance of the best method having full knowledge of the future. We prove constant competitive strategies and lower bounds for exploring a simple rectilinear polygon in the _L1$L_1$ metric.     

An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains

We describe an efficient parallel algorithm for hidden-surface removal for terrain maps. The algorithm runs in O(log ⁴ n) steps on the CREW PRAM model with a work bound of O((n+k) \polylog ( n)) where n and k are the input and output sizes, respectively. In order to achieve the work bound we use a number of techniques, among which our use of persistent data structures is somewhat novel in the context of parallel algorithms. Received July 29, 1998; revised October 5, 1999.