Relevant bibliographies by topics / Oracle based algorithms

Academic literature on the topic 'Oracle based algorithms'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Oracle based algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Oracle based algorithms"

1

Zhao, Jiahao. "Possible Implementations of Oracles in Quantum Algorithms." Journal of Physics: Conference Series 2386, no. 1 (December 1, 2022): 012010. http://dx.doi.org/10.1088/1742-6596/2386/1/012010.

Full text
Abstract:
Abstract Quantum computing is an inspiring technic on solving complicate problems, which shows the superiority over the classical computing. Contemporarily, the quantum-based algorithms were invented in many purposes on solving those problems. The thing is some of the algorithms were composed with oracles, which can be treated as a black box. It can be worked out/analyzed in theoretical mathematical expressions, but it can never fall in the ground without those actual implementations. Therefore, this paper will illustrate the idea and possible implementations on some quantum algorithm. Among various algorithms, this research will choose those relatively famous quantum algorithms, i.e., Deutsch-Jozsa Algorithm, Shor’s Algorithm, and Grover’s Algorithm. Different algorithms have the different intrinsic logics, which means there is no general description for all solution in this problem, but all of those can achieve the goal according to the same framework. Since those oracles are black boxes that can only be analyzed by its behavior with different cases, and then based on the behaviors and cases, and in IBM quantum platform, one can fill out the oracle by manipulate with different quantum operators. Lastly, the figures of some the possible implementation of those oracles with the three quantum algorithms will be shown in the IBM quantum platform, as well as the histograms of probability distributions that can justify the correctness of the implementations. These results shed light on guiding further exploration of the design and analysis on quantum algorithms.
APA, Harvard, Vancouver, ISO, and other styles
2

Hou, Wenjun, and Marek Perkowski. "Quantum-based algorithm and circuit design for bounded Knapsack optimization problem." Quantum Information and Computation 20, no. 9&10 (August 2020): 766–86. http://dx.doi.org/10.26421/qic20.9-10-4.

Full text
Abstract:
The Knapsack Problem is a prominent problem that is used in resource allocation and cryptography. This paper presents an oracle and a circuit design that verifies solutions to the decision problem form of the Bounded Knapsack Problem. This oracle can be used by Grover Search to solve the optimization problem form of the Bounded Knapsack Problem. This algorithm leverages the quadratic speed-up offered by Grover Search to achieve a quantum algorithm for the Knapsack Problem that shows improvement with regard to classical algorithms. The quantum circuits were designed using the Microsoft Q# Programming Language and verified on its local quantum simulator. The paper also provides analyses of the complexity and gate cost of the proposed oracle. The work in this paper is the first such proposed method for the Knapsack Optimization Problem.
APA, Harvard, Vancouver, ISO, and other styles
3

Kämmerling, Nicolas, and Jannis Kurtz. "Oracle-based algorithms for binary two-stage robust optimization." Computational Optimization and Applications 77, no. 2 (June 23, 2020): 539–69. http://dx.doi.org/10.1007/s10589-020-00207-w.

Full text
Abstract:
Abstract In this work we study binary two-stage robust optimization problems with objective uncertainty. We present an algorithm to calculate efficiently lower bounds for the binary two-stage robust problem by solving alternately the underlying deterministic problem and an adversarial problem. For the deterministic problem any oracle can be used which returns an optimal solution for every possible scenario. We show that the latter lower bound can be implemented in a branch and bound procedure, where the branching is performed only over the first-stage decision variables. All results even hold for non-linear objective functions which are concave in the uncertain parameters. As an alternative solution method we apply a column-and-constraint generation algorithm to the binary two-stage robust problem with objective uncertainty. We test both algorithms on benchmark instances of the uncapacitated single-allocation hub-location problem and of the capital budgeting problem. Our results show that the branch and bound procedure outperforms the column-and-constraint generation algorithm.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhandry, Mark. "Secure identity-based encryption in the quantum random oracle model." International Journal of Quantum Information 13, no. 04 (June 2015): 1550014. http://dx.doi.org/10.1142/s0219749915500148.

Full text
Abstract:
We give the first proof of security for an identity-based encryption (IBE) scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that does not rely on the assumed existence of so-called quantum-secure pseudorandom functions (PRFs). Our techniques are quite general and we use them to obtain security proofs for two random oracle hierarchical IBE schemes and a random oracle signature scheme, all of which have previously resisted quantum security proofs, even assuming quantum-secure PRFs. We also explain how to remove quantum-secure PRFs from prior quantum random oracle model proofs. We accomplish these results by developing new tools for arguing that quantum algorithms cannot distinguish between two oracle distributions. Using a particular class of oracle distributions that we call semi-constant distributions, we argue that the aforementioned cryptosystems are secure against quantum adversaries.
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Liyi, Finn Voichick, Kesha Hietala, Yuxiang Peng, Xiaodi Wu, and Michael Hicks. "Verified compilation of Quantum oracles." Proceedings of the ACM on Programming Languages 6, OOPSLA2 (October 31, 2022): 589–615. http://dx.doi.org/10.1145/3563309.

