Search

This article undertakes a rhetorical reading of Oliver Wendell Holmes Jr.'s "The Path of the Law" (1897), attending particularly to Holmes's use of the trope of the "oracle" in his legal philosophy to show how Holmes utilizes this figure to interrogate the Anglo-American legal tradition and to articulate his own, new understanding of the task of the law. For Holmes, lawyers reading the "sibylline leaves" of the common law will inevitably make imperfect predictions about how judges will rule a case. In contrast, Holmes suggests that lawyers should be able to make predictions with the same degree of reliability as scientific hypotheses based on the laws of physics. Similarly, Holmes argues that laws should be considered in terms of desired ends, rather than precedent and tradition, and assessed using the new quantitative social science of statistics. Thus, by turning "prophecy" into a figure of rationality, Holmes calls for a radical reinvention of the law as scientifically based and oriented towards the future. [ABSTRACT FROM AUTHOR]

We study point-to-point distance estimation in hypergraphs, where the query is parameterized by a positive integer s, which defines the required level of overlap for two hyperedges to be considered adjacent. To answer s-distance queries, we first explore an oracle based on the line graph of the given hypergraph and discuss its limitations: The line graph is typically orders of magnitude larger than the original hypergraph. We then introduce HypED, a landmark-based oracle with a predefined size, built directly on the hypergraph, thus avoiding the materialization of the line graph. Our framework allows to approximately answer vertex-to-vertex, vertex-to-hyperedge, and hyperedge-to-hyperedge s-distance queries for any value of s. A key observation at the basis of our framework is that as s increases, the hypergraph becomes more fragmented. We show how this can be exploited to improve the placement of landmarks, by identifying the s-connected components of the hypergraph. For this latter task, we devise an efficient algorithm based on the union-find technique and a dynamic inverted index. We experimentally evaluate HypED on several real-world hypergraphs and prove its versatility in answering s-distance queries for different values of s. Our framework allows answering such queries in fractions of a millisecond while allowing fine-grained control of the trade-off between index size and approximation error at creation time. Finally, we prove the usefulness of the s-distance oracle in two applications, namely hypergraph-based recommendation and the approximation of the s-closeness centrality of vertices and hyperedges in the context of protein-protein interactions. [ABSTRACT FROM AUTHOR]

Oracle is a data supply mechanism that provides real-world data for blockchain. It serves as a bridge between blockchain and the IoT world, playing a crucial role in solving problems such as data sharing and device management in the IoT field. The main challenge at this stage is determining how to achieve data privacy protection in distributed Oracle machines to safeguard the value hidden in data on the blockchain. In this paper, we propose an improved scheme for distributed Oracle data aggregation based on Paillier encryption algorithm, which achieves end-to-end data privacy protection from devices to users. To address the issue of dishonest distributed Oracle machines running out of funds, we have designed an algorithm called PICA (Paillier-based InChain Aggregation). Based on the aggregation on the Chainlink chain and the Paillier encryption algorithm, random numbers are introduced to avoid the problem of dishonest Oracle machines running out of funds. We use the traffic coverage method to solve the problem of exposed request paths in distributed Oracle machines. Simulation and experimental results show that in small and medium-sized IoT application scenarios with 10,000 data nodes, each additional false request in a single request will result in a delay of about 2 s in data acquisition and can achieve a request response time of 20 s. The proposed method can achieve user data privacy protection. [ABSTRACT FROM AUTHOR]

This article is intended as an essay about consciousness. The logic of morality leads humans to turn to their deepest essence, which is consciousness, as the highest faculty of human reason. Consciousness gives humans their intransitive value as the only moral beings gifted with mind, intellect, and reason, heart and soul, free will, faith, and love. Conscience is our personal god, our inner person/"homo interior", demon, oracle, and judge. [ABSTRACT FROM AUTHOR]

In the advancing world of blockchain technology, the paramount need for trustworthy oracles, the entities responsible for providing external data to blockchain's smart contracts, is becoming more apparent. This paper introduces a novel protocol, the Persona Preserving Reputation Protocol (P2RP), which leverages Decentralized Identity (DID)-based reputation systems to maintain security and user privacy while ensuring the trustworthiness of blockchain oracles. Leveraging the innovative application of Ordinary Differential Equations (ODEs), we introduce a technique for forecasting and calculating the reputation scores of users, a crucial component within the P2RP protocol. The design of P2RP features four distinct account types with varying degrees of privacy and reputation characteristics. The simulation results suggest that the P2RP protocol can lead towards a secure, privacy-preserving, and reliable oracle service in the Web3 ecosystem. [ABSTRACT FROM AUTHOR]

