Oracle (entreprise)

Résumé

Oracle (Oracle Corporation) est une entreprise américaine créée en 1977 par Larry Ellison. Ses produits phares sont le système de gestion de base de données Oracle Database, le serveur d'applications Oracle Weblogic Server, le progiciel de gestion intégré Oracle E-Business Suite et l'offre de cloud computing Oracle Cloud Infrastructure. En 2019, Oracle était la deuxième plus grande entreprise de logiciels en matière de chiffre d'affaires et de capitalisation boursière. Histoire En 2004, Oracle acquiert PeopleSoft, éditeur du PGI du même nom et d'outils de gestion de la relation client (CRM). En 2005, Oracle acquiert Retek, l'éditeur de solutions pour la distribution, grands magasins et GC3 (TMS de la société G-LOG). Au début de 2006, Oracle acquiert Siebel Systems, l'éditeur d'outils de CRM. En 2007, Oracle acquiert Hyperion Solutions, l'éditeur de solutions décisionnelles. La même année en mai Oracle rachète Agile Software, entreprise spécialisée dans le logiciel d'entre

Source officielle

https://fr.wikipedia.org/wiki/Oracle_(entreprise)

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (20)

Publications associées

Chargement

Personnes associées (1)

Personnes associées

Chargement

Unités associées (2)

Unités associées

Chargement

Concepts associés (119)

Concepts associés

Chargement

Cours associés (11)

This course is intended for students who want to understand modern large-scale data analysis systems and database systems. It covers a wide range of topics and technologies, and will prepare students to be able to build such systems as well as read and understand recent research publications.

This class provides an introduction to the management of intellectual property (IP), primarily patents. It relies on formal lectures, case studies, speakers, and a project.

This course provides an overview of key advances in continuous optimization and statistical analysis for machine learning. We review recent learning formulations and models as well as their guarantees, describe scalable solution techniques and algorithms, and illustrate the trade-offs involved.

Afficher plus

Cours associés

Chargement

Séances de cours associées (17)

Séances de cours associées

Chargement

Program compilation for large-scale quantum computers

Giulia Meuli

Practical realizations of quantum computers are poised to deliver outstanding computational capabilities far beyond the reach of any classical supercomputer. While classical systems are reliably implemented using CMOS technology, the fabrication of quantum hardware has not yet reached a commercially viable level of maturity. Nowadays, many different technologies are being developed as competing candidates to build the first error-corrected quantum computer. Among the software resources required to operate such a system, quantum compilers translate a high-level description of a quantum algorithm into low-level, technology-dependent quantum instructions. Many quantum algorithms, including Shor's and Grover's algorithms, require to compute some classical logic functions on the quantum computer. The first part of this thesis deals with the problem of compiling quantum circuits that perform such classical Boolean functions, called oracles, into a fault-tolerant set of instructions.
Oracle circuits often demand many resources in terms of the number of qubits and gates. The focus is on compiling quantum circuits starting from multi-level logic networks representing large Boolean functions while minimizing the resource footprint of the obtained quantum circuits. At the same time, the trade-off between memory resources and the number of operations typical of such a compilation process is explored. As part of the effort in reducing the resources required to perform a given quantum program, I also present some quantum circuit optimization techniques. The researched algorithms leverage data structures and techniques borrowed and adapted from classical logic synthesis, e.g., SAT solvers, LUT mapping, and multi-level logic networks. I implemented all the compilation algorithms presented in this thesis as part of open-source projects. In particular, I develop and maintain caterpillar---a C++ header-only library dedicated to the quantum compilation of oracles and quantum memory management. The second part of this thesis describes how to equip quantum programming language compilers with automatic accuracy management. Despite the availability of many of such languages, resource estimation of quantum algorithms does not yet support taking approximation errors into account. This general methodology is applicable to any programming language and I demonstrate its integration into the Q# compiler. The technique consists of providing language support to ease the accuracy-aware programming task. The user can define accuracy parameters that will be automatically optimized according to a constraint and a cost function directly generated from the source code. In the presented practical evaluations, the constraint function is the overall allowed accuracy, while the cost function is application-dependent and related to the number of gates. During the optimization process, such functions are evaluated hundreds of times. For this reason, we extract them as (near-)symbolic expressions, whose evaluation time does not depend on the quantum algorithm size. The algorithms and the methodologies presented in this thesis are part of a widespread effort of the research community to build a complete and efficient software stack to program and control the first practical universal quantum computer.

EPFL2020

Chargement

, ,

We consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i, j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generates noisy answers. First, we consider the non-blind setting where these features are accessible. We propose a new Bayesian comparison-based search algorithm with noisy answers; it has low computational complexity yet is efficient in the number of queries. We provide theoretical guarantees, deriving the form of the optimal query and proving almost sure convergence to the target t. Second, we consider the blind setting, where the object features are hidden from the search algorithm. In this setting, we combine our search method and a new distributional triplet embedding algorithm into one scalable learning framework called LEARN2SEARCH. We show that the query complexity of our approach on two real-world datasets is on par with the non-blind setting, which is not achievable using any of the current state-of-the- art embedding methods. Finally, we demonstrate the efficacy of our framework by conducting an experiment with users searching for movie actors.

2020

Chargement

Biomass burning emissions often contain brown carbon (BrC), which represents a large family of light-absorbing organics that are chemically complex, thus making it difficult to estimate their absorption of incoming solar radiation, resulting in large uncertainties in the estimation of the global direct radiative effect of aerosols. Here we investigate the contribution of BrC to the total light absorption of biomass burning aerosols over the South-East Atlantic Ocean with different optical models, utilizing a suite of airborne measurements from the ORACLES 2018 campaign. An effective refractive index of black carbon (BC), m(eBC) = 1.95 + ik(eBC), that characterizes the absorptivity of all absorbing components at 660 nm wavelength was introduced to facilitate the attribution of absorption at shorter wavelengths, i.e. 470 nm. Most values of the imaginary part of the effective refractive index, k(eBC), were larger than those commonly used for BC from biomass burning emissions, suggesting contributions from absorbers besides BC at 660 nm. The TEM-EDX single-particle analysis further suggests that these long-wavelength absorbers might include iron oxides, as iron is found to be present only when large values of k(eBC) are derived. Using this effective BC refractive index, we find that the contribution of BrC to the total absorption at 470 nm (R-BrC,(470)) ranges from similar to 8 %-22 %, with the organic aerosol mass absorption coefficient (MAC(OA,470)) at this wavelength ranging from 0.30 +/- 0.27 to 0.68 +/- 0.08 m(2) g(-1). The core-shell model yielded much higher estimates of MAC(OA,470) and R(BrC,470)( )than homogeneous mixing models, underscoring the importance of model treatment. Absorption attribution using the Bruggeman mixing Mie model suggests a minor BrC contribution of 4 % at 530 nm, while its removal would triple the BrC contribution to the total absorption at 470 nm obtained using the AAE (absorption Angstrom exponent) attribution method. Thus, it is recommended that the application of any optical properties-based attribution method use absorption coefficients at the longest possible wavelength to minimize the influence of BrC and to account for potential contributions from other absorbing materials.

COPERNICUS GESELLSCHAFT MBH2022

Chargement

COPERNICUS GESELLSCHAFT MBH2022

Program compilation for large-scale quantum computers

Giulia Meuli

EPFL2020