Abstract: Retrieving multidimensional data from a data source and displaying the data in a familiar and pre-existing user interface automatically propagates user-created formulas thereby eliminating the need for users to re-enter formulas. A data representation of the multidimensional data is sent to a query processor which creates row and column structures. These structures are manipulated based on a user action, such as zoom-in, and a multidimensional data output tree showing a hierarchy of the multidimensional data. Also created is a blueprint containing instructions on insertions and deletions to be carried out by the program associated with the pre-existing user interface, such as a spreadsheet program. Once the blueprint is interpreted by the program, typically through a data representation manipulator or common spreadsheet layer, the user interface is configured to accommodate the returned multidimensional data. Once the user interface is populated with the data, the program, such as the spreadsheet program, adjusts the user-created formula cell designations to reflect the new configuration.

Abstract: A semiconductor memory device is disclosed that reduces a consumed current in a standby mode including a self-refresh mode. In one aspect of the invention, a semiconductor memory device includes a row-system circuit for receiving a first power from a power supply and operable in accordance with a row address strobe signal, a column-system circuit operable in accordance with a column address strobe signal, and a switch circuit that is connected to the column-system circuit. This switch circuit receives the first power from the power supply and supplies the first power to the column-system circuit in an active mode and produces a second power lower than the first power and supplying the second power to the column-system circuit in a standby mode.

Abstract: Disclosed is a method, system, and program for performing a join operation on a multi-column table and at least two satellite tables having a join condition. Each satellite table is comprised of multiple rows and at least one join column. The multi-column table is comprised of multiple rows and at least one column corresponding to the join column in each satellite table. A join operation is performed on the rows of the satellite tables to generate concatenated rows of the satellite tables. One of the concatenated rows is joined to the multi-column table and a returned entry from the multi-column table is received. A determination is then made as to whether the returned entry matches the search criteria. If so, a determination is made as to whether one of the satellite tables has duplicates of values in the join column of the returned matching entry or the multi-column table has duplicate entries in the join columns. Returned matching entries are generated for each duplicate value in the satellite tables and duplicate entry in the multi-column table.

Abstract: A database grouping and display system that groups a database by row and column in response to a user input. The database grouping and display system displays a raw, ungrouped database and allows a user to manipulate it as desired. The system displays the raw database and any manipulation results within a window of a web browser, thus allowing data analysis to be performed with the use of a common and inexpensive program. A user may group a database in order to group record entries within the database by common data entry. The user may group the record entries by row, by column, or by row and column. Each record entry grouping is referred to as a “metacell.” The database grouping and display system may further summarize the contents of each metacell and present a summary result along with the display of the metacell. This summary value is typically invoked for all metacells, but may alternately apply to a single row, column, or metacell, or for the entire document. The display state of the metacells may be toggled between a fully expanded and collapsed state. In the expanded state, all record entries within the metacell are visible, along with any summary values for the metacell. In a collapsed state, only summary values are shown in the metacell. This allows a user to see as much or as little detail for a metacell or range of metacells as desired.

Abstract: We describe work on automatically inferring the intended meaning of tables and representing it as RDF linked data, making it available for improving search, interoperability and integration. We present implementation details of a joint inference module that uses knowledge from the linked open data (LOD) cloud to jointly infer the semantics of column headers, table cell values (e.g., strings and numbers) and relations between columns. The framework generates linked data by mapping column headers to classes, cell values to LOD entities (existing or new) and by identifying relations between columns. We also implement a novel Semantic Message Passing algorithm which uses LOD knowledge to improve existing message passing schemes. We evaluate our implemented techniques on tables from the Web and Wikipedia. This is an extended version of a paper under review at XYZZY.