Most user-collaborative location privacy protection mechanisms assume that collaborative group members are trustworthy and can strictly enforce collaboration rules. Such assumptions do not match reality and reduce the usability of the schemes. In this paper, we propose Invisible Man, a blockchain-enabled framework for peer-to-peer collaborative privacy games for location-based services. The framework enables users to protect their privacy in extreme environments and allows members of a collaborative group without trust to collaborate efficiently. To defend against inference attacks, a user-collaborative privacy game model is constructed, and a dual-verification mechanism with Chainlink and Witnet oracles is developed to provide security guarantees for model generation. Members can conduct cooperative games under the guidance of the model. To realize secure and efficient in-group collaboration, a blockchain-based reward and punishment mechanism for collaboration is designed, integrating token incentives and a blacklisting mechanism to ensure the verifiability and audibility of user behaviors. Security analysis and extensive simulation results demonstrate that the proposed scheme achieves high security and privacy with low costs. [ABSTRACT FROM AUTHOR]

We investigate multitask learning in the context of multivariate linear regression with high dimensional covariates and heavy‐tailed noise, while under the constraint of limited memory. To tackle the computational complexity arising from the non‐smoothness of the quantile loss, we reformulate it as an equivalent least squares loss, which yields robust solutions even in the presence of heavy‐tailed noise. We incorporate a group lasso penalty into the quantile loss to produce sparse solutions, and an accelerated proximal sub‐gradient descent algorithm to speed up the computation while ensuring explicit forms for penalized solutions at each iteration. The proposed algorithm is general and can be applied to similar optimization problems. Moreover, we introduce a communication‐efficient distributed algorithm that guarantees optimal convergence rates after finite communication rounds in cases where computing resources such as memory are insufficient. We also study the theoretical properties of the resultant estimate and relax the widely used model selection consistency assumption on the initial estimate. We demonstrate the effectiveness of our proposal through extensive numerical studies. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Introduction: It was a century ago, whether used separately or in combination with other medicines, that radiotherapy evolved into a successful cancer treatment. In traditional radiation therapy, a Dose Volume Histogram (DVH) is utilized for quantitative analysis of the treatment plan after the adoption of the treatment planning system. An isodose distribution is also used for qualitative analysis and evaluation of the treatment plan during this phase. The right treatment plan is assessed using physical and radiobiological models by inhouse software developed for radiation oncologists. Materials and Methods: The first process was the OSCAR (Object Scoring with Coloured Area of Regret) treatment planning system, developed by Theratronics International, Kanata, Canada in 1991, which was one of the numerous plan evaluation software programs that were established in the field of radiation medicine to analyse and regularize the dose distribution. Many plan evaluation programs have been created over the developing years, with the commercial software used primarily and the primary inclusion MATLAB, and very few have been created using Microsoft Visual Basic, C++, and Java. As a substitute for MATLAB, Python is utilized because it is freely available and has no commercial value. Results: This study's primary objective is to personalize the radiobiological effects to predict each patient by using the DVH data, which are now accessible, to improve the overall performance of the prior model. Several programming languages were initially investigated to check the portability and quick program execution to illustrate the novel ideas. It was discovered that Python was adequate for this research even if it has no economic value compared to other languages. The software receives the DVH data in text format as an input, and for convenience, it displays the output using a variety of Python widgets. Discussion: The major radiobiological parameter values, TD50/5, slope parameter (m), and volume parameter (n), are used to calculate the Tumour Control Probability (TCP) and NTCP values of numerous targets and oars from their respective DVH statistics using Python software. The evaluation of the physical indices of the treatment plans, the AAPM, RTOG, and QUANTEC protocols were used in a clinical analysis for the execution of treatment plans. Conclusion: The problem in the previous plan evaluation tool was fixed by the custom-made PYTHON program used for this research investigation, which also added clinical and radiobiological understanding of the treatment plan. The software produces a report using Microsoft Excel for the comprehensive radiobiological and dosimetric plan evaluation study for cancer patients. [ABSTRACT FROM AUTHOR]

