Abstract: An EEPROM system includes flash EEPROM cells organized into subarrays. Pairs of subarrays share row address decoders by sharing word lines, and individual subarrays have dedicated column address decoders and data registers. Each row decoder has an associated row address latch, and each column decoder has an associated column address latch. Multiple data chunks are concurrently written into the subarrays by first latching chunk addresses into the row and column address latches, and corresponding chunks of data into the data registers, then activating a programming signal to initiate concurrent programming and verifying the programming of the data chunks.

Abstract: The information management and database system of the present invention comprises a flexible, self-referential table that stores data. The table of the present invention may store any type of data, both structured and unstructured, and provides an interface to other application programs. The table of the present invention comprises a plurality of rows and columns. Each row has an object identification number (OID) and each column also has an OID. A row corresponds to a record and a column corresponds to a field such that the intersection of a row and a column comprises a cell that may contain data for a particular record related to a particular field, a cell may also point to another record. To enhance searching and to provide for synchronization between columns, columns are entered as rows in the table and the record corresponding to a column contains various information about the column. The table includes an index structure for extended queries.

Abstract: A method, apparatus, and article of manufacture for optimizing SQL queries in a relational database management system using a vectorized index. The vectorized index represents values in one or more of the columns of a particular table in the relational database. The vectorized index is comprised of a plurality of positions, wherein each of the positions comprises a linear array that represents a value for the specified columns in a corresponding row of the particular table in the relational database. To use the vectorized index, SQL operations are converted to a series of bit-vector operations on that index, where the result of the bit-vector operations is a list of row positions in the table.

Abstract: A method for operating a processor-controlled system produces a table image including graphical display objects in each of the cell regions indirectly representing the data values in an underlying n-dimensional (nD) information data array. Request signal data is received from a input signal source to present the table image in the display area of a display device connected to the processor-controlled system. In response to the request signal data, for each cell in the table image, the source data value and data type of a source data item in the nD data array is obtained, and a cell presentation type is selected using the data type. A graphical display object having at least one display feature representative of the data type of the data value is produced from the cell presentation type, and image definition data defining table image and the graphical display object for each cell is provided to a system display device for display. The underlying data in the nD data array is thus graphically and indirectly represented in the table image, facilitating the visual inspection and identification of patterns and trends in the data. In addition, for very large conventional table images that do not fit in a standard sized display area, indirect representation of the data occupies substantially less space in the display area, permitting very large tables to be entirely represented graphically in one image. A sophisticated user interface permits a system user to perform table manipulation functions, such as reordering rows and column, sorting rows or columns, and deriving new rows or column, in order to further reveal data trends and patterns in the graphical representations.

Abstract: A Java-based rapid application development (RAD) environment for creating applications providing named-based programmatic access to information from columns in databases is described. For increasing the efficiency by which named-based references to database columns are processed by application programs, the system provides methodology for rapid lookups of column names, using a reference cache storing 32-bit references to immutable strings (e.g., Java strings). The reference cache is preferably constructed as a least-recently allocated cache, thereby allowing allocation to occur in a round-robin fashion, with the oldest item allocated being the first item bumped from cache when the cache overflows. Each cache entry stores a reference (e.g., four-byte pointer or handle to a string) and an ordinal entry (i.e. the corresponding database ordinal). As a reference to a particular database column occurs during execution of a program, the reference cache fills with a reference to that column name as well as the corresponding column ordinal. Accordingly, program execution proceeds with comparison of existing items in the cache, using a sequence of rapid, in-line comparisons involving simple data types (e.g., 32-bit references for the column name string). This approach minimizes the need to perform hash lookups or string comparison operations.

