Mynodbcsv: Lightweight Zero-Config Database Solution for Handling Very Large CSV Files.

Volumes of data used in science and industry are growing rapidly. When researchers face the challenge of analyzing them, their format is often the first obstacle. Lack of standardized ways of exploring different data layouts requires an effort each time to solve the problem from scratch. Possibility to access data in a rich, uniform manner, e.g. using Structured Query Language (SQL) would offer expressiveness and user-friendliness. Comma-separated values (CSV) are one of the most common data storage formats. Despite its simplicity, with growing file size handling it becomes non-trivial. Importing CSVs into existing databases is time-consuming and troublesome, or even impossible if its horizontal dimension reaches thousands of columns. Most databases are optimized for handling large number of rows rather than columns, therefore, performance for datasets with non-typical layouts is often unacceptable. Other challenges include schema creation, updates and repeated data imports. To address the above-mentioned problems, I present a system for accessing very large CSV-based datasets by means of SQL. It's characterized by: "no copy" approach - data stay mostly in the CSV files; "zero configuration" - no need to specify database schema; written in C++, with boost [1], SQLite [2] and Qt [3], doesn't require installation and has very small size; query rewriting, dynamic creation of indices for appropriate columns and static data retrieval directly from CSV files ensure efficient plan execution; effortless support for millions of columns; due to per-value typing, using mixed text/numbers data is easy; very simple network protocol provides efficient interface for MATLAB and reduces implementation time for other languages. The software is available as freeware along with educational videos on its website [4]. It doesn't need any prerequisites to run, as all of the libraries are included in the distribution package. I test it against existing database solutions using a battery of benchmarks and discuss the results.

Growth of and partitioning between shoot and storage root of carrot in a northern climate

Selostus: Porkkanan kasvu ja biomassan jakautuminen varastojuuren ja verson välillä pohjoisissa oloissa

The effect of storage ageing and spring sprouting of seed tubers on the yield of three potato varieties in the Finnish Lapland : Research Note

Selostus: Siemenmukuloiden varastointiaikaisen lämpökäsittelyn ja kevätidätyksen vaikutus kolmen perunalajikkeen satoon Lapissa

Effect of harvest time on storage loss and sprouting in onion

Selostus: Sadonkorjuuajan vaikutus sipulin varastohävikkiin ja varastoinnin jälkeiseen versomiseen

O2, the Oberta in Open Access : institutional repository

