浅谈计算机网络技术在病案管理中的问题及前景

随着计算机技术及网络技术的发展和应用,医院的信息化管理已经进入议事日程。在病案管理中,许多医院的病案首页已经录入电子计算机,完整的电子病案指日可待。本文就未来计算机网络技术在病案管理中应用时可能遇到的问题及前景进行了初步探讨。

构建基于建构主义学习理论的大学英语写作课程教学模式

以建构主义学习理论为依据,以计算机/网络技术为支撑,在Stahl(2000a)的"协作知识建构模型"基础上设计了计算机/网络环境下基于建构主义学习理论的英语写作教学模式,试图改善传统英语写作教学模式,改变当前英语写作教学低效的现状,提高学生英语写作能力。该模式以学生为中心,以教师为指导,以计算机/网络学习为主要学习环境,以视频聊天室、BBS、博客、邮箱为教学或学习介质,将成果法与过程法相结合,利用"情境"、"协作"、"会话"等要素,充分发挥学生的主动性、积极性和首创精神。

FAULT LOCATION AND RECORDING SYSTEM OF TRANSMISSION LINES BASED ON COMPUTER NETWORK

In this paper a fault location and recording system based on a computer network is presented. A brief description of the system structure and main features are given. Emphasis is placed on the accurate fault location method for extra high voltage and long distance transmission lines.

Distributed Computation Models for Data Fusion System Simulation

An attempt has been made to develop a distributed software infrastructure model for onboard data fusion system simulation, which is also applied to netted radar systems, onboard distributed detection systems and advanced C3I systems. Two architectures are provided and verified: one is based on pure TCP/IP protocol and C/S model, and implemented with Winsock, the other is based on CORBA (common object request broker architecture). The performance of data fusion simulation system, i.e. reliability, flexibility and scalability, is improved and enhanced by two models. The study of them makes valuable explore on incorporating the distributed computation concepts into radar system simulation techniques.

Research and Implementation on HTTP Tunneling

The security problem of the Web system in the Internet based Intranet and the shortcomings of the methods used in solving this problem are analyzed and our system model of Web communication security are discussed, i.e, adding local proxy to browser and reverse proxy to Web server based on present Web browser and server. The transformation between HTTP message and secure HTTP message is implemented in these two proxy modules. The architecture and implementing method is given and the features of this module is also discussed.

Modeling of Intelligent Integrated Network Management System Using Object Oriented Approach *

The concept of intelligent integrated network management (IINM) is briefly introduced. In order to analyze, design and implement IINM successfully, object oriented approach is testified to be an effective and efficient way. In this paper, object oriented technique is applied to the structural model of IINM system, The Domain object class and the MU object class are used to represent the manager and the managed resources. Especially, NM IA is introduced which is a special object class with intelligent behaviors to manage the resources efficiently.

Prediction of Injection-Production Ratio with BP Neural Network

Injection of water to enhance oil production is commonplace, and improvements in understanding the process are economically important. This study examines predictive models of the injection-to-production ratio. Firstly, the error between the fitting and actual injection-production ratio is calculated with such methods as the injection-production ratio and water-oil ratio method, the material balance method, the multiple regression method, the gray theory GM (1,1) model and the back-propogation (BP) neural network method by computer applications in this paper. The relative average errors calculated are respectively 1.67%, 1.08%, 19.2%, 1.38% and 0.88%. Secondly, the reasons for the errors from different prediction methods are analyzed theoretically, indicating that the prediction precision of the BP neural network method is high, and that it has a better self-adaptability, so that it can reflect the internal relationship between the injection-production ratio and the influencing factors. Therefore, the BP neural network method is suitable to the prediction of injection-production ratio.

HiQoS:An SDN-Based Multipath QoS Solution