Abstract: Game systems, superficially similar to bingo, which employ combinations of multiple variables from different sets (for example colors; symbols such as numbers of letters; and geometric shapes such as circles, diamonds and squares) to increase the number of pattern permutations on individual game faces (100, 120, 140, 160, 180), in combination with random selection apparatus (350). Compared to ordinary bingo, the number of players may be greatly increased without resulting in games that are unduly short, and various version controls allow control over the mathematical probabilities of winning. Each game face (100, 120, 140, 160, 180) has a plurality of individual positions organized as columns and rows. Within each column, the individual positions are filled with a random sequence of elements from each of at least two of the sets, and each column has a unique column designation. Random selection apparatus (350) is disclosed, which is particularly useful when employed in combination with the game faces. The random selection apparatus (350) generates a sequence of calls, where each call specifies an element from each of the at least two sets of different entities, for example a color and a number, such that a game player can designate individual positions on a particular game face which have elements that match the specified elements of a particular call. In addition, a call preferably includes a column designation. The random selection apparatus (350) includes a number of random selectors (352, 364, 366, 368, 370, 372, 384r, 384b, 384y, 384o, 384g, 386r, 386b, 386y, 386o, 386g, 388r, 388b, 388y, 388o, 388g, 390r, 390b, 390y, 390o, 390g, 392r, 392b, 392y, 392o, 392g) related to each other in a particular manner. Also disclosed are systems (200) for generating game faces, and overall gaming systems (600).

Abstract: A cached synchronous dynamic random access memory (cached SDRAM) device having a multi-bank architecture includes a synchronous dynamic random access memory (SDRAM) bank including a row decoder coupled to a memory bank array for selecting a row of data in the memory bank array, sense amplifiers coupled to the memory bank array via bit lines for latching the row of data selected by the row decoder, and a synchronous column select means for selecting a desired column of the row of data. A randomly addressable row register stores a row of data latched by the sense amplifiers. A select logic gating means, disposed between the sense amplifiers and the row register, selectively gates the row of data present on the bit lines to the row register in accordance to particular synchronous memory operations of the cached SDRAM being performed. Data to be input into the cached SDRAM during a Write operation is received by the sense amplifiers and written into the memory bank array. Data to be output from the cached SDRAM during a Read command is read out only from the row register, the row of data contained in the row register first having been read from the memory bank array to the sense amplifiers and then selectively gated to the row register in accordance with the particular synchronous memory operations.

Abstract: Automatic generation of hypertext markup language (HTML) files based on bitmap image data, which faithfully preserves layout information of an original document from which the bitmap data was obtained. Generally, multi-column document layouts result in automatic generation of HTML files that use HTML "table tags" to display each of the different columns. More particularly, a bitmap image is obtained such as by scanning or retrieval of a pre-existing image, and the bitmap image is segmented into blocks. The location of each block is determined, each block is analyzed in preparation for insertion of appropriate data into an HTML file, and layout analysis is performed to identify layout relationships between the blocks based on the relative locations of the blocks in the bitmap image. Based on the layout relationships, a block type is determined for each block, column span and row span data for each block is determined, blocks are re-ordered if needed, and an HTML file is generated in which blocks are tagged as data elements in a row of an HTML "table tag" based on block type and based on column and row span information for the block.

Abstract: A method and system for efficiently performing database table aggregation is provided. In a preferred embodiment, an aggregation facility efficiently aggregates a source table using indices on an aggregated column of the source table and a grouping column of the source table. The facility uses the index on the aggregated column to identify the contents of the aggregated column in each row of the source table. The facility further uses information derived from the index on the grouping column to identify the contents of the grouping column in each row of the source table. For each row of the source table, the facility aggregates the identified aggregated column contents into a result value for the identified grouping column contents. In a further preferred embodiment, the facility generates a relation mapping from source table row to grouping column, which the facility uses to identify the contents of the grouping column in each row of the source table. In a further preferred embodiment, the facility may be used to perform multiple-level aggregations, as well as aggregations in which there are multiple grouping columns, multiple aggregated columns, and/or multiple result columns.

Abstract: An electro-optical imaging array having pixels arranged in rows and columns electronically compensates for image motion in the plane of the array regardless of whether the motion vector is in the row direction, the column direction, or in a diagonal direction, i.e., in some vector combination of row and column directions. In an aerial reconnaissance application, the image motion may be due to rotation of the aircraft about roll, pitch and/or yaw angles in addition to forward velocity of the aircraft. The image motion compensation is achieved with no moving parts and does not require a stabilized platform. A camera control computer determines the magnitude and direction of the image motion from inertial navigation system inputs, including velocity, flight, and aircraft rotation information, and calculates pixel information transfer rates in the row and column directions. The pixel information transfer rates are supplied to a counter and clock driver circuit for the array. The pixel information in the array is transferred in the row and column direction in a step-wise fashion in the row and column directions at a rate and direction substantially matching the image motion. The array itself is provided with a gate and control line design to enable charge representing pixel information to be transferred in both the row and column directions.

