This paper concerns the paraconsistent logic LPQ⊃,F and an application of it in the area of relational database theory. The notions of a relational database, a query applicable to a relational database, and a consistent answer to a query with respect to a possibly inconsistent relational database are considered from the perspective of this logic. This perspective enables among other things the definition of a consistent answer to a query with respect to a possibly inconsistent database without resort to database (...) repairs. In an earlier paper, LPQ⊃,F is presented with a sequent-style natural deduction proof system. In this paper, a sequent calculus proof system is presented instead because such proof systems are generally considered more suitable as the basis of proof search procedures than natural deduction proof systems and proof search procedures can serve as the core of algorithms for computing consistent answers to queries. (shrink)

This paper addresses the problem of querying several databases considered as a whole. Assuming that the different databases share a common data description language, the problem that arises is to consistently answer queries even if the database contents are contradictory. The main contribution of this paper is the specification of a query-evaluator for answering closed and open general queries addressed to several databases and for providing explanations about the results. For doing so, we first specify a (...) query-evaluator, in logic, which assumes that the databases are propositional ones and do not contain disjunctions. Then we extend it to first-order databases defined by an extensional part and an intensional part. We also show that the query-evaluator corresponds to a majority merging of the databases. (shrink)

Preference queries from databases aim to retrieve the best answers w.r.t. user's requirements. The integration of preferences in database queries has known many advances in the last decade. Most of works however are based on comparative preference statements obeying more or less strong semantics. Representing and reasoning about comparative preference statements has also been widely investigated in Artificial Intelligence. In this paper, we bridge the two frameworks and develop a simple and unified framework to reason about preferences in database (...) queries. Our framework is based on insights from non-monotonic reasoning. (shrink)

Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic or prosodic in nature, and have a hierarchical structure. Query languages are used to select particular structures of interest, or to project out large slices of a corpus for external analysis. Existing languages suffer from a variety of problems in the areas of expressiveness, efficiency, and naturalness for linguistic query. We describe the domain of linguistic trees (...) and discuss the expressive requirements for a query language. Then we present a language that can express a wide range of queries over these trees, and show that the language is first-order complete over trees. (shrink)

This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database, based on a semantics inspired by rough sets. The implementation is based upon the use of a standard SQL database to store logical facts, augmented with several query interface layers implemented in JAVA through which extensional, intensional and local closed world nonmonotonic queries in the form of crisp or approximate logical formulas can be evaluated tractably. A graphical database design user interface is also provided (...) which simplifies the design of databases, the entering of data and the construction of queries. The theory and semantics for AKDBs is presented in addition to application examples and details concerning the database implementation. (shrink)

Role-based database management systems are most widely used for information storage and analysis but are known as vulnerable to insider attacks. The core of intrusion detection lies in an adaptive system, where an insider attack can be judged if it is different from the predicted role by performing classification on the user’s queries accessing the database and comparing it with the authorized role. In order to handle the high similarity of user queries for misclassified roles, this paper proposes a deep (...) metric neural network with strategic sampling algorithm that properly extracts salient features and directly learns a quantitative measure of similarity. A strategic sampling method of heuristically generating and learning training pairs through Monte Carlo search is proposed to select a training pair that can represent the entire dataset. With the TPC-E–based benchmark data trained with 11,000 queries for 11 roles, the proposed model produces the classification accuracy of 95.41%, which is the highest compared with the previous models. The results are verified through comparison of quantitative and qualitative evaluations, and the feature space modelled in the neural network is analysed by t-SNE algorithm. (shrink)

We consider relational databases organized over an ordered domain with some additional relations — a typical example is the ordered domain of rational numbers together with the operation of addition. In the focus of our study are the first-order queries that are invariant under order-preserving “permutations” — such queries are called order-generic. It has recently been discovered that for some domains order-generic FO queries fail to express more than pure order queries. For example, every order-generic FO query over rational (...) numbers with + can be rewritten without +. For some other domains, however, this is not the case.We provide very general conditions on the FO theory of the domain that ensure the collapse of order-generic extended FO queries to pure order queries over this domain: the Pseudo-finite Homogeneity Property and a stronger Isolation Property. We further distinguish one broad class of domains satisfying the Isolation Property, the so-called quasi-o-minimal domains. This class includes all the o-minimal domains, but also the ordered group of integer numbers and the ordered semigroup of natural numbers, and some other domains.An important difference of this paper from the recent series of related papers is that we generalize all the notions to the case of finitely representable database states — as opposed to finite states — and develop a general lifting technique that, essentially, allows us to extend any result of the kind we are interested in, from finite to finitely representable states. We show, however, that these results cannot be transfered to arbitrary infinite states. (shrink)

