Dual–primal proximal point algorithms for extended convex programming

This paper presents a class of dual–primal proximal point algorithms (PPAs) for extended convex programming with linear constraints. By choosing appropriate proximal regularization matrices, the application of the general PPA to the equivalent variational inequality of the extended convex programming with linear constraints can result in easy proximal subproblems. In theory, the sequence generated by the general PPA may fail to converge since the proximal regularization matrix is asymmetric sometimes. So we construct descent directions derived from the solution obtained by the general PPA. Different step lengths and descent directions are chosen with the negligible additional computational load. The global convergence of the new algorithms is proved easily based on the fact that the sequences generated are Fejér monotone. Furthermore, we provide a simple proof for the O(1/t) convergence rate of these algorithms.     

Evolutionary circuit design for fast FPGA-based classification of network application protocols

The evolutionary design can produce fast and efficient implementations of digital circuits. It is shown in this paper how evolved circuits, optimized for the latency and area, can increase the throughput of a manually designed classifier of application protocols. The classifier is intended for high speed networks operating at 100 Gbps. Because a very low latency is the main design constraint, the classifier is constructed as a combinational circuit in a field programmable gate array (FPGA). The classification is performed using the first packet carrying the application payload. The improvements in latency (and area) obtained by Cartesian genetic programming are validated using a professional FPGA design tool. The quality of classification is evaluated by means of real network data. All results are compared with commonly used classifiers based on regular expressions describing application protocols.     

有关C语言教学方法优化的探讨

C语言程序设计是一门重要的课程,却难学难教。教学方法优化十分必要。教学方法优化应从激发学生兴趣入手,采用循序渐进的方式,着重培养学生举一反三的编程能力,引导学生写出高质量的程序,并丰富考核方式。     

计算机编程语言与输入设备的发展问题初探

现代化建设事业的发展离不开计算机水平的提高。计算机编程语言作为人与机器沟通的桥梁,在计算机系统里有着非常重要的地位。本文从探讨计算机编程语言的概念出发,详细阐述了计算机编程语言所包含的内容和基本分类。接着笔者又深入分析了计算机输入设备的发展问题。最后,针对计算机编程语言和输入之间的联系问题,笔者做了观点性和理论性的论述分析。     

A fast updated algorithm to maintain the discovered high-utility itemsets for transaction modification

High-utility itemsets mining (HUIM) is a critical issue which concerns not only the occurrence frequencies of itemsets in association-rule mining (ARM), but also the factors of quantity and profit in real-life applications. Many algorithms have been developed to efficiently mine high-utility itemsets (HUIs) from a static database. Discovered HUIs may become invalid or new HUIs may arise when transactions are inserted, deleted or modified. Existing approaches are required to re-process the updated database and re-mine HUIs each time, as previously discovered HUIs are not maintained. Previously, a pre-large concept was proposed to efficiently maintain and update the discovered information in ARM, which cannot be directly applied into HUIM. In this paper, a maintenance (PRE-HUI-MOD) algorithm with transaction modification based on a new pre-large strategy is presented to efficiently maintain and update the discovered HUIs. When the transactions are consequentially modified from the original database, the discovered information is divided into three parts with nine cases. A specific procedure is then performed to maintain and update the discovered information for each case. Based on the designed PRE-HUI-MOD algorithm, it is unnecessary to rescan original database until the accumulative total utility of the modified transactions achieves the designed safety bound, which can greatly reduce the computations of multiple database scans when compared to the batch-mode approaches.     

TAPI软电话通信系统的模块化设计

首先分析了TAPI协议的结构、通信编程原理和编程应用环境,重点介绍了TAPI协议的层次化模型结构及其模块化设计方法,该方法可以对进一步研究和开发TAPI软电话应用产品提供借鉴。     

技术防范电信欠费

电信用户欠费是当今电信业者面临的日益严峻的问题,本文主要阐述如何利用电信企业拥有的数据仓库,依靠技术手段分析追踪和预防用户异常行为,达到防范电信欠费的效果。     

将硬件引入“面向对象程序设计”课程实验教学

针对“面向对象程序设计”课程实验内容的设置容易使学生产生学之无用的思想及学后不会用的问题,结合电子信息专业培养特色,压缩了传统的、基本的实验内容,增加了应用性强的实验项目,并将硬件引入实验教学。实践表明,改进后的实验教学模式效果良好。     

An energy-efficient real-time scheduling scheme on dual-channel networks

The recent evolution of wireless sensor networks have yielded a demand to improve energy-efficient scheduling algorithms and energy-efficient medium access protocols. This paper proposes an energy-efficient real-time scheduling scheme that reduces power consumption and network errors on dual channel networks. The proposed scheme is based on a dynamic modulation scaling scheme which can scale the number of bits per symbol and a switching scheme which can swap the polling schedule between channels. Built on top of EDF scheduling policy, the proposed scheme enhances the power performance without violating the constraints of real-time streams. The simulation results show that the proposed scheme enhances fault-tolerance and reduces power consumption.     

Limit load and shakedown analysis of plastic structures under stochastic uncertainty

Problems from plastic analysis are based on the convex, linear or linearised yield/strength condition and the linear equilibrium equation for the stress (state) vector. In practice one has to take into account stochastic variations of several model parameters. Hence, in order to get robust maximum load factors, the structural analysis problem with random parameters must be replaced by an appropriate deterministic substitute problem. A direct approach is proposed based on the primary costs for missing carrying capacity and the recourse costs (e.g. costs for repair, compensation for weakness within the structure, damage, failure, etc.). Based on the mechanical survival conditions of plasticity theory, a quadratic error/loss criterion is developed. The minimum recourse costs can be determined then by solving an optimisation problem having a quadratic objective function and linear constraints. For each vector a(·) of model parameters and each design vector x, one obtains then an explicit representation of the “best” internal load distribution F^∗. Moreover, also the expected recourse costs can be determined explicitly. Consequently, an explicit stochastic nonlinear program results for finding a robust maximal load factor μ^∗. The analytical properties and possible solution procedures are discussed.