Full text
Abstract:
Quantum algorithms often apply classical operations, such as arithmetic or predicate checks, over a quantum superposition of classical data; these so-called oracles are often the largest components of a quantum program. To ease the construction of efficient, correct oracle functions, this paper presents VQO, a high-assurance framework implemented with the Coq proof assistant. The core of VQO is OQASM, the oracle quantum assembly language. OQASM operations move qubits between two different bases via the quantum Fourier transform, thus admitting important optimizations, but without inducing entanglement and the exponential blowup that comes with it. OQASM’s design enabled us to prove correct VQO’s compilers—from a simple imperative language called OQIMP to OQASM, and from OQASM to SQIR, a general-purpose quantum assembly language—and allowed us to efficiently test properties of OQASM programs using the QuickChick property-based testing framework. We have used VQO to implement a variety of arithmetic and geometric operators that are building blocks for important oracles, including those used in Shor’s and Grover’s algorithms. We found that VQO’s QFT-based arithmetic oracles require fewer qubits, sometimes substantially fewer, than those constructed using “classical” gates; VQO’s versions of the latter were nevertheless on par with or better than (in terms of both qubit and gate counts) oracles produced by Quipper, a state-of-the-art but unverified quantum programming platform.
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Mengru, Yu Cai, Li Gao, Ruichen Feng, Qingju Jiao, Xiaolin Ma, and Yu Jia. "Study on the evolution of Chinese characters based on few-shot learning: From oracle bone inscriptions to regular script." PLOS ONE 17, no. 8 (August 19, 2022): e0272974. http://dx.doi.org/10.1371/journal.pone.0272974.

Full text
Abstract:
Oracle bone inscriptions (OBIs) are ancient Chinese scripts originated in the Shang Dynasty of China, and now less than half of the existing OBIs are well deciphered. To date, interpreting OBIs mainly relies on professional historians using the rules of OBIs evolution, and the remaining part of the oracle’s deciphering work is stuck in a bottleneck period. Here, we systematically analyze the evolution process of oracle characters by using the Siamese network in Few-shot learning (FSL). We first establish a dataset containing Chinese characters which have finished a relatively complete evolution, including images in five periods: oracle bone inscriptions, bronze inscriptions, seal inscriptions, official script, and regular script. Then, we compare the performance of three typical algorithms, VGG16, ResNet, and AlexNet respectively, as the backbone feature extraction network of the Siamese network. The results show that the highest F1 value of 83.3% and the highest recognition accuracy of 82.67% are obtained by the combination of VGG16 and Siamese network. Based on the analysis, the typical structural performance of each period is evaluated and we identified that the optimized Siamese network is feasible to study the evolution of the OBIs. Our findings provide a new approach for oracle’s deciphering further.
APA, Harvard, Vancouver, ISO, and other styles
7

Mirhosseini, Seyyed Mohsen, and Hassan Haghighi. "Application of the Shuffled Frog Leaping Algorithm (SFLA) in Constructing Fuzzy Classification Systems." International Journal of Computational Intelligence and Applications 18, no. 03 (September 2019): 1950019. http://dx.doi.org/10.1142/s1469026819500196.

Full text
Abstract:
A Fuzzy Inference System (FIS) is a way of mapping an input space to an output space using the fuzzy logic. FISs are widely used to solve classification problems. The Shuffled Frog Leaping Algorithm (SFLA) is a metaheuristic inspired by the natural evolution of frogs in searching for the largest source of food. By using local and global searches simultaneously, SFLA is effective in solving various optimization problems. This paper first proposes a new method to create zero-order Sugeno Fuzzy Inference Systems using SFLA. Then, the paper introduces an approach to use resulting SFLA-based Fuzzy Inference Systems to build test oracles. Test oracle is a mechanism for determining whether a test on a software program has passed or failed. The experimental results show that SFLA creates fuzzy systems more efficiently than three other evolutionary algorithms, including Genetic Algorithm (GA), Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO). Moreover, with respect to the accuracy and convergence speed criteria, SFLA and PSO outperform other evolutionary algorithms, while their performances are comparable to each other. At last, the experimental results indicate that SFLA-based FISs can be used to create test oracles with acceptable accuracy.
APA, Harvard, Vancouver, ISO, and other styles
8

Paris, Matteo G. A., Claudia Benedetti, and Stefano Olivares. "Improving Quantum Search on Simple Graphs by Pretty Good Structured Oracles." Symmetry 13, no. 1 (January 7, 2021): 96. http://dx.doi.org/10.3390/sym13010096.

Full text
Abstract:
Quantum search algorithms provide a way to speed up combinatorial search, and have found several applications in modern quantum technology. In particular, spatial search on graphs, based on continuous-time quantum walks (CTQW), represents a promising platform for the implementation of quantum search in condensed matter systems. CTQW-based algorithms, however, work exactly on complete graphs, while they are known to perform poorly on realistic graphs with low connectivity. In this paper, we put forward an alternative search algorithm, based on structuring the oracle operator, which allows one to improve the localization properties of the walker by tuning only the on-site energies of the graph, i.e., without altering its topology. As such, the proposed algorithm is suitable for implementation in systems with low connectivity, e.g., rings of quantum dots or superconducting circuits. Oracle parameters are determined by Hamiltonian constraints, without the need for numerical optimization.
APA, Harvard, Vancouver, ISO, and other styles
9