Around 1950, B.A. Trakhtenbrot proved an important undecidability result (known, by a pure accident, as \Trakhtenbrot's theorem"): there is no algorithm to decide, given a rst-order sentence, whether the sentence is satis able in some nite model. The result is in fact true even if we restrict ourselves to languages that has only one binary relation Tra63]. It is hardly conceivable that at that time Prof. Trakhtenbrot expected his result to in uence the development of the theory of relational (...) class='Hi'>databases query languages, but it did. This perhaps is not surprising in view of the following two facts: 1) The theory of relational databases is strongly rooted in logic and can easily be abstracted to make it a branch of mathematical logic. 2) The main interest in the theory of relational databases is in nite relations. In the rst section we explain those two points in more detail. Then, in section 2 of the present paper, we discuss the question: \What constitutes a reasonable query to a database?" The discussion naturally leads to a certain class of queries, known as the \domain independent" queries, as an ideal query language. At this point Trakhtenbrot's theorem appears as a major obstacle, since it easily implies that this ideal class is undecidable. Real query languages cannot be allowed to have this property. Section 3 outlines then several possible ways to circumvent this di culty. The following section explains the.. (shrink)

Relational database management system is the most popular database system. It is important to maintain data security from information leakage and data corruption. RDBMS can be attacked by an outsider or an insider. It is difficult to detect an insider attack because its patterns are constantly changing and evolving. In this paper, we propose an adaptive database intrusion detection system that can be resistant to potential insider misuse using evolutionary reinforcement learning, which combines reinforcement learning and evolutionary learning. The model (...) consists of two neural networks, an evaluation network and an action network. The action network detects the intrusion, and the evaluation network provides feedback to the detection of the action network. Evolutionary learning is effective for dynamic patterns and atypical patterns, and reinforcement learning enables online learning. Experimental results show that the performance for detecting abnormal queries improves as the proposed model learns the intrusion adaptively using Transaction Processing performance Council-E scenario-based virtual query data. The proposed method achieves the highest performance at 94.86%, and we demonstrate the usefulness of the proposed method by performing 5-fold cross-validation. (shrink)

This research work proposes an implementation of adept content-based music retrieval technique that attempts to address the demands of the rising availability of digital music. The primary objective of this research work is to balance the perilous impact of non-relevant songs through progressive filtering for query by humming music information retrieval system. The PF is a technique of searching in manifolds for problem solving through reduced search space. A new strategy for empirical mode decomposition analysis is adopted, and outcomes are (...) propelled as a significant source of information for multiresolution histogram representations. Finally, the concept of PF is realized through MRH to retrieve the desired song by humming. The proposed multiresolution QBH system is evaluated on a music database of 1200 fragments, and the experimental results effectively locate the humming patterns and recite the eminence of EMD analysis for retrieving the desired song through humming. (shrink)

Criminal intelligence data poses problems for conventional database technology. It has little structure or homogeneity and queries may involve looking for unknown associations between entities; such open-ended queries cannot be made in current systems. Finally, the data must be presented in an intuitively simple fashion for both investigative and evidential purposes. We discuss a database system which uses a labelled graph as its data model. This approach obviates the need for schema design, allows queries which look for associations between entities (...) to be implemented and provides the basis for a natural visual representation of the data. (shrink)

Recently, the correspondence between the air track scenario and quantum database search algorithm was revealed. The conservation laws of linear momentum and nonlinear kinetic energy in the former case, which involve sequential elastic collisions, have their analogs in the latter case. Obviously, probability normalization combined with the Born rule serves as an analog for kinetic energy conservation. Here we explore the linear conservation laws in a generic quantum database search. Regarding the non-uniform distribution of the marked state, the uneven state (...) is initially prepared. In this way, the Grover diffusion operator results in a linear but nonphysical conservation law. On the other hand, in the CTC-assisted database search with the vast reduction of query complexity, the nonlinear instead of linear conservation laws are found. Finally, we conjecture that there are no conservation laws in the generalized Grover’s algorithm including the imaginary number i. (shrink)

The work of Chandra and Harel contained in Chandra and Harel 156–178) can be considered as the beginning of the construction of a theoretical framework in which the computability and the complexity of queries to relational databases could be studied. In the definition of the class CQ of computable queries, the authors included untyped queries , that is, queries whose answers are relations of possibly different arities on different relational structures or databases. However, it seems that in the (...) quite wide and important work which followed on the subject, untyped queries were not considered at all, neither in the abstract machines side , nor in the logic framework. We propose to re-introduce these queries in the study of query computability and complexity without the need to leave the relational model. One important application which we consider in the theoretical setting is the computation of numerical queries, that is, queries which range over the naturals. Numerical queries do not fit in the current state of the theory regarding the two formalisms referenced above, since they can result in numerical values which are not necessarily in the domain of the given structure. We define an extension of the reflective relational machine of Abiteboul et al. , which we call untyped reflective relational machine , and we prove that this model is complete considering the whole class CQ . In the logic framework, we define a new quantifier, which we call conditional quantifier , and we build with it an infinitary logic which we denote by L ω 1 ω c . The difference between this logic and the well-known infinitary logic L ω 1 ω is that a formula of our logic can induce relations of different arities on different structures or databases. Then we prove that L ω 1 ω c strictly includes the whole sub-class of the total computable queries, including untyped queries. Finally, we define a fragment of L ω 1 ω c which we prove that exactly captures the sub-class of the total computable queries, but which is undecidable. We also define an undecidable fragment of L ω 1 ω which exactly captures the sub-class of the total and typed computable queries. (shrink)

