一种基于NS4的网络设备自动化配置与管理方法研究

提出了一种基于NS4技术的网络设备自动化配置与管理实现方法。在介绍NS4工作原理的基础上,给出了NS4技术在网络设备配置管理、系统管理以及性能监控管理等三个方面的典型应用案例。实践证明,NS4技术在网络设备自动化配置与管理方面具有良好的应用前景。     

CMM二级KPA软件配置管理的设计及实施方案

介绍了软件组织设计及实施CMM二级KPA软件配置管理的方法，着重于组织结构，文件体系，过程和资源4个方面描述了建立软件配置管理体系的过程，对于配置标识，配置控制、配置状态统计和配置审核4大活动描述了实施软件配置管理的过程。     

产品新闻

配置提升IBM eServer p615 近日,IBM宣布将原来配置1.2GHzPOWER4+芯片的eServer p615服务器升级为1.45GHz芯片。经过本次产品升级,p615获得了更为强大的I/O配置功能。其4个标准的和4个可选的热插拔磁盘驱动器支架目前可以支持Ultra320 SCSI磁盘,最高数据传输速率从160Mbps增加到     

基于Cisco Packet Tracer模拟器IPv6-over-IPv4隧道实验设计与实现

通过介绍IPv6-over-IPv4解决多点tunnel通讯方法理论,借助计算机网络实验教学仿真软件Cisco Packet Tracer 6.1来讲解ipv6中的隧道的配置技术、实验过程和配置指令。经历了IPv4网络互通、隧道创建和终端路由协议三个过程,实现了整合和共存机制对IPv4协议网络保持完全的兼容性。实现了多台设备互联互通,并通过实测,丰富了计算机工程组网中路由配置实验教学内容。     

浅谈IPv6地址的无状态自动发现

由于IPv6地址长度比IPv4大很多,如果采用静态配置,会给用户带来很大麻烦,为此IPv6采用了两种地址配置协议,即无状态地址自动配置协议与有状态自动配置协议(DHCPv6)。本文对前者进行了深入讨论。     

IP网络中6to4隧道技术的研究

介绍了IP网络中的6to4隧道技术,由于大型IPv6网络使用6to4隧道技术进行通信时需要进行邻居的手工配置,这种配置方式使得6to4隧道失去了灵活和扩展性好的优势,存在静态路由配置复杂的问题,借助于组播技术的优势,提出了一种实现自动获取IPv6路由信息的方法,将隧道边缘设备的接口和中继设备的接口加入同一组播组,从而方便灵活地实现了隧道边缘设备IPv6路由信息的学习。     

手工隧道的配置—以中兴ZXR10 GAR路由器为例

隧道技术(Tunneling)是一种通过使用互联网络的基础设施在网络之间传递数据的方式,在设置IPv4报头的目的IP地址时分为手动和自动两种方式.本文介绍的通过人工方式预先设置隧道终点IPv4地址的手工配置隧道技术,使得每条隧道的终点IPv4地址都是隧道起点从人工配置信息中获得.本文以中兴ZXR10 GAR路由器为例介绍了手工隧道的配置.     