Today's Internet architecture provides only "best effort" services,thus it cannot guarantee quality of service(QoS) for applications.Software Defined Network(SDN)is a new approach to computer networking that separates control plane and forwarding planes,and has the advantage of centralized control and programmability.In this paper,we propose HiQoS that provides QoS guarantees using SDN.Moreover,HiQoS makes use of multiple paths between source and destination and queuing mechanisms to guarantee QoS for different types of traffic.Experimental results show that our HiQoS scheme can reduce delay and increase throughput to guarantee QoS.Very importantly,HiQoS recovers from link failure very quickly by rerouting traffic from failed path to other available path.

Adaptive ant-based routing in wireless sensor networks using Energy~* Delay metrics

To find the optimal routing is always an important topic in wireless sensor networks (WSNs). Considering a WSN where the nodes have limited energy, we propose a novel Energy*Delay model based on ant algorithms ("E&D ANTS" for short) to minimize the time delay in transferring a fixed number of data packets in an energy-constrained manner in one round. Our goal is not only to maximize the lifetime of the network but also to provide real-time data transmission services. However, because of the tradeoff of energy and delay in wireless network systems, the reinforcement learning (RL) algorithm is introduced to train the model. In this survey, the paradigm of E&D ANTS is explicated and compared to other ant-based routing algorithms like AntNet and AntChain about the issues of routing information, routing overhead and adaptation. Simulation results show that our method performs about seven times better than AntNet and also outperforms AntChain by more than 150% in terms of energy cost and delay per round.

