高级计算器切线迭代法的计算程序

目的:编制切线迭代法的计算程序,提供一种简单的计算方法。方法:使用CASIO?χ-3600 P计算器,利用M、K寄存器输入程序变量,直接按P1键运行程序。结果:第一次输入变量进行运算得出结果后,程序内自动生成全部变量,下一轮计算变量零输入,快速得到X值。结论:切线迭代法的计算程序,解决了烦琐复杂的循环计算问题,满足了平均发展速度计算工作的需要,具有操作简单、运算方便、结果准确的优点。     

智能交通系统消息交换的复杂度研究

针对道路上自动化管理的智能交通难题,利用车辆无线传感器网络对车位检测的辅助定位进行了研究,阐述了基于无线传感器网络的智能交通在提高车辆行驶的安全和效率方面的优势。首先讨论无线传感器网络技术在交通道路系统中的整体应用以及该技术在国内外的发展现状以及分析;然后讨论交通道路传感器网络系统的总体概述;接着对车辆传感器网络辅助定位的理论进行了深入的分析、数据的计算;最后详细地给出了计算车辆传感器网络广播协议的消息传输总时间复杂度的公式。     

Human systems design criteria: State of the art[1979] and future perspectives

This paper deals with the problem of designing more humanised computer systems. This problem can be formally described as the need for defining human design criteria, which — if used in the design process - will secure that the systems designed get the relevant qualities. That is not only the necessary functional qualities but also the needed human qualities.The author's main argument is, that the design process should be a dialectical synthesis of the two points of view: Man as a System Component, and System as Man's Environment. Based on a man's presentation of the state of the art a set of design criteria is suggested and their relevance discussed.The point is to focus on the operator rather than on the computer. The crucial question is not to program the computer to work on its own conditions, but to “program” the operator to function on human conditions.     

Reconstruction of multi-view compressed imaging using weighted total variation

This paper concentrates on the problem of image reconstruction from compressed sensing (CS) measurements in multi-view compressed imaging systems, where each view is acquired independently by CS technique. In order to take advantage of both the inter-view correlation and the spatial prior information in multi-view image sets, a weighted total variation (TV) regularized model, which combines the TV norm of a target view and the TV norm of the corresponding residual, is proposed. To efficiently solve the weighted TV regularization constrained problem, novel algorithms are presented for both the anisotropy TV and the isotropy TV cases. Given the multi-view CS measurements, a sliding window-based recovery framework is also developed to work with the weighted TV-based reconstruction algorithms and produce high-quality results. We show by experiments that the proposed methods greatly outperform the straight forward reconstruction which applies view by view image reconstruction independently, and also have significant advantages over other benchmark methods.     

Supporting Distributed Spatial Collaboration: An Investigation of Navigation and Radar View Techniques

Spatial collaboration is a complex problem where people work together within the context of a large, physical place. Our work investigates ways to support distributed, synchronous, spatial collaboration activities. We have conducted an experiment to examine techniques for supporting individual navigation and providing awareness information to the distributed users. Using a collaborative, two-dimensional map interface, we examined continuous and discrete styles of navigation as well as traditional and novel radar view techniques. The results revealed the advantages of continuous navigation, the issues inherent with discrete navigation, and the potential for novel radar view designs. We present the lessons learned from this study as well as some of the issues to consider in designing a spatial collaboration application.     

A computer simulation in surgery for a human hip joint

For patients who have early signs of hip joint disease resulting from a structural abnormality, various surgeries for correcting abnormal stress distribution can be useful to prevent the progression of the disease. However, it is difficult to confirm the optimal procedure for surgery. To deal with this problem, we devised a computer program to support preoperative planning. Hip images obtained by computed tomography were loaded into our program, and a three-dimensional voxel model was created. Then the pressure distribution on the hip joint was analyzed with a rigid-body spring analysis (computational nonlinear mechanical analysis). This system has a module for performing virtual surgery. This program allows the hip joint mechanics to be evaluated easily, so that the advantages and disadvantages of various surgical methods can be examined biomechanically prior to surgery. However, this system has several problems that should be solved in the near future. This work was presented in part at the 12th International Symposium on Artifi cial Life and Robotics, Oita, Japan, January 25–27, 2007     

Geometric Model Checking: An Automatic Verification Technique for Loop and Data Reuse Transformations

