将非结构化的流程图转化为结构化的N-S流程图的通用算法框架

介绍了将非结构化流程图等价的转化为结构化的N-S流程图的通用算法框架。     

描述结构化程序的新方法—流线型结构化流程图

提出一种结构化程序设计中绘制流程图的新方法，运用该方法能够自然地描述结构化的程序，并具有形象直观，简洁流畅，给制方便等特点。     

基于XML的非结构化文本数据转换研究与实现

采用XML作为存储数据的中间过程,通过两次调用Java程序,使非结构化的数据结构化因为XML作为一种半结构化的语言,适合数据存储与数据转换 而Java程序可以让基于XML的非结构化数据转换成结构化的数据,使其完全的结构化.使用该Java程序,可以完成类似的非结构化数据的转换工作.     

C反编译控制流分析——非结构化代码的处理

本文分析了程序代码中四种基本的非结构化形式及在反编译控制流分析时,对这四种非结构化形式的处理。保证反编译出来的高级程序可读性好,保持原程序的结构。本文还介绍了对主要非结构化形式的结构化变换及break和Continue的C语言特性的恢复。用GoTo语句处理一些非结构化的情况。     

非结构化数据基于.NET和Oracle设计与实现

在设计和开发业务应用系统时,非结构化业务数据的设计和开发是技术难点之一。基于.NET平台和Oracle数据库Secure Files LOB技术,提供了一种很好的解决方案。该方案为非结构化和结构化数据提供一致的存储管理和统一技术开发模式,同时为业务系统提供高并发性、高稳定性和高扩展性。     

透视C程序设计语言

从三个不同侧面透视了C高级程序设计语言:"结构化"的程序设计语言;"函数式"的程序设计语言;"面向过程"的程序设计语言。论述了C程序设计语言面向过程的模块化编程思想、用其编程解决实际问题的一般思路和具体程序中的实现形式,同时,总结了上述三个方面的内在联系和它们的统一性。得出了C高级程序设计语言的优点和其强大的生命力,具有较高的概括性和理论意义,对于学习和研究C程序设计语言提供了一个很好的典型案例。     

基于非结构化数据的语义建模及优化

非结构化数据是大型企业的宝贵数据资产,其基本特征是数据格式多样、数据存储分散、数据总量大、增长速度快,蕴含有提升企业管理水平的大量重要信息.非结构化数据的统一存储、集中管理与深化应用是当今大型企业信息化建设的重要方向之一.文章从非结构化数据和结构化数据的特点、可行性分析,以及对非结构化数据的重要模块语义分析建模及其优化从而高校提炼出结构化信息几个方面来讲述非结构数据的特点.从而为企业解决非结构化数据的集中存储、有效利用等技术难题,提高企业的管理.     

XML与非结构化数据管理

该文从数据的存储方式入手,列出了目前业界对非结构化数据的几种管理方式和方法,并提出了通过XML,采用"非结构化数据-半结构化数据-结构化数据"的逐步转换方式,将目前难以管理的非结构化数据转到容易管理的结构化数据的方法,达到了非结构化数据为我所用的目的。     

非结构化海量变电工程数据分类算法设计

为解决当前数据分类算法效率低的问题,提出一种非结构化海量变电工程数据的分类算法.通过构建非结构化海量变电工程数据模型,计算非结构化数据相似度,设计分类算法流程等方式,完成对算法的设计.此外,设计对比实验,证明了设计的非结构化海量变电工程数据分类算法,对于海量数据的处理效率更高,综合性能更优,可满足变电单位对数据分类处理...     

中职学校结构化程序设计的教学研究

本文以Visual FoxPro 6.0为例说明结构化程序设计在中职学校的教学现状,课堂教学中在练习题的设计和使用的技巧,从提高学生的学习成绩入手,培养学生从实际问题出发、学以致用的学习态度,突出程序设计类课程对当代中职学生在升学就业等各方面的重要性和作用。     

New format for flowcharts

This paper proposes a new chart format as an alternative for the flow diagram variety of flowchart. This new chart format is more informative, more compact and easier to use and draw than the ANS format, and facilitates modularization in design and programming. The new chart format supports restrictions on control transfers, and clearly identifies the control structures used in structured programming. The new chart format also permits showing multiple levels of detail unambiguously in a single flowchart, and enables HIPO charts and system charts to be usefully augmented.     