Abstract: A memory system and a manner of operating the memory system are provided. The memory system includes several arrays arranged in groups of columns having a column address, and rows having a row address. Operating the system involves storing blocks of data in the arrays in a way that provides contiguous logical addresses for the blocks of data. A block of data is stored in a row of a group of columns in an array. The row address is incremented and the process repeated until a row limit is reached. Next, the process is repeated with another array until blocks of data have been stored in all rows of a corresponding group of columns in the array. The column address is incremented and the row address reset, and the process repeated until a column limit is reached.

Abstract: A user interface is presented on a monitor of a media device for providing information about available programs. The user interface includes an array having three columns (channel, current show, and next show) with commonly aligned rows. Each row of the channel column includes an indicator. Each row of the current show column includes a title naming a program currently available on a channel of the media device corresponding to the indicator in a commonly aligned row of the channel column. Each row of the next show column includes a title naming a show available after the current program on the same channel. The currently available program may be displayed on the monitor in response to a viewer selected row, indicator, and/or title in the array.

Abstract: Trajan's Column is best known for its sculptured spiral frieze celebrating Trajan's victories in the Dacian Wars, but it is also a complex architectural monument representing an impressive feat of engineering. The Column is made up of 29 blocks of Luna marble weighing from 25 to 77 tons, the highest of which had to be raised to 38.4 m above ground. In this paper I discuss the evidence both for the construction of the Column and for the organization of the building site. Excavations earlier in this century revealed an unusual use of brick ribbing in the vaulted substructures of the north portico, which I propose was intended as reinforcement for the vaults over which the individual blocks of the Column were maneuvered before being lifted into place. This implies that the work site for the blocks lay to the north of the Column courtyard (where the later Temple of Divine Trajan is traditionally located), which is the area most easily accessible from any unloading point along the Tiber. Finally, I propose a hypothetical reconstruction of a lifting device for the blocks making up the Column based on comparative evidence from other sites, on ancient literary descriptions of building methods, and on calculations of the bearing capacities of timbers, ropes, and capstans.

Abstract: A memory circuit that includes a series of parallel elongated diffusion bit lines and an array of 2-bit non-volatile memory cells connected between the diffusion bit lines. Column select circuits are located at the ends of the diffusion bits lines that selectively connect the diffusion bit lines to a bit line decoder circuit to read appropriate signals from selected memory cells. A series of metal jumpers extend over and connect the ends of the diffusion bit lines. By connecting both ends of the diffusion bit lines together, the metal jumpers allow the diffusion bit lines to be longer without increasing resistance, so that a single pair of column select circuit control a large number of memory cells to increase the area efficiency of the memory array. Conversely, the metal jumpers reduce the resistance in shorter diffusion bit lines, thereby increasing memory array endurance.

Abstract: In an active matrix liquid crystal display device comprising display elements (10) addressed via sets of row and column address conductors (14, 16) connected respectively to row and column drive circuits (30, 35) and with the column drive circuit (35) being of the kind operable to transfer data signals for the display elements of a row to groups of column address conductors (16) in sequence in respective group address periods in a multiplexing manner, the occurrence of undesirable display artefacts is alleviated by applying during the group address period for one group a pre-charging signal to the adjacent column address conductor of the next-addressed group according to the value of a data signal for a column conductor in that one group. This can be achieved conveniently by providing in addition to a multiplexing switch (36) for that adjacent column conductor a supplementary switch (Tx) connected to a video input line (V1, V2, V3) which operates simultaneously with the multiplexer switches of the previously addressed group.

Abstract: In a semiconductor memory device, a plurality of memory cells are arranged in a matrix. Each of the plurality of memory cells is connected to one of a plurality of word lines and is connected to one of a plurality of bit lines such that a plurality of columns are formed from the plurality of memory cells. A word line selecting section selects one of the plurality of word lines based on a first address. A first column selector selects one of the plurality of columns as a first column based on the first address. A second column selector selects another one of the plurality of columns as a second column based on a second address. An address data of a predetermined portion of the first address is not equal to an address data of the second address. An input/output section includes a first sense amplifier and a first buffer. A first read operation is performed to a first memory cell connected to the selected word line and the first column through the first sense amplifier and the first column selector and a first write operation is performed to a second memory cell connected to the selected word line and the second column through the first buffer and the second column selector.

