Pascal Code Research Articles

Design and analysis of three-dimensional m-sequence bipolar OCDMA spectral amplitude code

This paper has been focused to utilize the m-sequence (matrix) code in spectral/time/spatial OCDMA domain in a bipolar mode (Three Dimensional modes). The scheme has elegantly incorporated the design of an encoder and decoder such that the system efficiently generates the code in three-dimensional bipolar mode. The decoder design is such that it effectively suppresses the multiple user interference (MUI) of three-dimensional code. System analyses are carried for defining the BER performance variation with users acceptability and received power. The observed results demonstrate that the cardinality of m- matrix three-dimensional bipolar code is larger than the existing 3D Pascal code, 2D-MDW, 3D-PDC, 2D-PDC, 1D-CWH and 1D-MS codes. The received power in proposed system is − 5.8 dBm lesser than the 3D Pascal Code at 10–18 BER and the users in system more than 210% can be accomplished as compared to 3D Pascal code.

A Wiener–Kolmogorov Filter for Seasonal Adjustment and the Cholesky Decomposition of a Toeplitz Matrix

A flexible method for removing the seasonal fluctuations from economic data is described. It can be used to remove not only the elements at the seasonal frequencies but also the adjacent elements, which may contribute significantly to the seasonal fluctuations but which are liable to be only mildly attenuated by the usual filters. The program employs a specialized version of a Cholesky decomposition, which is adapted to the case of a narrow-band Toeplitz matrix, in which each band contains a unique repeated element and where the number of bands is considerably less than the order of the matrix, which is assumed to be large. The Pascal code of this algorithm is presented here together with that of some accompanying procedures.

Improvements on Evaluation Functions of a Probabilistic Fracture Mechanics Analysis Code for Reactor Pressure Vessels

Abstract In Japan, a probabilistic fracture mechanics (PFM) analysis code PASCAL was developed for structural integrity assessment of reactor pressure vessels (RPVs) considering neutron irradiation embrittlement and pressurized thermal shock (PTS) events. By reflecting the latest knowledge and findings, the evaluation functions are continuously improved and have been incorporated into PASCAL4 which is the most recent version of the PASCAL code. In this paper, the improvements made in PASCAL4 are explained in detail, such as the evaluation model of warm prestressing (WPS) effect, evaluation function of confidence levels for PFM analysis results by considering the epistemic and aleatory uncertainties in probabilistic variables, the recent stress intensity factor (KI) solutions, and improved methods for KI calculations when considering complicated stress distributions. Moreover, using PASCAL4, PFM analysis examples considering these improvements are presented.

Reliability & Sensitivity Analysis of IKR Regional power Network

This paper presents a developed algorithm for reliability sensitivity analysis of engineering networks‥ Reliability Modeling is proposed for the Iraqi Kurdistan Regional Power Network (IKRPN) using Symbolic Reliability function of the model. The written Pascal code for the developed algorithm finds efficiently path sets and cut sets of the model. Reliability and Unreliability indices are found. The sensitivity of these indices are found with respect to the variation of the network's elements reliabilities

Reliability & Sensitivity Analysis of IKR Regional power Network

This paper presents a developed algorithm for reliability sensitivity analysis of engineering networks. Reliability Modeling is proposed for the Iraqi Kurdistan Regional Power Network (IKRPN) using Symbolic Reliability function of the model. The written Pascal code for the developed algorithm finds efficiently path sets and cut sets of the model. Reliability and Unreliability indices are found. The sensitivity of these indices are found with respect to the variation of the network’s elements reliabilities.

Modelling intrusion detection as an allocation problem

This paper proposes to reformulate the intrusion detection problem (IDP) as an allocation problem that allows the user to detect known attack patterns. Many methods and techniques were used for modeling the IDP, but some of them contribute little or not to resolve it. Indeed, some mathematical formulations of the IDP are NP-complete, and identified only two kinds of behaviours (normal and attack). This motivates some researchers to use genetic algorithms to solve these IDPs. The proposal developed in this paper aims to present a new mathematical formulation of the IDP that detects any known attack pattern without recourse to learning techniques like genetic algorithms. Our approach is based on the formulation of the IDP as an allocation problem, which can be rewritten in a polynomial form that makes it easy to solve. A Pascal code tool was developed to achieve some experiments. Our experiments show that our approach is very competitive with respect to some previous works.

