Metric-based reasoning about pseudocode design in the partial metrics system

The goal of the PMS project is to produce an environment in which the intelligent online assessment of the design for large-scale ADA programming projects is provided. The focus is on the representation of knowledge about the design process for an individual module. Changes in pseudocode complexity are measured in terms of partial metrics. These metrics can take the designers inferences about the pseudocode program structure into account when assessing module complexity. Next, a model of the stepwise refinement process is given which demonstrates how pseudocode elaboration decisions can be modelled in partial metric terms. Finally, the decisions associated with each refinement step for 17 example refinements taken from the computer science literature are described using partial metrics.     

Conceptual document modelling and retrieval

This paper presents the main current theoretical issues in Information Retrieval. The principles of conceptual modelling, as they have emerged in the database area, are presented and their application to document modelling in order to enhance document retrieval is discussed. Finally, the main features of the MULTOS project are presented and critically reviewed confronting them with the requirements which have been identified during the general discussion on document conceptual modelling for information retrieval.     

Granularity Analysis for Exploiting Adaptive Parallelism of Declarative Programs on Multiprocessors

1IntroductionAutomaticparallelexecutionofdeclarativelanguageprograms(e.g.functionprogramsandlogicprograms)isattractive,asitmakestheuseofparallelcomputersveryeasy,andtheprogrammerneednotbeconcernedwiththespecificsoftheunderlyingparallelarchitecture.However,ifseveralprocessorsareexecutingconcurrently,exploitingadaptiveparallelismishardduetonon-determinismoftaskgranularityanddatadependenciesamongtasks.TheearlysolutionproposedbyConeryandKibler[2]usesanorderingalgorithmtodeterminedependenciesatrun…     

Carla: A rule language for specifying communications architectures

Due to the unique requirements of a series of projects to specify communications architectures using graphical representations (Cara and MFD), we have developed the communications-oriented rule-based language Carla (Cara Rule Language), which provides an executable specification of the architecture being developed. Carla is designed to provide the ability to specify and simulate high-level, possibly incomplete, specifications of communications architectures, and to allow the developer to refine the specification through the addition of behavior-describing rules. Carla is also well-suited to creating black-box specifications of any system whose behavior depends on input/output history. We describe the features of the language, discuss various design issues, and provide examples of various communications protocols specified in Carla.     

东江河流生态评价及其修复方略

本文通过对大型无脊椎底栖动物状况的调查对东江河流水生态状况进行了分析,并在此基础上提出了生态修复方略。从上游到河口选12个点采集底栖动物样本,发现东江流域底栖动物生物多样性在上游和中游保持在较高水平,而到下游则迅速降低到零。对增江湾、西枝江牛轭湖等处的取样进行分析并探讨改善东江生态的方法。针对不同生态应力提出了3种生态修复方略:1.创造多样性的生物栖息地,开发和形成一系列类似增江湾那样的缓流滞流区,把已经隔离的牛轭湖和江边湖泊湿地重新与江水连通;2.调整大坝运用方式,采取大坝泄放的流量逐渐增加和减少的方式,给生物发出流速增大和降低的信号,使其得以准备和躲避;3.稳定岸坡、控制侵蚀、保护和发育河边植被。     

栏栅式山溪取水工程取水特性的试验研究

通过水工模型试验，对栏栅式山溪取水工程的取水特性进行了研究，探讨了在有足够大的集水廊道的前提下，该取水工程的潜在取水能力。结果表明，在影响栏栅取水量的诸因素中，栅条长度、栅隙和栏栅的设置角度对取水量的影响程度不同；其取水量主要由栏栅的设置角度决定，而栅条长度和栅隙对取水量的影响程度较小；栏栅的设置角度小于50°时，栏栅有较大的引水比，栏栅的设置角度大于50°后，栏栅的引水比大幅度下降。     

Quantum automata for some multiperiodic languages

We exhibit small size measure-once one-way quantum finite automata (mo-1qfa’s) inducing multiperiodic stochastic events. Moreover, for certain classes of multiperiodic languages, we exhibit: (i) isolated cut point mo-1qfa’s whose size logarithmically depends on the periods; (ii) Monte Carlo mo-1qfa’s whose size logarithmically depends on the periods and polynomially on the inverse of the error probability.     

Obtaining shorter regular expressions from finite-state automata

We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs). Although state elimination is an intuitive method for computing regular expressions from FAs, the resulting regular expressions are often very long and complicated. We examine the minimization of FAs to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given FAs. We prove that we should not eliminate bridge states until we eliminate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that leads to shorter regular expressions based on vertical chopping and horizontal chopping.     

汛期采金船的缆绳牵拉

本文介绍了采金船渡汛时的停泊方向及采金船在洪水中可能产生拖曳力的估算方法，为了防止采金船汛期发生溜船事故，建议采用缆绳牵拉固船的措施，以保障采金船的汛期安全。