Search results for "Oracle"
showing 10 items of 65 documents
E-pakalpojumu portāla sadaļas e-Loms funkcionalitātes papildinājumi
2019
Kvalifikācijas darba ietvaros tika izstrādāti portāla E-pakalpojumi makšķerēšanas sadaļas papildinājumi. Ir trīs galvenās izmaiņas – tika izstrādāta iespēja iegādāties licenci bez autorizācijas un šādi pirktām licencēm reģistrēt makšķerēšanas laikā noķerto lomu, kā arī tika izveidota jauna sadaļa, kurā var apskatīt statistiku par lietotāju reģistrēto lomu Latvijas ūdenstilpēs. Darbs tika veikts galvenokārt pēc ūdenskrituma dzīves cikla modeļa, lai gan izstrādes procesā eksistēja arī noteikti spējās izstrādes elementi. Šis dokuments satur programmatūras prasību specifikāciju, programmatūras projektējuma aprakstu un testēšanas dokumentāciju. Papildinājumi tika izstrādāti, izmantojot ASP.NET W…
Simulation of organics in the atmosphere: evaluation of EMACv2.54 with the Mainz Organic Mechanism (MOM) coupled to the ORACLE (v1.0) submodel
2021
Abstract. An updated and expanded representation of organics in the chemistry general circulation model EMAC (ECHAM5/MESSy for Atmospheric Chemistry) has been evaluated. First, the comprehensive Mainz Organic Mechanism (MOM) in the submodel MECCA (Module Efficiently Calculating the Chemistry of the Atmosphere) was activated with explicit degradation of organic species up to five carbon atoms and a simplified mechanism for larger molecules. Second, the ORACLE submodel (version 1.0) considers now condensation on aerosols for all organics in the mechanism. Parameterizations for aerosol yields are used only for the lumped species that are not included in the explicit mechanism. The simultaneous…
Atskaišu izstrāde nekustamā īpašuma nodokļa administrēšanas sistēmai NINO
2018
Nekustamo īpašumu administrēšanas sistēma jeb NINO ir pašvaldību vajadzībām veidota programmatūra. Tās mērķis ir atvieglot nekustamā īpašuma nodokļa administrēšanas darbus. NINO sistēmā iespējams veikt nodokļu aprēķinus, informācijas uzskaiti, apstrādi un glabāšanu, dokumentu uzskaiti, dažādu paziņojumu sagatavošanu, darbības ar maksājumiem vai sodu un parādu summām, kā arī atskaišu sagatavošanu. Kvalifikācijas darba mērķis ir NINO sistēmai izstrādāt papildinājumus atbilstoši pasūtītāja vajadzībām. Galvenās izmaiņas ir nepieciešamība nekustamo īpašuma nodokli par ēkām sadalīt divās daļās – “par mājokli” un “par nedzīvojamām ēkām”. Šī darba ietvaros tiks izstrādātas vairākas atskaites sagata…
Oracle risinājumu pielietojums Big Data kontekstā
2016
Maģistra darbā tika apskatīti un analizēti Oracle un citu ražotāju piedāvātie risinājumi Big Data apstrādei un analīzei. Darbs satur teorētisku dažādu ražotāju rīku apskati un salīdzinājumu, kā arī praktisko daļu, kurā tiek analizētas datu savienošanas iespējas hibrīdā datu noliktavā. Par hibrīdo datu noliktavu tiek uzskatīta tāda datu noliktava, kurā daļa datu atrodas RDBMS sistēmā un daļa datu HDFS sistēmā. Darba galvenie mērķi ir analizēt šāda veida sistēmas veiktspēju, izmantojot dažādus datu apvienošanas veidus. Testu laikā tika apskatīti apskatīti gadījumi, kad datu apvienošana notiek RDBMS sistēmas pusē un gadījumi, kad datu apvienošana notiek HDFS sistēmas pusē, kā arī tika izpētīta…
On Horn spectra
1991
Abstract A Horn spectrum is a spectrum of a Horn sentence. We show that to solve Asser's problem, and consequently the EXPTIME = ? NEXPTIME question it suffices to consider the class of Horn spectra. We also pose the problem whether or not the generator of every Horn spectrum is a spectrum. We prove that from a negative solution of the generator problem, a negative answer for the EXPTIME = ? NEXPTIME question follows. Some other relations between the generator problem and Asser's problem are given. Finally, the relativized version of the generator problem is formulated and it is shown that it has an affirmative solution for some oracles, and a negative solution for some others.
On finding common neighborhoods in massive graphs
2003
AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We prove lower bounds on the resources needed to solve this problem on resource-bounded models of computation. In streaming models, in which algorithms can access the input only a constant number of times and only sequentially, we show that, even with randomization, any algorithm that determines if there exists any pair of vertices with a large common neighborhood must essentially store and process the input graph off line. In sampling models, in which algorithms can only query an oracle for the common neighborhoods of specified vertex pairs, we show that any algorithm must …
Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$
2017
In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly k or l of the n input bits given by an oracle are 1. We find an optimal algorithm (for some cases), and a nontrivial general lower and upper bound on the minimum number of queries to the black box.
Quantum Identification of Boolean Oracles
2004
The oracle identification problem (OIP) is, given a set S of M Boolean oracles out of 2 N ones, to determine which oracle in S is the current black-box oracle. We can exploit the information that candidates of the current oracle is restricted to S. The OIP contains several concrete problems such as the original Grover search and the Bernstein-Vazirani problem. Our interest is in the quantum query complexity, for which we present several upper bounds. They are quite general and mostly optimal: (i) The query complexity of OIP is \(O(\sqrt{N {\rm log} M {\rm log} N}{\rm log log} M)\) for anyS such that M = |S| > N, which is better than the obvious bound N if M \(< 2^{N/log^3 N}\). (ii) It is \…
Knowledge-based verification of concatenative programming patterns inspired by natural language for resource-constrained embedded devices
2020
We propose a methodology to verify applications developed following programming patterns inspired by natural language that interact with physical environments and run on resource-constrained interconnected devices. Natural language patterns allow for the reduction of intermediate abstraction layers to map physical domain concepts into executable code avoiding the recourse to ontologies, which would need to be shared, kept up to date, and synchronized across a set of devices. Moreover, the computational paradigm we use for effective distributed execution of symbolic code on resource-constrained devices encourages the adoption of such patterns. The methodology is supported by a rule-based sys…
Stationary states in quantum walk search
2016
When classically searching a database, having additional correct answers makes the search easier. For a discrete-time quantum walk searching a graph for a marked vertex, however, additional marked vertices can make the search harder by causing the system to approximately begin in a stationary state, so the system fails to evolve. In this paper, we completely characterize the stationary states, or 1-eigenvectors, of the quantum walk search operator for general graphs and configurations of marked vertices by decomposing their amplitudes into uniform and flip states. This infinitely expands the number of known stationary states and gives an optimization procedure to find the stationary state c…