TL;DR: In this article, a complete overview of the work done so far on the research and implementation of dividing wall columns can be found, from early ideas on thermal coupling of distillation columns to practical issues that needed to be solved for their successful implementation.
Abstract: Dividing wall column (DWC) is a single shell, fully thermally coupled distillation column capable of separating mixtures of three or more components into high purity products. Compared to conventional columns-in-series and/or in-parallel configurations a DWC requires much less energy, capital and space. This makes DWC to something that corresponds with the present day idea of sustainable process technology. Based on published papers and patent literature this paper aims to give a complete overview of the work done so far on the research and implementation of DWCs, from early ideas on thermal coupling of distillation columns to practical issues that needed to be solved for their successful implementation. Approaches to short-cut and rigorous simulation, optimization, and control are highlighted, with particular focus on column internals and dimensioning, which is only conceptually considered in academic publications. A survey of relevant patents is included providing information on equipment innovations and application areas of industrial interest. Finally authors look at what is needed on research and engineering side to enable maximization of potential gains by building DWCs for obtaining four or even more products containing two or more partition walls in parallel, which is something not yet attempted in industrial practice.
TL;DR: In this article, a mobile communications device configures a user interface to include a plurality of representations of content arranged according to the plurality of columns that permits navigation between first and second columns upon detection of a gesture input via a touchscreen of the mobile communication device.
Abstract: Column organization of content is described. In an implementation, a mobile communications device configures a user interface to include a plurality of representations of content arranged according to a plurality of columns that permits navigation between first and second said columns upon detection of a gesture input via a touchscreen of the mobile communications device. The user interface is displayed on a display device of the mobile communications device. The first column is configured for vertical navigation through each of the plurality of representations and the second column includes a filtered subset of the plurality of representations such that at least one of the representations is included in the first column and not the second column.
TL;DR: This work proposes a robust algorithm for discovering single-column and multi-column foreign keys using a general rule, termed Randomness, that subsumes a variety of other rules and develops efficient approximation algorithms for evaluating randomness, using only two passes over the data.
Abstract: A foreign/primary key relationship between relational tables is one of the most important constraints in a database. From a data analysis perspective, discovering foreign keys is a crucial step in understanding and working with the data. Nevertheless, more often than not, foreign key constraints are not specified in the data, for various reasons; e.g., some associations are not known to designers but are inherent in the data, while others become invalid due to data inconsistencies. This work proposes a robust algorithm for discovering single-column and multi-column foreign keys. Previous work concentrated mostly on discovering single-column foreign keys using a variety of rules, like inclusion dependencies, column names, and minimum/maximum values. We first propose a general rule, termed Randomness, that subsumes a variety of other rules. We then develop efficient approximation algorithms for evaluating randomness, using only two passes over the data. Finally, we validate our approach via extensive experiments using real and synthetic datasets.
TL;DR: A new approach based on ant colony optimization (ACO) is proposed to solve the set covering problem, which adopts a novel method, called single-row-oriented method, to construct solutions.
TL;DR: A table navigation system includes: a table identifier to identify a table and columns within the table; a navigation identifier to determine whether a navigation input by a user to navigate within a column of the table exceeds a threshold, wherein the threshold relates to an expectation of continued navigation input.
Abstract: A table navigation system includes: a table identifier to identify a table and columns within the table; a navigation identifier to determine whether a navigation input by a user to navigate within a column of the table exceeds a threshold, wherein the threshold relates to an expectation of continued navigation input by the user; a filter to filter unique elements in the column into separate categories; and a display engine to present the into separate categories in an interactive display that overlays the table.
TL;DR: In response to detected hold portion of a hold and flick gesture, a row or column in a table may be selected or deleted using upflick or leftflick gestures as discussed by the authors.
Abstract: Computing equipment may display tables of data that contain rows and columns. Touch gestures such as hold and flick gestures may be detected using a touch screen or other touch sensor. In response to a detected hold portion of a hold and flick gesture, a row or column in a table may be selected. In response to detection of a simultaneous flick portion, columns or rows may be inserted or deleted. A column may be inserted after a selected column using a hold and right downflick gesture. A hold and left downflick gesture may be used to insert a column before a selected column. Rows may be inserted before and after selected rows using hold and upper rightflick and hold and lower rightflick gestures. One or more columns or rows may be deleted using upflick or leftflick gestures.
TL;DR: It is shown that anatomical columns are not solid structures, that they are part of locally interdigitating systems, that any delimited column also participates in a widely distributed network, and that columns (as “modules”) occur widely in the brain in non-cortical structures.
Abstract: “Column,” like “gene,” has both conceptual and linguistic shortcomings. The simple question “what is a column” is not easy to answer and the word itself is not easy to replace. In the present article, I have selected five points, in no way comprehensive or canonical, but which may nevertheless serve as a prompt and aid for further discussions and reevaluation. These are: that anatomical columns are not solid structures, that they are part of locally interdigitating systems, that any delimited column also participates in a widely distributed network, that columns are not an obligatory cortical feature, and that columns (as “modules”) occur widely in the brain in non-cortical structures. I focus on the larger scale macrocolumns, mainly from an anatomical perspective. My position is that cortical organization is inherently dynamic and likely to incorporate multiple processing styles. One can speculate that the distributed mappings within areas like piriform cortex may resemble at least one mode of neocortical processing strategy.
TL;DR: In this article, a column-store database computer system is implemented in the memory space of the computer system and is operatively coupled in an update data transfer path between a database engine interface and the stable data table.
Abstract: A column-store database computer system responsive to database requests for the update and retrieval of data from within a stable data table providing for the storage of database tuples within a column-store organized database structure. A positional delta tree data structure is implemented in the memory space of the computer system and is operatively coupled in an update data transfer path between a database engine interface and the stable data table. The positional delta tree data structure includes a differential data storage layer operative to store differential update data values in positionally defined relative reference to database tuples stored by the stable data table.
TL;DR: This paper studies query operators like scan and aggregation on compressed data structures implemented in TREX, a database engine forBI accelerator solutions that achieves high performance when processing complex analytic queries in large data warehouses.
Abstract: BI accelerator solutions like the SAP NetWeaver database engine TREX achieve high performance when processing complex analytic queries in large data warehouses. They do so with a combination of column-oriented data organization, memory-based processing, and a scalable multiserver architecture. The use of data compression techniques further reduces both memory consumption and processing time. In this paper we study query operators like scan and aggregation on compressed data structures implemented in TREX.
TL;DR: A computer system includes a memory and a processor coupled to the memory that is configured to execute instructions that cause execution of an in-memory database system that includes one or more database tables.
Abstract: A computer system includes a memory and a processor coupled to the memory. The processor is configured to execute instructions that cause execution of an in-memory database system that includes one or more database tables. Each database table includes a plurality of rows, where data representing each row is stored in the memory. The in-memory database system also includes a plurality of indexes associated with the one or more database tables, where each index is implemented by a lock-free data structure. Update logic at the in-memory database system is configured to update a first version of a particular row to create a second version of the particular row. The in-memory database system includes a non-blocking garbage collector configured to identify data representing outdated versions of rows.
TL;DR: In this article, the structural integrity of steel and composite structures under exceptional events was evaluated by using a substructure test simulating the loss of a column in a composite building at Liège University and the development of membrane forces and their effects on the behavior of the beam-to-column joints are discussed.
Abstract: Recent events such as natural catastrophes or terrorism attacks have highlighted the necessity to ensure the structural integrity of buildings under exceptional events. According to Eurocodes and some different other national design codes, the structural integrity of civil engineering structures should be ensured through appropriate measures. Design requirements are proposed in some codes but are nowadays seen generally as not satisfactory. In particular, it is not demonstrated that, even if these requirements are respected, the risk of a progressive collapse of the structure subjected to an exceptional event will really be mitigated. A European RFCS project entitled “Robust structures by joint ductility” has been set up in 2004, for three years, with the aim to provide requirements and practical guidelines allowing to ensure the structural integrity of steel and composite structures under exceptional events through an appropriate robustness. In particular, one substructure test simulating the loss of a column in a composite building was performed at Liège University. The present paper describes in details this substructure test. In particular, the development of membrane forces is illustrated and their effects on the behaviour of the beam-to-column joints are discussed.
TL;DR: The essay remains critical to academic success as discussed by the authors, and the author is alive and well, and has a blog, as Chesher (2005, para. 1) has noted.
Abstract: Mark Warschauer University of California, Irvine Less than two decades ago, new forms of socially constructed multimedia were believed to be devaluing writing, marginalizing the essay, and contributing to a postmodern death of the author (e.g., Faigley, 1997; Landow, 1992). But today, writing is more important than ever before (National Commission on Writing, 2003), mastery of the essay remains critical to academic success (Intersegmental Committee of the Academic Senates, 2002), and, as Chesher (2005, para. 1) has noted, “the author is alive and well, and has a blog.”
TL;DR: In this article, a data analysis program receives a selection of data fields defining multiple row header areas and/or multiple column header areas for display in a summary table, which is read from a data source containing values for the data fields and transformed into summary level data for building the summary table.
Abstract: A data analysis program receives a selection of data fields defining multiple row header areas and/or multiple column header areas for display in a summary table. Data is read from a data source containing values for the data fields and transformed into summary level data for building the summary table. A display is rendered in the summary table for each of the multiple row header areas and column header areas defined, with the row header areas being displayed vertically adjacent to one another and the column header areas being displayed horizontally adjacent to one another.
TL;DR: A survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices with prescribed row and column sums can be found in this paper.
Abstract: This is a survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices with prescribed row and column sums. We discuss cardinality estimates, the structure of a random matrix from the set, discrete versions of the Brunn-Minkowski inequality and the statistical dependence between row and column sums.
TL;DR: In this paper, touch gestures such as tap and flick gestures may be detected using the touch screen or other touch sensor, and the computing equipment may select and highlight a corresponding row or column in a displayed table.
Abstract: Computing equipment such as devices with touch screen displays and other touch sensitive equipment may be used to display tables of data to a user. The tables of data may contain rows and columns. Touch gestures such as tap and flick gestures may be detected using the touch screen or other touch sensor. In response to a detected tap such as a tap on a row or column header, the computing equipment may select and highlight a corresponding row or column in a displayed table. In response to a flick gesture in a particular direction, the computing equipment may move the selected row or column to a new position within the table. For example, if the user selects a particular column and supplies a right flick gestures, the selected column may be moved to the right edge of a body region in the table.
TL;DR: In this article, a logic low to the first potential, which may be ground, and then further reducing the applied voltage, the requirements on the source of the second potential are reduced.
Abstract: A method of writing data to a selected column of a memory (10) includes selecting a first column. The data writing is initiated by applying a logic high to a first bit line (BL0) of the first column and a first potential to a second bit line (BLB0) of the first column that is lower than the logic high. The first potential is removed and a second potential is applied to the second bit line. The second potential is less than the first potential. The first potential may be ground (VSS), and the second potential may be a negative voltage (VNEG). Reducing the write voltage for the bit line that is receiving a logic low improves its ability to be written. By first bringing the logic low to the first potential, which may be ground, and then further reducing the applied voltage, the requirements on the source of the second potential are reduced.
TL;DR: In this paper, data of a projection of a database is stored at least partly in grouped ROS format and partly in column format based on patterns of updating the projection data, and the projected data is updated so that the updated projection is stored in grouped-ROS format and part in column-ROC format.
Abstract: Methods, systems and program products for database storage. In one implementation, data of a projection of a database is stored at least partly in grouped ROS format and partly in column format based on patterns of updating the projection data. The projection data is updated so that the updated projection is stored partly in grouped ROS format and partly in column format.
TL;DR: In this paper, the FAJ introduces the Guest Editorial column, which will appear occasionally, and introduces the idea of using a guest editorial column as a summary of the article's content.
Abstract: Editor’s Note: With this piece, the FAJ introduces the Guest Editorial column, which will appear occasionally.
TL;DR: In this paper, a method for establishing and inquiring index of a distributed column storage database, a device and a system thereof is described, which is implemented by matching corresponding index files to obtain corresponding values of Row fields when a client launches an inquiry request with the column fields as inquiry condition and result.
Abstract: The invention discloses methods for establishing and inquiring index of a distributed column storage database, a device and a system thereof. The method for establishing index of a distributed column storage database comprises the steps of obtaining the column fields in the distributed column storage database to generate a column index file with the column fields as keywords, wherein the column index file contains the mapping relation between the values of the column fields in the distributed column storage database and the values of the corresponding Row fields; storing the column index file into the index directory corresponding to the column fields in the distributed column storage database. The method for inquiring index is implemented by matching corresponding index files to obtain corresponding values of Row fields when a client launches an inquiry request with the column fields as inquiry condition and result. By adopting the invention, fast inquiry of other column fields except for the Row fields can be realized in the prior distributed column storage database.
TL;DR: In this paper, the authors present a system for viewing, aligning, and correlating data in a visual display from data sources in data management systems, where data attributes from the data sources can be displayed together as graphical cells over a common timeline as a reference for cell attribute columns.
Abstract: Systems and methods are provided for viewing, aligning, and correlating data in a visual display from data sources in data management systems. In one method, data sources in a data management system can be identified. Data attributes from the data sources can be displayed together as graphical cells over a common timeline as a reference for cell attribute columns. A first graphical cell in an attribute column at a time position on the common timeline can be selected. The graphical cell can represent a data record for a time measurement interval. A second graphical cell can be aligned with the first graphical cell based on the time position. The second graphical cell can be positioned in a same cell column as the first graphical cell and represent data obtained at a substantially same time as the data represented by the first graphical cell.
TL;DR: The authors look at some labeling technologies, especially 2D bar codes, and talk about their adoption around the world and applications of 2D labels in print media as well as popular applications of 1D bar code that support price comparisons on mobile phones.
Abstract: This column focuses on labeling the real world. The authors look at some labeling technologies, especially 2D bar codes, and talk about their adoption around the world. They also discuss applications of 2D labels in print media as well as popular applications of 1D bar codes that support price comparisons on mobile phones.
TL;DR: The current work's purpose is to evaluate the performances of the Hbase-0.20.2 implementation in comparison with the performances offered by BigTable, and to investigate how they are affected by increasing the number of servers, by theNumber of column families and by the system configuration parameters.
Abstract: Hbase is the open source version of BigTable - distributed storage system developed by Google for the management of large volume of structured data. Hbase emulates most of the functionalities provided by BigTable. Like most non SQL database systems, Hbase is written in Java. The current work's purpose is to evaluate the performances of the Hbase-0.20.2 implementation in comparison with those of the Hbase-0.20.0 implementation, and, of course, with the performances offered by BigTable. The tests aim at evaluating the performances regarding the random writing and random reading of rows, how they are affected by increasing the number of servers, by the number of column families and by the system configuration parameters.
TL;DR: In this article, a method for assigning cell properties based on user-defined metadata in a spreadsheet is described, which involves associating cells at an intersection of at least one row containing the at least 1 row metadata and at least 2 columns containing the 1 column metadata into a set.
Abstract: Methods and devices are provided for assigning cell properties based on user-defined metadata in a spreadsheet. In one embodiment, the method may involve receiving at least one row metadata and at least one column metadata. The method may involve associating cells at an intersection of at least one row containing the at least one row metadata and at least one column containing the at least one column metadata into a set. The method may involve assigning at least one property (e.g., formatting attribute and/or content) for the set. In related aspects, the method may further involve, in response to a user changing the at least one property in any cell of the set, applying the changed at least one property to each cell of the set.
TL;DR: A framework for mining subjectively interesting pattern sets that is based on the encoding of prior information in a model for the data miner's state of mind and the search for a pattern set that is maximally informative while efficient to convey to the data Miner is suggested.
Abstract: This paper suggests a framework for mining subjectively interesting pattern sets that is based on two components: (1) the encoding of prior information in a model for the data miner's state of mind; (2) the search for a pattern set that is maximally informative while efficient to convey to the data miner.We illustrate the framework with an instantiation for tile patterns in binary databases where prior information on the row and column marginals is available. This approach implements step (1) above by constructing the MaxEnt model with respect to the prior information [2, 3], and step (2) by relying on concepts from information and coding theory.We provide a brief overview of a number of possible extensions and future research challenges, including a key challenge related to the design of empirical evaluations for subjective interestingness measures.
TL;DR: This paper presents column-oriented databases, which are considered an element of the new generation of DBMS technology and emphasizes the need and the advantages of these databases for an analytical environment and makes a short presentation of two of the DBMS built in a columnar approach.
Abstract: It is widely accepted that a data warehouse is the central place of a Business Intelligence system. It stores all data that is relevant for the company, data that is acquired both from internal and external sources. Such a repository stores data from more years than a transactional system can do, and offer valuable information to its users to make the best decisions, based on accurate and reliable data. As the volume of data stored in an enterprise data warehouse becomes larger and larger, new approaches are needed to make the analytical system more efficient. This paper presents column-oriented databases, which are considered an element of the new generation of DBMS technology. The paper emphasizes the need and the advantages of these databases for an analytical environment and make a short presentation of two of the DBMS built in a columnar approach.
TL;DR: In this paper, a method and system for electronic options trading on a graphical user interface is presented, where one or more sets of electronic option trading information are automatically displayed in a graphical in a dynamic option information column in a market depth format.
Abstract: A method and system for electronic options trading on a graphical user interface. One or more sets of electronic option trading information are automatically displayed in a graphical in a dynamic option information column in a market depth format. The information displayed in the dynamic option information column is dynamically selectable and changeable based on electronic option trading preferences. The dynamic option information column is automatically and dynamically re-centered upon a current selected graphical option information entity displayed in the dynamic option information column that continuously and dynamically changes with changes in the dynamic option information displayed. Risk management and assessment for electronic options trading is also provided.
TL;DR: In this article, the column-parallel analog-to-digital converters (ADCs) are calibrated only once per frame (or less frequently) to reduce column-wise noise.
Abstract: Circuits, methods, and apparatus are described that provide calibration of column-parallel analog-to-digital converters (ADCs) in image processing contexts only once per frame (or less frequently) to reduce column-wise noise. For example, the column ADCs are calibrated during an inter-frame time interval, like a vertical blanking interval. In some embodiments, calibration data for the column ADCs for a calibration period is stored at the digital block for use in processing row data from the column ADCs. In other embodiments, calibration data for the column ADCs for the calibration period is stored at column ADCs in a local memory for local correction of the pixel data prior to being read out to the digital block for processing. In certain embodiments, techniques, such as differential ADC architectures, are used to mitigate row-wise noise in context of the frame-wise calibration.
TL;DR: A new column oriented storage infrastructure for network flow records, called NetStore, which is aware of network data semantics and access patterns, and benefits from the simple column oriented layout without the need to meet general purpose RDBMS requirements.
Abstract: With the increasing sophistication of attacks, there is a need for network security monitoring systems that store and examine very large amounts of historical network flow data. An efficient storage infrastructure should provide both high insertion rates and fast data access. Traditional row-oriented Relational Database Management Systems (RDBMS) provide satisfactory query performance for network flow data collected only over a period of several hours. In many cases, such as the detection of sophisticated coordinated attacks, it is crucial to query days, weeks or even months worth of disk resident historical data rapidly. For such monitoring and forensics queries, row oriented databases become I/O bound due to long disk access times. Furthermore, their data insertion rate is proportional to the number of indexes used, and query processing time is increased when it is necessary to load unused attributes along with the used ones. To overcome these problems we propose a new column oriented storage infrastructure for network flow records, called NetStore. NetStore is aware of network data semantics and access patterns, and benefits from the simple column oriented layout without the need to meet general purpose RDBMS requirements. The prototype implementation of NetStore can potentially achieve more than ten times query speedup and ninety times less storage size compared to traditional row-stores, while it performs better than existing open source columnstores for network flow data.
TL;DR: In this paper, a partial update of a hierarchically structured document referencing one or more records stored in a database is proposed. But, the document is searched to find update target position(s) based on the received expression, a pending update list is built, and a row of a document column in a base table is updated with the new version number for the document.
Abstract: Methods and apparatus, including computer program products, implementing and using techniques for performing a partial update of a hierarchically structured document referencing one or more records stored in a database An expression specifying one or more updates to be applied to the document is received The document is searched to find update target position(s) Based on the received expression, a pending update list is built When an update target position is found, a row of a document column in a base table is updated with the new version number for the document New database records for insertion into the new document version are generated from the pending update list Old database records to be replaced are identified A database table for the document is updated to mark the old database records as obsolete and to add new database records to be referenced in the new version of the document
TL;DR: In this paper, a method for processing data contained in tables in a relational database includes joining a first table and a second table into a joined table determining metadata for at least one column of a table of the following tables: the first table, the second table and the joined table.
Abstract: A method for processing data contained in tables in a relational database includes joining a first table and a second table into a joined table determining metadata for at least one column of a table of the following tables: the first table, the second table, and the joined table. The metadata is used for processing data in the at least one column of the table, and for processing data in at least one column of at least one other table of the following tables: the first table, the second table, and the joined table.