Abstract:
In character recognition systems, there exists the problem of recognizing adjacent characters which are touching rather than being completely separated by blank spaces. The system described generates a section gate in dependence upon an algorithm geared to character topology. The section gate enables a segmentation system which is adapted to properly segment the characters.
Abstract:
A method and apparatus for gating segmentation scheme generators in accordance with a detected video signal. A video operator signal derived from detected video signals is compared with a threshold signal. One of a plurality of segmentation scheme generators is gated on in accordance with the comparison of the video operator signal and the threshold signal.
Abstract:
BUS TO BUS TRANSLATION The present invention relates to data processing systems having a central processing unit and a global storage unit connected by a system bus, and an I/O bus which is connected to the system bus by means of a bus converter. Selected I/O devices are randomly attached to the I/O bus. The present invention provides a programmable bus converter which dynamically inserts appropriate address control information into messages transmitted from the I/O bus to the system bus. In one preferred embodiment of the present invention the bus converter is provided with means whereby access can be denied to and from selected I/O devices.
Abstract:
TASK HANDLING APPARATUS FOR A COMPUTER SYSTEM Task handling apparatus in a computer system is structured to be common to system control tasks, user tasks and I/O tasks. Although the task handling apparatus contains a task priority structure, all tasks are handled in the same manner, and there are no fixed interrupt levels for I/O tasks. There are N levels of priority, and N is variable. Each task is a server for a functional request. Task dispatching elements (TDE's) are enqueued in priority sequence on a task dispatching queue (TDQ). A task dispatcher functions to dispatch the highest priority TDE on the TDQ, if any, and to perform task switching. Intertask communication is accomplished by send message, send count, receive message and receive count mechansisms, and is coupled with task synchronization. Task synchronization is achieved by dequeueing and enqueueing TDE's on the TDQ. An active task becomes inactive dispatchable when a higher priority TDE is enqueued on the TDQ by send message or send count mechanisms. The active task becomes inactive waiting when a receive message or receive count is not satisfied. An inactive dispatchable task becomes the active task when it becomes the highest priority enqueued TDE on the TDQ by the receive message or receive count mechanisms. An inactive waiting task becomes either the active task or an inactive dispatchable task after being enqueued on the TDQ by the send message or send count mechanisms, depending upon whether it is the highest or other than the highest priority TDE on the TDQ.