Blockchainsand smart contracts are pivotal in transforming interactions between systems and individuals, offering secure, immutable, and transparent trust-building mechanisms without central oversight. However, Smart Contracts face limitations due to their reliance on blockchain-contained data, a gap addressed by 'Oracles'. These bridges to external data sources introduce the 'Oracle problem', where maintaining blockchain-like security and transparency becomes vital to prevent data integrity issues. This paper presents Veritas, a novel decentralized oracle system leveraging a layer-2 scaling solution, enhancing smart contracts' efficiency and security on Ethereum blockchains. The proposed architecture, explored through simulation and experimental analyses, significantly reduces operational costs while maintaining robust security protocols. An innovative node selection process is also introduced to minimize the risk of malicious data entry, thereby reinforcing network security. Veritas offers a solution to the Oracle problem by aligning with blockchain principles of security and transparency, and demonstrates advancements in reducing operational costs and bolstering network integrity. While the study provides a promising direction, it also highlights potential areas for further exploration in blockchain technology and oracle system optimization. [ABSTRACT FROM AUTHOR]

Species-habitat associations are correlative, can be quantified, and used for powerful inference. Nowadays, Species Distribution Models (SDMs) play a big role, e.g. using Machine Learning and AI algorithms, but their best-available technical opportunities remain still not used for their potential e.g. in the policy sector. Here we present Super SDMs that invoke ML, OA Big Data, and the Cloud with a workflow for the best-possible inference for the 300 + global squirrel species. Such global Big Data models are especially important for the many marginalized squirrel species and the high number of endangered and data-deficient species in the world, specifically in tropical regions. While our work shows common issues with SDMs and the maxent algorithm ('Shallow Learning'), here we present a multi-species Big Data SDM template for subsequent ensemble models and generic progress to tackle global species hotspot and coldspot assessments for a more inclusive and holistic inference. [ABSTRACT FROM AUTHOR]

Copyright of Studia Universitatis Babes-Bolyai, Educatio Artis Gymnasticae is the property of Babes-Bolyai University, Cluj-Napoca, Romania and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The database management system (DBMS) for any application is crucial for developers because each application needs high performance to run efficiently. Therefore, database Benchmarking is the process of performing several Defined tests on those databases to evaluate their performance. The electronic benchmarking System (EBS) facilitates and improves human resource management (HRM) in all aspects of real life. EBS designed by four different database backends and three different web technology. This paper presents a comparative evaluation of the performance of the top DBMS systems namely (MySQL, SQL Server, Oracle, and MS Access). The middleware is designed using three dynamic web technologies (PHP, ASP, and PYTHON). In order to evaluate the backend performance for the four mentioned databases system by using two Parameters Response Time (RT) and Throughput (TT) over different Tire Architectures namely: One-Tier Architecture (1TA), Two-Tier Architecture (2TA). This paper will show which of the database has a better Response time (RT) and Throughput (TT). [ABSTRACT FROM AUTHOR]

In the aviation industry, the issuance of airside passes often encounters significant delays, posing logistical challenges and hindering crucial operations. This study delves into the potential of implementing blockchain technology, particularly smart contracts, to streamline and expedite airport security processes. Our analysis of data from leading UK airports reveals notable inefficiencies in the current airside pass issuance procedures, necessitating a transformative solution. We advocate for the integration of blockchain smart contracts as a pioneering approach to substantially reduce processing times. By automating execution based on predefined conditions, smart contracts have the potential to revolutionize airport security operations. This research signifies a groundbreaking advancement in the use of smart contracts within the airline industry, underscoring the substantial efficiency improvements that can be achieved. As we conclude this study, we foresee further research and practical implementations to unlock the full transformative impact of blockchain technology on aviation security. [ABSTRACT FROM AUTHOR]

Methods of data transfer from the Oracle environment to the PostgreSQL environment with stage-by-stage organization of actions and determination of the sequence of migration are considered. The main directions for the transformation of the structure of databases, data formats and executed objects are identified. Methods for converting stored procedures and triggers written in procedural languages (PL/SQL and PL/pgSQL) are specified. Software change on nodes directly connected (associated) with the database server and minimization of downtimes during migration are considered, which allows the transfer to be performed for geographically distributed and round-the-clock functioning objects. Examples of changing the speed of query execution before and after migration are given for systems of various types. [ABSTRACT FROM AUTHOR]