Staple,an experimental structured programming language

STAPLE is a structured programming language with nested block structure in the source language to indicate flow of control. The semantics of the non-control structures are essentially the same as FORTRAN. The design goals were an easily implemented, easily modified tool for experiments and demonstrations of structured versus unstructured programming techniques.     

基于MATLAB的计算机控制系统仿真程序设计

根据控制系统用方块图描述的相似性原理,系统模型在计算机里可等效为基本环节的描述。为使基本环节函数在多次调用时状态量不发生干扰,采用了全局数组和指针来存放中间状态。再由于计算机控制系统控制量离散的特点,把控制周期和仿真周期区别对待。运用MATLAB语言实现了这种结构化仿真算法,最后用一个仿人智能计算机控制系统的仿真实验证明了此程序的实用性和可行性。此程序算法设计简单,容易扩展且使用灵活、方便,可用于各种控制系统的数值仿真。     

PIGS—A system for programming with interactive graphical support

This paper describes an implementation of a system for programming using structured charts with interactive graphical support. It provides a graphical editor for the user to interactively build and edit programs using Nassi-Shneiderman diagrams (NSD)¹ as the structured control constructs of logic flow. It can interpret a program in NSD chart form, and the execution sequence of the NSD is displayed at a graphical terminal. On-line debugging and testing facilities are available which allow the user to examine and modify the program under execution. The system has been designed with the aim of supporting the development, debugging, testing, documentation and maintenance of programs in the same environment.     

The application of prolog to structured design

In this paper, we investigate the feasibility of applying logic programming to structured design. We propose to use Prolog as a common machinery for the representation of various structured tools. We illustrate through examples how to produce structure charts from data flow diagrams, and evaluate them according to commonly recommended design guidelines. If the structure charts produced are not satisfactory, the inherent backtracking mechanism in Prolog will help to produce other versions for further evaluation.     

结构化控制流程图（N－S图）的改进与模块化程序设计图的设想

本文简要回顾了结构化程序设计和Ｎ－Ｓ图的产生,不难看出：Ｎ－Ｓ图是应结构化程序设计的需要而产生的。近年来模块化结构化程序设计思想有了新的发展,本文正是为了适应新的情况,在反复推敲与使用的基础上,第一,提出了结构化控制流程图的改进方案,它比Ｎ－Ｓ图有更高的集成度,表示能力更强,使得用图形表示算法更方便;第二,提出了各种模块图的方案,它可以使模块化程序设计图形化,合起来就构成了一套完整的模块化结构化程序设计盒图系统,简称ＭＳ图。     

Analysis of linear structured systems using a primal-dual algorithm

In this paper, we give a polynomial algorithm to compute the infinite structure of a structured system. A directed graph is associated with such structured systems. The infinite zero orders can be computed on the associated graph via the determination of the minimal length of vertex disjoint input-output paths. This search corresponds to a minimum cost flow determination on an appropriate directed graph. The proposed algorithm is based on the primal-dual algorithm linked to linear programming. This polynomial algorithm is one of the most efficient for this type of problem. Moreover, it allows an iterative determination of the generic infinite structure which is a key tool for solving numerous control problems.     

Teaching problem solving and structured programming in FORTRAN

This paper describes an approach to teaching problem solving in an introductory programming course using the FORTRAN language. The course is oriented around a set of problems which are used to illustrate a problem solving methodology. Three pedagogic aids (data table, flow diagram, and program system chart) and two control structure extensions to the FORTRAN language are used in order to provide a more convenient framework in which students can practice good problem solving and programming techniques. The control structure extensions facilitate structured programming in FORTRAN. The use of the control structures and the pedagogic aids is illustrated in the solution of a simple statistics problem: the benefits derived from using these aids are also discussed.     

Leave and recall: Primitives for procedural programming

Two primitives for structured programming are introduced. The primitives allow a generalized procedure entry and return similar to the ‘loop’ and ‘break’ statements found in many algorithmic languages for control in repetitive commands. Examples are given and the practicality of the primitives especially for interactive programming is stressed. Finally, the detailed implementation of the primitives is discussed; they may be implemented as procedures within an existing language.