Abstract: A computer system providing a framework for mapping relational tables to object oriented classes. The framework includes an attribute class for defining data corresponding to columns in a relational table and including data objects used to map between the relational table and a programmer-defined object oriented class. The attribute class also including flags used to indicate modifications to the data. The framework further includes a generator class providing methods for generating SQL text corresponding to the relational table as defined in the attribute class objects for a given table.

Abstract: A cached synchronous dynamic random access memory (cached SDRAM) device having a multi-bank architecture and a programmable caching policy includes a synchronous dynamic random access memory (SDRAM) bank, a synchronous static randomly addressable row register, a select logic gating circuit, and mode register for programming of the cached SDRAM to operate in a Write Transfer mode corresponding to a Normal Operation mode of a standard SDRAM during a Write cycle, and to operate in a No Write Transfer mode according to an alternate operation mode during a Write cycle, thereby operating under a first and a second caching policy, respectively. The SDRAM includes a row decoder for selecting a row of data in a memory bank array, sense amplifiers for latching the row of data selected by the row decoder, and a synchronous column selector for selecting a desired column of the row of data. The row register stores a row of data latched by the sense amplifiers and the select logic gating circuit, 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 being performed.

Abstract: A display device comprising a plurality of picture elements arranged in rows and columns, each picture element being switchable between at least two states having different optical output characteristics, a plurality of row and column drivers, connected to said rows and columns respectively, for switching said picture elements between said states, wherein at least one switch is provided for switching at least one of said drivers between a first configuration in which the driver drives at least one row or column, and a second configuration, different from said first configuration, in which the driver drives at least two rows or columns.

Abstract: Provided is an indexing system for structured or semi-structured source data comprising a tokenizer for accepting source data and generating tokens representing the source data, the tokens from the tokenization representing the source data in a relational view, where for tokens representing a subset of the source data, the system generates tokens identifying the table and column of the subset of the data in the relational view of the source data, and an index builder for building index structures based on the tokens generated by the tokenizer, the index builder creating indexes which comprise a set of positional indexes for indicating the position of token data in the source data, a set of lexicographical indexes comprising a sort vector index and a join bit index, associated with the sort vector index, a set of data structures mapping between the lexicographical indexes and the positional indexes.

Abstract: We study the problem of protecting sensitive data in a statistical two-dimensional table, when the non-sensitive table entries are made public along with the row and column totals. In particular, we address theNP-hard problem known in the literature as the (secondary) cell suppression problem. We introduce a new integer linear programming model and describe several new families of additional inequalities used to strengthen the linear relaxation of the model. Exact and heuristic separation procedures are also proposed and embedded within a branch-and-cut algorithm for the exact solution of the problem. The algorithm makes use of an efficient heuristic procedure to find near-optimal solutions. We report the exact solution of instances involving up to 250,000 cells and 10,000 sensitive cells, i.e., more than 3 orders of magnitude larger than those solved by previous techniques from the literature. A statistical agency collects data to be processed and published. Raw material is in- formation obtained from individual respondents. Usually, this data is obtained under a pledge of confidentiality: statistical agencies have the responsibility of not releasing any data or data summaries from which individual respondent information can be revea- led (sensitive data). On the other hand, statistical agencies aim at publishing as much information as possible. This results in a trade-off between privacy rights and infor- mation loss, an issue of primary importance in practice. We refer the interested reader to Willenborg and Waal (18) for an in-depth analysis of statistical disclosure control methodologies. Starting in 1996, the European Union supported through EUROSTAT (the European statistical office) a 3-year ESPRIT research project aimed at developing and testing new methodologies within statistical disclosure control. The project, coordinated by Dr. Leon Willenborg from CBS (Central Bureau of Statistics, Netherlands), involves several research groups from both academia and national statistical offices. We participate in the project for the definition of mathematical models and solution algorithms for protecting sensitive information in tabular data. Cell suppression is one of the most-widely applied techniques for disclosure avoi- dance. In this work we study the problem of applying this technique to protect sensitive information in a two-dimensional table of statistics, in which the non-sensitive data is