This study assesses the retractions of scientific articles in engineering journals indexed on the Web of Science from 1945 to 2015. The data set was built based on documents containing the keywords retracted, retraction, withdrawal, or redress. We used database exploration techniques, including Structured Query Language and analysis of variance, for data analysis. We analyzed 238 retractions published by 117 journals. The most common reason for retraction was unethical research, and higher impact factors journals tended to publish more retractions. In (...) conclusion, most of the analyzed retractions were the result of unethical research and were retracted by editors. (shrink)

This paper introduces and studies a declarative framework for updating views over indefinite databases. An indefinite database is a database with null values that are represented, following the standard database approach, by a single null constant. Typically a database is represented by a single set of facts |$D$| that model what is known to be true. This paper proposes a model of an indefinite extensional database that is more expressive with respect to the closed-world assumption (CWA) adapted for the (...) setting of indefinite databases (Libkin, 1995, A semantics-based approach to design of query languages for partial information. In Semantics in Databases, vol. 1358 of LNCS, pp. 170–208. Springer; der Meyden, 1998, Logical approaches to incomplete information: a survey. In Logics for Databases and Information Systems, pp. 307–356. Kluwer Academic Publishers, Norwell, MA, USA). More specifically, in our model, databases are determined by two sets of facts: |$D$| representing, as usual, all facts that are true in the database, and |$E$| that is meant to represent exceptions to the ‘unknown range’, i.e. facts that cannot be unknown. Intuitively, unless they are explicitly implied to be true by the first set, the facts specified as exceptions are assumed false. The semantics is given by means of a two-level CWA tailored to the case of indefinite information. The paper characterizes the semantics of indefinite databases in terms of their possible worlds that are obtained by instantiating occurrences of null values by concrete constants and defines several classes of database repairs that realize view-update requests. Most notable is the class of constrained repairs. Constrained repairs change the database ‘minimally’and avoid making arbitrary commitments. They narrow down the space of alternative ways to fulfill the view-update request to those that are grounded, in a certain strong sense, in the database, the view and the view-update request. (shrink)

Listed buildings, even if they are not top landmarks, are increasingly attracting visitors. People express interest in hidden gems in their neighborhood or along their travel itinerary, and in the history of the building they live in. All required data has been meticulously collected by the offices for historical monuments but is not flexibly accessible. In Bremen, the database of buildings (with location, map of the estate, construction history, architect, photos) is searchable and browsable online3, but that only helps users (...) who know how to use a rigidly structured database search form. Our beginning BauDenkMalNetz effort (“listed building web”) aims at a wider purpose: modeling the semantic structure of these data, starting in Bremen but open for other data, and exposing them via a semantic web interface with enhanced querying and presentation capabilities. Requirements beyond interactive browsing comprise auto-generation of customized printed guides (e. g. “Bauhaus villas in my neighborhood”), on-demand presentation on mobile devices (e. g. “medieval churches along my travel itinerary”), and serving linked data for usage by other services. (shrink)