Abstract: One memory array is divided into a plurality of banks sharing a row of memory cells. Global IO buses are disposed for memory column blocks forming the plurality of banks included in one memory array. The global IO buses are selectively and electrically connected to the same data input/output terminal.

Abstract: A method and apparatus generates a graphical user interface that summarizes information in an easy and user-friendly format in a database which stores topics and responses to those topics. To that end, the graphical user interface includes a user frequency view and an adjacent report view. The user frequency view includes a two-dimensional grid having indicia identifying one or more users along the horizontal dimension, and an index listing a plurality of topics along the vertical dimension. The grid forms a plurality of intersecting horizontal topic rows and vertical user identifying columns. Each intersection of a topic row and user identifying column may include indicia that display the number of responses to each of the listed topics by each of the users. The report view includes a listing of the titles of each response to a topic selected in the index, or the titles of each response by a user to a selected topic.

Abstract: An improvement to a spreadsheet application program executed in a processor-controlled machine displays a first spreadsheet image showing a plurality of cell regions each of which shows a direct, symbolic representation of a source data value of a source data item in an n-dimensional (nD) information data array with which the cell is respectively paired In response to an image display request signal, a second spreadsheet image is displayed which shows, in each cell, a graphical display object representation of the respectively paired source data value in place of its direct representation The source data values in the nD data array are thus graphically, or indirectly, represented in the cell regions in the second spreadsheet image, facilitating the visual observation, identification and inspection of patterns and trends in the data A sophisticated user interface permits a system user to perform spreadsheet manipulation functions, such as reordering rows and column, sorting rows or columns, and deriving new rows or column, in order to further reveal data trends and patterns in the graphical representations

Abstract: A method for processing a file containing a financial statement in uncoded format such as a financial statement stored in an ASCII file. The starting locations of the various types of financial tables in the financial statement as indicated by their table titles are identified by grammar descriptors. When all the table titles in the file are identified, a table title is then selected for processing. Typically after the table title, there are the associated column headers for the table, and they are analyzed and determined. Following the column headers, there are lines of text that are separated into line items, where each line item is composed of a label and/or one or more numbers corresponding to the label. With these line items, the next task is to parse these line items to verify that these line items make up the table and to identify the components of the financial table. A financial table is comprised of line items, subtotals, and grand totals. By recognizing the mathematical structure of the table, the relationship between the line items, subtotals, and grand totals can be readily understood and categorized.

Abstract: The directory service of the present invention extends the mechanism used to define ordinary properties to define "links," pairs of properties that represent an interobject reference with a certain meaning. Each pair is given a unique "pair ID" and consists of a "link" property and a "backlink" property, which represent the "reference" and "is referenced by" semantics, respectively. Rather than storing interobject references with the referencing and/or the referenced objects themselves and imputing the link, instead the present invention stores the link instance itself as an unnamed object in a link database table, which is separate and distinct from the data information base, and imputes the values to be reported for the relevant properties on the referencing and referenced objects from the existence of records in the link table. When a directory service server learns of the deletion of an object (either via replication or because of a deletion occurring on that server), it removes from its link table all records that refer to that object in either the link ID or backlink ID column, which is an efficient operation. This eliminates any dangling references to the deleted object. Although this implicitly affects the values of the corresponding link and backlink properties on other objects in the directory (i.e., those named in the backlink or link properties of the object being deleted), the changes to those other objects do not need to be noted or replicated in any way, since the replication of the deletion of the original object will cause all other directory service servers to perform the same cleanup, thereby independently removing the same link instances. This allows the directory service to maintain referential integrity in a distributed manner, with minimal replication overhead.

Abstract: A semiconductor memory device includes a memory cell array, a redundant row memory cell array, a redundant column memory cell array and a redundant column row memory cell array. A redundant row test activation signal, a redundant column test activation signal and a multi-bit test activation signal are activated in response to signals RAS, CAS and WE and address key signals. In a redundant row test mode, a redundant word line is selectively driven in response to a row address signal. In a row column test mode, a redundant column selection line is selectively driven in response to a column address signal. In addition, data shrinking circuit is provided in order to enable a multi-bit test of redundant rows and redundant columns.