Abstract: A method for performing table summarization. In a data network requests arrive at random from viewing devices (i.e., PC, PDA, laptop, etc.) to view objects which oftentimes contain large tables. The table summarization method compresses the rows/columns of the large tables in addition to the column formats to more easily display the table on the viewing device, which oftentimes has a limited display capability. A set of default rules is specified for determining how the table compression is to be performed. In addition to the default rules, a user may specify a user viewing preference to further modify the table display. The table summarization method is performed dynamically. That is, it is performed in real-time in response to a user request which typically is issued over a data network such as the Internet.

Abstract: An extensible framework provides a unified interface for data manipulation in a dynamic object-based format. A data access layer of the Transmission Control Protocol/Internet Protocol (TCP/IP) Graphical User Interface (GUI) component uses ODBC to read and write files. Four abstractions implement the framework. These are (1) a CDatabaseManager class that provides access to data stored in a database; (2) a CSpecializedFile class which composes a CDatabaseManager that abstracts the management of reading and writing to database files and provides a unified interface for use by accessors. If the base class functionality of the CSpecializedFile class is not sufficient then derived specialized file classes are implemented to override the CSpecializedFile commit method and update the file in a different-fashion and/or implement specialized get/set methods by column data item and data type; (3) a CRecordArray class which manages vectored access to information stored as objects in a CColumnData class; and (4) a CColumnData object which manages changes made to the information and saves it when requested.

Abstract: This thesis proposes column caching and curious caching, two mechanisms that enable caches to be dynamically customized, improving performtance and resource control and enabling novel functionality. Column caching provides the ability to partition a cache between address regions while curious caching provides the ability for devices other than the master to insert data into the cache. Column and curious caching provide simple, controlled ways to dynamically change the traditionally static replacement policy that treats all memory and cache locations the same. These mechanisms were conceived during the design of START-VOYAGER, a highperformance parallel system. That effort demonstrated how current memory hierarchies and bus protocols interfere with fast communication. Though the mechanisms were originally developed for communciation, they are surprisingly useful elsewhere. For example, column/curious caching can minimize pollution, reduce miss rates, improve multitasking/multithreading performance, reduce or eliminate read latencies and implement new functionalities such as bus-accessal$1e SRAM within the cache. This thesis motivates column and curious caching by high-performance communciation, evaluates these adaptive mechanisms for communication and other uses and proposes various implementations designed for different constraints. It demonstrates how these simple mechanisms can enable substantial performance improvements and support a wide range of additional functionality. Thesis Supervisor: Arvind Title: Professor of Computer Science Thesis Supervisor: Larry Rudolph Title: Principal Research Scientist

Abstract: As information systems do more and reach more users in more locations, complexity and size have become dominant factors in systems development. in this column, Hugh W. Ryan shares his experiences in developing large, complex systems and provides insight on how to manage their development.

Abstract: The present invention is a memory circuit for writing prescribed numbers of bits of write data, determined according to the burst length, in response to write command, comprising: a first stage for inputting, and then holding, row addresses and column addresses simultaneously with the write command; a second stage having a memory core connected to the first stage via a pipeline switch, wherein the row addresses and column addresses are decoded, and word line and sense amps are activated; a third stage for inputting the write data serially and sending the write data to the memory core in parallel; and a serial data detection circuit for generating write-pipeline control signal for making the pipeline switch conduct, after the prescribed number of bits of write data has been inputted. According to the present invention, in an FCRAM exhibiting a pipeline structure, the memory core in the second stage can be activated after safely fetching the write data in the burst length. When writing successively or reading successively, moreover, the command cycle can made short irrespective of the burst length.