Databases play a fundamental role in today’s world, being used by most companies, especially those that offer services through the Internet. Today there is a wide variety of database models, each adapted for use according to the specific requirements of each application. Traditionally, the relational models with centralized architectures have been used mostly due to their simplicity and general-purpose query language, which made relational systems suitable for almost any application. However, with the growth of the Internet in recent decades, (...) both in the number of users and in the amount of information, those centralized models began to suffer availability and scalability issues. To address those issues, the use of decentralized architectures and alternative database models began to arise, eventually replacing relational databases and centralized architectures when the requirements on availability and scalability are high. Those database models alternative to the traditional relational model are grouped under the name of NoSQL. In this article, we present a NoSQL database developed as an end of degree work, with a flexible data model based on documents and a fully decentralized architecture based on the Gossip protocol for node discovery and a distributed hash table, in particular the rendezvous hashing algorithm, used to distribute and replicate the data across all the nodes. The main goals of the system are to achieve high availability and high scalability. High availability is achieved thanks to the replication of the data, while high scalability is achieved by its decentralized architecture, which allows multiple entry points from the requests, and the data distribution, effectively increasing the database capacity by increasing the number of nodes. (shrink)

We define the logic FOTLT(n), to be a monadic monodic fragment of first-order linear temporal logic, with 2n propositions representing the read and write steps of n two-step concurrent database transactions and a time-dependent predicate representing queries giving the sets of data items accessed by those read and write steps at given points in time. The models of FOTLT(n) contain interleaved sequences of the steps of infinitely many occurrences of the n transactions accessing unlimited data over time. A property of (...) serializability is specified for FOTLT(n) formulae. We show that the serializability problem for FOTLT(n) formulae is decidable. (shrink)

The paper is devoted to applications of algebraic logic to databases. In databases a query is represented by a formula of first order logic. The same query can be associated with different formulas. Thus, a query is a class of equivalent formulae: equivalence here being similar to that in the transition to the Lindenbaum-Tarski algebra. An algebra of queries is identified with the corresponding algebra of logic. An algebra of replies to the queries is also associated with algebraic (...) logic. These relations lie at the core of the applications.In this paper it is shown how the theory of Halmos (polyadic) algebras (a notion introduced by Halmos as a tool in the algebraization of the first order predicate calculus) is used to create the algebraic model of a relational data base. The model allows us, in particular, to solve the problem of databases equivalence as well as develop a formal algebraic definition of a database's state description. In this paper we use the term "state description" for the logical description of the model. This description is based on the notion of filters in Halmos algebras. When speaking of a state description, we mean the description of a function which realizes the symbols of relations as real relations in the given system of data. (shrink)

In many areas, technology has facilitated many things, diagnosing diseases, regulating traffic and teaching students in schools rely on Intelligent systems to name a few. At present, traditional classroom-based education is no longer the most appropriate in schools. From here, the idea of intelligent e-learning for students to increase their culture and keep them updated in life began. E-learning has become an ideal solution, relying on artificial intelligence, which has a footprint in this through the development of systems based on (...) education without a teacher taking into account the individual differences of students. This study describes intelligent tutoring system for teaching the Data Manipulation Language (DML) Commands Using SQLite to non IT students to overcome the difficulties they face. The System was built as education system by using the researcher own authoring tool that based on mobile and web App. The basic idea of this system is a systematic introduction into the concept of Database and its DML query. The system presents the topic of DML Commands, help student to execute what they are learn from the system content using the practical part of the system and administers automatically adapted at run time to the student’s individual growth. The system was assessed by a group of teachers and students and the outcome showed as 91% from the database specialists, 94% from Diploma students group and 89% from the secondary school students group. (shrink)

The requirement for anthropocentric, or human-centred decision support is outlined, and the IDIOMS management information tool, which implements several human-centred principles, is described. IDIOMS provides a flexible decision support environment in which applications can be modelled using both ‘objective’ database information, and user-centred ‘subjective’ and contextual information. The system has been tested on several real applications, demonstrating its power and flexibility.

When analyzing database query languages a roperty, of theories, the pseudo-finite homogeneity property, has been introduced and applied (cf. [3]). We show that a stable theory has the pseudo-finite homogeneity property just in case its expressive power for finite states is bounded. Moreover, we introduce the corresponding pseudo-finite saturation property and show that a theory fails to have the finite cover property if and only if it has the pseudo-finite saturation property.

A Mathematical Introduction to Logic, Second Edition, offers increased flexibility with topic coverage, allowing for choice in how to utilize the textbook in a course. The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional (...) coverage of introductory material such as sets. Increased flexibility of the text, allowing instructors more choice in how they use the textbook in courses. Reduced mathematical rigour to fit the needs of undergraduate students. (shrink)

