关于高师院校计算机专业教学改革的几点建议

本文以高等师范院校计算机专业教学改革为例,从教育观念的更新、教学模式的转变、教学手段的更新、教学对象的再认识、教学中的教材教法等多个方面分析以网络为主的现代教育模式改革的思想,目的在于探索出一条以多媒体和网络为主体的教学环境下的教育新思路。     

行波型热声发动机的分布参数法热力分析

在现有热声网络模型的基础上 ,对行波型热声发动机采用分布参数法进行了详细地分析 ,得到了较为完整的分布参数法网络模型 ,并给出了该模型的定性关系式 ,所得结果与采用集总参数法的结果有很大差异。分析表明 ,分布参数法更适合于一般的系统情况 ,集总参数法仅仅在一定条件下才适用。文中对一个实际系统应用分布参数法进行了分析 ,得到一些结论 ,对于我们设计行波型热声发动机有非常重要的理论指导意义     

Using activity focus networks to pressure terrorist organizations

The predominant idea for using network concepts to fight terrorists centers on disabling key parts of their communication networks. Although this counternetwork strategy is clearly a sound approach, it is vulnerable to missing, incomplete, or erroneous information about the network. This paper describes a different and complementary application of network concepts to terrorist organizations. It is based on activity focus networks (AFNs), which represent the complex activity system of an organization. An activity focus is a conceptual or physical entity around which joint activity is organized. Any organization has a number of these, which are in some cases compatible and in some cases incompatible. The set of foci and their relations of compatibility and incompatibility define the AFN. A hypothetical AFN for a terrorist organization is specified and tested in a simulation called AQAS. It shows that certain activity foci, and in particular one combination, have high potential as pressure points for the activity system. The AFN approach complements the counternetwork approach by reducing the downside risk of incomplete information about the communication network, and enhancing the effectiveness of counternetwork approaches over time. Steven R. Corman is Professor in the Hugh Downs School of Human Communication at Arizona State University and Chair of the Organizational Communication Division of the International Communication Association. His research interests include communication networks and activity systems, high-resolution text and discourse analysis, and modeling and simulation of human communication systems.     

神经网络在电磁场数值问题中的应用

针对目前电磁场数值处理中计算繁杂慢速和耗费资源过多的问题,本文提出了一种基于神经网络小波理论进行计算的新方法。文中着重介绍了利用小波变换神经网络的基本理论,结合电磁场数值计算的基本方法,推导变换进而得到一个通用公式和处理方法。在该方法中,神经网络学习内容少和数据处理简单,因此该方法具有计算速度快,占用资源少的优点,并有用硬件实现的前景。     

非网络版软件在Novell网上运行环境的设计

本文通过对非网络版软件在单机上运行环境分析，找出了一套调整此类软件使其在Ｎｏｖｅｌｌ网上运行的方法，并提出了非网络软件在Ｎｏｖｅｌｌ网上运行环境的设计的观点，具有较大的意义。     

Network externalities in a dynamic monopoly

We reconsider the role of network externalities in a dynamic spatial monopoly where the firm must invest in order to accumulate capacity, while consumers may have either linear or quadratic preferences. We (1) characterise saddle point equilibria, (2) prove that the extent of market coverage is increasing in the network effect and (3) unlike the existing static literature on the same problem, the monopolist may not make introductory price offers. Then, we briefly deal with the socially optimal solution, showing that, in general, a planner would serve more consumers than a profit-seeking monopolist.      

关于组合最优化理论的多媒体教学实践

本文讨论和分析了开发组合最比化理论系列课程多媒体课件的基本认识、课件的主要特色和体会，并提出了使用多媒体课件中应注意的问题．     

模糊集技术在网络信息过滤系统中的应用研究

本文将模糊模式识别引入到校园网信息过滤系统中，通过网页内容识别和分级技术将各种不同网站进行分类，过滤和禁止有害网络信息，从而达到校园网的信息“净化”目的。     

On the departure process of a leaky bucket system with long-range dependent input traffic

Due to the strong experimental evidence that the traffic to be offered to future broadband networks will display long-range dependence, it is important to study the possible implications that such traffic may have for the design and performance of these networks. In particular, an important question is whether the offered traffic preserves its long-range dependent nature after passing through a policing mechanism at the interface of the network. One of the proposed solutions for flow control in the context of the emerging ATM standard is the so-called leaky bucket scheme. In this paper we consider a leaky bucket system with long-range dependent input traffic. We adopt the following popular model for long-range dependent traffic: Time is discrete. At each unit time a random number of sessions is initiated, having the distribution of a Poisson random variable with mean λ. Each of these sessions has a random duration τ, where the integer random variable τ has finite mean, infinite variance, and a regularly varying tail, i.e., P(τ >К) ~ К^-Lα L(К), where 1 < α < 2 L(·) is a slowly varying function. Once a session is initiated, it generates one cell at each unit of time until its termination. We examine the departure process of the leaky bucket policing mechanism driven by such an arrival process, and show that it too is long-range dependent for any token buffer size and any - finite or infinite - cell buffer size. Moreover, upper and lower bounds for the covariance sequence of the output process are established. The above results demonstrate that long-range dependence cannot be removed by the kinds of flow control schemes that are currently being envisioned for broadband networks. This revised version was published online in June 2006 with corrections to the Cover Date.