Abstract: A complete telephone number detection unit is described for use within a wireless local loop telephone. The detection unit examines digits or other symbols entered by user via a telephone keypad to determine whether a completed telephone number has been entered. If a completed telephone number has been entered, the detection unit signals other components of the telephone to transmit the telephone number. If the telephone number is not yet complete, then the detection unit awaits entry of additional digits or other symbols. To determine whether a completed telephone number has been entered, the detection unit accesses a parsing table having rows corresponding to different parsing states of permissible telephone numbers. Each row of the table includes a set of columns with one column corresponding to each of digits 0-9, the "*" symbol and the "#" symbol. To parse a telephone number using the table, each digit is applied to the table to yield a value. The value either provides a pointer to another row of the table or contains a value identifying that the telephone number is complete. If the value is a pointer value, then the next digit or other symbol received is employed to access the row pointed to by the pointer value. Each succeeding digit of the telephone number is employed to access the parsing table resulting in transitions from one row of the table to another until a value is read indicating a complete telephone number. Method and apparatus embodiments of the invention are described.

Abstract: A system and method for object representations of program and script components. A graphical user interface displays a plurality of program components in a plurality of rows in a scrollable table. Each scrollable table comprises a first column that contains iconic representations of the program components and a second column that contains generated program code for the program components. An operator edits the program by manipulating the icons, editing invocation of dialogs or editing the generated program code directly.

Abstract: A method and associated data structures for generating, maintaining, and applying "display parameters" as a portion of lookup information associated with a column in a database table. Display parameters provides for the display and retrieval of alternate values in place of the data stored in the associated column. Use of such alternate values permit the application database designer to provide more meaningful presentation of data to a user while permitting the storage of corresponding data to be optimized for storage or performance criteria. The display parameters are a portion of the lookup information associated with a column of a database table and are stored in the data dictionary of the application database. Storing the display parameters in the data dictionary permits all access to the associated column data to automatically utilize the alternate values for any data display or retrieval without further design considerations unique to the particular database access. The display parameters may comprise a static table consisting of rows (or a list) of entries. Each includes at least one alternate value for the stored value. A plurality of columns may be provided in each row to provide other alternate values useful by other column data access operations. The display parameters may alternatively comprise a second table identification and an associated query command. The second table is joined with the first table (containing the lookup associated column) by a relation. The associated query command is applied to the join to extract a table of alternate values used in accessing the associated column.

Abstract: An MxN dynamic spare column replacement memory system for storing M N-bit data words includes a random access memory (RAM) formed by a rectangular array of M rows and N+S columns of single-bit memory cells. Each row has a unique address and stores an N-bit word using a selected set of N of its N+S cells. An N-line parallel data bus provides data access to the DRAM. Responding to a switching instruction from a switch controller at the start of each memory access cycle, a crossbar switch selectively connects each of the N lines of the data bus to a separate one of the N+S columns. Thus during a memory read or write access cycle the N data lines access N cells of an addressed row columns. The remaining S cells of the row are unused. A host computer occasionally checks the DRAM for defective memory cells, and upon finding a defective cell or cells in any row, the host stores the row address and a switching instruction in the switch controller. At the beginning of each memory access cycle, the switch controller compares the DRAM address to its stored list of addresses of rows having a defective cell. If the current DRAM address matches a stored address, the switch controller switches data bus lines from columns containing the defective cell to spare columns in accordance with a switching instruction stored with the address. Thus spare cells are assigned for replacement of defective cells on an address-by-address basis.

Abstract: A data in/out channel control circuit for a semiconductor memory device with multi-bank structure includes a plurality of split banks each provided with memory cell arrays, each split bank having a plurality of bit line pairs and a sub in/out line pair connected through a column selection transistor pair, for efficiently connecting data from the bit line pairs to a global in/out line pair. The circuit enables transmission of only the data in a given block bank through the global in/out line pair and the sub in/out line pairs with bank selection information and block selection information. The circuit includes a pair of global in/out lines, global column selection lines extending in a direction of the bit line pair, a column decoding means for activation of any one of the global column selection lines responsive to a decoding of the column selection information, local column selection lines connected to each gate of the column selection transistors, means for generating a bank selection signal for selecting at least one of the plurality of banks by decoding column selection information and row selection information, and a switching means for connecting the sub in/out line pair of the corresponding bank to the global in/out line pair as well as connecting the global column selection line to the local column selection line of the bank in response to the bank selection signal.