BackgroundElectronic patient record (EPR) technology is a key enabler for improvements to healthcare service and management. To ensure these improvements and the means to achieve them are socially and ethically desirable, careful consideration of the ethical implications of EPRs is indicated. The purpose of this scoping review was to map the literature related to the ethics of EPR technology. The literature review was conducted to catalogue the prevalent ethical terms, to describe the associated ethical challenges and opportunities, and to identify (...) the actors involved. By doing so, it aimed to support the future development of ethics guidance in the EPR domain.MethodsTo identify journal articles debating the ethics of EPRs, Scopus, Web of Science, and PubMed academic databases were queried and yielded 123 eligible articles. The following inclusion criteria were applied: articles need to be in the English language; present normative arguments and not solely empirical research; include an abstract for software analysis; and discuss EPR technology.ResultsThe medical specialty, type of information captured and stored in EPRs, their use and functionality varied widely across the included articles. Ethical terms extracted were categorised into clusters ‘privacy’, ‘autonomy’, ‘risk/benefit’, ‘human relationships’, and ‘responsibility’. The literature shows that EPR-related ethical concerns can have both positive and negative implications, and that a wide variety of actors with rights and/or responsibilities regarding the safe and ethical adoption of the technology are involved.ConclusionsWhile there is considerable consensus in the literature regarding EPR-related ethical principles, some of the associated challenges and opportunities remain underdiscussed. For example, much of the debate is presented in a manner more in keeping with a traditional model of healthcare and fails to take account of the multidimensional ensemble of factors at play in the EPR era and the consequent need to redefine/modify ethical norms to align with a digitally-enabled health service. Similarly, the academic discussion focuses predominantly on bioethical values. However, approaches from digital ethics may also be helpful to identify and deliberate about current and emerging EPR-related ethical concerns. (shrink)

A socioeconomic and demographic analysis of U.S. Google Trends for queries about Business Ethics and Greed is proposed in the context of the 2008 financial crisis. The framework is grounded in the ethical decision-making literature. Two models using micro and macro-type variables are tested using GLM and GEE regression techniques. The frequency of these Google queries varies positively with the ratio of females, educational attainment, younger adult age, some measures of economic hardship or inequalities, and the lesser the weight of (...) the finance industry represented in each State. The frequency of queries intensifies for these same socioeconomic and demographic categories, in the aftermath of the financial crisis. This article is the first to study the salience of business ethics as an issue in the empirical literature using a nationwide database. It also provides a first empirical study in the specialized literature on “ethics in a time of crisis”. This study lays a preliminary groundwork to identify pro-ethical reform segments of the population, with practical use for financial regulatory agencies. (shrink)

In this paper, we develop an organization method of page information agents for adaptive interface between a user and a Web search engine. Though a Web search engine indicates a hit list of Web pages to user’s query using a large database, they includes many useless ones. Thus a user has to select useful Web pages from them with page information indicated on the hit list, and actually fetch the Web page for investigating the relevance. Unfortunately, since the page information (...) on a hit list is neither sufficient nor necessary for a user, the adequate information is necessary for valid selection. However which information is adequate depends on a user and a task. Hence we propose adaptive interface AOAI in which different page information agents are organized through man-machine interaction. In AOAI, the page information agents indicating different page information on a hit list like the file-size, network traffic and a page title are prepared at first. A user evaluates them through searching with a search engine, and the agents are organized based on the evaluation. As results, different organizations are achieved depending on a user and a task. Finally we make experiments with subjects and find out AOAI is promising for adaptive interface between a user and a search engine. (shrink)

Background: Clinical ethics support services have been advocated in recent decades. In clinical practice, clinical ethics support services are often requested for difficult decisions near the end of life. However, their contribution to improving healthcare has been questioned and demands for evaluation have been put forward. Research indicates that there are considerable challenges associated with defining adequate outcomes for clinical ethics support services. In this systematic review, we report findings of qualitative studies and surveys, which have been conducted to evaluate (...) clinical ethics support services near the end of life. Methods: Electronic databases and other sources were queried from 1970 to May 2018. Two authors screened studies independently. Methodological quality of studies was assessed. For each arm of the review, an individual synthesis was performed. Prospero ID: CRD42016036241. Ethical Considerations: Ethical approval is not needed as it is a systematic review of published literature. Results: In all, 2088 hits on surveys and 2786 on qualitative studies were found. After screening, nine surveys and four qualitative studies were included. Survey studies report overall positive findings using a very wide and heterogeneous range of outcomes. Negative results were reported only occasionally. However, methodological quality and conceptual justification of used outcomes was often weak and limits generalizability of results. Conclusion: Evidence points to positive outcomes of clinical ethics support services. However, methodological quality needs to be improved. Further qualitative or mixed-method research on evaluating clinical ethics support services may contribute to the development of evaluating outcomes of clinical ethics support services by means of broaden the range of appropriate (process-oriented) outcomes of (different types of) clinical ethics support services. (shrink)

