利用网络技术实施财务集中控制

针对企业集团分权化管理的缺点，设计出一套利用互联网络技术实现企业集团财务集中控制的模式，给出了模式的图示及说明。     

Computers and translation: integrating IT into undergraduate foreign language learning

Abstract There are still many institutions of higher education in the UK, both universities and polytechnics, that have not taken on board the application of information technology to foreign language learning. Apart from considerations of cost, there is also the problem of time—deciding how best to use the limited time at one's disposal for exploring computer applications to foreign language learning. Both problems may be compounded by the mistaken belief that effective use of this 'new' technology necessarily involves learning one or more programming languages. This paper endeavours to show that recent advances in both software and hardware have produced computing tools of particular interest to translation and the translator, and that, since translation is a reality for large numbers of undergraduates in the UK, such tools represent an obvious starting point for the introduction of IT into the undergraduate curriculum.     

用DirectPlay进行网络编程

介绍使用DirectPlay进行网络编程的一般思路和方法 ,并举出实例进行具体说明。     

Linux下网络虚接口的设计与实现

网络虚接口对特殊数据包的处理起着很大的作用。文章介绍了网络虚接口的概念，在对传统的网络接口比较分析的基础上，设计和实现了一个基于量Linux的用于对发送数据包的内容进行特殊处理的网络虚接口。     

高清晰度电视样机控制子系统的实现

本文提出了基于微处理器AT89C55的国家高清晰度电视样机控制子系统的总体设计方案和软硬件实现方法。目前，该控制系统己顺利完成，并参与北京、上海两地的功能样机测试。     

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

大型电信运营业务支撑系统(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.