Paris, Matteo G. A., Claudia Benedetti, and Stefano Olivares. "Improving Quantum Search on Simple Graphs by Pretty Good Structured Oracles." Symmetry 13, no. 1 (January 7, 2021): 96. http://dx.doi.org/10.3390/sym13010096.

Full text
Abstract:
Quantum search algorithms provide a way to speed up combinatorial search, and have found several applications in modern quantum technology. In particular, spatial search on graphs, based on continuous-time quantum walks (CTQW), represents a promising platform for the implementation of quantum search in condensed matter systems. CTQW-based algorithms, however, work exactly on complete graphs, while they are known to perform poorly on realistic graphs with low connectivity. In this paper, we put forward an alternative search algorithm, based on structuring the oracle operator, which allows one to improve the localization properties of the walker by tuning only the on-site energies of the graph, i.e., without altering its topology. As such, the proposed algorithm is suitable for implementation in systems with low connectivity, e.g., rings of quantum dots or superconducting circuits. Oracle parameters are determined by Hamiltonian constraints, without the need for numerical optimization.
APA, Harvard, Vancouver, ISO, and other styles
10

Yang, Zhen-Ping, Yuliang Wang, and Gui-Hua Lin. "Variance-Based Modified Backward-Forward Algorithm with Line Search for Stochastic Variational Inequality Problems and Its Applications." Asia-Pacific Journal of Operational Research 37, no. 03 (April 29, 2020): 2050011. http://dx.doi.org/10.1142/s0217595920500116.

Full text
Abstract:
We propose a variance-based modified backward-forward algorithm with a stochastic approximation version of Armijo’s line search, which is robust with respect to an unknown Lipschitz constant, for solving a class of stochastic variational inequality problems. A salient feature of the proposed algorithm is to compute only one projection and two independent queries of a stochastic oracle at each iteration. We analyze the proposed algorithm for its asymptotic convergence, sublinear convergence rate in terms of the mean natural residual function, and optimal oracle complexity under moderate conditions. We also discuss the linear convergence rate with finite computational budget for the proposed algorithm without strong monotonicity. Preliminary numerical experiments indicate that the proposed algorithm is competitive with some existing algorithms. Furthermore, we consider an application in dealing with an equilibrium problem in stochastic natural gas trading market.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Oracle based algorithms"

1

Gilbert, Hugo. "Oracle-based algorithms for optimizing sophisticated decision criteria in sequential, robust and fair decision problems." Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066648.

Full text
Abstract:
Cette thèse s'inscrit dans le cadre de la théorie de la décision algorithmique, qui est une discipline au croisement de la théorie de la décision, la recherche opérationnelle et l'intelligence artificielle. Dans cette thèse, nous étudions l'utilisation de plusieurs modèles décisionnels pour résoudre des problèmes de décision séquentielle dans l'incertain, d'optimisation robuste, et d'optimisation multi-agents équitable. Pour résoudre efficacement ces problèmes, nous utilisons des méthodes de type maître-esclaves, dites à base d'oracles dans la thèse. Ces méthodes permettent de résoudre des problèmes de grande taille en procédant de manière incrémentale. Une attention particulière est portée au modèle de l'espérance d'utilité antisymétrique et bilinéaire, au modèle de l'espérance d'utilité pondérée et à leurs pendants en décision multicritère. L'intérêt de ces modèles est multiple. En effet, ils étendent les modèles standards (e.g., modèle de l'espérance d'utilité) et permettent de représenter un spectre étendu de préférences tout en conservant leurs bonnes propriétés théoriques et algorithmiques. La thèse apporte des réponses sur des aspects théoriques (e.g., résultats de complexité algorithmique) et sur des aspects opérationnels (e.g., conception de méthodes de résolution efficaces) aux problèmes soulevés par l'emploi de ces critères dans les contextes susmentionnés
This thesis falls within the area of algorithmic decision theory, which is at the crossroads between decision theory, operational research and artificial intelligence. In this thesis, we study several decision models to solve problems in different domains: sequential decision problems under risk, robust optimization problems, and fair multi-agent optimization problems. To solve these problems efficiently, we use master-slave algorithms which solve the problem through an incremental process. These procedures, referred to as oracle methods in the thesis, make it possible to solve problems of large size. A particular attention is given to the skew-symmetric bilinear utility model, the weighted expected utility model and their counterparts in multicriteria decision making. These models are interesting at several respects. They extend the standard models (e.g., the expected utility model) and allow to represent a broader class of preferences while retaining their good theoretical and algorithmic properties. The thesis focuses both on theoretic (e.g., complexity results) and operational (e.g., design of practically efficient solution methods) aspects of the problems raised by the use of these criteria in the domains aforementioned
APA, Harvard, Vancouver, ISO, and other styles
2

Hlosta, Martin. "Modul pro shlukovou analýzu systému pro dolování z dat." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237158.

