Spelling suggestions: "subject:"computer programming"" "subject:"aomputer programming""
31 
A graphicsoriented operating system for a small computer /Campbell, Kenneth Craig January 1974 (has links)
No description available.

32 
Avoca: An environment for programming with protocols.O'Malley, Sean William. January 1990 (has links)
This dissertation addresses three fundamental problems with the network software as it is currently designed and implemented: the poor performance of high modular (or layered) protocols, network software's inability to keep up with the rapid changes in the networking technology and applications demands, and the inordinate amount of time it takes to produce new network protocols. These problems are solved through the use of a new platform for the implementation and execution of network protocols, a new methodology for the design of network protocols and a new network architecture a new network architecture. Avoca is the result of taking a coordinated approach to network software design, implementation, and standardization and consists of three parts: the Avoca platform, the Avoca methodology and the Avoca Network Architecture. The Avoca platform is a small operating systems kernel designed from scratch to implement network protocols efficiently. The Avoca methodology (or MetaProtocol) is set of rules governing the design and implementation of network protocols implemented on the Avoca platform. The Avoca Network Architecture is a novel architecture explicitly designed to support the rapidly changing networking environment. Using Avoca highly layered network software can be implemented efficiently. Avoca proves that modularity is not inherently slow. Avoca supports the encapsulation, underspecification, composition and reuse of protocols will demonstrated. Avoca shows that network software is amenable to the use of software engineering techniques to improve the protocol implementation process. Finally, Avoca demonstrates that a network architecture flexible enough to support a rapidly changing networking environment is possible.

33 
COMPUTER AIDED PROCESS ORGANIZATION IN SOFTWARE DESIGN.KARIMI, JAHANGIR. January 1983 (has links)
Recent studies point to major problems in today's software systems. Problems in cost, reliability, maintainability, and poor responsiveness to user requirements have their origin in the early phases of the system development effort. Although increasing awareness of poor design practice has stimulated several research efforts toward making the "detailed design" process more "systematic," there is a significant need for a computeraided methodology to help designers cope with the complex design process. A framework is established for organizing activities in support of one important aspect of "detailed design," the organization of processes into appropriate process groups and program modules. A computeraided methodology is presented for analysis of variety of interprocess relationships in the determination of effective modularizations. The proposed methodology extends current software engineering practice through partial automation of an important software engineering problem, the effective structuring of processes according to multiple design criteria. Multiple design criteria are used to determine interprocess relationships. The system accomodates a number of design criteria including volume of data transport, distribution of data references, information and control distribution. The methodology begins with the assignment of a graph structure to subsystem components and their interdependencies. The resulting graph is partitioned in determination of subgraphs (modules) with strong intradependencies and weak interdependencies. The set of subgraphs define modules which satisfy principles of high module strength and low module coupling. The decomposition method used also produces a hierarchical structure of modules with little resource sharing. The resulting design limits "reference distribution" and "information distribution" between modules, which results in reduction of complexity of the total structure. Analytical tools in support of these activities are presented to illustrate support of the methodology by a pilot study.

34 
Migration of a realtime optimalcontrol algorithm from MATLAB TM to Field Programmable Gate Array (FPGA)Moon, Ron L. 12 1900 (has links)
This thesis presents an overarching plan to migrate a timeoptimal spacecraft control algorithm from the MATLABTM development environment into an FPGAbased embeddedplatform development board. Research at the Naval Postgraduate School has produced a revolutionary timeoptimal spacecraft control algorithm based upon the Legendre Pseudospectral method. Currently, the control algorithm is dependent on the MATLABTM environment, a fourth generation language (4GL). 4GLs are powerful highlevel abstraction and development tools, but are not efficiently instantiated into an embedded system. This study establishes three distinct development phases to migrate the algorithm from 4GL dependency to embedded operation. The first phase removes the algorithm's dependency on the 4GL environment by translating the algorithm into the C programming language. The second development phase compiles and embeds the algorithm into an FPGAbased development board. The final development phase introduces a custom computing machine (CCM) instantiated in an FPGA to reduce the control calculation time, thereby broadening the algorithm's potential application.

35 
Modeling, simulation and implementation of a noncoherent binaryfrequencyshiftkeying (BFSK) receivertransmitter into a field programmable gate array (FPGA)Svenningsen, Juan P. 09 1900 (has links)
This thesis presents the use of a field programmable gate array (FPGA) to implement a noncoherent binaryfrequencyshiftkeyed receivertransmitter (BFSKRT) that simulates the modulation of the SINCGARS radio, the RT1523C. An FPGA successfully, and with very few resources, implemented the desired modulation and demodulation. Topics covered include FPGA history, the hardware and software utilized, a summary of the SINCGARS RT1523C characteristics, the BFSKRT on FPGA design procedure and the design results.