Land administration systems are being modernised to streamline the cadastral data lodgement. However, in many jurisdictions, cadastral data are still stored as a flat file. This method of data storage has significant limitations in terms of effective access, management, query, and analysis of cadastral data. Therefore, this study elicited the requirements and proposed an approach to automate the cadastral data storage. The proposed approach was successfully implemented within the land registry organisation in Victoria, Australia and the database management system was rigorously tested. The outcomes can potentially contribute to the implementation of a similar data storage infrastructure in other jurisdictions. [ABSTRACT FROM AUTHOR]

Since the introduction of genomic selection in plant breeding, high genetic gains have been realized in different plant breeding programs. Various methods based on genomic estimated breeding values (GEBVs) for selecting parental lines that maximize the genetic gain as well as methods for improving the predictive performance of genomic selection have been proposed. Unfortunately, it remains difficult to measure to what extent these methods really maximize long-term genetic values. In this study, we propose oracle selection, a hypothetical frame of mind that uses the ground truth to optimally select parents or optimize the training population in order to maximize the genetic gain in each breeding cycle. Clearly, oracle selection cannot be applied in a true breeding program, but allows for the assessment of existing parental selection and training population update methods and the evaluation of how far these methods are from the optimal utopian solution. [ABSTRACT FROM AUTHOR]

The Te'omim Cave is a large karst cave located in the Jerusalem Hills. Since 2009, the cave has been explored by our team as a joint project of the Martin (Szusz) Department of Land of Israel Studies and Archaeology at Bar-Ilan University and the Cave Research Center at the Hebrew University of Jerusalem. Over 120 intact oil lamps were collected in the 2010–2016 survey seasons from all sections of the cave; most of them were dated to the second to fourth centuries CE. All of these lamps had been deliberately inserted in narrow, deep crevices in the main chamber walls or beneath the rubble. Some crevices contained groups of oil lamps mixed with weapons and pottery vessels from earlier periods or placed with human skulls. This article discusses the possibility that the oil lamps, weapons, human skulls, and other artifacts were used as part of necromancy ceremonies that took place in the cave during the Late Roman period, and that the cave may have served as a local oracle (nekyomanteion). [ABSTRACT FROM AUTHOR]

Copyright of Journal of Zhengzhou University (Natural Science Edition) is the property of Journal of Zhengzhou University (Natural Science Edition) Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This case discusses how database management systems (DBMSs) have evolved and become more sophisticated, distributed, and specialized, focusing on SAP's transition from a traditional pipeline to a platform company. When DBMS was first introduced to the market, firms expected DBMS to store a large set of data in an organized way and extract the stored data consistently and efficiently. With the advent of technologies in the software, hardware, and networking domains, the DBMS industry has seen dramatic changes in the notions of product, customer, market, competitor, value chain partners, business model, and the industry itself. While SAP has dominated the enterprise resource planning (ERP) solution market since 1972, Oracle is closing the gap from 2018 onwards. The loss of SAP's leadership position in some of the recent customer perception surveys may eventually lead to the loss of its market leadership position. How can SAP retain its market leadership while simultaneously regaining its leadership position in customer perception surveys form the core of this case? The case ends with questions about strategic choices that can help SAP keep up its leadership position and chart out future growth trajectory. [ABSTRACT FROM AUTHOR]

For searching an item in unstructured databases, Grover's quantum search algorithm offers quadratic speedup over classical search algorithms. This paper reports 2 to 5 quantum-bit (Qubit) implementations of Grover's search algorithm using the phase-flip method for oracle function realization without any extra ancilla qubit. A comprehensive estimation and analysis of the theoretical and physical accuracies of the algorithm have been presented. The impact of increasing qubits on accuracy has been computed and analyzed. The metrics delineated for comparison are the number of qubits and gates, depth of the circuit, execution time, and theoretical/physical accuracy. The results revealed a greater disparity between theoretical and physical accuracy using a higher number of qubits perceived to be caused by noisy qubits utilized in computations. The novelty of the work is the investigation of variations caused by the noise in the accuracy and execution time of Grover's search algorithm. The results indicate that because of noise, the accuracy of 2- and 3-qubit implementations declined by 14.49% and 33.86%, whereas the execution time increased by 50% and 80%; respectively. [ABSTRACT FROM AUTHOR]

