Abstract: Disclosed is a method and system for allowing resource control in a UNIX-based system to be done on an aggregate, or group, basis. This enables both access control and accounting to be done in units of groups instead of units of users. This design is upwardly compatible with the current implementation which does resource allocation and accounting in units of users. In addition, the method and system provides greater flexibility in selecting the system availability policy to be enforced. A resource quota scheme is introduced wherein a pooled resource account allows a system administrator to segregate processes into critical/non-critical classifications.

Abstract: A method, system and program for supporting a dynamic bind between a derived class and its parent class. A processor provides for the registration of class objects and dynamic binding of derived class objects to their parent class objects based on the registration mechanism. The SOM object model removes static references to class objects by having all the parent class information available at runtime through the parent class object. Thus, when the derived class implementation needs information about the size of the parent class state data structure, the addresses of the parent class method procedures, or access to the parent class method procedure table the appropriate information is retrieved from the parent class object.

Abstract: A low signal margin detect circuit for detecting reduced signal levels in differential current switch (DCS) or current switch emitter follower (CSEF) circuits. The circuit is connected to the outputs of a DCS circuit or to the output of a current switch emitter follower circuit and a reference voltage. A signal difference between the inputs is determined and, if less than an established amount, an error signal is generated. The detect circuit is enabled by a TESTBIAS signal. Two error signals are developed, ERRORX and ERRORY, which can be dotted with the error signals from adjacent circuits in the X and Y directions. This enables detection of the failing circuit through the use of appropriate error signal detection devices.

Abstract: Data processing apparatus including a display monitor operable in response to a display signal of predetermined frequency and a computer for transmitting a display signal to the display monitor. The display monitor generates an identifier signal indicating the predetermined frequency at which the display monitor operates. The computer means uses the identifier signal to determine the frequency of the display signal.

Abstract: The invention concerns a method and system for storing and displaying an entity relationship diagram. The entity relationship diagram of the invention is composed of only four different classes of allowed entity types. Thereby redundancy is eliminated and less storage locations are needed to store the diagram. The diagram comprises kernel entity sets K, attributive entity sets A, role entity sets P and relation entity sets R which are displayed on a display 9.

Abstract: A controller for a first in first out (FIFO) memory comprises detector logic for detecting any difference between the number of addresses in the memory into which data is written and the number of addresses in the memory from which data is read. Comparator logic connected to the detector logic generates a request data transfer signal in response to said difference becoming greater than or equal to a threshold. Threshold select logic connected to the comparator logic is responsive to data having first and second portions being written to the memory. The threshold select logic sets the threshold to a first value when the first portion is being written and sets the threshold to a second value, greater than the first value, when the second portion is being written.

Abstract: A multiple-pass system for determining the primitives that are visible in a predetermined pick aperture for a "visible pick" operation. On the first pass, the primitives contained within the pick aperture and thus potentially visible are selected, and each selected primitive is assigned a pick index as an identifier. On the second pass, the pick indices of the selected primitives are rendered to a temporary frame buffer area, using a Z-buffer for hidden surface removal so that only the pick indices of the primitives visible within the pick aperture are stored in the corresponding frame buffer portion. On the third pass, the frame buffer portion corresponding to the pick aperture is read to determine the pick indices of the visible primitives. This information is then used to report back to the host the picked primitives.

Abstract: An implementation of a flexible memory controller for a graphics hardware system that supports flexible allocation of frame buffer resources. The buffer selection and steering to the channels of the modification logic are performed by a programmable controller. Furthermore, the controller is capable of performing pixel functions that require multiple frame buffer accesses per pixel. Still further, independent control is provided for read and write sequences. Also, separate control is provided for buffer selection and bus steering. This function is useful for controlling systems where the frame buffer resources are limited. The present invention allows for assigning various buffers alternate functions based on the application's requirements, and may vary on a per window basis.

Abstract: A method, system and program for effectively managing class method names by collecting representations of all of the names and additional supporting information in a single data structure. Management is accomplished by the operation of an algorithm in the memory of a processor which employs two mechanisms. First, the class method procedure tables are initialized by class specific procedures. This allows applications to access the methods without requiring externalization of the method means. The information provided by the specific procedures is retained by the class object and is accessible via class methods whenever the information is required. Second, any additional supporting information for methods, in particular the offset in the method procedure table for each method, is recorded in a single externally named data structure. The combination of the two mechanisms eliminates the requirement of external names on a per method basis.

Abstract: A method, system and process for installing an application under a first operating system and translating the installation parameters into a set of similar parameters to assure proper execution under a second operating system. The invention prompts a user for selection of preferences for an initial operating system and stores the initial selections representing a user's requirements under the initial operating system. Then, the hardware is examined to ascertain a list of all bootable devices and the operating systems associated therewith. The list of bootable devices is presented to the user for selection of which operating systems the application should be enabled under. Finally, the application is enabled in accordance with the information stored in the initial selections on each of the selected bootable devices and the operating systems associated with the bootable device.