The rapid evolution of scientific research has created a pressing need for efficient and versatile tools to aid researchers. While using artificial intelligence (AI) to write scientific articles is unethical and unreliable due to the potential for inaccuracy, AI can be a valuable tool for assisting with other aspects of research, such as language editing, reference formatting, and journal finding. Two of the latest AI-driven assistants that have become indispensable assets to scientists are ChatGPT and Gemini (Bard). These assistants offer (...) comprehensive support from literature review to journal suggestion, and they have the potential to revolutionize research. In the present study, a comprehensive set of queries and responses were designed to assess the capabilities of ChatGPT-3.5 and Gemini as scientific assistants. The results showed that Gemini achieved a perfect score of 100%, while ChatGPT-3.5 scored a less impressive 70%. Notably, ChatGP-3.5 fell short in specific areas that includes providing assistance with scientific paper explanations, exploring bibliographic databases, and formatting references. The qualitative assessment of responses also suggests that both the AI chatbots can be valuable tools for researchers, however, Gemini seems to be more appealing and accurate through the whole procedure of scientific writing. This work shall open new research dimensions in identifying adequate scientific utilization of the evolving AI tools and technologies, as embracing these advancements will be essential for staying at the forefront of scientific research. (shrink)

We present a new framework for combining logic with probability, and demonstrate the application of this framework to breast cancer prognosis. Background knowledge concerning breast cancer prognosis is represented using logical arguments. This background knowledge and a database are used to build a Bayesian net that captures the probabilistic relationships amongst the variables. Causal hypotheses gleaned from the Bayesian net in turn generate new arguments. The Bayesian net can be queried to help decide when one argument attacks another. The Bayesian (...) net is used to perform the prognosis, while the argumentation framework is used to provide a qualitative explanation of the prognosis. (shrink)

Developing countries are endeavoring to advance into the 21st century information age. Their progress, however, is hamstrung by the dire lack of trained, skilled and knowledgeable IS workers who are able to interact with online and off‐line information sources. These countries can tap from the rich intellectual capital lying dormant within the ranks of disabled people to boost the pool of IS workers in their societies. However, before developing countries can draw on the information systems capabilities of disabled workers, these (...) workers themselves must be able to function at par with their able‐bodied counterparts as information workers. This presupposes the availability of special‐purpose information systems devices and approaches developed for disabled users. In this paper, therefore, we examine several issues that are pertinent to IS and disabled people in developing countries, and propose an integrated infrastructure to enhance the interaction of disabled people with on‐line information sources. The study includes issues related to the suitability of different interaction methodologies and technologies for people with disabilities. Additionally, we propose the design of customized interfaces that can be used by disabled people to develop Web‐based database applications and to access and query on‐line databases. (shrink)

An interlocking-directorates monitoring system The subject of the study was interlocking directorates in Polish joint stock companies. In order to explore this area a monitoring system has been developed which consists of a database and query system. Data is automatically introduced from printed announcements into the MySQL database using PHP scripts.The phenomenon of interlocking directorates in Polish joint stock companies is comparable with other countries. Board members in Poland are significantly younger than, for example, in the USA. Women constitute an (...) important group of board members. Insurance companies and investment funds are closely connected with other companies, but banks are not.The monitoring system developed enables us to identify who is, and who was, a board member of every joint stock company. It also enables us to identify, for every person, which board he or she now serves on, and has served on, in the past. The system also enables us to produce different reports concerning, for example, changes in certain indexes in subsequent years. The system is also accessible via the Internet. (shrink)

BackgroundUp-to-date information about the trends of age-related hearing loss and how this varies between countries is essential to plan for an adequate health-system response. Therefore, this study aimed to assess the research hotpots and trends in ARHL and to provide the basis and direction for future research.Materials and methodsThe Web of Science Core Collection database was searched and screened according to the inclusion criteria during 2002–2021. Bibliometric analyses were conducted by CiteSpace software and VOSviewer software.ResultsThe query identified 1,496 publications, which (...) showed a growth trend of this filed. These publications were from 62 countries, the United States of America showed its tremendous impact on this field in publication outputs, total citations, and international collaborations, China following in second. The Journal of Hearing Research was the most productive journal. Weijia Kong published the most papers, and the most productive institution was Washington University. The keyword “presbycusis” ranked first in research frontiers and appeared earlier, and the keywords “age-related hearing loss,” “risk,” “dementia,” “auditory cortex,” “association,” and “decline” began to appear in recent years.ConclusionThe annual number of publications has grown rapidly in the past two decades and will continue to grow. Epidemiological investigation and laboratory research are lasting hot spots, besides future research will focus on the association between ARHL and cognitive decline, dementia, and Alzheimer’s disease. (shrink)

