Találati lista | Tudóstér

001-es BibID:	BIBFORM075643
035-os BibID:	(cikkazonosító)IJSARTV3I1218163
Első szerző:	Dubey, Shubham (informatikus)
Cím:	A proposed approach for cost optimization in authentication with o-auth services / S. Dubey, K. Mathur
Dátum:	2017
ISSN:	2395-1052
Megjegyzések:	It is the age of science when we need to get facilitated by a huge number of portals and/ or websites. The number of these websites is directly proportional to the number of accounts made by every user. This is creating data redundancy and/or unnecessary duplication of data in the web.There is always a need of a service which will work on centralized aces granting facility. A service in which login or sign in will be given through some other account made in other portal is called open authentication. Here during authentication third party plays a vital role. This paper is throwing light towards open authentication and cost optimized by it, with respect to simple authentication or authorization based services.
Tárgyszavak:	Műszaki tudományok Informatikai tudományok idegen nyelvű folyóiratközlemény külföldi lapban open authentication optimization authorization centralized
Megjelenés:	International Journal for Science and Advance Research in Technology. - 3 : 12 (2017), p. 327-331. -
További szerzők:	Mathur, Kirti
Internet cím:	Szerző által megadott URL Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon:

001-es BibID:	BIBFORM075639
Első szerző:	Dubey, Shubham (informatikus)
Cím:	Comparative performance analysis of binary search in sequential and parallel processing / Shubham Dubey, Kirti Mathur
Dátum:	2017
ISSN:	2321-9653
Megjegyzések:	In order to deal with huge data set alternative design with proper function is desirable. These functions may perform operations sorting, searching, updating DBMS frequently. Apart from time and space metrics, energy, pattern and size of input, exact match or approximations are also key issues to be considered. So there is versatile need to seek improvement for performance. Among state of art approaches binary search relies on divide and conquer approach explore key item at mid element of array after each iteration and accordingly moves interval to new sub range. In this paper an analysis of state of art bisection algorithm has been presented with certain parameters as effectively with some dynamic alteration in input. Further, analysis has been done with parallel processing.
Tárgyszavak:	Műszaki tudományok Informatikai tudományok idegen nyelvű folyóiratközlemény külföldi lapban
Megjelenés:	International Journal for Research in Applied Science and Engineering Technology. - 5 : 10 (2017), p. 1339-1347. -
További szerzők:	Mathur, Kirti
Internet cím:	Szerző által megadott URL DOI Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon: