某航空电台外场检测仪的设计

为提高航空电台在外场的保障效率,提出了研制航空电台外场检测仪的思路和方案;根据某航空电台的测试需求,构建了航空电台及其机上接口信号模型,利用PC104、PLL、矩阵开关网络等技术设计了航空电台外场检测仪的硬件电路,编制了软件流程和测试程序代码,完成了系统的设计与调试,实现了对某电台的主要性能指标及其机上接口信号的测试;应用结果表明,该检测仪功能强、性价比高、可扩展性强、使用方便、应用广泛,已推广应用到多个单位,取得了显著的军事经济效益。     

注塑机注射速度的模型预测迭代学习控制

针对注射过程具有重复运行和非线性的特性,在对预测控制与迭代学习控制进行综合应用并加以改进的基础上,给出一种模型预测迭代学习复合控制新算法,研究了控制器的设计方案.同时,将迭代学习思想引入到预测步长的在线调整,提出了预测步长的迭代学习方法.仿真结果表明,该方法是有效的,其控制性能优于PID迭代学习控制系统.     

Contextual Resource Negotiation-Based Task Allocation and Load Balancing in Complex Software Systems

In the complex software systems, software agents always need to negotiate with other agents within their physical and social contexts when they execute tasks. Obviously, the capacity of a software agent to execute tasks is determined by not only itself but also its contextual agents; thus, the number of tasks allocated on an agent should be directly proportional to its self-owned resources as well as its contextual agents' resources. This paper presents a novel task allocation model based on the contextual resource negotiation. In the presented task allocation model, while a task comes to the software system, it is first assigned to a principal agent that has high contextual enrichment factor for the required resources; then, the principal agent will negotiate with its contextual agents to execute the assigned task. However, while multiple tasks come to the software system, it is necessary to make load balancing to avoid overconvergence of tasks at certain agents that are rich of contextual resources. Thus, this paper also presents a novel load balancing method: if there are overlarge number of tasks queued for a certain agent, the capacities of both the agent itself and its contextual agents to accept new tasks will be reduced. Therefore, in this paper, the task allocation and load balancing are implemented according to the contextual resource distribution of agents, which can be well suited for the characteristics of complex software systems; and the presented model can reduce more communication costs between allocated agents than the previous methods based on self-owned resource distribution of agents.     

Detecting Overlapping Community Structures in Networks

Community structure has been recognized as an important statistical feature of networked systems over the past decade. A lot of work has been done to discover isolated communities from a network, and the focus was on developing of algorithms with high quality and good performance. However, there is less work done on the discovery of overlapping community structure, even though it could better capture the nature of network in some real-world applications. For example, people are always provided with varying characteristics and interests, and are able to join very different communities in their social network. In this context, we present a novel overlapping community structures detecting algorithm which first finds the seed sets by the spectral partition and then extends them with a special random walks technique. At every expansion step, the modularity function Q is chosen to measure the expansion structures. The function has become one of the popular standards in community detecting and is defined in Newman and Girvan (Phys. Rev. 69:026113, 2004). We also give a theoretic analysis to the whole expansion process and prove that our algorithm gets the best community structures greedily. Extensive experiments are conducted in real-world networks with various sizes. The results show that overlapping is important to find the complete community structures and our method outperforms the C-means in quality.     

Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks

Since many applications and networks do not require or provide deterministic service guarantees, stochastic service guarantee analysis is becoming increasingly important and has attracted a lot of research attention in recent years. For this, several stochastic versions of deterministic traffic models have been proposed in the literature. Unlike previous stochastic models that are based on the traffic amount property of an input process, we present another stochastic model, generalized Stochastically Bounded Burstiness (gSBB), which is based on the virtual backlog property of the input process. We show the advantages of this approach. We study the superposition of gSBB traffic, and set up the input–output relation. Under various service disciplines, we characterize the output process for each source and investigate probabilistic upper bound on delay. Finally, we introduce a stochastic ordering monotonicity property of gSBB. With this property, we show that many well-known traffic models can be readily represented using the proposed gSBB model. These results set up the basis for a network calculus for gSBB traffic.     

2009年度12期读者推选IT企业品牌排行榜

2009年度第12期IT品牌评选活动得到众多热心读者的踊跃参与,包括全国各地的业界专家、设计院、系统集成商以及用户等专业人士。此次评选活动,共收到读者们的评选意见回馈表1026份,根据品牌认知、成功案例、价格定位、质量维护、服务支持等多项指标,评选出了十大IT品牌包括综合布线十大产品品牌,以及本次新增加的布线新锐品牌。     

Dynamic file grouping for load balancing in streaming media clustered server systems

A dynamic file grouping strategy is presented to address the load balancing problem in streaming media clustered server systems. This strategy increases the server cluster availability by balancing the workloads among the servers within a cluster. Additionally, it improves the access hit ratio of cached files in delivery servers to alleviate the limitation of I/O bandwidth of storage node. First, the load balancing problem is formulated as a two layers semi-Markov switching state-space control process. This analytic model captures the behaviors of streaming media clustered server systems accurately, and is with constructional flexibility and scalability. Then, a policy iteration based reinforcement learning algorithm is proposed to optimize the file grouping policy online. By utilizing the features of the event-driven policy, the proposed optimization algorithm is adaptive and with less computational cost. Simulation results demonstrate the effectiveness of the proposed approach. Recommended by Editor Hyun Seok Yang. This work was supported by the National Natural Science Foundation of China under grant Nos. 60774038, 60574065, National 863 HI-TECH Research & Development Plan of China under grant Nos. 2006AA01Z114, 2008AA01A317, Natural Science Foundation of Anhui Province under grant No. 070412063, Graduate Student Innovation Foundation of USTC under grant No. KD2006036, and Science Research Development Foundation of HFUT under grant No. GDBJ2008-045. Qi Jiang received the B.S. degree in Industrial Electrical Automation from Southeast University in 1989 and the Ph.D. degree in Control Science and Engineering from University of Science and Technology of China in 2008. He is currently a Post-doc in USTC. His research interests include optimization and control of stochastic dynamic systems, and performance analysis and optimization of network communication systems. Hong-Sheng Xi received the M.S. degree in Applied Mathematics from University of Science and Technology of China in 1977. He is currently a Professor in Department of Automation, USTC. His research interests include discrete event dynamic systems, performance analysis and optimization of network communication systems, robust control, and network security. Bao-Qun Yin received the B.S. degree in Mathematics from Sichuan University in 1985, the M.S. degree in Applied Mathematics and the Ph.D. degree in Pattern Recognition and Intelligent Systems from University of Science and Technology of China in 1993 and 1998, respectively. He is currently a Professor in Department of Automation, USTC. His research interests include discrete event dynamic systems, and Markov decision processes.     

AC electrokinetic pumping on symmetric electrode arrays

AC electro-osmotic (ACEO) pumping is experimentally demonstrated on a symmetric gold electrode array. Using asymmetric connection of electrodes to the applied AC voltage, spatial asymmetry along the array is created, which produces unidirectional flow of electrolyte. An aqueous solution of 100 μM KCl is selected as the pumping fluid. The liquid velocity obtained as a function of voltage and frequency is compared to that generated using travelling-wave electroosmosis (TWEO) with the same electrode array. The expected velocities from the linear electrokinetic models of ACEO and TWEO are computed numerically. The comparison shows that TWEO generates greater velocity amplitudes and the streamlines are smoother than those generated by ACEO.     

公选课教学改革的研究和实践

公共选修课设置的目的是为了拓宽学生的知识面,培养学生的多种技能,从而提高学生的综合素质,以期适应社会发展的要求。本文就公共选修课在教学上存在的问题,以"网络实用技术"公共选修课为例,提出具体的改革措施,实践证明,该措施有效地提高公共选修课教学质量。     

紧凑等离子体环整体加速过程的数值计算

紧凑等离子体环（CT）应用广泛,可以作为聚变驱动源和脉冲X射线源等,对CT加速过程的研究是其应用方面研究的基础．描述了CT加速的基本原理,基于整体加速模型导出数值模拟方程组,采用四阶龙格-库塔法数值求解此方程组．根据Phillips实验室MARADUER的参数和SHIVA—STAR电容器组参数,对CT在同轴加速器内的加速过程进行了数值模拟,定量地分析了影响加速效率的各种因素．计算结果表明：CT的质量越大、加速器越长,加速效率越高,但加速效率存在饱和趋势;电感和电阻越小,加速效率越高;对于一定的电容器初始储能,电容值较小时加速效率越高．