对网络QoS中拥塞控制的研究

拥塞控制是解决网络拥塞问题的重要策略。本文主要从流量预测和流量整形两个方面提出了降低拥塞率的通用方法．对传统的漏桶算法和RED算法做了改进。使得它们在降低拥塞率的同时又照顾到了公平性和效率。     

对网络QoS中拥塞控制的研究

拥塞控制是解决网络拥塞问题的重要策略。本文主要从流量预测和流量整形两个方面提出了降低拥塞率的通用方法,对传统的漏桶算法和RED算法做了改进,使得它们在降低拥塞率的同时又照顾到了公平性和效率。     

基于优先权丢弃策略的共享保证双漏桶机制

ＡＴＭ网络提供了对多媒体应用的良好支持，本文介绍了常用流量控制机制，重点讨论了共享保证双漏桶机制，并在其基础上提出了基于优先权丢弃策略的共享保证双漏桶机制     

改进的漏桶算法对输出业务流自相似特性的影响

漏桶算法是基于速率调节进行业务流控制的一种重要方法.在自相似业务流输入下,将模糊控制机制加入漏桶算法中,分析了改进的漏桶算法对业务流自相似特性的影响.计算机仿真实验结果表明,在负载较重的情况下,改进的漏桶算法对于业务流输出的自相似特性有较好的性能,同时对缓冲区容量的需求和输入流的方差变化上也有很好的自适应性.因此,改进的漏桶算法比简单漏桶算法更适用于自相似业务流的整形.     

移动智能网多业务环境下SCP过载控制研究*

针对移动智能网在CAMEL 2阶段业务控制点（Service Control Point,SCP）与业务交换点（Service Switch Point,SSP）之间没有过载控制信令的情况,提出了一种多业务环境下在SCP内部实现的过载控制算法。算法通过在SCP系统的接入服务器（AS）上使用漏桶控制器,动态调整进入SCF（Service Control Function）的呼叫到达率来实现过载控制。仿真结果表明,此算法的有效性、健壮性和公平性都较好。     

基于软件的实时交换式以太网的实现

本文讲述了在交换式以太网环境下采用流量控制来实现实时通信的方法,重点描述了实现流量控制所采用的算法,并对比了加载块前后系统的延迟、抖动、丢包率。测试表明,采用流量控制后能够有效改善网络的性能,实现实时通信。     

基于令牌桶算法的卫星数据地面传输流量控制方法研究

该文根据卫星数据的特点,在研究令牌桶算法的基础上,提出了一种改进的令牌桶算法,增加了两个模块:令牌放置模块和令牌请求模块,在模拟环境下实现该算法。在对卫星数据进行流量控制的同时,降低了数据传输过程中的抖动,并保证了卫星实时数据的低时延和非实时数据尽量大的带宽,在模拟环境下进行测试,达到了较好的效果。     

多媒体会议系统中的视音频传输模块

简单介绍了实时传输协议(RTP)和实时传输控制协议(RTCP)。给出了网络多媒体会议系统中视音频传输模块的一种实现方法并着重讨论了实现过程中一些关键问题。如RTP包成帧算法和流量控制等。     

一种控制BT流量的方法及其对用户的影响

针对BT流量占用大量带宽资源的问题，提出了BT令牌桶流量控制算法。分析了在网络出口控制BT带宽前后，内网用户的下载速率和内网平均用户数的变化。结果表明，控制出口BT带宽后，内网peer之间的数据传输速率会适当增加，平均每个peer的下载速率有所减少，平均内网peer数增加。将具有BT令牌桶流控功能的设备应用于试验网络环境中，测试结果表明，该算法有效，分析结果正确。     

漏桶模型下GPS调度系统的性能分析

着重分析了在数据流分别由线性漏桶和分形漏桶模型进行约束和整形的情况下，GPS(Generalized Processor Sharing)通用处理器共享调度系统的排队性能，给出了最大队长和最大时延的估算方法，并将理论分析与实验结果做了一定对比．文章分析指出，对UDP流和聚集程度不高的TCP流，用线性漏桶模型是有效的；而对于聚集程度较高的TCP流，用分形漏桶模型来描述其流量则比较合适．     

Partial evaluation of Maple

Having been convinced of the potential benefits of partial evaluation, we wanted to apply these techniques to code written in Maple, our Computer Algebra System of choice. Maple is a very large language, with a number of non-standard features. When we tried to implement a partial evaluator for it, we ran into a number of difficulties for which we could find no solution in the literature. Undaunted, we persevered and ultimately implemented a working partial evaluator with which we were able to very successfully conduct our experiments, first on small codes, and now on actual routines taken from Maple’s own library. Here, we document the techniques we had to invent or adapt to achieve these results.     

Stabilization by unbounded‐variation noises

In this paper, we claim the availability of deterministic noises for stabilization of the origins of dynamical systems, provided that the noises have unbounded variations. To achieve the result, we first consider the system representations of rough systems based on rough path analysis; then, we provide the notion of asymptotic stability for rough systems to analyze the stability for the systems. In the procedure, we also confirm that the system representations include stochastic differential equations; we also found that asymptotic stability for rough systems is the same property as uniform almost sure asymptotic stability provided by Bardi and Cesaroni. After the discussion, we confirm that there is a case that deterministic noises are capable of making the origin become asymptotically stable for rough systems while stochastic noises do not achieve the same stabilization results. Copyright © 2016 John Wiley & Sons, Ltd.     

ADK: An Agent Development Kit Based on a Formal Design Model for Multi-Agent Systems

