Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where John L. Pokoski is active.

Publication


Featured researches published by John L. Pokoski.


IEEE Transactions on Automatic Control | 1969

Deadbeat response to parabolic inputs with minimum-squared error restrictions on ramp and step responses

John L. Pokoski; D. Pierre

A linear error-sampled control system can be designed to track inputs of the form tkwith zero error in finite time.


IEEE Transactions on Industrial Electronics and Control Instrumentation | 1975

A Software Development System for Microcomputers

Oliver D. Holt; John L. Pokoski; Daniel L. Cordell

The most common approach to microcomputer software development is to first assemble the program on the microcomputer system or cross-assemble it on a larger computer; then debug the program in the microcomputer or simulate it on another computer; and finally burn the program into a ROM or PROM.


Journal of The Illuminating Engineering Society | 1981

A Skylight Energy Balance Analysis Procedure

Philip S. Dietz; Joseph B. Murdoch; John L. Pokoski; Joseph R. Boyle

This paper provides a systematic method for calculating the total, net differential energy balance observed when sections of the roof of a building are replaced with skylights. Numerous mathematical models have been developed to approximate the heat transfers and illumination energy gains associated with the installation of skylights. The procedure described herein is especially well suited for implementation on a relatively inexpensive class of microcomputers. Among the topics discussed are the effect of solar gains, dome and curb conduction heat transfers, equivalent roof area heat transfers, infiltration heat transfers, artificial lighting energy requirements, and illumination savings from skylights. The paper also provides much of the supplementary information (data) needed to complete these energy calculations. This information appears in the form of appendices, tables, and graphs, found at the end of the paper.


IEEE Transactions on Automatic Control | 1968

An analysis scheme for suboptimal, minimum- time, sampled-data systems.

John L. Pokoski

Sampled data system minimum time suboptimality measurement, proposing approximate analysis method for pulse amplitude modulated systems


oceans conference | 1981

An Application of Magnetic Bubble Memory in Ocean Instrumentation

Edward P. Garcia; John L. Pokoski

A method of implementing Magnetic Bubble Memory (MBM) in sophisticated ocean instrumentation is presented. With the increasing need for mass data storage and manipulation, storage systems must be made available which meet the demanding requirements of the ocean environment. MBM provides an attractive alternative to conventional mass storage media. Design efforts included power conservation measures, maximum system reliability with minimal field support and minimal system interconnections. A method of isolating the MBM from a host computer by utilizing a local computer will be discussed; a concept which allows the MBM system to be used with most types of computers, mainframe, mini or micro, with a minimum amount of redesign. Several other system components are presented. These include a file management system, stand alone capabilities, and a host-local computer communications protocol.


technical symposium on computer science education | 1990

A partnership in domestication of rapid prototyping technologies

Andrzej Rucinski; Frank Hludik; John L. Pokoski

An independent observer taking a close look at either a university professor or a researcher would quickly discover that this group of people is using a language not very well understood by the rest of the society. A pertinent component of this professional “jargon” is a set of buzzwords often used. This set changes with time, and it itself, to some extent, measures time. For example, it is also quite plausible to assume that in 1948 the most popular buzzword discussed and cherished by scientists was “transistor”. It is also quite plausible to assume that the same word is not a favorite one any more. The reason is that it does not generate as much enthusiasm as it used to and, as it is known quite well, the transistor technology has become “domesticated”, i.e. commonly used. The goal of this paper is to show how the VLSI technology, so popular among scientists these days, can become another popular technological commodity. The successful VLSI experience we describe in this paper has been achieved by a small group of faculty from a medium size public university and can be used, in our view, as an example by others.


Archive | 1988

Self-Diagnosable and Self-Reconfigurable VLSI Array Structures

Andrzej Rucinski; John L. Pokoski

The issue of self-testing and self-reconfiguration of two-dimensional VLSI array structures are discussed in this paper. Analysis and synthesis are facilitated by separating redundant circuits into two separate categories. ST-redundancy which represents built-in circuitry used solely for self-diagnosis, and SR-redundancy which represents extra resources used for fault-tolerance. The amount of redundancy can vary, e.g. a BIST method for self-testability employs approximately 10% ST-redundant circuitry while 200% of SR-redundancy plus a voter which is ST-redundant represents a signal-fault tolerant device. The concept is implemented as a double-layered VLSI array architecture. The developed model is very general. Some important arrangements like a centralized host system, a fault-tolerant distributed multiprocessor array developed by Kuhl and Reddy, or Koren’s self-reconfigurable VLSI array are special cases of S(M, N, t o ) systems, as introduced here. In one special case, 100% of ST-redundancy allows the testing to be performed at a polynomial time regardless of the array size.


International Journal of Control | 1970

Some relations between the discrete and continuous minimum time problems

John L. Pokoski

In this paper some relations between the continuous and discrete (sampled) minimum time problems are examined. In particular the effects of the sampling constraint are examined for plants with real and complex eigenvalues, and for pulse amplitude and pulse width modulated systems.


international conference on distributed computing systems | 1986

Task Allocation Heuristics for Distributed Computing Systems.

Ahmed K. Ezzat; R. Daniel Bergeron; John L. Pokoski


IEEE Transactions on Aerospace and Electronic Systems | 1980

NCTR Plus Sensor Fusion Equals IFFN or can Two Plus Two Equal Five

Paul J. Nahin; John L. Pokoski

Collaboration


Dive into the John L. Pokoski's collaboration.

Top Co-Authors

Avatar

Andrzej Rucinski

University of New Hampshire

View shared research outputs
Top Co-Authors

Avatar

Daniel L. Cordell

University of New Hampshire

View shared research outputs
Top Co-Authors

Avatar

Edward P. Garcia

University of New Hampshire

View shared research outputs
Top Co-Authors

Avatar

Frank Hludik

University of New Hampshire

View shared research outputs
Top Co-Authors

Avatar

Joseph B. Murdoch

University of New Hampshire

View shared research outputs
Top Co-Authors

Avatar

Joseph R. Boyle

University of New Hampshire

View shared research outputs
Top Co-Authors

Avatar

Paul J. Nahin

University of New Hampshire

View shared research outputs
Top Co-Authors

Avatar

Philip S. Dietz

University of New Hampshire

View shared research outputs
Researchain Logo
Decentralizing Knowledge