Search results for "Data structure"
showing 10 items of 441 documents
Extending SSD lifetime in database applications with page overwrites
2013
Flash-based Solid State Disks (SSDs) have been a great success story over the last years and are widely used in embedded systems, servers, and laptops.One often overlooked ability of NAND flash is that flash pages can be overwritten in certain circumstances. This can be used to decrease wear out and increase performance.In this paper, we analyze the potential of overwrites for the most used data structure in database applications: the B-Tree. We show that with overwrites it is possible to significantly reduce flash wear out and increase overall performance.
Comparative Study of Several Machine Learning Algorithms for Classification of Unifloral Honeys
2021
Unifloral honeys are highly demanded by honey consumers, especially in Europe. To ensure that a honey belongs to a very appreciated botanical class, the classical methodology is palynological analysis to identify and count pollen grains. Highly trained personnel are needed to perform this task, which complicates the characterization of honey botanical origins. Organoleptic assessment of honey by expert personnel helps to confirm such classification. In this study, the ability of different machine learning (ML) algorithms to correctly classify seven types of Spanish honeys of single botanical origins (rosemary, citrus, lavender, sunflower, eucalyptus, heather and forest honeydew) was investi…
Adaptive Collision Avoidance through Implicit Acknowledgments in WSNs
2008
The large number of nodes, typical of many sensor network deployments, and the well-known hidden terminal problem make collision avoidance an essential goal for the actual employment of WSN technology. Collision avoidance is traditionally dealt with at the MAC Layer and plenty of different solutions have been proposed, which however have encountered limited diffusion because of their incompatibility with commonly available devices.In this paper we propose an approach to collision avoidance which is designed to work over a standard MAC Layer, namely the IEEE 802.15.4 MAC, and is based on application-controlled delays of packet transmission times. The proposed scheme is simple, decentralized …
A walk on sunset boulevard
2016
A walk on sunset boulevard can teach us about transcendental functions associated to Feynman diagrams. On this guided tour we will see multiple polylogarithms, differential equations and elliptic curves. A highlight of the tour will be the generalisation of the polylogarithms to the elliptic setting and the all-order solution for the sunset integral in the equal mass case.
CORAL Server and CORAL Server Proxy: Scalable Access to Relational Databases from CORAL Applications
2011
The CORAL software is widely used at CERN for accessing the data stored by the LHC experiments using relational database technologies. CORAL provides a C++ abstraction layer that supports data persistency for several backends and deployment models, including local access to SQLite files, direct client access to Oracle and MySQL servers, and read-only access to Oracle through the FroNTier web server and cache. Two new components have recently been added to CORAL to implement a model involving a middle tier "CORAL server" deployed close to the database and a tree of "CORAL server proxy" instances, with data caching and multiplexing functionalities, deployed close to the client. The new compon…
Standard Vs Uniform Binary Search and Their Variants in Learned Static Indexing: The Case of the Searching on Sorted Data Benchmarking Software Platf…
2023
Learned Indexes are a novel approach to search in a sorted table. A model is used to predict an interval in which to search into and a Binary Search routine is used to finalize the search. They are quite effective. For the final stage, usually, the lower_bound routine of the Standard C++ library is used, although this is more of a natural choice rather than a requirement. However, recent studies, that do not use Machine Learning predictions, indicate that other implementations of Binary Search or variants, namely k-ary Search, are better suited to take advantage of the features offered by modern computer architectures. With the use of the Searching on Sorted Sets SOSD Learned Indexing bench…
"Table 2" of "Measurement of the Cross Section for Electromagnetic Dissociation with Neutron Emission in Pb-Pb Collisions at {\surd}sNN = 2.76 TeV"
2013
Mutual EMD -> at least one neutron is emitted by both Pb nuclei.
"Table 19" of "Measurement of the differential cross-sections of inclusive, prompt and non-prompt J/psi production in proton-proton collisions at sqr…
2013
Unweighted J/psi candidate yields in bins of $J/psi transverse momentum and rapidity. Uncertainties are statistical only.
Evolving Tree Algorithm Modifications
2007
There are many variants of the original self-organizing neural map algorithm proposed by Kohonen. One of the most recent is the Evolving Tree, a tree-shaped self-organizing network which has many interesting characteristics. This network builds a tree structure splitting the input dataset during learning. This paper presents a speed-up modification of the original training algorithm useful when the Evolving Tree network is used with complex data as images or video. After a measurement of the effectiveness an application of the modified algorithm in image segmentation is presented.
Estimating feature discriminant power in decision tree classifiers
1995
Feature Selection is an important phase in pattern recognition system design. Even though there are well established algorithms that are generally applicable, the requirement of using certain type of criteria for some practical problems makes most of the resulting methods highly inefficient. In this work, a method is proposed to rank a given set of features in the particular case of Decision Tree classifiers, using the same information generated while constructing the tree. The preliminary results obtained with both synthetic and real data confirm that the performance is comparable to that of sequential methods with much less computation.