Deciphering the hidden Pascal code of Guggenheims quasichemical model. Overcoming computational limitations by use of Pascal’s triangle

A general description is given of the mathematical modelling of physical properties of liquid mixtures, with an emphasis on the early progress in mathematical representation of mixtures’ thermodynamics. The core issue is employing long polynomials to represent mixing data accurately, without having to optimise a large number of independent parameters. This is for instance done by deriving the long polynomials from explicit (analytical) models with few independent parameters. It is shown that this field evolved not by gradual changes in model complexity and accuracy, but rather in bursts, followed by pausing for several years or decades whenever researchers hit computational or conceptual limitations. One such limitation that still exists is the Taylor expansion of the above mentioned analytical models. This article presents a novel use of Pascal’s triangle that turns this computationally “hard” problem into a trivial iterative procedure, suitable for standard office spreadsheets. The process of transforming this hard problem into a soft problem may be described as deciphering. The present author conjectures that for every parametric function for which a polynomial expansion can be made, there is a corresponding coefficient pattern involving Pascal’s triangle and/or other binomial sequences and matrices.

BIFURCATION AND CHAOS IN A COMPLEX MODEL OF DISSIPATIVE MEDIUM

In this paper, we carefully reexamine the chaotic RF model, first studied by Rabinovich and Fabrikant [1979], and have found many new and rich complex dynamics of the model that were mostly not reported before. The chaotic RF model has proved to be a great challenge to classical numerical methods, in the sense that most classical numerical methods have not been very successful in the study of complex dynamics of this special RF model. Therefore, in this paper, we present and apply a special numerical method, the Local Iterative Linearization (LIL) method, along with a special Turbo Pascal code based on this accurate LIL algorithm, for a careful numerical study of this complex RF model. Many interesting new findings are summarized and reported in this paper.

A computer program for the simulation of folds of different sizes under the influence of gravity

Folding&g is a computer program, based on the finite element method, developed to simulate the process of natural folding from small to large scales in two dimensions. Written in Pascal code and compiled with Borland Delphi 3.0, the program has a friendly interactive user interface and can be used for research as well as educational purposes. Four main menu options allow the user to import or to build and to save a model data file, select the type of graphic output, introduce and modify several physical parameters and enter the calculation routines. The program employs isoparametric, initially rectangular elements with eight nodes, which can sustain large deformations. The mathematical procedure is based on the elasticity equations, but has been modified to simulate a viscous rheology, either linear or of power-law type. The parameters to be introduced include either the linear viscosity, or, when the viscosity is non-linear, the material constant, activation energy, temperature and power of the differential stress. All the parameters can be set by rows, which simulate layers. A toggle permits gravity to be introduced into the calculations. In this case, the density of the different rows must be specified, and the sizes of the finite elements and of the whole model become meaningful. Viscosity values can also be assigned to blocks of several rows and columns, which permits the modelling of heterogeneities such as rectangular areas of high strength, which can be used to simulate shearing components interfering with the buckling process. The program is applied to several cases of folding, including a single competent bed and multilayers, and its results compared with analytical and experimental results. The influence of gravity is illustrated by the modelling of diapiric structures and of a large recumbent fold.

A method for estimating code key‐in times of college students

A time estimation method for manual code entry is proposed. It estimates the reasonable time required for the students to key in their own code written in Pascal programming language. Actual time needed to key in varies depending on their knowledge, but this method does not estimate an individual student's manual entry time. For example, reasonable time means that 75% of the students finish their work within it. We are not interested in knowing every student's manual entry time. The features of our estimation process are as follows: First, the short parts of the Pascal code named reading units (RUs) were defined. It was assumed that all students read a code and type keys with every reading unit (RU). RUs were fixed for all students. Second, Method Time Measurement (MTM) was adopted to determine the time required for the basic elemental motions of manual entry operation. MTM is one of the Predetermined Time Standard (PTS) methods and is usually applied to the field of industrial work studies. Third, only s...

An integrated computer-based dryer simulator

A software package for steady-state simulation of drying processes is described. A brief review of the simulator structure, along with an outline of its operation is presented. User input to the simulator consists of three parts; the flowsheet description-ie, the process units and the streams connecting them; the design problem data-ie, the feed stream data, the specifications of unit design variables and major economic figures concerning cost; the convergence algorithm specifications-ie, the tear streams and an initial guess for their values. This information is passed to the simulator by means of an appropriate user interface developed in object-oriented Pascal code on an Apple Macintosh computer. This part of the program is then introduced into the execution part of the simulator, performing all the necessary flowsheet computations. A case study is also presented for the design of a dehydration plant for vegetable drying.