Optimizing programs by applying source-to-source transformations is a prevalent practice among programmers. Particularly so, in the framework of methodology based embedded systems design, where the initial program is subject to a series of transformations to optimize computation and communication. In the context of parallelization and custom memory design, such transformations are applied on the loop structures and index expressions of array variables in the program, more often manually than with a tool, leading to the non-trivial problem of checking their correctness. Applied transformations are semantics preserving if the transformed program is functionally equivalent to the initial program from the input-output point of view. In this work we present an automatic technique based on geometrical program modeling to formally check the functional equivalence of initial and transformed programs under loop and data reuse transformations. Our technique also provides very useful diagnostics to locate the detected errors.     

工作团队视角看递归

递归是程序设计中一种重要的思想方法。递归算法代码量小、求解思路清晰,解决复杂问题的方案优雅而简洁,但递归算法难以掌握。结合实例以工作团队的视角进行递归算法设计,提出首先保证正确设计递归算法然后再分析递归执行过程的教学思路,在教学实践中取得良好效果。     

工作团队视角看递归

递归是程序设计中一种重要的思想方法。递归算法代码量小、求解思路清晰,解决复杂问题的方案优雅而简洁,但递归算法难以掌握。结合实例以工作团队的视角进行递归算法设计,提出首先保证正确设计递归算法然后再分析递归执行过程的教学思路,在教学实践中取得良好效果。     

结合三维视景的控制系统仿真

介绍了一种基于VC和Matlab的采样控制系统仿真。它以Matlab控制系统工具箱函数为基础,通过Matlab引擎技术建立VC与Matlab的通信渠道,获得控制系统的等价线性模型。在VC程序中将控制系统的仿真过程以采样周期为时间单位拆成单步进行仿真,并在仿真中嵌入三维视景语句,依据每步的仿真结果更新视景画面,从而获得控制系统仿真在三维视景中的实时表现。集成后的软件不仅能充分发挥VC与Matlab各自的优点,还可以应用视景软件表现逼真连续的三维画面。提供的实现过程和编程实例均说明此方法简单、方便、可操作性强。     

面向对象方法在流化催化裂化动态系统仿真中的应用（Ⅰ）──系统结构和数学模型

本文完成了流化催化裂化（ＦｌｕｉｄｉｚｅｄＣａｔａｌｙｔｉｃＣｒａｃｋｉｎｇ，简称ＦＣＣ）动态系统结构描述、模型构造和仿真分析这三部分工作。作者首次将面向对象程序设计方法中的面向对象机制应用于ＦＣＣ动态系统仿真问题中，并为之建立了一个抽象通用的类层次。使用当今最为流行的ＴｕｒｂｏＣ＋＋面向对象语言开发了ＦＣＣ动态系统仿真程序。该程序设计过程直观清晰、层次分明，具有易阅读、易维护、易扩充和通用性强的特点。仿真分析结果表明本文作者在ＦＣＣ动态系统仿真程序开发过程中引入面向对象机制是有效、成功的。文章前一部分给出ＦＣＣ动态系统的结构描述和数学模型；文章后一部分应用面向对象方法求解ＦＣＣ动态系统仿真问题并给出仿真实例。     

Exploring the cognitive costs and benefits of using multiple-view visualisations

Multiple-view visualisations offer several advantages, such as providing different perspectives on the data. However, there are also associated cognitive costs, including the load on working memory and the effort required for comparison. Furthermore, little perception-based research has been conducted, with few answers to questions such as what tasks multiple views are best used for. Since task performance can be limited by visual attention and working memory, this article investigates how different tasks and their respective loads on attention and working memory affect the usability of two different multiple-view visualisations, namely sequential and simultaneous views. In Study 1, the effects when attention was loaded were studied, where users performed a real-time monitoring task. The results suggest that the divided attention problem was an issue with both view types, but design issues apparent with the simultaneous view were not issues with the sequential view. In Study 2, the effects when working memory was loaded were studied, where users made comparisons of different object sets. The results support the previous work on visual- and memory-based comparisons, i.e. the simultaneous view was more useful than the sequential view. The outcomes from both studies illustrate the importance of understanding how different tasks and their impact on attention and working memory can influence the usability of multiple-view visualisations.     

Meta-rules: Reasoning about control