Full text
Abstract:
This thesis deals with the design and implementation of a cluster analysis module for currently developing datamining system DataMiner on FIT BUT. So far, the system lacked cluster analysis module. The main objective of the thesis was therefore to extend the system of such a module. Together with me, Pavel Riedl worked on the module. We have created a common part for all the algorithms so that the system can be easily extended to other clustering algorithms. In the second part, I extended the clustering module by adding three density based clustering aglorithms - DBSCAN, OPTICS and DENCLUE. Algorithms have been implemented and appropriate sample data was chosen to verify theirs functionality.
APA, Harvard, Vancouver, ISO, and other styles
3

Lippold, Georg. "Encryption schemes and key exchange protocols in the certificateless setting." Thesis, Queensland University of Technology, 2010. https://eprints.qut.edu.au/41697/1/Georg_Lippold_Thesis.pdf.

Full text
Abstract:
The contributions of this thesis fall into three areas of certificateless cryptography. The first area is encryption, where we propose new constructions for both identity-based and certificateless cryptography. We construct an n-out-of- n group encryption scheme for identity-based cryptography that does not require any special means to generate the keys of the trusted authorities that are participating. We also introduce a new security definition for chosen ciphertext secure multi-key encryption. We prove that our construction is secure as long as at least one authority is uncompromised, and show that the existing constructions for chosen ciphertext security from identity-based encryption also hold in the group encryption case. We then consider certificateless encryption as the special case of 2-out-of-2 group encryption and give constructions for highly efficient certificateless schemes in the standard model. Among these is the first construction of a lattice-based certificateless encryption scheme. Our next contribution is a highly efficient certificateless key encapsulation mechanism (KEM), that we prove secure in the standard model. We introduce a new way of proving the security of certificateless schemes based that are based on identity-based schemes. We leave the identity-based part of the proof intact, and just extend it to cover the part that is introduced by the certificateless scheme. We show that our construction is more efficient than any instanciation of generic constructions for certificateless key encapsulation in the standard model. The third area where the thesis contributes to the advancement of certificateless cryptography is key agreement. Swanson showed that many certificateless key agreement schemes are insecure if considered in a reasonable security model. We propose the first provably secure certificateless key agreement schemes in the strongest model for certificateless key agreement. We extend Swanson's definition for certificateless key agreement and give more power to the adversary. Our new schemes are secure as long as each party has at least one uncompromised secret. Our first construction is in the random oracle model and gives the adversary slightly more capabilities than our second construction in the standard model. Interestingly, our standard model construction is as efficient as the random oracle model construction.
APA, Harvard, Vancouver, ISO, and other styles
4

Mena, Sihuacollo Joseph César. "Algoritmo para brindar alta disponibilidad de servidores base de datos Oracle no clusterizados." Bachelor's thesis, Universidad Nacional Mayor de San Marcos, 2018. https://hdl.handle.net/20.500.12672/8010.

Full text
Abstract:
Publicación a texto completo no autorizada por el autor
Describe el algoritmo para brindar alta disponibilidad de servidores de base de datos Oracle no clusterizados para una empresa del rubro de administración de pensiones. El problema se identifica cuando se inicia un requerimiento que necesitaba que la aplicación, producto de este requerimiento, tuviera disponibilidad 24x7. Para garantizar la disponibilidad de 24x7 o también llamada alta disponibilidad, se requiere servidores redundantes en los diferentes niveles de la arquitectura de la aplicación. La empresa en cuestión cuenta con servidores redundantes (clusterizados) en los diferentes niveles de la arquitectura menos en el nivel de base de datos. La empresa, luego de una evaluación de las diferentes opciones que le permita obtener alta disponibilidad de base de datos (oracle), opta por realizarlo mediante la implementación de un algoritmo propio, y con ello alcanza alta disponibilidad en los diferentes niveles de la arquitectura de la aplicación, cumpliendo con las expectativas requeridas.
Trabajo de suficiencia profesional
APA, Harvard, Vancouver, ISO, and other styles
5

Lagana, Antonio. "Quantum computation and a universal quantum computer." Thesis, 2012. http://hdl.handle.net/2440/77320.

Full text
Abstract:
This thesis covers two main topics in quantum computing: universal quantum computation and quantum search. We first demonstrate how a quantum harmonic oscillator can be used to implement the universal set of quantum gates and thereby serve as one possible building block for a universal quantum computer. We then address the core and primary focus of this thesis, the theoretical construction of a machine that can compute every computable function, that is, a universal (i.e.programmable) quantum computer. We thereby settle the questions that have been raised over the years regarding the validity of the UQTM proposed by Deutsch in 1985. We then demonstrate how to interface the universal quantum computer to external quantum devices by developing programs that implement well-known oracle based algorithms, including the well-known Grover search algorithm, using networked quantum oracle devices. Finally, we develop a partial search oracle and explore symmetry based partial search algorithms utilizing this oracle.
Thesis (Ph.D.) -- University of Adelaide, School of Chemistry and Physics, 2012
APA, Harvard, Vancouver, ISO, and other styles
6

Yoshida, Kayo. "Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem." Thesis, 2009. http://hdl.handle.net/10012/4219.