Abstract: A graphical user interface (GUI) application program has one or more screens and a number of objects hereinafter "field objects", each field object being uniquely associated with a single field in a screen. Each field object contains storage elements that hold data displayed in a screen's field. Each field object also contains storage elements that indicate functions that can be performed on data held in the field object. The field object may have at least three data member storage elements, one for holding data, another for holding a label, and yet another for holding a search operator. The GUI application program also includes field map storage elements, each of which maps a field in a screen to a corresponding column in the database, thereby allowing database queries to be created and performed dynamically on user entered field information. Such field map storage elements allow a database to be changed without affecting various parts, e.g. field objects and screen functions, of the GUI application program.

Abstract: Methods and arrangements are provided to efficiently use 3-D vision systems to measure selected features, of objects that are semi-constrained in compartmented trays having a uniform geometric arrangement. The methods are particularly well suited for optimizing the 3-D measurement of leads on integrated circuit devices which are packaged in trays. For obtaining the three-dimensional data, a multi-pocketed tray can be provided with tray pockets arranged in rows and columns, and corresponding sides of the multiple parts or devices in a row or column are scanned sequentially with at least one three dimensional sensor. This scanning procedure is repeated for all rows and columns containing sides of the devices from which data is to be obtained. The devices can be first aligned by applying directional vibration to the tray to drive all the parts or devices to the same corner or side of the respective pockets. The collected device geometry data is fed back to the manufacturing operation to control the parameters thereof.

Abstract: A platform dimensioned for the transport of cargo within a shipping container. The platform includes column members and a lifting portion present on the column members. The members are movable between a first condition in which the columns are upright when a load of cargo is present on the platform and a second condition in which the column members are horizontal so that one platform may be stacked upon another. The platform is adapted to be received as a clearance fit inside the shipping container and is provided with a component by which the platform may be moved in or out of the container.

Abstract: In a database table with rows each having respective key values, the locking of a key value to enforce key-value uniqueness is accomplished by (a) mapping the key value into a set of hash values to produce a resulting hash value, and (b) locking all key values (i.e., preventing writing of key values in new rows and preventing updates creating new key values in existing rows) that map into the resulting hash value. This provides a compromise between the high-granularity and high-cost solution of indexing, and the low-cost but very low-granularity solution of table-level locking. One useful application of this technique lies in the enforcement of uniqueness of multi-column keys in the table without incurring the cost of indexing all possible combinations of column values that might comprise key values.

Abstract: A matrix including a plurality of light emitting devices organized into a plurality of rows of first contacts and columns of second contacts. Row/column decoding switches each coupled to a number of individual rows/columns and to a number of row/column address lines for selecting an addressed one of the number of individual rows/columns, and to an individual row/column data lead for selecting a row/column decoding switch. The matrix and row and column switches are integrated onto a common substrate. A programmable voltage source is coupled to the column decoding switches by the column data leads and a programmable current sink is coupled to the row decoding switches by the row data leads.

Abstract: A semiconductor memory device of the invention includes a memory cell array having a plurality of memory cells, row selector for selecting a row of the memory cell array corresponding to a row address of an input address, and column selector for selecting a plurality of columns of a memory cell array corresponding to a column address of an input address, and also selecting a plurality of columns of a memory cell array corresponding to at least one column address other than a column address of an input address. The device also includes a sense amplifier for sensing data stored in memory cells. The sense amplifier has at least two sense amplifier groups, the sense amplifier groups sensing data read from a plurality of memory cells corresponding to an input address, and data read from a plurality of memory cells corresponding to the row address of an input address and at least one other column address. The device has a page mode for rapidly switching and outputting data from a plurality of memory cells which have been read in parallel to sense amplifier in accordance with an input address.

Abstract: Who in the business world stands to gain the most from the Internet? This column uses a well–known framework of competitive forces to explore how the Internet affects competitive advantage.

Abstract: A motivation system for children is provided, which consists of a motivation system board, play money of various denominations, and coupons for various predefined rewards. The motivation system board consists of a flat rectangular rigid sheet with a schedule information area, a rewards information area, and an erasable felt tip marking pen with a pen holder. The schedule information area contains a first column for listing the time of day, a second column for listing the behavior the child is to perform, and a third column for listing the quantity of play money to be received by the child. The rewards information area contains a first column for listing rewards that may be purchased, and a second column for listing the play money purchase price of reward.