1 Formal Logic with Conceptual Graphs 3 Frithjof Dau 1.

G(u,u',u") = 0, (1) where u = u(x, x,..., x), and u', u" denote all the first and second partial derivatives of u. For simplicity we will assume here that both u and G are scalars and denote by ua, uab, the partial derivatives dau and respectively dahu; a,b =1,2, ..., n+1. Let u (x) be a given solution of (1). Our equation is said to be elliptic or hyperbolic at u°(x) according to whether the (...

The current paper explores designing a web information retrieval system regarding the searching behavior of users in real and everyday life. Designing an information system that is closely linked to human behavior is equally important for providers and the end users.  From an Information Science point of view, four approaches in designing information retrieval systems were identified as system-...

We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a Reed-Solomon code of small field size. As a by-product of this result, we settle the GM-MDS conjecture of Dau et. al. in the affirmative.

One of the most important obstacles to using Internet banking is the lack of Stability of transactions and some misuse in the course of transactions it is financial. That is why preventing unauthorized access Crime detection is one of the major issues in financial institutions and banks. In this article, a system of intelligence has been designed that recognizes Suspicious and unusual behaviors...