In the context of the emerging Semantic Web and the quest for a common logical framework underpinning its architecture, the relation of rule-based languages such as Answer Set Programming (ASP) and ontology languages such as the Web Ontology Language (OWL) has attracted a lot of attention in the literature over the past years. With its roots in Deductive Databases and Datalog though, ASP shares much more commonality with another Semantic Web standard, namely the Simple Protocol and RDF Query Language (...) (SPARQL). In this paper, we take the recent approval of the SPARQL1.1 standard by the World Wide Web consortium (W3C) as an opportunity to introduce this standard to the Logic Programming community by providing a translation of SPARQL1.1 into ASP. In this translation, we explain and highlight peculiarities of the new W3C standard. Along the way, we survey existing literature on foundations of SPARQL and SPARQL1.1, and also combinations of SPARQL with ontology and rules languages. Thereby, apart from providing the means to implement and support SPARQL natively within Logic Programming engines and particularly ASP engines, we hope to pave the way for further research on a common logical framework for Semantic Web languages, including query languages, from an ASP point of view. (shrink)

We have been developed a support system to interactively search certain articles of users' interest on the World Wide Web without their hesitating over query choices. Especially we have been implementing an effective application system to enable tourists to easily find special event information of their interest and to enjoy their own tours. This system also enables developers of each system to provide them with the means of easily constructing an initial database and automatically updating it. As events are generally (...) held cyclically, we have assumed events or keywords related to the events will appear in each term. If we can extract keywords that appear cyclically in a corpus including date information, we can obtain event keywords easily. The system can extract event information using the event keywords as queries for WWW information retrieval systems, and update the database automatically. In this paper, we introduce our support system with a focus on a concept to extract event keywords and event information through the appearance of keywords periodically. We found our approach effective by some experiments. (shrink)

Streaming media server is the core system of audio and video application in the Internet; it has a wide range of applications in music recommendation. As song libraries and users of music websites and APPs continue to increase, user interaction data are generated at an increasingly fast rate, making the shortcomings of the original offline recommendation system and the advantages of the real-time streaming recommendation system more and more obvious. This paper describes in detail the working methods and contents of (...) each stage of the real-time streaming music recommendation system, including requirement analysis, overall design, implementation of each module of the system, and system testing and analysis, from a practical scenario. Moreover, this paper analyzes the current research status and deficiencies in the field of music recommendation by analyzing the user interaction data of real music websites. From the actual requirements of the system, the functional and performance goals of the system are proposed to address these deficiencies, and then the functional structure, general architecture, and database model of the system are designed, and how to interact with the server side and the client side is investigated. For the implementation of data collection and statistics module, this paper adopts Flume and Kafka to collect user behavior data and uses Spark Streaming and Redis to count music popularity trends and support efficient query. The recommendation engine module in this paper is designed and optimized using Spark to implement incremental matrix decomposition on data streams, online collaborative topic model, and improved item-based collaborative filtering algorithm. In the system testing section, the functionality and performance of the system are tested, and the recommendation engine is tested with real datasets to show the discovered music themes and analyze the test results in detail. (shrink)

Vehicular ad hoc network is a multihop mobile wireless communication network that can realize many vehicle-related applications through multitop communication. In the open wireless communication environment, security and privacy protection are important contents of VANET research. The most basic method of VANET privacy protection is anonymous authentication. Even through, there are many existing schemes to provide anonymous authentication for VANETs. Many existing schemes suffer from high computational cost by using bilinear pairing operation or need the assistance of the trust authorities (...) during the authentication process or rely on an ideal tamper-proof device, which requires very strong security assumption. In this study, an anonymous authentication and key negotiation scheme by using private key and group key is proposed, which is based on pseudonym using the nonsingular elliptic curve. In this scheme, there is no third party trust center to participate in the authentication, there is no need to query the database, and there is no need of the local database to save the identity information of many vehicles, which reduce the storage space and the authentication time compared with other schemes. The proposed scheme only needs realistic TPDs. In the proposed scheme, TPDs do not need to preinstall the system key as many other schemes do; hence, the failure of a single TPD does not affect the security of the entire system. The security of the scheme is proved under the random oracle model. Compared with the related schemes using bilinear pairings, the computational cost and communication cost of the proposed scheme are reduced by 82% and 50%, respectively. (shrink)