Full text
Abstract:
The Boneh-Boyen signature scheme is a short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman (SDH) assumption. The primary objective of this thesis is to examine the relationship between the Boneh-Boyen signature scheme and SDH. The secondary objective is to survey surrounding topics such as the generic group model, related signature schemes, intractability assumptions, and the relationship to identity-based encryption (IBE) schemes. Along these lines, we analyze the plausibility of the SDH assumption using the generic bilinear group model. We present the security proofs for the Boneh-Boyen signature scheme, with the addition of a small improvement in one of the probability bounds. Our main contribution is to give the reduction in the reverse direction; that is, to show that if the SDH problem can be solved then the Boneh-Boyen signature scheme can be forged. This contribution represents the first known proof of equivalence between the SDH problem and Boneh-Boyen signatures. We also discuss the algorithm of Cheon for solving the SDH problem. We analyze the implications of Cheon's algorithm for the security of the Boneh-Boyen signature scheme, accompanied by a brief discussion on how to counter the attack.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Oracle based algorithms"

1

Devraj, Venkat S. Oracle 24x7 Tips and Techniques. Osborne/McGraw-Hill, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Devraj, Venkat S. Oracle 24x7 Tips and Techniques. Osborne/McGraw-Hill, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Oracle based algorithms"

1

Lv, Pin, Xuetao Zhang, Jing Liu, Tingting Wei, and Jia Xu. "Blockchain Oracle-Based Privacy Preservation and Reliable Identification for Vehicles." In Wireless Algorithms, Systems, and Applications, 512–20. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86137-7_54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Elbassioni, Khaled, and Kazuhisa Makino. "Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs." In Sublinear Computation Paradigm, 47–63. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-4095-7_4.

Full text
Abstract:
AbstractPacking and covering semidefinite programs (SDPs) appear in natural relaxations of many combinatorial optimization problems as well as a number of other applications. Recently, several techniques have been proposed that utilize the particular structure of this class of problems in order to obtain more efficient algorithms than those offered by general SDP solvers. For certain applications, it may be necessary to deal with SDPs with a very large number of (e.g., exponentially or even infinitely many) constraints. In this chapter, we give an overview of some of the techniques that can be used to solve this class of problems, focusing on multiplicative weight updates and logarithmic-potential methods.
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Peng, Cheng Wang, Xiangjun Song, Deliang Liu, and Wanling Li. "MSE Analysis Based on Nearly-Oracle Estimation for SCoSaMP Algorithm." In Lecture Notes in Electrical Engineering, 1718–26. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-6571-2_208.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Jiarui, Hong-Hin Cheong, and Shirley Weng In Siu. "BESTox: A Convolutional Neural Network Regression Model Based on Binary-Encoded SMILES for Acute Oral Toxicity Prediction of Chemical Compounds." In Algorithms for Computational Biology, 155–66. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-42266-0_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Guo, Xiaolan, and Neha Jain. "Design and Implementation of Oral English Test System Based on Data Mining Algorithm." In Cyber Security Intelligence and Analytics, 408–15. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96908-0_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Xi, Ke, Yufei Nie, Na Yang, Cheng Cai, and Aoxiang Zhang. "The WeChat Mini-program for Oral English Evaluation Based on the Smart Listening Algorithm." In Lecture Notes in Computer Science, 55–62. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96419-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wolff, Mark. "Invoking the Oracle: Perec, Algorithms and Conceptual Writing." In The Afterlives of Georges Perec. Edinburgh University Press, 2017. http://dx.doi.org/10.3366/edinburgh/9781474401241.003.0005.

Full text
Abstract:
Although Georges Perec did not make use of computers in his writing, he employed algorithmic processes for structuring various formal and thematic elements of his texts. As a member of the Oulipo, he worked with others to develop new ways to write using constraints based on mathematics. In considering the effect of computational methods on writing, the Oulipo wanted to avoid the influence of chance without devising procedures that automated the writing process. Perec addressed this challenge by resorting to what he and other Oulipians, drawing on Lucretius, called the clinamen, a kind of randomizing function that promotes creativity through unpredictability. If constraints can be applied with a machine to writing (and many of the constraints used by Perec can be easily coded), the clinamen disrupts this computation and forces the writer to make unanticipated choices. Purposely thwarting the determinism of mechanical calculation, Perec’s irregular use of constraints on writing invokes what Alan Turing called an oracle, a resource outside the machine for performing uncomputable operations. Unlike a computer scientist who seeks to eliminate any need for an oracle by developing sufficient algorithms, Perec manipulates algorithms erratically in order to intervene in subverted computations and provide revelatory solutions that escape the machine.
APA, Harvard, Vancouver, ISO, and other styles
8

Pushkala V and S. Nirmala Devi. "Detection of Ketosis in Bovine Using Machine Learning Techniques." In Advances in Parallel Computing. IOS Press, 2021. http://dx.doi.org/10.3233/apc210054.

Full text
Abstract:
This paper presents the different unsupervised machine learning algorithms used for Ketosis detection, based on the color characteristics taken from the Ketocheck rapid colorimetric test. The level of ketone bodies in bovine’s urine is represented by three color categories, range of dark green (right ketone level), green (normal range ketone level) and yellow/orange (higher ketone level). The color image is converted into HSV color space for better color discrimination. The proposed technique enables detection of ketosis by clustering every pixel in the image using unsupervised K-means clustering and Fuzzy C Means (FCM) clustering algorithms. The results obtained have shown that K-means algorithm is faster and it also have low computational complexity. Two android application is developed. One with K-means clustering algorithm loaded in server and the other, directly programmed in android application.
APA, Harvard, Vancouver, ISO, and other styles
9