Copyright of Nazariyat: Journal for the History of Islamic Philosophy & Sciences / Nazariyat Islam Felsefe Bilim Tarihi Arastirmalari Dergisi is the property of Ilmi Etudler Dernegi (ILEM) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the rapid progress of network information technologies, security in medical data transmission has emerged as a popular research topic. Electronic Health Data (EHR) is vulnerable to security breaches, tampering, manipulation, and data leakage. The blockchain's data integrity, decentralization, and anonymity opened up new possibilities for addressing the aforementioned issues. Therefore, this paper presents a Blockchain-based Access Control Scheme (BACS) with Multiple Party Authority (MPA), smart contract, and proxy re encryption to secure the EHR. The proposed scheme consists of six phases: the registration phase, appointment phase, data aggregation stage, storage phase, query phase, and validation phase. The medical data is encrypted by using a Lightweight Fused Cryptographic (LFC) algorithm with the signature of the patient and doctor to ensure confidentiality and integrity. The encrypted EHR is then stored on Interplanetary File Systems (IPFS), which is a decentralised file storage platform. Moreover, the developed smart contract verifies the authenticity of the users, provides a reputation score for the oracle, and creates a time seal. This enhances the security of the system from external attacks as well as internal attacks. A security analysis is conducted for the proposed method, and the performance is compared with the existing techniques based on encryption time, decryption time, and computation cost. [ABSTRACT FROM AUTHOR]

International business theory suggests that multinational corporations are usually disadvantaged compared to local firms when competing in a host market. However, we find that foreign enterprise resource planning (ERP) vendors in the Chinese high-end ERP market perform significantly better than local vendors. To understand this gap, the authors first analyze the ERP business model and its four characteristics as a service and use Dunning's OLI paradigm to specify the ownership-specific, internalization-incentive, and location-specific advantages (O-, I-, and L-advantages) required for foreign ERP vendors to compete in the host country's high-end market. Then, after conducting case studies of the two foreign vendors with the highest share in the Chinese high-end ERP market, SAP and Oracle, they confirm that the O-advantages from strong brand and reputation, high research and development capabilities, professional partners, I-advantages from wholly owned subsidiaries, and L-advantages from economically developed regions cause SAP and Oracle to excel in the Chinese high-end ERP market. [ABSTRACT FROM AUTHOR]

Those born between the sixties and eighties have witnessed tremendous change all walks of life thanks to the Renaissance in the field of artificial intelligence. Artificial intelligence is no longer confined to commercial and/or professional arenas only, but has brought under its umbrella all aspects of day-to-day life. Technological advancement is a continuous process, and it always moves forward. In my opinion, artificial intelligence evolves primarily as a result of changes in data as well as the ease with which data bases are managed. The advancement in information technology has been achieved through the process of collating huge amounts of data, processing the same at lightning speed, and facilitating the right solution for the end consumer, whomever that may be, and whatever customised, complex, marketable ready-mix answer it may be. Thus, what is most important in the field of information technology is the art and technology of database management systems (DBMS). Popular DBMS, to name a few, are Oracle, MySQL, SQL Server, etc. Artificial intelligence has managed to shrink geographical distance, especially pertaining to the globalisation of technologies, which has led to advancement in all fields, including medical treatment. The term 'Third World Country' may no longer apply in the medical world any more. Be it oncology, cardiology, or endocrinology, the best of the treatments are available around the world. Those born during 'fifties' or 'sixties', have literally witnessed multiple dramatic transitions in the way of life. We have seen telegrams, advent of Telex, Typewriters, computing machines (both manual and electrically operated), piles of files, writing pads, ink pens, Black and white movies so on and so forth. Gone are those days possibly never to return! [ABSTRACT FROM AUTHOR]

