大型电信运营业务支撑系统安全评估方法

大型电信运营业务支撑系统(BOSS)有其独特的复杂性，集中化改造后，对BOSS系统的信息安全保障能力也提出了更高的要求，安全评估方面的考虑也越来越多，从管理和技术两个方面探计了大型电信运营业务支撑系统的安全评估方法。     

浅析虚拟存储技术及其IP SAN实现方式

本文详尽介绍了虚拟存储技术及其提供数据保护的方式，并重点论述了如何通过IP SAN的方式来实现数据的虚拟存储以及IP SAN的主要特点和优越性。     

The spatial economics of geothermal district energy in a small, low-density town: a case study of Mammoth Lakes, California

This research focuses on the spatial economics of geothermal district energy (DE) systems that distribute hot fluids through a pipeline network to multiple thermal customers. We argue here that DE is held back by uncertainty about its economic feasibility when implemented in real places. DE works best with high urban densities, but in the US the best geothermal resources are in the less-populated west. Economic geography theory suggests that the optimal size of a DE firm's service area should depend on the trade-off between the economies of scale inherent in a large service area and the greater network development costs and heat loss involved in serving a large area. The HEATMAP© software program developed by Washington State University was used to study the feasibility of numerous scenarios for a proposed DE system in Mammoth Lakes, California. Results indicate that the core area of the town is large enough, dense enough, and in close enough proximity to the resource for profitable DE development. Proposed ski village developments would increase the thermal load density and significantly enhance its ability to remain competitive with other fuels, even in pessimistic sensitivity analyses regarding geothermal heat input costs, public participation, and retro-fitting costs.     

网络财务初论

网络财务是网络时代和电子商务发展的必然趋势 ,本文介绍了网络财务的特征及其会计理论 ,并就其在实施过程中可能出现的风险提出了相应对策     

Node-pair reliability of network systems with small distances between adjacent nodes

A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes.     

Experiments of Fast Learning with High Order Boltzmann Machines

This work reports the results obtained with the application of High Order Boltzmann Machines without hidden units to construct classifiers for some problems that represent different learning paradigms. The Boltzmann Machine weight updating algorithm remains the same even when some of the units can take values in a discrete set or in a continuous interval. The absence of hidden units and the restriction to classification problems allows for the estimation of the connection statistics, without the computational cost involved in the application of simulated annealing. In this setting, the learning process can be sped up several orders of magnitude with no appreciable loss of quality of the results obtained.     

Implementation of a vector quantization codebook design technique based on a competitive learning artificial neural network

We describe an implementation of a vector quantization codebook design algorithm based on the frequencysensitive competitive learning artificial neural network. The implementation, designed for use on high-performance computers, employs both multitasking and vectorization techniques. A C version of the algorithm tested on a CRAY Y-MP8/864 is discussed. We show how the implementation can be used to perform vector quantization, and demonstrate its use in compressing digital video image data. Two images are used, with various size codebooks, to test the performance of the implementation. The results show that the supercomputer techniques employed have significantly decreased the total execution time without affecting vector quantization performance.This work was supported by a Cray University Research Award and by NASA Lewis research grant number NAG3-1164.     

上海市电话局用户接入网发展状况

上海市电话局用户接入网建设经历了调研、网络规划、启动实施和进一步完善、规范四个怅阶段、现已基本形成了覆盖政府机关、大专院校、医院、商务大楼及高层建筑、新建住宅小区、区级以上图书馆等范围的用户光纤网络，为加快经济建设步伐、满足多层次用户需求、拓展电信新业务打下了坚实基础。     

Integrating neural network technology and noise analysis

The integrated use of neural network and noise analysis technologies offers advantages not available by the use of either technology alone. The application of neural network technology to noise analysis offers an opportunity to expand the scope of problems where noise analysis is useful and unique ways in which the integration of these technologies can be used productively. The two-sensor technique, in which the responses of two sensors to an unknown driving source are related, is used to demonstration such integration. The relationship between power spectral densities (PSDs) of accelerometer signals is derived theoretically using noise analysis to demonstrate its uniqueness. This relationship is modeled from experimental data using a neural network when the system is working properly, and the actual PSD of one sensor is compared with the PSD of that sensor predicted by the neural network using the PSD of the other sensor as an input. A significant deviation between the actual and predicted PSDs indicate that system is changing (i.e., failing). Experiments carried out on check valves and bearings illustrate the usefulness of the methodology developed.     

一种多输入队ATM交换结构

本文提出一种多输入排队ＡＴＭ交换结构和相应的输出冲突解决方法，它可以使交换网络避免输入队固有的排头阻塞，从而使网络在不增加运行速率的情况下，可达到输出排队的性能。文中介绍了冲突解决办法及其实现技术，说明它可方便地在高速网中实现。