The advent of multi-agent systems has brought us opportunities for the development of complex software that will serve as the infrastructure for advanced distributed applications. During the past decade, there have been many agent architectures proposed for implementing agent-based systems, and also a few efforts to formally specify agent behaviors. However, research on narrowing the gap between agent formal models and agent implementation is rare. In this paper, we propose a model-based approach to designing and implementing intelligent agents for multi-agent systems (MAS). Instead of using formal methods for the purpose of specifying agent behavior, we bring formal methods into the design phase of the agent development life cycle. Specifically, we use the formalism called agent-oriented G-net model, which is based on the G-net formalism (a type of high-level Petri net), to serve as the high-level design for intelligent agents. Based on the high-level design, we further derived the agent architecture and the detailed design for agent implementation. To demonstrate the feasibility of our approach, we developed the toolkit called ADK (Agent Development Kit) that supports rapid development of intelligent agents for multi-agent systems and we discuss the role of inheritance in agent-oriented development. As a potential solution for automated software development, we summarize the procedure to generate a model-based design of application-specific agents. Finally, to illustrate an application built on ADK, we present an air-ticket trading example.     

基于并行Benchmark的高性能机实用测试与评价方法

文中分析了传统基于并行基准测试程序测试方法的不足，针对目前高性能计算机处理机台数多的特点，给出了实用的测试方法，推广了传统加速比的概念，提出了一种可扩展性评价方法。使用文中给出的方法，可方便地对高性能计算机进行测试和性能评价，同时可以使用小规模的并行机测试结果预测大规模并行机的性能。最后给出了NPB在某高
性能计算机上的测试和性能评价结果。     

产品配置的知识表示

为按照用户的需要定制售卖产品的公司提供支持的基于知识的配置系统,产品配置器是人工智能技术的一个重要应用.本文首先描述了配置问题及其相关概念,然后分析了某些配置知识表示的优缺点,在此基础上提出了产品配置知识的图形表示方法,最后讨论了目前的一些热点研究问题.     

Cyber Security Intrusion Detection for Agriculture 4.0: Machine Learning-Based Solutions,Datasets, and Future Directions

In this paper, we review and analyze intrusion detection systems for Agriculture 4.0 cyber security. Specifically, we present cyber security threats and evaluation metrics used in the performance evaluation of an intrusion detection system for Agriculture 4.0. Then, we evaluate intrusion detection systems according to emerging technologies, including, Cloud computing, Fog/Edge computing, Network virtualization, Autonomous tractors, Drones, Internet of Things, Industrial agriculture, and Smart Grids. Based on the machine learning technique used, we provide a comprehensive classification of intrusion detection systems in each emerging technology. Furthermore, we present public datasets, and the implementation frameworks applied in the performance evaluation of intrusion detection systems for Agriculture 4.0. Finally, we outline challenges and future research directions in cyber security intrusion detection for Agriculture 4.0.      

Minimizing the stretch when scheduling flows of divisible requests

In this paper, we consider the problem of scheduling distributed biological sequence comparison applications. This problem lies in the divisible load framework with negligible communication costs. Thus far, very few results have been proposed for this model. We discuss and select relevant metrics for this framework: namely max-stretch and sum-stretch. We explain the relationship between our model and the preemptive single processor case, and we show how to extend algorithms that have been proposed in the literature for the single processor model to the divisible multi-processor problem domain. We recall known results on closely related problems, we show how to minimize the max-stretch on unrelated machines either in the divisible load model or with preemption, we derive new lower bounds on the competitive ratio of any online algorithm, we present new competitiveness results for existing algorithms, and we develop several new online heuristics. We also address the Pareto optimization of max-stretch. Then, we extensively study the performance of these algorithms and heuristics under realistic scenarios. Our study shows that all previously proposed guaranteed heuristics for max-stretch for the single processor model are inefficient in practice. In contrast, we show that our online algorithms based on linear programming are in practice near-optimal solutions for max-stretch. Our study also clearly suggests heuristics that are efficient for both metrics, although a combined optimization is in theory not possible in the general case.     

A TRAINING SIMULATION SYSTEM WITH REALISTIC AUTONOMOUS SHIP CONTROL

In this article we present a computational approach to developing effective training systems for virtual simulation environments. In particular, we focus on a Naval simulation system, used for training of conning officers. The currently existing training solutions require multiple expert personnel to control each vessel in a training scenario, or are cumbersome to use by a single instructor. The inability of current technology to provide an automated mechanism for competitive realistic boat behaviors thus compromises the goal of flexible, anytime, anywhere training. In this article we propose an approach that reduces the time and effort required for training of conning officers, by integrating novel approaches to autonomous control within a simulation environment. Our solution is to develop intelligent, autonomous controllers that drive the behavior of each boat. To increase the system's efficiency we provide a mechanism for creating such controllers, from the demonstration of a navigation expert, using a simple programming interface. In addition, our approach deals with two significant and related challenges: the realism of behavior exhibited by the automated boats and their real-time response to changes in the environment. In this article, we describe the control architecture we developed that enables the real-time response of boats and the repertoire of realistic behaviors we designed for this application. We also present our approach for facilitating the automatic authoring of training scenarios and we demonstrate the capabilities of our system with experimental results.     

Point algebras for temporal reasoning: Algorithms and complexity

We investigate the computational complexity of temporal reasoning in different time models such as totally-ordered, partially-ordered and branching time. Our main result concerns the satisfiability problem for point algebras and point algebras extended with disjunctions—for these problems, we identify all tractable subclasses. We also provide a number of additional results; for instance, we present a new time model suitable for reasoning about systems with a bounded number of unsynchronized clocks, we investigate connections with spatial reasoning and we present improved algorithms for deciding satisfiability of the tractable point algebras.