"冲压工艺学"网络教材的开发

介绍了"冲压工艺学"网络教材的开发过程,对其结构、内容、导航、反馈等做了分析.     

新时期大学生的网络素质与提高途径

“网络”这个现代信息传递的最佳载体,在给大学生带来学习便捷的同时,也有一定的负面影响。新时期大学生网络素质的提高要靠他律与自律的统一,而自律则是关键和基础。     

Two Variations of the Minimum Steiner Problem

Given a set S of starting vertices and a set T of terminating vertices in a graph G = (V,E) with non-negative weights on edges, the minimum Steiner network problem is to find a subgraph of G with the minimum total edge weight. In such a subgraph, we require that for each vertex s S and t T, there is a path from s to a terminating vertex as well as a path from a starting vertex to t. This problem can easily be proven NP-hard. For solving the minimum Steiner network problem, we first present an algorithm that runs in time and space that both are polynomial in n with constant degrees, but exponential in |S|+|T|, where n is the number of vertices in G. Then we present an algorithm that uses space that is quadratic in n and runs in time that is polynomial in n with a degree O(max {max {|S|,|T|}–2,min {|S|,|T|}–1}). In spite of this degree, we prove that the number of Steiner vertices in our solution can be as large as |S|+|T|–2. Our algorithm can enumerate all possible optimal solutions. The input graph G can either be undirected or directed acyclic. We also give a linear time algorithm for the special case when min {|S|,|T|} = 1 and max {|S|,|T|} = 2.The minimum union paths problem is similar to the minimum Steiner network problem except that we are given a set H of hitting vertices in G in addition to the sets of starting and terminating vertices. We want to find a subgraph of G with the minimum total edge weight such that the conditions required by the minimum Steiner network problem are satisfied as well as the condition that every hitting vertex is on a path from a starting vertex to a terminating vertex. Furthermore, G must be directed acyclic. For solving the minimum union paths problem, we also present algorithms that have a time and space tradeoff similar to algorithms for the minimum Steiner network problem. We also give a linear time algorithm for the special case when |S| = 1, |T| = 1 and |H| = 2.An extended abstract of part of this paper appears in Hsu et al. (1996).Supported in part by the National Science Foundation under Grants CCR-9309743 and INT-9207212, and by the Office of Naval Research under Grant No. N00014-93-1-0272.Supported in part by the National Science Council, Taiwan, ROC, under Grant No. NSC-83-0408-E-001-021.     

略论期刊编辑部远程办公的实现

期刊编辑部通过在网站上建立远程办公系统,可实现家庭办公和异地办公。远程办公室主页主要由办公室、会议室、会客室、阅览室、财务室、广告部、发行部等职能部门组成。其中,办公室又分主编室、专业编辑室等,主编可定期在会议室召开会议,各编辑和作者、读者相约在会客室交流。规范的约稿函、修稿函、催版面费函等,可利用邮件系统发送,而审稿费、稿费、版面费等可在财务室通过网上银行转账。作者投稿时可直接进入编辑室对口专业的"办公桌",编辑可在自己"办公桌"上编排校稿件,提交给主编,实现局域网办公、因特网办公等远程办公的功能。利用该系统,可外聘编辑(甚至异地的编辑),本编辑部的编辑也可在别的杂志社兼职,为建立网上编辑部提供了技术支持。     

基于GERT随机网络的废弃回收预测模型研究

在阐述回收处理业务流程的基础上,分析其不确定性;运用随机网络系统模型的相关理论构建GERT网络模型,探讨产品回收再制造零部件和可再生材料的预测模型。该模型既可以预测出废弃产品返回数量、回收处理过程中的再造零部件和可再生材料的比例和数量,又可以预测出它们的期望返回时间。最后,以打印机的回收再制造为例,对模型进行了实际应用。     

对网络会计的探讨

网络会计作为知识经济时代产生的一种全新会计,它因其先进性和对环境的适应能力必将成为财务会计发展的主流。就当前来说,网络会计值得研究和探讨的问题很多,但急需解决的是网络会计对传统财务会计的冲击致使网络会计缺乏理论的支持,以及网络会计在发展中存在的问题。本文就此进行了探讨,并尝试性地提出相应的对策。     

网络环境下图书馆员的角色定位与素质培育

知识经济改变了图书馆的地位和命运,信息化拓展了图书馆的视域和功能,网络化给图书馆注入了新的活力。网络环境下的图书馆员应当是信息馆员、知识馆员、网络馆员。培育馆员的信息素质一要建立继续教育机制;二要加强自身修养;三要走学者化道路。     

移动运营商项目后评价体系研究

本文回顾了项目后评价的历史以及进行项目后评价的重要意义,并且从社会意义、竞争要求以及资本市场的要求三个方面提出了我国的电信运营商进行项目后评价的迫切性。然后根据移动电信运营商的项目特点就移动电信运营商如何进行项目后评价提出了实施建议,并介绍了各种后评价方法的应用。最后,本文提出了建立项目后评价知识管理系统的建议,以提升项目后评价结果的应用层面,提高企业的投资决策水平。     

A Nonatomic‐Game Approach to Dynamic Pricing under Competition

We study a revenue management problem involving competing firms. We assume the presence of a continuum of infinitesimal firms where no individual firm has any discernable influence over the evolution of the overall market condition. Under this nonatomic‐game approach, the unanimous adoption of an equilibrium pricing policy by all firms will yield a market‐condition process that in turn will elicit the said policy as one of the best individual responses. For both deterministic‐ and stochastic‐demand cases, we show the existence of equilibrium pricing policies that exhibit well‐behaving monotone trends. Our computational study reveals many useful insights, including the fact that only a reasonable number of firms are needed for our approach to produce near‐rational pricing policies.