Tríptic informatiu sobre la publicació de documents amb accés obert en el repositori institucional de la UOC, O2 (La Oberta en obert). Aquest informa sobre quins documents hi poden publicar els membres de la comunitat UOC, com fer-ho i els serveis de valor afegit per a tots els usuaris (web 2.0, subscripció per RSS o correu electrònic, exportació al gestor bibliogràfic Refworks, etc.) i per a la recerca (lligam amb l'aplicació d'avaluació de la recerca GIR i informació del factor d'impacte de la revista a SCOPUS, IN-RECS/IN-RECJ i MIAR).

Binary proposal for assessing quality of Open Access Institutional Repositories : the case of Spanish repositories

The reason for this study is to propose a new quantitative approach on how to assess the quality of Open Access University Institutional Repositories. The results of this new approach are tested in the Spanish University Repositories. The assessment method is based in a binary codification of a proposal of features that objectively describes the repositories. The purposes of this method are assessing the quality and an almost automatically system for updating the data of the characteristics. First of all a database was created with the 38 Spanish institutional repositories. The variables of analysis are presented and explained either if they are coming from bibliography or are a set of new variables. Among the characteristics analyzed are the features of the software, the services of the repository, the features of the information system, the Internet visibility and the licenses of use. Results from Spanish universities ARE provided as a practical example of the assessment and for having a picture of the state of the development of the open access movement in Spain.

Self-avoiding random walks and Olbers' paradox

In this paper, we prove that a self-avoiding walk of infinite length provides a structure that would resolve Olbers' paradox. That is, if the stars of a universe were distributed like the vertices of an infinite random walk with each segment length of about a parsec, then the night sky could be as dark as actually observed on the Earth. Self-avoiding random walk structure can therefore resolve the Olbers' paradox even in a static universe.

Thermal energy storage with phase change materials in building envelopes

Els materials de canvi de fase (PCM) han estat considerats per a l’emmagatzematge tèrmic en edificis des de 1980. Amb la inclusió dels PCM en plaques de guix, guix, formigó o altres materials que s’utilitzen per a cobrir les parets, l’emmagatzematge tèrmic pot ser part de les estructures fins i tot en edificis lleugers. Les noves tècniques de microencapsulació han obert moltes possibilitats en aplicacions per a edificis. El treball que es presenta és el desenvolupament d’un formigó innovador mesclat amb PCM microencapsulat, amb un punt de fusió de 26 oC i una entalpia de canvi de fase de 110 kJ/kg. El primer experiment va ser la inclusió del PCM microencapsulat dins del formigó i la construcció d’una caseta amb aquest nou formigó-PCM. Es va construir una segona caseta al costat de la primera amb les mateixes característiques i orientació però amb formigó convencional que serveix com a referència. Durant els anys 2005 i 2006 es va analitzar el comportament d’ambdues casetes i més tard es va edificar un mur Trombe a la paret sud de totes dues per investigar la seva influència durant la tardor i l’hivern.

Analysis and forecast of the storage needs of soybeans in Brazil

The existence of a minimum storage capacity of grains as a condition for the maintenance of regulator physical stocks has been used as a strategic factor in the agribusiness expansion. However, in Brazil the storage infrastructure has not followed the growth of the agricultural sector. This fact is evident in the case of soybeans that currently represent 49% of grain production in the country, whose volume production has been increasing significantly over the years. This study aimed to predict the futureneeds of static storage capacity of soybeans from historical data to estimate the investment needed to install storage units in Brazil for the next five years. A statistic analysis of collected data allowed a forecast and identification of the number of storage units that should be installed to meet the storage needs of soybeans in the next five years. It was concluded that by 2015 the soybean storage capacity should be 87 million tons, and to store 49% of soybeans produced, 1,104 storage units should be installed at a cost of R$ 442 million.

On Distributed Storage Codes

Distributed storage systems are studied. The interest in such system has become relatively wide due to the increasing amount of information needed to be stored in data centers or different kinds of cloud systems. There are many kinds of solutions for storing the information into distributed devices regarding the needs of the system designer. This thesis studies the questions of designing such storage systems and also fundamental limits of such systems. Namely, the subjects of interest of this thesis include heterogeneous distributed storage systems, distributed storage systems with the exact repair property, and locally repairable codes. For distributed storage systems with either functional or exact repair, capacity results are proved. In the case of locally repairable codes, the minimum distance is studied. Constructions for exact-repairing codes between minimum bandwidth regeneration (MBR) and minimum storage regeneration (MSR) points are given. These codes exceed the time-sharing line of the extremal points in many cases. Other properties of exact-regenerating codes are also studied. For the heterogeneous setup, the main result is that the capacity of such systems is always smaller than or equal to the capacity of a homogeneous system with symmetric repair with average node size and average repair bandwidth. A randomized construction for a locally repairable code with good minimum distance is given. It is shown that a random linear code of certain natural type has a good minimum distance with high probability. Other properties of locally repairable codes are also studied.

A storage scheme for an automated archive

Presentation given at the Al-Azhar Engineering First Conference, AEC’89, Dec. 9-12 1989, Cairo, Egypt. The paper presented at AEC'89 suggests an infinite storage scheme divided into one volume which is online and an arbitrary number of off-line volumes arranged into a linear chain which hold records which haven't been accessed recently. The online volume holds the records in sorted order (e.g. as a B-tree) and contains shortest prefixes of keys of records already pushed offline. As new records enter, older ones are retired to the first volume which is going offline next. Statistical arguments are given for the rate at which an off-line volume needs to be fetched to reload a record which had been retired before. The rate depends on the distribution of access probabilities as a function of time. Applications are medical records, production records or other data which need to be kept for a long time for legal reasons.

Static Pricing for a Network Service Provider

This article studies the static pricing problem of a network service provider who has a fixed capacity and faces different types of customers (classes). Each type of customers can have its own capacity constraint but it is assumed that all classes have the same resource requirement. The provider must decide a static price for each class. The customer types are characterized by their arrival process, with a price-dependant arrival rate, and the random time they remain in the system. Many real-life situations could fit in this framework, for example an Internet provider or a call center, but originally this problem was thought for a company that sells phone-cards and needs to set the price-per-minute for each destination. Our goal is to characterize the optimal static prices in order to maximize the provider's revenue. We note that the model here presented, with some slight modifications and additional assumptions can be used in those cases when the objective is to maximize social welfare.