iBatis.Net(C#)系列二:SQL数据映射

探讨了iBatis.Net框架的XML数据映射文件各配置节点的含义,并通过对数据库的CRUD 4种操作讲解了配置数据映射文件和调用方法。     

IPv6-over—IPv4隧道技术在校园网中的实现

采用手动配置IPv6-over—IPv4隧道方法．通过一个具体的IPv6／IPv4共存校园网络的部署．以及路由器的端口设置、IP地址分配和各路由器的配置,实现基于隧道原理的IPv6穿越IPv4的透明传输．为IPv4过渡到IPv6提供了一种技术手段。     

基于Linux环境的IPv6的自动配置分析及实验

针对对IPv6的特点和各种地址配置认识的不足,列出IPv6较IPv4主要增加的特点,介绍了IPv6无状态地址自动配置下的链路本地地址的转换原则以及在Linux环境中IPv6无状态地址自动配置下的全局地址配置、IPv6有状态地址自动配置下DHCPv6的无状态和有状态的地址自动配置的方法,以及通过使用wireshark抓包进行相应的分析、阐明各种地址配置的方法和工作流程.     

MIPv4网络中的蠕虫传播模型

基于MIPv4网络环境,构建一种新型蠕虫——MIPv4-Worm,给出MIPv4节点接触频率的计算方法,对MIPv4网络中蠕虫的传播策略进行了分析和研究,建立MIPv4网络蠕虫传播模型(MWM)。该模型显示了各参数对蠕虫传播的影响。MIPv4-Worm传播的仿真实验表明,该模型较好地模拟了MIPv4网络中蠕虫的传播规律,为采取有效措施防止MIPv4中蠕虫的大范围传播提供了理论依据。     

The relationship between organizational culture and the deployment of agile methods

Context

Systems development normally takes place in a specific organizational context, including organizational culture. Previous research has identified organizational culture as a factor that potentially affects the deployment systems development methods.

Objective

The purpose is to analyze the relationship between organizational culture and the post-adoption deployment of agile methods.

Method

This study is a theory development exercise. Based on the Competing Values Model of organizational culture, the paper proposes a number of hypotheses about the relationship between organizational culture and the deployment of agile methods.

Results

Inspired by the agile methods thirteen new hypotheses are introduced and discussed. They have interesting implications, when contrasted with ad hoc development and with traditional systems development methods.

Conclusion

Because of the conceptual richness of organizational culture and the ambiguity of the concept of agility the relationship between organizational culture and the deployment of agile systems development forms a rich and interesting research topic. Recognizing that the Competing Values Model represents just one view of organizational culture, the paper introduces a number of alternative conceptions and identifies several interesting paths for future research into the relationship between organizational culture and agile methods deployment.     

An empirical study of the 4‐valued Kripke–Kleene and 4‐valued well‐founded semantics in random propositional logic programs

We empirically investigated the difficulty of finding stable models for logic programs using backtracking, by trying to identify what makes random instances easy or hard. Additionally, we empirically investigated the effectiveness of the 4‐valued Kripke–Kleene semantics (4KK) and the 4‐valued well‐founded semantics (4WF) in the Niemelä and Simons’ backtracking algorithm, smodels, for finding stable models. We studied the behavior of 4KK and 4WF in a parameterized distribution of random propositional logic programs of fixed rule‐length k. In all of our experiments, 4KK and 4WF (both modified to extend an input partial truth assignment) were computed with respect to a fixed percentage of proposition letters (randomly chosen) initially assigned TRUE and a fixed percentage (randomly chosen) initially assigned FALSE. There exists a region, R, in the parameter space of our distribution where smodels required a large number of recursive calls to determine if programs generated in this region have any stable models. Hence, the “hardest” programs for smodels to determine if a stable model exists lie in R. Additionally, there exists a subregion of R where smodels made significantly fewer recursive calls when using 4WF as a pruning technique than when using 4KK. To gain a deeper insight into the causes for the “hardness” of programs in R and the differences between 4WF and 4KK as pruning techniques in smodels, we examined more closely the behavior of 4KK and 4WF. There exists a region in which a very small percentage of inconsistent models were produced by both 4KK and 4WF, thereby providing very little information useful for smodels to immediately backtrack. This region roughly corresponded to the above region where smodels required a large number of recursive calls. Also, there exists a region in which both 4KK and 4WF produced a high percentage of inconsistent models, thereby providing information useful for smodels to immediately backtrack.     

Conceptual framework for business processes compositional verification

Context

To guarantee the success of Business Process Modelling (BPM) it is necessary to check whether the activities and tasks described by Business Processes (BPs) are sound and well coordinated.

Objective

This article describes and validates a Formal Compositional Verification Approach (FCVA) that uses a Model-Checking (MC) technique to specify and verify BPs.

Method

This is performed using the Communicating Sequential Processes +Time (CSP+T) process calculus, which adds new constructions to timed Business Process Model and Notation (BPMN) modelling entities for non- functional requirement specification.

Results

Using our proposal we are able to specify the BP Task Model (BPTM) associated with BPs by formalising the timed BPMN notational elements. The proposal also allows us to apply MC to BPTM verification. A real-life example of verifying a BPTM in the field of Customer Relationship Management (CRM) is discussed as a practical application of FCVA.

Conclusion

This approach facilitates the verification of complex BPs from independently verified local processes, and establishes a feasible way to use process calculi to verify BPs using state-of-the-art MC tools.     

如何解决IPv4到IPv6过渡的兼容问题

IPv4地址空间的耗尽使得IPv4在获得巨大成功的同时也面临困境。因此下一代互联网协议IPv6的实施势在必行。IPv4因其出色的技术特性在互联网领域获得了巨大的成功,现在的互联网络是基于IPv4的,不可能将它们在短时间内都过渡到基于IPv6的网络。因此,在相当长的一段时期内,IPv6网络将和IPv4网络共存。如何实现IPv4向IPv6平滑过渡是目前面临的重要问题。     

4D video textures for interactive character appearance

4D Video Textures (4DVT) introduce a novel representation for rendering video‐realistic interactive character animation from a database of 4D actor performance captured in a multiple camera studio. 4D performance capture reconstructs dynamic shape and appearance over time but is limited to free‐viewpoint video replay of the same motion. Interactive animation from 4D performance capture has so far been limited to surface shape only. 4DVT is the final piece in the puzzle enabling video‐realistic interactive animation through two contributions: a layered view‐dependent texture map representation which supports efficient storage, transmission and rendering from multiple view video capture; and a rendering approach that combines multiple 4DVT sequences in a parametric motion space, maintaining video quality rendering of dynamic surface appearance whilst allowing high‐level interactive control of character motion and viewpoint. 4DVT is demonstrated for multiple characters and evaluated both quantitatively and through a user‐study which confirms that the visual quality of captured video is maintained. The 4DVT representation achieves >90% reduction in size and halves the rendering cost.     

Kinematic and electromyographic differences between mouse and touchpad use on laptop computers

Background

Numerous studies have compared the postures and muscular activities induced by the various input devices available. To the authors' knowledge, no studies have yet compared upper body posture and movement, sEMG activity and muscle co-contractions induced by use of a mouse or of a touchpad.

Objective

The aim of this study was to compare posture, joint excursion and sEMG activity when using a laptop equipped with a mouse or a touchpad.

Methods

Trunk and upper arm posture, ranges of motion and muscle activities were measured in ten subjects during two standardized tasks.

Results

Mouse use induced larger shoulder abduction than touchpad use. On the other hand, when a touchpad was used, the upper arm joints were bound and fixed to a greater extent than during mouse use. Touchpad users are forced to maintain a more static posture. The upper arm electromyography results clearly indicate that touchpad use requires more stabilization than mouse use.

Conclusion

Motor tasks executed by means of the mouse allow a greater range of motions and reduce the biomechanical stress thanks to the greater postural mobility, even though the posture is less neutral. The results of our study tend to suggest that an external mouse should be preferred to the touchpad by frequent users of laptops.

Relevance to industry

This study is a suggestion for IT companies to give customers information of possible advantages using an external mouse. Furthermore our data highlight the importance of providing a mouse to all laptop users in order to reduce biomechanical risks.     

Low complexity radix-4 butterfly design for the soft-decision Viterbi decoder

This study presents a new radix-4 butterfly design for Viterbi decoders. The branch symmetry of the proposed radix-4 butterfly is exploited to design a low-complexity radix-4 butterfly module to simplify the implementation of the soft-decision Viterbi decoder. By exploiting the branch symmetry, only a half of branch metrics need to be computed, while other metrics can be derived from the computed branches. Therefore, the branch metric computation of the radix-4 butterfly can be reduced by a factor of 2. Considering the convolutional code in the DAB system as an example, experimental results indicate that the proposed radix-4 butterfly design can reduce the number of FPGA slices of the radix-4 butterfly module by 24% over the conventional design.