Deterministic and randomized scheduling problems under the lp norm on two identical machines

Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problem P2|decr|lp (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of the lp norm of every machine’s load. It is shown that LS algorithm is optimal for any lp norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problems P2|online|lp and P2|decr|lp are presented.

An Adaptive Scheme for Neighbor Discovery in Mobile Ad Hoc Networks

The neighbor knowledge in mobile ad hoc networks is important information. However, the accuracy of neighbor knowledge is paid in terms of energy consumption. In traditional schemes for neighbor discovery, a mobile node uses fixed period to send HELLO messages to notify its existence. An adaptive scheme was proposed. The objective is that when mobile nodes are distributed sparsely or move slowly, fewer HELLO messages are needed to achieve reasonable accuracy, while in a mutable network where nodes are dense or move quickly, they can adaptively send more HELLO messages to ensure the accuracy. Simulation results show that the adaptive scheme achieves the objective and performs effectively.

Improved Feistel-based ciphers for wireless sensor network security

Wireless sensor networks (WSNs) are exposed to a variety of attacks. The quality and complexity of attacks are rising day by day. The proposed work aims at showing how the complexity of modern attacks is growing accordingly, leading to a similar rise in methods of resistance. Limitations in computational and battery power in sensor nodes are constraints on the diversity of security mechanisms. We must apply only suitable mechanisms to WSN where our approach was motivated by the application of an improved Feistel scheme. The modified accelerated-cipher design uses data-dependent permutations, and can be used for fast hardware, firmware, software and WSN encryption systems. The approach presented showed that ciphers using this approach are less likely to suffer intrusion of differential cryptanalysis than currently used popular WSN ciphers like DES, Camellia and so on.

Strategic games on a hierarchical network model

Among complex network models,the hierarchical network model is the one most close to such real networks as world trade web,metabolic network,WWW,actor network,and so on.It has not only the property of power-law degree distribution,but also the scaling clustering coefficient property which Barabási-Albert(BA)model does not have.BA model is a model of network growth based on growth and preferential attachment,showing the scale-free degree distribution property.In this paper,we study the evolution of cooperation on a hierarchical network model,adopting the prisoner's dilemma(PD)game and snowdrift game(SG)as metaphors of the interplay between connected nodes.BA model provides a unifying framework for the emergence of cooperation.But interestingly,we found that on hierarchical model,there is no sign of cooperation for PD game,while the fre-quency of cooperation decreases as the common benefit decreases for SG.By comparing the scaling clustering coefficient prop-erties of the hierarchical network model with that of BA model,we found that the former amplifies the effect of hubs.Considering different performances of PD game and SG on complex network,we also found that common benefit leads to cooperation in the evolution.Thus our study may shed light on the emergence of cooperation in both natural and social environments.

A Novel Packet Marking Algorithm in Context-aware Autonomic QoS Framework

Autonomic networking is one of the hot research topics in the research area of future network architectures.In this paper, we introduce context-aware and autonomic attributes into DiffServ QoS framework, and propose a novel autonomic packet marking(APM) algorithm.In the proposed autonomic QoS framework, APM is capable of collecting various QoS related contexts, and adaptively adjusting its behavior to provide better QoS guarantee according to users' requirements and network conditions.Simulation results show that APM provides better performance than traditional packet marker, and significantly improves user's quality of experience.

An Algorithm to Construct Concurrent Reachability Graph of Petri Nets

Reachability graph is a very important tool to analyze the dynamic properties of Petri nets, but the concurrent relation of transitions in Petri nets cannot be represented by reachability graph. Petri net is a concurrent system, while reachability graph is a serial one. However, concurrency is a kind of property which is not only very significant but also difficult to be analyzed and controlled. This paper presents the concepts of concurrent reachable marking and concurrent reachable graph in order to represent and analyze the concurrent system. The algorithm constructing concurrent reachable marking set and concurrent reachability graph is also shown so that we can study the response problems among services in a network computing environment and analyze the throughput of the system. The Dining Philosophers Problem, which is a classic problem of describing the management of concurrent resources, is given as an example to illustrate the significance of concurrent reachability graph.

Research on traffic congestion mechanism and countermeasures based on dynamic traffic assignment

Traffic congestion is widely distributed around a network. Generally, to analyze traffic congestion, static traffic capacity is adopted. But dynamic characteristics must be studied because congestion is a dynamic process. A Dynamic Traffic Assignment modeling fundamental combined with an urban congestion analysis method is studied in this paper. Three methods are based on congestion analysis, and the stochastic user optimal DTA models are especially considered. Correspondingly, a dynamic system optimal model is suggested for responding congestion countermeasures and an ideal user optimal model for predicted congestion countermeasure respectively.

Web Page Watermarking for Tamper-Proof

This paper proposed a watermarking algorithm for tamper-proof of web pages. For a web page, it generates a watermark consisting of a sequence of Space and Tab. The wa termark is then embedded into the web page after each word and each line. When a watermarked web page is tampered, the extracted watermark can detect and locate the modifications to the web page. Besides, the framework of watermarked Web Server system was given. Compared with traditional digital signature methods, this watermarking method is more transparent in that there is no necessary to detach the watermark before displaying web pages. The e xperimental results show that the proposed scheme is an effective tool for tamper-proof of web pages.

A reliable routing algorithm based on fuzzy Petri net in mobile ad hoc networks

A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.

The design and implementation of web mining in web sites security

The backdoor or information leak of Web servers can be detected by using Web Mining techniques on some abnormal Web log and Web application log data. The security of Web servers can be enhanced and the damage of illegal access can be avoided. Firstly, the system for discovering the patterns of information leakages in CGI scripts from Web log data was proposed. Secondly, those patterns for system administrators to modify their codes and enhance their Web site security were provided. The following aspects were described: one is to combine web application log with web log to extract more information,so web data mining could be used to mine web log for discovering the information that firewall and Information Detection System cannot find. Another approach is to propose an operation module of web site to enhance Web site security. In cluster server session, Density -Based Clustering technique is used to reduce resource cost and obtain better efficiency.

Research on the Synchronization of Modulation Hopping System:I Synchronization Scheme

In order to achieve fast synchronization of the modulation hopping system, a synchronization scheme called short code to guide long code is adopted, and the initial synchronization hops and service hops are designed in detail.According to the system requirements for short code in the properties of time-varying, safety and balance, an algorithm to design wide-gap chaos short code based on TOD is proposed.Synchronization performance analysis shows that the algorithm has good performance, the initial synchronization time and the later entering network synchronization time are short, additionally, maximum synchronization time difference and synchronization maintaining time are long, all of which meet the needs of normal communications, and further verify the synchronization scheme feasible.