Jameel, Tahir, Mengxiang Lin, and Liu Chao. "Metamorphic Relations Based Test Oracles for Image Processing Applications." In Biometrics, 892–906. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-0983-7.ch035.

Full text
Abstract:
Evaluation of output images carrying visual semantics is a challenging task which is carried out by domain experts through visual inspection. Automatic test oracle is required to augment the test oracle problem and to eliminate the manual efforts. Metamorphic testing is an effective technique to alleviate these problems. In this paper, the authors have demonstrated that how inherent properties of implementation under test can be used to generate an automatic test oracle for image processing applications. Metamorphic testing is a general technique in which follow-up test cases are generated using a transformation function and the anticipated output is evaluated. They have used some general metamorphic relations and also designed some algorithm specific metamorphic relations for morphological image operations. Selection of metamorphic relations is the most important step and the authors have analyzed relative effectiveness of different metamorphic relations using mutation analysis. The results show metamorphic testing is a very effective technique to automate output images evaluation and to alleviate oracle problem.
APA, Harvard, Vancouver, ISO, and other styles
10

Khan, Binish, Piyush Kumar Shukla, Manish Kumar Ahirwar, and Manish Mishra. "Strategic Analysis in Prediction of Liver Disease Using Different Classification Algorithms." In Handbook of Research on Disease Prediction Through Data Analytics and Machine Learning, 437–49. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-2742-9.ch022.

Full text
Abstract:
Liver diseases avert the normal activity of the liver. Discovering the presence of liver disorder at an early stage is a complex task for the doctors. Predictive analysis of liver disease using classification algorithms is an efficacious task that can help the doctors to diagnose the disease within a short duration of time. The main motive of this study is to analyze the parameters of various classification algorithms and compare their predictive accuracies so as to find the best classifier for determining the liver disease. This chapter focuses on the related works of various authors on liver disease such that algorithms were implemented using Weka tool that is a machine learning software written in Java. Also, orange tool is utilized to compare several classification algorithms in terms of accuracy. In this chapter, random forest, logistic regression, and support vector machine were estimated with an aim to identify the best classifier. Based on this study, random forest with the highest accuracy outperformed the other algorithms.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Oracle based algorithms"

1

Zhang, Chongsheng, Ruixing Zong, Shuang Cao, Yi Men, and Bofeng Mo. "AI-Powered Oracle Bone Inscriptions Recognition and Fragments Rejoining." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/779.

Full text
Abstract:
Oracle Bone Inscriptions (OBI) research is very meaningful for both history and literature. In this paper, we introduce our contributions in AI-Powered Oracle Bone (OB) fragments rejoining and OBI recognition. (1) We build a real-world dataset OB-Rejoin, and propose an effective OB rejoining algorithm which yields a top-10 accuracy of 98.39%. (2) We design a practical annotation software to facilitate OBI annotation, and build OracleBone-8000, a large-scale dataset with character-level annotations. We adopt deep learning based scene text detection algorithms for OBI localization, which yield an F-score of 89.7%. We propose a novel deep template matching algorithm for OBI recognition which achieves an overall accuracy of 80.9%. Since we have been cooperating closely with OBI domain experts, our effort above helps advance their research. The resources of this work are available at https://github.com/chongshengzhang/OracleBone.
APA, Harvard, Vancouver, ISO, and other styles
2

Gomes, Christian, Leonardo Rocha, and Marcos Gonçalves. "On the Cost-Effectiveness of Stacking of Neural and Non-Neural Methods for Text Classification: Scenarios and Performance Prediction." In Concurso de Teses e Dissertações. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/ctd.2022.222665.

Full text
Abstract:
Nowadays, neural networks algorithms, such as those based on Attention and Transformers, have excelled on Automatic Text Classification (ATC). However, such enhanced performance comes at high computational costs. Stacking of simpler classifiers that exploit algorithmic and representational complementarity has also been shown to produce superior performance in ATC, enjoying high effectiveness and potentially lower computational costs than complex neural networks. In this master's thesis, we present the first and largest comparative study to exploit the cost-effectiveness of Stacking in ATC, consisting of Transformers and non-neural algorithms. In particular, we are interested in answering the following research question: Is it possible to obtain an effective ensemble with significantly less computational cost than the best learning model for a given dataset? Besides answering that question, another main contribution of this thesis is the proposal of a low-cost oracle-based method that can predict the best ensemble in each scenario using only a fraction of the training data.
APA, Harvard, Vancouver, ISO, and other styles
3

Abla, Parhat. "Lattice Based Group Key Exchange Protocol in the Standard Model." In 2nd International Conference on Machine Learning &Trends (MLT 2021). AIRCC Publishing Corporation, 2021. http://dx.doi.org/10.5121/csit.2021.111113.