Tachistoscopic presentation and millisecond timing on the IBM PC/XT/AT and PS/2: A Turbo Pascal unit to provide general-purpose routines for CGA, Hercules, EGA, and VGA monitors

A review of the literature on adopting microcomputers for use in tachistoscopic research paradigms illustrates the need for a comprehensive package to effectively deal with the wide variety of video displays and microcomputers used in experimental settings. In addition, because of the large number of possible configurations created when video displays and computer systems are combined, there is a need to be able to efficiently drive any such combination without rewriting program code. A Turbo Pascal unit is presented to provide standard tachistoseopic routines compatible with monochrome, CGA, Hercules, EGA, and VGA video technology. Procedures that synchronize both text and graphics mode stimuli with the vertical retrace pulse are given, as are routines to provide access to a timer with better than millisecond precision. Pascal code is described that will run on the IBM PC, XT, AT, or PS/2, as well as on any compatible machine. The versatility of the unit allows the experimenter to use generic video and timer commands that will automatically adapt at run time to the system that is being used, without further experimenter intervention.

PASCAL simulation for packet switching computer networks

This paper is concerned with the development of modular PASCAL simulation tools for the investigation of packet switching computer networks. For this purpose, the paper presents a flexible packet switching network model in terms of structure, performance measures, activities and timing rules. The paper describes how this model has been transformed into PASCAL code, making use of PASCAL special features. To illustrate the use of the resulting tools, the paper presents an investigation of a simple packet switching network of three nodes. The tools would be useful to students and researchers in the field.

An algorithm and Pascal program for geostatistical mapping

A general model for generating statistically optimal estimates is presented, together with an accompanying Pascal program developed for solution on a microcomputer. The model, based on the theory of objective analysis, is a powerful tool to estimate mapped data fields based on scattered point observations. The special feature of the method is its ability to quantify the accuracy of the estimates, allowing determination of an associated error field. The Pascal code for the model and sample input and output are provided. The code is implemented easily and modified.

Discipline Pascal with descriptive environment; precise writing to learn programming and to avoid errors

Dijkstra's article “On the cruelty of really teaching computing science” [l] has encouraged me to review my thoughts and experience. In the teaching environments of an introductory programming course (CS1, CS2 and others), I have discovered a mental gap in the minds of some students, which has often led to difficulties in class. A Pascal statement contains highly condensed information. In order to deal with this type of information, the students must apply a certain thinking level. In a Pascal statement, much information is concealed behind the written words. For example, consider a variable in a program. The data type and locality of the variable are not explicitly expressed in a statement. In other words, this condensed information is hiding, e.g. invisible. Hence a degree of the student's ability to focus on it may fade away in his mind. If programming code demands writing precise information in a statement then the student's difficulty may be alleviated because he can see it. This would be an attempt to narrow the gap by writing Discipline Pascal code closer to the precise thinking level. I believe that this proposal would also bring benefits to experienced programmers.

Development tools for educational software: Open-ended software and creative programming tools

As part of a scheme to introduce computers into education in Norway, tools have been developed to simplify the production of educational software. This development was promoted by the ministerial task force “Datasekretariatet”. The first tool developed was Mosaikk. Originally, it was meant for prototyping user interfaces, but it was later extended to become a very powerful tool, integrating many functions. The simulation and modelling tool-set SimTek was developed next. It generates Pascal or other source code programs. The third tool to be developed was The Director, an editing tool for the production of adventure games and interactive literature programs. Graf-Trix was developed to enhance quality and portability of graphics software and to simplify programming. Not only have all these tools been used efficiently in the development of such applications as Aims and Noah's Problem, but also, being open-ended and interactive, they have supported new methods of teaching. At the moment, there is an interesting project in the Nordic countries, where, in the area of ‘System Dynamics and Simulation’, a pedagogical method is used to integrate several subject areas. This method is supported by the use of SimTek as a modelling tool, which enables students to explore and handle the complexity of dynamic systems. One of the strong points of Mosaikk is the capability to integrate other tools and programs, rendering it a very useful tool for multi-media presentations, including interactive video, graphics, communication, databases, etc. Presentation of text and graphics on screen and printers is facilitated by the use of the Post-Script standard.

