A reactive extension of the OpenMusic visual programming language

Objectives: OpenMusic (OM) is a domain-specific visual programming language designed for computer-aided music composition. This language based on Common Lisp allows composers to develop functional processes generating or transforming musical data, and to execute them locally by demand-driven evaluations. As most historical computer-aided composition environments, OM relies on a transformational declarative paradigm, which is hard to conciliate with reactive data-flow (an evaluation scheme more adequate to the development of interactive systems). We propose to link these two evaluation paradigms in the same and consistent visual programming framework.Methods: We establish a denotational semantics of the visual language, which gives account for its demand-driven evaluation mechanism and the incremental construction of programs. We then extend this semantics to enable reactive computations in the functional graphs.Results: The resulting language merges data-driven executions with the existing demand-driven mechanism. A conservative implementation is proposed.Conclusions: We show that the incremental construction of programs and their data-driven and demand-driven evaluations can be smoothly integrated in the visual programming workflow. This integration allows for the propagation of changes in the programs, and the evaluation of graphically designed functional expressions as a response to external events, a first step in bridging the gap between computer-assisted composition environments and real-time musical systems.     

智能电网中电动汽车充电的自适应电价控制方法

针对电动汽车的充电提出一种电价控制策略。聚合管理者集中管理电动汽车的电池,并且考虑用电高峰时电网的电能供给有限,通过电价控制调整充电的需求量。采用自适应动态规划,通过在线网络训练,得到最优的电价策略。仿真结果表明,该自适应电价控制方法能够通过学习电动汽车的移动性和充电过程,从而调整实际充电需求量至期望水平,保证智能电网的稳定运行。     

符号几何规划问题的求解新方法

对符号几何规划问题,给出一种求其全局最优解的分支定界算法。利用不同的凸化方法将算法中关键的定下界操作转化为易于求解的凸规划问题。最后给出算法的收敛性证明和数值实验结果。     

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

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

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

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

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

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

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

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.