36 
Field programmable gate array hysteresis control of parallel connected invertersLund, John J. 06 1900 (has links)
This thesis presents the use of a Field Programmable Gate Array (FPGA) to control two CommercialOffTheShelf (COTS) Power Electronic Building Blocks (PEBB) configured to produce a threephase low distortion sine wave output. The next generation warship is expected to contain more electric loads that require quality variable frequency output. A typical propulsion motor in the 40MW range will probably require the current Total Harmonic Distortion to be less than 3% (MILSTD1399). However, high power low distortion inverters usually have associated high cost and weight penalties. This thesis presents a parallel hybrid converter which demonstrates the use of a high power low fidelity bulk inverter with a low power high fidelity active filter. The high power low fidelity output is sourced using a sixstep inverter which produces the entire fundamental current. The low power hysteresis controlled active filter section produces only cancelling harmonic current. The paralleled result is a pristine output sine wave with a 1% current Total Harmonic Distortion (THD). This solution should offer the Navy a high fidelity high power inverter without the cost and weight penalties. / US Navy (USN) author.

37 
Specification and verification of communicating systems with value passingGurov, Dilian Borissov 16 June 2017 (has links)
The present Thesis addresses the problem of specification and verification of communicating systems with value passing. We assume that such systems are described
in the wellknown Calculus of Communicating Systems, or rather, in its value passing
version. As a specification language we propose an extension of the Modal μCalculus,
a polymodal firstorder logic with recursion. For this logic we develop a proof system
for verifying judgements of the form b ⊢ Ε : Φ where E is a sequential CCS term
and b is a Boolean assumption about the value variables occurring free in E and Φ.
Proofs conducted in this proof system follow the structure of the process term
and the formula. This syntactic approach makes proofs easier to comprehend and
machine assist. To avoid the introduction of global proof rules we adopt a technique
of tagging fixpoint formulae with all relevant information needed for the discharge
of reoccurring sequents. We provide such tagged formulae with a suitable semantics.
The resulting proof system is shown to be sound in general and complete (relative
to external reasoning about values) for a large class of sequential processes and logic
formulae. We explore the idea of using tags to three different settings: value passing,
extended sequents. and negative tagging. / Graduate

38 
Comparison of three random search methodsBorowski, Nick January 1971 (has links)
Three recent random search algorithms are compared on the basis of efficiency, and on the basis of sensitivity to noise, scaling and the number of variables. A general discussion of random search methods points out their advantages and disadvantages in relation to deterministic methods. A new random vector generator is described in the appendix. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

39 
Optimized relative step size random searchChoit, Mark David January 1973 (has links)
A theoretical technique for the minimization of a function by a random search is presented. The search is a modification of the Optimum Step Size Random Search of Schumer and Steiglitz to include reversals. A theory for updating the step size is presented upon which an implementation of a search algorithm suitable for highdimensional functions with no requirements for derivative evaluations is based. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

40 
Minimal spanning trees with degree restraintsMcFarlane, Archibald January 1968 (has links)
The purpose of this thesis is to develop a solution to the problem of determining the minimal spanning tree with degree restraints for a given nondirectional graph.
Section 1 gives an introduction to the problem. A set of definitions describing the graphical terminology used in the body of the thesis, is presented along with a description of the problem. At the end of this section a few applications of the problem are given.
Section 2 outlines the method of solution used. The algorithm incorporates a branch and bound technique and this problem solving method is discussed in general in the first part of the section. Some other applications of branching and bounding are also discussed. Next, the complete algorithm is described along with a proof of optimality. A sample problem is worked through to illustrate the method of solution.
Two different minimal spanning tree algorithms, one by R.C. Prim, the other by J.B. Kruskal, are used in the main core of the solution algorithm. These two approaches are discussed with the aid of a sample problem, at the end of Section 2.
Computer programs were written to test the algorithms. Several sets of data were compiled for various sizes of graphs and values of degree restrictions. The results of these runs were tabulated and are discussed in Section 3. Next, a comparison is made of the method discussed here and a solution involving linear programming.
Section 3 also presents some useful heuristic approaches at suboptimization which effectively reduce the amount of computation.
Section 4 summarizes the results of Section 3 and indicates the best approach to use for a specific problem. / Science, Faculty of / Computer Science, Department of / Graduate

Page generated in 0.1516 seconds