A feasibility study of a direct-mapping parallel processing method to solve linear equations in load-flow calculation

With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix.     

Computers and translation: integrating IT into undergraduate foreign language learning

Abstract There are still many institutions of higher education in the UK, both universities and polytechnics, that have not taken on board the application of information technology to foreign language learning. Apart from considerations of cost, there is also the problem of time—deciding how best to use the limited time at one's disposal for exploring computer applications to foreign language learning. Both problems may be compounded by the mistaken belief that effective use of this 'new' technology necessarily involves learning one or more programming languages. This paper endeavours to show that recent advances in both software and hardware have produced computing tools of particular interest to translation and the translator, and that, since translation is a reality for large numbers of undergraduates in the UK, such tools represent an obvious starting point for the introduction of IT into the undergraduate curriculum.     

Applications of Telos

EuLisp has an integrated object system with reflective capabilities. We discuss some example applications which use these facilities to experiment with some advanced and powerful concepts, namely, finalization, virtual shared memory and persistence. A secondary goal is to attempt to illustrate the additional possibilities of metaobject programming over non-metalevel techniques.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

基于NIOSⅡ的数字电子钟设计与实现

以NioslCycloneEPIC20F400C7开发板为硬件平台,利用OuartusⅡ、SOPCBuilder和NiosⅡIDE软件设计来实现一个基于SOPC的多功能数字电子钟,该电子钟系统由FPGA部分（包括Nios11CPU核、内部定时器、Avalon总线等）、存储器部分（包括SRAM、FLASH）和外围元件部分（按键、LCD显示器）三大部分构成,经过C语言编程使该电子钟具有能够在液晶屏上显示帮助信息,具有时问、日期、状态提示的功能,并可利用4个按键对时间（小时和分钟）、日期（年月日）进行设置（包括退出设置）。经测试该电子钟具有较好的时间精度。     

Two legs, thing using and talking: The origins of the creative engineering mind

Instead of seeing technology as outside ourselves, it is argued that it is an innate human function and the main driving force in human evolution. Opportunistic thing using, long before stone tools appeared, was the likeliest cause of bipedalism. It also forced brain development and the emergence of creativity. The neural basis for this creative technical activity later provided the brain functions on which language could develop. This simple unifying hypothesis has interesting implications for the way that we see technology in history, and for determinist theories of the future. It also bears on the way engineers are trained, and more important, the human faculties which need to be fostered in children.     

Quasi-rocking real-time pushdown automata

A pushdown automaton (PDA) is quasi-rocking if it preserves the stack height for no more than a bounded number of consecutive moves. Every PDA can be transformed into an equivalent one that is quasi-rocking and real-time and every finite-turn (one-turn) PDA can be transformed into an equivalent one that is quasi-rocking or real-time. The quasi-rocking [quasi-rocking in the increasing mode, and quasi-rocking in the decreasing mode] real-time restriction in finite-turn (one-turn) PDAs coincides with the double Greibach [reverse Greibach, and Greibach] form in nonterminal-bounded (linear) context-free grammars. This provides complete grammatical characterizations of quasi-rocking and/or real-time (finite-turn and one-turn) PDAs and, together with known relations and other relations proved in the present paper, yields an extended hierarchy of PDA languages. Basic decision properties for PDAs can be stated in stronger forms by using the quasi-rocking and real-time restrictions and their undecidability/decidability status rests on the way PDAs quasi-rock.     

基于VB的学生信息管理系统的设计

在VB6.0环境下,通过连接Access2000数据库,建立了一个学生管理系统。在这个系统里,可以实现学生学号,姓名,年龄,联系方式,照片等各种信息的录入,精确查找,模糊查找,更新,删除等操作。从程序的界面设计到源代码,都做了详尽的说明,适合初学者快速掌握信息管理系统开发的步骤。