Formal principles governing best practices in classification and definition have for too long been neglected in the construction of biomedical ontologies, in ways which have important negative consequences for data integration and ontology alignment. We argue that the use of such principles in ontology construction can serve as a valuable tool in error-detection and also in supporting reliable manual curation. We argue also that such principles are a prerequisite for the successful application of advanced data integration techniques such as ontology-based (...) multi-database querying, automated ontology alignment and ontology-based text-mining. These theses are illustrated by means of a case study of the Gene Ontology, a project of increasing importance within the field of biomedical data integration. (shrink)

The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences that arise in databases. It has been shown that the syntax of GNFO is restrictive enough so that computational problems such as validity and satisfiability are still decidable. This suggests that, in spite of its expressive power, GNFO formulas are amenable to novel optimizations. In (...) this article we study the model theory of GNFO formulas. Our results include effective preservation theorems for GNFO, effective Craig Interpolation and Beth Definability results, and the ability to express the certain answers of queries with respect to a large class of GNFO sentences within very restricted logics. (shrink)

BackgroundSocially assistive devices (care robots, companions, smart screen assistants) have been advocated as a promising tool in elderly care in Western healthcare systems. Ethical debates indicate various challenges. One of the most prevalent arguments in the debate is the double-benefit argument claiming that socially assistive devices may not only provide benefits for autonomy and well-being of their users but might also be more efficient than other caring practices and might help to mitigate scarce resources in healthcare. Against this background, we (...) used a subset of comparative empirical studies from a comprehensive systematic review on effects and perceptions of human-machine interaction with socially assistive devices to gather and appraise all available evidence supporting this argument from the empirical side.MethodsElectronic databases and additional sources were queried using a comprehensive search strategy which generated 9851 records. Studies were screened independently by two authors. Methodological quality of studies was assessed. For 39 reports using a comparative study design, a narrative synthesis was performed.ResultsThe data shows positive evidential support to claim that some socially assistive devices (Paro) might be able to contribute to the well-being and autonomy of their users. However, results also indicate that these positive findings may be heavily dependent on the context of use and the population. In addition, we found evidence that socially assistive devices can have negative effects on certain populations. Evidence regarding the claim of efficiency is scarce. Existing results indicate that socially assistive devices can be more effective than standard of care but are far less effective than plush toys or placebo devices.DiscussionWe suggest using the double-benefit argument with great caution as it is not supported by the currently available evidence. The occurrence of potentially negative effects of socially assistive devices requires more research and indicates a more complex ethical calculus than suggested by the double-benefit argument. (shrink)

Two-player, zero-sum, non-cooperative, blindfold games in extensive form with incomplete information are considered in this paper. Any information about past moves which players played is stored in a database, and each player can access the database. A polynomial game is a game in which, at each step, all players withdraw at most a polynomial amount of previous information from the database. We show resource-bounded determinacy of some kinds of finite, zero-sum, polynomial games whose pay-off sets are computable by non-deterministic polynomial-time (...) function-oracle Turing machines. We call a pay-off set -determined if, for any polynomial game G associated with the given pay-off set, either player has a winning strategy which is in for any subgames of G. We show that there exists an FP-strongly-determined pay-off set which is computed by an exponential-time oracle Turing machine, where FP is the set of polynomial-time computable functions. We also discuss several relationships between the determinacy of polynomial games and recursion-theoretic properties for the classes co-NP and co-NEXP. We show that the polynomial version of the axiom of choice holds under some assumption of polynomial determinacy for a pay-off set which is polynomial-time computable with parallel queries. This principle of choice implies that co-NP has the separation property. (shrink)

Monoclonal antibodies are essential biomedical research and clinical reagents that are produced by companies and research laboratories. The NIAID ImmPort (Immunology Database and Analysis Portal) resource provides a long-term, sustainable data warehouse for immunological data generated by NIAID, DAIT and DMID funded investigators for data archiving and re-use. A variety of immunological data is generated using techniques that rely upon monoclonal antibody reagents, including flow cytometry, immunofluorescence, and ELISA. In order to facilitate querying, integration, and reuse of data, standardized (...) terminology for describing monoclonal antibody reagents and their targets needs to be used for annotating data submitted to ImmPort. (shrink)