The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Big data refers to data that is too large and complex to be processed. Big data handles voluminous amount of structured, semi structured and unstructured data with standard tools. Big Data also refers to the data where the volume, velocity or variety of data. It combines the historic data with the present data to predict the outcomes. In this regard, providing security for these data is a challenging...
Expert systems for classification tasks in medical diagnosis systems require two properties. The true positives should be very high, as well as the true negatives, i.e. the system should correctly catch those who are ill, and correctly dismiss those who are healthy. The multi-modal evolutionary classifier uses a genetic algorithm to learn a reference vector for each class, and classification is done...
Internet has to support applications with different requirements. Reliability is the essential requirement for file transfer whereas delay and jitter are the essential requirements of streaming applications. All layers contribute to the successful operation of the Internet. But the layer which has direct impact on the user of the service is the transport layer. TCP is robust protocol tuned to wired...
Centrality measures have many practical uses in network analysis, where closeness centrality is one of the original measures introduced by Freeman. Closeness centrality is a measure of how close a node is to all other nodes. Typically it is used as a measure of how fast information will spread from one node in a network to all other nodes, or, in a network planning situation which nodes are favorable...
Security protocols are a must for communication between parties. We studied and came up with new applications of Jordon Totient function and applied them to RSA public key cryptosystem and RSA Signature Scheme with one public key and two private keys, and proposed protocols for communication between two parties.
Digital Signature Scheme is very useful in communication between parties. We studied new applications of Jordon-Totient function and applied them to RSA Digital Signature Scheme and developed protocols for communication between two parties using java and shown the graphical performance analysis on test results for key generation time, encryption time and decryption time respectively.
This paper deals with study and development of Architecture to develop an initial phase expert system to provide secure diagnosis to the infectious patient and also propose some protocols using RMPJ2-RSA cryptosystem and signature scheme to provide confidentiality to the patient details.
This paper presents the design of Learner Integrated Data Exchange System for e-Learning based on Multi Prime-RSA(M-RSA) cryptosystem for E-Learning System transactions focusing on the electronic signing for e-admissions, certified e-mail, e-payment, e-material delivery and e-evaluation.
This paper presents the design of our proposed protocols using MJ2-RSA cryptosystem and signature scheme for invoking communication between Customer, Trader, Multi Level Trader and Bank for registration and generation of secret key, publication of public keys and distribution of private keys with ZTTP.
In this paper we give an analytic proof of the identity A5,3,3(n)=B5,3,30 (n), where A5,3,3(n) counts the number of partitions of n subject to certain restrictions on their parts, and B5,3,30 (n) counts the number of partitions of n subject to certain other restrictions on their parts, both too long to be stated in the abstract. Our proof establishes actually a refinement of that partition...
The theorem “ the number of partitions of a positive integer n into distinct odd parts equals the number of partitions of n into parts ≠2 and differing by ⩾6 with strict inequality if a part is even” was first discovered and then proved by Krishnaswamy Alladi in the year 1999. The object of this paper is to give a different bijective proof of this result.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.