How can we insure that knowledge embedded in a program is applied effectively? Traditionally the answer to this question has been sought in different problem solving paradigms and in different approaches to encoding and indexing knowledge. Each of these is useful with a certain variety of problem, but they all share a common problem: they become ineffective in the face of a sufficiently large knowledge base. How then can we make it possible for a system to continue to function in the face of a very large number of plausibly useful chunks of knowledge?In response to this question we propose a framework for viewing issues of knowledge indexing and retrieval, a framework that includes what appears to be a useful perspective on the concept of a strategy. We view strategies as a means of controlling invocation in situations where traditional selection mechanisms become ineffective. We examine ways to effect such control, and describe meta-rules, a means of specifying strategies which offers a number of advantages. We consider at some length how and when it is useful to reason about control, and explore the advantages meta-rules offer for doing this.     

Pocketing toolpath computation using an optimization method

This paper proposes a new method of pocketing toolpath computation based on an optimization problem with constraints. Generally, the calculated toolpath has to minimize the machining time and respect a maximal effort on the tool during machining. Using this point of view, the toolpath can be considered as the result of an optimization in which the objective is to minimize the travel time and the constraints are to check the forces applied to the tool. Thus a method based on this account and using an optimization algorithm is proposed to compute toolpaths for pocket milling. After a review of pocketing toolpath computation methods, the framework of the optimization problem is defined. A modeling of the problem is then proposed and a solving method is presented. Finally, applications and experiments on machine tools are studied to illustrate the advantages of this method.     

化工基础课堂教学及实验教学数据处理的窗体化设计

为解决化工基础课堂教学和实验教学中的数据处理难题,可利用Visual Basic6.0语言编写出处理其数据的程序。通过简单的窗体操作和程序运行,即可计算有关过程及作图,打印出所需的结果和图表。本程序可在Win9X操作平台下独立运行,操作简便、直观、图像清晰、误差小。     

基于Internet的分布式网络精馏计算系统

文章简要叙述了近10年来化工领域网络计算技术的发展状况,提出了一种基于分布式计算的网络计算模型,并将这一模型应用到化工精馏模拟计算领域。文章对分布式网络计算模型的成员结构及成员间的关系和通信方式进行了仔细分析,给出了一个模型结构框图,同时,对如何选择开发平台、开发语言和开发工具提出了一些建议。并给出了一个采用分布式网络计算模型的化工精馏模拟网络计算系统的设计实例,并列举了采用这个模型进行实际模拟计算应用的两个具体例子。最后对网络计算的发展前景做了一些展望。     

基于基本块标识方法的控制流图生成器设计

设计一个实用的程序控制流分析工具需要解决非结构程序中goto等语句的控制流图构造问题。C语言程序控制流图生成器CfgGen的设计采用基于基本块标识的控制流图构造方法解决该问题。CfgGen程序基于规则,通过语法制导翻译标识基本块、构造控制流图,易移植和维护。CfgGen构造的控制流图标识了基本块,可以很方便地用于程序分析和优化。     

基于契约的程序动态分析技术研究

在当今信息社会中，程序质量是一个具有重要意义的热点问题．基于契约的程序设计是提高程序质量的重要且有效的技术，但是形式化契约的制定是一件十分困难的工作．因此软件质量保证问题一直是令人困扰的难题．本文介绍契约式程序设计的基本概念与方法，并在此基础上，提出利用契约进行程序动态分析的主要思路及其基本过程并给出简单实例，从一种新的维度来思考保障软件质量的方法。     

基于图论的联锁程序的研究与设计

研究了作为计算机联锁系统核心的联锁程序的设计问题。分析了联锁程序需要处理的基本问题。为了将图论中解决问题的基本方法应用到这些问题的解释上，对几个最基本的概念作出严格的数学定义。在此基础之上，又对结点的封闭、释放和如何选择安全的路径作了进一步的分析。提出了一种新的联锁程序的设计思路。通过实验，验证了提出的方法是符合安全条件的。并与现行的联锁程序进行对比后发现，以该理论为基础设计的程序有数据量小，算法通用和可移植性好等诸多优点。     

Solving a real-life, large-scale energy management problem

This paper introduces a three-phase hybrid heuristic for a large-scale energy management and maintenance scheduling problem. The problem is to schedule maintenance periods and refueling amounts for nuclear power plants with a time horizon of up to five years, and handling a number of scenarios for future demand and prices. The goal is to minimize the expected total production cost. The first phase of the heuristic solves a constraint programming model of a simplified version of the problem, the second performs a local search, and the third handles overproduction in a greedy fashion. This work was initiated in the context of the ROADEF/EURO Challenge 2010. In the concluding phase of the competition, our team ranked second in the junior category and sixth overall. After correcting a small implementation bug in the program that was submitted for final evaluation, our solver ranks first in the overall results from the competition.