Decentralized finance (DeFi) is by far the most popular application of blockchain technology. Despite the wide acceptance of new financial instruments and services, there are still many unexplored areas in the field. We dedicate this research to the understanding of one of the most crucial limitations of decentralized finance—oracles. DeFi protocols, as well as other blockchain applications, function in a closed environment and regularly need to fetch real-world information (e.g., assets' prices)—the tool used for this purpose is called an oracle. We review the existing oracle types in DeFi applications and focus our research on the least explored one: when another protocol, typically a decentralized exchange, serves as a price oracle. After explaining the mechanisms behind the decentralized exchanges, we introduce an algorithmic model that allows one to safely design a decentralized oracle and adjust crucial parameters. We believe that understanding and implementing the logic presented in the model can help to reduce the chances of price manipulations attacks, which are the most frequent incident types in DeFi. [ABSTRACT FROM AUTHOR]

The Polaire Brotherhood (La Fraternité polaire) was an occult society active in interwar Paris. Some of the important names of the French occult scene of the period were among its members. According to the reports in the bulletin of the society, there was also a branch operating in Belgrade in the 1930s. However, this has not previously been confirmed. Archive materials used for this paper attest to the existence of the Belgrade group for the first time. Its most important figure was Ksenija Atanasijević (1894–1981), a prominent philosopher. Therefore, attention is also paid to her involvement with Theosophy and co-masonry and the place of esotericism in her work. The activity of the group reminded of the Theosophical—it included meetings, lectures and meditations. They were also familiar with The Oracle of Astral Force (the Fraternité's key method). The existence of a branch of the French brotherhood in this period can be understood in the context of the French-Serbian cultural relations. This interest in the "alternative" helps us get a better understanding of the history of Serbian intellectuals. [ABSTRACT FROM AUTHOR]

Copyright of Electric Power Engineering Technology is the property of Editorial Department of Electric Power Engineering Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The solution of nonlinear Boolean equations in a binary field plays a crucial part in cryptanalysis and computational mathematics. To speed up the process of solving Boolean equations is an urgent task that needs to be addressed. In this paper, we propose a method for solving Boolean equations based on the Grover algorithm combined with preprocessing using classical algorithms, optimizing the quantum circuit for solving the equations, and implementing the automatic generation of quantum circuits. The method first converted Boolean equations into Boolean expressions to construct the oracle in the Grover algorithm. The quantum circuit was emulated based on the IBM Qiskit framework and then simulated the Grover algorithm on this basis. Finally, the solution of the Boolean equation was implemented. The experimental results proved the feasibility of using the Grover algorithm to solve nonlinear Boolean equations in a binary field, and the correct answer was successfully found under the conditions that the search space was 221 and three G iterations were used. The method in this paper increases the solving scale and solving speed of Boolean equations and enlarges the application area of the Grover algorithm. [ABSTRACT FROM AUTHOR]

Grover's quantum search algorithm delivers quadratic speedup over classical counterparts for finding an item in unstructured database. But the accuracy of the algorithm degrades as the number of qubits are increased. Noises of various types affect the accuracy of the Grover's algorithm. The imperfect measurement on the qubit results in measurement errors appears to be one of the factors which limit the scalability of near-term quantum devices/algorithms. This paper is focused on the implementation of measurement error mitigation technique on Grover's algorithm up to 4-qubit. The measurement error mitigation model for Grover's algorithm is developed and implemented on the real-time quantum computer. The accuracy of Grover's algorithm up to 4-qubits with and without measurement errors is evaluated and compared. The results indicate that measurement error mitigation technique mitigates the measurement errors of the Grover's algorithm and improves its accuracy. [ABSTRACT FROM AUTHOR]

In this essay, a number of traditional Chinese stories, from the 8th to the 18th century, are considered both for their use of coincidences and for the strong sense of fate or destiny that is very much evident in their plots. The elaborate use of coincidences to support an unfolding destiny is particularly well demonstrated in the 'The Oil Peddler and the Queen of Flowers'. Also included here is the detective novel, Dee Goong An, in which divination is used as a means for the Tang Dynasty detective, Judge Dee, to track down important criminals. The book was translated into English by the Dutch sinologist Robert van Gulik, who later became famous for writing his own Judge Dee detective stories. Some of the differences between the 18th century original and van Gulik's own murder mysteries are introduced here--hence the reference in the title of this essay to 'Chinese-influenced fiction'. One other example of Chinese-influenced fiction is included: Hermann Hesse's last great novel, The Glass Bead Game, in which the I Ching makes a small but significant contribution to the unfolding narrative. [ABSTRACT FROM AUTHOR]

Copyright of SJOT: Scandinavian Journal of the Old Testament is the property of Routledge and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Quantum search is one kind of the most important quantum algorithms, which is the only threat to postquantum cryptography till now. In this paper, we consider the problem of partial searching, where we are interested in part of the information of the item being searched. Then, we present the quantum partial search algorithm with smaller oracles, which reduces the difficulty of designing oracles without errors. The time complexity of this algorithm is smaller than that of the Grover search algorithm in practical instances. Furthermore, we present a punctuated version of the quantum partial search algorithm with smaller oracles to make the algorithm more practical by decreasing the number of iterations further. The punctuated algorithm could be running on several quantum computers in parallel. Taking these factors into consideration, the quantum partial search algorithm with smaller oracles for multiple target items is practical for running on a quantum computer and solving many real problems, such as the Hamiltonian circuit problem and solving systems of nonlinear equations. [ABSTRACT FROM AUTHOR]