Abstract: Disclosed is a system, method, and program for performing a join operation on a multi-column table and at least two satellite tables having a join condition. Each satellite table is comprised of multiple rows and at least one join column. Each multi-column table is comprised of multiple rows and at least one column corresponding to the join column in each satellite table. A join operation is performed on the rows of the satellite tables to generate a first join result comprising concatenations of the rows of the satellite tables. Less than all the concatenated rows in the first join result that satisfy the join condition are then selected. The selected concatenated rows in the first join result are then joined to the multi-column table.

Abstract: Methods, systems and computer program products are provided which allow for accessing at least one data source by intercepting a command to a standard relational database management system and determining if the intercepted command accesses the data source utilizing a logical table name. If the intercepted command accesses the data source utilizing the logical table name, then the logical table name is translated to a physical table name. The intercepted command is the provided to the relational database management system utilizing the physical table name translated from the logical table name so as to provide access the data source utilizing the logical table name. Furthermore, if the intercepted command accesses the data source utilizing a logical table name and a logical column name, then the logical table name is translated to the physical table name and the logical column name translated to a physical column name.

Abstract: The SQL compiler and SQL executor in a database management system are extended to execute statements for dequeuing rows from a database table and statements that both updating tuples and return those tuples to a calling application. During execution of a select statement that includes an embedded update or delete operation, a table access operator accesses a defined range of rows in a database table. The table access operator receives from a calling application a request for rows dequeued from the database table. The table access operator responds to the requests for rows by returning to the calling application qualifying rows, if any, from the database table and also by performing the embedded delete or update operation. The SQL executor returns control to the calling application only after all rows deleted or updated by the table access operator have been sent to the calling application.

Abstract: According to the principles of the invention, there is provided a system for generating a message authentication code for a conventional digital video stream. The system operates on the rows and columns of block data for a video stream, and more specifically on histograms of DC coefficients from each row and column, to produce a compact code that is nonetheless descriptive of the underlying images in the video stream. The message authentication code can be reproduced from the images of a received video stream, and if desired, compared with a digital watermark embedded in the video stream in order to confirm the accuracy of the video content or identify the source of the video stream.

Abstract: In order to implement a capacitor-type anti-fuse having desired breakdown voltage characteristics and efficiently and reliably set in a blown state while reliably holding program information in a normal operation mode, capacitance elements having the same structure as memory cell capacitors are arranged alignedly along a row or column direction and coupled in parallel with each other for implementing a capacitor-type anti-fuse. The memory cell pattern is repeated also in a peripheral circuit region, whereby capacitance elements having a complete structure can be implemented to implement a capacitor-type anti-fuse correctly having desired characteristics.

Abstract: Disclosed is a method, system, program, and data structure for transforming at least one column in a database input table. An input data table has multiple columns and rows. A determination is made of multiple data column names and multiple pivot columns in the input table. A row is generated in an output table for each data column name, having one data column name field including one data column name and at least one pivot column field including the value in one pivot column field in the input table, wherein each of the rows in the output table for each data column name has different values in at least one of the data column name field and pivot column field.

Abstract: A method for displaying, in a window on a computer display screen, tabular data arranged in rows and columns, wherein the sum of the widths of the columns is greater than the width of the workspace available within the window. The method includes the steps of determining the width of each column, determining the height of each row, and determining the dynamic height and width of the workspace available for the display of tabular data within said window. The method further includes the step of dividing said tabular data into table segments, each table segment comprising one or more columns of said tabular data. The method also includes the step of dividing said workspace into panes, each pane having a height determined by dividing the height of the window by the number of table segments, and displaying within each pane all of the columns of a table segment and one or more rows, wherein different columns are displayed in each pane and the same rows are displayed in each pane.