GENPLOT: A formula-based Pascal program for data manipulation and plotting

Geochemical processes involving alteration, differentiation, fractionation, or migration of elements may be elucidated by a number of discrimination or variation diagrams (e.g., AFM, Harker, Pearce, and many others). The construction of these diagrams involves arithmetic combination of selective elements (involving major, minor, or trace elements). GENPLOT utilizes a formula-based algorithm (an expression parser) which enables the program to manipulate multiparameter databases and plot XY, ternary, tetrahedron, and REE type plots without needing to change either the source code or rearranging databases. Formulae may be any quadratic expression whose variables are the column headings of the data matrix. A full-screen editor with limited equations and arithmetic functions (spreadsheet) has been incorporated into the program to aid data entry and editing. Data are stored as ASCII files to facilitate interchange of data between other programs and computers. GENPLOT was developed in Turbo Pascal for the IBM and compatible computers but also is available in Apple Pascal for the Apple Ile and Ill. Because the source code is too extensive to list here (about 5200 lines of Pascal code), the expression parsing routine, which is central to GENPLOT's flexibility is incorporated into a smaller demonstration program named SOLVE. The following paper includes a discussion on how the expression parser works and a detailed description of GENPLOT's capabilities.

A technique for automatically porting dialects of pascal to each other

In the course of programming events, there have been those who have found it necessary to write Pascal code that could be ported between dialects of Pascal which differ from machine to machine. This task cannot be accomplished just by writing "vanilla" code to a maximal degree, as there are inevitably syntactical and semantic differences from one dialect to another. We have developed a technique which, in conjunction with vanilla code, allows translation from one dialect to another to be performed automatically. Since it is generally the case that when a file of program text needs to be translated to a new dialect it also needs to be transmitted to a physically separate computer, our translation utility exists in two forms: a stand-alone translation utility, and a combination translation/transmission utility.

Distribution counting as a method for sorting test scores

Distribution counting is a special-purpose algorithm for sorting integers that range from zero to a known maximum (Sedgewick, 1983). In psychology, the algorithm can be used in programs that produce summary results of objective tests, in which scores can range from zero to the number of items, and in similar item-analysis programs. For these types of applications, distribution counting has at least three advantages relative to generalpurpose sorting algorithms such as shellsort and quicksort. The first advantage is simplicity. A BASIC translation of a modified version of Sedgewick's (1983) Pascal code, implemented in Optimized Systems Software, Inc., BASIC XL, on a 6502-based Atari 8oo microcomputer, consists of straightforward code (see Listing 1). The algorithm actually sorts data by using cumulative frequencies as array indexes. For example, if the cumulative frequency of the ith score is k, then its sorted position is the kth element of the array Score. Once the ith score has been assigned to its sorted position, its associated cumulative frequency is decremented by 1. That is, there are now (k 1) unsorted scores with a value less than or equal to the ith score. Thus, the array index for the next score equal to the ith will be (k 1), the index of the next will be (k 2), and so on. Repeating this process for each score will sort an array into ascending order. The version of the algorithm presented here differs from Sedgewick's (1983) in two ways. First, Sedgewick's version requires two passes through the data to read the data and tally their frequencies. The version presented here does both on the same pass. Second, in Sedgewick's version, the data are read into the array Score, sorted into the array Temp, and then read back into the array Score. To eliminate another pass through the data, the present version reads the data into the array Temp and sorts them directly into the array Score. However, if the data are resident in the array Score prior to being sorted (e.g., in an interactive program), they will have to be read into the array Temp before being sorted; and the benefit of this modification will be lost. The second advantage of the algorithm is that it produces as intermediate results both frequency and cumulative frequency distributions, often required in testing applications. Although the basic version of the algorithm maintains only the cumulative distribution at the termination of a sort, it can be easily modified to maintain both.

SARTEX a programming language for graph processing

SARTEX [1] is a programming language, designed especially for graph processing, which belongs to the PASCAL [2] family of languages. A compiler written in PASCAL which generates PASCAL code has been developed. In addition to the usual data types, the language provides the predefined types VERTEX, ARC and GRAPH. Objects can be organized in dynamic structured types named stack, list, set and array . For visiting the elements of a structured object, the usual statements are completed by the instruction " forall ... in ... do ...". Inputs and outputs can be processed interactively or with sequential files as data. The language also directly supports the drawing of graphs on a graphic device.