Full text
Abstract:
Group key exchange schemes allow group members to agree on a session key. Although there are many works on constructing group key exchange schemes, but most of them are based on algebraic problems which can be solved by quantum algorithms in polynomial time. Even if several works considered lattice based group key exchange schemes, believed to be post-quantum secure, but only in the random oracle model. In this work, we propose a group key exchange scheme based on ring learning with errors problem. On contrast to existing schemes, our scheme is proved to be secure in the standard model. To achieve this, we define and instantiate multi-party key reconciliation mechanism. Furthermore, using known compiler with lattice based signature schemes, we can achieve authenticated group key exchange with postquantum security.
APA, Harvard, Vancouver, ISO, and other styles
4

Soos, Mate, and Kuldeep S. Meel. "Gaussian Elimination Meets Maximum Satisfiability." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/55.

Full text
Abstract:
Given a set of constraints F and a weight function W over the assignments, the problem of MaxSAT is to compute a maximum weighted solution of F. MaxSAT is a fundamental problem with applications in numerous areas. The success of MaxSAT solvers has prompted researchers in AI and formal methods communities to develop algorithms that can use MaxSAT solver as oracle. One such problem that stands to benefit from advances in MaxSAT solving is discrete integration. Recently, Ermon et al. achieved a significant breakthrough by reducing the problem of integration to polynomially many queries to an optimization oracle where $F$ is conjuncted with randomly chosen XOR constraints. Unlike approximate model counting, where hashing-based approaches have been able to achieve scalability as well as rigorous formal guarantees, the practical evaluation of Ermon et al's approach, called WISH, often sacrifice theoretical guarantees, largely due to lack of existing MaxSAT solvers with native XOR support. The primary contribution of this paper is a new MaxSAT solver, GaussMaxHS, with built-in XOR support. The architecture of GaussMaxHS is inspired by CryptoMiniSAT, which has been the workhorse of hashing-based approximate model counting techniques. The resulting solver, GaussMaxHS, outperforms MaxHS over 9628 benchmarks arising from spin glass models and network reliability domains. In particular, with a timeout of 5000 seconds, MaxHS could solve only 5473 benchmarks while GaussMaxHS could solve 6120 benchmarks.
APA, Harvard, Vancouver, ISO, and other styles
5

Rangan, Ravi M., Kenneth Maddux, and William Duwe. "A Practical Methodology to Automate Routine and Data Intensive Design Activities." In ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium collocated with the ASME 1994 Design Technical Conferences. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/edm1994-0506.

Full text
Abstract:
Abstract Many engineering enterprises are involved in routine design operations. Routine design, in such cases, is concerned with varying the size and/or configuration of the chosen system using established solution principles, i.e. no new solution principles are introduced. However, in most engineering environments that deliver custom products to customers, the processes followed in ensuring that these routine designs are viable, are dependent on complex interactions within the organization. For example, customer delivery requirements may dictate material selection based on timely availability and scheduling logistics, manufacturability, adherence to codes and standards and test procedures, in addition to technical design issues such as stress and fit calculations. This paper explores a practical and generic approach to help understand the design process, and then to subsequently prioritize the appropriate automation potential from a business standpoint. Using a structured methodology that equally emphasizes business process modeling, design process modeling, information modeling and final process implementation, the engineering enterprise is able to identify a technical focus area and an associated implementation plan. Upon identifying the technical focus, structured methodologies are again applied to develop and implement the design automation function. We illustrate this methodology using, as an example, a production-level automation capability that was developed within the framework of routine design operations at TDW, a designer and manufacturer of pipeline fittings, a company that services the major oil, gas and utilities companies. The complete program was carried out over a two year period and the company has successfully reduced the tedious manual design process of complex pressure vessel systems to a streamlined automated process that has resulted in vast improvements in time to market, product quality and consistency, and significantly shorter design cycle times. This automated system was developed on the UNIX platform, and integrates TDW proprietary algorithms and rules with SDRC’s I-DEAS (SDRC, 1994), a geometric modeling system, ORACLE (ORACLE, 1992), a database management system, and KES (KES, 1988), a commercial expert system shell.
APA, Harvard, Vancouver, ISO, and other styles
6

van Bremen, Timothy, and Ondrej Kuzelka. "Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/587.

Full text
Abstract:
We study the symmetric weighted first-order model counting task and present ApproxWFOMC, a novel anytime method for efficiently bounding the weighted first-order model count of a sentence given an unweighted first-order model counting oracle. The algorithm has applications to inference in a variety of first-order probabilistic representations, such as Markov logic networks and probabilistic logic programs. Crucially for many applications, no assumptions are made on the form of the input sentence. Instead, the algorithm makes use of the symmetry inherent in the problem by imposing cardinality constraints on the number of possible true groundings of a sentence's literals. Realising the first-order model counting oracle in practice using the approximate hashing-based model counter ApproxMC3, we show how our algorithm is competitive with existing approximate and exact techniques for inference in first-order probabilistic models. We additionally provide PAC guarantees on the accuracy of the bounds generated.
APA, Harvard, Vancouver, ISO, and other styles
7