Abstract: A system and method for analyzing computer generated message streams. Electronic messages containing displayable message information are parsed according to a set of parsing rules. The resulting tokens are organized into parse state records and stored for further analysis. Current and previous parse state records are analyzed by the application of inference rules to develop a structured message. Content analysis of the structured or unstructured message is accomplished by application of a second set of inference rules. Content analysis attempts to select an automated response for transmission to the message generating computer system. Content analysis employs a binary search through a subset of inference rules loaded for a particular system. Changes to operating system or operator causes a different subset of rules to be loaded.

Abstract: Shading values are generated for the vertices of a polygon clipped by a view volume without performing unnecessary lighting calculations for polygons lying entirely outside the view volume. Each polygon vertex is transformed and tested to determine whether it is within the view volume. If a tested vertex lies within the view volume, lighting calculations are performed for that vertex. If the polygon lies entirely outside the view volume, no lighting calculations are performed for any of the vertices of the polygon, and only a subset of the coordinate transformation calculation is performed. Complete transformation and lighting calculations are performed for vertices lying outside the view volume only if necessary for determining by interpolation the values for new vertices formed by clipping.

Abstract: A retargetable data generation method for a compiler program which may be executed on a general purpose information handling system such as an IBM System 370 includes the following steps, ordering the data according to a storage class, mapping the ordered data into sections in accordance with established criteria, ordering the sections into a number of parcels in accordance with one or more data attributes, determining format for an item in a parcel, and formatting each such item in each such parcel according to the determined format.

Abstract: A nonlinear inductor for a CRT line timebase circuit comprises a bobbin carrying an inductive coil 41 and a first permanent magnet adjacent the coil. A second permanent magnet is positioned and oriented relative to the first magnet in such a manner that the magnetic field generated by the nonlinear inductor is substantially reduced. Because the second magnet is integral, the nonlinear inductor occupies the same printed circuit board area as a conventional nonlinear inductor. Furthermore, because the second magnet is oriented to substantially cancel the magnetic field, no additional magnets are required for deflecting the magnet field away from the CRT.

Abstract: Improved apparatus and method for encoding and decoding information is disclosed herein. The invention uses the same marker segment information to engage an encoder or a decoder. The technique eliminates many of the complexities associated with building parameter lists, and generating various types of marker segments in a form compatible with both the decode and encode processing.

Abstract: A method, system and program for isolating the executable binary form of computer applications that use object definition libraries from changes in the implementation or specification of object definitions in the library. These objects include adding new methods to an object definition; moving the point of definition for one of the class methods to the class parent class; changing private instance data associated with an object definition; inserting a new parent class definition between the class and its parent class when it has one; and changing the implementation of one of the class methods without changing the methods interface. The objects are achieved by removing offset and size values from the application binary image and putting them in data structures that are initialized at runtime.

Abstract: Antialiased lines are generated in a computer graphics system by drawing the pixels on one side of the ideal line segment in the minor axis direction on one pass and drawing the pixels lying on the other side of the line segment in the minor axis direction on another pass. A modified Bresenham procedure is used to generate the pixel positions on both passes. On either pass, intensity values are generated from the integral Bresenham determinant directly, rather than from the perpendicular or vertical distance between the pixel and the line.

Abstract: A method, system and process to improve the formant composition in a speech synthesis system so that the formants are more intelligible. The system employs a process in the memory of a processor to change the starting and ending frequency of phonemes from the frequency of the independent phonemes. The process examines preceding and succeeding ending phoneme frequency values to detect similar phoneme frequency values. If a dissimilar value is detected, then the invention provides for exchange of the formants to render the resulting speech more intelligible.

Abstract: A dynamic random access memory (DRAM) device that is selectively operable in a normal write mode, in a block write mode, or in a blocked flash write mode in accordance with a mode select signal. In the preferred embodiment, each column of a 512.times.512 DRAM is divided into eight superblocks of 64 columns, each superblock being in turn divided into eight blocks of 8 columns each. An address decoder decodes the most significant column address bits A8-A6 to provide a group select signal specifying a 64-bit superblock, the next most significant column address bits A5-A3 to provide a block select signal specifying a 8-bit block, and the least significant column address bits A2-A0 to provide a cell select signal specifying a particular column. In the normal write mode, data is written to the specified column in the specified block in the specified superblock. In the block write mode, the same data is simultaneously written to selected columns in the specified block in the specified superblock.

Abstract: A method and apparatus for evaluating and rendering parametric curves such as non-uniform rational b-spline (NURBS) curves. NURBS data consisting of control point data, knot values and other data defining a curve is stored in system memory as a sequence of records such that successive spans of the curve are defined by successive individual data records in conjunction with a predetermined number of immediately preceding data records of the sequence. A graphics control processor transforms the control point data from modelling coordinates to view coordinates, converts the transformed control point data to homogeneous coordinates, and generates parameter points along the curve. Parallel floating point processors simultaneously evaluate the homogeneous coordinates of the curve at each parameter point along the curve using the Cox-de Boor procedure. A further floating point processor converts the homogeneous coordinates to geometric coordinates for subsequent rendering and display of the curve.