You, Chong, Chun-Guang Li, Daniel P. Robinson, and Rene Vidal. "Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering." In 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2016. http://dx.doi.org/10.1109/cvpr.2016.426.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Perez, Rodrigo, and Verónica Alonso. "A unique application and point of truth for Naval Architecture Calculations." In SNAME 5th World Maritime Technology Conference. SNAME, 2015. http://dx.doi.org/10.5957/wmtc-2015-108.

Full text
Abstract:
Many tools handle with the calculation of compartment definition, hydrostatics, intact and damage stability and power prediction, but these calculations are separated from the rest of ship CAD/CAM tools. Ship designers need to work closely with the shipyards, in a complex and distributed environment making necessary to have suitable tools at early design stages to ensure profitable projects. Naval architecture is handled in FORAN with a revolutionary approach, where integration and advanced features are the relevant characteristics in a single and complete set of applications that are used in conjunction to other disciplines, from concept design to operation. This new approach groups the former modules for naval architecture available in FORAN from many years, is intuitive and user-friendly. The information is stored in a database instead of a wide set of files. As regards this feature, there are two different alternatives depending on the scope of the project. If the ship designer wants to calculate only naval architecture calculations, the solutions is based on a SQLITE database suitable for a standalone application. This approach benefits a ship design office, in the study of different design alternatives very quickly but having a complete control of them. The other option is integrating the Naval Architecture with the rest of FORAN design disciplines, in a single database based in Oracle. In this case, the great benefit comes from the single truth of data from concept design to operation, which ensures dramatically the reduction of errors and re-work. After the definition of compartments in 3D, by using a very fast application, the module guides the user through the naval architecture calculations with a tree of elements very intuitive, with powerful key algorithms and with a solid representation of spaces. The definition of the necessary entities to make any kind of calculation is very fast. For the intact stability a set of standard stability criteria is provided. It is based in a quick definition of loading conditions, initial situations, flooding conditions and compartment subdivisions. And for the evaluation of the damage stability a set of standard stability criteria are also provided, following deterministic and probabilistic approaches. With these tools any naval architect is able to make very fast all the necessary studies to assure the stability regulations are complied with.
APA, Harvard, Vancouver, ISO, and other styles
9

Xue, Feng, Qiaoling Chen, and Yang Zhang. "A Doppler frequency estimation algorithm based on band mismatch." In 2014 IEEE International Conference on Orange Technologies (ICOT). IEEE, 2014. http://dx.doi.org/10.1109/icot.2014.6956603.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sung-Lin Tsai, Ming-Kun Chen, Min-Haw Wang, and Ling-Sheng Jang. "EIS algorithm based on single-cell impedance system." In 2013 1st International Conference on Orange Technologies (ICOT 2013). IEEE, 2013. http://dx.doi.org/10.1109/icot.2013.6521171.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Oracle based algorithms"

1

Burks, Thomas F., Victor Alchanatis, and Warren Dixon. Enhancement of Sensing Technologies for Selective Tree Fruit Identification and Targeting in Robotic Harvesting Systems. United States Department of Agriculture, October 2009. http://dx.doi.org/10.32747/2009.7591739.bard.

Full text
Abstract:
The proposed project aims to enhance tree fruit identification and targeting for robotic harvesting through the selection of appropriate sensor technology, sensor fusion, and visual servo-control approaches. These technologies will be applicable for apple, orange and grapefruit harvest, although specific sensor wavelengths may vary. The primary challenges are fruit occlusion, light variability, peel color variation with maturity, range to target, and computational requirements of image processing algorithms. There are four major development tasks in original three-year proposed study. First, spectral characteristics in the VIS/NIR (0.4-1.0 micron) will be used in conjunction with thermal data to provide accurate and robust detection of fruit in the tree canopy. Hyper-spectral image pairs will be combined to provide automatic stereo matching for accurate 3D position. Secondly, VIS/NIR/FIR (0.4-15.0 micron) spectral sensor technology will be evaluated for potential in-field on-the-tree grading of surface defect, maturity and size for selective fruit harvest. Thirdly, new adaptive Lyapunov-basedHBVS (homography-based visual servo) methods to compensate for camera uncertainty, distortion effects, and provide range to target from a single camera will be developed, simulated, and implemented on a camera testbed to prove concept. HBVS methods coupled with imagespace navigation will be implemented to provide robust target tracking. And finally, harvesting test will be conducted on the developed technologies using the University of Florida harvesting manipulator test bed. During the course of the project it was determined that the second objective was overly ambitious for the project period and effort was directed toward the other objectives. The results reflect the synergistic efforts of the three principals. The USA team has focused on citrus based approaches while the Israeli counterpart has focused on apples. The USA team has improved visual servo control through the use of a statistical-based range estimate and homography. The results have been promising as long as the target is visible. In addition, the USA team has developed improved fruit detection algorithms that are robust under light variation and can localize fruit centers for partially occluded fruit. Additionally, algorithms have been developed to fuse thermal and visible spectrum image prior to segmentation in order to evaluate the potential improvements in fruit detection. Lastly, the USA team has developed a multispectral detection approach which demonstrated fruit detection levels above 90% of non-occluded fruit. The Israel team has focused on image registration and statistical based fruit detection with post-segmentation fusion. The results of all programs have shown significant progress with increased levels of fruit detection over prior art.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Oracle based algorithms' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography